OpenRaiser/Intern-Atlas huggingface dataset:
Inference-less Density Estimation using Copula Bayesian Networks
Venue: arXiv cs.LG 2012
Year: 2012

We consider learning continuous probabilistic graphical models in the face of missing data. For non-Gaussian models, learning the parameters and structure of such models depends on our ability to perform efficient inference, and can be prohibitive even for relatively modest domains. Recently, we introduced the Copula Bayesian Network (CBN) density model - a flexible framework that captures complex high-dimensional dependency structures while offering direct control over the univariate marginals, leading to improved generalization. In this work we show that the CBN model also offers significant computational advantages when training data is partially observed. Concretely, we leverage on the specialized form of the model to derive a computationally amenable learning objective that is a lower bound on the log-likelihood function. Importantly, our energy-like bound circumvents the need for costly inference of an auxiliary distribution, thus facilitating practical learning of highdimensional densities. We demonstrate the effectiveness of our approach for learning the structure and parameters of a CBN model for two reallife continuous domains.
Anytime Planning for Decentralized POMDPs using Expectation Maximization
Venue: arXiv cs.AI 2012
Year: 2012

Decentralized POMDPs provide an expressive framework for multi-agent sequential decision making. While fnite-horizon DECPOMDPs have enjoyed signifcant success, progress remains slow for the infnite-horizon case mainly due to the inherent complexity of optimizing stochastic controllers representing agent policies. We present a promising new class of algorithms for the infnite-horizon case, which recasts the optimization problem as inference in a mixture of DBNs. An attractive feature of this approach is the straightforward adoption of existing inference techniques in DBNs for solving DEC-POMDPs and supporting richer representations such as factored or continuous states and actions. We also derive the Expectation Maximization (EM) algorithm to optimize the joint policy represented as DBNs. Experiments on benchmark domains show that EM compares favorably against the state-of-the-art solvers.
Merging Knowledge Bases in Possibilistic Logic by Lexicographic Aggregation
Venue: arXiv cs.AI 2012
Year: 2012

Belief merging is an important but difficult problem in Artificial Intelligence, especially when sources of information are pervaded with uncertainty. Many merging operators have been proposed to deal with this problem in possibilistic logic, a weighted logic which is powerful for handling inconsistency and deal- ing with uncertainty. They often result in a possibilistic knowledge base which is a set of weighted formulas. Although possibilistic logic is inconsistency tolerant, it suers from the well-known "drowning effect". Therefore, we may still want to obtain a consistent possi- bilistic knowledge base as the result of merg- ing. In such a case, we argue that it is not always necessary to keep weighted informa- tion after merging. In this paper, we define a merging operator that maps a set of pos- sibilistic knowledge bases and a formula rep- resenting the integrity constraints to a clas- sical knowledge base by using lexicographic ordering. We show that it satisfies nine pos- tulates that generalize basic postulates for propositional merging given in [11]. These postulates capture the principle of minimal change in some sense. We then provide an algorithm for generating the resulting knowl- edge base of our merging operator. Finally, we discuss the compatibility of our merging operator with propositional merging and es- tablish the advantage of our merging opera- tor over existing semantic merging operators in the propositional case.
Bayesian Inference in Monte-Carlo Tree Search
Venue: arXiv cs.LG 2012
Year: 2012

Monte-Carlo Tree Search (MCTS) methods are drawing great interest after yielding breakthrough results in computer Go. This paper proposes a Bayesian approach to MCTS that is inspired by distributionfree approaches such as UCT [13], yet significantly differs in important respects. The Bayesian framework allows potentially much more accurate (Bayes-optimal) estimation of node values and node uncertainties from a limited number of simulation trials. We further propose propagating inference in the tree via fast analytic Gaussian approximation methods: this can make the overhead of Bayesian inference manageable in domains such as Go, while preserving high accuracy of expected-value estimates. We find substantial empirical outperformance of UCT in an idealized bandit-tree test environment, where we can obtain valuable insights by comparing with known ground truth. Additionally we rigorously prove on-policy and off-policy convergence of the proposed methods.
Bayesian Model Averaging Using the k-best Bayesian Network Structures
Venue: arXiv cs.LG 2012
Year: 2012

We study the problem of learning Bayesian network structures from data. We develop an algorithm for finding the k-best Bayesian network structures. We propose to compute the posterior probabilities of hypotheses of interest by Bayesian model averaging over the k-best Bayesian networks. We present empirical results on structural discovery over several real and synthetic data sets and show that the method outperforms the model selection method and the state of-the-art MCMC methods.
Learning Structural Changes of Gaussian Graphical Models in Controlled Experiments
Venue: arXiv cs.LG 2012
Year: 2012

