OpenRaiser/Intern-Atlas huggingface dataset:
Algebraic Linear Orderings
Venue: arXiv cs.FL 2010
Year: 2010

An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the leaves of an algebraic tree. Using Courcelle's characterization of algebraic trees, we obtain the fact that a linear ordering is algebraic if and only if it can be represented as the lexicographic ordering of a deterministic context-free language. When the algebraic linear ordering is a well-ordering, its order type is an algebraic ordinal. We prove that the Hausdorff rank of any scattered algebraic linear ordering is less than $ω^ω$. It follows that the algebraic ordinals are exactly those less than $ω^{ω^ω}$.
Non Uniform Selection of Solutions for Upper Bounding the 3-SAT Threshold
Venue: arXiv cs.DM 2010
Year: 2010

We give a new insight into the upper bounding of the 3-SAT threshold by the first moment method. The best criteria developed so far to select the solutions to be counted discriminate among neighboring solutions on the basis of uniform information about each individual free variable. What we mean by uniform information, is information which does not depend on the solution: e.g. the number of positive/negative occurrences of the considered variable. What is new in our approach is that we use non uniform information about variables. Thus we are able to make a more precise tuning, resulting in a slight improvement on upper bounding the 3-SAT threshold for various models of formulas defined by their distributions.
Online Distributed Sensor Selection
Venue: arXiv cs.LG 2010
Year: 2010

A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to constraints (e.g., on power and bandwidth). In many applications the utility function is not known a priori, must be learned from data, and can even change over time. Furthermore for large sensor networks solving a centralized optimization problem to select sensors is not feasible, and thus we seek a fully distributed solution. In this paper, we present Distributed Online Greedy (DOG), an efficient, distributed algorithm for repeatedly selecting sensors online, only receiving feedback about the utility of the selected sensors. We prove very strong theoretical no-regret guarantees that apply whenever the (unknown) utility function satisfies a natural diminishing returns property called submodularity. Our algorithm has extremely low communication requirements, and scales well to large sensor deployments. We extend DOG to allow observation-dependent sensor selection. We empirically demonstrate the effectiveness of our algorithm on several real-world sensing tasks.
The Full Abstraction Problem for Higher Order Functional-Logic Programs
Venue: arXiv cs.LO 2010
Year: 2010

Developing suitable formal semantics can be of great help in the understanding, design and implementation of a programming language, and act as a guide for software development tools like analyzers or partial evaluators. In this sense, full abstraction is a highly desirable property, indicating a perfect correspondence between the semantics and the observable behavior of program pieces. In this work we address the question of full abstraction for the family of modern functional logic languages, in which functions can be higher order and non-deterministic, and where the semantics adopted for non-determinism is \emph{call-time choice}. We show that, with respect to natural notions of \emph{observation}, any semantics based on \emph{extensional} functions is necessarily unsound; in contrast, we show that the higher order version of \emph{CRWL}, a well-known existing semantic framework for functional logic programming, based on an \emph{intensional} view of functions, turns out to be fully abstract and compositional.
Towards Parameterized Regular Type Inference Using Set Constraints
Venue: arXiv cs.LO 2010
Year: 2010

We propose a method for inferring \emph{parameterized regular types} for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint systems). Such parameterized regular types generalize \emph{parametric} regular types by extending the scope of the parameters in the type definitions so that such parameters can relate the types of different predicates. We propose a number of enhancements to the procedure for solving the constraint systems that improve the precision of the type descriptions inferred. The resulting algorithm, together with a procedure to establish a set constraint system from a logic program, yields a program analysis that infers tighter safe approximations of the success types of the program than previous comparable work, offering a new and useful efficiency vs. precision trade-off. This is supported by experimental results, which show the feasibility of our analysis.
Adaptive Subcarrier PSK Intensity Modulation in Free Space Optical Systems
Venue: arXiv cs.NI 2010
Year: 2010

We propose an adaptive transmission technique for free space optical (FSO) systems, operating in atmospheric turbulence and employing subcarrier phase shift keying (S-PSK) intensity modulation. Exploiting the constant envelope characteristics of S-PSK, the proposed technique offers efficient utilization of the FSO channel capacity by adapting the modulation order of S-PSK, according to the instantaneous state of turbulence induced fading and a pre-defined bit error rate (BER) requirement. Novel expressions for the spectral efficiency and average BER of the proposed adaptive FSO system are presented and performance investigations under various turbulence conditions and target BER requirements are carried out. Numerical results indicate that significant spectral efficiency gains are offered without increasing the transmitted average optical power or sacrificing BER requirements, in moderate-to-strong turbulence conditions. Furthermore, the proposed variable rate transmission technique is applied to multiple input multiple output (MIMO) FSO systems, providing additional improvement in the achieved spectral efficiency as the number of the transmit and/or receive apertures increases.
Ahb Compatible DDR Sdram Controller Ip Core for Arm Based Soc
Venue: arXiv cs.AR 2010
Year: 2010

