OpenRaiser/Intern-Atlas huggingface dataset:
Hybrid Crossbar Architecture for a Memristor Based Memory
Venue: arXiv cs.AR 2013
Year: 2013

This paper describes a new memristor crossbar architecture that is proposed for use in a high density cache design. This design has less than 10% of the write energy consumption than a simple memristor crossbar. Also, it has up to 4 times the bit density of an STT-MRAM system and up to 11 times the bit density of an SRAM architecture. The proposed architecture is analyzed using a detailed SPICE analysis that accounts for the resistance of the wires in the memristor structure. Additionally, the memristor model used in this work has been matched to specific device characterization data to provide accurate results in terms of energy, area, and timing.
Sparse Frequency Analysis with Sparse-Derivative Instantaneous Amplitude and Phase Functions
Venue: arXiv cs.LG 2013
Year: 2013

This paper addresses the problem of expressing a signal as a sum of frequency components (sinusoids) wherein each sinusoid may exhibit abrupt changes in its amplitude and/or phase. The Fourier transform of a narrow-band signal, with a discontinuous amplitude and/or phase function, exhibits spectral and temporal spreading. The proposed method aims to avoid such spreading by explicitly modeling the signal of interest as a sum of sinusoids with time-varying amplitudes. So as to accommodate abrupt changes, it is further assumed that the amplitude/phase functions are approximately piecewise constant (i.e., their time-derivatives are sparse). The proposed method is based on a convex variational (optimization) approach wherein the total variation (TV) of the amplitude functions are regularized subject to a perfect (or approximate) reconstruction constraint. A computationally efficient algorithm is derived based on convex optimization techniques. The proposed technique can be used to perform band-pass filtering that is relatively insensitive to narrow-band amplitude/phase jumps present in data, which normally pose a challenge (due to transients, leakage, etc.). The method is illustrated using both synthetic signals and human EEG data for the purpose of band-pass filtering and the estimation of phase synchrony indexes.
Secure Degrees of Freedom of the Gaussian Wiretap Channel with Helpers and No Eavesdropper CSI: Blind Cooperative Jamming
Venue: arXiv cs.IT 2013
Year: 2013

We consider the Gaussian wiretap channel with M helpers, where no eavesdropper channel state information (CSI) is available at the legitimate entities. The exact secure d.o.f. of the Gaussian wiretap channel with M helpers with perfect CSI at the transmitters was found in [1], [2] to be M/(M+1). One of the key ingredients of the optimal achievable scheme in [1], [2] is to align cooperative jamming signals with the information symbols at the eavesdropper to limit the information leakage rate. This required perfect eavesdropper CSI at the transmitters. Motivated by the recent result in [3], we propose a new achievable scheme in which cooperative jamming signals span the entire space of the eavesdropper, but are not exactly aligned with the information symbols. We show that this scheme achieves the same secure d.o.f. of M/(M+1) in [1], [2] but does not require any eavesdropper CSI; the transmitters blindly cooperative jam the eavesdropper.
Large Scale Real-time Ridesharing with Service Guarantee on Road Networks
Venue: arXiv cs.DS 2013
Year: 2013

The mean occupancy rates of personal vehicle trips in the United States is only 1.6 persons per vehicle mile. Urban traffic gridlock is a familiar scene. Ridesharing has the potential to solve many environmental, congestion, and energy problems. In this paper, we introduce the problem of large scale real-time ridesharing with service guarantee on road networks. Servers and trip requests are dynamically matched while waiting time and service time constraints of trips are satisfied. We first propose two basic algorithms: a branch-and-bound algorithm and an integer programing algorithm. However, these algorithm structures do not adapt well to the dynamic nature of the ridesharing problem. Thus, we then propose a kinetic tree algorithm capable of better scheduling dynamic requests and adjusting routes on-the-fly. We perform experiments on a large real taxi dataset from Shanghai. The results show that the kinetic tree algorithm is faster than other algorithms in response time.
Modus Ponens Generating Function in the Class of ^-valuations of Plausibility
Venue: arXiv cs.AI 2013
Year: 2013

We discuss the problem of construction of inference procedures which can manipulate with uncertainties measured in ordinal scales and fulfill to the property of strict monotonicity of conclusion. The class of A-valuations of plausibility is considered where operations based only on information about linear ordering of plausibility values are used. In this class the modus ponens generating function fulfiling to the property of strict monotonicity of conclusions is introduced.
Learning in Multi-level Stochastic games with Delayed Information
Venue: arXiv cs.GT 2013
Year: 2013

