ppxscal/embedding_network huggingface dataset:
Univariate Filter Technique for Unsupervised Feature Selection Using a New Laplacian Score Based Local Nearest Neighbors
Authors: Praisan Padungweang, Chidchanok Lursinsap, Khamron Sunat
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Knowing the actual relevant features of a given data set can speed up the learning and classification processes. Most of the studies on feature selection techniques concern the classification in supervised learning. Very few studies focus on unsupervised classification. However, selecting the relevant features in unsupervised learning is more difficult than supervised learning since the topology of the given data space must be strongly preserved. These are a few proposed techniques, especially filter technique based on Laplacian score, for unsupervised feature selection. However, these techniques concern only local topology of the data clusters.In this paper, a new univariate filtering technique, called Laplacian++, is proposed and based on the strong constraint on the global topology of the data space. We apply Laplacian++ to several public datasets of UCI repository of machine learning databases and compare its performance with Laplacian score. The experimental results signify that the performance of our proposed technique is obviously better than those from the other techniques.
Asymptotically optimal encodings of conformant planning in QBF
Authors: Jussi Rintanen
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

The world is unpredictable, and acting intelligently requires anticipating possible consequences of actions that are taken. Assuming that the actions and the world are deterministic, planning can be represented in the classical propositional logic. Introducing nondeterminism (but not probabilities) or several initial states increases the complexity of the planning problem and requires the use of quantified Boolean formulae (QBF). The currently leading logic-based approaches to conditional planning use explicitly or implicitly a QBF with the prefix ∃∀∃. We present formalizations of the planning problem as QBF which have an asymptotically optimal linear size and the optimal number of quantifier alternations in the prefix: ∃∀ and ∀∃. This is in accordance with the fact that the planning problem (under the restriction to polynomial size plans) is on the second level of the polynomial hierarchy, not on the third.
Development of a Driver Model in Powered Wheelchair Operation
Authors: Takuma Ito, Takenobu Inoue, Motoki Shino, Minoru Kamata
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

This paper describes the development of a driver model in a powered wheelchair operation. Existing methods have known problems such as straining the user. This is because improving wheelchairs adjustment requires too many trails and errors. Thus, we proposed solutions using computer simulation in this study. Computer simulation for the improvement of wheelchair adjustment needs three models: surroundings, driver and vehicle. Surroundings and vehicle models based on existing researches can be made, but not driver models for the computer simulation. To construct the model, we extracted the operation characteristics using a powered wheelchair simulator. From these results, we constructed the driver model as the first order preview driver model. In addition, a computer simulation was proposed for adjusting a powered wheelchair.
Exploring the Influences of Individualism-Collectivism on Individual's Perceived Participation Equality in Virtual Learning Teams
Authors: Yingqin Zhong, Na Liu, John Lim
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

This study aims to investigate the effects of equal participation on individual member's self assessment in terms of self-reported learning, self-perceived value of contribution, group identity and process satisfaction. Further, we examine how these effects of equal participation on individual learners are moderated by learners' cultural orientation in terms of individualism-collectivism. Data were collected from 65 virtual learning teams involving 195 undergraduates in a college in south China. MANOVA tests were performed to test the hypotheses. Findings revealed supportive results to most of posited main effects as well as moderating effects.
PD-Agent: A Flexible Agent BDI Model for Autonomic Computing
Authors: Yanbin Peng, Zhijun Zheng, Beishui Liao, Ji Gao, Zhenyu Lu, Xueqin Jiang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Aiming at challenging problem in building autonomic computing system, policy based management technology and intelligent agent technology was combined to build autonomic elements and autonomic computing system. Through importing policy into agent BDI model, a flexible agent model (PD-Agent) is built to satisfy the requirement of autonomic element. To solve logic omniscience problem and related problems of policy operator, defeasible logic is imported. Working mechanism of our proposed system illustrates that the new-type agents can construct autonomic computing system in a seamless way.
Design of a Web-based Symptom Management Intervention for Cancer Patients
Authors: Christine M. Newlon, Chin-Chun A. Hu, Renee M. Stratton, Anna M. Mcdaniel
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

