ppxscal/embedding_network huggingface dataset:
Service-Oriented Agents for Collaborative Industrial Automation and Production Systems
Authors: J. Marco Mendes, Paulo Leitão, Francisco Restivo, Armando W. Colombo
Venue: Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2009)

Service-oriented Multi-Agent Systems (SoMAS) is an approach to combine the fundamental characteristics of service-oriented and multi-agent methods into a new platform for industrial automation. Several research works already targeted the connection of these technologies, presenting different perspectives in how and why to join them. This research focuses on available efforts and solutions in the area of SoMAS and explains the idea behind the service-oriented agents in industrial automation. A SoMAS system is mainly composed by shared resources in form of services and their providing/requesting agents. The paper also discusses the required engineering aspects of these systems, from the internal anatomy to the interaction patterns. Parameters of flexibility, reconfiguration, autonomy and reduced development efforts were considered and they should be the trademark of SoMAS. Aiming to illustrate the proposed approach, an example of service-oriented automation agents is given.
On Feedback Similarity Measurement in Web of Trust
Authors: Changyong Niu, Heng Luo, Ming Fan, Ruimin Shen
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

Trust modeling is currently a key part in building P2P and other internet-based systems. One way for trust generation is to view the trust among users as a web of trust in large scale internet settings, and the trust quantities are further computed from such a web. However, due to the large size and sparseness of the web of trust, how to effectively represent and propagate trust in such a web remains a challenging problem. In this paper, we first present a novel way for similarity measurement from the point of view of user feedback patterns, which can be further incorporated into a trust model. And then the efficiency and effectiveness of the proposed method is given in simulations.
2nd Workshop on Design for Social Interaction through Physical Play
Authors: Tilde Bekker, Janienke Sturm, Emilia Barakova
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

We aim to stimulate social interaction by designing and creating interactive objects for physical play for diverse user groups, such as children, elderly or people with special needs. With this workshop we aim to bring researchers and practitioners together to share and explore issues and opportunities for technology-enhanced physical play for stimulating face-to-face social interaction (as opposed to virtual interaction through a computer). The focus of this workshop is on sharing theories that are valuable for the design and research of products and applications in this field.
Optimal multi-agent scheduling with constraint programming
Authors: Willem-Jan Van Hoeve, Carla P. Gomes, Bart Selman, Michele Lombardi
Venue: Proceedings of the 19th national conference on Innovative applications of artificial intelligence - Volume 2 (2007)

We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the objective is to maximize the total 'quality' of the schedule. More specifically, we focus on multi-agent scheduling problems with time windows, hard and soft precedence relations, and a nonlinear objective function. We show how we can model and efficiently solve these problems with constraint programming technology. Elements of our proposed method include constraint-based reasoning, search strategies, problem decomposition, scheduling algorithms, and a linear programming relaxation. We present experimental results on realistic problem instances to display the different elements of the solution process.
New Perspectives: Portfolio Projects for Business Communication, 1st edition
Authors: Carol M. Cram
Venue:  (2009)

NEW PERSPECTIVES: PORTFOLIO PROJECTS FOR BUSINESS COMMUNICATION, Second Edition, teaches students how to communicate effectively in today's constantly changing business environment. By solving realistic business case problems, students learn how to create a wide range of business documents and oral presentations, use technology to communicate effectively, address the needs of diverse audiences, and consider the ethical implications of their communication practices. 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
Analytical Investigation of Dynamic Characteristic for Stator End-Winding of Turbo-generator of 600MW
Authors: Wei Liao, Yongge Gao, Haijun Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

The stator end-winding is the key component of turbo-generator running in normal status. For exploring the quality characteristics for stator end-winding of large capacity turbo-generator of 600MW,the test modal based on architectural characteristics is established. The hammering method is used for testing process and the modal parameters of stator end-winding are determined by means of modal analysis. The experiment results approve that the proposed method provide a basis for analysis of dynamic characteristics of stator end-winding and reformation of turbine structure, and makes reference to structure design and parameter calculation of turbine unit in the future.
Responding to Learners' Cognitive-Affective States with Supportive and Shakeup Dialogues
Authors: Sidney D'Mello, Scotty Craig, Karl Fike, Arthur Graesser
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

