OpenRaiser/Intern-Atlas huggingface dataset:
From Questions to Effective Answers: On the Utility of Knowledge-Driven Querying Systems for Life Sciences Data
Venue: arXiv cs.IR 2012
Year: 2012

We compare two distinct approaches for querying data in the context of the life sciences. The first approach utilizes conventional databases to store the data and intuitive form-based interfaces to facilitate easy querying of the data. These interfaces could be seen as implementing a set of "pre-canned" queries commonly used by the life science researchers that we study. The second approach is based on semantic Web technologies and is knowledge (model) driven. It utilizes a large OWL ontology and same datasets as before but associated as RDF instances of the ontology concepts. An intuitive interface is provided that allows the formulation of RDF triples-based queries. Both these approaches are being used in parallel by a team of cell biologists in their daily research activities, with the objective of gradually replacing the conventional approach with the knowledge-driven one. This provides us with a valuable opportunity to compare and qualitatively evaluate the two approaches. We describe several benefits of the knowledge-driven approach in comparison to the traditional way of accessing data, and highlight a few limitations as well. We believe that our analysis not only explicitly highlights the specific benefits and limitations of semantic Web technologies in our context but also contributes toward effective ways of translating a question in a researcher's mind into precise computational queries with the intent of obtaining effective answers from the data. While researchers often assume the benefits of semantic Web technologies, we explicitly illustrate these in practice.
A Framework for Heterotic Computing
Venue: arXiv cs.ET 2012
Year: 2012

Computational devices combining two or more different parts, one controlling the operation of the other, for example, derive their power from the interaction, in addition to the capabilities of the parts. Non-classical computation has tended to consider only single computational models: neural, analog, quantum, chemical, biological, neglecting to account for the contribution from the experimental controls. In this position paper, we propose a framework suitable for analysing combined computational models, from abstract theory to practical programming tools. Focusing on the simplest example of one system controlled by another through a sequence of operations in which only one system is active at a time, the output from one system becomes the input to the other for the next step, and vice versa. We outline the categorical machinery required for handling diverse computational systems in such combinations, with their interactions explicitly accounted for. Drawing on prior work in refinement and retrenchment, we suggest an appropriate framework for developing programming tools from the categorical framework. We place this work in the context of two contrasting concepts of "efficiency": theoretical comparisons to determine the relative computational power do not always reflect the practical comparison of real resources for a finite-sized computational task, especially when the inputs include (approximations of) real numbers. Finally we outline the limitations of our simple model, and identify some of the extensions that will be required to treat more complex interacting computational systems.
Joint Estimation and Contention-Resolution Protocol for Wireless Random Access
Venue: arXiv cs.IT 2012
Year: 2012

We propose a contention-based random-access protocol, designed for wireless networks where the number of users is not a priori known. The protocol operates in rounds divided into equal-duration slots, performing at the same time estimation of the number of users and resolution of their transmissions. The users independently access the wireless link on a slot basis with a predefined probability, resulting in a distribution of user transmissions over slots, based on which the estimation and contention resolution are performed. Specifically, the contention resolution is performed using successive interference cancellation which, coupled with the use of the optimized access probabilities, enables throughputs that are substantially higher than the traditional slotted ALOHA-like protocols. The key feature of the proposed protocol is that the round durations are not a priori set and they are terminated when the estimation/contention-resolution performance reach the satisfactory levels.
A Semantic Approach for Automatic Structuring and Analysis of Software Process Patterns
Venue: arXiv cs.AI 2012
Year: 2012

The main contribution of this paper, is to propose a novel semantic approach based on a Natural Language Processing technique in order to ensure a semantic unification of unstructured process patterns which are expressed not only in different formats but also, in different forms. This approach is implemented using the GATE text engineering framework and then evaluated leading up to high-quality results motivating us to continue in this direction.
Classification of Hepatic Lesions using the Matching Metric
Venue: arXiv cs.CV 2012
Year: 2012

In this paper we present a methodology of classifying hepatic (liver) lesions using multidimensional persistent homology, the matching metric (also called the bottleneck distance), and a support vector machine. We present our classification results on a dataset of 132 lesions that have been outlined and annotated by radiologists. We find that topological features are useful in the classification of hepatic lesions. We also find that two-dimensional persistent homology outperforms one-dimensional persistent homology in this application.
Learning from Collective Intelligence in Groups
Venue: arXiv cs.SI 2012
Year: 2012

