ppxscal/embedding_network huggingface dataset:
Vibrotactile feedback system for intuitive upper-limb rehabilitation
Authors: Pulkit Kapur, Sunthar Premakumar, Steven A. Jax, Laurel J. Buxbaum, Amanda M. Dawson, Katherine J. Kuchenbecker
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

The proposed demonstration stems from research on a low cost haptic virtual interaction platform for upper-limb rehabilitation. This work centers on the use of vibrotactile feedback in a virtual environment to help stroke patients perform simple repetitive motions and thereby overcome motor planning deficits. The device to be demonstrated consists of a sleeve with embedded optical markers and vibration actuators. When in use, the system has three main functions: it continually measures the configuration of the patient's arm in space, it provides graphical feedback about the desired arm configuration and the user's current arm configuration on a computer monitor, and it provides intuitive vibrotactile cues to guide the user's arm into the target configuration.
Improving the automated monitoring of dairy cows by integrating various data acquisition systems
Authors: Paolo Liberati, Paolo Zappavigna
Venue: Computers and Electronics in Agriculture (2009)

The study analyses the possibility of improving the automated monitoring of dairy cows by combining the data given by various measurement systems already existing on farms. On a dairy farm where two groups of cows were monitored by different commercial systems, all the measured parameters were collected over 5 months: group A was milked in a traditional parlour equipped with instruments measuring milk production, flow and animal activity; group B was milked by an AMS (automatic milking system) measuring milk production and flow, milk electrical conductivity (per quarter), and animal activity. For each group all the monitoring systems were connected in a network and their data managed by means of a dedicated software. The acquired parameters were first treated to obtain alarms when their standard deviation exceeded a pre-determined threshold. All the animals giving such alarms were then inspected by the farm personnel and the respective normal or not normal (oestrus or pathology) conditions ascertained. Afterwards two models were developed aimed at detecting the animals' abnormalities: one based on linear discriminant analysis, one based on fuzzy logic. The reliability of these models in detecting the relevant animal conditions was verified by comparing the alarms given by each method with the results of the farm observations. Both models were not very accurate in detecting specific abnormalities, but the model based on fuzzy logic was very effective in detecting general abnormal statuses and was also capable of producing warnings on so far undetected abnormalities in advance.
Role Engineering for Enterprise Security Management, 1st edition
Authors: Edward J. Coyne, John M. Davis
Venue: Information Security And Privacy (2007)

Whether you are a manager, engineer, or IT security specialist, this authoritative resource shows you how to define and deploy roles for securing enterprise systems. Written by leading authorities in the field, the book explains how you can build a business case, identify risks, determine project costs, and fully plan and staff a role engineering effort. You find practical techniques that meaningfully define roles and ensure proper assignment of permissions and roles to users. The book presents tools that enable you to capture permissions and user assignments from existing systems, and analyze user and permission data in scenarios simulating actual system use. Moreover, this practical reference helps you evaluate these tools and decide which ones are right for your own role engineering program. The book also shows how to verify that role structures comply with security policies. You find tips and insights from real-world projects that guarantee you engineer roles strategically and securely.
Specifying features of an evolving software system
Authors: Thein Than Tun, Tim Trew, Michael Jackson, Robin Laney, Bashar Nuseibeh
Venue: Software&mdash;Practice Experience (2009)

Software development is increasingly concerned with maintaining and extending existing software systems to meet the evolving user requirements. Many of these systems are feature-rich and are developed incrementally. As structures of existing software systems&mdash;in addition to the user requirements&mdash;influence the specifications, specifying these systems poses unique challenges. This paper reports on our experience of applying an engineering approach to specifying an evolving feature-rich television software system. In this approach, features are specified modularly by first fitting their problems to known problem patterns, and then analyzing typical concerns&mdash;meaning the potential causes of errors&mdash;associated with those patterns. In cases where the existing design poses difficulties when fitting problems to patterns, we transform its structure using known design mechanisms so that the problems fit the patterns. After deriving specifications of individual features, possible interactions between features are detected, before declaratively specifying resolutions to undesired interactions. As the concerns of features and their composition are addressed separately, the specifications derived are modular, thus, providing rich treaceability to their requirements. As well as discussing how features may be specified using natural language, we also show how their descriptions may be formalized using a form of temporal logic called the Event Calculus, and prove their correctness using an off-the-shelf tool. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Multimodal and Textual Analysis of Students' Digital Artifacts
Authors: Uma Natarajan, Muthu Kumar, Libo Guo
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This paper evolves as part of a project termed the Digital Curricular Literacies (DCL) at the Centre for Research in Pedagogy and Practice (CRPP), National Institute of Education, Singapore. In this study we aim to analyse the students' digital artifacts that were produced by secondary school students during their work on a curriculum related task in History and Science. We will briefly describe the relevant theoretical basis for our coding scheme and the instrument that we have used to analyze the students' digital work before presenting the findings. The coding scheme will specifically look into the different text types and the aspects of multimodality in the artifacts. Seven schools participated in this study and students were paired up to collaboratively to work on a stipulated task that was based on History or Science. They were asked to search for information online and synthesize an artifact digitally using Microsoft Word or Powerpoint. They could present their work using any number and type of modes.
Transitive, Locally Finite Median Graphs with Finite Blocks
Authors: Wilfried Imrich, Sandi Klav&#x017e;ar
Venue: Graphs and Combinatorics (2009)

