ppxscal/embedding_network huggingface dataset:
Backbone fragility and the local search cost peak
Authors: Josh Singer, Ian P. Gent, Alan Smaill
Venue: Journal of Artificial Intelligence Research (2000)

The local search algorithm WSAT is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instances near the so-called 'satisfiability threshold', but still shows a peak in search cost near the threshold and large variations in cost over different instances. We make a number of significant contributions to the analysis of WSAT on high-cost random instances, using the recently-introduced concept of the backbone of a SAT instance. The backbone is the set of literals which are entailed by an instance. We find that the number of solutions predicts the cost well for small-backbone instances but is much less relevant for the large-backbone instances which appear near the threshold and dominate in the overconstrained region. We show a very strong correlation between search cost and the Hamming distance to the nearest solution early in WSAT's search. This pattern leads us to introduce a measure of the backbone fragility of an instance, which indicates how persistent the backbone is as clauses are removed. We propose that high-cost random instances for local search are those with very large backbones which are also backbone-fragile. We suggest that the decay in cost beyond the satisfiability threshold is due to increasing backbone robustness (the opposite of backbone fragility). Our hypothesis makes three correct predictions. First, that the backbone robustness of an instance is negatively correlated with the local search cost when other factors are controlled for. Second, that backbone-minimal instances (which are 3-SAT instances altered so as to be more backbone-fragile) are unusually hard for WSAT. Third, that the clauses most often unsatisfied during search are those whose deletion has the most effect on the backbone. In understanding the pathologies of local search methods, we hope to contribute to the development of new and better techniques.
Biograhies: Herbert F. Mataré
Authors: Armand Van Dormael
Venue: IEEE Annals of the History of Computing (2009)

Physicist Herbert Franz Mataré has been doing groundbreaking work in the field of semiconductor research for more than 70 years. With Heinrich Welker in 1948, he developed the first functional European transistor. After that, his company Intermetall was the first to demonstrate a battery-operated transistor radio. Since then, he has continued his cutting-edge research in semiconductor, electronics, and solar-power technology. With more than 80 patents and numerous publications, his contributions to the field are only now being fully appreciated.
Face Recognition Technology for Ubiquitous Computing Environment
Authors: Kanghun Jeong, Seongrok Hong, Ilyang Joo, Jaehoon Lee, Hyeonjoon Moon
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

In this paper, we explore face detection and face recognition algorithms for ubiquitous computing environment. We develop algorithms for application programming interface (API) suitable for embedded system. The basic requirements include appropriate data format and collection of feature data to achieve efficiency of algorithm. Our experiment presents a face detection and face recognition algorithm for handheld devices. The essential part for proposed system includes; integer representation from floating point calculation, optimization of memory management scheme and efficient face detection performance on complex background scene.
Zero-Inflated Boosted Ensembles for Rare Event Counts
Authors: Alexander Borisov, George Runger, Eugene Tuv, Nuttha Lurponglukana-Strand
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

Two linked ensembles are used for a supervised learning problem with rare-event counts. With many target instances of zero, more traditional loss functions (such as squared error and class error) are often not relevant and a statistical model leads to a likelihood with two related parameters from a zero-inflated Poisson (ZIP) distribution. In a new approach, a linked pair of gradient boosted tree ensembles are developed to handle the multiple parameters in a manner that can be generalized to other problems. The result is a unique learner that extends machine learning methods to data with nontraditional structures. We empirically compare to two real data sets and two artificial data sets versus a single-tree approach (ZIP-tree) and a statistical generalized linear model.
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
Authors: Yoram Bachrach, Ralf Herbrich, Ely Porat
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

Collaborative filtering (CF) shares information between users to provide each with recommendations. Previous work suggests using sketching techniques to handle massive data sets in CF systems, but only allows testing whether users have a high proportion of items they have both ranked. We show how to determine the correlation between the rankings of two users, using concise "sketches" of the rankings. The sketches allow approximating Kendall's Tau, a known rank correlation, with high accuracy ¿ and high confidence 1 ¿ ¿. The required sketch size is logarithmic in the confidence and polynomial in the accuracy.
CompTIA A+ Cert Flash Cards Online: Essentials, 220-602, 220-603, 220-604, Retail Packaged Version, 1st edition
Authors: David L. Prowse
Venue:  (2009)