Collective intelligence, which aggregates the shared information from large crowds, is often negatively impacted by unreliable information sources with the low quality data. This becomes a barrier to the effective use of collective intelligence in a variety of applications. In order to address this issue, we propose a probabilistic model to jointly assess the reliability of sources and find the true data. We observe that different sources are often not independent of each other. Instead, sources are prone to be mutually influenced, which makes them dependent when sharing information with each other. High dependency between sources makes collective intelligence vulnerable to the overuse of redundant (and possibly incorrect) information from the dependent sources. Thus, we reveal the latent group structure among dependent sources, and aggregate the information at the group level rather than from individual sources directly. This can prevent the collective intelligence from being inappropriately dominated by dependent sources. We will also explicitly reveal the reliability of groups, and minimize the negative impacts of unreliable groups. Experimental results on real-world data sets show the effectiveness of the proposed approach with respect to existing algorithms.
Laxity-Based Opportunistic Scheduling with Flow-Level Dynamics and Deadlines
Venue: arXiv cs.IT 2012
Year: 2012

Many data applications in the next generation cellular networks, such as content precaching and video progressive downloading, require flow-level quality of service (QoS) guarantees. One such requirement is deadline, where the transmission task needs to be completed before the application-specific time. To minimize the number of uncompleted transmission tasks, we study laxity-based scheduling policies in this paper. We propose a Less-Laxity-Higher-Possible-Rate (L$^2$HPR) policy and prove its asymptotic optimality in underloaded identical-deadline systems. The asymptotic optimality of L$^2$HPR can be applied to estimate the schedulability of a system and provide insights on the design of scheduling policies for general systems. Based on it, we propose a framework and three heuristic policies for practical systems. Simulation results demonstrate the asymptotic optimality of L$^2$HPR and performance improvement of proposed policies over greedy policies.
Sensory Anticipation of Optical Flow in Mobile Robotics
Venue: arXiv cs.RO 2012
Year: 2012

In order to anticipate dangerous events, like a collision, an agent needs to make long-term predictions. However, those are challenging due to uncertainties in internal and external variables and environment dynamics. A sensorimotor model is acquired online by the mobile robot using a state-of-the-art method that learns the optical flow distribution in images, both in space and time. The learnt model is used to anticipate the optical flow up to a given time horizon and to predict an imminent collision by using reinforcement learning. We demonstrate that multi-modal predictions reduce to simpler distributions once actions are taken into account.
Theoretical And Technological Building Blocks For An Innovation Accelerator
Venue: arXiv cs.DL 2012
Year: 2012

The scientific system that we use today was devised centuries ago and is inadequate for our current ICT-based society: the peer review system encourages conservatism, journal publications are monolithic and slow, data is often not available to other scientists, and the independent validation of results is limited. Building on the Innovation Accelerator paper by Helbing and Balietti (2011) this paper takes the initial global vision and reviews the theoretical and technological building blocks that can be used for implementing an innovation (in first place: science) accelerator platform driven by re-imagining the science system. The envisioned platform would rest on four pillars: (i) Redesign the incentive scheme to reduce behavior such as conservatism, herding and hyping; (ii) Advance scientific publications by breaking up the monolithic paper unit and introducing other building blocks such as data, tools, experiment workflows, resources; (iii) Use machine readable semantics for publications, debate structures, provenance etc. in order to include the computer as a partner in the scientific process, and (iv) Build an online platform for collaboration, including a network of trust and reputation among the different types of stakeholders in the scientific system: scientists, educators, funding agencies, policy makers, students and industrial innovators among others. Any such improvements to the scientific system must support the entire scientific process (unlike current tools that chop up the scientific process into disconnected pieces), must facilitate and encourage collaboration and interdisciplinarity (again unlike current tools), must facilitate the inclusion of intelligent computing in the scientific process, must facilitate not only the core scientific process, but also accommodate other stakeholders such science policy makers, industrial innovators, and the general public.
An Emergency System for Succoring Children using Mobile GIS
Venue: arXiv cs.CY 2012
Year: 2012

The large numbers of sick children in different diseases are very dreaded, and when there isn't succor at the proper time and in the type the sick child need it that makes us lose child. This paper suggested an emergency system for succoring sick child locally when he required that, and there isn't someone knows his disease. The proposed system is the first tracking system works online (24 hour in the day) but only when the sick children requiring the help using mobile GIS. In, this emergency system the child will send SMS (for easy he click one button) contains his ID and coordinates (Longitude and Latitude) via GPRS network to the web server (the child was registered previously on that server), in this step the server will locate the sick child on Google map and retrieve the child's information from the database which saved this information in registration stage, and base on these information will send succoring facility and at the same time informing the hospital, his parents, doctor, etc. about that emergency case of the child using the SMS mode through GPRS network again. The design and implement of the proposed system shows more effective cost than other systems because it used a minimum configuration (hardware and software) and works in economic mode. Keywords- GPS; GPRS; Mobile GIS; SMS; Tracking device; Emergency System.
Source-Channel Secrecy with Causal Disclosure
Venue: arXiv cs.IT 2012
Year: 2012