This paper describes two affect-sensitive variants of an existing intelligent tutoring system called AutoTutor. The new versions of AutoTutor detect learners' boredom, confusion, and frustration by monitoring conversational cues, gross body language, and facial features. The sensed cognitive-affective states are used to select AutoTutor's pedagogical and motivational dialogue moves and to drive the behavior of an embodied pedagogical agent that expresses emotions through verbal content, facial expressions, and affective speech. The first version, called the Supportive AutoTutor, addresses the presence of the negative states by providing empathetic and encouraging responses. The Supportive AutoTutor attributes the source of the learners' emotions to the material or itself, but never directly to the learner. In contrast, the second version, called the Shakeup AutoTutor, takes students to task by directly attributing the source of the emotions to the learners themselves and responding with witty, skeptical, and enthusiastic responses. This paper provides an overview of our theoretical framework, and the design of the Supportive and Shakeup tutors.
Kernel Entropy Component Analysis Pre-images for Pattern Denoising
Authors: Robert Jenssen, Ola Storås
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

The recently proposed kernel entropy component analysis (kernel ECA) technique may produce strikingly different spectral data sets than kernel PCA for a wide range of kernel sizes. In this paper, we investigate the use of kernel ECA as a component in a denoising technique previously developed for kernel PCA. The method is based on mapping noisy data to a kernel feature space, for then to denoise by projecting onto a kernel ECA subspace. The denoised data in the input space is obtained by computing pre-images of kernel ECA denoised patterns. The denoising results are in several cases improved.
An Access Control Language for a General Provenance Model
Authors: Qun Ni, Shouhuai Xu, Elisa Bertino, Ravi Sandhu, Weili Han
Venue: Proceedings of the 6th VLDB Workshop on Secure Data Management (2009)

Provenance access control has been recognized as one of the most important components in an enterprise-level provenance system. However, it has only received little attention in the context of data security research. One important challenge in provenance access control is the lack of an access control language that supports its specific requirements, e.g., the support of both fine-grained policies and personal preferences, and decision aggregation from different applicable policies. In this paper, we propose an access control language tailored to these requirements.
SUNNY: a new algorithm for trust inference in social networks using probabilistic confidence models
Authors: Ugur Kuter, Jennifer Golbeck
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

In many computing systems, information is produced and processed by many people. Knowing how much a user trusts a source can be very useful for aggregating, filtering, and ordering of information. Furthermore, if trust is used to support decision making, it is important to have an accurate estimate of trust when it is not directly available, as well as a measure of confidence in that estimate. This paper describes a new approach that gives an explicit probabilistic interpretation for confidence in social networks. We describe SUNNY, a new trust inference algorithm that uses a probabilistic sampling technique to estimate our confidence in the trust information from some designated sources. SUNNY computes an estimate of trust based on only those information sources with high confidence estimates. In our experiments, SUNNY produced more accurate trust estimates than the well known trust inference algorithm TIDALTRUST (Golbeck 2005), demonstrating its effectiveness.
On the dispersion measure of OWA operators
Authors: Ronald R. Yager
Venue: Information Sciences: an International Journal (2009)

We describe some basic features of the OWA operator. We turn to the problem of determining the weights associated with this operator and particularly the maximal dispersion (entropy) approach. We consider the possibility of using minimization of dispersion. After discussing concerns with both maximization and minimization of dispersion we investigate the possibility of finding an optimal solution intermediate to these extremes. We next consider alternative measures of dispersion. We introduce a fundamental requirement for a measure of dispersion called the Preference for Equal Division. A number of general classes of dispersion measures are provided notable among these are those based on t-norm and t-conorm operators.
A Model of Temporally Changing User Behaviors in a Deployed Spoken Dialogue System
Authors: Kazunori Komatani, Tatsuya Kawahara, Hiroshi G. Okuno
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

User behaviors on a system vary not only among individuals but also within the same user when he/she gains experience on the system. We empirically investigated how individual users changed their behaviors on the basis of long-term data, which were collected by our telephone-based spoken dialogue system deployed for the open public over 34 months. The system was repeatedly used by citizens, who were each identified by their phone numbers. We conducted an experiment by using these data and showed that prediction accuracy of utterance-understanding errors improved when the temporal change was taken into consideration. This result showed that modeling temporally changing user behaviors was helpful in improving the performance of spoken dialogue systems.
Perspective---Cognitive Reactions to Rare Events: Perceptions, Uncertainty, and Learning
Authors: William H. Starbuck
Venue: Organization Science (2009)