DDR SDRAM is similar in function to the regular SDRAM but doubles the bandwidth of the memory by transferring data on both edges of the clock cycles. DDR SDRAM most commonly used in various embedded application like networking, image or video processing, Laptops ete. Now a days many applications needs more and more cheap and fast memory. Especially in the field of signal processing, requires significant amount of memory. The most used type of dynamic memory for that purpose is DDR SDRAM. For FPGA design the IC manufacturers are providing commercial memory controller IP cores working only on their products. Main disadvantage is the lack of memory access optimization for random memory access patterns. The data path part of those controllers can be used free of charge. This work propose an architecture of a DDR SDRAM controller, which takes advantage of those available and well tested data paths and can be used for any FPGA device or ASIC design.(5). In most of the SOC design, DDR SDRAM is commonly used. ARM processor is widely used in SOCs; so that we focused to implement AHB compatible DDR SDRAM controller suitable for ARM based SOC design.
A Sublogarithmic Approximation for Highway and Tollbooth Pricing
Venue: arXiv cs.DS 2010
Year: 2010

An instance of the tollbooth problem consists of an undirected network and a collection of single-minded customers, each of which is interested in purchasing a fixed path subject to an individual budget constraint. The objective is to assign a per-unit price to each edge in a way that maximizes the collective revenue obtained from all customers. The revenue generated by any customer is equal to the overall price of the edges in her desired path, when this cost falls within her budget; otherwise, that customer will not purchase any edge. Our main result is a deterministic algorithm for the tollbooth problem on trees whose approximation ratio is O(log m / log log m), where m denotes the number of edges in the underlying graph. This finding improves on the currently best performance guarantees for trees, due to Elbassioni et al. (SAGT '09), as well as for paths (commonly known as the highway problem), due to Balcan and Blum (EC '06). An additional interesting consequence is a computational separation between tollbooth pricing on trees and the original prototype problem of single-minded unlimited supply pricing, under a plausible hardness hypothesis due to Demaine et al. (SODA '06).
Reaching the Unreached A Role of ICT in Sustainable Rural Development
Venue: arXiv cs.CY 2010
Year: 2010

We have seen in last few decades that the progress of information technology with leaps and bounds, which have completely changed the way of life in the developed nations. While internet has changed the established working practice and opened new vistas and provided a platform to connect, this gives the opportunity for collaborative work space that goes beyond the global boundary. ICT promises a fundamental change in all aspects of our lives, including knowledge dissemination, social interaction, economic and business practices, political engagement, media, education, health, leisure and entertainment...This paper introduces the application of ICT for rural development. The paper aims at improving the delivery of information to rural masses such as, technology information, marketing information, and information advice. This paper focuses digital divide and poverty eradication, good governance and the significance of internet for rural development. The paper concludes that ICTs offer the developing country, the opportunity to look ahead several stages of rural development by the use of internet. Effective use of ICT can demolish geographical boundaries and can bring rural communities closer to global economic systems and be of meaningful help to the underprivileged.
Partial monoids: associativity and confluence
Venue: arXiv cs.DM 2010
Year: 2010

A partial monoid $P$ is a set with a partial multiplication $\times$ (and total identity $1_P$) which satisfies some associativity axiom. The partial monoid $P$ may be embedded in a free monoid $P^*$ and the product $\star$ is simulated by a string rewriting system on $P^*$ that consists in evaluating the concatenation of two letters as a product in $P$, when it is defined, and a letter $1_P$ as the empty word $ε$. In this paper we study the profound relations between confluence for such a system and associativity of the multiplication. Moreover we develop a reduction strategy to ensure confluence and which allows us to define a multiplication on normal forms associative up to a given congruence of $P^*$. Finally we show that this operation is associative if, and only if, the rewriting system under consideration is confluent.
A Survivability Strategy in Route Optimization Mobile Network by Memetic Algorithm
Venue: arXiv cs.NI 2010
Year: 2010

The capability to provide network service even under a significant network system element disruption is the backbone for the survival of route optimize of mobile network Technology in today s world. Keeping this view in mind, the present paper highlights a new method based on memetic algorithm.
Using Statistical Moment Invariants and Entropy in Image Retrieval
Venue: arXiv cs.MM 2010
Year: 2010

Although content-based image retrieval (CBIR) is not a new subject, it keeps attracting more and more attention, as the amount of images grow tremendously due to internet, inexpensive hardware and automation of image acquisition. One of the applications of CBIR is fetching images from a database. This paper presents a new method for automatic image retrieval using moment invariants and image entropy, our technique could be used to find semi or perfect matches based on query by example manner, experimental results demonstrate that the purposed technique is scalable and efficient.
Effort minimization in UI development by reusing existing DGML based UI design for qualitative software development
Venue: arXiv cs.HC 2010
Year: 2010

This paper addresses the methodology for achieving the user interface design reusability of a qualitative software system and effort minimization by applying the inference on the stored design documents. The pictorial design documents are stored in a special format in the form of keyword text [DGML tag based design]. The design document storage mechanism will expose the keywords per design stored. This methodology is having an inference engine. Inference mechanism search for the requirements and find the match for them in the available design repository. A match found will success in reusing it after checking the quality parameters of the found design module in the result set. DGML notations produces qualitative designs which helps in minimizing the efforts of software development life cycle.
Application of k Means Clustering algorithm for prediction of Students Academic Performance
Venue: arXiv cs.LG 2010
Year: 2010

The ability to monitor the progress of students academic performance is a critical issue to the academic community of higher learning. A system for analyzing students results based on cluster analysis and uses standard statistical algorithms to arrange their scores data according to the level of their performance is described. In this paper, we also implemented k mean clustering algorithm for analyzing students result data. The model was combined with the deterministic model to analyze the students results of a private Institution in Nigeria which is a good benchmark to monitor the progression of academic performance of students in higher Institution for the purpose of making an effective decision by the academic planners.
Modeling the Probability of Failure on LDAP Binding Operations in Iplanet Web Proxy 3.6 Server
Venue: arXiv cs.PF 2010
Year: 2010

This paper is devoted to the theoretical analysis of a problem derived from interaction between two Iplanet products: Web Proxy Server and the Directory Server. In particular, a probabilistic and stochastic-approximation model is proposed to minimize the occurrence of LDAP connection failures in Iplanet Web Proxy 3.6 Server. The proposed model serves not only to provide a parameterization of the aforementioned phenomena, but also to provide meaningful insights illustrating and supporting these theoretical results. In addition, we shall also address practical considerations when estimating the parameters of the proposed model from experimental data. Finally, we shall provide some interesting results from real-world data collected from our customers.
Secured Cryptographic Key Generation From Multimodal Biometrics Feature Level Fusion Of Fingerprint And Iris
Venue: arXiv cs.CR 2010
Year: 2010

Human users have a tough time remembering long cryptographic keys. Hence, researchers, for so long, have been examining ways to utilize biometric features of the user instead of a memorable password or passphrase, in an effort to generate strong and repeatable cryptographic keys. Our objective is to incorporate the volatility of the users biometric features into the generated key, so as to make the key unguessable to an attacker lacking significant knowledge of the users biometrics. We go one step further trying to incorporate multiple biometric modalities into cryptographic key generation so as to provide better security. In this article, we propose an efficient approach based on multimodal biometrics (Iris and fingerprint) for generation of secure cryptographic key. The proposed approach is composed of three modules namely, 1) Feature extraction, 2) Multimodal biometric template generation and 3) Cryptographic key generation. Initially, the features, minutiae points and texture properties are extracted from the fingerprint and iris images respectively. Subsequently, the extracted features are fused together at the feature level to construct the multibiometric template. Finally, a 256bit secure cryptographic key is generated from the multibiometric template. For experimentation, we have employed the fingerprint images obtained from publicly available sources and the iris images from CASIA Iris Database. The experimental results demonstrate the effectiveness of the proposed approach.
Reachability Games on Extended Vector Addition Systems with States
Venue: arXiv cs.GT 2010
Year: 2010