Distributed decision-makers are modeled as players in a game with two levels. High level decisions concern the game environment and determine the willingness of the players to form a coalition (or group). Low level decisions involve the actions to be implemented within the chosen environment. Coalition and action strategies are determined by probability distributions, which are updated using learning automata schemes. The payoffs are also probabilistic and there is uncertainty in the state vector since information is delayed. The goal is to reach equilibrium in both levels of decision making; the results show the conditions for instability, based on the age of information.
Symbolic Probabilitistic Inference in Large BN2O Networks
Venue: arXiv cs.AI 2013
Year: 2013

A BN2O network is a two level belief net in which the parent interactions are modeled using the noisy-or interaction model. In this paper we discuss application of the SPI local expression language to efficient inference in large BN2O networks. In particular, we show that there is significant structure, which can be exploited to improve over the Quickscore result. We further describe how symbolic techniques can provide information which can significantly reduce the computation required for computing all cause posterior marginals. Finally, we present a novel approximation technique with preliminary experimental results.
Action Networks: A Framework for Reasoning about Actions and Change under Uncertainty
Venue: arXiv cs.AI 2013
Year: 2013

This work proposes action networks as a semantically well-founded framework for reasoning about actions and change under uncertainty. Action networks add two primitives to probabilistic causal networks: controllable variables and persistent variables. Controllable variables allow the representation of actions as directly setting the value of specific events in the domain, subject to preconditions. Persistent variables provide a canonical model of persistence according to which both the state of a variable and the causal mechanism dictating its value persist over time unless intervened upon by an action (or its consequences). Action networks also allow different methods for quantifying the uncertainty in causal relationships, which go beyond traditional probabilistic quantification. This paper describes both recent results and work in progress.
On the Relation between Kappa Calculus and Probabilistic Reasoning
Venue: arXiv cs.AI 2013
Year: 2013

We study the connection between kappa calculus and probabilistic reasoning in diagnosis applications. Specifically, we abstract a probabilistic belief network for diagnosing faults into a kappa network and compare the ordering of faults computed using both methods. We show that, at least for the example examined, the ordering of faults coincide as long as all the causal relations in the original probabilistic network are taken into account. We also provide a formal analysis of some network structures where the two methods will differ. Both kappa rankings and infinitesimal probabilities have been used extensively to study default reasoning and belief revision. But little has been done on utilizing their connection as outlined above. This is partly because the relation between kappa and probability calculi assumes that probabilities are arbitrarily close to one (or zero). The experiments in this paper investigate this relation when this assumption is not satisfied. The reported results have important implications on the use of kappa rankings to enhance the knowledge engineering of uncertainty models.
Integrating Planning and Execution in Stochastic Domains
Venue: arXiv cs.AI 2013
Year: 2013

We investigate planning in time-critical domains represented as Markov Decision Processes, showing that search based techniques can be a very powerful method for finding close to optimal plans. To reduce the computational cost of planning in these domains, we execute actions as we construct the plan, and sacrifice optimality by searching to a fixed depth and using a heuristic function to estimate the value of states. Although this paper concentrates on the search algorithm, we also discuss ways of constructing heuristic functions suitable for this approach. Our results show that by interleaving search and execution, close to optimal policies can be found without the computational requirements of other approaches.
Conditional Independence in Possibility Theory
Venue: arXiv cs.AI 2013
Year: 2013

Possibilistic conditional independence is investigated: we propose a definition of this notion similar to the one used in probability theory. The links between independence and non-interactivity are investigated, and properties of these relations are given. The influence of the conjunction used to define a conditional measure of possibility is also highlighted: we examine three types of conjunctions: Lukasiewicz - like T-norms, product-like T-norms and the minimum operator.
Epsilon-Safe Planning
Venue: arXiv cs.AI 2013
Year: 2013

We introduce an approach to high-level conditional planning we call epsilon-safe planning. This probabilistic approach commits us to planning to meet some specified goal with a probability of success of at least 1-epsilon for some user-supplied epsilon. We describe several algorithms for epsilon-safe planning based on conditional planners. The two conditional planners we discuss are Peot and Smith's nonlinear conditional planner, CNLP, and our own linear conditional planner, PLINTH. We present a straightforward extension to conditional planners for which computing the necessary probabilities is simple, employing a commonly-made but perhaps overly-strong independence assumption. We also discuss a second approach to epsilon-safe planning which relaxes this independence assumption, involving the incremental construction of a probability dependence model in conjunction with the construction of the plan graph.
Generating Bayesian Networks from Probability Logic Knowledge Bases
Venue: arXiv cs.AI 2013
Year: 2013

