SoroushVahidi/scidocs huggingface dataset:
Liability and Computer Security: Nine Principles
(1994)

The conventional wisdom is that security priorities should be set by risk analysis. However, reality is subtly different: many computer security systems are at least as much about shedding liability as about minimising risk. Banks use computer security mechanisms to transfer liability to their customers; companies use them to transfer liability to their insurers, or (via the public prosecutor) to the taxpayer; and they are also used to shift the blame to other departments (“we did everything that GCHQ/the internal auditors told us to”). We derive nine principles which might help designers avoid the most common pitfalls.
When Sparse Traditional Models Outperform Dense Neural Networks: the Curious Case of Discriminating between Similar Languages
(2017)

We present the results of our participation in the VarDial 4 shared task on discriminating closely related languages. Our submission includes simple traditional models using linear support vector machines (SVMs) and a neural network (NN). The main idea was to leverage language group information. We did so with a two-layer approach in the traditional model and a multi-task objective in the neural network. Our results confirm earlier findings: simple traditional models outperform neural networks consistently for this task, at least given the amount of systems we could examine in the available time. Our two-layer linear SVM ranked 2nd in the shared task.
RAN: Radical analysis networks for zero-shot learning of Chinese characters
(2017)

Chinese characters have a huge set of character categories, more than 20,000 and the number is still increasing as more and more novel characters continue being created. However, the enormous characters can be decomposed into a few fundamental structural radicals, only about 500. This paper introduces the Radical Analysis Networks (RAN) that recognize Chinese characters by identifying radicals and analyzing 2D spatial structures between them. The proposed RAN first extracts visual features from Chinese character input by employing convolutional neural networks as an encoder. Then a decoder based on recurrent neural networks is employed, who aims to generate a caption of Chinese character by detecting radicals and 2D structures through a spatial attention mechanism. The manner of treating Chinese character input as a composition of radicals rather than a single picture severely reduces the size of vocabulary and enables RAN to possess the ability of recognizing unseen Chinese character classes only if their radicals have been seen, called zero-shot learning. We test a simple implementation of RAN on experiments of recognizing printed Chinese characters with seen and unseen classes and RAN simultaneously obtains convincing performance on unseen classes and state-of-the-art performance on seen classes.
Age-Invariant Face Recognition
(2010)

One of the challenges in automatic face recognition is to achieve temporal invariance. In other words, the goal is to come up with a representation and matching scheme that is robust to changes due to facial aging. Facial aging is a complex process that affects both the 3D shape of the face and its texture (e.g., wrinkles). These shape and texture changes degrade the performance of automatic face recognition systems. However, facial aging has not received substantial attention compared to other facial variations due to pose, lighting, and expression. We propose a 3D aging modeling technique and show how it can be used to compensate for the age variations to improve the face recognition performance. The aging modeling technique adapts view-invariant 3D face models to the given 2D face aging database. The proposed approach is evaluated on three different databases (i.g., FG-NET, MORPH, and BROWNS) using FaceVACS, a state-of-the-art commercial face recognition engine.
Improving the reliability of commodity operating systems
(2003)

Despite decades of research in extensible operating system technology, extensions such as device drivers remain a significant cause of system failures. In Windows XP, for example, drivers account for 85&percent; of recently reported failures.This article describes Nooks, a reliability subsystem that seeks to greatly enhance operating system (OS) reliability by isolating the OS from driver failures. The Nooks approach is practical: rather than guaranteeing complete fault tolerance through a new (and incompatible) OS or driver architecture, our goal is to prevent the vast majority of driver-caused crashes with little or no change to the existing driver and system code. Nooks isolates drivers within lightweight protection domains inside the kernel address space, where hardware and software prevent them from corrupting the kernel. Nooks also tracks a driver's use of kernel resources to facilitate automatic cleanup during recovery.To prove the viability of our approach, we implemented Nooks in the Linux operating system and used it to fault-isolate several device drivers. Our results show that Nooks offers a substantial increase in the reliability of operating systems, catching and quickly recovering from many faults that would otherwise crash the system. Under a wide range and number of fault conditions, we show that Nooks recovers automatically from 99&percent; of the faults that otherwise cause Linux to crash.While Nooks was designed for drivers, our techniques generalize to other kernel extensions. We demonstrate this by isolating a kernel-mode file system and an in-kernel Internet service. Overall, because Nooks supports existing C-language extensions, runs on a commodity operating system and hardware, and enables automated recovery, it represents a substantial step beyond the specialized architectures and type-safe languages required by previous efforts directed at safe extensibility.
Algebraic gossip: a network coding approach to optimal multiple rumor mongering
(2006)

