OpenRaiser/Intern-Atlas huggingface dataset:
An efficient algorithm for weighted sum-rate maximization in multicell downlink beamforming
Venue: arXiv cs.IT 2013
Year: 2013

This paper considers coordinated linear precoding for rate optimization in downlink multicell, multiuser orthogonal frequency- division multiple access networks. We focus on two different design criteria. In the first, the weighted sum-rate is maximized under transmit power constraints per base station. In the second, we minimize the total transmit power satisfying the signal-to-interference-plus-noise-ratio constraints of the subcarriers per cell. Both problems are solved using standard conic optimization packages. A less complex, fast, and provably convergent algorithm that maximizes the weighted sum-rate with per-cell transmit power constraints is formulated. We approximate the nonconvex weighted sum- rate maximization (WSRM) problem with a solvable convex form by means of a sequential parametric convex approximation approach. The second- order cone formulations of an objective function and the constraints of the optimization problem are derived through a proper change of variables, first-order linear approximation, and hyperbolic constraints transformation. This algorithm converges to the suboptimal solution while taking fewer it- erations in comparison to other known iterative WSRM algorithms. Numerical results are presented to demonstrate the effectiveness and superiority of the proposed algorithm.
Representing Code History with Development Environment Events
Venue: arXiv cs.PL 2013
Year: 2013

Modern development environments handle information about the intent of the programmer: for example, they use abstract syntax trees for providing high-level code manipulation such as refactorings; nevertheless, they do not keep track of this information in a way that would simplify code sharing and change understanding. In most Smalltalk systems, source code modifications are immediately registered in a transaction log often called a ChangeSet. Such mechanism has proven reliability, but it has several limitations. In this paper we analyse such limitations and describe scenarios and requirements for tracking fine-grained code history with a semantic representation. We present Epicea, an early prototype implementation. We want to enrich code sharing with extra information from the IDE, which will help understanding the intention of the changes and let a new generation of tools act in consequence.
iMOD LEACH: improved MODified LEACH Protocol for Wireless Sensor Networks
Venue: arXiv cs.NI 2013
Year: 2013

Increased use of Wireless sensor Networks (WSNs) in variety of applications has enabled the designers to create autonomous sensors, which can be deployed randomly, without human supervision, for the purpose of sensing and communicating valuable data. Many energy-efficient routing protocols are designed for WSNs based on clustering structure. In this paper, we have proposed iMODLEACH protocol which is an extension to the MODLEACH protocol. Simulation results indicate that iMODLEACH outperforms MODLEACH in terms of network life-time and packets transferred to base station. The mathematical analysis helps to select such values of these parameters which can suit a particular wireless sensor network application.
Restoring the privacy and confidentiality of users over Mobile collaborative learning (MCL) environment
Venue: arXiv cs.CR 2013
Year: 2013

Mobile collaborative learning (MCL) is extensively recognized field all over the world. It demonstrates the cerebral approach combining the several technology to handle the problem of learning. MCL motivates the social and educational activities for creating healthier environment. To advance and promote the baseline of MCL, different frameworks have been introduced for MCL. From other side, there is no highly acceptable security mechanism has been implemented to protect MCL environment. This paper introduces the issue of rogue DHCP server, which highly affects the performance of users who communicate with each other through MCL. The rogue DHCP is unofficial server that gives incorrect IP address to user in order to use the legal sources of different servers by sniffing the traffic. The contribution focuses to maintain the privacy of users and enhances the confidentiality. The paper introduces multi-frame signature-cum anomaly-based intrusion detection systems (MSAIDS) supported with innovative algorithms, modification in the existing rules of IDS and use of mathematical model. The major objectives of research are to identify the malicious attacks created by rogue DHCP server. This innovative mechanism emphasizes the security for users in order to communicate freely. It also protects network from illegitimate involvement of intruders. Finally, the paper validates the mechanism using three types of simulations: testbed, discrete simulation in C++ and ns2. On the basis of findings, the efficiency of proposed mechanism has been compared with other well-known techniques.
Power Optimization for Network Localization
Venue: arXiv cs.IT 2013
Year: 2013

Reliable and accurate localization of mobile objects is essential for many applications in wireless networks. In range-based localization, the position of the object can be inferred using the distance measurements from wireless signals exchanged with active objects or reflected by passive ones. Power allocation for ranging signals is important since it affects not only network lifetime and throughput but also localization accuracy. In this paper, we establish a unifying optimization framework for power allocation in both active and passive localization networks. In particular, we first determine the functional properties of the localization accuracy metric, which enable us to transform the power allocation problems into second-order cone programs (SOCPs). We then propose the robust counterparts of the problems in the presence of parameter uncertainty and develop asymptotically optimal and efficient near-optimal SOCP-based algorithms. Our simulation results validate the efficiency and robustness of the proposed algorithms.
A novel approach to nose-tip and eye corners detection using H-K Curvature Analysis in case of 3D images
Venue: arXiv cs.CV 2013
Year: 2013

