ppxscal/embedding_network huggingface dataset:
Analysis and synthesis of signal classification systems by perturbing pseudoinverse and projection operations
Authors: N. F. Kirichenko, G. I. Kudin
Venue: Cybernetics and Systems Analysis (2009)

The paper considers the synthesis of signal classification systems using the theory of perturbation of pseudoreverse and projection matrices and proposes an algorithm to select (filter) separable subsets on a finite point set from R n .
Evaluating Training with Cognitive State Sensing Technology
Authors: Patrick L. Craven, Patrice D. Tremoulet, Joyce H. Barton, Steven J. Tourville, Yaela Dahan-Marks
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Five different training techniques (classroom, video, game-based, computer-based, and simulator) were compared using neurophysiological measurements. The best performance was displayed by individuals in the classroom and video conditions. These participants also displayed the lowest levels of cognitive workload and the highest levels of engagement. The poorest performance on the training was exhibited by individuals in the computer-based and game conditions. These participants also displayed the highest levels of cognitive workload, the lowest levels of engagement, and computer-based had the highest levels of drowsiness. As expected, the testing phases of the training had the highest levels of workload. In general, engagement dropped and distraction increased during the training phase when the material was first presented to participants. However, participants who could keep engagement high during this period performed better. This suggests that mental state monitoring during training could help provide a mechanism for alleviating distraction and inattention and boost training efficacy.
Deploying embodied AI into virtual worlds
Authors: David J. H. Burden
Venue: Knowledge-Based Systems (2009)

Unlike computer games where Non-Player-Character avatars are common, in most virtual worlds they are the exception. Deploying an embodied AI into a virtual world offers a unique opportunity to evaluate embodied AIs, and to develop them within an environment where human and computer are on almost equal terms. This paper presents an architecture being used for the deployment of chatbot driven avatars within the Second Life virtual world, looks at the challenges of deploying an AI within such a virtual world, the possible implications for the Turing Test, and identifies research directions for the future.
E-auction web assessment model in China
Authors: June Lu, Lu-Zhuang Wang, Chun-Sheng Yu, Jia-Ying Wu
Venue: Electronic Commerce Research (2009)

Electronic auction (e-auction), a major e-commerce model, has enjoyed rapid growth in many countries. This study develops a web assessment model (EAWAM) from a consumer perspective that suggests that user intention to continue using an e-auction website is based on users' satisfaction with the e-auction website, which is determined by perceived e-auction user friendliness, functionality and interactivity. Web trustworthiness serves as an important antecedent to perceived e-auction user friendliness and functionality. To validate this model, a survey was conducted using 191 users of Taobao.com from 15 cities in China. Partial Least Square analysis results provided strong support for this model and also yielded important implications and suggestions for further research.
Designing opportunistic user interfaces to support a collaborative museum exhibit
Authors: Leilah Lyons
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

This research explores how to support collaborative learning practices when science museum visitors employ their own personal mobile devices as Opportunistic User Interfaces (O-UIs) to manipulate a simulation-based museum exhibit. The sophisticated graphical capabilities of modern mobile devices have the potential to distract visitors, a phenomenon known as the heads-down effect. To study the impact of O-UI design on collaboration, a highly-dynamic "complex" O-UI was contrasted against more simplistic, "remote-control" OUI design, in the context of a cancer-treatment simulation. As expected, when groups used the "complex" O-UI, there was less visitor-visitor interaction, but unexpectedly, their conversations were of higher quality. They also engaged in better task division and displayed better task performance. The increased attention "simple" O-UI users were able to devote to monitoring one another's actions seemed to encourage emergent competitive behaviors, which disproportionately affected the engagement of female visitors. "Complex" groups showed no gender-related differences in engagement.
A Proposal of P2P-Based Resource Discovery Mechanism for the Grid
Authors: Kei Kokubo, Kohei Ichikawa, Yoshimasa Ishi, Susumu Date
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

Resource discovery is a fundamental service of the Grid to find out resources suitable for executing user jobs. Traditional resource discovery services of the Grid have static structure and centralized or hierarchized, such as Globus MDS. However, with the number of resources composing the Grid increased, this approach has two problems, namely, on dynamic changes of the structure in the Grid and obtaining the latest resource information. To solve these problems, we have been seeking for the possibility of a resource discovery mechanism adopting Peer-to-Peer approach, which is characterized by real-time retrieval of information using an overlay network spanned on physical computational resources. In this paper, we present the preliminary results of our research activities so far.
Prime implicates and prime implicants in modal logic
Authors: Meghyn Bienvenu
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