The discipline of Human-Computer Interaction design has potential for significant benefit to the field of health informatics. This paper describes the design approach used to develop a web-based interface to help cancer patients manage their chemotherapy side effects. Previous versions of this intervention utilizing telephone technology had been efficacious, but limited. The paper discusses the design decisions made in order to leverage the potential benefits of the Internet in supporting patients while avoiding the potential pitfalls that the patients may encounter with a web-based approach.
Fuzzy Logic Based Built Environment Impact Assessment for Urban Regeneration Simulation
Authors: Syed Adnan Yusuf, Panagiotis Georgakis, Christopher Nwagboso
Venue: Proceedings of the 2009 Second International Conference in Visualisation (2009)

Integration and adaptation of artificial intelligent designs with fuzzy inference techniques is an active area of research that can be used to meet the challenges of regeneration processes. Urban regeneration activities in built environment are complex and require a close collaboration between designers and planners in order to achieve a design plan that is environmentally robust and sustainable. Regeneration teams’ inability to manually analyze complex maps for various regeneration choices induces human errors in the regeneration process. This often results in a prolonged impact on the economic, social and environmental wellbeing and sustainability of the region. This paper, presents the development of an urban regeneration fuzzy inference system (FIS) aimed at tackling the issue of regeneration simulation in built environment through the measurement of impact of certain socioeconomic parameters to the regeneration plan. The impact assessment logic is embedded in the form of an expertly guided rule-base of an FIS. The impact is calculated using the four core principles of urban smart growth (crime, accessibility, employment and health), with respect to a measure of Euclidean intra-regional distance based accessibility function between the regeneration area(s) and the surrounding built environment neighborhood. The FIS evaluates the suitability of various regeneration sub-areas in terms of the aforementioned four principles affecting the concept of a walk-able, sustainable and eco-friendly neighborhood.
Research on Data Fusion Fault Diagnosis Method Based on D-S Evidence Theory
Authors: Shengqiang Wu, Wanlu Jiang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

D-S evidence theory is an effective method of processing uncertain information. It is widely used in data fusion systems. However, there are two difficulties in the application: evidence conflict and requested computing time of Dempster’s arithmetic that is power exponential increasing relation with number of data sources. Starting with the basic conception of D-S evidence theory, we generalize the rule for combining pieces of evidence, find the way to solve the two difficulties, build multi-source data fusion fault diagnosis system based on D-S evidence theory. Results of examples show that the system uses redundant complementary information of multi-source data, it is good to improve the reliability and exact ratio of fault diagnosis, and decrease the uncertainty.
A reference architecture for Event Processing
Authors: Adrian Paschke, Paul Vincent
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

Reference architectures predefine a common frame of reference, which can be customised to obtain architectures for specific applications in a domain. Based on a general reference model, providing a common language and semantics to explain the important concepts of Event Processing (EP), we define a general reference architecture which models the abstract architectural elements of an Event Processing-based system independent of the technologies, protocols, and products that might be used to implement it.
Load control based on PIC microcomputer for a training machine suited to elderly people
Authors: Hongbo Wang, Takakazu Ishimatsu, Fumio Kasagami, Shunji Moromugi
Venue: International Journal of Intelligent Systems Technologies and Applications (2009)

This paper presents a load control method based on PIC microcomputer for a training machine suited to elderly people. The training machine allows the elderly people to maintain their physical ability through exercise close to ordinary motion that appears in daily life such as extending or flexing legs. The system configuration of the training machine and the muscle stiffness sensor used for human machine interface are described. The hardware and software of the motor controller based on PIC microcomputer are introduced and the load control method with the control function of reverse current is proposed. Several experiments are conducted to evaluate the training system and the results indicate the effectiveness of the control system.
Economic Laissez-Faire and Regulation Policy in Liberliazation of Trade in Service
Authors: Ying Hua Meng, Hong Bo Cai
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

This paper argues that economic laissez-faire and regulation policy affect the liberliazation of international trade in service at the same time. Indicators of EFW (Economic Freedom of the World) and PMR (Product Market Regulation) are introduced in a gravity model to quantify these effects. Firstly, it is found that EFW of the import country has a positive relationship with the service import; secondly, PMR of the import country not only promote the service import, but also magnify the effects of EFW on service import; thirdly, inward oriented regulation policies of the import country has almost the same effects with PMR, neither do the outward oriented regulation policies.
Emergence of network structure due to spike-timing-dependent plasticity in recurrent neuronal networks. II. Input selectivity&#x2014;symmetry breaking
Authors: Matthieu Gilson, Anthony N. Burkitt, David B. Grayden, Doreen A. Thomas, J. Leo van Hemmen
Venue: Biological Cybernetics (2009)

