OpenRaiser/Intern-Atlas huggingface dataset:
On the Capacity of the One-Bit Deletion and Duplication Channel
Venue: arXiv cs.IT 2012
Year: 2012

The one-bit deletion and duplication channel is investigated. An input to this channel consists of a block of bits which experiences either a deletion, or a duplication, or remains unchanged. For this channel a capacity expression is obtained in a certain asymptotic regime where the deletion and duplication probabilities tend to zero. As a corollary, we obtain an asymptotic expression for the capacity of the segmented deletion and duplication channel where the input now consists of several blocks and each block independently experiences either a deletion, or a duplication, or remains unchanged.
An Introduction on Dependency Between Hardware Life Time Components and Dynamic Voltage Scaling
Venue: arXiv cs.DC 2012
Year: 2012

The main open question is how to calculate the effect of switching between frequencies in DVFS technique on the lifetime of the cluster components. As moving from one frequency to another in DVFS technique always gives a shock to the component and consequently decreases the component lifetime, therefore, it becomes interesting to answer the question of how fast a component can change its speed in order to decrease power without changing its lifetime.
Lightweight compilation of (C)LP to JavaScript
Venue: arXiv cs.PL 2012
Year: 2012

We present and evaluate a compiler from Prolog (and extensions) to JavaScript which makes it possible to use (constraint) logic programming to develop the client side of web applications while being compliant with current industry standards. Targeting JavaScript makes (C)LP programs executable in virtually every modern computing device with no additional software requirements from the point of view of the user. In turn, the use of a very high-level language facilitates the development of high-quality, complex software. The compiler is a back end of the Ciao system and supports most of its features, including its module system and its rich language extension mechanism based on packages. We present an overview of the compilation process and a detailed description of the run-time system, including the support for modular compilation into separate JavaScript code. We demonstrate the maturity of the compiler by testing it with complex code such as a CLP(FD) library written in Prolog with attributed variables. Finally, we validate our proposal by measuring the performance of some LP and CLP(FD) benchmarks running on top of major JavaScript engines.
Efficient Solution to the 3D Problem of Automatic Wall Paintings Reassembly
Venue: arXiv cs.CV 2012
Year: 2012

This paper introduces a new approach for the automated reconstruction - reassembly of fragmented objects having one surface near to plane, on the basis of the 3D representation of their constituent fragments. The whole process starts by 3D scanning of the available fragments. The obtained representations are properly processed so that they can be tested for possible matches. Next, four novel criteria are introduced, that lead to the determination of pairs of matching fragments. These criteria have been chosen so as the whole process imitates the instinctive reassembling method dedicated scholars apply. The first criterion exploits the volume of the gap between two properly placed fragments. The second one considers the fragments' overlapping in each possible matching position. Criteria 3,4 employ principles from calculus of variations to obtain bounds for the area and the mean curvature of the contact surfaces and the length of contact curves, which must hold if the two fragments match. The method has been applied, with great success, both in the reconstruction of objects artificially broken by the authors and, most importantly, in the virtual reassembling of parts of wall paintings belonging to the Mycenaic civilization (c. 1300 B.C.), excavated in a highly fragmented condition in Tyrins, Greece.
Local Bifurcations in DC-DC Converters
Venue: arXiv cs.SY 2012
Year: 2012

Three local bifurcations in DC-DC converters are reviewed. They are period-doubling bifurcation, saddle-node bifurcation, and Neimark bifurcation. A general sampled-data model is employed to study the types of loss of stability of the nominal (periodic) solution and their connection with local bifurcations. More accurate prediction of instability and bifurcation than using the averaging approach is obtained. Examples of bifurcations associated with instabilities in DC-DC converters are given.
Symbolic Analysis for Boundary Problems: From Rewriting to Parametrized Gröbner Bases
Venue: arXiv cs.SC 2012
Year: 2012