We present a method for dynamically generating Bayesian networks from knowledge bases consisting of first-order probability logic sentences. We present a subset of probability logic sufficient for representing the class of Bayesian networks with discrete-valued nodes. We impose constraints on the form of the sentences that guarantee that the knowledge base contains all the probabilistic information necessary to generate a network. We define the concept of d-separation for knowledge bases and prove that a knowledge base with independence conditions defined by d-separation is a complete specification of a probability distribution. We present a network generation algorithm that, given an inference problem in the form of a query Q and a set of evidence E, generates a network to compute P(Q|E). We prove the algorithm to be correct.
Probabilistic Description Logics
Venue: arXiv cs.AI 2013
Year: 2013

On the one hand, classical terminological knowledge representation excludes the possibility of handling uncertain concept descriptions involving, e.g., "usually true" concept properties, generalized quantifiers, or exceptions. On the other hand, purely numerical approaches for handling uncertainty in general are unable to consider terminological knowledge. This paper presents the language ACP which is a probabilistic extension of terminological logics and aims at closing the gap between the two areas of research. We present the formal semantics underlying the language ALUP and introduce the probabilistic formalism that is based on classes of probabilities and is realized by means of probabilistic constraints. Besides inferring implicitly existent probabilistic relationships, the constraints guarantee terminological and probabilistic consistency. Altogether, the new language ALUP applies to domains where both term descriptions and uncertainty have to be handled.
Possibilistic Conditioning and Propagation
Venue: arXiv cs.AI 2013
Year: 2013

We give an axiomatization of confidence transfer - a known conditioning scheme - from the perspective of expectation-based inference in the sense of Gardenfors and Makinson. Then, we use the notion of belief independence to "filter out" different proposal s of possibilistic conditioning rules, all are variations of confidence transfer. Among the three rules that we consider, only Dempster's rule of conditioning passes the test of supporting the notion of belief independence. With the use of this conditioning rule, we then show that we can use local computation for computing desired conditional marginal possibilities of the joint possibility satisfying the given constraints. It turns out that our local computation scheme is already proposed by Shenoy. However, our intuitions are completely different from that of Shenoy. While Shenoy just defines a local computation scheme that fits his framework of valuation-based systems, we derive that local computation scheme from II(,8) = tI(,8 I a) * II(a) and appropriate independence assumptions, just like how the Bayesians derive their local computation scheme.
Knowledge Engineering for Large Belief Networks
Venue: arXiv cs.AI 2013
Year: 2013

We present several techniques for knowledge engineering of large belief networks (BNs) based on the our experiences with a network derived from a large medical knowledge base. The noisyMAX, a generalization of the noisy-OR gate, is used to model causal in dependence in a BN with multi-valued variables. We describe the use of leak probabilities to enforce the closed-world assumption in our model. We present Netview, a visualization tool based on causal independence and the use of leak probabilities. The Netview software allows knowledge engineers to dynamically view sub-networks for knowledge engineering, and it provides version control for editing a BN. Netview generates sub-networks in which leak probabilities are dynamically updated to reflect the missing portions of the network.
Belief Maintenance in Bayesian Networks
Venue: arXiv cs.AI 2013
Year: 2013

Bayesian Belief Networks (BBNs) are a powerful formalism for reasoning under uncertainty but bear some severe limitations: they require a large amount of information before any reasoning process can start, they have limited contradiction handling capabilities, and their ability to provide explanations for their conclusion is still controversial. There exists a class of reasoning systems, called Truth Maintenance Systems (TMSs), which are able to deal with partially specified knowledge, to provide well-founded explanation for their conclusions, and to detect and handle contradictions. TMSs incorporating measure of uncertainty are called Belief Maintenance Systems (BMSs). This paper describes how a BMS based on probabilistic logic can be applied to BBNs, thus introducing a new class of BBNs, called Ignorant Belief Networks, able to incrementally deal with partially specified conditional dependencies, to provide explanations, and to detect and handle contradictions.
A Defect in Dempster-Shafer Theory
Venue: arXiv cs.AI 2013
Year: 2013

By analyzing the relationships among chance, weight of evidence and degree of beliefwe show that the assertion "probability functions are special cases of belief functions" and the assertion "Dempster's rule can be used to combine belief functions based on distinct bodies of evidence" together lead to an inconsistency in Dempster-Shafer theory. To solve this problem, we must reject some fundamental postulates of the theory. We introduce a new approach for uncertainty management that shares many intuitive ideas with D-S theory, while avoiding this problem.
State-space Abstraction for Anytime Evaluation of Probabilistic Networks
Venue: arXiv cs.AI 2013
Year: 2013

One important factor determining the computational complexity of evaluating a probabilistic network is the cardinality of the state spaces of the nodes. By varying the granularity of the state spaces, one can trade off accuracy in the result for computational efficiency. We present an anytime procedure for approximate evaluation of probabilistic networks based on this idea. On application to some simple networks, the procedure exhibits a smooth improvement in approximation quality as computation time increases. This suggests that state-space abstraction is one more useful control parameter for designing real-time probabilistic reasoners.
Evidential Reasoning with Conditional Belief Functions
Venue: arXiv cs.AI 2013
Year: 2013