The problem of simultaneously disseminating <i>k</i> messages in a large network of <i>n</i> nodes, in a decentralized and distributed manner, where nodes only have knowledge about their own contents, is studied. In every discrete time-step, each node selects a communication partner randomly, uniformly among all nodes and only one message can be transmitted. The goal is to disseminate rapidly, with high probability, all messages to all nodes. It is shown that a random linear coding (RLC) based protocol disseminates all messages to all nodes in time <i>ck + O</i> (√<i>k</i> ln(<i>k</i>) ln(<i>n</i>)), where <i>c</i> < 3.46 using pull-based dissemination and <i>c</i> < 5.96 using push-based dissemination. Simulations suggest that <i>c</i> < 2 might be a tighter bound. Thus, if <i>k</i> ≫ (ln(<i>n</i>))<sup>3</sup>, the time for simultaneous dissemination RLC is asymptotically at most <i>ck</i>, versus the Ω(<i>k</i> log<inf>2</inf>(<i>n</i>))<sup>3</sup> time of sequential dissemination. Furthermore, when <i>k</i> ≫ (ln(<i>n</i>))<sup>3</sup>, the dissemination time is order optimal. When <i>k</i> ≪ (ln(<i>n</i>))<sup>2</sup>, RLC reduces dissemination time by a factor of Ω(√<i>k</i>/ln <i>k</i>) over sequential dissemination. The overhead of the RLC protocol is negligible for messages of reasonable size. A store-and-forward mechanism without coding is also considered. It is shown that this approach performs no better than a sequential approach when <i>k</i>=∞ <i>n</i>. Owing to the distributed nature of the system, the proof requires analysis of an appropriate time-varying Bernoulli process.
Characterizing Variation in Crowd-Sourced Data for Training Neural Language Generators to Produce Stylistically Varied Outputs
(2018)

One of the biggest challenges of endto-end language generation from meaning representations in dialogue systems is making the outputs more natural and varied. Here we take a large corpus of 50K crowd-sourced utterances in the restaurant domain and develop text analysis methods that systematically characterize types of sentences in the training data. We then automatically label the training data to allow us to conduct two kinds of experiments with a neural generator. First, we test the effect of training the system with different stylistic partitions and quantify the effect of smaller, but more stylistically controlled training data. Second, we propose a method of labeling the style variants during training, and show that we can modify the style of the generated utterances using our stylistic labels. We contrast and compare these methods that can be used with any existing large corpus, showing how they vary in terms of semantic quality and
Deep Supervised Hashing for Fast Image Retrieval
(2016)

In this paper, we present a new hashing method to learn compact binary codes for highly efficient image retrieval on large-scale datasets. While the complex image appearance variations still pose a great challenge to reliable retrieval, in light of the recent progress of Convolutional Neural Networks (CNNs) in learning robust image representation on various vision tasks, this paper proposes a novel Deep Supervised Hashing (DSH) method to learn compact similarity-preserving binary code for the huge body of image data. Specifically, we devise a CNN architecture that takes pairs of images (similar/dissimilar) as training inputs and encourages the output of each image to approximate discrete values (e.g. +1/-1). To this end, a loss function is elaborately designed to maximize the discriminability of the output space by encoding the supervised information from the input image pairs, and simultaneously imposing regularization on the real-valued outputs to approximate the desired discrete values. For image retrieval, new-coming query images can be easily encoded by propagating through the network and then quantizing the network outputs to binary codes representation. Extensive experiments on two large scale datasets CIFAR-10 and NUS-WIDE show the promising performance of our method compared with the state-of-the-arts.
A Hybrid Cryptosystem Based On Vigenere Cipher and Columnar Transposition Cipher
(2013)

Privacy is one of the key issues addressed by information Security. Through cryptographic encryption methods, one can prevent a third party from understanding transmitted raw data over unsecured channel during signal transmission. The cryptographic methods for enhancing the security of digital contents have gained high significance in the current era. Breach of security and misuse of confidential information that has been intercepted by unauthorized parties are key problems that information security tries to solve. This paper sets out to contribute to the general body of knowledge in the area of classical cryptography by developing a new hybrid way of encryption of plaintext. The cryptosystem performs its encryption by encrypting the plaintext using columnar transposition cipher and further using the ciphertext to encrypt the plaintext again using Vigenère cipher. At the end, cryptanalysis was performed on the ciphertext. The implementation will be done using java programming.
Trojan data layouts: right shoes for a running elephant
(2011)