Spike-timing-dependent plasticity (STDP) is believed to structure neuronal networks by slowly changing the strengths (or weights) of the synaptic connections between neurons depending upon their spiking activity, which in turn modifies the neuronal firing dynamics. In this paper, we investigate the change in synaptic weights induced by STDP in a recurrently connected network in which the input weights are plastic but the recurrent weights are fixed. The inputs are divided into two pools with identical constant firing rates and equal within-pool spike-time correlations, but with no between-pool correlations. Our analysis uses the Poisson neuron model in order to predict the evolution of the input synaptic weights and focuses on the asymptotic weight distribution that emerges due to STDP. The learning dynamics induces a symmetry breaking for the individual neurons, namely for sufficiently strong within-pool spike-time correlation each neuron specializes to one of the input pools. We show that the presence of fixed excitatory recurrent connections between neurons induces a group symmetry-breaking effect, in which neurons tend to specialize to the same input pool. Consequently STDP generates a functional structure on the input connections of the network.
Eccentric LRPIM for Convection Dominated Problems
Authors: Zujun Zhang, Feng Ruan, Saijun Zhang, Zhenjiao Chen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The purpose of this paper is mainly focused on the stability problem in the numerical analysis of the convection dominated problems. Due to the advantages of dealing with boundary conditions and introducing upwinding concept, an improved local radial point interpolation method (ELRPIM) is presented to deal with the convection dominated problems. Based on the local radial point interpolation method (LRPIM) and an eccentric test function, the ELRPIM has been proposed. Then the effect of ELRPIM is discussed through some examples in one-dimension. The results show that: both the LRPIM and ELRPIM are effective to resolve steady convection dominated problem when the Peclet number is low; along with the increase of the Peclet number, only the ELRPIM gives very good results; the optimal offset e that makes the numerical result error optimal increases with the increase of the Peclet number. It is thus concluded that the ELRPIM is very promising to solve the convection dominated problems.
Fast Parallel Montgomery Binary Exponentiation Algorithm Using Canonical- Signed-Digit Recoding Technique
Authors: Chia-Long Wu
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

In this paper, a new parallel Montgomery binary exponentiation algorithm was proposed. This algorithm is based on the Montgomery modular reduction technique, binary method, common-multiplicand-multiplication (CMM) algorithm, and the canonical-signed-digit recoding (CSD) technique. By using the CMM algorithm of computing the common part from two modular multiplications, the same common part in two modular multiplications can be computed once rather twice, we can thus improve the efficiency of the binary exponentiation algorithm by decreasing the number of modular multiplications. Furthermore, by using the proposed parallel CMM-CSD Montgomery binary exponentiation algorithm, the total number of single-precision multiplications can be reduced by about 66.7% and 30% as compared with the original Montgomery algorithm and the Ha-Moon's improved Montgomery algorithm, respectively.
Grammar-Based Automatic Extraction of Definitions
Authors: Adrian Iftene, Ionut Pistol, Diana Trandabat
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

The paper describes the development and usage of a grammar developed to extract definitions from documents. One of the most important practical usages of the developed grammar is the automatic extraction of definitions from web documents. Three evaluation scenarios were run, the results of these experiments being the main focus of the paper. One scenario uses an e-learning context and previously annotated e-learning documents; the second one involves a large collection of unannotated documents (from Wikipedia) and tries to find answers for definition type questions. The third scenario performs a similar question-answering task, but this time on the entire web using Google web search and the Google Translation Service. The results are convincing, further development as well as further integration of the definition extraction system in various related applications are already under way.
Metric-topological maps from laser scans adjusted with incremental tree network optimizer
Authors: Dario Lodi Rizzini, Stefano Caselli
Venue: Robotics and Autonomous Systems (2009)