We review our algebraic framework for linear boundary problems (concentrating on ordinary differential equations). Its starting point is an appropriate algebraization of the domain of functions, which we have named integro-differential algebras. The algebraic treatment of boundary problems brings up two new algebraic structures whose symbolic representation and computational realization is based on canonical forms in certain commutative and noncommutative polynomial domains. The first of these, the ring of integro-differential operators, is used for both stating and solving linear boundary problems. The other structure, called integro-differential polynomials, is the key tool for describing extensions of integro-differential algebras. We use the canonical simplifier for integro-differential polynomials for generating an automated proof establishing a canonical simplifier for integro-differential operators. Our approach is fully implemented in the Theorema system; some code fragments and sample computations are included.
Psychophysical Responses Comparison in Spatial Visual, Audiovisual, and Auditory BCI-Spelling Paradigms
Venue: arXiv cs.HC 2012
Year: 2012

The paper presents a pilot study conducted with spatial visual, audiovisual and auditory brain-computer-interface (BCI) based speller paradigms. The psychophysical experiments are conducted with healthy subjects in order to evaluate a difficulty and a possible response accuracy variability. We also present preliminary EEG results in offline BCI mode. The obtained results validate a thesis, that spatial auditory only paradigm performs as good as the traditional visual and audiovisual speller BCI tasks.
Investigating Decision Support Techniques for Automating Cloud Service Selection
Venue: arXiv cs.DC 2012
Year: 2012

The compass of Cloud infrastructure services advances steadily leaving users in the agony of choice. To be able to select the best mix of service offering from an abundance of possibilities, users must consider complex dependencies and heterogeneous sets of criteria. Therefore, we present a PhD thesis proposal on investigating an intelligent decision support system for selecting Cloud based infrastructure services (e.g. storage, network, CPU).
Performance Evaluation of Mobile U-Navigation based on GPS/WLAN Hybridization
Venue: arXiv cs.OH 2012
Year: 2012

This paper present our mobile u-navigation system. This approach utilizes hybridization of wireless local area network and Global Positioning System internal sensor which to receive signal strength from access point and the same time retrieve Global Navigation System Satellite signal. This positioning information will be switched based on type of environment in order to ensure the ubiquity of positioning system. Finally we present our results to illustrate the performance of the localization system for an indoor/ outdoor environment set-up.
Unique Decoding of General AG Codes
Venue: arXiv cs.IT 2012
Year: 2012

A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it retains the same advantages of fast speed and regular structure with the previous algorithm. Compared with other known decoding algorithms for general AG codes, it is much simpler in its description and implementation.
A lightweight forum-based distributed requirement elicitation process for open source community
Venue: arXiv cs.SE 2012
Year: 2012

Nowadays, lots of open source communities adopt forum to acquire scattered stakeholders' requirements. But the requirements collection process always suffers from the unformatted description and unfocused discussions. In this paper, we establish a framework ReqForum to define the metamodel of the requirement elicitation forum. Based on it, we propose a lightweight forum-based requirements elicitation process which includes six steps: template-based requirements creation, opinions collection, requirements collection, requirements management, capability identification and the incentive mechanism. According to the proposed process, the prototype SKLSEForum is established by composing the Discuz and its existed pulg-ins. The implementation indicates that the process is feasible and the cost is economic.
Interactive Realizability and the elimination of Skolem functions in Peano Arithmetic
Venue: arXiv cs.LO 2012
Year: 2012

We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservative over Peano Arithmetic alone for arithmetical formulas. This result - which shows that the Excluded Middle principle can be used to eliminate Skolem functions - has been previously proved by other techniques, among them the epsilon substitution method and forcing. In our proof, we employ Interactive Realizability, a computational semantics for Peano Arithmetic which extends Kreisel's modified realizability to the classical case.
Data Interpolation: An Efficient Sampling Alternative for Big Data Aggregation
Venue: arXiv cs.NI 2012
Year: 2012

