OpenRaiser/Intern-Atlas huggingface dataset:
Next Generation High Speed Computing Using Photonic Based Technolog
Venue: arXiv cs.ET 2011
Year: 2011

In the present era of technology computer has facilitated the human life up to a great extent. The speed of computation has raised to astonish level but the pace of development of other technologies which have core dependency over computers have raised relatively exponentially huge, though the computer speed of computation is very fast with respect to human abilities but still it has to be increased a lot more to meet the future requirements. We have pushed electrons to their maximum limit to a stage that nothing further could be expected from electrons. Alternately one can use photon to replace the relatively sluggish electrons. An alternate that posses all feature that an electron holds but only millions of time faster and with a far more reliability in one way or the other stretching the computers speed to a stage that no one would have ever even wonder. In this research paper the photonics implementations in computation industry have been presented along with its scope as an alternate to electron with comparative study of electron and photon under the computation perspective, generalized working of silicon based optical computers, the application of photons and their crucial role in the upcoming times. Keywords: Photonic Technology, H
Estimation of Severity of Speech Disability through Speech Envelope
Venue: arXiv cs.SD 2011
Year: 2011

In this paper, envelope detection of speech is discussed to distinguish the pathological cases of speech disabled children. The speech signal samples of children of age between five to eight years are considered for the present study. These speech signals are digitized and are used to determine the speech envelope. The envelope is subjected to ratio mean analysis to estimate the disability. This analysis is conducted on ten speech signal samples which are related to both place of articulation and manner of articulation. Overall speech disability of a pathological subject is estimated based on the results of above analysis.
A computability challenge: asymptotic bounds and isolated error-correcting codes
Venue: arXiv cs.IT 2011
Year: 2011

Consider the set of all error--correcting block codes over a fixed alphabet with $q$ letters. It determines a recursively enumerable set of points in the unit square with coordinates $(R,δ)$:= {\it (relative transmission rate, relative minimal distance).} Limit points of this set form a closed subset, defined by $R\le α_q(δ)$, where $α_q(δ)$ is a continuous decreasing function called {\it asymptotic bound.} Its existence was proved by the author in 1981, but all attempts to find an explicit formula for it so far failed. In this note I consider the question whether this function is computable in the sense of constructive mathematics, and discuss some arguments suggesting that the answer might be negative.
Enhancing Knowledge Sharing Between Educational Portals
Venue: arXiv cs.CY 2011
Year: 2011

Information and knowledge in exchange in public networks is a crucial challenge that needs to be overcome in order to consolidate the benefits associated with such structures. We study the impact of the nature of the information exchanged over the possibilities of success of this process, basing ourselves on the analysis of the information produced by the members of the Network of National Educational Portals. One of the main challenges that the Network of National Educational Portals faces consists in finding effective ways of sharing information that can promote knowledge transfer between members of the network. We argue that a key factor that prevents information sharing is the use of performance metrics by portal responsibles to evaluate the results of their decisions. These metrics are highly sensitive, context-dependent, and produced through non-standardized methods, all of which reduce the willingness of knowledge sharing. We present a different approach: based on the Network of National Educational Portals case, we propose creating a comprehensive information system aimed at providing reliable and timely information in a systematic fashion. We believe that adopting standardized procedures and indicators of less sensitive nature, we can produce information for all partners without the shortcomings of the usual practices.
Bottom-Left Placement Theorem for Rectangle Packing
Venue: arXiv cs.DM 2011
Year: 2011

This paper proves a bottom-left placement theorem for the rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given rectangles into a rectangular container without overlapping, then we can achieve a feasible packing by successively placing a rectangle onto a bottom-left corner in the container. This theorem shows that even for the real-parameter rectangle packing problem, we can solve it after finite times of bottom-left placement actions. Based on this theorem, we might develop efficient heuristic algorithms for solving the rectangle packing problem.
Consistent Query Answering via ASP from Different Perspectives: Theory and Practice
Venue: arXiv cs.DB 2011
Year: 2011

A data integration system provides transparent access to different data sources by suitably combining their data, and providing the user with a unified view of them, called global schema. However, source data are generally not under the control of the data integration process, thus integrated data may violate global integrity constraints even in presence of locally-consistent data sources. In this scenario, it may be anyway interesting to retrieve as much consistent information as possible. The process of answering user queries under global constraint violations is called consistent query answering (CQA). Several notions of CQA have been proposed, e.g., depending on whether integrated information is assumed to be sound, complete, exact or a variant of them. This paper provides a contribution in this setting: it uniforms solutions coming from different perspectives under a common ASP-based core, and provides query-driven optimizations designed for isolating and eliminating inefficiencies of the general approach for computing consistent answers. Moreover, the paper introduces some new theoretical results enriching existing knowledge on decidability and complexity of the considered problems. The effectiveness of the approach is evidenced by experimental results. To appear in Theory and Practice of Logic Programming (TPLP).
A Semantic Relatedness Measure Based on Combined Encyclopedic, Ontological and Collocational Knowledge
Venue: arXiv cs.CL 2011
Year: 2011

