OpenRaiser/Intern-Atlas huggingface dataset:
Building fast Bayesian computing machines out of intentionally stochastic, digital parts
Venue: arXiv cs.AI 2014
Year: 2014

The brain interprets ambiguous sensory information faster and more reliably than modern computers, using neurons that are slower and less reliable than logic gates. But Bayesian inference, which underpins many computational models of perception and cognition, appears computationally challenging even given modern transistor speeds and energy budgets. The computational principles and structures needed to narrow this gap are unknown. Here we show how to build fast Bayesian computing machines using intentionally stochastic, digital parts, narrowing this efficiency gap by multiple orders of magnitude. We find that by connecting stochastic digital components according to simple mathematical rules, one can build massively parallel, low precision circuits that solve Bayesian inference problems and are compatible with the Poisson firing statistics of cortical neurons. We evaluate circuits for depth and motion perception, perceptual learning and causal reasoning, each performing inference over 10,000+ latent variables in real time - a 1,000x speed advantage over commodity microprocessors. These results suggest a new role for randomness in the engineering and reverse-engineering of intelligent computation.
On the Estimation of Channel State Transitions for Cognitive Radio Systems
Venue: arXiv cs.IT 2014
Year: 2014

Coexistence by means of shared access is a cognitive radio application. The secondary user models the slotted primary users channel access as a Markov process. The model parameters, i.e, the state transition probabilities (alpha,beta) help secondary user to determine the channel occupancy, thereby enables secondary user to rank the primary user channels. These parameters are unknown and need to be estimated by secondary users for each channel. To do so, the secondary users have to sense all the primary user channels in every time slot, which is unrealistic for a large and sparsely allocated primary user spectrum. With no other choice left, the secondary user has to sense a channel at random time intervals and estimate the parametric information for all the channels using the observed slots.
Interpreting social cues to generate credible affective reactions of virtual job interviewers
Venue: arXiv cs.AI 2014
Year: 2014

In this paper we describe a mechanism of generating credible affective reactions in a virtual recruiter during an interaction with a user. This is done using communicative performance computation based on the behaviours of the user as detected by a recognition module. The proposed software pipeline is part of the TARDIS system which aims to aid young job seekers in acquiring job interview related social skills. In this context, our system enables the virtual recruiter to realistically adapt and react to the user in real-time.
On Coset Leader Graphs of LDPC Codes
Venue: arXiv cs.IT 2014
Year: 2014

Our main technical result is that, in the coset leader graph of a linear binary code of block length n, the metric balls spanned by constant-weight vectors grow exponentially slower than those in $\{0,1\}^n$. Following the approach of Friedman and Tillich (2006), we use this fact to improve on the first linear programming bound on the rate of LDPC codes, as the function of their minimal distance. This improvement, combined with the techniques of Ben-Haim and Lytsin (2006), improves the rate vs distance bounds for LDPC codes in a significant sub-range of relative distances.
Challenges in Selecting Software to be Reused
Venue: arXiv cs.SE 2014
Year: 2014

This is a position paper for Sharing, Re-Use and Circulation of Resources in Cooperative Scientific Work, a CSCW'14 workshop. It discusses the role of software in NSF's CIF21 vision and the SI2 program, which is intended to support that goal. SI2 primarily supports software projects that are proposed in response to solicitations, and some of the criteria used by the peer-reviewers and by NSF in evaluating these projects depend on predicting scientific impact. This paper discusses some ideas on how the prediction of scientific impact can be improved.
Axiomatic Approach to Solutions of Games
Venue: arXiv cs.GT 2014
Year: 2014

We consider solutions of normal form games that are invariant under strategic equivalence. We consider additional properties that can be expected (or be desired) from a solution of a game, and we observe the following: - Even the weakest notion of individual rationality restricts the set of solutions to be equilibria. This observation holds for all types of solutions: in pure-strategies, in mixed strategies, and in correlated strategies where the corresponding notions of equilibria are pure-Nash, Nash and coarse-correlated. An action profile is (strict) simultaneous maximizer if it simultaneously globally (strictly) maximizes the payoffs of all players. - If we require that a simultaneous maximizer (if it exists) will be a solution, then the solution contains the set of pure Nash equilibria. - There is no solution for which a strict simultaneous maximizer (if it exists) is the unique solution.
Coalitional Games in MISO Interference Channels: Epsilon-Core and Coalition Structure Stable Set
Venue: arXiv cs.IT 2014
Year: 2014