We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of deciding the winner in such games is undecidable in general, we identify several decidable and even tractable subcases of this problem obtained by restricting the number of counters and/or the sets of target configurations.
Assessment Of The Wind Farm Impact On The Radar
Venue: arXiv cs.CV 2010
Year: 2010

This study shows the means to evaluate the wind farm impact on the radar. It proposes the set of tools, which can be used to realise this objective. The big part of report covers the study of complex pattern propagation factor as the critical issue of the Advanced Propagation Model (APM). Finally, the reader can find here the implementation of this algorithm - the real scenario in Inverness airport (the United Kingdom), where the ATC radar STAR 2000, developed by Thales Air Systems, operates in the presence of several wind farms. Basically, the project is based on terms of the department "Strategy Technology & Innovation", where it has been done. Also you can find here how the radar industry can act with the problem engendered by wind farms. The current strategies in this area are presented, such as a wind turbine production, improvements of air traffic handling procedures and the collaboration between developers of radars and wind turbines. The possible strategy for Thales as a main pioneer was given as well.
IT in Power Sector A KPCL Implementation
Venue: arXiv cs.OH 2010
Year: 2010

In this paper we investigate the extent of Information Technology penetration in Power sector, taking KPCL, Karnataka Power Corporation Ltd., a premier power generating, a state owned public sector organization as an example. Any organization to flourish, adoption of Information Technology is inevitable in the days of fast changing technological advancements. It is not merely the investment on IT which helps but adoption of right IT solutions and the optimum use of the same does matter and becomes most critical. A strong infrastructure coupled with modern technical and management concepts has helped KPCL to meet the challenges of the rising energy demands of Karnataka.
Model-Driven Constraint Programming
Venue: arXiv cs.AI 2010
Year: 2010

