72
72

Jun 26, 2018
06/18

by
Aleks Kissinger; Vladimir Zamdzhiev

texts

######
eye 72

######
favorite 0

######
comment 0

String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs give us the means of expressing and proving properties about whole families of these graphs simultaneously. While !-graphs provide elegant proofs of surprisingly powerful theorems, little is known about the formal properties of the graph languages they define....

Topics: Category Theory, Computing Research Repository, Mathematics, Logic in Computer Science, Formal...

Source: http://arxiv.org/abs/1501.06059

6
6.0

Jun 29, 2018
06/18

by
Anh Nguyen; Long Nguyen; Dong Nguyen; Uyen Le; Tuan Tran

texts

######
eye 6

######
favorite 0

######
comment 0

Recent studies have shown that information mined from Craigslist can be used for informing public health policy or monitoring risk behavior. This paper presents a text-mining method for conducting public health surveillance of marijuana use concerns in the U.S. using online classified ads in Craigslist. We collected more than 200 thousands of rental ads in the housing categories in Craigslist and devised text-mining methods for efficiently and accurately extract rental ads associated with...

Topics: Social and Information Networks, Computing Research Repository, Computers and Society

Source: http://arxiv.org/abs/1612.07630

51
51

Jun 26, 2018
06/18

by
Kat Krol; Eleni Philippou; Emiliano De Cristofaro; M. Angela Sasse

texts

######
eye 51

######
favorite 0

######
comment 0

To prevent password breaches and guessing attacks, banks increasingly turn to two-factor authentication (2FA), requiring users to present at least one more factor, such as a one-time password generated by a hardware token or received via SMS, besides a password. We can expect some solutions -- especially those adding a token -- to create extra work for users, but little research has investigated usability, user acceptance, and perceived security of deployed 2FA. This paper presents an in-depth...

Topics: Computing Research Repository, Human-Computer Interaction, Cryptography and Security

Source: http://arxiv.org/abs/1501.04434

2
2.0

Jun 29, 2018
06/18

by
David F. Manlove; Iain McBride; James Trimble

texts

######
eye 2

######
favorite 0

######
comment 0

The Hospitals / Residents problem with Couples (HRC) models the allocation of intending junior doctors to hospitals where couples are allowed to submit joint preference lists over pairs of (typically geographically close) hospitals. It is known that a stable matching need not exist, so we consider MIN BP HRC, the problem of finding a matching that admits the minimum number of blocking pairs (i.e., is "as stable as possible"). We show that this problem is NP-hard and difficult to...

Topics: Data Structures and Algorithms, Computing Research Repository

Source: http://arxiv.org/abs/1602.01956

18
18

Jun 29, 2018
06/18

by
Maria Spichkova

texts

######
eye 18

######
favorite 0

######
comment 0

This paper provides an overview of common challenges in teaching of logic and formal methods to Computer Science and IT students. We discuss our experiences from the course IN3050: Applied Logic in Engineering, introduced as a "logic for everybody" elective course at at TU Munich, Germany, to engage pupils studying Computer Science, IT and engineering subjects on Bachelor and Master levels. Our goal was to overcome the bias that logic and formal methods are not only very complicated...

Topics: Logic in Computer Science, Computing Research Repository, Computers and Society

Source: http://arxiv.org/abs/1612.01682

5
5.0

Jun 30, 2018
06/18

by
Tom Crick; Benjamin A. Hall; Samin Ishtiaq

texts

######
eye 5

######
favorite 0

######
comment 0

The reproduction and replication of novel results has become a major issue for a number of scientific disciplines. In computer science and related computational disciplines such as systems biology, the issues closely revolve around the ability to implement novel algorithms and approaches. Taking an approach from the literature and applying it to a new codebase frequently requires local knowledge missing from the published manuscripts and project websites. Alongside this issue, benchmarking, and...

Topics: Computing Research Repository, Software Engineering, Computational Engineering, Finance, and Science

Source: http://arxiv.org/abs/1407.5981

2
2.0

Jun 29, 2018
06/18

by
Daria A. Sushnikova; Ivan V. Oseledets

texts

######
eye 2

######
favorite 0