In this paper we present a novel method that combines a HK curvature-based approach for three-dimensional (3D) face detection in different poses (X-axis, Y-axis and Z-axis). Salient face features, such as the eyes and nose, are detected through an analysis of the curvature of the entire facial surface. All the experiments have been performed on the FRAV3D Database. After applying the proposed algorithm to the 3D facial surface we have obtained considerably good results i.e. on 752 3D face images our method detected the eye corners for 543 face images, thus giving a 72.20% of eye corners detection and 743 face images for nose-tip detection thus giving a 98.80% of good nose tip localization
Modelling Probabilistic Wireless Networks
Venue: arXiv cs.LO 2013
Year: 2013

We propose a process calculus to model high level wireless systems, where the topology of a network is described by a digraph. The calculus enjoys features which are proper of wireless networks, namely broadcast communication and probabilistic behaviour. We first focus on the problem of composing wireless networks, then we present a compositional theory based on a probabilistic generalisation of the well known may-testing and must-testing pre- orders. Also, we define an extensional semantics for our calculus, which will be used to define both simulation and deadlock simulation preorders for wireless networks. We prove that our simulation preorder is sound with respect to the may-testing preorder; similarly, the deadlock simulation pre- order is sound with respect to the must-testing preorder, for a large class of networks. We also provide a counterexample showing that completeness of the simulation preorder, with respect to the may testing one, does not hold. We conclude the paper with an application of our theory to probabilistic routing protocols.
Sub-Stream Fairness and Numerical Correctness in MIMO Interference Channels
Venue: arXiv cs.IT 2013
Year: 2013

Stream fairness, fairness between all streams in the system, is a more restrictive condition than sub-stream fairness, fairness between all streams of each user. Thus sub-stream fairness alleviates utility loss as well as complexity and overhead compared to stream fairness. Moreover, depending on algorithmic parameters, conventional algorithms including distributed interference alignment (DIA) may not provide sub-stream fairness, and generate sub-streams with poor signal-to-interference plus noise ratios (SINRs), thus with poor bit error rates (BERs). To this end, we propose a distributed power control algorithm to render sub-stream fairness in the system, and establish initiatory connections between sub-stream SINRs, BERs, and rates. Algorithms have particular responses to parameters. In the paper, important algorithmic parameters are analyzed to exhibit numerical correctness in benchmarking. The distinction between separate filtering schemes that design each stream of a user separately and group filtering schemes that jointly design the streams of a user is also underscored in the paper. Finally, the power control law used in the proposed algorithm is proven to linearly converge to a unique fixed-point, and the algorithm is shown to achieve feasible SINR targets.
Improving Query Expansion Using WordNet
Venue: arXiv cs.IR 2013
Year: 2013

This study proposes a new way of using WordNet for Query Expansion (QE). We choose candidate expansion terms, as usual, from a set of pseudo relevant documents; however, the usefulness of these terms is measured based on their definitions provided in a hand-crafted lexical resource like WordNet. Experiments with a number of standard TREC collections show that this method outperforms existing WordNet based methods. It also compares favorably with established QE methods such as KLD and RM3. Leveraging earlier work in which a combination of QE methods was found to outperform each individual method (as well as other well-known QE methods), we next propose a combination-based QE method that takes into account three different aspects of a candidate expansion term's usefulness: (i) its distribution in the pseudo relevant documents and in the target corpus, (ii) its statistical association with query terms, and (iii) its semantic relation with the query, as determined by the overlap between the WordNet definitions of the term and query terms. This combination of diverse sources of information appears to work well on a number of test collections, viz., TREC123, TREC5, TREC678, TREC robust new and TREC910 collections, and yields significant improvements over competing methods on most of these collections.
Context-dependent Trust Decisions with Subjective Logic
Venue: arXiv cs.OH 2013
Year: 2013

A decision procedure implemented over a computational trust mechanism aims to allow for decisions to be made regarding whether some entity or information should be trusted. As recognised in the literature, trust is contextual, and we describe how such a context often translates into a confidence level which should be used to modify an underlying trust value. Jøsang's Subjective Logic has long been used in the trust domain, and we show that its operators are insufficient to address this problem. We therefore provide a decision-making approach about trust which also considers the notion of confidence (based on context) through the introduction of a new operator. In particular, we introduce general requirements that must be respected when combining trustworthiness and confidence degree, and demonstrate the soundness of our new operator with respect to these properties.
The third-order term in the normal approximation for singular channels
Venue: arXiv cs.IT 2013
Year: 2013