Constraint programming can definitely be seen as a model-driven paradigm. The users write programs for modeling problems. These programs are mapped to executable models to calculate the solutions. This paper focuses on efficient model management (definition and transformation). From this point of view, we propose to revisit the design of constraint-programming systems. A model-driven architecture is introduced to map solving-independent constraint models to solving-dependent decision models. Several important questions are examined, such as the need for a visual highlevel modeling language, and the quality of metamodeling techniques to implement the transformations. A main result is the s-COMMA platform that efficiently implements the chain from modeling to solving constraint problems
Erasure Multiple Descriptions
Venue: arXiv cs.IT 2010
Year: 2010

We consider a binary erasure version of the n-channel multiple descriptions problem with symmetric descriptions, i.e., the rates of the n descriptions are the same and the distortion constraint depends only on the number of messages received. We consider the case where there is no excess rate for every k out of n descriptions. Our goal is to characterize the achievable distortions D_1, D_2,...,D_n. We measure the fidelity of reconstruction using two distortion criteria: an average-case distortion criterion, under which distortion is measured by taking the average of the per-letter distortion over all source sequences, and a worst-case distortion criterion, under which distortion is measured by taking the maximum of the per-letter distortion over all source sequences. We present achievability schemes, based on random binning for average-case distortion and systematic MDS (maximum distance separable) codes for worst-case distortion, and prove optimality results for the corresponding achievable distortion regions. We then use the binary erasure multiple descriptions setup to propose a layered coding framework for multiple descriptions, which we then apply to vector Gaussian multiple descriptions and prove its optimality for symmetric scalar Gaussian multiple descriptions with two levels of receivers and no excess rate for the central receiver. We also prove a new outer bound for the general multi-terminal source coding problem and use it to prove an optimality result for the robust binary erasure CEO problem. For the latter, we provide a tight lower bound on the distortion for \ell messages for any coding scheme that achieves the minimum achievable distortion for k messages where k is less than or equal to \ell.
Cognitive Process of Comprehension in Requirement Analysis in IT Applications
Venue: arXiv cs.SE 2010
Year: 2010

Requirement Analysis is an important phase in software development which deals with understanding the customers requirements. It includes the collection of information from the customer, which is regarding the customers requirements and what he expects from the software which is to be developed. By doing so, you can have a better understanding of what the customer actually needs and hence can deliver the output as per the customers requirements. Studies are being carried out to bring about improvements in the process of requirement analysis so that errors in software development could be minimized and hence improved and reliable products could be delivered.
Rewriting Constraint Models with Metamodels
Venue: arXiv cs.AI 2010
Year: 2010

An important challenge in constraint programming is to rewrite constraint models into executable programs calculat- ing the solutions. This phase of constraint processing may require translations between constraint programming lan- guages, transformations of constraint representations, model optimizations, and tuning of solving strategies. In this paper, we introduce a pivot metamodel describing the common fea- tures of constraint models including different kinds of con- straints, statements like conditionals and loops, and other first-class elements like object classes and predicates. This metamodel is general enough to cope with the constructions of many languages, from object-oriented modeling languages to logic languages, but it is independent from them. The rewriting operations manipulate metamodel instances apart from languages. As a consequence, the rewriting operations apply whatever languages are selected and they are able to manage model semantic information. A bridge is created between the metamodel space and languages using parsing techniques. Tools from the software engineering world can be useful to implement this framework.
Quantifying the Deign Quality of Object Oriented System The metric based rules and heuristic
Venue: arXiv cs.SE 2010
Year: 2010

The design structure of OO software has decisive impact on its quality. The design must be strongly correlated with quality characteristics like analyzability, changeability, stability and testability, which are important for maintaining the system. But due to the diversity and complexity of the design properties of OO system e.g. Polymorphism, encapsulation, coupling it becomes cumbersome.