OpenRaiser/Intern-Atlas huggingface dataset:
Introducing LoCo, a Logic for Configuration Problems
Venue: arXiv cs.LO 2011
Year: 2011

In this paper we present the core of LoCo, a logic-based high-level representation language for expressing configuration problems. LoCo shall allow to model these problems in an intuitive and declarative way, the dynamic aspects of configuration notwithstanding. Our logic enforces that configurations contain only finitely many components and reasoning can be reduced to the task of model construction.
Architectural solutions of conformal network-centric staring-sensor systems with spherical field of view
Venue: arXiv cs.SY 2011
Year: 2011

The article presents the concept of network-centric conformal electro-optical systems construction with spherical field of view. It discusses abstract passive distributed electro-optical systems with focal array detectors based on a group of moving objects distributed in space. The system performs conformal processing of information from sensor matrix in a single event coordinate-time field. Unequivocally the construction of the systems which satisfy the different criteria of optimality is very complicated and requires special approaches to their development and design. The paper briefly touches upon key questions (in the authors' opinion) in the synthesis of such systems that meet different criteria of optimality. The synthesis of such systems is discussed by authors with the systematic and synergy approaches.
Automatic Application Level Set Approach in Detection Calcifications in Mammographic Image
Venue: arXiv cs.CV 2011
Year: 2011

Breast cancer is considered as one of a major health problem that constitutes the strongest cause behind mortality among women in the world. So, in this decade, breast cancer is the second most common type of cancer, in term of appearance frequency, and the fifth most common cause of cancer related death. In order to reduce the workload on radiologists, a variety of CAD systems; Computer-Aided Diagnosis (CADi) and Computer-Aided Detection (CADe) have been proposed. In this paper, we interested on CADe tool to help radiologist to detect cancer. The proposed CADe is based on a three-step work flow; namely, detection, analysis and classification. This paper deals with the problem of automatic detection of Region Of Interest (ROI) based on Level Set approach depended on edge and region criteria. This approach gives good visual information from the radiologist. After that, the features extraction using textures characteristics and the vector classification using Multilayer Perception (MLP) and k-Nearest Neighbours (KNN) are adopted to distinguish different ACR (American College of Radiology) classification. Moreover, we use the Digital Database for Screening Mammography (DDSM) for experiments and these results in term of accuracy varied between 60 % and 70% are acceptable and must be ameliorated to aid radiologist.
Discovering the Impact of Knowledge in Recommender Systems: A Comparative Study
Venue: arXiv cs.IR 2011
Year: 2011

Recommender systems engage user profiles and appropriate filtering techniques to assist users in finding more relevant information over the large volume of information. User profiles play an important role in the success of recommendation process since they model and represent the actual user needs. However, a comprehensive literature review of recommender systems has demonstrated no concrete study on the role and impact of knowledge in user profiling and filtering approache. In this paper, we review the most prominent recommender systems in the literature and examine the impression of knowledge extracted from different sources. We then come up with this finding that semantic information from the user context has substantial impact on the performance of knowledge based recommender systems. Finally, some new clues for improvement the knowledge-based profiles have been proposed.
A Novel VSWR-Protected and Controllable CMOS Class E Power Amplifier for Bluetooth Applications
Venue: arXiv cs.OH 2011
Year: 2011

This paper describes the design of a differential class-E PA for Bluetooth applications in 0.18um CMOS technology with load mismatch protection and power control features. The breakdown induced by load mismatch can be avoided by attenuating the RF power to the final stage during over voltage conditions. Power control is realized by means of "open loop" techniques to regulate the power supply voltage, and a novel controllable bias network with temperature compensated is proposed, which allows a moderate power control slope (dB/V) to be achieved. Post-layout Simulation results show that the level of output power can be controlled in 2dBm steps; especially the output power in every step is quite insensitive to temperature variations.
Planar and Poly-Arc Lombardi Drawings
Venue: arXiv cs.CG 2011
Year: 2011

In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi drawing, and not every planar graph has a planar Lombardi drawing. We introduce k-Lombardi drawings, in which each edge may be drawn with k circular arcs, noting that every graph has a smooth 2-Lombardi drawing. We show that every planar graph has a smooth planar 3-Lombardi drawing and further investigate topics connecting planarity and Lombardi drawings.
Meta-song evaluation for chord recognition
Venue: arXiv cs.IR 2011
Year: 2011

We present a new approach to evaluate chord recognition systems on songs which do not have full annotations. The principle is to use online chord databases to generate high accurate "pseudo annotations" for these songs and compute "pseudo accuracies" of test systems. Statistical models that model the relationship between "pseudo accuracy" and real performance are then applied to estimate test systems' performance. The approach goes beyond the existing evaluation metrics, allowing us to carry out extensive analysis on chord recognition systems, such as their generalizations to different genres. In the experiments we applied this method to evaluate three state-of-the-art chord recognition systems, of which the results verified its reliability.
A survey of fuzzy control for stabilized platforms
Venue: arXiv cs.SY 2011
Year: 2011

This paper focusses on the application of fuzzy control techniques (fuzzy type-1 and type-2) and their hybrid forms (Hybrid adaptive fuzzy controller and fuzzy-PID controller) in the area of stabilized platforms. It represents an attempt to cover the basic principles and concepts of fuzzy control in stabilization and position control, with an outline of a number of recent applications used in advanced control of stabilized platform. Overall, in this survey we will make some comparisons with the classical control techniques such us PID control to demonstrate the advantages and disadvantages of the application of fuzzy control techniques.
Translating Nondeterministic Functional Language based on Attribute Grammars into Java
Venue: arXiv cs.PL 2011
Year: 2011

Knowledge-based systems are suitable for realizing advanced functions that require domain-specific expert knowledge, while knowledge representation languages and their supporting environments are essential for realizing such systems. Although Prolog is useful and effective in realizing such a supporting environment, the language interoperability with other implementation languages, such as Java, is often an important issue in practical application development. This paper describes the techniques for translating a knowledge representation language that is a nondeterministic functional language based on attribute grammars into Java. The translation is based on binarization and the techniques proposed for Prolog to Java translation although the semantics are different from those of Prolog. A continuation unit is introduced to handle continuation efficiently, while the variable and register management on backtracking is simplified by using the single and unidirectional assignment features of variables. An experimental translator written in the language itself successfully generates Java code, while experimental results show that the generated code is over 25 times faster than that of Prolog Cafe for nondeterministic programs, and over 2 times faster for deterministic programs. The generated code is also over 2 times faster than B-Prolog for nondeterministic programs.
Doubly Optimal Secure Multicasting: Hierarchical Hybrid Communication Network : Disaster Relief
Venue: arXiv cs.NI 2011
Year: 2011

Recently, the world has witnessed the increasing occurrence of disasters, some of natural origin and others caused by man. The intensity of the phenomenon that cause such disasters, the frequency in which they occur, the number of people affected and the material damage caused by them have been growing substantially. Disasters are defined as natural, technological, and human-initiated events that disrupt the normal functioning of the economy and society on a large scale. Areas where disasters have occurred bring many dangers to rescue teams and the communication network infrastructure is usually destroyed. To manage these hazards, different wireless technologies can be launched in the area of disaster. This paper discusses the innovative wireless technologies for Disaster Management. Specifically, issues related to the design of Hierarchical Hybrid Communication Network (arising in the communication network for disaster relief) are discussed.
Problem Reduction in Online Payment System Using Hybrid Model
Venue: arXiv cs.CR 2011
Year: 2011

Online auction, shopping, electronic billing etc. all such types of application involves problems of fraudulent transactions. Online fraud occurrence and its detection is one of the challenging fields for web development and online phantom transaction. As no-secure specification of online frauds is in research database, so the techniques to evaluate and stop them are also in study. We are providing an approach with Hidden Markov Model (HMM) and mobile implicit authentication to find whether the user interacting online is a fraud or not. We propose a model based on these approaches to counter the occurred fraud and prevent the loss of the customer. Our technique is more parameterized than traditional approaches and so,chances of detecting legitimate user as a fraud will reduce.
Traffic dynamics in scale-free networks with limited packet-delivering capacity
Venue: arXiv cs.NI 2011
Year: 2011

We propose a limited packet-delivering capacity model for traffic dynamics in scale-free networks. In this model, the total node's packet-delivering capacity is fixed, and the allocation of packet-delivering capacity on node $i$ is proportional to $k_{i}^ϕ$, where $k_{i}$ is the degree of node $i$ and $ϕ$ is a adjustable parameter. We have applied this model on the shortest path routing strategy as well as the local routing strategy, and found that there exists an optimal value of parameter $ϕ$ leading to the maximal network capacity under both routing strategies. We provide some explanations for the emergence of optimal $ϕ$.
Adaptation-Based Programming in Haskell
Venue: arXiv cs.PL 2011
Year: 2011

We present an embedded DSL to support adaptation-based programming (ABP) in Haskell. ABP is an abstract model for defining adaptive values, called adaptives, which adapt in response to some associated feedback. We show how our design choices in Haskell motivate higher-level combinators and constructs and help us derive more complicated compositional adaptives. We also show an important specialization of ABP is in support of reinforcement learning constructs, which optimize adaptive values based on a programmer-specified objective function. This permits ABP users to easily define adaptive values that express uncertainty anywhere in their programs. Over repeated executions, these adaptive values adjust to more efficient ones and enable the user's programs to self optimize. The design of our DSL depends significantly on the use of type classes. We will illustrate, along with presenting our DSL, how the use of type classes can support the gradual evolution of DSLs.
Impact of the Evolution of Smart Phones in Education Technology and its Application in Technical and Professional Studies: Indian Perspective
Venue: arXiv cs.CY 2011
Year: 2011

The greatness of any nation depends largely on the system of education that is used to nurture its talent from within. With the digital era taking the spotlight, and the world rapidly reforming into a global village, it is now quintessential that a spirit of healthy competitiveness be inculcated in the budding minds of this country. While trying to remodel and upgrade the education system, a key issue is that of quality of education processes in the country. Needs and expectations of the society are changing very fast and the quality of higher education requires to be sustained at the desired level. The use of internet for educational purposes has increased many folds among Indian youths. Online video lectures and e-books are the emerging trends among learners. The birth of high speed internet access and its availability on recently evolved smart phones has opened several new avenues for learning. The growing popularity of these smart phones among the youth can potentially revolutionize the way we learn. The introduction of 3G technology is already being pinned as the next big thing in the mobile internet revolution. This paper discusses the use of Smart Phones in Education Technology and its application in Technical & Professional studies in India. We intend to put forward some challenges and advices.
On quantum interactive proofs with short messages
Venue: arXiv cs.CC 2011
Year: 2011

This paper proves one of the open problem posed by Beigi et al. in arXiv:1004.0411v2. We consider quantum interactive proof systems where in the beginning the verifier and prover send messages to each other with the combined length of all messages being at most logarithmic (in the input length); and at the end the prover sends a polynomial-length message to the verifier. We show that this class has the same expressive power as QMA.
X-Vine: Secure and Pseudonymous Routing Using Social Networks
Venue: arXiv cs.CR 2011
Year: 2011

Distributed hash tables suffer from several security and privacy vulnerabilities, including the problem of Sybil attacks. Existing social network-based solutions to mitigate the Sybil attacks in DHT routing have a high state requirement and do not provide an adequate level of privacy. For instance, such techniques require a user to reveal their social network contacts. We design X-Vine, a protection mechanism for distributed hash tables that operates entirely by communicating over social network links. As with traditional peer-to-peer systems, X-Vine provides robustness, scalability, and a platform for innovation. The use of social network links for communication helps protect participant privacy and adds a new dimension of trust absent from previous designs. X-Vine is resilient to denial of service via Sybil attacks, and in fact is the first Sybil defense that requires only a logarithmic amount of state per node, making it suitable for large-scale and dynamic settings. X-Vine also helps protect the privacy of users social network contacts and keeps their IP addresses hidden from those outside of their social circle, providing a basis for pseudonymous communication. We first evaluate our design with analysis and simulations, using several real world large-scale social networking topologies. We show that the constraints of X-Vine allow the insertion of only a logarithmic number of Sybil identities per attack edge; we show this mitigates the impact of malicious attacks while not affecting the performance of honest nodes. Moreover, our algorithms are efficient, maintain low stretch, and avoid hot spots in the network. We validate our design with a PlanetLab implementation and a Facebook plugin.
On the Linear Precoder Design for MIMO Channels with Finite-Alphabet Inputs and Statistical CSI
Venue: arXiv cs.IT 2011
Year: 2011

This paper investigates the linear precoder design that maximizes the average mutual information of multiple-input multiple-output channels with finite-alphabet inputs and statistical channel state information known at the transmitter. This linear precoder design is an important open problem and is extremely difficult to solve: First, average mutual information lacks closed-form expression and involves complicated computations; Second, the optimization problem over precoder is nonconcave. This study explores the solution to this problem and provides the following contributions: 1) A closed-form lower bound of average mutual information is derived. It achieves asymptotic optimality at low and high signal-to-noise ratio regions and, with a constant shift, offers an accurate approximation to the average mutual information; 2) The optimal structure of the precoder is revealed, and a unified two-step iterative algorithm is proposed to solve this problem. Numerical examples show the convergence and the efficacy of the proposed algorithm. Compared to its conventional counterparts, the proposed linear precoding method provides a significant performance gain.
C-Rank: A Link-based Similarity Measure for Scientific Literature Databases
Venue: arXiv cs.DL 2011
Year: 2011