The purpose of this paper is to extend the notions of prime implicates and prime implicants to the basic modal logic κ. We consider a number of different potential definitions of clauses and terms for κ, which we evaluate with respect to their syntactic, semantic, and complexity-theoretic properties. We then continue our analysis by comparing the definitions with respect to the properties of the notions of prime implicates and prime implicants that they induce. We provide algorithms and complexity results for the prime implicate generation and recognition tasks for the two most satisfactory definitions.
Computer-aided proofs of arrow's and other impossibility theorems
Authors: Fangzhen Lin, Pingzhong Tang
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Arrow's Impossibility Theorem is one of the landmark results in social choice theory. Over the years since the theorem was proved in 1950, quite a few alternative proofs have been put forward. In this paper, we propose yet another alternative proof of the theorem. The basic idea is to use induction to reduce the theorem to the base case with 3 alternatives and 2 agents and then use computers to verify the base case. This turns out to be an effective approach for proving other impossibility theorems such as Sen's and Muller-Satterthwaite's theorems as well. Furthermore, we believe this new proof opens an exciting prospect of using computers to discover similar impossibility or even possibility results.
Longest convex chains
Authors: Gergely Ambrus, Imre Bárány
Venue: Random Structures Algorithms (2009)

Assume Xn is a random sample of n uniform, independent points from a triangle T. The longest convex chain, Y, of Xn is defined naturally (see the next paragraph). The length |Y| of Y is a random variable, denoted by Ln. In this article, we determine the order of magnitude of the expectation of Ln. We show further that Ln is highly concentrated around its mean, and that the longest convex chains have a limit shape. &copy; 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009
Foundations of Probability and Physics - 5, 1st edition
Authors: Luigi Accardi, Guillaume Adenier, Andrei Y. Khrennikov, Christopher Fuchs, Gregg Jaeger, Jan-Ake Larsson, Stig Stenholm
Venue: Aip Conference Proceedings (2009)

This conference was devoted to fundamental questions raised by quantum mechanics, especially in quantum information theory. As has become customary in our series of conference in Vxj, we were glad to welcome a fruitful assembly of theoretical physicists, experimentalists, mathematicians and even philosophers interested in the foundations of probability and physics. This conference belongs to the series of Vxj conferences in foundations of quantum mechanics (especially probabilistic foundations) combined of two subseries, Foundations of Probability and Physics: 2000, 02, 04, 06, 08, and Quantum Theory: Reconsideration of Foundations: 2001, 03, 05, 07. We also mention the first Vxj conference: Bohmian mechanics 2000. This is definitely the longest series of conferences on foundations in the history of quantum mechanics.
Google Shared. A Case-Study in Social Search
Authors: Barry Smyth, Peter Briggs, Maurice Coyle, Michael O'Mahony
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

Web search is the dominant form of information access and everyday millions of searches are handled by mainstream search engines, but users still struggle to find what they are looking for, and there is much room for improvement. In this paper we describe a novel and practical approach to Web search that combines ideas from personalization and social networking to provide a more collaborative search experience. We described how this has been delivered by complementing, rather than competing with, mainstream search engines, which offers considerable business potential in a Google-dominated search marketplace.
Simulation and Analysis of the Cabin Typical Structure under Vibro-acoustic Combined Environment
Authors: Jun Wang, Wei Ning, Jinghui Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

Vibro-acoustic combined environment is the main source of vibration during the launch and high-speed flight of aircraft, in order to determine the experimental standard, this paper will utilize the famous vibration and acoustic analysis software--LMS.SYSNOISE, and combine the large-scale finite element analysis software--MSC.PATRAN&NASTRAN, to carry out numerical simulation of random vibration from a shaker plus reverberant acoustic field to the cabin structure. Based on combination of finite element and boundary element technology, we establish the coupling finite element and boundary element model of cabin structure. Through analyzing the coupled finite element and boundary element formulations, as well as the principle of stochastic analysis, the coupled formulations can be transformed into the form that expressed as input-output power spectrum density (PSD). By the mathematical formulation deduced we can calculate nodal response PSD of the coupling model under random vibro-acoustic combined environment, it solved the problem that SYSNOISE cannot calculate at the situation when the structure is suffering two different kinds of random excitations simultaneously.
Wireless Networked Control Systems with Generalized Predictive Control and Novel Smith Predictor
Authors: Feng Du, Wencai Du
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

