OpenRaiser/Intern-Atlas huggingface dataset:
Relay Placement for Physical Layer Security: A Secure Connection Perspective
Venue: arXiv cs.IT 2012
Year: 2012

This work studies the problem of secure connection in cooperative wireless communication with two relay strategies, decode-and-forward (DF) and randomize-and-forward (RF). The four-node scenario and cellular scenario are considered. For the typical four-node (source, destination, relay, and eavesdropper) scenario, we derive the optimal power allocation for the DF strategy and find that the RF strategy is always better than the DF to enhance secure connection. In cellular networks, we show that without relay, it is difficult to establish secure connections from the base station to the cell edge users. The effect of relay placement for the cell edge users is demonstrated by simulation. For both scenarios, we find that the benefit of relay transmission increases when path loss becomes severer.
Robust Soldier Crab Ball Gate
Venue: arXiv cs.ET 2012
Year: 2012

Soldier crabs Mictyris guinotae exhibit pronounced swarming behaviour. The swarms of the crabs tolerant of perturbations. In computer models and laboratory experiments we demonstrate that swarms of soldier crabs can implement logical gates when placed in a geometrically constrained environment.
A Non-Triviality Certificate for Scalars and its application to Linear Systems
Venue: arXiv cs.CC 2012
Year: 2012

We present an approach of taking a linear weighted Average of N given scalars, such that this Average is zero, if and only if, all N scalars are zero. The weights for the scalars in this Average vary asymptotically with respect to a large positive real. We use this approach with a previous result on Asymptotic Linear Programming, to develop an O(M^4) Algorithm that decides whether or not a system of M Linear Inequalities is feasible, and, whether or not any desired subset of the variables in this system, is permitted to have a non-trivial solution.
Using Nyquist or Nyquist-Like Plot to Predict Three Typical Instabilities in DC-DC Converters
Venue: arXiv cs.SY 2012
Year: 2012

By transforming an exact stability condition, a new Nyquist-like plot is proposed to predict occurrences of three typical instabilities in DC-DC converters. The three instabilities are saddle-node bifurcation (coexistence of multiple solutions), period-doubling bifurcation (subharmonic oscillation), and Neimark bifurcation (quasi-periodic oscillation). In a single plot, it accurately predicts whether an instability occurs and what type the instability is. The plot is equivalent to the Nyquist plot, and it is a useful design tool to avoid these instabilities. Nine examples are used to illustrate the accuracy of this new plot to predict instabilities in the buck or boost converter with fixed or variable switching frequency.
Design and Implementation of BCM Rule Based on Spike-Timing Dependent Plasticity
Venue: arXiv cs.OH 2012
Year: 2012

The Bienenstock-Cooper-Munro (BCM) and Spike Timing-Dependent Plasticity (STDP) rules are two experimentally verified form of synaptic plasticity where the alteration of synaptic weight depends upon the rate and the timing of pre- and post-synaptic firing of action potentials, respectively. Previous studies have reported that under specific conditions, i.e. when a random train of Poissonian distributed spikes are used as inputs, and weight changes occur according to STDP, it has been shown that the BCM rule is an emergent property. Here, the applied STDP rule can be either classical pair-based STDP rule, or the more powerful triplet-based STDP rule. In this paper, we demonstrate the use of two distinct VLSI circuit implementations of STDP to examine whether BCM learning is an emergent property of STDP. These circuits are stimulated with random Poissonian spike trains. The first circuit implements the classical pair-based STDP, while the second circuit realizes a previously described triplet-based STDP rule. These two circuits are simulated using 0.35 um CMOS standard model in HSpice simulator. Simulation results demonstrate that the proposed triplet-based STDP circuit significantly produces the threshold-based behaviour of the BCM. Also, the results testify to similar behaviour for the VLSI circuit for pair-based STDP in generating the BCM.
Two-Way Communication with Energy Exchange
Venue: arXiv cs.IT 2012
Year: 2012

The conventional assumption made in the design of communication systems is that the energy used to transfer information between a sender and a recipient cannot be reused for future communication tasks. A notable exception to this norm is given by passive RFID systems, in which a reader can transfer both information and energy via the transmitted radio signal. Conceivably, any system that exchanges information via the transfer of given physical resources (radio waves, particles, qubits) can potentially reuse, at least part, of the received resources for communication later on. In this paper, a two-way communication system is considered that operates with a given initial number of physical resources, referred to as energy units. The energy units are not replenished from outside the system, and are assumed, for simplicity, to be constant over time. A node can either send an "on" symbol (or "1"), which costs one unit of energy, or an "off" signal (or "0"), which does not require any energy expenditure. Upon reception of a "1" signal, the recipient node "harvests" the energy contained in the signal and stores it for future communication tasks. Inner and outer bounds on the achievable rates are derived, and shown via numerical results to coincide if the number of energy units is large enough.
Random walks which prefer unvisited edges. Exploring high girth even degree expanders in linear time
Venue: arXiv cs.DS 2012
Year: 2012

