OpenRaiser/Intern-Atlas huggingface dataset:
Authoris: a tool for authority control in the semantic web
Venue: arXiv cs.DL 2014
Year: 2014

Purpose: The purpose of this paper is to propose a tool that generates authority files to be integrated with linked data by means of learning rules. AUTHORIS is software developed to enhance authority control and information exchange among bibliographic and non-bibliographic entities. Design / methodology / approach: The article analyzes different methods previously developed for authority control as well as IFLA and ALA standards for managing bibliographic records. Semantic Web technologies are also evaluated. AUTHORIS relies on Drupal and incorporates the protocols of Dublin Core, SIOC, SKOS and FOAF. The tool has also taken into account the obsolescence of MARC and its substitution by FRBR and RDA. Its effectiveness was evaluated applying a learning test proposed by RDA. Over 80 percent of the actions were carried out correctly. Findings: The use of learning rules and the facilities of linked data make it easier for information organizations to reutilize products for authority control and distribute them in a fair and efficient manner. Research limitations / implications: The ISAD-G records were the ones presenting most errors. EAD was found to be second in the number of errors produced. The rest of the formats --MARC 21, Dublin Core, FRAD, RDF, OWL, XBRL and FOAF-- showed fewer than 20 errors in total. Practical implications: AUTHORIS offers institutions the means of sharing data with a high level of stability, helping to detect records that are duplicated and contributing to lexical disambiguation and data enrichment. Originality / value: The software combines the facilities of linked data, the potency of the algorithms for converting bibliographic data, and the precision of learning rules.
Binary Stereo Matching
Venue: arXiv cs.CV 2014
Year: 2014

In this paper, we propose a novel binary-based cost computation and aggregation approach for stereo matching problem. The cost volume is constructed through bitwise operations on a series of binary strings. Then this approach is combined with traditional winner-take-all strategy, resulting in a new local stereo matching algorithm called binary stereo matching (BSM). Since core algorithm of BSM is based on binary and integer computations, it has a higher computational efficiency than previous methods. Experimental results on Middlebury benchmark show that BSM has comparable performance with state-of-the-art local stereo methods in terms of both quality and speed. Furthermore, experiments on images with radiometric differences demonstrate that BSM is more robust than previous methods under these changes, which is common under real illumination.
Artificial Noise Revisited
Venue: arXiv cs.IT 2014
Year: 2014

The artificial noise (AN) scheme, proposed by Goel and Negi, is being considered as one of the key enabling technology for secure communications over multiple-input multiple-output (MIMO) wiretap channels. However, the decrease in secrecy rate due to the increase in the number of Eve's antennas is not well understood. In this paper, we develop an analytical framework to characterize the secrecy rate of the AN scheme as a function of Eve's signal-to-noise ratio (SNR), Bob's SNR, the number of antennas in each terminal, and the power allocation scheme. We first derive a closed-form expression for the average secrecy rate. We then derive a closed-form expression for the asymptotic instantaneous secrecy rate with large number of antennas at all terminals. Finally, we derive simple lower and upper bounds on the average and instantaneous secrecy rate that provide a tool for the system design.
OS-Assisted Task Preemption for Hadoop
Venue: arXiv cs.DC 2014
Year: 2014

This work introduces a new task preemption primitive for Hadoop, that allows tasks to be suspended and resumed exploiting existing memory management mechanisms readily available in modern operating systems. Our technique fills the gap that exists between the two extremes cases of killing tasks (which waste work) or waiting for their completion (which introduces latency): experimental results indicate superior performance and very small overheads when compared to existing alternatives.
Intelligent User Interface in Fuzzy Environment
Venue: arXiv cs.HC 2014
Year: 2014

Human-Computer Interaction with the traditional User Interface is done using a specified in advance script dialog menu, mainly based on human intellect and unproductive use of navigation. This approach does not lead to making qualitative decision in control systems, where the situations and processes cannot be structured in advance. Any dynamic changes in the controlled business process (as example, in organizational unit of the information fuzzy control system) make it necessary to modify the script dialogue in User Interface. This circumstance leads to a redesign of the components of the User Interface and of the entire control system. In the Intelligent User Interface, where the dialog situations are unknown in advance, fuzzy structured and artificial intelligence is crucial, the redesign described above is impossible. To solve this and other problems, we propose the data, information and knowledge based technology of Smart/ Intelligent User Interface (IUI) design, which interacts with users and systems in natural and other languages, utilizing the principles of Situational Control and Fuzzy Logic theories, Artificial Intelligence, Linguistics, Knowledge Base technologies and others. The proposed technology of IUI design is defined by multi-agents of Situational Control and of data, information and knowledge, modelling of Fuzzy Logic Inference, Generalization, Representation and Explanation of knowledge, Planning and Decision-making, Dialog Control, Reasoning and Systems Thinking, Fuzzy Control of organizational unit in real-time, fuzzy conditions, heterogeneous domains, and multi-lingual communication under uncertainty and in Fuzzy Environment.
A SAT Attack on the Erdos Discrepancy Conjecture
Venue: arXiv cs.DM 2014
Year: 2014