Graphical models are widely used in scienti fic and engineering research to represent conditional independence structures between random variables. In many controlled experiments, environmental changes or external stimuli can often alter the conditional dependence between the random variables, and potentially produce significant structural changes in the corresponding graphical models. Therefore, it is of great importance to be able to detect such structural changes from data, so as to gain novel insights into where and how the structural changes take place and help the system adapt to the new environment. Here we report an effective learning strategy to extract structural changes in Gaussian graphical model using l1-regularization based convex optimization. We discuss the properties of the problem formulation and introduce an efficient implementation by the block coordinate descent algorithm. We demonstrate the principle of the approach on a numerical simulation experiment, and we then apply the algorithm to the modeling of gene regulatory networks under different conditions and obtain promising yet biologically plausible results.
A Convex Formulation for Learning Task Relationships in Multi-Task Learning
Venue: arXiv cs.LG 2012
Year: 2012

Multi-task learning is a learning paradigm which seeks to improve the generalization performance of a learning task with the help of some other related tasks. In this paper, we propose a regularization formulation for learning the relationships between tasks in multi-task learning. This formulation can be viewed as a novel generalization of the regularization framework for single-task learning. Besides modeling positive task correlation, our method, called multi-task relationship learning (MTRL), can also describe negative task correlation and identify outlier tasks based on the same underlying principle. Under this regularization framework, the objective function of MTRL is convex. For efficiency, we use an alternating method to learn the optimal model parameters for each task as well as the relationships between tasks. We study MTRL in the symmetric multi-task learning setting and then generalize it to the asymmetric setting as well. We also study the relationships between MTRL and some existing multi-task learning methods. Experiments conducted on a toy problem as well as several benchmark data sets demonstrate the effectiveness of MTRL.
Ad Serving Using a Compact Allocation Plan
Venue: arXiv cs.DS 2012
Year: 2012

A large fraction of online display advertising is sold via guaranteed contracts: a publisher guarantees to the advertiser a certain number of user visits satisfying the targeting predicates of the contract. The publisher is then tasked with solving the ad serving problem - given a user visit, which of the thousands of matching contracts should be displayed, so that by the expiration time every contract has obtained the requisite number of user visits. The challenges of the problem come from (1) the sheer size of the problem being solved, with tens of thousands of contracts and billions of user visits, (2) the unpredictability of user behavior, since these contracts are sold months ahead of time, when only a forecast of user visits is available and (3) the minute amount of resources available online, as an ad server must respond with a matching contract in a fraction of a second. We present a solution to the guaranteed delivery ad serving problem using {\em compact allocation plans}. These plans, computed offline, can be efficiently queried by the ad server during an ad call; they are small, using only O(1) space for contract; and are stateless, allowing for distributed serving without any central coordination. We evaluate this approach on a real set of user visits and guaranteed contracts and show that the compact allocation plans are an effective way of solving the guaranteed delivery ad serving problem.
Secured Distributed Cognitive MAC and Complexity Reduction in Channel Estimation for the Cross Layer based Cognitive Radio Networks
Venue: arXiv cs.NI 2012
Year: 2012

Secured opportunistic Medium Access Control (MAC) and complexity reduction in channel estimation are proposed in the Cross layer design Cognitive Radio Networks deploying the secured dynamic channel allocation from the endorsed channel reservation. Channel Endorsement and Transmission policy is deployed to optimize the free channel selection as well as channel utilization to cognitive radio users. This strategy provide the secured and reliable link to secondary users as well as the collision free link to primary users between the physical and MAC layers which yields the better network performance. On the other hand, Complexity Reduction in Minimum Mean Square Errror (CR-MMSE) and Maximum Likelihood (CR-ML) algorithm on Decision Directed Channel Estimation (DDCE) is deployed significantly to achieve computational complexity as Least Square (LS) method. Rigorously, CR-MMSE in sample spaced channel impulse response (SS-CIR) is implemented by allowing the computationally inspired matrix inversion. Regarding CR-ML, Pilot Symbol Assisted Modulation (PSAM) with DDCE is implemented such the pilot symbol sequence provides the significant performance gain in frequency correlation using the finite delay spread. It is found that CRMMSE demonstrates outstanding Symbol Error Rate (SER) performance over MMSE and LS, and CR-ML over MMSE and ML.
How to Attack the NP-complete Dag Realization Problem in Practice
Venue: arXiv cs.DS 2012
Year: 2012

