OpenRaiser/Intern-Atlas huggingface dataset:
Diffusion-geometric maximally stable component detection in deformable shapes
Venue: arXiv cs.CV 2010
Year: 2010

Maximally stable component detection is a very popular method for feature analysis in images, mainly due to its low computation cost and high repeatability. With the recent advance of feature-based methods in geometric shape analysis, there is significant interest in finding analogous approaches in the 3D world. In this paper, we formulate a diffusion-geometric framework for stable component detection in non-rigid 3D shapes, which can be used for geometric feature detection and description. A quantitative evaluation of our method on the SHREC'10 feature detection benchmark shows its potential as a source of high-quality features.
Advances in the Biomedical Applications of the EELA Project
Venue: arXiv cs.CE 2010
Year: 2010

In the last years an increasing demand for Grid Infrastructures has resulted in several international collaborations. This is the case of the EELA Project, which has brought together collaborating groups of Latin America and Europe. One year ago we presented this e-infrastructure used, among others, by the Biomedical groups for the studies of oncological analysis, neglected diseases, sequence alignments and computation phylogenetics. After this period, the achieved advances are summarised in this paper.
Quotient Complexity of Star-Free Languages
Venue: arXiv cs.FL 2010
Year: 2010

The quotient complexity, also known as state complexity, of a regular language is the number of distinct left quotients of the language. The quotient complexity of an operation is the maximal quotient complexity of the language resulting from the operation, as a function of the quotient complexities of the operands. The class of star-free languages is the smallest class containing the finite languages and closed under boolean operations and concatenation. We prove that the tight bounds on the quotient complexities of union, intersection, difference, symmetric difference, concatenation, and star for star-free languages are the same as those for regular languages, with some small exceptions, whereas the bound for reversal is 2^n-1.
Performance Study of IEEE802.11e QoS in EDCF-Contention-based Static and Dynamic Scenarios
Venue: arXiv cs.NI 2010
Year: 2010

In this paper, we carry-out a study of the Quality of Service (QoS) mechanism in IEEE802.11e Enhanced Distribution Coordination Function (EDCF) and how it is achieved by providing traffics with different priorities. It can perform the access to the radio channel or just simply it can considerably be declined subsequently to a variation of network dynamicity. The results of the proposed analysis show that the EDCF scheduler looses the ability of the traffic differentiation and becomes insensitive to the QoS priority requirements. Consequently, it goes away from the region of stability and EDCF doesn't offer better performance than the conventional DCF scheme. Therefore, traffic specifications are weakly applied only for the channel occupation time distribution. During the handoff between the Base Stations (BS's), the response time of the data rate application within the roaming process grows to the initial throughput level. Performance metrics at the MAC layer, like throughput, End-2-End delay, and packet loss have been evaluated.
Lattice Code Design for the Rayleigh Fading Wiretap Channel
Venue: arXiv cs.IT 2010
Year: 2010

It has been shown recently that coding for the Gaussian Wiretap Channel can be done with nested lattices. A fine lattice intended to the legitimate user must be designed as a usual lattice code for the Gaussian Channel, while a coarse lattice is added to introduce confusion at the eavesdropper, whose theta series must be minimized. We present a design criterion for both the fine and coarse lattice to obtain wiretap lattice codes for the Rayleigh fading Wiretap Channel.
Compliance of POLYAS with the Common Criteria Protection Profile
Venue: arXiv cs.CR 2010
Year: 2010

In 2008, the German Federal Office for Information Security issued the common criteria protection profile for Online Voting Products (PP-0037). Accord- ingly, we evaluated the Polyas electronic voting system, which is used for legally binding elections in several international organizations (German Gesellschaft for Informatik, GI, among others), for compliance with the common criteria protection profile and worked toward fulfilling the given requirements. In this article we pre- sent the findings of the process of creating a compliant security target, necessary restrictions and assumptions to the system design as well as the workings of the committee, and architectural and procedural changes made necessary.
An Experimental Approach for Optimising Mobile Agent Migrations
Venue: arXiv cs.NI 2010
Year: 2010

The field of mobile agent (MA) technology has been intensively researched during the past few years, resulting in the phenomenal proliferation of available MA platforms, all sharing several common design characteristics. Research projects have mainly focused on identifying applications where the employment of MAs is preferable compared to centralised or alternative distributed computing models. Very little work has been made on examining how MA platforms design can be optimised so as the network traffic and latency associated with MA transfers are minimised. The work presented in this paper addresses these issues by investigating the effect of several optimisation ideas applied on our MA platform prototype. Furthermore, we discuss the results of a set of timing experiments that offers a better understanding of the agent migration process and recommend new techniques for reducing MA transfers delay.
Selective Multipath Interference Canceller with Linear Equalization for DS-UWB Systems with Low Spreading Factor
Venue: arXiv cs.NI 2010
Year: 2010