As the number of people who use scientific literature databases grows, the demand for literature retrieval services has been steadily increased. One of the most popular retrieval services is to find a set of papers similar to the paper under consideration, which requires a measure that computes similarities between papers. Scientific literature databases exhibit two interesting characteristics that are different from general databases. First, the papers cited by old papers are often not included in the database due to technical and economic reasons. Second, since a paper references the papers published before it, few papers cite recently-published papers. These two characteristics cause all existing similarity measures to fail in at least one of the following cases: (1) measuring the similarity between old, but similar papers, (2) measuring the similarity between recent, but similar papers, and (3) measuring the similarity between two similar papers: one old, the other recent. In this paper, we propose a new link-based similarity measure called C-Rank, which uses both in-link and out-link by disregarding the direction of references. In addition, we discuss the most suitable normalization method for scientific literature databases and propose an evaluation method for measuring the accuracy of similarity measures. We have used a database with real-world papers from DBLP and their reference information crawled from Libra for experiments and compared the performance of C-Rank with those of existing similarity measures. Experimental results show that C-Rank achieves a higher accuracy than existing similarity measures.
A Framework for Business Intelligence Application using Ontological Classification
Venue: arXiv cs.IR 2011
Year: 2011

Every business needs knowledge about their competitors to survive better. One of the information repositories is web. Retrieving Specific information from the web is challenging. An Ontological model is developed to capture specific information by using web semantics. From the Ontology model, the relations between the data are mined using decision tree. From all these a new framework is developed for Business Intelligence.
A New Vectorization Technique for Expression Templates in C++
Venue: arXiv cs.MS 2011
Year: 2011