For a singular and symmetric discrete memoryless channel with positive dispersion, the third-order term in the normal approximation is shown to be upper bounded by a constant. This finding completes the characterization of the third-order term for symmetric discrete memoryless channels. The proof method is extended to asymmetric and singular channels with constant composition codes, and its connection to existing results, as well as its limitation in the error exponents regime, are discussed.
Formal Contexts, Formal Concept Analysis, and Galois Connections
Venue: arXiv cs.OH 2013
Year: 2013

Formal concept analysis (FCA) is built on a special type of Galois connections called polarities. We present new results in formal concept analysis and in Galois connections by presenting new Galois connection results and then applying these to formal concept analysis. We also approach FCA from the perspective of collections of formal contexts. Usually, when doing FCA, a formal context is fixed. We are interested in comparing formal contexts and asking what criteria should be used when determining when one formal context is better than another formal context. Interestingly, we address this issue by studying sets of polarities.
Coroutining Folds with Hyperfunctions
Venue: arXiv cs.PL 2013
Year: 2013

Fold functions are a general mechanism for computing over recursive data structures. First-order folds compute results bottom-up. With higher-order folds, computations that inherit attributes from above can also be expressed. In this paper, we explore folds over a form of recursive higher-order function, called hyperfunctions, and show that hyperfunctions allow fold computations to coroutine across data structures, as well as compute bottom up and top down. We use the compiler technique of foldr-build as an exemplar to show how hyperfunctions can be used.
The Immune System: the ultimate fractionated cyber-physical system
Venue: arXiv cs.CE 2013
Year: 2013

In this little vision paper we analyze the human immune system from a computer science point of view with the aim of understanding the architecture and features that allow robust, effective behavior to emerge from local sensing and actions. We then recall the notion of fractionated cyber-physical systems, and compare and contrast this to the immune system. We conclude with some challenges.
Pretty-big-step-semantics-based Certified Abstract Interpretation (Preliminary version)
Venue: arXiv cs.PL 2013
Year: 2013

We present a technique for deriving semantic program analyses from a natural semantics specification of the programming language. The technique is based on a particular kind of semantics called pretty-big-step semantics. We present a pretty-big-step semantics of a language with simple objects called O'While and specify a series of instrumentations of the semantics that explicitates the flows of values in a program. This leads to a semantics-based dependency analysis, at the core, e.g., of tainting analysis in software security. The formalization has been realized with the Coq proof assistant.
An open dataset for research on audio field recording archives: freefield1010
Venue: arXiv cs.SD 2013
Year: 2013

We introduce a free and open dataset of 7690 audio clips sampled from the field-recording tag in the Freesound audio archive. The dataset is designed for use in research related to data mining in audio archives of field recordings / soundscapes. Audio is standardised, and audio and metadata are Creative Commons licensed. We describe the data preparation process, characterise the dataset descriptively, and illustrate its use through an auto-tagging experiment.
An introduction to the Europe Media Monitor family of applications
Venue: arXiv cs.CL 2013
Year: 2013