The multiple-input single-output interference channel is considered. Each transmitter is assumed to know the channels between itself and all receivers perfectly and the receivers are assumed to treat interference as additive noise. In this setting, noncooperative transmission does not take into account the interference generated at other receivers which generally leads to inefficient performance of the links. To improve this situation, we study cooperation between the links using coalitional games. The players (links) in a coalition either perform zero forcing transmission or Wiener filter precoding to each other. The $ε$-core is a solution concept for coalitional games which takes into account the overhead required in coalition deviation. We provide necessary and sufficient conditions for the strong and weak $ε$-core of our coalitional game not to be empty with zero forcing transmission. Since, the $ε$-core only considers the possibility of joint cooperation of all links, we study coalitional games in partition form in which several distinct coalitions can form. We propose a polynomial time distributed coalition formation algorithm based on coalition merging and prove that its solution lies in the coalition structure stable set of our coalition formation game. Simulation results reveal the cooperation gains for different coalition formation complexities and deviation overhead models.
Simulation-Based Risk Reduction for Planning Inspections
Venue: arXiv cs.SE 2014
Year: 2014

Organizations that develop software have recognized that software process models are particularly useful for maintaining a high standard of quality. In the last decade, simulations of software processes were used in several settings and environments. This paper gives a short overview of the benefits of software process simulation and describes the development of a discrete-event model, a technique rarely used before in that field. The model introduced in this paper captures the behavior of a detailed code inspection process. It aims at reducing the risks inherent in implementing inspection processes and techniques in the overall development process. The determination of the underlying cause-effect relations using data mining techniques and empirical data is explained. Finally, the paper gives an outlook on our future work.
Strategic Resource Allocation for Competitive Influence in Social Networks
Venue: arXiv cs.SI 2014
Year: 2014

One of the main objectives of data mining is to help companies determine to which potential customers to market and how many resources to allocate to these potential customers. Most previous works on competitive influence in social networks focus on the first issue. In this work, our focus is on the second issue, i.e., we are interested on the competitive influence of marketing campaigns who need to simultaneously decide how many resources to allocate to their potential customers to advertise their products. Using results from game theory, we are able to completely characterize the optimal strategic resource allocation for the voter model of social networks and prove that the price of competition of this game is unbounded. This work is a step towards providing a solid foundation for marketing advertising in more general scenarios.
Preliminary Studies on Force/Motion Control of Intelligent Mechanical Systems
Venue: arXiv cs.RO 2014
Year: 2014

To rationalize the relatively high investment that industrial automation systems entail, research in the field of intelligent machines should target high value functions such as fettling, die-finishing, deburring, and fixtureless manufacturing. For achieving this goal, past work has concentrated on force control algorithms at the system level with limited focus on performance expansion at the actuator level. We present a comprehensive literature review on robot force control, including algorithms, specialized actuators, and robot control software. A robot force control testbed was developed using Schunk's PowerCube 6-DOF Arm and a six-axis ATI force/torque sensor. Using parameter identification experiments, manipulator module inertias and the motor torque constant were estimated. Experiments were conducted to study the practical issues involved in implementing stable contact transitions and programmable endpoint impedance. Applications to human augmentation, virtual fixtures, and teleoperation are discussed. These experiments are used as a vehicle to understand the performance improvement achievable at the actuator level. The approach at UTRRG has been to maximize the choices within the actuator to enhance its intelligence. Drawing on this 20-year research history in electromechanical actuator architecture, we propose a new concept that mixes two inputs, distinct in their velocity ratios, within the same dual actuator called a Force/Motion Actuator (FMA). Detailed kinematic and dynamic models of this dual actuator are developed. The actuator performance is evaluated using simulations with an output velocity specification and resolving input trajectories using a minimum-norm solution. It is shown that a design choice of 14:1 motion scaling between the two inputs results in good sensitivity to output force disturbances without compromising velocity tracking performance.
Cache-Oblivious Persistence
Venue: arXiv cs.DS 2014
Year: 2014

Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy.We present the first general transformation for making cache-oblivious model data structures partially persistent.
Distributed Compressed Wideband Sensing in Cognitive Radio Sensor Networks
Venue: arXiv cs.NI 2014
Year: 2014

A novel distributed compressed wideband sensing scheme for Cognitive Radio Sensor Networks (CRSN) is proposed in this paper. Taking advantage of the distributive nature of CRSN, the proposed scheme deploys only one single narrowband sampler with ultra-low sampling rate at each nodes to accomplish the wideband spectrum sensing. First, the practical structure of the compressed sampler at each node is described in detail. Second, we show how the Fusion Center (FC) exploits the sampled signals with their spectrum randomly-aliased to detect the global wideband spectrum activity. Finally, the proposed scheme is validated through extensive simulations, which shows that it is particularly suitable for CRSN.
Web Service Composition - BPEL vs cCSP Process Algebra
Venue: arXiv cs.SE 2014
Year: 2014

