OpenRaiser/Intern-Atlas huggingface dataset:
What's unusual in online disease outbreak news?
Venue: arXiv cs.CL 2011
Year: 2011

Background: Accurate and timely detection of public health events of international concern is necessary to help support risk assessment and response and save lives. Novel event-based methods that use the World Wide Web as a signal source offer potential to extend health surveillance into areas where traditional indicator networks are lacking. In this paper we address the issue of systematically evaluating online health news to support automatic alerting using daily disease-country counts text mined from real world data using BioCaster. For 18 data sets produced by BioCaster, we compare 5 aberration detection algorithms (EARS C2, C3, W2, F-statistic and EWMA) for performance against expert moderated ProMED-mail postings. Results: We report sensitivity, specificity, positive predictive value (PPV), negative predictive value (NPV), mean alerts/100 days and F1, at 95% confidence interval (CI) for 287 ProMED-mail postings on 18 outbreaks across 14 countries over a 366 day period. Results indicate that W2 had the best F1 with a slight benefit for day of week effect over C2. In drill down analysis we indicate issues arising from the granular choice of country-level modeling, sudden drops in reporting due to day of week effects and reporting bias. Automatic alerting has been implemented in BioCaster available from http://born.nii.ac.jp. Conclusions: Online health news alerts have the potential to enhance manual analytical methods by increasing throughput, timeliness and detection rates. Systematic evaluation of health news aberrations is necessary to push forward our understanding of the complex relationship between news report volumes and case numbers and to select the best performing features and algorithms.
About set-theoretic properties of one-way functions
Venue: arXiv cs.CC 2011
Year: 2011

We investigate the problem of cryptanalysis as a problem belonging to the class NP. A class of problems UF is defined for which the time constructing any feasible solution is polynomial. The properties of the problems of NP, which may be one-way functions, are established.
Blind Known Interference Cancellation
Venue: arXiv cs.IT 2011
Year: 2011

This paper investigates interference-cancellation schemes at the receiver, in which the original data of the interference is known a priori. Such a priori knowledge is common in wireless relay networks. For example, a transmitting relay could be relaying data that was previously transmitted by a node, in which case the interference received by the node now is actually self information. Besides the case of self information, the node could also have overheard or received the interference data in a prior transmission by another node. Directly removing the known interference requires accurate estimate of the interference channel, which may be difficult in many situations. In this paper, we propose a novel scheme, Blind Known Interference Cancellation (BKIC), to cancel known interference without interference channel information. BKIC consists of two steps. The first step combines adjacent symbols to cancel the interference, exploiting the fact that the channel coefficients are almost the same between successive symbols. After such interference cancellation, however, the signal of interest is also distorted. The second step recovers the signal of interest amidst the distortion. We propose two algorithms for the critical second steps. The first algorithm (BKIC-S) is based on the principle of smoothing. It is simple and has near optimal performance in the slow fading scenario. The second algorithm (BKIC-RBP) is based on the principle of real-valued belief propagation. It can achieve MAP-optimal performance with fast convergence, and has near optimal performance even in the fast fading scenario. Both BKIC schemes outperform the traditional self-interference cancellation schemes with perfect initial channel information by a large margin, while having lower complexities.
Optimum Relay Scheme in a Secure Two-Hop Amplify and Forward Cooperative Communication System
Venue: arXiv cs.IT 2011
Year: 2011

A MIMO secure two-hop wireless communication system is considered in this paper. In this model, there are no direct links between the source-destination and the source-eavesdropper. The problem is maximizing the secrecy capacity of the system over all possible amplify and forward (AF) relay strategies, such that the power consumption at the source node and the relay node is limited. When all the nodes are equipped with single antenna, this non-convex optimization problem is fully characterized. When all the nodes (except the intended receiver) are equipped with multiple antennas, the optimization problem is characterized based on the generalized eigenvalues-eigenvectors of the channel gain matrices.
Efficient Traffic Control of VoD System
Venue: arXiv cs.NI 2011
Year: 2011