The subject of this paper are infinite, locally finite, vertex-transitive median graphs. It is shown that the finiteness of the &#x0398;-classes of such graphs does not guarantee finite blocks. Blocks become finite if, in addition, no finite sequence of &#x0398;-contractions produces new cut-vertices. It is proved that there are only finitely many vertex-transitive median graphs of given finite degree with finite blocks. An infinite family of vertex-transitive median graphs with finite intransitive blocks is also constructed and the list of vertex-transitive median graphs of degree four is presented.
ZEXE.NET, a case study of video-moblog
Authors: Tatiana Mazali
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

The information and communication technology system is constantly creating new scenarios, but can still recognise a tendency in them: the blurring of the limits between consumers and producers and the passage from interactivity to participation (web 2.0). In this emerging cultural context, that is constantly redefined and remediated by individual and personalized forms of elaboration, it is important to understand the way in which every single person or group leads his/her own way towards re-appropriation of the technological realm. My contribution aims to explore potential and real capacities of these new technologies to generate a creative use among individuals or collectivities. For this reason, I'll analyse a case study, the mobile-blog communities in ZEXE.NET project. The aim of my contribution is to draw a portrait, to give a picture, of this social platform built by the artist Antoni Abad.
Agent-Based Dantzig-Wolfe Decomposition
Authors: Johan Holmgren, Jan A. Persson, Paul Davidsson
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

We present an agent-based approach to Dantzig-Wolfe column generation (a decomposition approach), which is applied to an integrated production, inventory, and distribution routing optimization problem. The decomposition model has been implemented in the Java programming language, using the Java Agent DEvelopment Framework (JADE) and the ILOG CPLEX mixed integer linear optimization problem solver. The model has been validated on a set of realistic scenarios and based on the results, we estimate the potential performance improvement which can be obtained by using a completely distributed implementation. We analyze the overhead, in terms of communication costs, that is imposed by an agent-based approach.
The Kurosawa--Desmedt key encapsulation is not chosen-ciphertext secure
Authors: Seung Geol Choi, Javier Herranz, Dennis Hofheinz, Jung Yeon Hwang, Eike Kiltz, Dong Hoon Lee, Moti Yung
Venue: Information Processing Letters (2009)

At CRYPTO 2004, Kurosawa and Desmedt presented a new hybrid encryption scheme that is chosen-ciphertext (CCA2) secure in the standard model. Until now it was unknown if the key encapsulation part of the Kurosawa-Desmedt scheme by itself is still CCA2-secure or not. In this note we answer this question to the negative, namely we present a simple CCA2 attack on the Kurosawa-Desmedt key encapsulation mechanism. Our attack further supports the design paradigm of Kurosawa and Desmedt to build CCA2-secure hybrid encryption from weak key encapsulation.
PAC-Bayesian learning of linear classifiers
Authors: Pascal Germain, Alexandre Lacasse, François Laviolette, Mario Marchand
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We present a general PAC-Bayes theorem from which all known PAC-Bayes risk bounds are obtained as particular cases. We also propose different learning algorithms for finding linear classifiers that minimize these bounds. These learning algorithms are generally competitive with both AdaBoost and the SVM.
Bandwidth reservation using velocity and handoff statistics for cellular networks
Authors: Chuan-Lin Zhang, Kam Yiu Lam, Wei-Jia Jia
Venue: Journal of Computer Science and Technology (2006)