Imperfect secrecy in communication systems is investigated. Instead of using equivocation as a measure of secrecy, the distortion that an eavesdropper incurs in producing an estimate of the source sequence is examined. The communication system consists of a source and a broadcast (wiretap) channel, and lossless reproduction of the source sequence at the legitimate receiver is required. A key aspect of this model is that the eavesdropper's actions are allowed to depend on the past behavior of the system. Achievability results are obtained by studying the performance of source and channel coding operations separately, and then linking them together digitally. Although the problem addressed here has been solved when the secrecy resource is shared secret key, it is found that substituting secret key for a wiretap channel brings new insights and challenges: the notion of weak secrecy provides just as much distortion at the eavesdropper as strong secrecy, and revealing public messages freely is detrimental.
Discovering and Leveraging the Most Valuable Links for Ranking
Venue: arXiv cs.IR 2012
Year: 2012

On the Web, visits of a page are often introduced by one or more valuable linking sources. Indeed, good back links are valuable resources for Web pages and sites. We propose to discovering and leveraging the best backlinks of pages for ranking. Similar to PageRank, MaxRank scores are updated {recursively}. In particular, with probability $λ$, the MaxRank of a document is updated from the backlink source with the maximum score; with probability $1-λ$, the MaxRank of a document is updated from a random backlink source. MaxRank has an interesting relation to PageRank. When $λ=0$, MaxRank reduces to PageRank; when $λ=1$, MaxRank only looks at the best backlink it thinks. Empirical results on Wikipedia shows that the global authorities are very influential; Overall large $λ$s (but smaller than 1) perform best: the convergence is dramatically faster than PageRank, but the performance is still comparable. We study the influence of these sources and propose a few measures such as the times of being the best backlink for others, and related properties of the proposed algorithm. The introduction of best backlink sources provides new insights for link analysis. Besides ranking, our method can be used to discover the most valuable linking sources for a page or Website, which is useful for both search engines and site owners.
Users Authentication and Privacy control of RFID Card
Venue: arXiv cs.CR 2012
Year: 2012

Security and Privacy concerns in Radio frequency identification (RFID) technology particularly RFID Card, is a wide research area which have attracted researchers for over a decade. Authenticating users at the Card end of the RFID technology constitutes one of the major sources of attacks on the system. In this research, we studied the various known attacks and mitigation available. We proposed a conceptual framework that that can be used to mitigate the unauthorized use of RFID Card. This concept will mitigate the single point of the RFID card failure: unauthorized use.
Distributed Flow Scheduling in an Unknown Environment
Venue: arXiv cs.GT 2012
Year: 2012