Vector operations play an important role in high performance computing and are typically provided by highly optimized libraries that implement the BLAS (Basic Linear Algebra Subprograms) interface. In C++ templates and operator overloading allow the implementation of these vector operations as expression templates which construct custom loops at compile time and providing a more abstract interface. Unfortunately existing expression template libraries lack the performance of fast BLAS(Basic Linear Algebra Subprograms) implementations. This paper presents a new approach - Statically Accelerated Loop Templates (SALT) - to close this performance gap by combining expression templates with an aggressive loop unrolling technique. Benchmarks were conducted using the Intel C++ compiler and GNU Compiler Collection to assess the performance of our library relative to Intel's Math Kernel Library as well as the Eigen template library. The results show that the approach is able to provide optimization comparable to the fastest available BLAS implementations, while retaining the convenience and flexibility of a template library.
Application of the Modified 2-opt and Jumping Gene Operators in Multi-Objective Genetic Algorithm to solve MOTSP
Venue: arXiv cs.AI 2011
Year: 2011

Evolutionary Multi-Objective Optimization is becoming a hot research area and quite a few papers regarding these algorithms have been published. However the role of local search techniques has not been expanded adequately. This paper studies the role of a local search technique called 2-opt for the Multi-Objective Travelling Salesman Problem (MOTSP). A new mutation operator called Jumping Gene (JG) is also used. Since 2-opt operator was intended for the single objective TSP, its domain has been expanded to MOTSP in this paper. This new technique is applied to the list of KroAB100 cities.
Representation for alphanumeric data type based on space and speed case study: Student ID of X university
Venue: arXiv cs.DB 2011
Year: 2011