######
comment 0

We propose a new approximate factorization for solving linear systems with symmetric positive definite sparse matrices. In a nutshell the algorithm is to apply hierarchically block Gaussian elimination and additionally compress the fill-in. The systems that have efficient compression of the fill-in mostly arise from discretization of partial differential equations. We show that the resulting factorization can be used as an efficient preconditioner and compare the proposed approach with...

Topics: Numerical Analysis, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1603.09133

2
2.0

Jun 29, 2018
06/18

by
Michael Ruster

texts

######
eye 2

######
favorite 0

######
comment 0

This thesis focuses on gaining linguistic insights into textual discussions on a word level. It was of special interest to distinguish messages that constructively contribute to a discussion from those that are detrimental to them. Thereby, we wanted to determine whether "I"- and "You"-messages are indicators for either of the two discussion styles. These messages are nowadays often used in guidelines for successful communication. Although their effects have been...

Topics: Machine Learning, Statistics, Computation and Language, Computing Research Repository, Social and...

Source: http://arxiv.org/abs/1603.08048

3
3.0

Jun 29, 2018
06/18

by
Aamo Iorliam; Santosh Tirunagari; Anthony T. S. Ho; Shujun Li; Adrian Waller; Norman Poh

texts

######
eye 3

######
favorite 0

######
comment 0

Statistical characteristics of network traffic have attracted a significant amount of research for automated network intrusion detection, some of which looked at applications of natural statistical laws such as Zipf's law, Benford's law and the Pareto distribution. In this paper, we present the application of Benford's law to a new network flow metric "flow size difference", which have not been studied before by other researchers, to build an unsupervised flow-based intrusion...

Topics: Cryptography and Security, Artificial Intelligence, Networking and Internet Architecture, Computing...

Source: http://arxiv.org/abs/1609.04214

11
11

Jun 27, 2018
06/18

by
Alan Freihof Tygel; Judie Attard; Fabrizio Orlandi; Maria Luiza Machado Campos; Sören Auer

texts

######
eye 11

######
favorite 0

######
comment 0

A worldwide movement towards the publication of Open Government Data is taking place, and budget data is one of the key elements pushing this trend. Its importance is mostly related to transparency, but publishing budget data, combined with other actions, can also improve democratic participation, allow comparative analysis of governments and boost data-driven business. However, the lack of standards and common evaluation criteria still hinders the development of appropriate tools and the...

Topics: Databases, Computers and Society, Computing Research Repository

Source: http://arxiv.org/abs/1504.01563

5
5.0

Jun 30, 2018
06/18

by
Hamza Harkous; Karl Aberer

texts

######
eye 5

######
favorite 0

######
comment 0

Cloud storage services, like Dropbox and Google Drive, have growing ecosystems of 3rd party apps that are designed to work with users' cloud files. Such apps often request full access to users' files, including files shared with collaborators. Hence, whenever a user grants access to a new vendor, she is inflicting a privacy loss on herself and on her collaborators too. Based on analyzing a real dataset of 183 Google Drive users and 131 third party apps, we discover that collaborators inflict a...

Topics: Human-Computer Interaction, Cryptography and Security, Computing Research Repository

Source: http://arxiv.org/abs/1702.08234

2
2.0

Jun 30, 2018
06/18

by
Siddharth Pritam

texts

######
eye 2

######
favorite 0

######
comment 0

Team description paper for RoboCup 2014 Soccer Simulation League 2D.

Topics: Mathematics, Computing Research Repository, Information Theory

Source: http://arxiv.org/abs/1406.4943

2
2.0

Jun 30, 2018
06/18

by
Pulkit Grover

texts

######
eye 2

######
favorite 0

######
comment 0

Just as there are frictional losses associated with moving masses on a surface, what if there were frictional losses associated with moving information on a substrate? Indeed, many modes of communication suffer from such frictional losses. We propose to model these losses as proportional to "bit-meters," i.e., the product of mass of information (i.e., the number of bits) and the distance of information transport. We use this "information- friction" model to understand...

Topics: Mathematics, Computational Complexity, Computing Research Repository, Information Theory,...

Source: http://arxiv.org/abs/1401.1059