Research provides some observations about learning from events that appear to be rare or quite unusual. All learning has uncertain consequences, but learning from rare events is especially problematic. Learners see many idiosyncrasies and exogenous interference, tendencies that suppress learning on an organizational scale. Rare events also rouse uncertainty and bring on reactions to uncertainty such as wishful thinking, reliance on prior beliefs, biased probabilities, a search for more data, cautious action, and playing to audiences. The most important contingencies affecting these reactions are the content and strength of prior beliefs: people are unlikely to learn if they think they have nothing to learn. Although learning from rare events is statistically unusual, and effective learning from rare events is rare, both individuals and organizations can benefit significantly from active efforts to learn from rare events.
Finite gap Jacobi matrices: An announcement
Authors: Jacob S. Christiansen, Barry Simon, Maxim Zinchenko
Venue: Journal of Computational and Applied Mathematics (2009)

We consider Jacobi matrices whose essential spectrum is a finite union of closed intervals. We focus on Szego's theorem, Jost solutions, and Szego asymptotics for this situation. This announcement describes talks the authors gave at OPSFA 2007.
Regional Pattern Discovery in Geo-referenced Datasets Using PCA
Authors: Oner Ulvi Celepcikay, Christoph F. Eick, Carlos Ordonez
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

Existing data mining techniques mostly focus on finding global patterns and lack the ability to systematically discover regional patterns. Most relationships in spatial datasets are regional; therefore there is a great need to extract regional knowledge from spatial datasets. This paper proposes a novel framework to discover interesting regions characterized by "strong regional correlation relationships" between attributes, and methods to analyze differences and similarities between regions. The framework employs a two-phase approach: it first discovers regions by employing clustering algorithms that maximize a PCA-based fitness function and then applies post processing techniques to explain underlying regional structures and correlation patterns. Additionally, a new similarity measure that assesses the structural similarity of regions based on correlation sets is introduced. We evaluate our framework in a case study which centers on finding correlations between arsenic pollution and other factors in water wells and demonstrate that our framework effectively identifies regional correlation patterns.
A Multi-Strategy Approach to KNN and LARM on Small and Incrementally Induced Prediction Knowledge
Authors: Juihsi Fu, Singling Lee
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Most classification problems assume that there are sufficient training sets to induce the prediction knowledge. Few studies are focused on the label prediction according to the small knowledge. Hence, a classification algorithm in which the prediction knowledge is induced by only few training instances at the initial stage and is incrementally expanded by following verified instances is presented. We have shown how to integrate kNN and LARM methods to design a multi-strategy classification algorithm. In the experiments on edoc collection, we show that the proposed method improves 4% in accuracy of low-confidence results of kNN prediction and 8% in accuracy of results of the dominant class bias of LARM prediction. We also show experimentally that the proposed method obtains enhanced classification accuracy and achieves acceptable performance efficiency.
Optical Image Encryption Scheme Based on Multiple-parameter Random Fractional Fourier Transform
Authors: Nanrun Zhou, Taiji Dong
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

A new method for image encryption with multiple-parameter random fractional Fourier transform (MPRFrFT) is presented. By randomizing the transform kernel of the basic function from multiple-parameter fractional Fourier transform, MPRFrFT inherits the excellent mathematical properties of the fractional Fourier transform. The proposed MPRFrFT image encryption algorithm includes five parameters, i.e., keys. An optical realization for MPRFrFT image encryption is provided. Simulation results verify the feasibility and superior robustness to blind decryption of the method.
Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility
Authors: Alex J. Ruiz-Torres, José H. Ablanedo-Rosas, Johnny C. Ho
Venue: Computers and Operations Research (2010)

In this paper, we propose a reformulation for the flowshop problem based on the concept of operation to workstation flexibility. While we assume a fixed sequence of operations in the reformulation, the ''location'' of each operation within the flow is not fixed. The proposed flowshop problem is important because the effective use of this flexibility can lead to significant changes in production performance. Solving the proposed problem involves two sub-problems: assignment of operations to workstations and sequencing of the jobs. We present a lower bound procedure and efficient solution approaches to solve each sub-problem. Furthermore, an improvement method based on neighborhood search and simulated annealing is implemented. A set of experiments is analyzed under different combinations of the proposed heuristics achieving high quality results. These experiments demonstrate that the heuristic factor is of significance for the problem.
Isometric Deformation Modelling for Object Recognition
Authors: Dirk Smeets, Thomas Fabry, Jeroen Hermans, Dirk Vandermeulen, Paul Suetens
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

