OpenRaiser/Intern-Atlas huggingface dataset:
Ensuring Predictable Contact Opportunity for Scalable Vehicular Internet Access On the Go
Venue: arXiv cs.NI 2014
Year: 2014

With increasing popularity of media enabled hand-helds and their integration with the in-vehicle entertainment systems, the need for high data-rate services for mobile users on the go is evident. This ever-increasing demand of data is constantly surpassing what cellular networks can economically support. Large-scale Wireless LANs (WLANs) can provide such a service, but they are expensive to deploy and maintain. Open WLAN access-points, on the other hand, need no new deployments, but can offer only opportunistic services, lacking any performance guarantees. In contrast, a carefully planned sparse deployment of roadside WiFi provides an economically scalable infrastructure with quality of service assurance to mobile users. In this paper, we present a new metric, called Contact Opportunity, to closely model the quality of data service that a mobile user might experience when driving through the system. We then present efficient deployment algorithms for minimizing the cost for ensuring a required level of contact opportunity. We further extend this concept and the deployment techniques to a more intuitive metric -- the average throughput -- by taking various dynamic elements into account. Simulations over a real road network and experimental results show that our approach achieves significantly better cost vs. throughput tradeoff in both the worst case and average case compared with some commonly used deployment algorithms.
Interaction entre mathématique et informatique Libre/Open Source par le logiciel mathématique
Venue: arXiv cs.MS 2014
Year: 2014

This article focuses on the application of model development and opening the source code available and implemented by the Free Software and Open Source FLOSS to the instructional and teaching has both mathematics and computer by the read-write(R/W) of mathematical software, including the most famous cases are numerical and symbolic computation. The article analysis the development of the mathematical model of Free/Open Source(math FLOSS) software has proven its importance in the area of research in mathematics and computer science . However, although their actual use, is very readable in higher education courses. We discuss the feasibility of this model to the characteristics of the domain, actors, interaction they have and the communities they form during the development of the software. Finally, we propose a mathematical example of Free/Open Source(Math FlOSS) software as analysis device .
Non-stationary Resource Allocation Policies for Delay-constrained Video Streaming: Application to Video over Internet-of-Things-enabled Networks
Venue: arXiv cs.NI 2014
Year: 2014

Due to the high bandwidth requirements and stringent delay constraints of multi-user wireless video transmission applications, ensuring that all video senders have sufficient transmission opportunities to use before their delay deadlines expire is a longstanding research problem. We propose a novel solution that addresses this problem without assuming detailed packet-level knowledge, which is unavailable at resource allocation time. Instead, we translate the transmission delay deadlines of each sender's video packets into a monotonically-decreasing weight distribution within the considered time horizon. Higher weights are assigned to the slots that have higher probability for deadline-abiding delivery. Given the sets of weights of the senders' video streams, we propose the low-complexity Delay-Aware Resource Allocation (DARA) approach to compute the optimal slot allocation policy that maximizes the deadline-abiding delivery of all senders. A unique characteristic of the DARA approach is that it yields a non-stationary slot allocation policy that depends on the allocation of previous slots. We prove that the DARA approach is optimal for weight distributions that are exponentially decreasing in time. We further implement our framework for real-time video streaming in wireless personal area networks that are gaining significant traction within the new Internet-of-Things (IoT) paradigm. For multiple surveillance videos encoded with H.264/AVC and streamed via the 6tisch framework that simulates the IoT-oriented IEEE 802.15.4e TSCH medium access control, our solution is shown to be the only one that ensures all video bitstreams are delivered with acceptable quality in a deadline-abiding manner.
Pectoral Muscles Suppression in Digital Mammograms using Hybridization of Soft Computing Methods
Venue: arXiv cs.CV 2014
Year: 2014

Breast region segmentation is an essential prerequisite in computerized analysis of mammograms. It aims at separating the breast tissue from the background of the mammogram and it includes two independent segmentations. The first segments the background region which usually contains annotations, labels and frames from the whole breast region, while the second removes the pectoral muscle portion (present in Medio Lateral Oblique (MLO) views) from the rest of the breast tissue. In this paper we propose hybridization of Connected Component Labeling (CCL), Fuzzy, and Straight line methods. Our proposed methods worked good for separating pectoral region. After removal pectoral muscle from the mammogram, further processing is confined to the breast region alone. To demonstrate the validity of our segmentation algorithm, it is extensively tested using over 322 mammographic images from the Mammographic Image Analysis Society (MIAS) database. The segmentation results were evaluated using a Mean Absolute Error (MAE), Hausdroff Distance (HD), Probabilistic Rand Index (PRI), Local Consistency Error (LCE) and Tanimoto Coefficient (TC). The hybridization of fuzzy with straight line method is given more than 96% of the curve segmentations to be adequate or better. In addition a comparison with similar approaches from the state of the art has been given, obtaining slightly improved results. Experimental results demonstrate the effectiveness of the proposed approach.
Space-Time Coded Spatial Modulated Physical Layer Network Coding for Two-Way Relaying
Venue: arXiv cs.IT 2014
Year: 2014