We describe a new semantic relatedness measure combining the Wikipedia-based Explicit Semantic Analysis measure, the WordNet path measure and the mixed collocation index. Our measure achieves the currently highest results on the WS-353 test: a Spearman rho coefficient of 0.79 (vs. 0.75 in (Gabrilovich and Markovitch, 2007)) when applying the measure directly, and a value of 0.87 (vs. 0.78 in (Agirre et al., 2009)) when using the prediction of a polynomial SVM classifier trained on our measure. In the appendix we discuss the adaptation of ESA to 2011 Wikipedia data, as well as various unsuccessful attempts to enhance ESA by filtering at word, sentence, and section level.
Multiple Access Demodulation in the Lifted Signal Graph with Spatial Coupling
Venue: arXiv cs.IT 2011
Year: 2011

Demodulation in a random multiple access channel is considered where the signals are chosen uniformly randomly with unit energy, a model applicable to several modern transmission systems. It is shown that by lifting (replicating) the graph of this system and randomizing the graph connections, a simple iterative cancellation demodulator can be constructed which achieves the same performance as an optimal symbol-by-symbol detector of the original system. The iterative detector has a complexity that is linear in the number of users, while the direct optimal approach is known to be NP-hard. However, the maximal system load of this lifted graph is limited to α<2.07, even for signal-to-noise ratios going to infinity - the system is interference limited. We then show that by introducing spatial coupling between subsequent lifted graphs, and anchoring the initial graphs, this limitation can be avoided and arbitrary system loads are achievable. Our results apply to several well-documented system proposals, such as IDMA, partitioned spreading, and certain forms of MIMO communications.
WLAN location system: Background theories and future directions
Venue: arXiv cs.NI 2011
Year: 2011

This paper presents background theories and required steps towards preparation of a WLAN location system. This paper targets on a software project and intention behind this paper is to motivate the young researchers in the area.
Discovering Attractive Products based on Influence Sets
Venue: arXiv cs.DB 2011
Year: 2011

Skyline queries have been widely used as a practical tool for multi-criteria decision analysis and for applications involving preference queries. For example, in a typical online retail application, skyline queries can help customers select the most interesting, among a pool of available, products. Recently, reverse skyline queries have been proposed, highlighting the manufacturer's perspective, i.e. how to determine the expected buyers of a given product. In this work we develop novel algorithms for two important classes of queries involving customer preferences. We first propose a novel algorithm, termed as RSA, for answering reverse skyline queries. We then introduce a new type of queries, namely the k-Most Attractive Candidates k-MAC query. In this type of queries, given a set of existing product specifications P, a set of customer preferences C and a set of new candidate products Q, the k-MAC query returns the set of k candidate products from Q that jointly maximizes the total number of expected buyers, measured as the cardinality of the union of individual reverse skyline sets (i.e., influence sets). Applying existing approaches to solve this problem would require calculating the reverse skyline set for each candidate, which is prohibitively expensive for large data sets. We, thus, propose a batched algorithm for this problem and compare its performance against a branch-and-bound variant that we devise. Both of these algorithms use in their core variants of our RSA algorithm. Our experimental study using both synthetic and real data sets demonstrates that our proposed algorithms outperform existing, or naive solutions to our studied classes of queries.
Public Announcement Logic in Geometric Frameworks
Venue: arXiv cs.LO 2011
Year: 2011

In this paper we introduce public announcement logic in different geometric frameworks. First, we consider topological models, and then extend our discussion to a more expressive model, namely, subset space models. Furthermore, we prove the completeness of public announcement logic in those frameworks. Moreover, we apply our results to different issues: announcement stabilization, backward induction and persistence.
Instantiation Schemes for Nested Theories
Venue: arXiv cs.AI 2011
Year: 2011

This paper investigates under which conditions instantiation-based proof procedures can be combined in a nested way, in order to mechanically construct new instantiation procedures for richer theories. Interesting applications in the field of verification are emphasized, particularly for handling extensions of the theory of arrays.
Mobile Cloud Computing: A Comparison of Application Models
Venue: arXiv cs.NI 2011
Year: 2011