In high rate DS-UWB systems with low spreading factor, the selective multipath interference canceller with linear equalization (SMPIC-LE) is developed to alleviate severe multipath interferences induced by the poor orthogonality of spreading codes. The SMPIC iteratively mitigates the strongest inter-path interference, inter-chip interference and inter-symbol interference, while the former two are unresolvable in conventional RAKE-decision feedback equalizer (DFE) receivers. The numerical results and complexity analysis demonstrate that SMPIC-LE with proper parameters provides an attractive overall advantage in performance and computational complexity compared with RAKE-DFE. In addition, it approaches the matched filter bound well as the RAKE finger in SMPIC increases.
A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application to Watermarking
Venue: arXiv cs.CR 2010
Year: 2010

In this paper, a new chaotic pseudo-random number generator (PRNG) is proposed. It combines the well-known ISAAC and XORshift generators with chaotic iterations. This PRNG possesses important properties of topological chaos and can successfully pass NIST and TestU01 batteries of tests. This makes our generator suitable for information security applications like cryptography. As an illustrative example, an application in the field of watermarking is presented.
Mutual information, matroids and extremal dependencies
Venue: arXiv cs.IT 2010
Year: 2010

In this paper, it is shown that the rank function of a matroid can be represented by a "mutual information function" if and only if the matroid is binary. The mutual information function considered is the one measuring the amount of information between the inputs (binary uniform) and the output of a multiple access channel (MAC). Moreover, it is shown that a MAC whose mutual information function is integer valued is "equivalent" to a linear deterministic MAC, in the sense that it essentially contains at the output no more information than some linear forms of the inputs. These notes put emphasis on the connection between mutual information functionals and rank functions in matroid theory, without assuming prior knowledge on these two subjects. The first section introduces mutual information functionals, the second section introduces basic notions of matroid theory, and the third section connects these two subjects. It is also shown that entropic matroids studied in the literature correspond to specific cases of MAC matroids.
Chem2Bio2RDF: A Linked Open Data Portal for Chemical Biology
Venue: arXiv cs.IR 2010
Year: 2010

The Chem2Bio2RDF portal is a Linked Open Data (LOD) portal for systems chemical biology aiming for facilitating drug discovery. It converts around 25 different datasets on genes, compounds, drugs, pathways, side effects, diseases, and MEDLINE/PubMed documents into RDF triples and links them to other LOD bubbles, such as Bio2RDF, LODD and DBPedia. The portal is based on D2R server and provides a SPARQL endpoint, but adds on few unique features like RDF faceted browser, user-friendly SPARQL query generator, MEDLINE/PubMed cross validation service, and Cytoscape visualization plugin. Three use cases demonstrate the functionality and usability of this portal.
Analytical Modeling of Saturation Throughput in Power Save Mode of an IEEE 802.11 Infrastructure WLAN
Venue: arXiv cs.NI 2010
Year: 2010

We consider a single station (STA) in the Power Save Mode (PSM) of an IEEE 802.11 infrastructure WLAN. This STA is assumed to be carrying uplink and downlink traffic via the access point (AP). We assume that the transmission queues of the AP and the STA are saturated, i.e., the AP and the STA always have at least one packet to send. For this scenario, it is observed that uplink and downlink throughputs achieved are different. The reason behind the difference is the long term attempt rates of the STA and the AP due to the PSM protocol. In this paper we first obtain the the long term attempt rates of the STA and the AP and using these, we obtain the saturation throughputs of the AP and the STA. We provide a validation of analytical results using the NS-2 simulator.
Input Parameters Optimization in Swarm DS-CDMA Multiuser Detectors
Venue: arXiv cs.AI 2010
Year: 2010

In this paper, the uplink direct sequence code division multiple access (DS-CDMA) multiuser detection problem (MuD) is studied into heuristic perspective, named particle swarm optimization (PSO). Regarding different system improvements for future technologies, such as high-order modulation and diversity exploitation, a complete parameter optimization procedure for the PSO applied to MuD problem is provided, which represents the major contribution of this paper. Furthermore, the performance of the PSO-MuD is briefly analyzed via Monte-Carlo simulations. Simulation results show that, after convergence, the performance reached by the PSO-MuD is much better than the conventional detector, and somewhat close to the single user bound (SuB). Rayleigh flat channel is initially considered, but the results are further extend to diversity (time and spatial) channels.
Target-driven merging of Taxonomies
Venue: arXiv cs.DB 2010
Year: 2010