The percentages of blocking and forced termination rates as parameters representing quality of services (QoS) requirements are presented. The relation between the connection statistics of mobile users in a cell and the handoff number and new call number in next duration in each cell is explored. Based on the relation, statistic reservation tactics are raised. The amount of bandwidth for new calls and handoffs of each cell in next period is determined by using the strategy. Using this method can guarantee the communication system suits mobile connection request dynamic. The QoS parameters: forced termination rate and blocking rate can be maintained steadily though they may change with the offered load. Some numerical experiments demonstrate this is a practical method with affordable overhead.
Transferring knowledge between implementers when building inter-organisational information systems
Authors: Raija Halonen
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

Transferring knowledge is a real challenge especially when there are many independent organisations involved in developing an information system. This research tries to find out how the core challenge is met in this context. The research material is collected in a case where several universities were involved in implementing an information system to support student mobility between them. We concentrate on building interface between two information systems when distinct parties were on charge. The special nature of academia is emphasised in the research because there is no organisational command lines between different departments in universities. This character adds the need for interaction and communication in the project.
Single View Metrology: A Practical Example
Authors: Paulo R. S. Mendonca, Robert Kaucic
Venue: Proceedings of the 2008 IEEE Workshop on Applications of Computer Vision (2008)

In machine vision applications it is often desirable to make metric measurements with a single camera. However, operational constraints can limit the use of off-line calibration methods and the lack of reference planes can prevent the use of current single-view metrology techniques. In this paper, we describe the design, implementation, and validation of a visual inspection system for the measurement of angles from a single, uncalibrated camera. We provide a step-by-step, single-view metrology approach which we demonstrate in an operational setting. Werst assess the imaging conditions present using hypothesis testing based on a norm-induced metric between possible world to image mappings. Our metric provides a measure of localization error derived from physical measures in the world. The hypothesis testing demonstrates that af ne viewing conditions are present in our setting and we show how the affine approximation can be used to make measurements of points off the plane of interest. We employ our algorithm in a manufacturing plant to make blade angle measurements of variable stator vanes in jet engines.
Multi-agent System for Recognition of Hand Postures
Authors: Mariusz Flasiński, Janusz Jurek, Szymon Myśliński
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

A multi-agent system for a recognition of hand postures of the Polish Sign Language is presented in the paper. The system is based on a syntactic pattern recognition approach, namely on parsable ETPL(k) graph grammars. An occurrence of a variety of styles of performing hand postures requires an introduction of many grammar productions that differ each from other slightly. This makes a construction of a grammar within a parsable class ETPL(k) dubious. Dividing a whole grammar into sub-grammars and distributing them to agents allows one to solve the problem.
What Is a Real-World SAT Instance?
Authors: Carlos Ansótegui, María Luisa Bonet, Jordi Levy, Felip Manyà
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

Frequently, in the SAT and CSP communities, people talk about real-world problems, without any formal or precise definition of what “real-world” means. This notion is used as opposed to randomly generated problems and theoretical combinatorial principles, like the pigeonhole. People agree that modern SAT and CSP solvers perform well in these real-world problems with a hidden structure, and more so as more intelligent are the strategies used on them. Here we define a formal notion, called the Strahler number, that measures the degree of structure of an unsatisfiable SAT instance. We argue why this notion corresponds to the informal idea of real-world problem. If a formula has an small Strahler number, then it has a lot of structure, and it is easy to prove it, even if it has many variables. We prove that there is a SAT solver, the Beame-Pitassi algorithm [2], that works on time O(ns), being n the number of variables, and s the Strahler of the formula. We also show that Horn and 2-SAT unsatisfiable formulas, that can be solved in polynomial time, have Strahler number 1 and 2 respectively. We compare the Strahler number with other notions defined with the same purpose like backdoors [15], and prove that the Strahler number can be arbitrarily smaller than the size of strong backdoors. We show the same relation for the size of cycle-cutsets and the treewidth in tree decompositions. Finally, we compare with the space of resolution calculus, defined for a different purpose.
Fast solving of weighted pairing least-squares systems
Authors: Pierre Courrieu
Venue: Journal of Computational and Applied Mathematics (2009)

This paper presents a generalization of the ''weighted least-squares'' (WLS), named ''weighted pairing least-squares'' (WPLS), which uses a rectangular weight matrix and is suitable for data alignment problems. Two fast solving methods, suitable for solving full rank systems as well as rank deficient systems, are studied. Computational experiments clearly show that the best method, in terms of speed, accuracy, and numerical stability, is based on a special {1, 2, 3}-inverse, whose computation reduces to a very simple generalization of the usual ''Cholesky factorization-backward substitution'' method for solving linear systems.
Using Bayesian networks with rule extraction to infer the risk of weed infestation in a corn-crop
Authors: Gláucia M. Bressan, Vilma A. Oliveira, Estevam R. Hruschka,  Jr., Maria C. Nicoletti
Venue: Engineering Applications of Artificial Intelligence (2009)