In 1930s Paul Erdos conjectured that for any positive integer C in any infinite +1 -1 sequence (x_n) there exists a subsequence x_d, x_{2d}, ... , x_{kd} for some positive integers k and d, such that |x_d + x_{2d} + ... + x_{kd}|> C. The conjecture has been referred to as one of the major open problems in combinatorial number theory and discrepancy theory. For the particular case of C=1 a human proof of the conjecture exists; for C=2 a bespoke computer program had generated sequences of length 1124 having discrepancy 2, but the status of the conjecture remained open even for such a small bound. We show that by encoding the problem into Boolean satisfiability and applying the state of the art SAT solvers, one can obtain a sequence of length 1160 with discrepancy 2 and a proof of the Erdos discrepancy conjecture for C=2, claiming that no sequence of length 1161 and discrepancy 2 exists. We also present our partial results for the case of C=3.
Image Search Reranking
Venue: arXiv cs.IR 2014
Year: 2014

The existing methods for image search reranking suffer from the unfaithfulness of the assumptions under which the text-based images search result. The resulting images contain more irrelevant images. Hence the re ranking concept arises to re rank the retrieved images based on the text around the image and data of data of image and visual feature of image. A number of methods are differentiated for this re-ranking. The high ranked images are used as noisy data and a k means algorithm for classification is learned to rectify the ranking further. We are study the affect ability of the cross validation method to this training data. The pre eminent originality of the overall method is in collecting text/metadata of image and visual features in order to achieve an automatic ranking of the images. Supervision is initiated to learn the model weights offline, previous to reranking process. While model learning needs manual labeling of the results for a some limited queries, the resulting model is query autonomous and therefore applicable to any other query .Examples are given for a selection of other classes like vehicles, animals and other classes.
Visualization of Object Oriented Modeling from the Perspective of Set theory
Venue: arXiv cs.SE 2014
Year: 2014

Language is a medium for communication of our thoughts. Natural language is too wide to conceive and formulate the thoughts and ideas in a precise way. As science and technology grows, the necessity of languages arouses through which the thoughts are expressed in a better manner. Set Theory is such a mathematical language for expressing the thought of interest in a realistic way. It is well suited for presenting object oriented solution model, since this implementation methodology analyzes and modulates the requirements in a realistic way. Since the design flaws are one of the factors for software failure, industries are focusing on minimizing the design defects through better solution modeling techniques and quality assessment practices. The Object Oriented (OO) solution space can be visualized using the language of Set theory with which the design architecture of modules can be well defined. It provides a strong base to quantify the relationships within and between the modules, which is a mode for measuring the complexity of solution design of any software projects. This paper provides a visualization of OO modeling from the perspective of Set theory. Thereby, it paves the path for the designers to effectively design the application which is one of the challenges of a project development. Further, this mode of visualization enables one to effectively measure and controls the design complexity leading towards reducing the design flaws and enhanced software quality.
Empirical Study on Selection of Team Members for Software Projects - Data Mining Approach
Venue: arXiv cs.SE 2014
Year: 2014

One of the essential requisites of any software industry is the development of customer satisfied products. However, accomplishing the aforesaid business objective depends upon the depth of quality of product that is engineered in the organization. Thus, generation of high quality depends upon process, which is in turn depends upon the people. Existing scenario in IT industries demands a requirement for deploying the right personnel for achieving desirable quality in the product through the existing process. The goal of this paper is to identify the criteria which will be used in industrial practice to select members of a software project team, and to look for relationships between these criteria and project success. Using semi-structured interviews and qualitative methods for data analysis and synthesis, a set of team building criteria was identified from project managers in industry. The findings show that the consistent use of the set of criteria correlated significantly with project success, and the criteria related to human factors present strong correlations with software quality and thereby project success. This knowledge enables decision making for project managers in allocation of right personnel to realize desired level.
A Distributed Optimization Framework For Multi-channel Multi-user Small Cell Networks
Venue: arXiv cs.NI 2014
Year: 2014