5
5.0

Jun 29, 2018
06/18

by
Tao Gu; Yanjing Wang

texts

######
eye 5

######
favorite 0

######
comment 0

Recent years witness a growing interest in nonstandard epistemic logics of "knowing whether", "knowing what", "knowing how", and so on. These logics are usually not normal, i.e., the standard axioms and reasoning rules for modal logic may be invalid. In this paper, we show that the conditional "knowing value" logic proposed by Wang and Fan \cite{WF13} can be viewed as a disguised normal modal logic by treating the negation of the Kv operator as a special...

Topics: Logic in Computer Science, Artificial Intelligence, Computing Research Repository

Source: http://arxiv.org/abs/1604.08709

2
2.0

Jun 30, 2018
06/18

by
Jian Tang; Ming Zhang; Qiaozhu Mei

texts

######
eye 2

######
favorite 0

######
comment 0

It has always been a burden to the users of statistical topic models to predetermine the right number of topics, which is a key parameter of most topic models. Conventionally, automatic selection of this parameter is done through either statistical model selection (e.g., cross-validation, AIC, or BIC) or Bayesian nonparametric models (e.g., hierarchical Dirichlet process). These methods either rely on repeated runs of the inference algorithm to search through a large range of parameter values...

Topics: Computing Research Repository, Computation and Language, Learning, Information Retrieval

Source: http://arxiv.org/abs/1409.2993

6
6.0

Jun 30, 2018
06/18

by
Weiguang Ding; Graham W. Taylor

texts

######
eye 6

######
favorite 0

######
comment 0

The human visual system is able to recognize objects despite transformations that can drastically alter their appearance. To this end, much effort has been devoted to the invariance properties of recognition systems. Invariance can be engineered (e.g. convolutional nets), or learned from data explicitly (e.g. temporal coherence) or implicitly (e.g. by data augmentation). One idea that has not, to date, been explored is the integration of latent variables which permit a search over a learned...

Topics: Computing Research Repository, Computer Vision and Pattern Recognition, Learning

Source: http://arxiv.org/abs/1406.3010

4
4.0

Jun 29, 2018
06/18

by
Thierry Petit

texts

######
eye 4

######
favorite 0

######
comment 0

Constraint Programming (CP) users need significant expertise in order to model their problems appropriately, notably to select propagators and search strategies. This puts the brakes on a broader uptake of CP. In this paper, we introduce MICE, a complete Java CP modeler that can use any Mixed Integer Linear Programming (MILP) solver as a solution technique. Our aim is to provide an alternative tool for democratizing the "CP-style" modeling thanks to its simplicity of use, with...

Topics: Artificial Intelligence, Computing Research Repository

Source: http://arxiv.org/abs/1611.08908

2
2.0

Jun 28, 2018
06/18

by
Pedro Saleiro; Luís Sarmento

texts

######
eye 2

######
favorite 0

######
comment 0

Encyclopedic queries express the intent of obtaining information typically available in encyclopedias, such as biographical, geographical or historical facts. In this paper, we train a classifier for detecting the encyclopedic intent of web queries. For training such a classifier, we automatically label training data from raw query logs. We use click-through data to select positive examples of encyclopedic queries as those queries that mostly lead to Wikipedia articles. We investigated a large...

Topics: Information Retrieval, Computing Research Repository

Source: http://arxiv.org/abs/1511.09290

2
2.0

Jun 29, 2018
06/18

by
Andreas Winter

texts

######
eye 2

######
favorite 0

######
comment 0

In the vein of the recent "pretty strong" converse for the quantum and private capacity of degradable quantum channels [Morgan/Winter, IEEE Trans. Inf. Theory 60(1):317-333, 2014], we use the same techniques, in particular the calculus of min-entropies, to show a pretty strong converse for the private capacity of degraded classical-quantum-quantum (cqq-)wiretap channels, which generalize Wyner's model of the degraded classical wiretap channel. While the result is not completely tight,...

Topics: Information Theory, Quantum Physics, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1601.06611

3
3.0

Jun 30, 2018
06/18

by
Li Sulimowicz; Ishfaq Ahmad

texts