We consider a modified random walk which uses unvisited edges whenever possible, and makes a simple random walk otherwise. We call such a walk an edge-process. We assume there is a rule A, which tells the walk which unvisited edge to use whenever there is a choice. In the simplest case, A is a uniform random choice over unvisited edges incident with the current walk position. However we do not exclude arbitrary choices of rule A. For example, the rule could be determined on-line by an adversary, or could vary from vertex to vertex. For even degree expander graphs, of bounded maximum degree, we have the following result. Let G be an n vertex even degree expander graph, for which every vertex is in at least one vertex induced cycle of length L. Any edge-process on G has cover time (n+ (n log n)/L). This result is independent of the rule A used to select the order of the unvisited edges, which can be chosen on-line by an adversary. As an example, With high probability, random r-regular graphs, (r at least 4, even), are expanders for which L = Omega(log n). Thus, for almost all such graphs, the vertex cover time of the edge-process is Theta(n). This improves the vertex cover time of such graphs by a factor of log n, compared to the Omega(n log n) cover time of any weighted random walk.
Applications of fuzzy logic to Case-Based Reasoning
Venue: arXiv cs.AI 2012
Year: 2012

The article discusses some applications of fuzzy logic ideas to formalizing of the Case-Based Reasoning (CBR) process and to measuring the effectiveness of CBR systems
A New Reduction from Search SVP to Optimization SVP
Venue: arXiv cs.CC 2012
Year: 2012

It is well known that search SVP is equivalent to optimization SVP. However, the former reduction from search SVP to optimization SVP by Kannan needs polynomial times calls to the oracle that solves the optimization SVP. In this paper, a new rank-preserving reduction is presented with only one call to the optimization SVP oracle. It is obvious that the new reduction needs the least calls, and improves Kannan's classical result. What's more, the idea also leads a similar direct reduction from search CVP to optimization CVP with only one call to the oracle.
A Novel Design for Quantum-dot Cellular Automata Cells and Full Adders
Venue: arXiv cs.ET 2012
Year: 2012

Quantum dot Cellular Automata (QCA) is a novel and potentially attractive technology for implementing computing architectures at the nanoscale. The basic Boolean primitive in QCA is the majority gate. In this paper we present a novel design for QCA cells and another possible and unconventional scheme for majority gates. By applying these items, the hardware requirements for a QCA design can be reduced and circuits can be simpler in level and gate counts. As an example, a 1-bit QCA adder is constructed by applying our new scheme and is compared to the other existing implementation. Beside, some Boolean functions are expressed as examples and it has been shown, how our reduction method by using new proposed item, decreases gate counts and levels in comparison to the other previous methods.
A Theoretical and Empirical Evaluation of Software Component Search Engines, Semantic Search Engines and Google Search Engine in the Context of COTS-Based Development
Venue: arXiv cs.IR 2012
Year: 2012

COTS-based development is a component reuse approach promising to reduce costs and risks, and ensure higher quality. The growing availability of COTS components on the Web has concretized the possibility of achieving these objectives. In this multitude, a recurrent problem is the identification of the COTS components that best satisfy the user requirements. Finding an adequate COTS component implies searching among heterogeneous descriptions of the components within a broad search space. Thus, the use of search engines is required to make more efficient the COTS components identification. In this paper, we investigate, theoretically and empirically, the COTS component search performance of eight software component search engines, nine semantic search engines and a conventional search engine (Google). Our empirical evaluation is conducted with respect to precision and normalized recall. We defined ten queries for the assessed search engines. These queries were carefully selected to evaluate the capability of each search engine for handling COTS component identification.
Ergodic Capacity of Cognitive Radio under Imperfect Channel State Information
Venue: arXiv cs.IT 2012
Year: 2012

A spectrum-sharing communication system where the secondary user is aware of the instantaneous channel state information (CSI) of the secondary link, but knows only the statistics and an estimated version of the secondary transmitter-primary receiver (ST-PR) link, is investigated. The optimum power profile and the ergodic capacity of the secondary link are derived for general fading channels (with continuous probability density function) under average and peak transmit-power constraints and with respect to two different interference constraints: an interference outage constraint and a signal-to-interference outage constraint. When applied to Rayleigh fading channels, our results show, for instance, that the interference constraint is harmful at high-power regime in the sense that the capacity does not increase with the power, whereas at low-power regime, it has a marginal impact and no-interference performance corresponding to the ergodic capacity under average or peak transmit power constraint in absence of the primary user, may be achieved.
Primary Rate-Splitting Achieves Capacity for the Gaussian Cognitive Interference Channel
Venue: arXiv cs.IT 2012
Year: 2012