We study the following fundamental realization problem of directed acyclic graphs (dags). Given a sequence S:=(a_1,b_1),...,(a_n, b_n) with a_i, b_i in Z_0^+, does there exist a dag (no parallel arcs allowed) with labeled vertex set V:= {v_1,...,v_n} such that for all v_i in V indegree and outdegree of v_i match exactly the given numbers a_i and b_i, respectively? Recently this decision problem has been shown to be NP-complete by Nichterlein (2011). However, we can show that several important classes of sequences are efficiently solvable. In previous work (Berger and Mueller-Hannemann, FCT2011), we have proved that yes-instances always have a special kind of topological order which allows us to reduce the number of possible topological orderings in most cases drastically. This leads to an exact exponential-time algorithm which significantly improves upon a straightforward approach. Moreover, a combination of this exponential-time algorithm with a special strategy gives a linear-time algorithm. Interestingly, in systematic experiments we observed that we could solve a huge majority of all instances by the linear-time heuristic. This motivates us to develop characteristics like dag density and "distance to provably easy sequences" which can give us an indicator how easy or difficult a given sequence can be realized. Furthermore, we propose a randomized algorithm which exploits our structural insight on topological sortings and uses a number of reduction rules. We observe that it clearly outperforms all other variants and behaves surprisingly well for almost all instances. Another striking observation is that our simple linear-time algorithm solves a set of real-world instances from different domains, namely ordered binary decision diagrams (OBDDs), train and flight schedules, as well as instances derived from food-web networks without any exception.
Adopting E-commerce to User's Needs
Venue: arXiv cs.CY 2012
Year: 2012

The objectives of this paper are to identify and analyse the extent to which the site is fulfilling all the user's requirements and needs. The related works comprise the history of interactive design and the benefits of user-centered development, which is the methodology followed in this survey. Moreover, there is a brief comparison between Waterfall and User-centered methodology in terms of addressing the issues of time saving and addressing fulfilment of users' needs. The data required to conduct this study was acquired using two research methods; the questionnaire and direct user observation, in order to address all the performance related attributes in the usability stage of the evaluation. An evaluation of the website, based on statements of usability goals and criteria, was undertaken in relation to the implementation and testing of the new design. JARIR bookstore website was chosen as a case study in this paper to investigate the usability and interactivity of the website design. The analysis section includes needs, users and tasks and data analysis, whereas the design phase covers the user interface and database design. At the end of this paper, some recommendations are presented regarding JARIR website that can be taken into account when developing the website in the future.
Designing of RF Single Balanced Mixer with a 65nm CMOS Technology Dedicated to Low Power Consumption Wireless Applications
Venue: arXiv cs.OH 2012
Year: 2012

The present work consists of designing a Single Balanced Mixer(SBM) with the 65 nm CMOS technology, this for a 1.9 GHz RF channel, dedicated to wireless applications. This paper shows; the polarization chosen for this structure, models of evaluating parameters of the mixer, then simulation of the circuit in 65nm CMOS technology and comparison with previously treated. Keywords: SBM Mixer, Radio Frequency, 65 nm CMOS Technology, Non-Linearity, Power Consumption.
Hole Detection for Increasing Coverage in Wireless Sensor Network Using Triangular Structure
Venue: arXiv cs.NI 2012
Year: 2012

The emerging technology of wireless sensor network (WSN) is expected to provide a broad range of applications, such as battlefield surveillance, environmental monitoring, smart spaces and so on. The coverage problem is a fundamental issue in WSN, which mainly concerns with a fundamental question: How well a sensor field is observed by the deployed sensors? Mobility is exploited to improve area coverage in a kind of hybrid sensor networks. The main objective for using mobile sensor nodes is to heal coverage holes after the initial network deployment, when designing a hole healing algorithm, the following issues need to be addressed. First, how to decide the existence of a coverage hole and how to estimate the size of a hole. Second, what are the best target locations to relocate mobile nodes to repair coverage holes? We use the triangular oriented diagram (HSTT) for aim to goal where its simple, have low calculation among construction and it is great to calculate the size of hole exactly .
Handwritten digit Recognition using Support Vector Machine
Venue: arXiv cs.NE 2012
Year: 2012

Handwritten Numeral recognition plays a vital role in postal automation services especially in countries like India where multiple languages and scripts are used Discrete Hidden Markov Model (HMM) and hybrid of Neural Network (NN) and HMM are popular methods in handwritten word recognition system. The hybrid system gives better recognition result due to better discrimination capability of the NN. A major problem in handwriting recognition is the huge variability and distortions of patterns. Elastic models based on local observations and dynamic programming such HMM are not efficient to absorb this variability. But their vision is local. But they cannot face to length variability and they are very sensitive to distortions. Then the SVM is used to estimate global correlations and classify the pattern. Support Vector Machine (SVM) is an alternative to NN. In Handwritten recognition, SVM gives a better recognition result. The aim of this paper is to develop an approach which improve the efficiency of handwritten recognition using artificial neural network
Powerline Communications Channel Modelling Methodology Based on Statistical Features
Venue: arXiv cs.IT 2012
Year: 2012