######
eye 3

######
favorite 0

######
comment 0

The sheer volume and size of histopathological images (e.g.,10^6 MPixel) underscores the need for faster and more accurate Regions-of-interest (ROI) detection algorithms. In this paper, we propose such an algorithm, which has four main components that help achieve greater accuracy and faster speed: First, while using coarse-to-fine topology preserving segmentation as the baseline, the proposed algorithm uses a superpixel regularity optimization scheme for avoiding irregular and extremely small...

Topics: Computing Research Repository, Computer Vision and Pattern Recognition

Source: http://arxiv.org/abs/1704.02083

2
2.0

Jun 29, 2018
06/18

by
Junaid Qadir; Arjuna Sathiaseelan; Liang Wang; Jon Crowcroft

texts

######
eye 2

######
favorite 0

######
comment 0

We live in a world in which there is a great disparity between the lives of the rich and the poor. Technology offers great promise in bridging this gap. In particular, wireless technology unfetters developing communities from the constraints of infrastructure providing a great opportunity to leapfrog years of neglect and technological waywardness. In this paper, we highlight the role of resource pooling for wireless networks in the developing world. Resource pooling involves: (i) abstracting a...

Topics: Networking and Internet Architecture, Computing Research Repository

Source: http://arxiv.org/abs/1602.07808

6
6.0

Jun 27, 2018
06/18

by
William Radford; Matthias Gallé

texts

######
eye 6

######
favorite 0

######
comment 0

Film and television play an important role in popular culture, however studies that require watching and annotating video are time-consuming and expensive to run at scale. We explore information mined from media database cast lists to explore onscreen gender depictions and how they change over time. We find differences between web-mediated onscreen gender proportions and those from US Census data. We propose these methodologies are a useful adjunct to traditional analysis that allow researchers...

Topics: Computers and Society, Computing Research Repository

Source: http://arxiv.org/abs/1503.03275

5
5.0

Jun 29, 2018
06/18

by
Seyed Amir Tafrishi

texts

######
eye 5

######
favorite 0

######
comment 0

This paper introduces novel air actuated spherical robot called "RollRoller". The RollRoller robot consists of two essential parts: tubes covered with a shell as a frame and mechanical controlling parts to correspond movements. The RollRoller is proposed to be high potential alternative for exploration and rescue missions robots because robot utilizing its locomotion via all possible deriving methods (gravity, torque and angular momentum forces). In beginning , characteristic and role...

Topics: Computing Research Repository, Robotics

Source: http://arxiv.org/abs/1610.06043

3
3.0

Jun 30, 2018
06/18

by
Tom Crick; Benjamin A. Hall; Samin Ishtiaq; Kenji Takeda

texts

######
eye 3

######
favorite 0

######
comment 0

The reproduction and replication of reported scientific results is a hot topic within the academic community. The retraction of numerous studies from a wide range of disciplines, from climate science to bioscience, has drawn the focus of many commentators, but there exists a wider socio-cultural problem that pervades the scientific community. Sharing code, data and models often requires extra effort; this is currently seen as a significant overhead that may not be worth the time investment....

Topics: Computational Engineering, Finance, and Science, Computing Research Repository

Source: http://arxiv.org/abs/1409.0367

3
3.0

Jun 30, 2018
06/18

by
Sanghamitra Dutta; Viveck Cadambe; Pulkit Grover

texts

######
eye 3

######
favorite 0

######
comment 0

Faced with saturation of Moore's law and increasing dimension of data, system designers have increasingly resorted to parallel and distributed computing. However, distributed computing is often bottle necked by a small fraction of slow processors called "stragglers" that reduce the speed of computation because the fusion node has to wait for all processors to finish. To combat the effect of stragglers, recent literature introduces redundancy in computations across processors,...

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1704.05181

13
13

Jun 25, 2018
06/18

by
Rashied Amini

texts

######
eye 13

######
favorite 0

######
comment 0

The prospect of finding love may be scary but the prospect of committing to a relationship for the rest of your life is almost certainly scary. The secretary problem is a parallel to romantic decision making where an individual decides when to be satisfied with a selection choice in the face of uncertain future options. However, the secretary problem and its variations still do not provide a practical solution in a world where individual preference, goals, and societal context create a highly...