Given a large set of measurement sensor data, in order to identify a simple function that captures the essence of the data gathered by the sensors, we suggest representing the data by (spatial) functions, in particular by polynomials. Given a (sampled) set of values, we interpolate the datapoints to define a polynomial that would represent the data. The interpolation is challenging, since in practice the data can be noisy and even Byzantine, where the Byzantine data represents an adversarial value that is not limited to being close to the correct measured data. We present two solutions, one that extends the Welch-Berlekamp technique in the case of multidimensional data, and copes with discrete noise and Byzantine data, and the other based on Arora and Khot techniques, extending them in the case of multidimensional noisy and Byzantine data.
Distributional Framework for Emergent Knowledge Acquisition and its Application to Automated Document Annotation
Venue: arXiv cs.AI 2012
Year: 2012

The paper introduces a framework for representation and acquisition of knowledge emerging from large samples of textual data. We utilise a tensor-based, distributional representation of simple statements extracted from text, and show how one can use the representation to infer emergent knowledge patterns from the textual data in an unsupervised manner. Examples of the patterns we investigate in the paper are implicit term relationships or conjunctive IF-THEN rules. To evaluate the practical relevance of our approach, we apply it to annotation of life science articles with terms from MeSH (a controlled biomedical vocabulary and thesaurus).
Bad Data Injection Attack and Defense in Electricity Market using Game Theory Study
Venue: arXiv cs.CR 2012
Year: 2012

Applications of cyber technologies improve the quality of monitoring and decision making in smart grid. These cyber technologies are vulnerable to malicious attacks, and compromising them can have serious technical and economical problems. This paper specifies the effect of compromising each measurement on the price of electricity, so that the attacker is able to change the prices in the desired direction (increasing or decreasing). Attacking and defending all measurements are impossible for the attacker and defender, respectively. This situation is modeled as a zero sum game between the attacker and defender. The game defines the proportion of times that the attacker and defender like to attack and defend different measurements, respectively. From the simulation results based on the PJM 5 Bus test system, we can show the effectiveness and properties of the studied game.
Modelling an Automatic Proof Generator for Functional Dependency Rules Using Colored Petri Net
Venue: arXiv cs.DB 2012
Year: 2012

Database administrators need to compute closure of functional dependencies (FDs) for normalization of database systems and enforcing integrity rules. Colored Petri net (CPN) is a powerful formal method for modelling and verification of various systems. In this paper, we modelled Armstrong's axioms for automatic proof generation of a new FD rule from initial FD rules using CPN. For this purpose, a CPN model of Armstrong's axioms presents and initial FDs considered in the model as initial color set. Then we search required FD in the state space of the model via model checking. If it exists in the state space, then a recursive ML code extracts the proof of this FD rule using further searches in the state space of the model.
Contrasting Multiple Social Network Autocorrelations for Binary Outcomes, With Applications To Technology Adoption
Venue: arXiv cs.SI 2012
Year: 2012

The rise of socially targeted marketing suggests that decisions made by consumers can be predicted not only from their personal tastes and characteristics, but also from the decisions of people who are close to them in their networks. One obstacle to consider is that there may be several different measures for "closeness" that are appropriate, either through different types of friendships, or different functions of distance on one kind of friendship, where only a subset of these networks may actually be relevant. Another is that these decisions are often binary and more difficult to model with conventional approaches, both conceptually and computationally. To address these issues, we present a hierarchical model for individual binary outcomes that uses and extends the machinery of the auto-probit method for binary data. We demonstrate the behavior of the parameters estimated by the multiple network-regime auto-probit model (m-NAP) under various sensitivity conditions, such as the impact of the prior distribution and the nature of the structure of the network, and demonstrate on several examples of correlated binary data in networks of interest to Information Systems, including the adoption of Caller Ring-Back Tones, whose use is governed by direct connection but explained by additional network topologies.
Comparing Spectrum Utilization using Fuzzy Logic System for Heterogeneous Wireless Networks via Cognitive Radio
Venue: arXiv cs.NI 2012
Year: 2012