We present two methods for isometrically deformable object recognition. The methods are built upon the use of geodesic distance matrices (GDM) as an object representation. The first method compares these matrices by using histogram comparisons. The second method is a modal approach. The largest singular values or eigenvalues appear to be an excellent shape descriptor, based on the comparison with other methods also using the isometric deformation model and a general baseline algorithm. The methods are validated using the TOSCA database of non-rigid objects and a rank 1 recognition rate of 100% is reported for the modal representation method using the 50 largest eigenvalues. This is clearly higher than other methods using an isometric deformation model. 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
A 122 TΩ Hz transimpedance bandwidth product BiCMOS optical sensor front-end with a 54.7 dB voltage-controlled photo-sensitivity range
Authors: Nikša Tadić, Artur Marchlewski, Horst Zimmermann
Venue: Analog Integrated Circuits and Signal Processing (2009)

An optical sensor front-end with integrated PIN photodiode in 0.6 &mu;m BiCMOS technology intended for universal optical storage operation is presented. It is based on a mixed current conveyor and voltage amplifiers topology avoiding stability problems. The transimpedance is continuously variable and directly proportional to a voltage-controlled resistance. Another voltage-controlled resistor within a variable-gain voltage amplifier increases the photo-sensitivity range. A fixed-gain voltage amplifier and a current biasing of the current conveyor enable frequency bandwidth enhancement leading to a large transimpedance bandwidth product. A linearity error smaller than 2.8%, a photo-sensitivity range of 541 (54.7 dB) with the largest photo-sensitivity of 2468 mV/&mu;W, an offset voltage <13.7 mV, a frequency bandwidth up to 277 MHz, a slew rate up to 377 V/&mu;s, a transimpedance bandwidth product up to 122 TΩ Hz, and a maximum power consumption of <4.3 mW are achieved.
Small Clique Detection and Approximate Nash Equilibria
Authors: Lorenz Minder, Dan Vilenchik
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ¿, an ¿-best ¿-approximate Nash equilibrium can be found in polynomial time in two-player games, then it is also possible to find a planted clique in G n, 1/2 of size C logn, where C is a large fixed constant independent of ¿. In this paper, we extend their result to show that if an ¿-best ¿-approximate equilibrium can be efficiently found for arbitrarily small ¿> 0, then one can detect the presence of a planted clique of size (2 + ¿) logn in G n, 1/2 in polynomial time for arbitrarily small ¿> 0. Our result is optimal in the sense that graphs in G n, 1/2 have cliques of size (2 ¿ o(1)) logn with high probability.
A Study on the Design of Augmented Reality User Interfaces for Mobile Learning Systems in Heritage Temples
Authors: Kuo-Hsiung Wang, Li-Chieh Chen, Po-Ying Chu, Yun-Maw Cheng
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

In order to reduce switching attention and increase the performance and pleasure of mobile learning in heritage temples, the objective of this research was to employ the technology of Augmented Reality (AR) on the user interfaces of mobile devices. Based on field study and literature review, three user interface prototypes were constructed. They both offered two service modes but differed in the location of navigation bars and text display approaches. The results of experiment showed that users preferred animated and interactive virtual objects or characters with sound effects. In addition, transparent background of images and text message boxes were better. The superimposed information should not cover more than thirty percents of the screen so that users could still see the background clearly.
The Cost of Stability in Network Flow Games
Authors: Ezra Resnick, Yoram Bachrach, Reshef Meir, Jeffrey S. Rosenschein
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

The core of a cooperative game contains all stable distributions of a coalition's gains among its members. However, some games have an empty core, with every distribution being unstable. We allow an external party to offer a supplemental payment to the grand coalition, which may stabilize the game, if the payment is sufficiently high. We consider the cost of stability (CoS)--the minimal payment that stabilizes the game.We examine the CoS in threshold network flow games (TNFGs), where each agent controls an edge in a flow network, and a coalition wins if the maximal flow it can achieve exceeds a certain threshold. We show that in such games, it is coNP-complete to determine whether a given distribution (which includes an external payment) is stable. Nevertheless, we show how to bound and approximate the CoS in general TNFGs, and provide efficient algorithms for computing the CoS in several restricted cases.
Computational thinking: what is it, how is it relevant, who's doing what with it?
Authors: Robert Bryant, Donald Chinn, George Hauser, Michele Folsom, Scott Wallace
Venue: Journal of Computing Sciences in Colleges (2009)

Since Jeannette Wing wrote her opinion paper on Computational Thinking in 2006 [1], there has been much discussion about the idea of making computational thinking a central component of the effort to expose the field of computing to all disciplines. This panel will cover national and local efforts taking place in universities to bring computational thinking to the forefront of all disciplines that use computing in their field.