ID is derived from the word identity, derived from the first two characters in the word. ID is used to distinguish between an entity to another entity. Student ID (SID) is the key differentiator between a student with other students. On the concept of database, the differentiator is unique. SID can be numbers, letters, or a combination of both (alphanumeric). Viewed from the daily context, it is not important to determine which a SID belongs to the type of data. However, when reviewed on database design, determining the type of data, including SID in this case, is important. Problems arise because there is a contradiction between the data type viewed from the data characteristic and practical needs. Type of data for SID is a string, if it is evaluated from the basic concepts and its characteristic. It is acceptable because SID consists of a set of numbers which will not be meaningful if applied arithmetic operations like addition, subtraction, multiplication and division. But in terms of computer organization, data representation type will determine how much data space requirements, speed of access, and speed of operation. By considering the constraints of space and speed on the experiments conducted, SID is better expressed as an integer rather than a set of characters. KEYWORDS aphanumeric,representation, string, integer, space, speed
A Prototype System for Controlling a Computer by Head Movements and Voice Commands
Venue: arXiv cs.HC 2011
Year: 2011

This paper introduces a new prototype system for controlling a PC by head movements and also with voice commands. Our system is a multimodal interface concerned with controlling the computer. The selected modes of interaction are speech and gestures. We are seeing the revolutionary of computers and information technologies into daily practice. Healthy people use keyboard, mouse, trackball, or touchpad for controlling the PC. However these peripheries are usually not suitable for handicapped people. They may have problems using these standard peripheries, for example when they suffer from myopathy, or cannot move their hands after an injury. Our system has been developed to provide computer access for people with severe disabilities. This system tracks the computer user's Head movements with a video camera and translates them into the movements of the mouse pointer on the screen and the voice as button presses. Therefore we are coming with a proposal system that can be used with handicapped people to control the PC.