At present, lots of works focus on spectrum allocation of wireless networks. In this paper, we proposed a Cognitive based spectrum access by opportunistically approach of Heterogeneous Wireless networks based on Fuzzy Logic system. The Cognitive Radio is a technology where a network or a wireless system changes its environment parameters to communicate efficiently by avoiding the interference with the users. By applying FLS (Fuzzy Logic System), the available spectrum utilization is effectively utilized with the help of the three antecedents namely Spectrum utilization efficiency, Degree of mobility, Distance from primary user to the secondary users. The proposed work is compared with normal Spectrum Utilization method. Finally, Simulation results of the proposed work Fuzzy Logic System shows more efficient than the normal Spectrum utilization method.
Simple and Nearly Optimal Multi-Item Auctions
Venue: arXiv cs.GT 2012
Year: 2012

We provide a Polynomial Time Approximation Scheme (PTAS) for the Bayesian optimal multi-item multi-bidder auction problem under two conditions. First, bidders are independent, have additive valuations and are from the same population. Second, every bidder's value distributions of items are independent but not necessarily identical monotone hazard rate (MHR) distributions. For non-i.i.d. bidders, we also provide a PTAS when the number of bidders is small. Prior to our work, even for a single bidder, only constant factor approximations are known. Another appealing feature of our mechanism is the simple allocation rule. Indeed, the mechanism we use is either the second-price auction with reserve price on every item individually, or VCG allocation with a few outlying items that requires additional treatments. It is surprising that such simple allocation rules suffice to obtain nearly optimal revenue.
Pattern matching in compilers
Venue: arXiv cs.PL 2012
Year: 2012

In this thesis we develop tools for effective and flexible pattern matching. We introduce a new pattern matching system called amethyst. Amethyst is not only a generator of parsers of programming languages, but can also serve as an alternative to tools for matching regular expressions. Our framework also produces dynamic parsers. Its intended use is in the context of IDE (accurate syntax highlighting and error detection on the fly). Amethyst offers pattern matching of general data structures. This makes it a useful tool for implementing compiler optimizations such as constant folding, instruction scheduling, and dataflow analysis in general. The parsers produced are essentially top-down parsers. Linear time complexity is obtained by introducing the novel notion of structured grammars and regularized regular expressions. Amethyst uses techniques known from compiler optimizations to produce effective parsers.
User-Centric Optimization for Constraint Web Service Composition using a Fuzzy-guided Genetic Algorithm System
Venue: arXiv cs.SE 2012
Year: 2012

Service-Oriented Applications (SOA) are being regarded as the main pragmatic solution for distributed environments. In such systems, however each service responds the user request independently, it is essential to compose them for delivering a compound value-added service. Since, there may be a number of compositions to create the requested service, it is important to find one which its properties are close to user's desires and meet some non-functional constraints and optimize criteria such as overall cost or response time. In this paper, a user-centric approach is presented for evaluating the service compositions which attempts to obtain the user desires. This approach uses fuzzy logic in order to inference based on quality criteria ranked by user and Genetic Algorithms to optimize the QoS-aware composition problem. Results show that the Fuzzy-based Genetic algorithm system enables user to participate in the process of web service composition easier and more efficient.
Conducting Verification And Validation Of Multi- Agent Systems
Venue: arXiv cs.SE 2012
Year: 2012

Verification and Validation (V&V) is a series of activities, technical and managerial, which performed by system tester not the system developer in order to improve the system quality, system reliability and assure that product satisfies the users operational needs. Verification is the assurance that the products of a particular development phase are consistent with the requirements of that phase and preceding phase(s), while validation is the assurance that the final product meets system requirements. an outside agency can be used to performed V&V, which is indicate by Independent V&V, or IV&V, or by a group within the organization but not the developer, referred to as Internal V&V. Use of V&V often accompanies testing, can improve quality assurance, and can reduce risk. This paper putting guidelines for performing V&V of Multi-Agent Systems (MAS).
On the Role of Contrast and Regularity in Perceptual Boundary Saliency
Venue: arXiv cs.CV 2012
Year: 2012