Flow scheduling tends to be one of the oldest and most stubborn problems in networking. It becomes more crucial in the next generation network, due to fast changing link states and tremendous cost to explore the global structure. In such situation, distributed algorithms often dominate. In this paper, we design a distributed virtual game to solve the flow scheduling problem and then generalize it to situations of unknown environment, where online learning schemes are utilized. In the virtual game, we use incentives to stimulate selfish users to reach a Nash Equilibrium Point which is valid based on the analysis of the `Price of Anarchy'. In the unknown-environment generalization, our ultimate goal is the minimization of cost in the long run. In order to achieve balance between exploration of routing cost and exploitation based on limited information, we model this problem based on Multi-armed Bandit Scenario and combined newly proposed DSEE with the virtual game design. Armed with these powerful tools, we find a totally distributed algorithm to ensure the logarithmic growing of regret with time, which is optimum in classic Multi-armed Bandit Problem. Theoretical proof and simulation results both affirm this claim. To our knowledge, this is the first research to combine multi-armed bandit with distributed flow scheduling.
Constellation Design for Channels Affected by Phase Noise
Venue: arXiv cs.IT 2012
Year: 2012

In this paper we optimize constellation sets to be used for channels affected by phase noise. The main objective is to maximize the achievable mutual information of the constellation under a given power constraint. The mutual information and pragmatic mutual information of a given constellation is calculated approximately assuming that both the channel and phase noise are white. Then a simulated annealing algorithm is used to jointly optimize the constellation and the binary labeling. The performance of optimized constellations is compared with conventional constellations showing considerable gains in all system scenarios.
The AND-OR game: Equilibrium Characterization (Working Paper)
Venue: arXiv cs.GT 2012
Year: 2012

We consider a simple simultaneous first price auction for multiple items in a complete information setting. Our goal is to completely characterize the mixed equilibria in this setting, for a simple, yet highly interesting, {\tt AND}-{\tt OR} game, where one agent is single minded and the other is unit demand.
In-place associative permutation sort
Venue: arXiv cs.DS 2012
Year: 2012

In-place associative integer sorting technique was developed, improved and specialized for distinct integers. The technique is suitable for integer sorting. Hence, given a list S of n integers S[0...n-1], the technique sorts the integers in ascending or descending order. It replaces bucket sort, distribution counting sort and address calculation sort family of algorithms and requires only constant amount of additional memory for storing counters and indices beside the input list. The technique was inspired from one of the ordinal theories of "serial order in behavior" and explained by the analogy with the three main stages in the formation and retrieval of memory in cognitive neuroscience: (i) practicing, (ii) storing and (iii) retrieval. In this study in-place associative permutation technique is introduced for integer key sorting problem. Given a list S of n elements S[0...n-1] each have an integer key in the range [0,m-1], the technique sorts the elements according to their integer keys in O(n) time using only O(1) amount of memory if m<=n. On the other hand, if m>n, it sorts in O(n+m) time for the worst, O(m) time for the average (uniformly distributed keys) and O(n) time for the best case using O(1) extra space.
Self-dual Permutation Codes of Finite Groups in Semisimple Case
Venue: arXiv cs.IT 2012
Year: 2012

The existence and construction of self-dual codes in a permutation module of a finite group for the semisimple case are described from two aspects, one is from the point of view of the composition factors which are self-dual modules, the other one is from the point of view of the Galois group of the coefficient field.
The Limitation of Random Network Coding
Venue: arXiv cs.IT 2012
Year: 2012

It is already known that in multicast (single source, multiple sinks) network, random linear network coding can achieve the maximum flow upper bound. In this paper, we investigate how random linear network coding behaves in general multi-source multi-sink case, where each sink has different demands, and characterize all achievable rate of random linear network coding by a simple maximum flow condition.
Novel Framework for Mobile Collaborative learning (MCL)to substantiate pedagogical activities
Venue: arXiv cs.CY 2012
Year: 2012

Latest study shows that MCL is highly focusing paradigm for research particularity in distance and online education. MCL provides some features and functionalities for all participants to obtain the knowledge. Deployment of new emerging technologies and fast growing trends toward MCL boom attract people to develop learning management system, virtual learning environment and conference system with support of MCL. All these environments lack the most promising supportive framework. In addition some of major challenges in open, large scale, dynamic and heterogeneous environments are not still handled in developing MCL for education and other organizations. These issues includes such as knowledge sharing, faster delivery of contents, request for modified contents, complete access to enterprise data warehouse, delivery of large rich multimedia contents (video-on-demand), asynchronous collaboration, synchronous collaboration, support for multi model, provision for archive updating, user friendly interface, middleware support and virtual support. To overcome these issues; the paper introduces novel framework for MCL consisting of four layers with many promising functional components, which provide access to users for obtaining required contents from enterprise data warehouse (EDW). Novel framework provides information regarding the course materials, easy access to check the grades and use of labs. The applications running on this framework give substantial feedback for collaboration such as exchange for delivery of communication contents including platform for group discussion, short message service (SMS), emails, audio, video and video-on-demand to obtain on-line information to students and other persons who will be part of collaboration.
Integration of CAD and rapid manufacturing for sand casting optimisation
Venue: arXiv cs.OH 2012
Year: 2012

In order to reduce the time and costs of the products development in the sand casting process, the SMC Colombier Fontaine company has carried out a study based on tooling manufacturing with a new rapid prototyping process. This evolution allowed the adequacy of the geometry used for the simulation to the tooling employed physically in the production. This allowed a reduction of the wall thickness to 4mm and retained reliable manufacturing process.
Repairable Replication-based Storage Systems Using Resolvable Designs
Venue: arXiv cs.IT 2012
Year: 2012

We consider the design of regenerating codes for distributed storage systems at the minimum bandwidth regeneration (MBR) point. The codes allow for a repair process that is exact and uncoded, but table-based. These codes were introduced in prior work and consist of an outer MDS code followed by an inner fractional repetition (FR) code where copies of the coded symbols are placed on the storage nodes. The main challenge in this domain is the design of the inner FR code. In our work, we consider generalizations of FR codes, by establishing their connection with a family of combinatorial structures known as resolvable designs. Our constructions based on affine geometries, Hadamard designs and mutually orthogonal Latin squares allow the design of systems where a new node can be exactly regenerated by downloading $β\geq 1$ packets from a subset of the surviving nodes (prior work only considered the case of $β= 1$). Our techniques allow the design of systems over a large range of parameters. Specifically, the repetition degree of a symbol, which dictates the resilience of the system can be varied over a large range in a simple manner. Moreover, the actual table needed for the repair can also be implemented in a rather straightforward way. Furthermore, we answer an open question posed in prior work by demonstrating the existence of codes with parameters that are not covered by Steiner systems.