Web services technology provides a platform on which we can develop distributed services. The interoperability among these services is achieved by various standard protocols. In recent years, several researches suggested that process algebras provide a satisfactory assistance to the whole process of web services development. Business transactions, on the other hand, involve the coordination and interaction between multiple partners. With the emergence of web services, business transactions are conducted using these services. The coordination among the business processes is crucial, so is the handling of faults that can arise at any stage of a transaction. BPEL models the behavior of business process interaction by providing a XML based grammar to describe the control logic required to coordinate the web services participating in a process flow. However BPEL lacks a proper formal description where the composition of business processes cannot be formally verified. Process algebra, on the other hand, facilitates a formal foundation for rigorous verification of the composition. This paper presents a comparison of web service composition between BPEL and process algebra, cCSP.
Three-Dimensional Integrated Guidance and Control Based on Small-Gain Theorem
Venue: arXiv cs.SY 2014
Year: 2014

A three-dimensional (3D) integrated guidance and control (IGC) design approach is proposed by using small-gain theorem in this paper. The 3D IGC model is formulated by combining nonlinear pursuer dynamics with the nonlinear dynamics describing pursuitevasion motion. Small-gain theorem and ISS theory are iteratively utilized to design desired attack angle, sideslip angle and attitude angular rates (virtual controls), and eventually an IGC law is proposed. Theoretical analysis shows that the IGC approach can make the LOS rate converge into a small neighborhood of zero, and the stability of the overall system can be guaranteed as well.
A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling Problem
Venue: arXiv cs.DS 2014
Year: 2014

We present an algorithm that incorporates a tabu search procedure into the framework of path relinking to tackle the job shop scheduling problem (JSP). This tabu search/path relinking (TS/PR) algorithm comprises several distinguishing features, such as a specific relinking procedure and a reference solution determination method. To test the performance of TS/PR, we apply it to tackle almost all of the benchmark JSP instances available in the literature. The test results show that TS/PR obtains competitive results compared with state-of-the-art algorithms for JSP in the literature, demonstrating its efficacy in terms of both solution quality and computational efficiency. In particular, TS/PR is able to improve the upper bounds for 49 out of the 205 tested instances and it solves a challenging instance that has remained unsolved for over 20 years.
Control Loop Feedback Mechanism for Generic Array Logic Chip Multiprocessor
Venue: arXiv cs.OH 2014
Year: 2014

Control Loop Feedback Mechanism for Generic Array Logic Chip Multiprocessor is presented. The approach is based on control-loop feedback mechanism to maximize the efficiency on exploiting available resources such as CPU time, operating frequency, etc. Each Processing Element (PE) in the architecture is equipped with a frequency scaling module responsible for tuning the frequency of processors at run-time according to the application requirements. We show that generic array logic Chip Multiprocessors with large inter-processor First In First Outputs (First In First Outs) buffers can inherently hide much of the Generic Array Logic performance penalty while executing applications that have been mapped with few communication loops. In fact, the penalty can be driven to zero with sufficiently large First In First Outs and the removal of multiple-loop communication links. We present an example mesh-connected Generic Array Logic chip multiprocessor and show it has a less than 1% performance (throughput) reduction on average compared to the corresponding synchronous system for many DSP workloads. Furthermore, adaptive clock and voltage scaling for each processor provides an approximately 40% power savings without any performance reduction.
Localization of License Plate Using Morphological Operations
Venue: arXiv cs.CV 2014
Year: 2014

It is believed that there are currently millions of vehicles on the roads worldwide. The over speed of vehicles,theft of vehicles, disobeying traffic rules in public, an unauthorized person entering the restricted area are keep on increasing. In order restrict against these criminal activities, we need an automatic public security system. Each vehicle has their own Vehicle Identification Number (VIN) as their primary identifier. The VIN is actually a License Number which states a legal license to participate in the public traffic. The proposed paper is to identify the vehicle with the help of vehicles License Plate (LP).LPRS is one the most important part of the Intelligent Transportation System (ITS) to locate the LP. In this paper certain existing algorithm drawbacks are overcome by the proposed morphological operations for LPRS. Morphological operation is chosen due to its higher efficiency, noise filter capacity, accuracy, exact localization of LP and speed.
Decentralized Rendezvous of Nonholonomic Robots with Sensing and Connectivity Constraints
Venue: arXiv cs.SY 2014
Year: 2014