The proliferation of ontologies and taxonomies in many domains increasingly demands the integration of multiple such ontologies. The goal of ontology integration is to merge two or more given ontologies in order to provide a unified view on the input ontologies while maintaining all information coming from them. We propose a new taxonomy merging algorithm that, given as input two taxonomies and an equivalence matching between them, can generate an integrated taxonomy in a fully automatic manner. The approach is target-driven, i.e. we merge a source taxonomy into the target taxonomy and preserve the structure of the target ontology as much as possible. We also discuss how to extend the merge algorithm providing auxiliary information, like additional relationships between source and target concepts, in order to semantically improve the final result. The algorithm was implemented in a working prototype and evaluated using synthetic and real-world scenarios.
Applying centrality measures to impact analysis: A coauthorship network analysis
Venue: arXiv cs.DL 2010
Year: 2010

Many studies on coauthorship networks focus on network topology and network statistical mechanics. This article takes a different approach by studying micro-level network properties, with the aim to apply centrality measures to impact analysis. Using coauthorship data from 16 journals in the field of library and information science (LIS) with a time span of twenty years (1988-2007), we construct an evolving coauthorship network and calculate four centrality measures (closeness, betweenness, degree and PageRank) for authors in this network. We find out that the four centrality measures are significantly correlated with citation counts. We also discuss the usability of centrality measures in author ranking, and suggest that centrality measures can be useful indicators for impact analysis.
Discovering author impact: A PageRank perspective
Venue: arXiv cs.DL 2010
Year: 2010

This article provides an alternative perspective for measuring author impact by applying PageRank algorithm to a coauthorship network. A weighted PageRank algorithm considering citation and coauthorship network topology is proposed. We test this algorithm under different damping factors by evaluating author impact in the informetrics research community. In addition, we also compare this weighted PageRank with the h-index, citation, and program committee (PC) membership of the International Society for Scientometrics and Informetrics (ISSI) conferences. Findings show that this weighted PageRank algorithm provides reliable results in measuring author impact.
PageRank for ranking authors in co-citation networks
Venue: arXiv cs.DL 2010
Year: 2010

Google's PageRank has created a new synergy to information retrieval for a better ranking of Web pages. It ranks documents depending on the topology of the graphs and the weights of the nodes. PageRank has significantly advanced the field of information retrieval and keeps Google ahead of competitors in the search engine market. It has been deployed in bibliometrics to evaluate research impact, yet few of these studies focus on the important impact of the damping factor (d) for ranking purposes. This paper studies how varied damping factors in the PageRank algorithm can provide additional insight into the ranking of authors in an author co-citation network. Furthermore, we propose weighted PageRank algorithms. We select 108 most highly cited authors in the information retrieval (IR) area from the 1970s to 2008 to form the author co-citation network. We calculate the ranks of these 108 authors based on PageRank with damping factor ranging from 0.05 to 0.95. In order to test the relationship between these different measures, we compare PageRank and weighted PageRank results with the citation ranking, h-index, and centrality measures. We found that in our author co-citation network, citation rank is highly correlated with PageRank's with different damping factors and also with different PageRank algorithms; citation rank and PageRank are not significantly correlated with centrality measures; and h-index is not significantly correlated with centrality measures.
Generalized Delaunay Graphs with respect to any Convex Set are Plane Graphs
Venue: arXiv cs.CG 2010
Year: 2010

We consider two types of geometric graphs on point sets on the plane based on a plane set C: one obtained by translates of C, another by positively scaled translates (homothets) of C. For compact and convex C, graphs defined by scaled translates of C, i.e., Delaunay graphs based on C, are known to be plane graphs. We show that as long as C is convex, both types of graphs are plane graphs.
On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity
Venue: arXiv cs.SC 2010
Year: 2010

We prove that the Tiden and Arnborg algorithm for equational unification modulo one-sided distributivity is not polynomial time bounded as previously thought. A set of counterexamples is developed that demonstrates that the algorithm goes through exponentially many steps.
Recursive Definitions of Monadic Functions
Venue: arXiv cs.LO 2010
Year: 2010

Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's imperative programming extension, which results in a convenient definition principle for imperative programs, which were previously hard to define. For such monadic functions, the recursion equation can always be derived without preconditions, even if the function is partial. The construction is easy to automate, and convenient induction principles can be derived automatically.
Timed Game Abstraction of Control Systems
Venue: arXiv cs.SY 2010
Year: 2010

This paper proposes a method for abstracting control systems by timed game automata, and is aimed at obtaining automatic controller synthesis. The proposed abstraction is based on partitioning the state space of a control system using positive and negative invariant sets, generated by Lyapunov functions. This partitioning ensures that the vector field of the control system is transversal to the facets of the cells, which induces some desirable properties of the abstraction. To allow a rich class of control systems to be abstracted, the update maps of the timed game automaton are extended. Conditions on the partitioning of the state space and the control are set up to obtain sound abstractions. Finally, an example is provided to demonstrate the method applied to a control problem related to navigation.
Exploring Grid Polygons Online
Venue: arXiv cs.CG 2010
Year: 2010