Most large organizations have dedicated departments that monitor the media to keep up-to-date with relevant developments and to keep an eye on how they are represented in the news. Part of this media monitoring work can be automated. In the European Union with its 23 official languages, it is particularly important to cover media reports in many languages in order to capture the complementary news content published in the different countries. It is also important to be able to access the news content across languages and to merge the extracted information. We present here the four publicly accessible systems of the Europe Media Monitor (EMM) family of applications, which cover between 19 and 50 languages (see http://press.jrc.it/overview.html). We give an overview of their functionality and discuss some of the implications of the fact that they cover quite so many languages. We discuss design issues necessary to be able to achieve this high multilinguality, as well as the benefits of this multilinguality.
A modeling approach to design a software sensor and analyze agronomical features - Application to sap flow and grape quality relationship
Venue: arXiv cs.AI 2013
Year: 2013

This work proposes a framework using temporal data and domain knowledge in order to analyze complex agronomical features. The expertise is first formalized in an ontology, under the form of concepts and relationships between them, and then used in conjunction with raw data and mathematical models to design a software sensor. Next the software sensor outputs are put in relation to product quality, assessed by quantitative measurements. This requires the use of advanced data analysis methods, such as functional regression. The methodology is applied to a case study involving an experimental design in French vineyards. The temporal data consist of sap flow measurements, and the goal is to explain fruit quality (sugar concentration and weight), using vine's water courses through the various vine phenological stages. The results are discussed, as well as the method genericity and robustness.
Extensible Generic Data Management Software
Venue: arXiv cs.DL 2013
Year: 2013

Extensibility mechanisms constitute a form of knowledge capture that is essential for software re-use. The Data Intensive Cyber Environments (DICE) group has collaborated with twenty-five science and engineering domains on the application of the iRODS policy-based data management system. Based on these collaborations, three types of extensibility mechanisms are sufficient to capture the domain knowledge needed for interaction with domain resources: computer actionable rules that control management policies; computer executable micro-services that encapsulate operations or interaction protocols; and middleware servers that apply standard operations at remote locations. These mechanisms enable the creation of generic data management software that is capable of implementing collections, data grids for sharing data, digital libraries for publishing data, processing pipelines, and archives.
Nonmyopic View Planning for Active Object Detection
Venue: arXiv cs.RO 2013
Year: 2013

One of the central problems in computer vision is the detection of semantically important objects and the estimation of their pose. Most of the work in object detection has been based on single image processing and its performance is limited by occlusions and ambiguity in appearance and geometry. This paper proposes an active approach to object detection by controlling the point of view of a mobile depth camera. When an initial static detection phase identifies an object of interest, several hypotheses are made about its class and orientation. The sensor then plans a sequence of views, which balances the amount of energy used to move with the chance of identifying the correct hypothesis. We formulate an active hypothesis testing problem, which includes sensor mobility, and solve it using a point-based approximate POMDP algorithm. The validity of our approach is verified through simulation and real-world experiments with the PR2 robot. The results suggest that our approach outperforms the widely-used greedy view point selection and provides a significant improvement over static object detection.
Cable Fault Monitoring and Indication: A Review
Venue: arXiv cs.DC 2013
Year: 2013

Underground cable power transmission and distribution system are susceptible to faults. Accurate fault location for transmission lines is of vital importance. A quick detection and analysis of faults is necessity of power retailers and distributors. This paper reviews various fault locating methods and highly computational methods proposed by research community that are currently in use. The paper also presents some guidelines for design of fault location and remote indication, for reducing power outages and reducing heavy loss of revenue.
Multiple Domain Secure Routing for Wireless Sensor Networks
Venue: arXiv cs.CR 2013
Year: 2013

Secure Transmission of data packets in Wireless Sensor Networks is an important area of Research. There is a possibility of an attacker creating security holes in the network. Hence, network security and reliability can be achieved by discovering random multiple paths using multiple domains, and forwarding data packets from the source node to the destination node. We have designed, Multiple Domain Routing with Overlap of Nodes (MDRON) and Multiple Domain Routing Without Overlap of Nodes (MDRWON) algorithms, in which packets follow multiple optimized paths simultaneously. The Special node algorithm searches the node which has maximum power and these nodes are used for transferring the packet from one domain to another domain. Simulation results using MATLAB shows that performance is better than Purely Random Propagation (PRP) and Non Repetitive Random Propagation(NRRP) Algorithms.
On the tradeoff of average delay and average power for fading point-to-point links with monotone policies
Venue: arXiv cs.NI 2013
Year: 2013

We consider a fading point-to-point link with packets arriving randomly at rate $λ$ per slot to the transmitter queue. We assume that the transmitter can control the number of packets served in a slot by varying the transmit power for the slot. We restrict to transmitter scheduling policies that are monotone and stationary, i.e., the number of packets served is a non-decreasing function of the queue length at the beginning of the slot for every slot fade state. For such policies, we obtain asymptotic lower bounds for the minimum average delay of the packets, when average transmitter power is a small positive quantity $V$ more than the minimum average power required for transmitter queue stability. We show that the minimum average delay grows either to a finite value or as $Ω\brap{\log(1/V)}$ or $Ω\brap{1/V}$ when $V \downarrow 0$, for certain sets of values of $λ$. These sets are determined by the distribution of fading gain, the maximum number of packets which can be transmitted in a slot, and the transmit power function of the fading gain and the number of packets transmitted that is assumed. We identify a case where the above behaviour of the tradeoff differs from that obtained from a previously considered approximate model, in which the random queue length process is assumed to evolve on the non-negative real line, and the transmit power function is strictly convex. We also consider a fading point-to-point link, where the transmitter, in addition to controlling the number of packets served, can also control the number of packets admitted in every slot. Our approach, which uses bounds on the stationary probability distribution of the queue length, also leads to an intuitive explanation of the asymptotic behaviour of average delay in the regime where $V \downarrow 0$.
Revised Modularity Index to Measure Modularity of OSS Projects with Case Study of Freemind
Venue: arXiv cs.SE 2013
Year: 2013

Open Source Software (OSS) Projects are gaining popularity worldwide. Studies by many researchers show that the important key success factor is modularity of the source code. This paper presents the revised Modularity Index which is a software metrics to measure the modularity level of a javabased OSS Projects. To show its effectiveness in analyzing OSS Project, the Modularity Index and its supporting software metrics are then used to analyze the evolution of Freemind mind mapping OSS Project. The analysis using Modularity Index and its supporting metrics shows the strength and weaknesses of the Freemind OSS Projects.