A group of wheeled robots with nonholonomic constraints is considered to rendezvous at a common specified setpoint with a desired orientation while maintaining network connectivity and ensuring collision avoidance within the robots. Given communication and sensing constraints for each robot, only a subset of the robots are aware or informed of the global destination, and the remaining robots must move within the network connectivity constraint so that the informed robots can guide the group to the goal. The mobile robots are also required to avoid collisions with each other outside a neighborhood of the common rendezvous point. To achieve the rendezvous control objective, decentralized time-varying controllers are developed based on a navigation function framework to steer the robots to perform rendezvous while preserving network connectivity and ensuring collision avoidance. Only local sensing feedback, which includes position feedback from immediate neighbors and absolute orientation measurement, is used to navigate the robots and enables radio silence during navigation. Simulation results demonstrate the performance of the developed approach.
A Parametric Chain based Routing Approach for Underwater Sensor Network
Venue: arXiv cs.NI 2014
Year: 2014

A sensor network is one of the critical networks that is based on hardware components as well the energy parameters. Because of this, such network requires the optimization in all kind communication to improve the network life. In case of underwater sensor network, the criticality of network is also increased because of the random floating movement of the nodes. In this work, a composition of the multicast or broadcast communication is presented by the generation of aggregative path. The presented work is about to define a new chain based aggregative routing approach to provide the effective communication over the network. In this work, an effective aggregative path is suggested under the different parameters of energy, distance and congestion analysis. Based on these parameters a trustful aggregative route will be generated so that the network life will be improved.
Asynchronous $l$-Complete Approximations
Venue: arXiv cs.SY 2014
Year: 2014

This paper extends the $l$-complete approximation method developed for time invariant systems to a larger system class, ensuring that the resulting approximation can be realized by a finite state machine. To derive the new abstraction method, called asynchronous $l$-complete approximation, an asynchronous version of the well-known concepts of state property, memory span and $l$-completeness is introduced, extending the behavioral systems theory in a consistent way.
Designing Reusable Systems that Can Handle Change - Description-Driven Systems : Revisiting Object-Oriented Principles
Venue: arXiv cs.SE 2014
Year: 2014

In the age of the Cloud and so-called Big Data systems must be increasingly flexible, reconfigurable and adaptable to change in addition to being developed rapidly. As a consequence, designing systems to cater for evolution is becoming critical to their success. To be able to cope with change, systems must have the capability of reuse and the ability to adapt as and when necessary to changes in requirements. Allowing systems to be self-describing is one way to facilitate this. To address the issues of reuse in designing evolvable systems, this paper proposes a so-called description-driven approach to systems design. This approach enables new versions of data structures and processes to be created alongside the old, thereby providing a history of changes to the underlying data models and enabling the capture of provenance data. The efficacy of the description-driven approach is exemplified by the CRISTAL project. CRISTAL is based on description-driven design principles; it uses versions of stored descriptions to define various versions of data which can be stored in diverse forms. This paper discusses the need for capturing holistic system description when modelling large-scale distributed systems.
Model Driven Engineering for Science Gateways
Venue: arXiv cs.SE 2014
Year: 2014

From n-Tier client/server applications, to more complex academic Grids, or even the most recent and promising industrial Clouds, the last decade has witnessed significant developments in distributed computing. In spite of this conceptual heterogeneity, Service-Oriented Architectures (SOA) seem to have emerged as the common underlying abstraction paradigm. Suitable access to data and applications resident in SOAs via so-called Science Gateways has thus become a pressing need in various fields of science, in order to realize the benefits of Grid and Cloud infrastructures. In this context, authors have consolidated work from three complementary experiences in European projects, which have developed and deployed large-scale production quality infrastructures as Science Gateways to support research in breast cancer, paediatric diseases and neurodegenerative pathologies respectively. In analysing the requirements from these biomedical applications the authors were able to elaborate on commonly faced Grid development issues, while proposing an adaptable and extensible engineering framework for Science Gateways. This paper thus proposes the application of an architecture-centric Model-Driven Engineering (MDE) approach to service-oriented developments, making it possible to define Science Gateways that satisfy quality of service requirements, execution platform and distribution criteria at design time. An novel investigation is presented on the applicability of the resulting grid MDE (gMDE) to specific examples, and conclusions are drawn on the benefits of this approach and its possible application to other areas, in particular that of Distributed Computing Infrastructures (DCI) interoperability.
Fractional programming formulation for the vertex coloring problem
Venue: arXiv cs.DS 2014
Year: 2014

We devise a new formulation for the vertex coloring problem. Different from other formulations, decision variables are associated with the pairs of vertices. Consequently, colors will be distinguishable. Although the objective function is fractional, it can be replaced by a piece-wise linear convex function. Numerical experiments show that our formulation has significantly good performance for dense graphs.