We investigate the exploration problem of a short-sighted mobile robot moving in an unknown cellular room. To explore a cell, the robot must enter it. Once inside, the robot knows which of the 4 adjacent cells exist and which are boundary edges. The robot starts from a specified cell adjacent to the room's outer wall; it visits each cell, and returns to the start. Our interest is in a short exploration tour; that is, in keeping the number of multiple cell visits small. For abitrary environments containing no obstacles we provide a strategy producing tours of length S <= C + 1/2 E - 3, and for environments containing obstacles we provide a strategy, that is bound by S <= C + 1/2 E + 3H + WCW - 2, where C denotes the number of cells-the area-, E denotes the number of boundary edges-the perimeter-, and H is the number of obstacles, and WCW is a measure for the sinuosity of the given environment.
Condensation into ground state in binary string models
Venue: arXiv cs.IT 2010
Year: 2010

The ensemble of binary strings defined via strong-interaction model exhibits enhanced condensation (collapse) into ground state below certain temperature. The non-interaction model shows gradual accumulation into ground state as temperature approaches zero
Trajectory Codes for Flash Memory
Venue: arXiv cs.IT 2010
Year: 2010

Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the stored data changes its value with certain patterns. The patterns of data updates are determined by the data structure and the application, and are independent of the constraints imposed by the storage medium. Thus, an appropriate coding scheme is needed so that the data changes can be updated and stored efficiently under the storage-medium's constraints. In this paper, we define the general rewriting problem using a graph model. It extends many known rewriting models such as floating codes, WOM codes, buffer codes, etc. We present a new rewriting scheme for flash memories, called the trajectory code, for rewriting the stored data as many times as possible without block erasures. We prove that the trajectory code is asymptotically optimal in a wide range of scenarios. We also present randomized rewriting codes optimized for expected performance (given arbitrary rewriting sequences). Our rewriting codes are shown to be asymptotically optimal.
Checkable Codes from Group Rings
Venue: arXiv cs.IT 2010
Year: 2010

We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a code-checkable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in the case where the group is a finite abelian group and the ring is a finite field. This characterization leads to many good examples, among which two checkable codes and two shortened codes have minimum distance better than the lower bound given in Grassl's online table. Furthermore, when a group ring is code-checkable, it is shown that every code in such a group ring admits a generator, and that its dual is also generated by an element which may be deduced directly from a check element of the original code. These are analogous to the generator and parity-check polynomials of cyclic codes. In addition, the structures of reversible and complementary dual checkable codes are established as generalizations of reversible and complementary dual cyclic codes.
Termination of Rewriting with and Automated Synthesis of Forbidden Patterns
Venue: arXiv cs.LO 2010
Year: 2010

We introduce a modified version of the well-known dependency pair framework that is suitable for the termination analysis of rewriting under forbidden pattern restrictions. By attaching contexts to dependency pairs that represent the calling contexts of the corresponding recursive function calls, it is possible to incorporate the forbidden pattern restrictions in the (adapted) notion of dependency pair chains, thus yielding a sound and complete approach to termination analysis. Building upon this contextual dependency pair framework we introduce a dependency pair processor that simplifies problems by analyzing the contextual information of the dependency pairs. Moreover, we show how this processor can be used to synthesize forbidden patterns suitable for a given term rewriting system on-the-fly during the termination analysis.
The Ethics of Robotics
Venue: arXiv cs.AI 2010
Year: 2010

The three laws of Robotics first appeared together in Isaac Asimov's story 'Runaround' after being mentioned in some form or the other in previous works by Asimov. These three laws commonly known as the three laws of robotics are the earliest forms of depiction for the needs of ethics in Robotics. In simplistic language Isaac Asimov is able to explain what rules a robot must confine itself to in order to maintain societal sanctity. However, even though they are outdated they still represent some of our innate fears which are beginning to resurface in present day 21st Century. Our society is on the advent of a new revolution; a revolution led by advances in Computer Science, Artificial Intelligence & Nanotechnology. Some of our advances have been so phenomenal that we surpassed what was predicted by the Moore's law. With these advancements comes the fear that our future may be at the mercy of these androids. Humans today are scared that we, ourselves, might create something which we cannot control. We may end up creating something which can not only learn much faster than anyone of us can, but also evolve faster than what the theory of evolution has allowed us to. The greatest fear is not only that we might lose our jobs to these intelligent beings, but that these beings might end up replacing us at the top of the cycle. The public hysteria has been heightened more so by a number of cultural works which depict annihilation of the human race by robots. Right from Frankenstein to I, Robot mass media has also depicted such issues. This paper is an effort to understand the need for ethics in Robotics or simply termed as Roboethics. This is achieved by the study of artificial beings and the thought being put behind them. By the end of the paper, however, it is concluded that there isn't a need for ethical robots but more so ever a need for ethical roboticists.