Several adaptations of maximum likelihood approaches to incremental map learning have been proposed recently. In particular, an incremental network optimizer based on stochastic gradient descent provides a fast and easy-to-implement solution to the problem. In this paper, we illustrate two map builders that process laser scans in order to extract the constraint network for the optimization algorithm. The first algorithm builds a map in the form of a collection of scans corresponding to a subset of the poses of a robot moving in the environment. Even though such a solution has the advantage of simplicity, it requires careful processing of data associations. After a preliminary selection of pose constraints candidates, a relative pose is computed through standard scan matching techniques. The second map builder stores a hybrid metric-topological representation: the map consists of a graph whose nodes contain local occupancy grid maps and whose edges are labeled with the relative pose between pairs of nodes. Each patch map summarizes the information of consecutive raw scans and such a richer representation better solves loop closure. Association between pairs of local maps is then performed and tested using correlation-based techniques. Our aim is to illustrate the effectiveness of a tree network optimizer integrated with simple methods for data association. Experiments reported in the paper show that a compact system integrating the optimizer and one of two versions of the map builder works reasonably well with commonly used benchmarks.
A constraint programming approach to probabilistic syntactic processing
Authors: Irene Langkilde-Geary
Venue: Proceedings of the Workshop on Integer Linear Programming for Natural Langauge Processing (2009)

Integer linear programming (ILP) is a framework for solving combinatorial problems with linear constraints of the form y = c1x1 + c2x2 + &hellip; + cnxn where the variables (ie., y and xis) take on only integer values. ILP is a special case of a larger family of contraint-based solving techniques in which variables may take on additional types of values (eg. discrete, symbolic, real, set, and structured) or involve additional kinds of constraints (eg. logical and non-linear, such as x &Lambda; y &rArr; z and y = cxn). Constraint based problem solving approaches offer a more natural way of modeling many kinds of realworld problems. Furthermore, the declarative nature of constraint-based approaches makes them versatile since the order in which the variables are solved is not predetermined. The same program can thus be reused for solving different subsets of the problem's variables. Additionally, in some cases, constraintbased approaches can solve problems more efficiently or accurately than alternative approaches.
An Analysis of Random-Walk Cuckoo Hashing
Authors: Alan Frieze, Páll Melsted, Michael Mitzenmacher
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion time for cuckoo hashing under the random-walk insertion method. Cuckoo hashing provides a useful methodology for building practical, high-performance hash tables. The essential idea of cuckoo hashing is to combine the power of schemes that allow multiple hash locations for an item with the power to dynamically change the location of an item among its possible locations. Previous work on the case where the number of choices is larger than two has required a breadth-first search analysis, which is both inefficient in practice and currently has only a polynomial high probability upper bound on the insertion time. Here we significantly advance the state of the art by proving a polylogarithmic bound on the more efficient random-walk method, where items repeatedly kick out random blocking items until a free location for an item is found.
One-Nonterminal Conjunctive Grammars over a Unary Alphabet
Authors: Artur Jeż, Alexander Okhotin
Venue: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications (2009)

Conjunctive grammars over an alphabet Σ = {a} are studied, with the focus on the special case with a unique nonterminal symbol. Such a grammar is equivalent to an equation X = φ(X) over sets of natural numbers, using union, intersection and addition. It is shown that every grammar with multiple nonterminals can be encoded into a grammar with a single nonterminal, with a slight modification of the language. Based on this construction, the compressed membership problem for one-nonterminal conjunctive grammars over {a} is proved to be EXPTIME-complete, while the equivalence, finiteness and emptiness problems for these grammars are shown to be undecidable.
The Visual Effects Arsenal: VFX Solutions for the Independent Filmmaker
Authors: Bill Byrne
Venue:  (2009)

Build your VFX arsenal with quick-access, step-by-step instruction on how to create today's hottest digital VFX shots. This essential toolkit provides techniques for creating effects seen in movies such as 300, Spiderman 3, Predator and others, with lessons on how-to:* splatter blood or digitally lop someone's arm off* create a scene with actors running from an explosion* create the "twin effect" (same actor, same location, 2 performances)* produce space-ship dog fightsOrganized in a 'cookbook' style, this allows you to reference a certain effect in the index and immediately access concise instructions to create that effect. Techniques are demonstrated in each of the most popular software tools- After Effects, Final Cut Studio, Photoshop, and Combustion are all covered. Brilliant, 4-color presentation provides inspiration and stimulating visual guidance to the lessons presented, while the companion DVD contains project media files enabling you to put concepts learned into immediate practice. * 4-color, step-by-step instruction for producing today's hottest digital VFX shots * VFX techniques are presented in each of the most popular software tools* Companion DVD features project media files allowing you to immediately implement techniques learned 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