Cloud computing is an emerging concept combining many fields of computing. The foundation of cloud computing is the delivery of services, software and processing capacity over the Internet, reducing cost, increasing storage, automating systems, decoupling of service delivery from underlying technology, and providing flexibility and mobility of information. However, the actual realization of these benefits is far from being achieved for mobile applications and open many new research questions. In order to better understand how to facilitate the building of mobile cloud-based applications, we have surveyed existing work in mobile computing through the prism of cloud computing principles. We give a definition of mobile cloud coputing and provide an overview of the results from this review, in particular, models of mobile cloud applications. We also highlight research challenges in the area of mobile cloud computing. We conclude with recommendations for how this better understanding of mobile cloud computing can help building more powerful mobile applications.
Efficient and Accurate Gaussian Image Filtering Using Running Sums
Venue: arXiv cs.CV 2011
Year: 2011

This paper presents a simple and efficient method to convolve an image with a Gaussian kernel. The computation is performed in a constant number of operations per pixel using running sums along the image rows and columns. We investigate the error function used for kernel approximation and its relation to the properties of the input signal. Based on natural image statistics we propose a quadratic form kernel error function so that the output image l2 error is minimized. We apply the proposed approach to approximate the Gaussian kernel by linear combination of constant functions. This results in very efficient Gaussian filtering method. Our experiments show that the proposed technique is faster than state of the art methods while preserving a similar accuracy.
On the Problem of Wireless Scheduling with Linear Power Levels
Venue: arXiv cs.NI 2011
Year: 2011

In this paper we consider the problem of communication scheduling in wireless networks with respect to the SINR(Signal to Interference plus Noise Ratio) constraint in metric spaces. The nodes are assigned linear powers, i.e. for each sender node the power is constant times the path loss between the sender and corresponding receiver. This is the minimal power for a successful transmission. We present a constant factor deterministic approximation algorithm, which works for at least Euclidean fading metrics. Simultaneously we obtain the approximate value of the optimal schedule length with error at most a constant factor. To give an insight into the complexity of the problem, we show that in some metric spaces the problem is NP-hard and cannot be approximated within a factor less than 1.5.
Achievable Secrecy Sum-Rate in a Fading MAC-WT with Power Control and without CSI of Eavesdropper
Venue: arXiv cs.IT 2011
Year: 2011

We consider a two user fading Multiple Access Channel with a wire-tapper (MAC-WT) where the transmitter has the channel state information (CSI) to the intended receiver but not to the eavesdropper (eve). We provide an achievable secrecy sum-rate with optimal power control. We next provide a secrecy sum-rate with optimal power control and cooperative jamming (CJ). We then study an achievable secrecy sum rate by employing an ON/OFF power control scheme which is more easily computable. We also employ CJ over this power control scheme. Results show that CJ boosts the secrecy sum-rate significantly even if we do not know the CSI of the eve's channel. At high SNR, the secrecy sum-rate (with CJ) without CSI of the eve exceeds the secrecy sum-rate (without CJ) with full CSI of the eve.
ALPprolog --- A New Logic Programming Method for Dynamic Domains
Venue: arXiv cs.LO 2011
Year: 2011

Logic programming is a powerful paradigm for programming autonomous agents in dynamic domains, as witnessed by languages such as Golog and Flux. In this work we present ALPprolog, an expressive, yet efficient, logic programming language for the online control of agents that have to reason about incomplete information and sensing actions.
Selecting Attributes for Sport Forecasting using Formal Concept Analysis
Venue: arXiv cs.AI 2011
Year: 2011

In order to address complex systems, apply pattern recongnition on their evolution could play an key role to understand their dynamics. Global patterns are required to detect emergent concepts and trends, some of them with qualitative nature. Formal Concept Analysis (FCA) is a theory whose goal is to discover and to extract Knowledge from qualitative data. It provides tools for reasoning with implication basis (and association rules). Implications and association rules are usefull to reasoning on previously selected attributes, providing a formal foundation for logical reasoning. In this paper we analyse how to apply FCA reasoning to increase confidence in sports betting, by means of detecting temporal regularities from data. It is applied to build a Knowledge-Based system for confidence reasoning.
Low Frequency Approximation for a class of Linear Quantum Systems using Cascade Cavity Realization
Venue: arXiv cs.SY 2011
Year: 2011

This paper presents a method for approximating a class of complex transfer function matrices corresponding to physically realizable complex linear quantum systems. The class of linear quantum systems under consideration includes interconnections of passive optical components such as cavities, beam-splitters, phase-shifters and interferometers. This approximation method builds on a previous result for cascade realization and gives good approximations at low frequencies.
Interest-Based vs. Social Person-Recommenders in Social Networking Platforms
Venue: arXiv cs.SI 2011
Year: 2011

Social network based approaches to person recommendations are compared to interest based approaches with the help of an empirical study on a large German social networking platform. We assess and compare the performance of different basic variants of the two approaches by precision / recall based performance with respect to reproducing known friendship relations and by an empirical questionnaire based study. In accordance to expectation, the results show that interest based person recommenders are able to produce more novel recommendations while performing less well with respect to friendship reproduction. With respect to the user's assessment of recommendation quality all approaches perform comparably well, while combined social-interest-based variants are slightly ahead in performance. The overall results qualify those combined approaches as a good compromise.
Codes as fractals and noncommutative spaces
Venue: arXiv cs.IT 2011
Year: 2011