It has been a challenging issue to provide digital quality multimedia data stream to the remote user through the distributed system. The main aspects to design the real distributed system, which reduce the cost of the network by means of reduce packet loss and enhanced over all system performance. Since the number of user increased rapidly in the network it posed heavy load to the video servers. The requested clients, servers are all distributed in nature and the data stream delivered to the user without error. In this work I have presented the performance of the video on demand server by efficient traffic control at real time with respect to incoming multirate traffic pattern . In this work, I present how the overall system performance gradually decreases when the client population sized in the clusters increase. This work indicated the load balancing required for the on demand video distributed system to provide efficient cost effective service to the local or remote clients.
Odeint - Solving ordinary differential equations in C++
Venue: arXiv cs.MS 2011
Year: 2011

Many physical, biological or chemical systems are modeled by ordinary differential equations (ODEs) and finding their solution is an every-day-task for many scientists. Here, we introduce a new C++ library dedicated to find numerical solutions of initial value problems of ODEs: odeint (www.odeint.com). odeint is implemented in a highly generic way and provides extensive interoperability at top performance. For example, due to it's modular design it can be easily parallized with OpenMP and even runs on CUDA GPUs. Despite that, it provides a convenient interface that allows for a simple and easy usage.
CellSense: An Accurate Energy-Efficient GSM Positioning System
Venue: arXiv cs.NI 2011
Year: 2011

Context-aware applications have been gaining huge interest in the last few years. With cell phones becoming ubiquitous computing devices, cell phone localization has become an important research problem. In this paper, we present CellSense, a prob- abilistic RSSI-based fingerprinting location determi- nation system for GSM phones. We discuss the chal- lenges of implementing a probabilistic fingerprinting localization technique in GSM networks and present the details of the CellSense systemand how it addresses these challenges. We then extend the proposed system using a hybrid technique that combines probabilistic and deterministic estimation to achieve both high ac- curacy and low computational overhead.Moreover, the accuracy of the hybrid technique is robust to changes in its parameter values. To evaluate our proposed system, we implemented CellSense on Android-based phones. Results from two different testbeds, represent- ing urban and rural environments, for three differ- ent cellular providers show that CellSense provides at least 108.57% enhancement in accuracy in rural areas and at least 89.03% in urban areas compared to the current state of the art RSSI-based GSM localization systems. In additional, the proposed hybrid technique provides more than 6 times and 5.4 times reduction in computational requirements compared to the state of the art RSSI-based GSM localization systems for the rural and urban testbeds respectively.We also evaluate the effect of changing the different system parameters on the accuracy-complexity tradeoff and how the cell towers density and fingerprint density affect the system performance.
Two-Way Training Design for Discriminatory Channel Estimation in Wireless MIMO Systems
Venue: arXiv cs.IT 2011
Year: 2011

This work examines the use of two-way training in multiple-input multiple-output (MIMO) wireless systems to discriminate the channel estimation performances between a legitimate receiver (LR) and an unauthorized receiver (UR). This thesis extends upon the previously proposed discriminatory channel estimation (DCE) scheme that allows only the transmitter to send training signals. The goal of DCE is to minimize the channel estimation error at LR while requiring the channel estimation error at UR to remain beyond a certain level. If the training signal is sent only by the transmitter, the performance discrimination between LR and UR will be limited since the training signals help both receivers perform estimates of their downlink channels. In this work, we consider instead the two-way training methodology that allows both the transmitter and LR to send training signals. In this case, the training signal sent by LR helps the transmitter obtain knowledge of the transmitter-to-LR channel, but does not help UR estimate its downlink channel (i.e., the transmitter-to-UR channel). With transmitter knowledge of the estimated transmitter-to-LR channel, artificial noise (AN) can then be embedded in the null space of the transmitter-to-LR channel to disrupt UR's channel estimation without severely degrading the channel estimation at LR. Based on these ideas, two-way DCE training schemes are developed for both reciprocal and non-reciprocal channels. The optimal power allocation between training and AN signals is devised under both average and individual power constraints. Numerical results are provided to demonstrate the efficacy of the proposed two-way DCE training schemes.
Symmetric Encapsulated Multi-Methods
Venue: arXiv cs.PL 2011
Year: 2011