Topics: Social and Information Networks, Computing Research Repository

Source: http://arxiv.org/abs/1501.00637

2
2.0

Jun 29, 2018
06/18

by
Gemma Boleda; Sebastian Padó; Marco Baroni

texts

######
eye 2

######
favorite 0

######
comment 0

One of the most basic functions of language is to refer to objects in a shared scene. Modeling reference with continuous representations is challenging because it requires individuation, i.e., tracking and distinguishing an arbitrary number of referents. We introduce a neural network model that, given a definite description and a set of objects represented by natural images, points to the intended object if the expression has a unique referent, or indicates a failure, if it does not. The model,...

Topics: Artificial Intelligence, Computation and Language, Computing Research Repository, Learning

Source: http://arxiv.org/abs/1606.08777

4
4.0

Jun 30, 2018
06/18

by
Matías Lopez-Rosenfeld

texts

######
eye 4

######
favorite 0

######
comment 0

Millennials are arriving to university sometimes uncomfortable with the methods of some courses. Ideas that worked with previous generations of students begin to fail when digital natives receive paper and pencil as tools. Courses must update from old paper-based methods to hands-on and computerized versions. The present work discusses about this update and comments on one implementation in the course Computer Organization of the Computer Science curriculum at Universidad de Buenos Aires. It...

Topics: Computers and Society, Computing Research Repository

Source: http://arxiv.org/abs/1703.02944

9
9.0

Jun 28, 2018
06/18

by
Rémi Lebret; Ronan Collobert

texts

######
eye 9

######
favorite 0

######
comment 0

Recently, there has been a lot of effort to represent words in continuous vector spaces. Those representations have been shown to capture both semantic and syntactic information about words. However, distributed representations of phrases remain a challenge. We introduce a novel model that jointly learns word vector representations and their summation. Word representations are learnt using the word co-occurrence statistical information. To embed sequences of words (i.e. phrases) with different...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1506.05703

9
9.0

Jun 26, 2018
06/18

by
Habibur Rahman; Senjuti Basu Roy; Saravanan Thirumuruganathan; Sihem Amer-Yahia; Gautam Das

texts

######
eye 9

######
favorite 0

######
comment 0

In this work, we initiate the investigation of optimization opportunities in collaborative crowdsourcing. Many popular applications, such as collaborative document editing, sentence translation, or citizen science resort to this special form of human-based computing, where, crowd workers with appropriate skills and expertise are required to form groups to solve complex tasks. Central to any collaborative crowdsourcing process is the aspect of successful collaboration among the workers, which,...

Topics: Databases, Computing Research Repository

Source: http://arxiv.org/abs/1502.05106

2
2.0

Jun 30, 2018
06/18

by
Manaal Faruqui

texts

######
eye 2

######
favorite 0

######
comment 0

Named Entities (NEs) are often written with no orthographic changes across different languages that share a common alphabet. We show that this can be leveraged so as to improve named entity recognition (NER) by using unsupervised word clusters from secondary languages as features in state-of-the-art discriminative NER systems. We observe significant increases in performance, finding that person and location identification is particularly improved, and that phylogenetically close languages...

Topics: Computing Research Repository, Computation and Language

Source: http://arxiv.org/abs/1405.0701

4
4.0

Jun 28, 2018
06/18

by
Scott Ruoti; Jeff Andersen; Scott Heidbrink; Mark O'Neil; Elham Vaziripour; Justin Wu; Daniel Zappala; Kent Seamons

texts

######
eye 4

######
favorite 0

######
comment 0

Secure email is increasingly being touted as usable by novice users, with a push for adoption based on recent concerns about government surveillance. To determine whether secure email is for grassroots adoption, we employ a laboratory user study that recruits pairs of novice to install and use several of the latest systems to exchange secure messages. We present quantitative and qualitative results from 25 pairs of novice users as they use Pwm, Tutanota, and Virtru. Participants report being...

Topics: Cryptography and Security, Computing Research Repository, Human-Computer Interaction

Source: http://arxiv.org/abs/1510.08554