CompTIA A+ Cert Flash Cards Online Essentials, 220-602, 220-603, 220-604 David Prowse The CompTIA A+ Cert Flash Cards Online provides a concise review of all objectives on the A+ Essentials 220-601, 220-602, 220-603, and the 220-604 exams. This online exam preparation tool consists of a custom flash card application loaded with 400 total questions that test your skills and enhance retention of exam topics. Questions are organized by exam objective, allowing you to focus your study on selected topics. You can choose to view cards in order or at random, and you can create custom sets from the entire bank of cards. The engine provides you with the ability to mark each question correct or incorrect and provides a detailed score report by category at the end of the exam. You can even write notes on each question and then get a printable PDF of all your notes aligned to the relevant questions. These robust features make this a truly unique learning tool: . Test your knowledge by entering your own answers . Grade your answers against the correct answer . Create custom question sets . View detailed score reports . Enter and print notes for each question . Use on any device that has a web browser and Internet connection CompTIA A+ Cert Flash Cards Online is an online, internet-based service, available in both desktop and mobile device formats, allowing you to test yourself at home, at work, or on the go. System Requirements: Web browser and Internet connection www.informit.com certflashcardsonline.com US: $29.99 / CAN: $35.99 The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Impact Experimental Study and Theoretical Analysis on Energy Absorbing Capability of Splitting and Curling of Tubes
Authors: Zhifang Liu, Guoyun Lu, Shanyuan Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

A Steel tube is one of the most important of energy absorbing elements. The quasi-static and impact experiments were performed. DHR9401 drop hammer rig, TDS420A digital recorder and force sensor were used in the tests. All specimens have been split and curled by pressing axially against a conical dies with semi-angles 450. Six groups steel circular tube with internal diameter 54.4mm and thickness 0.43mm~3.00mm were used. To obtain a regular deformation mode and reduce the initiated spike, by pre-cutting six 4mm slits which were contributed evenly at the lower end of each tube. The deformation modes of the specimen are obtained and load-time curves in the impact experiments are given. Theoretical analysis based on the theory of energy balance is carried and the ratio of every kind of energy to total energy is obtained. Energy analysis indicates that tearing energy is the main component of the total energy. The result from energy analysis agrees well with impact experiments.
Modelling sustainable international tourism demand to the Brazilian Amazon
Authors: Jose Angelo Divino, Michael McAleer
Venue: Environmental Modelling Software (2009)

The Amazon rainforest is one of the world's greatest natural wonders and holds great importance and significance for the world's environmental balance. Around 60% of the Amazon rainforest is located in the Brazilian territory. The two biggest states of the Amazon region are Amazonas (the upper Amazon) and Para (the lower Amazon), which together account for around 73% of the Brazilian Legal Amazon, and are the only states that are serviced by international airports in Brazil's north region. The purpose of this paper is to model and forecast sustainable international tourism demand for the states of Amazonas, Para, and the aggregate of the two states. By sustainable tourism is meant a distinctive type of tourism that has relatively low environmental and cultural impacts. Economic progress brought about by illegal wood extraction and commercial agriculture has destroyed large areas of the Amazon rainforest. The sustainable tourism industry has the potential to contribute to the economic development of the Amazon region without destroying the rainforest. The paper presents unit root tests for monthly and annual data, estimates alternative time series models and conditional volatility models of the shocks to international tourist arrivals, and provides forecasts for 2006 and 2007.
Vision-Based Motion Capture of Interacting Multiple People
Authors: Hiroaki Egashira, Atsushi Shimada, Daisaku Arita, Rin-Ichiro Taniguchi
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Vision-based motion capture is getting popular for acquiring human motion information in various interactive applications. To enlarge its applicability, we have been developing a vision-based motion capture system which can estimate the postures of multiple people simultaneously using multiview image analysis. Our approach is divided into the following two phases: at first, extraction, or segmentation, of each person in input multiview images; then, posture analysis for one person is applied to the segmented region of each person. The segmentation is realized in the voxel space, which is reconstructed by visual cone intersection of multiview silhouettes. Here, a graph cut algorithm is employed to achieve optimal segmentation. Posture analysis is based on a model-based approach, where a skeleton model of human figure is matched with the multiview silhouettes based on a particle filter and physical constraints on human body movement. Several experimental studies show that the proposed method acquires human postures of multiple people correctly and efficiently even when they touch each otter.
nFOIL: integrating Naïve Bayes and FOIL
Authors: Niels Landwehr, Kristian Kersting, Luc De Raedt
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