Small cell enchantment is emerging as the key technique for wireless network evolution. One challenging problem for small cell enhancement is how to achieve high data rate with as-low-as-possible control and computation overheads. As a solution, we propose a low-complexity distributed optimization framework in this paper. Our solution includes two parts. One is a novel implicit information exchange mechanism that enables channel-aware opportunistic scheduling and resource allocation among links. The other is the sub-gradient based algorithm with a polynomial-time complexity. What is more, for large scale systems, we design an improved distributed algorithm based on insights obtained from the problem structure. This algorithm achieves a close-to-optimal performance with a much lower complexity. Our numerical evaluations validate the analytical results and show the advantage of our algorithms.
Self-Aligned Double Patterning Friendly Configuration for Standard Cell Library Considering Placement
Venue: arXiv cs.AR 2014
Year: 2014

Self-aligned double patterning (SADP) has become a promising technique to push pattern resolution limit to sub-22nm technology node. Although SADP provides good overlay controllability, it encounters many challenges in physical design stages to obtain conflict-free layout decomposition. In this paper, we study the impact on placement by different standard cell layout decomposition strategies. We propose a SADP friendly standard cell configuration which provides pre-coloring results for standard cells. These configurations are brought into the placement stage to help ensure layout decomposability and save the extra effort for solving conflicts in later stages.
Floorplanning and Topology Generation for Application-Specific Network-on-Chip
Venue: arXiv cs.AR 2014
Year: 2014

Network-on-chip (NoC) architectures have been proposed as a promising alternative to classical bus-based communication architectures. In this paper, we propose a two phases framework to solve application-specific NoCs topology generation problem. At floorplanning phase, we carry out partition driven floorplanning. At post-floorplanning phase, a heuristic method and a min-cost max-flow algorithm is used to insert switches and network interfaces. Finally, we allocate paths to minimize power consumption. The experimental results show our algorithm is effective for power saving.
Introducing Quantified Cuts in Logic with Equality
Venue: arXiv cs.LO 2014
Year: 2014

Cut-introduction is a technique for structuring and compressing formal proofs. In this paper we generalize our cut-introduction method for the introduction of quantified lemmas of the form $\forall x.A$ (for quantifier-free $A$) to a method generating lemmas of the form $\forall x_1\ldots\forall x_n.A$. Moreover, we extend the original method to predicate logic with equality. The new method was implemented and applied to the TSTP proof database. It is shown that the extension of the method to handle equality and quantifier-blocks leads to a substantial improvement of the old algorithm.
Achieve Better Ranking Accuracy Using CloudRank Framework for Cloud Services
Venue: arXiv cs.DC 2014
Year: 2014

Building high quality cloud applications becomes an urgently required research problem. Nonfunctional performance of cloud services is usually described by quality-of-service (QoS). In cloud applications, cloud services are invoked remotely by internet connections. The QoS Ranking of cloud services for a user cannot be transferred directly to another user, since the locations of the cloud applications are quite different. Personalized QoS Ranking is required to evaluate all candidate services at the user - side but it is impractical in reality. To get QoS values, the service candidates are usually required and it is very expensive. To avoid time consuming and expensive realworld service invocations, this paper proposes a CloudRank framework which predicts the QoS ranking directly without predicting the corresponding QoS values. This framework provides an accurate ranking but the QoS values are same in both algorithms so, an optimal VM allocation policy is used to improve the QoS performance of cloud services and it also provides better ranking accuracy than CloudRank2 algorithm.
Spontaneous Wireless Networking to Counter Pervasive Monitoring
Venue: arXiv cs.NI 2014
Year: 2014

Several approaches can be employed to counter pervasive monitoring at large scale on the Internet. One category of approaches aims to harden the current Internet architecture and to increase the security of high profile targets (data centers, exchange points etc.). Another category of approaches aims instead for target dispersal, i.e. disabling systematic mass surveillance via the elimination of existing vantage points, thus forcing surveillance efforts to be more specific and personalized. This paper argues how networking approaches that do not rely on central entities -- but rather on spontaneous interaction, as locally as possible, between autonomous peer entities -- can help realize target dispersal and thus counter pervasive monitoring.
Unveiling Potential Failure Propagation Scenarios in Core Transport Networks
Venue: arXiv cs.NI 2014
Year: 2014