MapReduce is becoming ubiquitous in large-scale data analysis. Several recent works have shown that the performance of Hadoop MapReduce could be improved, for instance, by creating indexes in a non-invasive manner. However, they ignore the impact of the data layout used inside data blocks of Hadoop Distributed File System (HDFS). In this paper, we analyze different data layouts in detail in the context of MapReduce and argue that Row, Column, and PAX layouts can lead to poor system performance. We propose a new data layout, coined Trojan Layout, that internally organizes data blocks into attribute groups according to the workload in order to improve data access times. A salient feature of Trojan Layout is that it fully preserves the fault-tolerance properties of MapReduce. We implement our Trojan Layout idea in HDFS 0.20.3 and call the resulting system Trojan HDFS. We exploit the fact that HDFS stores multiple replicas of each data block on different computing nodes. Trojan HDFS automatically creates a different Trojan Layout per replica to better fit the workload. As a result, we are able to schedule incoming MapReduce jobs to data block replicas with the most suitable Trojan Layout. We evaluate our approach using three real-world workloads. We compare Trojan Layouts against Hadoop using Row and PAX layouts. The results demonstrate that Trojan Layout allows MapReduce jobs to read their input data up to 4.8 times faster than Row layout and up to 3.5 times faster than PAX layout.
DBpedia - A large-scale, multilingual knowledge base extracted from Wikipedia
(2015)

The DBpedia community project extracts structured, multilingual knowledge from Wikipedia and makes it freely available on the Web using Semantic Web and Linked Data technologies. The project extracts knowledge from 111 different language editions of Wikipedia. The largest DBpedia knowledge base which is extracted from the English edition of Wikipedia consists of over 400 million facts that describe 3.7 million things. The DBpedia knowledge bases that are extracted from the other 110 Wikipedia editions together consist of 1.46 billion facts and describe 10 million additional things. The DBpedia project maps Wikipedia infoboxes from 27 different language editions to a single shared ontology consisting of 320 classes and 1,650 properties. The mappings are created via a world-wide crowd-sourcing effort and enable knowledge from the different Wikipedia editions to be combined. The project publishes releases of all DBpedia knowledge bases for download and provides SPARQL query access to 14 out of the 111 language editions via a global network of local DBpedia chapters. In addition to the regular releases, the project maintains a live knowledge base which is updated whenever a page in Wikipedia changes. DBpedia sets 27 million RDF links pointing into over 30 external data sources and thus enables data from these sources to be used together with DBpedia data. Several hundred data sets on the Web publish RDF links pointing to DBpedia themselves and make DBpedia one of the central interlinking hubs in the Linked Open Data (LOD) cloud. In this system report, we give an overview of the DBpedia community project, including its architecture, technical implementation, maintenance, internationalisation, usage statistics and applications.
RelFinder: Revealing Relationships in RDF Knowledge Bases
(2009)

The Semantic Web has recently seen a rise of large knowledge bases (such as DBpedia) that are freely accessible via SPARQL endpoints. The structured representation of the contained information opens up new possibilities in the way it can be accessed and queried. In this paper, we present an approach that extracts a graph covering relationships between two objects of interest. We show an interactive visualization of this graph that supports the systematic analysis of the found relationships by providing highlighting, previewing, and filtering features.
Hole-filling Based on Disparity Map and Inpainting for Depth- Image-Based Rendering
(2016)

Due to the changes in viewpoint, holes may appear in the novel view synthesized by depth-image-based rendering (DIBR). A hole-filling method combining disparity-mapbased hole-filling and inpainting is proposed. The method first eliminates matching errors in destination image according to the disparity map. Then, holes are classified into different types according to their sizes. Finally, a disparity-map-based approach and an improved exemplar-based inpainting algorithm are used to fill different types of holes according to the type of hole. Experimental results show that the artifacts at the edge of foreground objects can be reduced in synthesized view since the matching errors are eliminated before hole-filling. In addition, the proposed method can achieve more natural and satisfactory results in filled areas in comparison with the disparity-mapbased approach and Gautier’s inpainting algorithm, though it may result in higher time complexity. Keyword: Depth-image-based Rendering, Hole-filling, Holes, Disparity Map, Inpainting
A Case for Standard Non-blocking Collective Operations
(2007)

In this paper we make the case for adding standard nonblocking collective operations to the MPI standard. The non-blocking point-to-point and blocking collective operations currently defined by MPI provide important performance and abstraction benefits. To allow these benefits to be simultaneously realized, we present an application programming interface for non-blocking collective operations in MPI. Microbenchmark and application-based performance results demonstrate that non-blocking collective operations offer not only improved convenience, but improved performance as well, when compared to manual use of threads with blocking collectives.
Designing for collaborative creative problem solving
(2007)

Collaborative creativity is traditionally supported by formal techniques, such as brainstorming. These techniques improve the idea-generation process by creating group synergies, but also suffer from a number of negative effects. Current electronic tools to support collaborative creativity overcome some of these problems, but introduce new ones, by either losing the benefits of face-to-face communication or the immediacy of simultaneous contribution. Using an interactive environment as a test bed, we are investigating how collaborative creativity can be supported electronically while maintaining face-to-face communication. What are the design-factors influencing such a system? We have designed a brainstorming application that uses an interactive table and a large wall display, and compared the results of using it to traditional paper-based brainstorming in a user study with 30 participants. From the considerations that went into the design and the observations during the study we derive a number of design guidelines for collaborative systems in interactive environments.
Decision feedback equalization
(1979)