We present the system nFOIL. It tightly integrates the naïve Bayes learning scheme with the inductive logic programming rule-learner FOIL. In contrast to previous combinations, which have employed naïve Bayes only for post-processing the rule sets, nFOIL employs the naïve Bayes criterion to directly guide its search. Experimental evidence shows that nFOIL performs better than both its base line algorithm FOIL or the post-processing approach, and is at the same time competitive with more sophisticated approaches.
Two graph-based algorithms for state-of-the-art WSD
Authors: Eneko Agirre, David Martínez, Oier López de Lacalle, Aitor Soroa
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

This paper explores the use of two graph algorithms for unsupervised induction and tagging of nominal word senses based on corpora. Our main contribution is the optimization of the free parameters of those algorithms and its evaluation against publicly available gold standards. We present a thorough evaluation comprising supervised and unsupervised modes, and both lexical-sample and all-words tasks. The results show that, in spite of the information loss inherent to mapping the induced senses to the gold-standard, the optimization of parameters based on a small sample of nouns carries over to all nouns, performing close to supervised systems in the lexical sample task and yielding the second-best WSD systems for the Senseval-3 all-words task.
Agent influence as a predictor of difficulty for decentralized problem-solving
Authors: Martin Allen, Shlomo Zilberstein
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

We study the effect of problem structure on the practical performance of optimal dynamic programming for decentralized decision problems. It is shown that restricting agent influence over problem dynamics can make the problem easier to solve. Experimental results establish that agent influence correlates with problem difficulty: as the gap between the influence of different agents grows, problems tend to become much easier to solve. The measure thus provides a general-purpose, automatic characterization of decentralized problems, identifying those for which optimal methods are more or less likely to work. Such a measure is also of possible use as a heuristic in the design of algorithms that create task decompositions and control hierarchies in order to simplify multiagent problems.
Universally Composable Symmetric Encryption
Authors: Ralf Küsters, Max Tuengerthal
Venue: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium (2009)

For most basic cryptographic tasks, such as public-key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities have been formulated in the simulation-based security approach, along with their realizations. Surprisingly, however, no such functionality exists for symmetric encryption, except for a more abstract Dolev-Yao style functionality. In this paper, we fill this gap. We propose two functionalities for symmetric encryption, an unauthenticated and an authenticated version, and show that they can be implemented based on standard cryptographic assumptions for symmetric encryption schemes, namely IND-CCA security and authenticated encryption, respectively, provided that the environment does not create key cycles or cause these-called commitment problem. We also illustrate the usefulness of our functionalities in applications, both in simulation-based and game-based security settings.
Fusion of Logic Programming and Description Logics
Authors: Mantas Šimkus
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

Broadly, our research concerns the fusion of Logic Programming (LP) andDescription Logics (DLs), two solid knowledge representation paradigms with largely dual properties.The two feature different semantics and orthogonal expressivity, and they apply different reasoning techniques. Finding ways to exploit the positive features of both has become an important research topic, which has also been fueled by the prospect of applications in the Semantic Web [10]. In the latter context, ontologies written in expressive DLs are to be used to provide a common conceptualization of web resources, which can then be accessed by LP-based automated agents providing services to end-users.
A Blind Source Separation Based Approach for Speech Enhancement in Noisy and Reverberant Environment
Authors: Alessio Pignotti, Daniele Marcozzi, Simone Cifani, Stefano Squartini, Francesco Piazza
Venue: Cross-Modal Analysis of Speech, Gestures, Gaze and Facial Expressions: COST Action 2102 International Conference Prague, Czech Republic, October 15-18, 2008 Revised Selected and Invited Papers (2009)