In this paper, a novel approach is proposed to deal with network delay, based on new Smith predictor combined with generalized predictive control (GPC) for wireless networked control systems (WNCS). Because new Smith dynamic predictor hides predictor model of the network delay into real data transmission process, further the network delay no longer need to be measured, identified or estimated on-line. Based on IEEE 802.15.4 (ZigBee), simulation results are given to illustrate the effectiveness of the method.
Facial Metrical and Caricature-Pattern-Based Learning in Neural Network System for Face Recognition
Authors: Jakarin Smitaveja, Kingkarn Sookhanaphibarn, Chidchanok Lursinsap
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Face recognition technology has been an increasingly important module in security systems. A challenging problem is how to extract features tolerant to the appearance variables such as changes in shape, illumination, and occlusion. Extracted metrical features of facial caricatures that are combined with their facial photographs in the training set are examined. The facial caricature is a personal representative amplifying perceptually significant information of individuals. Unlike Eigenfaces, Fisherfaces, and Laplacianfaces, the twenty-nine metrical features that used in this study do not depend upon illumination and occlusion variables. Our results show that facial caricature-trained neural networks outperform significantly of those only facial photograph-trained neural networks.
Spoken dialogue for simulation control and conversational tutoring
Authors: Elizabeth Owen Bratt, Karl Schultz, Brady Clark
Venue: Demonstration Papers at HLT-NAACL 2004 on XX (2004)

This demonstration shows a flexible tutoring system for studying the effects of different tutoring strategies enhanced by a spoken language interface. The hypothesis is that spoken language increases the effectiveness of automated tutoring. The domain is Navy damage control.
Constructing self-testing circuits with the use of step-by-step (cascade) control
Authors: B. B. Abramov, O. Keren, I. S. Levin, V. I. Ostrovskii
Venue: Automation and Remote Control (2009)

A method of control is proposed on the basis of representing the checked circuits as consequently connected subcircuits (cascades). The subdivision of the circuits into cascades is made in such a way that any failure in each of them results in a distortion of no more than one binary digit at its input. There is developed an universal sequential-sampling circuit with step-by-step control, where the detection of errors does not require additional (coding) variables. The results of this investigation showed that the proposed method for operational control entails considerably lesser hardware and power expenditure as compared with the circuits based on application of the Berger code.
Full and Autonomic Mobility Management for Mobile Agents
Authors: Leila Ismail, Boumediene Belkkhouche
Venue: Proceedings of the 2009 First International Conference on Advances in Future Internet (2009)

Cooperation among autonomous mobile agents requires mechanisms to efficiently support communication. The interaction between mobility and communication and the constant re-localization of mobile agents raise several mobility management issues. To address these issues, we develop mechanisms for a full and autonomic mobility management of agents within an underlying model. In addition of being efficient and transparent to agents, our mechanisms take into account the interaction between mobility and communication among agents.
Tradeoff Between Complexity and Memory Size in the 3GPP Enhanced aacPlus Decoder: Speed-Conscious and Memory-Conscious Decoders on a 16-Bit Fixed-Point DSP
Authors: Osamu Shimada, Toshiyuki Nomura, Akihiko Sugiyama, Masahiro Serizawa
Venue: Journal of Signal Processing Systems (2009)

This paper investigates tradeoff between complexity and memory size (speed-memory tradeoff) in the 3GPP enhanced aacPlus decoder based on a 16-bit fixed-point DSP implementation. In order to investigate this tradeoff, the speed- and the memory-conscious decoders are implemented. The maximum number of operations for the implemented speed-conscious decoder is 29.3 million cycles per second (MCPS) for a 32 kb/s bitstream. The maximum number of operations for the memory-conscious decoder, where 70% of the data are allocated to an external memory area, increases by 5.7 MCPS (19%) for the bitstream. The investigation of this tradeoff provides an actual relationship between the computational complexity and the internal memory size of the 3GPP enhanced aacPlus decoder. This relationship is useful for implementing a decoder with a best speed---memory balance that is determined by each specific application and the user requirements.
On an Active Content Access Control Device for Secure Information Management
Authors: Qian Wu, Li Fan
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Access to secure information requires fine-grained management corresponding to user identity, assigned privileges, and sometimes dynamic authorizations. Conventional techniques leave too many security pitfalls to rectify when compatibilities with legacy systems must be maintained. We present in this paper an active content access control device whose uniqueness lies on built-in intelligence powered by a specially designed USB controller and application firmware. The device functions standalone as a universal security key to unlock virtually all commonly used secure information storage volumes, as long as user identity, assigned privileges, and dynamic authorizations are provided properly. A variety of real world use cases demonstrate significant improvement in effectiveness and flexibility for secure information management.
Graphical Representation of the Pandemic Spreading
Authors: Vasile Prejmerean, Militon Frentiu, Vasile Cioban, Ovidiu Ghiran
Venue: Proceedings of the 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing (2008)