As real world communication channels are stressed with higher data rates, intersymbol interference (ISI) becomes a dominant limiting factor. One way to combat this effect that has recently received considerable attention is the use of a decision feedback equalizer (DFE) in the receiver. The action of the DFE is to feed back a weighted sum of past decision to cancel the ISI they cause in the present signaling interval. This paper summarizes the work in this area beginning with the linear equalizer. Three performance criteria have been used to derive optimum systems; 1) minimize the noise variance under a "zero forcing" (ZF) constraint i.e., insist that all intersymbol interference is cancelled, 2) minimize the mean-square error (MMSE) between the true sample and the observed signal just prior to the decision threshold, and 3) minimize the probability of error (Min Pe). The transmitter can be fixed and the receiver optimized or one can obtain the joint optimum transmitter and receiver. The number of past decisions used in the feedback equalization can be finite or infinite. The infinite case is easier to handle analytically. In addition to reviewing the work done in the area, we show that the linear equalizer is in fact a portion of the DFE receiver and that the processing done by the DFE is exactly equivalent to the general problem of linear prediction. Other similarities in the various system structures are also shown. The effect of error propagation due to incorrect decisions is discussed, and the coaxial cable channel is used as an example to demonstrate the improvement available using DFE.
Web evolution and Web Science
(2012)

This paper examines the evolution of the World Wide Web as a network of networks and discusses the emergence of Web Science as an interdisciplinary area that can provide us with insights on how the Web developed, and how it has affected and is affected by society. Through its different stages of evolution, the Web has gradually changed from a technological network of documents to a network where documents, data, people and organisations are interlinked in various and often unexpected ways. It has developed from a technological artefact separate from people to an integral part of human activity that is having an increasingly significant impact on the world. This paper outlines the lessons from this retrospective examination of the evolution of the Web, presents the main outcomes of Web Science activities and discusses directions along which future developments could be anticipated.
Self-taught clustering
(2008)

This paper focuses on a new clustering task, called self-taught clustering. Self-taught clustering is an instance of unsupervised transfer learning, which aims at clustering a small collection of target unlabeled data with the help of a large amount of auxiliary unlabeled data. The target and auxiliary data can be different in topic distribution. We show that even when the target data are not sufficient to allow effective learning of a high quality feature representation, it is possible to learn the useful features with the help of the auxiliary data on which the target data can be clustered effectively. We propose a co-clustering based self-taught clustering algorithm to tackle this problem, by clustering the target and auxiliary data simultaneously to allow the feature representation from the auxiliary data to influence the target data through a common set of features. Under the new data representation, clustering on the target data can be improved. Our experiments on image clustering show that our algorithm can greatly outperform several state-of-the-art clustering methods when utilizing irrelevant unlabeled auxiliary data.
Towards a questionnaire for measuring affective benefits and costs of communication technologies
(2014)

As CSCW creates and investigates technologies for social communication, it is important to understand the emotional benefits and costs of these systems. We propose the Affec-tive Benefits and Costs of Communication Technologies (ABCCT) questionnaire to supplement traditional qualita-tive methods of understanding communication media. We discuss the pilots of this survey with 45 children and 110 adults measuring the inter-item reliability of this instru-ment. We present the results of interviews with 14 children and 14 adults, which help confirm that the ABCCT measures the same constructs that may emerge through interview investigations. Finally, we demonstrate that the ABCCT is sensitive enough to discriminate between differ-ent communication technologies and has shown promise in some of its early adoption. Though the ABCCT is not with-out limitations, it may provide a way to compare technolo-gies in field deployments, draw findings across investiga-tions, and quantify the impact of specific design decisions.
Segmenting Two-Sided Markets
(2017)

Recent years have witnessed the rise of many successful e-commerce marketplace platforms like the Amazon marketplace, AirBnB, Uber/Lyft, and Upwork, where a central platform mediates economic transactions between buyers and sellers. A common feature of many of these two-sided marketplaces is that the platform has full control over search and discovery, but prices are determined by the buyers and sellers. Motivated by this, we study the algorithmic aspects of market segmentation via directed discovery in two-sided markets with endogenous prices. We consider a model where an online platform knows each buyer/seller’s characteristics, and associated demand/supply elasticities. Moreover, the platform can use discovery mechanisms (search, recommendation, etc.) to control which buyers/sellers are visible to each other. We develop efficient algorithms for throughput (i.e. volume of trade) and welfare maximization with provable guarantees under a variety of assumptions on the demand and supply functions. We also test the validity of our assumptions on demand curves inferred from NYC taxicab log-data, as well as show the performance of our algorithms on synthetic experiments.