Mathematical Morphology proposes to extract shapes from images as connected components of level sets. These methods prove very suitable for shape recognition and analysis. We present a method to select the perceptually significant (i.e., contrasted) level lines (boundaries of level sets), using the Helmholtz principle as first proposed by Desolneux et al. Contrarily to the classical formulation by Desolneux et al. where level lines must be entirely salient, the proposed method allows to detect partially salient level lines, thus resulting in more robust and more stable detections. We then tackle the problem of combining two gestalts as a measure of saliency and propose a method that reinforces detections. Results in natural images show the good performance of the proposed methods.
Blind speech separation based on undecimated wavelet packet-perceptual filterbanks and independent component analysis
Venue: arXiv cs.SD 2012
Year: 2012

In this paper, we address the problem of blind separation of speech mixtures. We propose a new blind speech separation system, which integrates a perceptual filterbank and independent component analysis (ICA) and using kurtosis criterion. The perceptual filterbank was designed by adjusting undecimated wavelet packet decomposition (UWPD) tree in order to accord to critical band characteristics of psycho-acoustic model. Our proposed technique consists on transforming the observations signals into an adequate representation using UWPD and Kurtosis maximization criterion in a new preprocessing step in order to increase the non-Gaussianity which is a pre-requirement for ICA. Experiments were carried out with the instantaneous mixture of two speech sources using two sensors. The obtained results show that the proposed method gives a considerable improvement when compared with FastICA and other techniques.
Opinion Mining for Relating Subjective Expressions and Annual Earnings in US Financial Statements
Venue: arXiv cs.CL 2012
Year: 2012

Financial statements contain quantitative information and manager's subjective evaluation of firm's financial status. Using information released in U.S. 10-K filings. Both qualitative and quantitative appraisals are crucial for quality financial decisions. To extract such opinioned statements from the reports, we built tagging models based on the conditional random field (CRF) techniques, considering a variety of combinations of linguistic factors including morphology, orthography, predicate-argument structure, syntax, and simple semantics. Our results show that the CRF models are reasonably effective to find opinion holders in experiments when we adopted the popular MPQA corpus for training and testing. The contribution of our paper is to identify opinion patterns in multiword expressions (MWEs) forms rather than in single word forms. We find that the managers of corporations attempt to use more optimistic words to obfuscate negative financial performance and to accentuate the positive financial performance. Our results also show that decreasing earnings were often accompanied by ambiguous and mild statements in the reporting year and that increasing earnings were stated in assertive and positive way.
Power-efficient Hierarchical Data Aggregation using Compressive Sensing in WSN
Venue: arXiv cs.DC 2012
Year: 2012

Compressive Sensing (CS) method is a burgeoning technique being applied to diverse areas including wireless sensor networks (WSNs). In WSNs, it has been studied in the context of data gathering and aggregation, particularly aimed at reducing data transmission cost and improving power efficiency. Existing CS based data gathering work in WSNs assume fixed and uniform compression threshold across the network, regard- less of the data field characteristics. In this paper, we present a novel data aggregation architecture model that combines a multi- resolution structure with compressed sensing. The compression thresholds vary over the aggregation hierarchy, reflecting the underlying data field. Compared with previous relevant work, the proposed model shows its significant energy saving from theoretical analysis. We have also implemented the proposed CS- based data aggregation framework on a SIDnet SWANS platform, discrete event simulator commonly used for WSN simulations. Our experiments show substantial energy savings, ranging from 37% to 77% for different nodes in the networking depending on the position of hierarchy.