The cognitive interference channel models cognitive overlay radio systems, where cognitive radios overhear the transmission of neighboring nodes. Capacity for this channel is not known in general. For the Gaussian case capacity is known in three regimes, usually denoted as the "weak interference", "very strong interference" and "primary decodes cognitive". This paper provides a new capacity result, based on rate-splitting of the primary user's message into a public and private part and that generalizes the capacity results in the "very strong interference" and "primary decodes cognitive" regimes. This result indicates that capacity of the cognitive interference channel not only depends on channel conditions but also the level of cooperation with the primary user.
Analog Network Coding in General SNR Regime: Performance of Network Simplification
Venue: arXiv cs.IT 2012
Year: 2012

We consider a communication scenario where a source communicates with a destination over a directed layered relay network. Each relay performs analog network coding where it scales and forwards the signals received at its input. In this scenario, we address the question: What portion of the maximum end-to-end achievable rate can be maintained if only a fraction of relay nodes available at each layer are used? We consider, in particular, the Gaussian diamond network (layered network with a single layer of relay nodes) and a class of symmetric layered networks. For these networks we show that each relay layer increases the additive gap between the optimal analog network coding performance with and without network simplification (using k instead of N relays in each layer, k < N) by no more than log(N/k)^2 bits and the corresponding multiplicative gap by no more than a factor of (N/k)^2, asymptotically (in source power). To the best of our knowledge, this work offers the first characterization of the performance of network simplification in general layered amplify-and-forward relay networks. Further, unlike most of the current approximation results that attempt to bound optimal rates either within an additive gap or a multiplicative gap, our results suggest a new rate approximation scheme that allows for the simultaneous computation of additive and multiplicative gaps.
Clique in 3-track interval graphs is APX-hard
Venue: arXiv cs.CC 2012
Year: 2012

Butman, Hermelin, Lewenstein, and Rawitz proved that Clique in t-interval graphs is NP-hard for t >= 3. We strengthen this result to show that Clique in 3-track interval graphs is APX-hard.
Development of a Conceptual Structure for a Domain-Specific Corpus
Venue: arXiv cs.IR 2012
Year: 2012

The corpus reported in this paper was developed for the evaluation of a domain-specific Text to Knowledge Mapping (TKM) prototype. The TKM prototype operates on the basis of both a combinatory categorical grammar (CCG) linguistic model and a knowledge model that consists of three layers: ontology, qualitative and quantitative layers. In the course of this evaluation it was necessary to populate these initial models with lexical items and semantic relations. Both elements, the lexicon and semantic relations, are meant to reflect the domain of the prototype; hence both had to be extracted from the corpus. While dealing with the lexicon was straight forward, the identification and extraction of appropriate semantic relations was much more involved. It was necessary, therefore, to manually develop a conceptual structure for the domain which was then used to formulate a domain-specific framework of semantic relations. The conceptual structure was developed using the Cmap tool of IHMC. The framework of semantic relations- that has resulted from this study consisted of 55 relations, out of which 42 have inverse relations.
Ubiquitous WLAN/Camera Positioning using Inverse Intensity Chromaticity Space-based Feature Detection and Matching: A Preliminary Result
Venue: arXiv cs.CV 2012
Year: 2012

This paper present our new intensity chromaticity space-based feature detection and matching algorithm. This approach utilizes hybridization of wireless local area network and camera internal sensor which to receive signal strength from a access point and the same time retrieve interest point information from hallways. This information is combined by model fitting approach in order to find the absolute of user target position. No conventional searching algorithm is required, thus it is expected reducing the computational complexity. Finally we present pre-experimental results to illustrate the performance of the localization system for an indoor environment set-up.
Applying convex layers, nearest neighbor and triangle inequality to the Traveling Salesman Problem (TSP)
Venue: arXiv cs.OH 2012
Year: 2012

The author would like to propose a simple but yet effective method, convex layers, nearest neighbor and triangle inequality, to approach the Traveling Salesman Problem (TSP). No computer is needed in this method. This method is designed for plain folks who faced the TSP everyday but do not have the sophisticated knowledge of computer science, programming language or applied mathematics. The author also hopes that it would give some insights to researchers who are interested in the TSP.
Evolutionarily Stable Spectrum Access
Venue: arXiv cs.NI 2012
Year: 2012