The pandemic spreading of a disease may be influenced in many ways. This paper focuses on simulation of the pandemic influenza and the graphical representation on the maps. For this reason we need to build maps by stitching the counties that contain cities and localities, the encoding of these elements using different colours on the map, the generation of the neighbour relationship, and finally the simulation.
Identifying similar words and contexts in natural language with SenseClusters
Authors: Ted Pedersen, Anagba Kulkarni
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 4 (2005)

SenseClusters is a freely available intelligent system that clusters together similar contexts in natural language text. Thereafter it assigns identifying labels to these clusters based on their content. It is a purely unsupervised approach that is language independent, and uses no knowledge other than what is available in raw un-annotated corpora. In addition to clustering similar contexts, it can be used to identify synonyms and sets of related words. It has been applied to a diverse range of problems, including proper name disambiguation, word sense discrimination, email organization, and document clustering. SenseClusters is a complete system that supports feature selection from large corpora, several different context representation schemes, various clustering algorithms, the creation of descriptive and discriminating labels for the discovered clusters, and evaluation relative to gold standard data.
Mining Candlesticks Patterns on Stock Series: A Fuzzy Logic Approach
Authors: Mario Linares Vásquez, Fabio Augusto González Osorio, Diego Fernando Hernández Losada
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Candlesticks is a technique used in financial time series in order to forecast future market performance. With candlesticks patterns, traders build active trading strategies in order to buy, sell or hold securities. The process is based on a preliminary stage which consists in identifying individual basic shapes on time series. Identifying candlesticks basic shapes is easy for a human, but recognizing complex patterns is hard because a lot of data is available. In this paper a data mining model for building active trading strategies (using candlesticks assumptions) is proposed looking for frequent itemsets on symbolic stocks series. Model validation is achieved with real data from New York Stock Exchange.
Post-copy live migration of virtual machines
Authors: Michael R. Hines, Umesh Deshpande, Kartik Gopalan
Venue: ACM SIGOPS Operating Systems Review (2009)

We present the design, implementation, and evaluation of post-copy based live migration for virtual machines (VMs) across a Gigabit LAN. Post-copy migration defers the transfer of a VM's memory contents until after its processor state has been sent to the target host. This deferral is in contrast to the traditional pre-copy approach, which first copies the memory state over multiple iterations followed by a final transfer of the processor state. The post-copy strategy can provide a "win-win" by reducing total migration time while maintaining the liveness of the VM during migration. We compare post-copy extensively against the traditional pre-copy approach on the Xen Hypervisor. Using a range of VM workloads we show that post-copy improves several metrics including pages transferred, total migration time, and network overhead. We facilitate the use of post-copy with adaptive prepaging techniques to minimize the number of page faults across the network. We propose different prepaging strategies and quantitatively compare their effectiveness in reducing network-bound page faults. Finally, we eliminate the transfer of free memory pages in both pre-copy and post-copy through a dynamic self-ballooning (DSB) mechanism. DSB periodically reclaims free pages from a VM and significantly speeds up migration with negligible performance impact on VM workload.
Generalized Multi-Instance Learning: Problems, Algorithms and Data Sets
Authors: Min-Ling Zhang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

In multi-instance learning, each example is represented by a bag of instances while associated with a binary label. Under standard multi-instance learning settings, one example is labeled as a positive bag if at least one of its instances is positive. Otherwise, it is labeled as a negative bag. Although based on the above assumption, standard multi-instance learning has achieved much success in solving diverse learning tasks, there are still many real-world problems where this assumption may not necessarily hold. Therefore, researchers aimed to expand the underlying assumption of standard multi-instance learning where two frameworks of generalized multi-instance learning have been proposed. In this paper, the problem definition, learning algorithms and also experimental data sets related to either generalized multi-instance learning framework are briefly reviewed. 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