We consider the CSS algorithm relating self-orthogonal classical linear codes to q-ary quantum stabilizer codes and we show that to such a pair of a classical and a quantum code one can associate geometric spaces constructed using methods from noncommutative geometry, arising from rational noncommutative tori and finite abelian group actions on Cuntz algebras and fractals associated to the classical codes.
Technical Note: Towards ROC Curves in Cost Space
Venue: arXiv cs.AI 2011
Year: 2011

ROC curves and cost curves are two popular ways of visualising classifier performance, finding appropriate thresholds according to the operating condition, and deriving useful aggregated measures such as the area under the ROC curve (AUC) or the area under the optimal cost curve. In this note we present some new findings and connections between ROC space and cost space, by using the expected loss over a range of operating conditions. In particular, we show that ROC curves can be transferred to cost space by means of a very natural way of understanding how thresholds should be chosen, by selecting the threshold such that the proportion of positive predictions equals the operating condition (either in the form of cost proportion or skew). We call these new curves {ROC Cost Curves}, and we demonstrate that the expected loss as measured by the area under these curves is linearly related to AUC. This opens up a series of new possibilities and clarifies the notion of cost curve and its relation to ROC analysis. In addition, we show that for a classifier that assigns the scores in an evenly-spaced way, these curves are equal to the Brier Curves. As a result, this establishes the first clear connection between AUC and the Brier score.
CBR with Commonsense Reasoning and Structure Mapping: An Application to Mediation
Venue: arXiv cs.AI 2011
Year: 2011

Mediation is an important method in dispute resolution. We implement a case based reasoning approach to mediation integrating analogical and commonsense reasoning components that allow an artificial mediation agent to satisfy requirements expected from a human mediator, in particular: utilizing experience with cases in different domains; and structurally transforming the set of issues for a better solution. We utilize a case structure based on ontologies reflecting the perceptions of the parties in dispute. The analogical reasoning component, employing the Structure Mapping Theory from psychology, provides a flexibility to respond innovatively in unusual circumstances, in contrast with conventional approaches confined into specialized problem domains. We aim to build a mediation case base incorporating real world instances ranging from interpersonal or intergroup disputes to international conflicts.
BGP Stability is Precarious
Venue: arXiv cs.NI 2011
Year: 2011

We note a fact which is simple, but may be useful for the networking research community: essentially any change to BGP's decision process can cause divergence --- or convergence when BGP would otherwise diverge.
Key Predistribution Schemes for Distributed Sensor Networks
Venue: arXiv cs.CR 2011
Year: 2011

Key predistribution schemes for distributed sensor networks have received significant attention in the recent literature. In this paper we propose a new construction method for these schemes based on combinations of duals of standard block designs. Our method is a broad spectrum one which works for any intersection threshold. By varying the initial designs, we can generate various schemes and this makes the method quite flexible. We also obtain explicit algebraic expressions for the metrics for local connectivity and resiliency. These schemes are quite efficient with regard to connectivity and resiliency and at the same time they allow a straightforward shared-key discovery.
(Co-)Inductive semantics for Constraint Handling Rules
Venue: arXiv cs.LO 2011
Year: 2011

In this paper, we address the problem of defining a fixpoint semantics for Constraint Handling Rules (CHR) that captures the behavior of both simplification and propagation rules in a sound and complete way with respect to their declarative semantics. Firstly, we show that the logical reading of states with respect to a set of simplification rules can be characterized by a least fixpoint over the transition system generated by the abstract operational semantics of CHR. Similarly, we demonstrate that the logical reading of states with respect to a set of propagation rules can be characterized by a greatest fixpoint. Then, in order to take advantage of both types of rules without losing fixpoint characterization, we present an operational semantics with persistent. We finally establish that this semantics can be characterized by two nested fixpoints, and we show the resulting language is an elegant framework to program using coinductive reasoning.
Black-Box Complexities of Combinatorial Problems
Venue: arXiv cs.NE 2011
Year: 2011

Black-box complexity is a complexity theoretic measure for how difficult a problem is to be optimized by a general purpose optimization algorithm. It is thus one of the few means trying to understand which problems are tractable for genetic algorithms and other randomized search heuristics. Most previous work on black-box complexity is on artificial test functions. In this paper, we move a step forward and give a detailed analysis for the two combinatorial problems minimum spanning tree and single-source shortest paths. Besides giving interesting bounds for their black-box complexities, our work reveals that the choice of how to model the optimization problem is non-trivial here. This in particular comes true where the search space does not consist of bit strings and where a reasonable definition of unbiasedness has to be agreed on.