In this paper, we design distributed spectrum access mechanisms with both complete and incomplete network information. We propose an evolutionary spectrum access mechanism with complete network information, and show that the mechanism achieves an equilibrium that is globally evolutionarily stable. With incomplete network information, we propose a distributed learning mechanism, where each user utilizes local observations to estimate the expected throughput and learns to adjust its spectrum access strategy adaptively over time. We show that the learning mechanism converges to the same evolutionary equilibrium on the time average. Numerical results show that the proposed mechanisms are robust to the perturbations of users' channel selections.
Investigating Effort Prediction of Software Projects on the ISBSG Dataset
Venue: arXiv cs.SE 2012
Year: 2012

Many cost estimation models have been proposed over the last three decades. In this study, we investigate fuzzy ID3 decision tree as a method for software effort estimation. Fuzzy ID software effort estimation model is designed by incorporating the principles of ID3 decision tree and the concepts of the fuzzy settheoretic; permitting the model to handle uncertain and imprecise data when presenting the software projects. MMRE (Mean Magnitude of Relative Error) and Pred(l) (Prediction at level l) are used, as measures of prediction accuracy, for this study. A series of experiments is reported using ISBSG software projects dataset. Fuzzy trees are grown using different fuzziness control thresholds. Results showed that optimizing the fuzzy ID3 parameters can improve greatly the accuracy of the generated software cost estimate.
Privacy via the Johnson-Lindenstrauss Transform
Venue: arXiv cs.DS 2012
Year: 2012

Suppose that party A collects private information about its users, where each user's data is represented as a bit vector. Suppose that party B has a proprietary data mining algorithm that requires estimating the distance between users, such as clustering or nearest neighbors. We ask if it is possible for party A to publish some information about each user so that B can estimate the distance between users without being able to infer any private bit of a user. Our method involves projecting each user's representation into a random, lower-dimensional space via a sparse Johnson-Lindenstrauss transform and then adding Gaussian noise to each entry of the lower-dimensional representation. We show that the method preserves differential privacy---where the more privacy is desired, the larger the variance of the Gaussian noise. Further, we show how to approximate the true distances between users via only the lower-dimensional, perturbed data. Finally, we consider other perturbation methods such as randomized response and draw comparisons to sketch-based methods. While the goal of releasing user-specific data to third parties is more broad than preserving distances, this work shows that distance computations with privacy is an achievable goal.
Cloud Computing For Microfinances
Venue: arXiv cs.OH 2012
Year: 2012

Evolution of Science and Engineering has led to the growth of several commercial applications. The wide spread implementation of commercial based applications has in turn directed the emergence of advanced technologies such as cloud computing. India has well proven itself as a potential hub for advanced technologies including cloud based industrial market. Microfinance system has emerged out as a panacea to Indian economy since the population encompasses of people who come under poverty and below poverty index. However, one of the key challenges in successful operation of microfinance system in India has given rise to integration of financial services using sophisticated cloud computing model. This paper, therefore propose a fundamental cloud-based microfinance model in order to reduce high transaction risks involved during microfinance operations in an inexpensive and efficient manner.
A Cooperative Network Coding Strategy for the Interference Relay Channel
Venue: arXiv cs.NI 2012
Year: 2012

In this paper, we study an interference relay network with a satellite as relay. We propose a cooperative strategy based on physical layer network coding and superposition modulation decoding for uni-directional communications among users. The performance of our solution in terms of throughput is evaluated through capacity analysis and simulations that include practical constraints such as the lack of synchronization in time and frequency. We demonstrate throughputs significantly larger than the classical time sharing case.
Layered Fixed Point Logic
Venue: arXiv cs.LO 2012
Year: 2012

We present a logic for the specification of static analysis problems that goes beyond the logics traditionally used. Its most prominent feature is the direct support for both inductive computations of behaviors as well as co-inductive specifications of properties. Two main theoretical contributions are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases the complexity result specializes to the worst case time complexity of the classical methods.
Performance-Optimum Superscalar Architecture for Embedded Applications
Venue: arXiv cs.AR 2012
Year: 2012

Embedded applications are widely used in portable devices such as wireless phones, personal digital assistants, laptops, etc. High throughput and real time requirements are especially important in such data-intensive tasks. Therefore, architectures that provide the required performance are the most desirable. On the other hand, processor performance is severely related to the average memory access delay, number of processor registers and also size of the instruction window and superscalar parameters. Therefore, cache, register file and superscalar parameters are the major architectural concerns in designing a superscalar architecture for embedded processors. Although increasing cache and register file size leads to performance improvements in high performance embedded processors, the increased area, power consumption and memory delay are the overheads of these techniques. This paper explores the effect of cache, register file and superscalar parameters on the processor performance to specify the optimum size of these parameters for embedded applications. Experimental results show that although having bigger size of these parameters is one of the performance improvement approaches in embedded processors, however, by increasing the size of some parameters over a threshold value, performance improvement is saturated and especially in cache size, increments over this threshold value decrease the performance.