OpenRaiser/Intern-Atlas huggingface dataset:
Adaptive Control in Swarm Robotics
Venue: arXiv cs.SY 2013
Year: 2013

Swarm robotic systems are mainly inspired by swarms of socials insects and the collective emergent behavior that arises from their cooperation at the lower lever. Despite the limited sensory ability, computational power, and communication means of each swarm member, the swarm as a group manages to achieve difficult tasks such as searching for food in terrains with obstacles that individual robots cannot achieve in isolation of the other group members. Moreover, such tasks are usually achieved without having information sharing capabilities at the swarm level or having a centralized decision making system. In this report, I survey the state of the field of applying adaptive control method to increase swarm robotic systems robustness to the failure of individual robots, and increase its efficiency in performing its task. A few techniques for the division of labor problem are briefly presented while one of them is given in more detail. A discussion of the advantages and disadvantages of this system is given and suggestions of potential improvements that can be made to the system are presented.
Normalization of Polynomials in Algebraic Invariants of Three-Dimensional Orthogonal Geometry
Venue: arXiv cs.SC 2013
Year: 2013

In classical invariant theory, the Gröbner base of the ideal of syzygies and the normal forms of polynomials of invariants are two core contents. To improve the performance of invariant theory in symbolic computing of classical geometry, advanced invariants are introduced via Clifford product. This paper addresses and solves the two key problems in advanced invariant theory: the Gröbner base of the ideal of syzygies among advanced invariants, and the normal forms of polynomials of advanced invariants. These results beautifully extend the straightening of Young tableaux to advanced invariants.
The Mesh of Civilizations and International Email Flows
Venue: arXiv cs.SI 2013
Year: 2013

In The Clash of Civilizations, Samuel Huntington argued that the primary axis of global conflict was no longer ideological or economic but cultural and religious, and that this division would characterize the "battle lines of the future." In contrast to the "top down" approach in previous research focused on the relations among nation states, we focused on the flows of interpersonal communication as a bottom-up view of international alignments. To that end, we mapped the locations of the world's countries in global email networks to see if we could detect cultural fault lines. Using IP-geolocation on a worldwide anonymized dataset obtained from a large Internet company, we constructed a global email network. In computing email flows we employ a novel rescaling procedure to account for differences due to uneven adoption of a particular Internet service across the world. Our analysis shows that email flows are consistent with Huntington's thesis. In addition to location in Huntington's "civilizations," our results also attest to the importance of both cultural and economic factors in the patterning of inter-country communication ties.
Pure Coordination using the Coordinator--Configurator Pattern
Venue: arXiv cs.RO 2013
Year: 2013

This work-in-progress paper reports on our efforts to improve different aspects of coordination in complex, component-based robotic systems. Coordination is a system level aspect concerned with commanding, configuring and monitoring functional computations such that the system as a whole behaves as desired. To that end a variety of models such as Petri-nets or Finite State Machines may be utilized. These models specify actions to be executed, such as invoking operations or configuring components to achieve a certain goal. This traditional approach has several disadvantages related to loss of reusability of coordination models due to coupling with platform-specific functionality, non-deterministic temporal behavior and limited robustness as a result of executing platform operations within the context of the coordinator. To avoid these shortcomings, we propose to split this "rich" coordinator into a Pure Coordinator and a Configurator. Although the coordinator remains in charge of commanding and reacting, the execution of actions is deferred to the Configurator. This pattern, called "Coordinator-Configurator", is implemented as a novel Configurator domain specific language that can be used together with any model of coordination. We illustrate the approach by refactoring an existing application that realizes a safe haptic coupling of two youBot mobile manipulators.
Multidimensional Social Network in the Social Recommender System
Venue: arXiv cs.SI 2013
Year: 2013

All online sharing systems gather data that reflects users' collective behaviour and their shared activities. This data can be used to extract different kinds of relationships, which can be grouped into layers, and which are basic components of the multidimensional social network proposed in the paper. The layers are created on the basis of two types of relations between humans, i.e. direct and object-based ones which respectively correspond to either social or semantic links between individuals. For better understanding of the complexity of the social network structure, layers and their profiles were identified and studied on two, spanned in time, snapshots of the Flickr population. Additionally, for each layer, a separate strength measure was proposed. The experiments on the Flickr photo sharing system revealed that the relationships between users result either from semantic links between objects they operate on or from social connections of these users. Moreover, the density of the social network increases in time. The second part of the study is devoted to building a social recommender system that supports the creation of new relations between users in a multimedia sharing system. Its main goal is to generate personalized suggestions that are continuously adapted to users' needs depending on the personal weights assigned to each layer in the multidimensional social network. The conducted experiments confirmed the usefulness of the proposed model.
Routing for Security in Networks with Adversarial Nodes
Venue: arXiv cs.IT 2013
Year: 2013