Using the spatial modulation approach, where only one transmit antenna is active at a time, we propose two transmission schemes for two-way relay channel using physical layer network coding with space time coding using Coordinate Interleaved Orthogonal Designs (CIOD's). It is shown that using two uncorrelated transmit antennas at the nodes, but using only one RF transmit chain and space-time coding across these antennas can give a better performance without using any extra resources and without increasing the hardware implementation cost and complexity. In the first transmission scheme, two antennas are used only at the relay, Adaptive Network Coding (ANC) is employed at the relay and the relay transmits a CIOD Space Time Block Code (STBC). This gives a better performance compared to an existing ANC scheme for two-way relay channel which uses one antenna each at all the three nodes. It is shown that for this scheme at high SNR the average end-to-end symbol error probability (SEP) is upper bounded by twice the SEP of a point-to-point fading channel. In the second transmission scheme, two transmit antennas are used at all the three nodes, CIOD STBC's are transmitted in multiple access and broadcast phases. This scheme provides a diversity order of two for the average end-to-end SEP with an increased decoding complexity of $\mathcal{O}(M^3)$ for an arbitrary signal set and $\mathcal{O}(M^2\sqrt{M})$ for square QAM signal set.
Research on the mobile robots intelligent path planning based on ant colony algorithm application in manufacturing logistics
Venue: arXiv cs.RO 2014
Year: 2014

With the development of robotics and artificial intelligence field unceasingly thorough, path planning as an important field of robot calculation has been widespread concern. This paper analyzes the current development of robot and path planning algorithm and focuses on the advantages and disadvantages of the traditional intelligent path planning as well as the path planning. The problem of mobile robot path planning is studied by using ant colony algorithm, and it also provides some solving methods.
A Principled Infotheoretic ϕ-like Measure
Venue: arXiv cs.IT 2014
Year: 2014

Integrated information theory is a mathematical, quantifiable theory of conscious experience. The linchpin of this theory, the $ϕ$ measure, quantifies a system's irreducibility to disjoint parts. Purely as a measure of irreducibility, we pinpoint three concerns about $ϕ$ and propose a revised measure, $ψ$, which addresses them. Our measure $ψ$ is rigorously grounded in Partial Information Decomposition and is faster to compute than $ϕ$.
Analysis of the Local Quasi-Stationarity of Measured Dual-Polarized MIMO Channels
Venue: arXiv cs.IT 2014
Year: 2014

It is common practice in wireless communications to assume strict or wide-sense stationarity of the wireless channel in time and frequency. While this approximation has some physical justification, it is only valid inside certain time-frequency regions. This paper presents an elaborate characterization of the non-stationarity of wireless dual-polarized channels in time. The evaluation is based on urban macrocell measurements performed at 2.53 GHz. In order to define local quasi-stationarity (LQS) regions, i.e., regions in which the change of certain channel statistics is deemed insignificant, we resort to the performance degradation of selected algorithms specific to channel estimation and beamforming. Additionally, we compare our results to commonly used measures in the literature. We find that the polarization, the antenna spacing, and the opening angle of the antennas into the propagation channel can strongly influence the non-stationarity of the observed channel. The obtained LQS regions can be of significant size, i.e., several meters, and thus the reuse of channel statistics over large distances is meaningful (in an average sense) for certain algorithms. Furthermore, we conclude that, from a system perspective, a proper non-stationarity analysis should be based on the considered algorithm.
Implementing Software Project Control Centers: An Architectural View
Venue: arXiv cs.SE 2014
Year: 2014

Setting up effective and efficient mechanisms for controlling software and system development projects is still challenging in industrial practice. On the one hand, necessary prerequisites such as established development processes, understanding of cause-effect relationships on relevant indicators, and sufficient sustainability of measurement programs are often missing. On the other hand, there are more fundamental methodological deficits related to the controlling process itself and to appropriate tool support. Additional activities that would guarantee the usefulness, completeness, and precision of the result- ing controlling data are widely missing. This article presents a conceptual architecture for so-called Software Project Control Centers (SPCC) that addresses these challenges. The architecture includes mechanisms for getting sufficiently precise and complete data and supporting the information needs of different stakeholders. In addition, an implementation of this architecture, the so-called Specula Project Support Environment, is sketched, and results from evaluating this implementation in industrial settings are presented.
Program Verification of Numerical Computation
Venue: arXiv cs.MS 2014
Year: 2014

These notes outline a formal method for program verification of numerical computation. It forms the basis of the software package VPC in its initial phase of development. Much of the style of presentation is in the form of notes that outline the definitions and rules upon which VPC is based. The initial motivation of this project was to address some practical issues of computation, especially of numerically intensive programs that are commonplace in computer models. The project evolved into a wider area for program construction as proofs leading to a model of inference in a more general sense. Some basic results of machine arithmetic are derived as a demonstration of VPC.
Optimization in Knowledge-Intensive Crowdsourcing
Venue: arXiv cs.DB 2014
Year: 2014

We present SmartCrowd, a framework for optimizing collaborative knowledge-intensive crowdsourcing. SmartCrowd distinguishes itself by accounting for human factors in the process of assigning tasks to workers. Human factors designate workers' expertise in different skills, their expected minimum wage, and their availability. In SmartCrowd, we formulate task assignment as an optimization problem, and rely on pre-indexing workers and maintaining the indexes adaptively, in such a way that the task assignment process gets optimized both qualitatively, and computation time-wise. We present rigorous theoretical analyses of the optimization problem and propose optimal and approximation algorithms. We finally perform extensive performance and quality experiments using real and synthetic data to demonstrate that adaptive indexing in SmartCrowd is necessary to achieve efficient high quality task assignment.
Proving Abstractions of Dynamical Systems through Numerical Simulations
Venue: arXiv cs.SY 2014
Year: 2014

A key question that arises in rigorous analysis of cyberphysical systems under attack involves establishing whether or not the attacked system deviates significantly from the ideal allowed behavior. This is the problem of deciding whether or not the ideal system is an abstraction of the attacked system. A quantitative variation of this question can capture how much the attacked system deviates from the ideal. Thus, algorithms for deciding abstraction relations can help measure the effect of attacks on cyberphysical systems and to develop attack detection strategies. In this paper, we present a decision procedure for proving that one nonlinear dynamical system is a quantitative abstraction of another. Directly computing the reach sets of these nonlinear systems are undecidable in general and reach set over-approximations do not give a direct way for proving abstraction. Our procedure uses (possibly inaccurate) numerical simulations and a model annotation to compute tight approximations of the observable behaviors of the system and then uses these approximations to decide on abstraction. We show that the procedure is sound and that it is guaranteed to terminate under reasonable robustness assumptions.
Computational Aspects of the Hausdorff Distance in Unbounded Dimension
Venue: arXiv cs.CG 2014
Year: 2014

We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed to be homothetically transformed in order to minimize its Hausdorff distance to another one. For this problem, we characterize optimal solutions, deduce a Helly-type theorem and give polynomial time (approximation) algorithms for polytopes.
On the Stability of Random Multiple Access with Feedback Exploitation and Queue Priority
Venue: arXiv cs.IT 2014
Year: 2014

In this paper, we study the stability of two interacting queues under random multiple access in which the queues leverage the feedback information. We derive the stability region under random multiple access where one of the two queues exploits the feedback information and backs off under negative acknowledgement (NACK) and the other, higher priority, queue will access the channel with probability one. We characterize the stability region of this feedback-based random access protocol and prove that this derived stability region encloses the stability region of the conventional random access (RA) scheme that does not exploit the feedback information.
The security deposit for finitely repeated Prisoner's dilemma
Venue: arXiv cs.GT 2014
Year: 2014

Under the assumption of complete rationality, Nash equilibrium is the only reasonable strategy (set) of the finitely repeated prisoner's dilemma. In fact, some strategies only slightly deviate from the so-called rationality, and the corresponding payoff may much better than that of Nash equilibrium. This article points out, even under the rational assumptions, the players have reason to seek a mutually beneficial agreement (Pareto dominated compare to Nash equilibrium) and a weak and optional constraints, so that the agreement can be successfully implemented. If the constraint does not harm the interests of the participants, or the adversely affects of the constraint are negligible, then the finitely repeated prisoner's dilemma becomes a bargaining problem issues on the strategy sequences and the problem to seek the constraints. The quantification of the constraints, the so-called security deposit in this paper, is nearly a concept of distance from an agreement (a strategy set) to the complete rationality.
A New Causal Ideal Internal Dynamics Generator
Venue: arXiv cs.SY 2014
Year: 2014

The design of ideal internal dynamics (IID) generators, namely solving IID, is a fundamental problem, which is a key step to handle the nonminimum-phase output tracking problem. In this paper, for a class of unstable matrix differential equations, a new causal dynamic IID generator is proposed, whose parameters are partly chosen via H_2/H_inf optimization. Compared with existing similar generators, it is applicable to matrix differential equations with singular system matrices and is easily extended to slowly time-varying matrix differential equations without extra computation.
Certification for mu-calculus with winning strategies
Venue: arXiv cs.LO 2014
Year: 2014

We define memory-efficient certificates for $μ$-calculus model checking problems based on the well-known correspondence of the $μ$-calculus model checking with winning certain parity games. Winning strategies can independently checked, in low polynomial time, by observing that there is no reachable strongly connected component in the graph of the parity game whose largest priority is odd. Winning strategies are computed by fixpoint iteration following the naive semantics of $μ$-calculus. We instrument the usual fixpoint iteration of $μ$-calculus model checking so that it produces evidence in the form of a winning strategy; these winning strategies can be computed in polynomial time in $|S|$ and in space $O(|S|^2 |ϕ|^2)$, where $|S|$ is the size of the state space and $|ϕ|$ the length of the formula $ϕ$\@. The main technical contribution here is the notion and algebra of partial winning strategies. On the technical level our work can be seen as a new, simpler, and immediate constructive proof of the correspondence between $μ$-calculus and parity games.
Looking at Vector Space and Language Models for IR using Density Matrices
Venue: arXiv cs.IR 2014
Year: 2014

In this work, we conduct a joint analysis of both Vector Space and Language Models for IR using the mathematical framework of Quantum Theory. We shed light on how both models allocate the space of density matrices. A density matrix is shown to be a general representational tool capable of leveraging capabilities of both VSM and LM representations thus paving the way for a new generation of retrieval models. We analyze the possible implications suggested by our findings.
Simple linear algorithms for mining graph cores
Venue: arXiv cs.DS 2014
Year: 2014

Batagelj and Zaversnik proposed a linear algorithm for the well-known $k$-core decomposition problem. However, when $k$-cores are desired for a given $k$, we find that a simple linear algorithm requiring no sorting works for mining $k$-cores. In addition, this algorithm can be extended to mine $(k_1, k_2,\ldots, k_p)$-cores from $p$-partite graphs in linear time, and this mining approach can be efficiently implemented in a distributed computing environment with a lower message complexity bound in comparison with the best known method of distributed $k$-core decomposition.
Learning Multilingual Word Representations using a Bag-of-Words Autoencoder
Venue: arXiv cs.CL 2014
Year: 2014

Recent work on learning multilingual word representations usually relies on the use of word-level alignements (e.g. infered with the help of GIZA++) between translated sentences, in order to align the word embeddings in different languages. In this workshop paper, we investigate an autoencoder model for learning multilingual word representations that does without such word-level alignements. The autoencoder is trained to reconstruct the bag-of-word representation of given sentence from an encoded representation extracted from its translation. We evaluate our approach on a multilingual document classification task, where labeled data is available only for one language (e.g. English) while classification must be performed in a different language (e.g. French). In our experiments, we observe that our method compares favorably with a previously proposed method that exploits word-level alignments to learn word representations.
Empirical Patterns in Google Scholar Citation Counts
Venue: arXiv cs.DL 2014
Year: 2014

Scholarly impact may be metricized using an author's total number of citations as a stand-in for real worth, but this measure varies in applicability between disciplines. The detail of the number of citations per publication is nowadays mapped in much more detail on the Web, exposing certain empirical patterns. This paper explores those patterns, using the citation data from Google Scholar for a number of authors.
Multiple-output support vector regression with a firefly algorithm for interval-valued stock price index forecasting
Venue: arXiv cs.CE 2014
Year: 2014

Highly accurate interval forecasting of a stock price index is fundamental to successfully making a profit when making investment decisions, by providing a range of values rather than a point estimate. In this study, we investigate the possibility of forecasting an interval-valued stock price index series over short and long horizons using multi-output support vector regression (MSVR). Furthermore, this study proposes a firefly algorithm (FA)-based approach, built on the established MSVR, for determining the parameters of MSVR (abbreviated as FA-MSVR). Three globally traded broad market indices are used to compare the performance of the proposed FA-MSVR method with selected counterparts. The quantitative and comprehensive assessments are performed on the basis of statistical criteria, economic criteria, and computational cost. In terms of statistical criteria, we compare the out-of-sample forecasting using goodness-of-forecast measures and testing approaches. In terms of economic criteria, we assess the relative forecast performance with a simple trading strategy. The results obtained in this study indicate that the proposed FA-MSVR method is a promising alternative for forecasting interval-valued financial time series.