In the existing evidential networks with belief functions, the relations among the variables are always represented by joint belief functions on the product space of the involved variables. In this paper, we use conditional belief functions to represent such relations in the network and show some relations of these two kinds of representations. We also present a propagation algorithm for such networks. By analyzing the properties of some special evidential networks with conditional belief functions, we show that the reasoning process can be simplified in such kinds of networks.
Numerical analysis of topological characteristics of three-dimensional geological models of oil and gas fields
Venue: arXiv cs.CG 2013
Year: 2013

We discuss the study of topological characteristics of random fields that are used for numerical simulation of oil and gas reservoirs and numerical algorithms (see arXiv:1302.3669), for computing such characteristics, for which we demonstrate results of their applications.
The Fresh-Finger Property
Venue: arXiv cs.DS 2013
Year: 2013

The unified property roughly states that searching for an element is fast when the current access is close to a recent access. Here, "close" refers to rank distance measured among all elements stored by the dictionary. We show that distance need not be measured this way: in fact, it is only necessary to consider a small working-set of elements to measure this rank distance. This results in a data structure with access time that is an improvement upon those offered by the unified property for many query sequences.
Content Based Image Retrieval System Using NOHIS-tree
Venue: arXiv cs.IR 2013
Year: 2013

Content-based image retrieval (CBIR) has been one of the most important research areas in computer vision. It is a widely used method for searching images in huge databases. In this paper we present a CBIR system called NOHIS-Search. The system is based on the indexing technique NOHIS-tree. The two phases of the system are described and the performance of the system is illustrated with the image database ImagEval. NOHIS-Search system was compared to other two CBIR systems; the first that using PDDP indexing algorithm and the second system is that using the sequential search. Results show that NOHIS-Search system outperforms the two other systems.
Common Rate Maximization in Two-Layer Cellular Radio Systems
Venue: arXiv cs.NI 2013
Year: 2013

We address the common rate maximization problem in two-layer cellular networks where high-power and low-power base stations are colocated in the same geographical area. Interference becomes a serious problem when two or more layers are considered in the same network. For this purpose, power control in the downlink needs to be used to limit the interference and to fully exploit the benefits of additional layer deployments.We present an analytical framework to the common rate maximization problem both with and without maximum power constraints and propose a heuristic algorithm. We present simulation results for the proposed approaches in a two-layer network setup and observe a significant common rate increase compared to single-layer wireless networks.
Polyploidy and Discontinuous Heredity Effect on Evolutionary Multi-Objective Optimization
Venue: arXiv cs.NE 2013
Year: 2013

This paper examines the effect of mimicking discontinuous heredity caused by carrying more than one chromosome in some living organisms cells in Evolutionary Multi-Objective Optimization algorithms. In this representation, the phenotype may not fully reflect the genotype. By doing so we are mimicking living organisms inheritance mechanism, where traits may be silently carried for many generations to reappear later. Representations with different number of chromosomes in each solution vector are tested on different benchmark problems with high number of decision variables and objectives. A comparison with Non-Dominated Sorting Genetic Algorithm-II is done on all problems.
Parameter Identification of Induction Motor Using Modified Particle Swarm Optimization Algorithm
Venue: arXiv cs.NE 2013
Year: 2013

This paper presents a new technique for induction motor parameter identification. The proposed technique is based on a simple startup test using a standard V/F inverter. The recorded startup currents are compared to that obtained by simulation of an induction motor model. A Modified PSO optimization is used to find out the best model parameter that minimizes the sum square error between the measured and the simulated currents. The performance of the modified PSO is compared with other optimization methods including line search, conventional PSO and Genetic Algorithms. Simulation results demonstrate the ability of the proposed technique to capture the true values of the machine parameters and the superiority of the results obtained using the modified PSO over other optimization techniques.
Review of intelligent tutoring systems using bayesian approach
Venue: arXiv cs.CY 2013
Year: 2013

With advancement in computer science research on artificial intelligence and in cognitive psychology research on human learning and performance, the next generation of computer-based tutoring systems moved beyond the simple presentation of pages of text or graphics. These new intelligent tutoring systems (ITSs) called cognitive tutors; incorporated model-tracing technology which is a cognitive model of student problem solving that captures students multiple strategies and common misconceptions. Such Intelligent tutoring systems or Knowledge Based Tutoring Systems can guide learners to progress in the learning process at their best. This paper deals with the review of various Intelligent tutoring systems using Bayesian Networks and how Bayesian Networks can be used for efficient decision making.