We consider the problem of secure unicast transmission between two nodes in a directed graph, where an adversary eavesdrops/jams a subset of nodes. This adversarial setting is in contrast to traditional ones where the adversary controls a subset of links. In particular, we study, in the main, the class of routing-only schemes (as opposed to those allowing coding inside the network). Routing-only schemes usually have low implementation complexity, yet a characterization of the rates achievable by such schemes was open prior to this work. We first propose an LP based solution for secure communication against eavesdropping, and show that it is information-theoretically rate-optimal among all routing-only schemes. The idea behind our design is to balance information flow in the network so that no subset of nodes observe "too much" information. Interestingly, we show that the rates achieved by our routing-only scheme are always at least as good as, and sometimes better, than those achieved by "naïve" network coding schemes (i.e. the rate-optimal scheme designed for the traditional scenario where the adversary controls links in a network rather than nodes.) We also demonstrate non-trivial network coding schemes that achieve rates at least as high as (and again sometimes better than) those achieved by our routing schemes, but leave open the question of characterizing the optimal rate-region of the problem under all possible coding schemes. We then extend these routing-only schemes to the adversarial node-jamming scenarios and show similar results. During the journey of our investigation, we also develop a new technique that has the potential to derive non-trivial bounds for general secure-communication schemes.
Designing Unimodular Codes via Quadratic Optimization is not Always Hard
Venue: arXiv cs.SY 2013
Year: 2013

The NP-hard problem of optimizing a quadratic form over the unimodular vector set arises in radar code design scenarios as well as other active sensing and communication applications. To tackle this problem (which we call unimodular quadratic programming (UQP)), several computational approaches are devised and studied. A specialized local optimization scheme for UQP is introduced and shown to yield superior results compared to general local optimization methods. Furthermore, a \textbf{m}onotonically \textbf{er}ror-bound \textbf{i}mproving \textbf{t}echnique (MERIT) is proposed to obtain the global optimum or a local optimum of UQP with good sub-optimality guarantees. The provided sub-optimality guarantees are case-dependent and generally outperform the $π/4$ approximation guarantee of semi-definite relaxation. Several numerical examples are presented to illustrate the performance of the proposed method. The examples show that for cases including several matrix structures used in radar code design, MERIT can solve UQP efficiently in the sense of sub-optimality guarantee and computational time.
A Coding-Theoretic Application of Baranyai's Theorem
Venue: arXiv cs.IT 2013
Year: 2013

Baranyai's theorem is a well-known theorem in the theory of hypergraphs. A corollary of this theorem says that one can partition the family of all $u$-subsets of an $n$-element set into ${n-1\choose u-1}$ sub-families such that each sub-family form a partition of the $n$-element set, where $n$ is divisible by $u$. In this paper, we present a coding-theoretic application of Baranyai's theorem (or equivalently, the corollary). More precisely, we propose the first purely combinatorial construction of locally decodable codes. Locally decodable codes are error-correcting codes that allow the recovery of any message bit by looking at only a few bits of the codeword. Such codes have attracted a lot of attention in recent years. We stress that our construction does not improve the parameters of known constructions. What makes it interesting is the underlying combinatorial techniques and their potential in future applications.
Spectral Efficient Optimization in OFDM Systems with Wireless Information and Power Transfer
Venue: arXiv cs.IT 2013
Year: 2013

This paper considers an orthogonal frequency division multiplexing (OFDM) point-to-point wireless communication system with simultaneous wireless information and power transfer. We study a receiver which is able to harvest energy from the desired signal, noise, and interference. In particular, we consider a power splitting receiver which dynamically splits the received power into two power streams for information decoding and energy harvesting. We design power allocation algorithms maximizing the spectral efficiency (bit/s/Hz) of data transmission. In particular, the algorithm design is formulated as a nonconvex optimization problem which takes into account the constraint on the minimum power delivered to the receiver. The problem is solved by using convex optimization techniques and a one-dimensional search. The optimal power allocation algorithm serves as a system benchmark scheme due to its high complexity. To strike a balance between system performance and computational complexity, we also propose two suboptimal algorithms which require a low computational complexity. Simulation results demonstrate the excellent performance of the proposed suboptimal algorithms.
Network algebra for synchronous dataflow
Venue: arXiv cs.LO 2013
Year: 2013

We develop an algebraic theory of synchronous dataflow networks. First, a basic algebraic theory of networks, called BNA (Basic Network Algebra), is introduced. This theory captures the basic algebraic properties of networks. For synchronous dataflow networks, it is subsequently extended with additional constants for the branching connections that occur between the cells of synchronous dataflow networks and axioms for these additional constants. We also give two models of the resulting theory, the one based on stream transformers and the other based on processes as considered in process algebra.
mSCTP Based Decentralized Mobility Framework
Venue: arXiv cs.NI 2013
Year: 2013