Several efforts have been put by the international scientific community on the Speech Enhancement (SE) research field, specially for the several applications it may have (like human-machine dialogue systems and speaker identification/verification). An innovative SE scheme is presented in this work: it integrates the spatial method (Blind Source Separation, BSS) with the temporal method (Adaptive Noise Canceller, ANC) and a final stage composed of a Multichannel Signal Detection and a Post Filter (MSD+PF) to enhance vocal signals in noisy and reverberant environment. We used a broadband blind source separation (BSS) algorithm to separate target and interference signals in real reverberant scenarios and the two post-processing stages ANC and MSD+PF, in cascade with the first one, to improve the separation yielded by the BSS. In particular the former one allows to further reduce the residual interference signal still presents in the desired target signal after separation, by using as reference the other output of the BSS stage. Computer real-time simulations show progressive improvements across the different processing stages in terms of the chosen quality parameter, i.e. the coherence between the two output channels.
Generalisation Performance vs. Architecture Variations in Constructive Cascade Networks
Authors: Suisin Khoo, Tom Gedeon
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Constructive cascade algorithms are powerful methods for training feedforward neural networks with automation of the task of specifying the size and topology of network to use. A series of empirical studies were performed to examine the effect of imposing constraints on constructive cascade neural network architectures. Building a priori knowledge of the task into the network gives better generalisation performance. We introduce our Local Feature Constructive Cascade (LoCC) and Symmetry Local Feature Constructive Cascade (SymLoCC) algorithms, and show them to have good generalisation and network construction properties on face recognition tasks.
Public Policies on eParticipation in Austria
Authors: Georg Aichholzer, Doris Allhutter
Venue: Proceedings of the 1st International Conference on Electronic Participation (2009)

This paper assesses the status of eParticipation within the political system in Austria. It takes a top-down perspective focusing on the role of public participation and public policies on eParticipation. The status of eParticipation in Austria as well as of social and political trends regarding civic participation and its electronic embedding are analysed. The results show a remarkable recent increase of eParticipation projects and initiatives. A major conclusion is that eParticipation is becoming a subject of public policies in Austria; however, the upswing of supportive initiatives for public participation and eParticipation goes together with ambivalent attitudes among politicians and administration.
UC3M_13: disambiguation of person names based on the composition of simple bags of typed terms
Authors: David del Valle-Agudo, César de Pablo-Sánchez, María Teresa Vicente-Díez
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

This paper describes a system designed to disambiguate person names in a set of Web pages. In our approach Web documents are represented as different sets of features or terms of different types (bag of words, URLs, names and numbers). We apply Agglomerative Vector Space clustering that uses the similarity between pairs of analogous feature sets. This system achieved a value of 66% for F&alpha;=0.2 and a value of 48% for F&alpha;=0.5 in the Web People Search Task at SemEval-2007 (Artiles et al., 2007).
Brief paper: An integrated perturbation analysis and Sequential Quadratic Programming approach for Model Predictive Control
Authors: Reza Ghaemi, Jing Sun, Ilya V. Kolmanovsky
Venue: Automatica (Journal of IFAC) (2009)

Computationally efficient algorithms are critical in making Model Predictive Control (MPC) applicable to broader classes of systems with fast dynamics and limited computational resources. In this paper, we propose an integrated formulation of Perturbation Analysis and Sequential Quadratic Programming (InPA-SQP) to address the constrained optimal control problems. The proposed algorithm combines the complementary features of perturbation analysis and SQP in a single unified framework, thereby leading to improved computational efficiency and convergence property. A numerical example is reported to illustrate the proposed method and its computational effectiveness.
Dictionaries merger for text expansion in question answering
Authors: Bernard Jacquemin
Venue: Proceedings of the Workshop on Enhancing and Using Electronic Dictionaries (2004)

This paper presents an original way to add new data in a reference dictionary from several other lexical resources, without loosing any consistence. This operation is carried in order to get lexical information classified by the sense of the entry. This classification makes it possible to enrich utterances (in QA: the queries) following the meaning, and to reduce noise. An analysis of the experienced problems shows the interest of this method, and insists on the points that have to be tackled.