2
2.0

Jun 29, 2018
06/18

by
Roozbeh Mottaghi; Mohammad Rastegari; Abhinav Gupta; Ali Farhadi

texts

######
eye 2

######
favorite 0

######
comment 0

What happens if one pushes a cup sitting on a table toward the edge of the table? How about pushing a desk against a wall? In this paper, we study the problem of understanding the movements of objects as a result of applying external forces to them. For a given force vector applied to a specific location in an image, our goal is to predict long-term sequential movements caused by that force. Doing so entails reasoning about scene geometry, objects, their attributes, and the physical rules that...

Topics: Computer Vision and Pattern Recognition, Computing Research Repository

Source: http://arxiv.org/abs/1603.05600

2
2.0

Jun 29, 2018
06/18

by
Leila Arras; Franziska Horn; Grégoire Montavon; Klaus-Robert Müller; Wojciech Samek

texts

######
eye 2

######
favorite 0

######
comment 0

Text documents can be described by a number of abstract concepts such as semantic category, writing style, or sentiment. Machine learning (ML) models have been trained to automatically map documents to these abstract concepts, allowing to annotate very large text collections, more than could be processed by a human in a lifetime. Besides predicting the text's category very accurately, it is also highly desirable to understand how and why the categorization process takes place. In this paper, we...

Topics: Computation and Language, Information Retrieval, Machine Learning, Learning, Statistics, Computing...

Source: http://arxiv.org/abs/1612.07843

2
2.0

Jun 29, 2018
06/18

by
Marco Tulio Ribeiro; Sameer Singh; Carlos Guestrin

texts

######
eye 2

######
favorite 0

######
comment 0

Despite widespread adoption, machine learning models remain mostly black boxes. Understanding the reasons behind predictions is, however, quite important in assessing trust, which is fundamental if one plans to take action based on a prediction, or when choosing whether to deploy a new model. Such understanding also provides insights into the model, which can be used to transform an untrustworthy model or prediction into a trustworthy one. In this work, we propose LIME, a novel explanation...

Topics: Machine Learning, Statistics, Artificial Intelligence, Computing Research Repository, Learning

Source: http://arxiv.org/abs/1602.04938

3
3.0

Jun 30, 2018
06/18

by
Vinodh Krishnan; Jacob Eisenstein

texts

######
eye 3

######
favorite 0

######
comment 0

We present an unsupervised model for inducing signed social networks from the content exchanged across network edges. Inference in this model solves three problems simultaneously: (1) identifying the sign of each edge; (2) characterizing the distribution over content for each edge type; (3) estimating weights for triadic features that map to theoretical models such as structural balance. We apply this model to the problem of inducing the social function of address terms, such as 'Madame',...

Topics: Physics, Computing Research Repository, Physics and Society, Social and Information Networks

Source: http://arxiv.org/abs/1411.4351

2
2.0

Jun 28, 2018
06/18

by
Suman Kalyan Maity; Ritvik Saraf; Animesh Mukherjee

texts

######
eye 2

######
favorite 0

######
comment 0

Compounding of natural language units is a very common phenomena. In this paper, we show, for the first time, that Twitter hashtags which, could be considered as correlates of such linguistic units, undergo compounding. We identify reasons for this compounding and propose a prediction model that can identify with 77.07% accuracy if a pair of hashtags compounding in the near future (i.e., 2 months after compounding) shall become popular. At longer times T = 6, 10 months the accuracies are 77.52%...

Topics: Social and Information Networks, Computing Research Repository

Source: http://arxiv.org/abs/1510.00249

13
13

Jun 27, 2018
06/18

by
Walid Magdy; Kareem Darwish; Ingmar Weber

texts

######
eye 13

######
favorite 0

######
comment 0

Within a fairly short amount of time, the Islamic State of Iraq and Syria (ISIS) has managed to put large swaths of land in Syria and Iraq under their control. To many observers, the sheer speed at which this "state" was established was dumbfounding. To better understand the roots of this organization and its supporters we present a study using data from Twitter. We start by collecting large amounts of Arabic tweets referring to ISIS and classify them into pro-ISIS and anti-ISIS. This...