To conceive the full potential of wireless IP services, Mobile Nodes (MNs) must be able to roam seamlessly across different networks. Mobile Stream Control Transmission Protocol (mSCTP) is a transport layer solution, which unlike Mobile IP (MIP), provides seamless mobility with minimum delay and negligible packet loss. However, mSCTP fails to locate the current IP address of the mobile node when Correspondent Node (CN) wants to initiate a session. In this paper, we propose DHT Chord to provide the required location management. Chord is a P2P algorithm, which can efficiently provide the IP address of the called MN by using its key-value mapping. The proposed decentralized mobility framework collectively exploits the multihoming feature of mSCTP, and efficient key-value mapping of chord to provide seamless mobility. Suitability of the framework is analyzed by preliminary analysis of chord lookup efficiency, and mSCTP handover procedure using overlay weaver and NS-2. Performance analysis shows that mSCTP multihoming feature and Chord efficient key-value mapping can provide a non-delayed, reliable, and an efficient IP handover solution.
Distributed Power Allocation for Coordinated Multipoint Transmissions in Distributed Antenna Systems
Venue: arXiv cs.IT 2013
Year: 2013

This paper investigates the distributed power allocation problem for coordinated multipoint (CoMP) transmissions in distributed antenna systems (DAS). Traditional duality based optimization techniques cannot be directly applied to this problem, because the non-strict concavity of the CoMP transmission's achievable rate with respect to the transmission power induces that the local power allocation subproblems have non-unique optimum solutions. We propose a distributed power allocation algorithm to resolve this non-strict concavity difficulty. This algorithm only requires local information exchange among neighboring base stations serving the same user, and is thus scalable as the network size grows. The step-size parameters of this algorithm are determined by only local user access relationship (i.e., the number of users served by each antenna), but do not rely on channel coefficients. Therefore, the convergence speed of this algorithm is quite robust to different channel fading coefficients. We rigorously prove that this algorithm converges to an optimum solution of the power allocation problem. Simulation results are presented to demonstrate the effectiveness of the proposed power allocation algorithm.
Domain-of-Attraction Estimation for Uncertain Non-polynomial Systems
Venue: arXiv cs.SC 2013
Year: 2013

In this paper, we consider the problem of computing estimates of the domain-of-attraction for non-polynomial systems. A polynomial approximation technique, based on multivariate polynomial interpolation and error analysis for remaining functions, is applied to compute an uncertain polynomial system, whose set of trajectories contains that of the original non-polynomial system. Experiments on the benchmark non-polynomial systems show that our approach gives better estimates of the domain-of-attraction.
An Advanced Certain Trust Model Using Fuzzy Logic and Probabilistic Logic theory
Venue: arXiv cs.CR 2013
Year: 2013

Trustworthiness especially for service oriented system is very important topic now a day in IT field of the whole world. Certain Trust Model depends on some certain values given by experts and developers. Here, main parameters for calculating trust are certainty and average rating. In this paper we have proposed an Extension of Certain Trust Model, mainly the representation portion based on probabilistic logic and fuzzy logic. This extended model can be applied in a system like cloud computing, internet, website, e-commerce, etc. to ensure trustworthiness of these platforms. The model uses the concept of fuzzy logic to add fuzziness with certainty and average rating to calculate the trustworthiness of a system more accurately. We have proposed two new parameters - trust T and behavioral probability P, which will help both the users and the developers of the system to understand its present condition easily. The linguistic variables are defined for both T and P and then these variables are implemented in our laboratory to verify the proposed trust model. We represent the trustworthiness of test system for two cases of evidence value using Fuzzy Associative Memory (FAM). We use inference rules and defuzzification method for verifying the model.
On Performance Analysis of AMBR Protocol in Mobile Ad Hoc Networks
Venue: arXiv cs.NI 2013
Year: 2013

Due to mobility of nodes in ad hoc networks, the most challenging issue is to design and to make sound analysis of a routing protocol that determines its robustness to deliver packets in low routing packet overhead. In this paper, we thoroughly analyzed the Adaptive Monitor Based Routing (AMBR) protocol by varying different parameters that affect a routing protocol to measure its performance. Analysis shows that it requires less routing control overhead comparing with other prevalent routing protocols. An improved analytical model is also presented in this paper. All these analyses firmly prove that AMBR is a sound and robust protocol in terms of flooding, routing overhead and hence, enhances reliability.
Novel Method for Mutational Disease Prediction using Bioinformatics Techniques and Backpropagation Algorithm
Venue: arXiv cs.CE 2013
Year: 2013