The contemporary society has become more dependent on telecommunication networks. Novel services and technologies supported by such networks, such as cloud computing or e-Health, hold a vital role in modern day living. Large-scale failures are prone to occur, thus being a constant threat to business organizations and individuals. To the best of our knowledge, there are no publicly available reports regarding failure propagation in core transport networks. Furthermore, Software Defined Networking (SDN) is becoming more prevalent in our society and we can envision more SDN-controlled Backbone Transport Networks (BTNs) in the future. For this reason, we investigate the main motivations that could lead to epidemic-like failures in BTNs and SDNTNs. To do so, we enlist the expertise of several research groups with significant background in epidemics, network resiliency, and security. In addition, we consider the experiences of three network providers. Our results illustrate that Dynamic Transport Networks (DTNs) are prone to epidemic-like failures. Moreover, we propose different situations in which a failure can propagate in SDNTNs. We believe that the key findings will aid network engineers and the scientific community to predict this type of disastrous failure scenario and plan adequate survivability strategies.
Visualizing Digital Collections
Venue: arXiv cs.DL 2014
Year: 2014

Data visualizations can greatly enhance search in digital collections by providing information about the scope and context of a collection and allowing users to more easily browse and explore the contents. This article discusses the benefits of incorporating visualizations into digital collections based on the experiences of the Cold War International History Project (CWIHP) in developing a user-friendly tool for searching and visualizing the project's complex set of historical documents. The paper concludes with a tutorial on using the free Library of Congress tool Viewshare to create visualizations based on real data from the CWIHP Digital Archive.
On the Security of Trustee-based Social Authentications
Venue: arXiv cs.CR 2014
Year: 2014

Recently, authenticating users with the help of their friends (i.e., trustee-based social authentication) has been shown to be a promising backup authentication mechanism. A user in this system is associated with a few trustees that were selected from the user's friends. When the user wants to regain access to the account, the service provider sends different verification codes to the user's trustees. The user must obtain at least k (i.e., recovery threshold) verification codes from the trustees before being directed to reset his or her password. In this paper, we provide the first systematic study about the security of trustee-based social authentications. Specifically, we first introduce a novel framework of attacks, which we call forest fire attacks. In these attacks, an attacker initially obtains a small number of compromised users, and then the attacker iteratively attacks the rest of users by exploiting trustee-based social authentications. Then, we construct a probabilistic model to formalize the threats of forest fire attacks and their costs for attackers. Moreover, we introduce various defense strategies. Finally, we apply our framework to extensively evaluate various concrete attack and defense strategies using three real-world social network datasets. Our results have strong implications for the design of more secure trustee-based social authentications.
A directional coupler attack against the Kish key distribution system
Venue: arXiv cs.CR 2014
Year: 2014

The Kish key distribution system has been proposed as a class ical alternative to quantum key distribution. The idealized Kish scheme elegantly promise s secure key distribution by exploiting thermal noise in a transmission line. However, we demonstrate that it is vulnerable to nonidealities in its components, such as the finite resistance of the transmission line connecting its endpoints. We introduce a novel attack against this nonideality using directional wave measurements, and experimentally demonstrate its efficacy. Our attack is based on causality: in a spatially distributed system, propagation is needed for thermodynamic equilibration, and that leaks information.
Energy Efficient Scheduling of MapReduce Jobs
Venue: arXiv cs.DC 2014
Year: 2014

MapReduce is emerged as a prominent programming model for data-intensive computation. In this work, we study power-aware MapReduce scheduling in the speed scaling setting first introduced by Yao et al. [FOCS 1995]. We focus on the minimization of the total weighted completion time of a set of MapReduce jobs under a given budget of energy. Using a linear programming relaxation of our problem, we derive a polynomial time constant-factor approximation algorithm. We also propose a convex programming formulation that we combine with standard list scheduling policies, and we evaluate their performance using simulations.
Realtime Multilevel Crowd Tracking using Reciprocal Velocity Obstacles
Venue: arXiv cs.CV 2014
Year: 2014

We present a novel, realtime algorithm to compute the trajectory of each pedestrian in moderately dense crowd scenes. Our formulation is based on an adaptive particle filtering scheme that uses a multi-agent motion model based on velocity-obstacles, and takes into account local interactions as well as physical and personal constraints of each pedestrian. Our method dynamically changes the number of particles allocated to each pedestrian based on different confidence metrics. Additionally, we use a new high-definition crowd video dataset, which is used to evaluate the performance of different pedestrian tracking algorithms. This dataset consists of videos of indoor and outdoor scenes, recorded at different locations with 30-80 pedestrians. We highlight the performance benefits of our algorithm over prior techniques using this dataset. In practice, our algorithm can compute trajectories of tens of pedestrians on a multi-core desktop CPU at interactive rates (27-30 frames per second). To the best of our knowledge, our approach is 4-5 times faster than prior methods, which provide similar accuracy.