In object systems, classes take the role of modules, and interfaces consist of methods. Because methods are encapsulated in objects, interfaces in object systems do not allow abstracting over \emph{where} methods are implemented. This implies that any change to the implementation structure may cause a rippling effect. Sometimes this unduly restricts the scope of software evolution, in particular for methods with multiple parameters where there is no clear owner. We propose a simple scheme where symmetric methods may be defined in the classes of any of their parameters. This allows client code to be oblivious of what class contains a method implementation, and therefore immune against it changing. When combined with multiple dynamic dispatch, this scheme allows for modular extensibility where a method defined in one class is overridden by a method defined in a class that is not its subtype. In this paper, we illustrate the scheme by extending a core calculus of class-based languages with these symmetric encapsulated multi-methods, and prove the result sound.
Multi-core processors - An overview
Venue: arXiv cs.AR 2011
Year: 2011

Microprocessors have revolutionized the world we live in and continuous efforts are being made to manufacture not only faster chips but also smarter ones. A number of techniques such as data level parallelism, instruction level parallelism and hyper threading (Intel's HT) already exists which have dramatically improved the performance of microprocessor cores. This paper briefs on evolution of multi-core processors followed by introducing the technology and its advantages in today's world. The paper concludes by detailing on the challenges currently faced by multi-core processors and how the industry is trying to address these issues.
Using non-convex approximations for efficient analysis of timed automata
Venue: arXiv cs.LO 2011
Year: 2011

The reachability problem for timed automata asks if there exists a path from an initial state to a target state. The standard solution to this problem involves computing the zone graph of the automaton, which in principle could be infinite. In order to make the graph finite, zones are approximated using an extrapolation operator. For reasons of efficiency in current algorithms extrapolation of a zone is always a zone and in particular it is convex. In this paper, we propose to solve the reachability problem without such extrapolation operators. To ensure termination, we provide an efficient algorithm to check if a zone is included in the so called region closure of another. Although theoretically better, closure cannot be used in the standard algorithm since a closure of a zone may not be convex. An additional benefit of the proposed approach is that it permits to calculate approximating parameters on-the-fly during exploration of the zone graph, as opposed to the current methods which do it by a static analysis of the automaton prior to the exploration. This allows for further improvements in the algorithm. Promising experimental results are presented.
A Dynamic Framework of Reputation Systems for an Agent Mediated e-market
Venue: arXiv cs.MA 2011
Year: 2011

The success of an agent mediated e-market system lies in the underlying reputation management system to improve the quality of services in an information asymmetric e-market. Reputation provides an operatable metric for establishing trustworthiness between mutually unknown online entities. Reputation systems encourage honest behaviour and discourage malicious behaviour of participating agents in the e-market. A dynamic reputation model would provide virtually instantaneous knowledge about the changing e-market environment and would utilise Internets' capacity for continuous interactivity for reputation computation. This paper proposes a dynamic reputation framework using reinforcement learning and fuzzy set theory that ensures judicious use of information sharing for inter-agent cooperation. This framework is sensitive to the changing parameters of e-market like the value of transaction and the varying experience of agents with the purpose of improving inbuilt defense mechanism of the reputation system against various attacks so that e-market reaches an equilibrium state and dishonest agents are weeded out of the market.
An Efficient Approach towards Mitigating Soft Errors Risks
Venue: arXiv cs.OH 2011
Year: 2011

Smaller feature size, higher clock frequency and lower power consumption are of core concerns of today's nano-technology, which has been resulted by continuous downscaling of CMOS technologies. The resultant 'device shrinking' reduces the soft error tolerance of the VLSI circuits, as very little energy is needed to change their states. Safety critical systems are very sensitive to soft errors. A bit flip due to soft error can change the value of critical variable and consequently the system control flow can completely be changed which leads to system failure. To minimize soft error risks, a novel methodology is proposed to detect and recover from soft errors considering only 'critical code blocks' and 'critical variables' rather than considering all variables and/or blocks in the whole program. The proposed method shortens space and time overhead in comparison to existing dominant approaches.
Learning in Real-Time Search: A Unifying Framework
Venue: arXiv cs.AI 2011
Year: 2011

Real-time search methods are suited for tasks in which the agent is interacting with an initially unknown environment in real time. In such simultaneous planning and learning problems, the agent has to select its actions in a limited amount of time, while sensing only a local part of the environment centered at the agents current location. Real-time heuristic search agents select actions using a limited lookahead search and evaluating the frontier states with a heuristic function. Over repeated experiences, they refine heuristic values of states to avoid infinite loops and to converge to better solutions. The wide spread of such settings in autonomous software and hardware agents has led to an explosion of real-time search algorithms over the last two decades. Not only is a potential user confronted with a hodgepodge of algorithms, but he also faces the choice of control parameters they use. In this paper we address both problems. The first contribution is an introduction of a simple three-parameter framework (named LRTS) which extracts the core ideas behind many existing algorithms. We then prove that LRTA*, epsilon-LRTA*, SLA*, and gamma-Trap algorithms are special cases of our framework. Thus, they are unified and extended with additional features. Second, we prove completeness and convergence of any algorithm covered by the LRTS framework. Third, we prove several upper-bounds relating the control parameters and solution quality. Finally, we analyze the influence of the three control parameters empirically in the realistic scalable domains of real-time navigation on initially unknown maps from a commercial role-playing game as well as routing in ad hoc sensor networks.
Relay Selection and Performance Analysis in Multiple-User Networks
Venue: arXiv cs.IT 2011
Year: 2011

This paper investigates the relay selection (RS) problem in networks with multiple users and multiple common amplify-and-forward (AF) relays. Considering the overall quality-of-service of the network, we first specify our definition of optimal RS for multiple-user relay networks. Then an optimal RS (ORS) algorithm is provided, which is a straightforward extension of an RS scheme in the literature that maximizes the minimum end-to-end receive signal-to-noise ratio (SNR) of all users. The complexity of the ORS is quadratic in both the number of users and the number of relays. Then a suboptimal RS (SRS) scheme is proposed, which has linear complexity in the number of relays and quadratic complexity in the number of users. Furthermore, diversity orders of both the ORS and the proposed SRS are theoretically derived and compared with those of a naive RS scheme and the single-user RS network. It is shown that the ORS achieves full diversity; while the diversity order of the SRS decreases with the the number of users. For two-user networks, the outage probabilities and array gains corresponding to the minimum SNR of the RS schemes are derived in closed forms. It is proved that the advantage of the SRS over the naive RS scheme increases as the number of relays in the network increases. Simulation results are provided to corroborate the analytical results.
A Modular Toolkit for Distributed Interactions
Venue: arXiv cs.DC 2011
Year: 2011

We discuss the design, architecture, and implementation of a toolkit which supports some theories for distributed interactions. The main design principles of our architecture are flexibility and modularity. Our main goal is to provide an easily extensible workbench to encompass current algorithms and incorporate future developments of the theories. With the help of some examples, we illustrate the main features of our toolkit.
Data-dependent kernels in nearly-linear time
Venue: arXiv cs.LG 2011
Year: 2011

We propose a method to efficiently construct data-dependent kernels which can make use of large quantities of (unlabeled) data. Our construction makes an approximation in the standard construction of semi-supervised kernels in Sindhwani et al. 2005. In typical cases these kernels can be computed in nearly-linear time (in the amount of data), improving on the cubic time of the standard construction, enabling large scale semi-supervised learning in a variety of contexts. The methods are validated on semi-supervised and unsupervised problems on data sets containing upto 64,000 sample points.
Compression-based Similarity
Venue: arXiv cs.IT 2011
Year: 2011

First we consider pair-wise distances for literal objects consisting of finite binary files. These files are taken to contain all of their meaning, like genomes or books. The distances are based on compression of the objects concerned, normalized, and can be viewed as similarity distances. Second, we consider pair-wise distances between names of objects, like "red" or "christianity." In this case the distances are based on searches of the Internet. Such a search can be performed by any search engine that returns aggregate page counts. We can extract a code length from the numbers returned, use the same formula as before, and derive a similarity or relative semantics between names for objects. The theory is based on Kolmogorov complexity. We test both similarities extensively experimentally.
Wiretap Channels: Implications of the More Capable Condition and Cyclic Shift Symmetry
Venue: arXiv cs.IT 2011
Year: 2011

Characterization of the rate-equivocation region of a general wiretap channel involves two auxiliary random variables: U, for rate splitting and V, for channel prefixing. Evaluation of regions involving auxiliary random variables is generally difficult. In this paper, we explore specific classes of wiretap channels for which the expression and evaluation of the rate-equivocation region are simpler. In particular, we show that when the main channel is more capable than the eavesdropping channel, V=X is optimal and the boundary of the rate-equivocation region can be achieved by varying U alone. Conversely, we show under a mild condition that if the main receiver is not more capable, then V=X is strictly suboptimal. Next, we focus on the class of cyclic shift symmetric wiretap channels. We explicitly determine the optimal selections of rate splitting U and channel prefixing V that achieve the boundary of the rate-equivocation region. We show that optimal U and V are determined via cyclic shifts of the solution of an auxiliary optimization problem that involves only one auxiliary random variable. In addition, we provide a sufficient condition for cyclic shift symmetric wiretap channels to have U=ϕas an optimal selection. Finally, we apply our results to the binary-input cyclic shift symmetric wiretap channels. We solve the corresponding constrained optimization problem by inspecting each point of the I(X;Y)-I(X;Z) function. We thoroughly characterize the rate-equivocation regions of the BSC-BEC and BEC-BSC wiretap channels. In particular, we find that U=ϕis optimal and the boundary of the rate-equivocation region is achieved by varying V alone for the BSC-BEC wiretap channel.
Efficient Synchronization Primitives for GPUs
Venue: arXiv cs.OS 2011
Year: 2011

In this paper, we revisit the design of synchronization primitives---specifically barriers, mutexes, and semaphores---and how they apply to the GPU. Previous implementations are insufficient due to the discrepancies in hardware and programming model of the GPU and CPU. We create new implementations in CUDA and analyze the performance of spinning on the GPU, as well as a method of sleeping on the GPU, by running a set of memory-system benchmarks on two of the most common GPUs in use, the Tesla- and Fermi-class GPUs from NVIDIA. From our results we define higher-level principles that are valid for generic many-core processors, the most important of which is to limit the number of atomic accesses required for a synchronization operation because atomic accesses are slower than regular memory accesses. We use the results of the benchmarks to critique existing synchronization algorithms and guide our new implementations, and then define an abstraction of GPUs to classify any GPU based on the behavior of the memory system. We use this abstraction to create suitable implementations of the primitives specifically targeting the GPU, and analyze the performance of these algorithms on Tesla and Fermi. We then predict performance on future GPUs based on characteristics of the abstraction. We also examine the roles of spin waiting and sleep waiting in each primitive and how their performance varies based on the machine abstraction, then give a set of guidelines for when each strategy is useful based on the characteristics of the GPU and expected contention.