Cancer is one of the most feared diseases in the world it has increased disturbingly and breast cancer occurs in one out of eight women, the prediction of malignancies plays essential roles not only in revealing human genome, but also in discovering effective prevention and treatment of cancers. Generally cancer disease driven by somatic mutations in an individual DNA sequence, or genome that accumulates during the lifetime of person. This paper is proposed a novel method can predict the disease by mutations despite The presence in gene sequence is not necessary it are malignant, so will be compare the protein of patient with the gene's protein of disease if there is difference between these two proteins then can say there is malignant mutations. This method will use bioinformatics techniques like FASTA, CLUSTALW, etc which shows whether malignant mutations or not, then training the backpropagation algorithm using all expected malignant mutations for a certain genes (e.g. BRCA1 and BRCA2) of disease, and using it to test whether patient is holder the disease or not. Implementing this novel method as the first way to predict the disease based on mutations in the sequence of the gene that causes the disease shows two decisions are achieved successfully, the first diagnose whether the patient has mutations of cancer or not using bioinformatics techniques the second classifying these mutations are related to breast cancer (e.g. BRCA1 and BRCA2) using backpropagation with mean square rate 0.0000001. Keywords-Gene sequence; Protein; Deoxyribonucleic Acid DNA; Malignant mutation; Bioinformatics; Back-propagation algorithm.
Arabic documents classification using fuzzy R.B.F. classifier with sliding window
Venue: arXiv cs.IR 2013
Year: 2013

In this paper, we propose a system for contextual and semantic Arabic documents classification by improving the standard fuzzy model. Indeed, promoting neighborhood semantic terms that seems absent in this model by using a radial basis modeling. In order to identify the relevant documents to the query. This approach calculates the similarity between related terms by determining the relevance of each relative to documents (NEAR operator), based on a kernel function. The use of sliding window improves the process of classification. The results obtained on a arabic dataset of press show very good performance compared with the literature.
Automatic symmetry based cluster approach for anomalous brain identification in PET scan image : An Analysis
Venue: arXiv cs.CV 2013
Year: 2013

Medical image segmentation is referred to the segmentation of known anatomic structures from different medical images. Normally, the medical data researches are more complicated and an exclusive structures. This computer aided diagnosis is used for assisting doctors in evaluating medical imagery or in recognizing abnormal findings in a medical image. To integrate the specialized knowledge for medical data processing is helpful to form a real useful healthcare decision making system. This paper studies the different symmetry based distances applied in clustering algorithms and analyzes symmetry approach for Positron Emission Tomography (PET) scan image segmentation. Unlike CT and MRI, the PET scan identifies the structure of blood flow to and from organs. PET scan also helps in early diagnosis of cancer and heart, brain and gastro intestinal ailments and to detect the progress of treatment. In this paper, the scope diagnostic task expands for PET image in various brain functions.
EasyTime++: A case study of incremental domain-specific language development
Venue: arXiv cs.PL 2013
Year: 2013

EasyTime is a domain-specific language (DSL) for measuring time during sports competitions. A distinguishing feature of DSLs is that they are much more amenable to change, and EasyTime is no exception in this regard. This paper introduces two new EasyTime features: classifications of competitors into categories, and the inclusion of competitions where the number of laps must be dynamically determined. It shows how such extensions can be incrementally added into the base-language reusing most of the language specifications. Two case studies are presented showing the suitability of this approach.
Functional Dependence in Strategic Games (extended abstract)
Venue: arXiv cs.GT 2013
Year: 2013

The paper studies properties of functional dependencies between strategies of players in Nash equilibria of multi-player strategic games. The main focus is on the properties of functional dependencies in the context of a fixed dependency graph for pay-off functions. A logical system describing properties of functional dependence for any given graph is proposed and is proven to be complete.
Simple Curve Embedding
Venue: arXiv cs.CG 2013
Year: 2013

Given a curve f and a surface S, how hard is it to find a simple curve f' in S that is the most similar to f? We introduce and study this simple curve embedding problem for piecewise linear curves and surfaces in R^2 and R^3, under Hausdorff distance, weak Frechet distance, and Frechet distance as similarity measures for curves. Surprisingly, while several variants of the problem turn out to have polynomial-time solutions, we show that in R^3 the simple curve embedding problem is NP-hard under Frechet distance even if S is a plane, as well as under weak Frechet distance if S is a terrain. Additionally, these results give insight into the difficulty of computing the Frechet distance between surfaces, and they imply that the partial Frechet distance between non-planar surfaces is NP-hard as well.
Longitudinal Analysis of Android Ad Library Permissions
Venue: arXiv cs.CR 2013
Year: 2013

This paper investigates changes over time in the behavior of Android ad libraries. Taking a sample of 100,000 apps, we extract and classify the ad libraries. By considering the release dates of the applications that use a specific ad library version, we estimate the release date for the library, and thus build a chronological map of the permissions used by various ad libraries over time. We find that the use of most permissions has increased over the last several years, and that more libraries are able to use permissions that pose particular risks to user privacy and security.