This paper proposes a new channel modelling method for powerline communications networks based on the multipath profile in the time domain. The new channel model is developed to be applied in a range of Powerline Communications (PLC) research topics such as impulse noise modelling, deployment and coverage studies, and communications theory analysis. To develop the methodology, channels are categorised according to their propagation distance and power delay profile. The statistical multipath parameters such as path arrival time, magnitude and interval for each category are analyzed to build the model. Each generated channel based on the proposed statistical model represents a different realisation of a PLC network. Simulation results in similar the time and frequency domains show that the proposed statistical modelling method, which integrates the impact of network topology presents the PLC channel features as the underlying transmission line theory model. Furthermore, two potential application scenarios are described to show the channel model is applicable to capacity analysis and correlated impulse noise modelling for PLC networks.
Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach
Venue: arXiv cs.GT 2012
Year: 2012

Walsh [Wal10, Wal09], Davies et al. [DKNW10, DKNW11], and Narodytska et al. [NWX11] studied various voting systems empirically and showed that they can often be manipulated effectively, despite their manipulation problems being NP-hard. Such an experimental approach is sorely missing for NP-hard control problems, where control refers to attempts to tamper with the outcome of elections by adding/deleting/partitioning either voters or candidates. We experimentally tackle NP-hard control problems for Bucklin and fallback voting. Among natural voting systems with efficient winner determination, fallback voting is currently known to display the broadest resistance to control in terms of NP-hardness, and Bucklin voting has been shown to behave almost as well in terms of control resistance [ER10, EPR11, EFPR11]. We also investigate control resistance experimentally for plurality voting, one of the first voting systems analyzed with respect to electoral control [BTT92, HHR07]. Our findings indicate that NP-hard control problems can often be solved effectively in practice. Moreover, our experiments allow a more fine-grained analysis and comparison-across various control scenarios, vote distribution models, and voting systems-than merely stating NP-hardness for all these control problems.
CloudGenius: Decision Support for Web Server Cloud Migration
Venue: arXiv cs.DC 2012
Year: 2012

Cloud computing is the latest computing paradigm that delivers hardware and software resources as virtualized services in which users are free from the burden of worrying about the low-level system administration details. Migrating Web applications to Cloud services and integrating Cloud services into existing computing infrastructures is non-trivial. It leads to new challenges that often require innovation of paradigms and practices at all levels: technical, cultural, legal, regulatory, and social. The key problem in mapping Web applications to virtualized Cloud services is selecting the best and compatible mix of software images (e.g., Web server image) and infrastructure services to ensure that Quality of Service (QoS) targets of an application are achieved. The fact that, when selecting Cloud services, engineers must consider heterogeneous sets of criteria and complex dependencies between infrastructure services and software images, which are impossible to resolve manually, is a critical issue. To overcome these challenges, we present a framework (called CloudGenius) which automates the decision-making process based on a model and factors specifically for Web server migration to the Cloud. CloudGenius leverages a well known multi-criteria decision making technique, called Analytic Hierarchy Process, to automate the selection process based on a model, factors, and QoS parameters related to an application. An example application demonstrates the applicability of the theoretical CloudGenius approach. Moreover, we present an implementation of CloudGenius that has been validated through experiments.
Understanding Sampling Style Adversarial Search Methods
Venue: arXiv cs.AI 2012
Year: 2012

UCT has recently emerged as an exciting new adversarial reasoning technique based on cleverly balancing exploration and exploitation in a Monte-Carlo sampling setting. It has been particularly successful in the game of Go but the reasons for its success are not well understood and attempts to replicate its success in other domains such as Chess have failed. We provide an in-depth analysis of the potential of UCT in domain-independent settings, in cases where heuristic values are available, and the effect of enhancing random playouts to more informed playouts between two weak minimax players. To provide further insights, we develop synthetic game tree instances and discuss interesting properties of UCT, both empirically and analytically.
A Provably-Correct Protocol for Seamless Communication with Mobile, Multi-Homed Hosts
Venue: arXiv cs.NI 2012
Year: 2012

Modern consumer devices, like smartphones and tablets, have multiple interfaces (e.g., WiFi and 3G) that attach to new access points as users move. These mobile, multi-homed computers are a poor match with an Internet architecture that binds connections to fixed end-points with topology- dependent addresses. As a result, hosts typically cannot spread a connection over multiple interfaces or paths, or change locations without breaking existing connections. In this paper, we introduce ECCP, an end-host connection control protocol that allows hosts to communicate over mul- tiple interfaces with dynamically-changing IP addresses. Each ECCP connection consists of one or more flows, each associated with an interface or path. A host can move an existing flow from one interface to another or change the IP address using in-band signaling, without any support from the underlying network. We use formal models to verify that ECCP works correctly in the presence of packet loss, out-of-order delivery, and frequent mobility, and to identify bugs and design limitations in earlier mobility protocols.