Topics: Physics and Society, Computing Research Repository, Social and Information Networks, Physics

Source: http://arxiv.org/abs/1503.02401

24
24

Jun 27, 2018
06/18

by
Yelena Mejova; Hamed Haddadi; Anastasios Noulas; Ingmar Weber

texts

######
eye 24

######
favorite 0

######
comment 0

We present a large-scale analysis of Instagram pictures taken at 164,753 restaurants by millions of users. Motivated by the obesity epidemic in the United States, our aim is three-fold: (i) to assess the relationship between fast food and chain restaurants and obesity, (ii) to better understand people's thoughts on and perceptions of their daily dining experiences, and (iii) to reveal the nature of social reinforcement and approval in the context of dietary health on social media. When we...

Topics: Computers and Society, Computing Research Repository

Source: http://arxiv.org/abs/1503.01546

4
4.0

Jun 29, 2018
06/18

by
Jisun An; Ingmar Weber

texts

######
eye 4

######
favorite 0

######
comment 0

Demographics, in particular, gender, age, and race, are a key predictor of human behavior. Despite the significant effect that demographics plays, most scientific studies using online social media do not consider this factor, mainly due to the lack of such information. In this work, we use state-of-the-art face analysis software to infer gender, age, and race from profile images of 350K Twitter users from New York. For the period from November 1, 2014 to October 31, 2015, we study which...

Topics: Computing Research Repository, Social and Information Networks

Source: http://arxiv.org/abs/1603.01973

4
4.0

Jun 29, 2018
06/18

by
Peter Potash; Alexey Romanov; Anna Rumshisky

texts

######
eye 4

######
favorite 0

######
comment 0

In this work, we present a new dataset for computational humor, specifically comparative humor ranking, which attempts to eschew the ubiquitous binary approach to humor detection. The dataset consists of tweets that are humorous responses to a given hashtag. We describe the motivation for this new dataset, as well as the collection process, which includes a description of our semi-automated system for data collection. We also present initial experiments for this dataset using both unsupervised...

Topics: Computation and Language, Computing Research Repository

Source: http://arxiv.org/abs/1612.03216

8
8.0

Jun 28, 2018
06/18

by
Bang Hui Lim; Dongyuan Lu; Tao Chen; Min-Yen Kan

texts

######
eye 8

######
favorite 0

######
comment 0

We study how users of multiple online social networks (OSNs) employ and share information by studying a common user pool that use six OSNs - Flickr, Google+, Instagram, Tumblr, Twitter, and YouTube. We analyze the temporal and topical signature of users' sharing behaviour, showing how they exhibit distinct behaviorial patterns on different networks. We also examine cross-sharing (i.e., the act of user broadcasting their activity to multiple OSNs near-simultaneously), a previously-unstudied...

Topics: Social and Information Networks, Computing Research Repository

Source: http://arxiv.org/abs/1507.03510

2
2.0

Jun 29, 2018
06/18

by
Alexey Milovanov

texts

######
eye 2

######
favorite 0

######
comment 0

We improve and simplify the result of the part 4 of "Counting curves and their projections" (Joachim von zur Gathen, Marek Karpinski, Igor Shparlinski) by showing that counting roots of a sparse polynomial over $\mathbb{F}_{2^n}$ is #P- and $\oplus$P-complete under deterministic reductions.

Topics: Computational Complexity, Computing Research Repository

Source: http://arxiv.org/abs/1608.07564

2
2.0

Jun 29, 2018
06/18

by
Fatema Akbar; Ingmar Weber

texts

######
eye 2

######
favorite 0

######
comment 0

Social media enjoys a growing popularity as a platform to seek and share personal health information. For sleep studies using data from social media, most researchers focused on inferring sleep-related artifacts from self-reported anecdotal pointers to sleep patterns or issues such as insomnia. The data shared by "quantified-selfers" on social media presents an opportunity to study more quantitative and objective measures of sleep. We propose and validate the approach of collecting...

Topics: Human-Computer Interaction, Computing Research Repository, Computers and Society

Source: http://arxiv.org/abs/1607.06359

3
3.0

Jun 30, 2018
06/18