This paper describes the modeling of a weed infestation risk inference system that implements a collaborative inference scheme based on rules extracted from two Bayesian network classifiers. The first Bayesian classifier infers a categorical variable value for the weed-crop competitiveness using as input categorical variables for the total density of weeds and corresponding proportions of narrow and broad-leaved weeds. The inferred categorical variable values for the weed-crop competitiveness along with three other categorical variables extracted from estimated maps for the weed seed production and weed coverage are then used as input for a second Bayesian network classifier to infer categorical variables values for the risk of infestation. Weed biomass and yield loss data samples are used to learn the probability relationship among the nodes of the first and second Bayesian classifiers in a supervised fashion, respectively. For comparison purposes, two types of Bayesian network structures are considered, namely an expert-based Bayesian classifier and a naive Bayes classifier. The inference system focused on the knowledge interpretation by translating a Bayesian classifier into a set of classification rules. The results obtained for the risk inference in a corn-crop field are presented and discussed.
Can a Robot Intentionally Conduct Mutual Communication with Human Beings?
Authors: Kayoko Ishii
Venue: Proceeding of the 2008 conference on Current Issues in Computing and Philosophy (2008)

The question of whether a robot can communicate with human beings evokes another question: How can human beings have the feeling that they are usually successful in mutual communication? This question may be answered because the emergence of the mind of individuals and 'the mind of community' are not completely separable. The mind of the community may precede the mind of the individual in society. Complex mechanisms of the emergence of the mind of the community and that of the individual may be effectively studied with Cognitive Robotics in Japan. To promote the study, I develop a hypothesis named “a fabulous game of human beings,” in which each individual can guess the contents of her/his mind effectively by reading the attitudes and mind of others.
Consumer-Oriented Incoming Call Connection Service for a Ubiquitous Consumer Wireless World
Authors: Ivan Ganchev, Máirtín S. O'Droma, Ning Wang
Venue: Wireless Personal Communications: An International Journal (2009)

This paper proposes an architecture and protocol infrastructure for a novel consumer-oriented incoming call connection (ICC) service. In the ubiquitous consumer wireless world (UCWW) this service is one of the core services requiring new infrastructural solutions for its realisation. The solution proposed here, besides realising the service, will offer mobile users greater flexibility and management control over incoming calls, enable users to receive incoming calls via multiple access networks/providers through a single identity, enable user-driven, seamless, network-transparent hot access network change (HAC), largely end roaming charges and create a new wireless networking business opportunity among other benefits. The main components and interfaces of the ICC service architecture and infrastructure are described, and protocol candidates are suggested. A generic consumer-oriented ICC service scenario is elaborated theoretically, implemented and experimentally verified for voice over IP (VoIP) connections in a testbed environment which includes network-transparent HAC. Two distinct ICC operational modes are identified and compared in respect of relative signaling latency and processing resources for a number of key functions such as session setup and release, and HAC.
Signal transduction networks in biological systems based on Michaelis-Menten equation and S-system
Authors: Yuan-Wei Liu, Ching-Kun Chen, Chun-Liang Lin
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

Signal transduction networks of biological systems are highly complex. How to mathematically describe a signal transduction network by systematic approaches so as to further exploit an appropriate control strategy is attractive to control engineers. In this preliminary study, a mathematical model of signal transduction networks is presented.
Two blocking algorithms on adaptive binary splitting: single and pair resolutions for RFID tag identification
Authors: Yuan-Cheng Lai, Chih-Chung Lin
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

In radio frequency identification (RFID) systems, the reader identifies tags through communication over a shared wireless channel. When multiple tags transmit their IDs simultaneously, their signals collide, increasing the identification delay. Therefore, many previous anti-collision algorithms, including an adaptive query splitting algorithm (AQS) and an adaptive binary splitting algorithm (ABS), focused on solving this problem. This paper proposes two blocking algorithms, a single resolution blocking ABS algorithm (SRB) and a pair resolution blocking ABS algorithm (PRB), based on ABS. SRB not only inherits the essence of ABS which uses the information of recognized tags obtained from the last process of tag identification, but also adopts a blocking technique which prevents recognized tags from being collided by unrecognized tags. PRB further adopts a pair resolution technique which couples recognized tags and thus only needs half time for next identifying these recognized tags. We formally analyze the performance of SRB and PRB. Finally, the analytic and simulation results show that SRB slightly outperforms ABS and PRB significantly surpasses ABS.