by
Yaroslav Ganin; Victor Lempitsky

texts

######
eye 3

######
favorite 0

######
comment 0

We propose a new architecture for difficult image processing operations, such as natural edge detection or thin object segmentation. The architecture is based on a simple combination of convolutional neural networks with the nearest neighbor search. We focus our attention on the situations when the desired image transformation is too hard for a neural network to learn explicitly. We show that in such situations, the use of the nearest neighbor search on top of the network output allows to...

Topics: Computing Research Repository, Computer Vision and Pattern Recognition

Source: http://arxiv.org/abs/1406.6558

10
10.0

Jun 27, 2018
06/18

by
Mohammad Ashraf; Ghulam Mohammad

texts

######
eye 10

######
favorite 0

######
comment 0

Let $R=\mathbb{Z}_4+u\mathbb{Z}_4,$ where $\mathbb{Z}_4$ denotes the ring of integers modulo $4$ and $u^2=0$. In the present paper, we introduce a new Gray map from $R^n$ to $\mathbb{Z}_{4}^{2n}.$ We study $(1+2u)$-constacyclic codes over $R$ of odd lengths with the help of cyclic codes over $R$. It is proved that the Gray image of $(1+2u)$-constacyclic codes of length $n$ over $R$ are cyclic codes of length $2n$ over $\mathbb{Z}_4$. Further, a number of linear codes over $\mathbb{Z}_4$ as the...

Topics: Information Theory, Rings and Algebras, Mathematics, Computing Research Repository

Source: http://arxiv.org/abs/1504.03445

3
3.0

Jun 30, 2018
06/18

by
Arijit Bishnu; Kunal Dutta; Arijit Ghosh; Subhabrata Paul

texts

######
eye 3

######
favorite 0

######
comment 0

A subset $D \subseteq V $of a graph $G = (V, E)$ is a $(1, j)$-set if every vertex $v \in V \setminus D$ is adjacent to at least $1$ but not more than $j$ vertices in D. The cardinality of a minimum $(1, j)$-set of $G$, denoted as $\gamma_{(1,j)} (G)$, is called the $(1, j)$-domination number of $G$. Given a graph $G = (V, E)$ and an integer $k$, the decision version of the $(1, j)$-set problem is to decide whether $G$ has a $(1, j)$-set of cardinality at most $k$. In this paper, we first...

Topics: Mathematics, Discrete Mathematics, Computing Research Repository, Combinatorics

Source: http://arxiv.org/abs/1410.3091

18
18

Jun 28, 2018
06/18

by
Hojjat Mostafanasab; Negin Karimi

texts

######
eye 18

######
favorite 0

######
comment 0

Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^2)$-constacyclic codes over the ring $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p$, where $u^3=u$. We describe generator polynomials of this kind of codes and investigate the structural properties of these codes by a decomposition theorem.

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1506.07273

3
3.0

Jun 28, 2018
06/18

by
Zahid Raza; Amrina Rana

texts

######
eye 3

######
favorite 0

######
comment 0

Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^k)$-constacyclic codes over the ring $\mathcal{R}=\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p+u^{3}\mathbb{F}_{p}+\cdots+u^{k}\mathbb{F}_{p}$ where $u^{k+1}=u$. We illustrate the generator polynomials and investigate the structural properties of these codes via decomposition theorem.

Topics: Information Theory, Computing Research Repository, Mathematics

Source: http://arxiv.org/abs/1512.02332

13
13

Jun 28, 2018
06/18

by
Therese Biedl; Martin Derka

texts

######
eye 13

######
favorite 0

######
comment 0

Planar partial $3$-trees are subgraphs of those planar graphs obtained by repeatedly inserting a vertex of degree $3$ into a face. In this paper, we show that planar partial $3$-trees have $1$-string $B_1$-VPG representations, i.e., representations where every vertex is represented by an orthogonal curve with at most one bend, every two curves intersect at most once, and intersections of curves correspond to edges in the graph. We also that some subclasses of planar partial 3-trees have...

Topics: Computational Geometry, Computing Research Repository, Discrete Mathematics, Data Structures and...

Source: http://arxiv.org/abs/1506.07246