ppxscal/embedding_network huggingface dataset:
The ISL RT-07 Speech-to-Text System
Authors: Matthias Wölfel, Sebastian Stüker, Florian Kraft
Venue: Multimodal Technologies for Perception of Humans: International Evaluation Workshops CLEAR 2007 and RT 2007, Baltimore, MD, USA, May 8-11, 2007, Revised Selected Papers (2008)

This paper describes the 2007 meeting speech-to-text system for lecture rooms developed at the Interactive Systems Laboratories (ISL), for the multiple distant microphone condition, which has been evaluated in the RT-07 Rich Transcription Meeting Evaluation sponsored by the US National Institute of Standards and Technologies (NIST). We describe the principal differences between our current system and those submitted in previous years, namely the use of a signal adaptive front-end (realized by warped-twice warped minimum variance distortionless response spectral estimation), improved acoustic (including maximum mutual information estimation) and language models, cross adaptation between systems which differ in the front-end as well as the phoneme set, the use of a discriminative criteria instead of the signal-to-noise ratio for the selection of the channel to be used and the use of decoder based speech segmentation.
Contextual Recommendation
Authors: Sarabjot Singh Anand, Bamshad Mobasher
Venue: From Web to Social Web: Discovering and Deploying User and Content Profiles: Workshop on Web Mining, WebMine 2006, Berlin, Germany, September 18, 2006. Revised Selected and Invited Papers (2007)

The role of context in our daily interaction with our environment has been studied in psychology, linguistics, artificial intelligence, information retrieval, and more recently, in pervasive/ubiquitous computing. However, context has been largely ignored in research into recommender systems specifically and personalization in general. In this paper we describe how context can be brought to bear on recommender systems. As a means for achieving this, we propose a fundamental shift in terms of how we model a user within a recommendation system: inspired by models of human memory developed in psychology, we distinguish between a user's short term and long term memories, define a recommendation process that uses these two memories, using context-based retrieval cues to retrieve relevant preference information from long term memory and use it in conjunction with the information stored in short term memory for generating recommendations. We also describe implementations of recommender systems and personalization solutions based on this framework and show how this results in an increase in recommendation quality.
Control circuits simplification and computer programs design on bipedal robot
Authors: P. S. Pa
Venue: Robotics and Computer-Integrated Manufacturing (2008)

This study is expected to provide the best design of bipedal robot, which will help widen the application in the future. A new design system is presented through simplification of the control circuit, and the design of computer programs not only lowers the research barriers of the robots but also decreases the development costs. This design system can be used for various operations of manufacturing processes to make up the shortages of the flexibility for the robots. In recent years, the progress in electronics and the control technology has made the robots useful not only for dangerous and automatic tasks, but also for advanced and friendly people service. Thus, the robots have been used in the factories for automation and towards the general use in regular life. Of all robots, the bipedal robot attracts the most attention for its humanoid outlook, user-friendly design, and artificial intelligence for the human society. Many bipedal robots are developed to satisfy consumers' needs. The control circuits and the program design are the key issues to make the bipedal robots. In this study, a synchronous robot controller for 31^o-axis freedom is developed. The authors also equip a memory in the hardware architecture to store all moving commands of the bipedal robot. In terms of internal programs, the authors develop a human interface that synchronizes the movement of the robot and collects the pace data of the robot. The authors use the statistical method to analyze the data and establish a database of the robot's movement. With the database, one can finally drive the robot to walk and generate the pace design of the bipedal robots.
Resolution Width and Cutting Plane Rank Are Incomparable
Authors: Mark Rhodes
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

We demonstrate that the Cutting Plane (CP) rank of a polytope defined by a system of inequalities derived from a set of unsatisfiable clauses can be arbitrarily larger than the Resolution width of the clauses, thus demonstrating the two measures are incomparable. More specifically, we show there exists an infinite family of unsatisfiable clauses defined over n ¿ ¿, which have constant Resolution width, but, yield polytopes which have CP rank ¿(log2 n).
An Improvement of Park-Chung-Cho's Stream Authentication Scheme by Using Information Dispersal Algorithm
Authors: Seok-Lae Lee, Yongsu Park, Joo-Seok Song
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

We present an efficient stream authentication scheme that improves the verification probability of Park-Chung-Cho's scheme [1] by using Rabin's Information Dispersal Algorithm. It is shown that under the same communication overhead the verification probability of the proposed scheme is higher than those of SAIDA as well as Park-Chung-Cho's scheme, and that the execution time of the proposed scheme is smaller than that of SAIDA.
A Robust Localization Method for Mobile Robots Based on Ceiling Landmarks
Authors: Viet Thang Nguyen, Moon Seok Jeong, Sung Mahn Ahn, Seung Bin Moon, Sung Wook Baik
Venue: Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence (2007)

In this paper, we propose a robust method for the process of localization of a mobile robotthrough a vision system. The mobile robot is a compact system consisting of an embedded board and a fish-eye camera. The fish-eye camera looks upward to capture ceiling images. The camera provides a sequence of images for the process of detection and tracking ceiling features. These features are used like natural landmarks to detect the state of translation and rotation of the robot. Our method requires less computational power and resources for a robot, and thus can be used at home. The results produced in this study showed the advantages of our method in terms of both speed and accuracy.
A Fast Algorithm to Find Overlapping Communities in Networks
Authors: Steve Gregory
Venue: Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I (2008)

Many networks possess a community structure, such that vertices form densely connected groups which are more sparsely linked to other groups. In some cases these groups overlap, with some vertices shared between two or more communities. Discovering communities in networks is a computationally challenging task, especially if they overlap. In previous work we proposed an algorithm, CONGA, that could detect overlapping communities using the new concept of split betweenness. Here we present an improved algorithm based on a local form of betweenness, which yields good results but is much faster. It is especially effective in discovering small-diameter communities in large networks, and has a time complexity of only O(n log n) for sparse networks.
Ontologies and Data Integration in Biomedicine: Success Stories and Challenging Issues
Authors: Olivier Bodenreider
Venue: Proceedings of the 5th international workshop on Data Integration in the Life Sciences (2008)

In this presentation, we review some examples of successful biomedical data integration projects in which ontologies play an important role, including the integration of genomic data based on Gene Ontology annotations, the cancer Biomedical Informatics Grid (caBIG) project, and semantic mashups created by the Semantic Web for Health Care and Life Sciences community.
Quantum-Adaptive Scheduling for Multi-Core Network Processors
Authors: Yue Zhang, Bin Liu, Lei Shi, Jingnan Yao, Laxmi Bhuyan
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Efficiency and effectiveness are always the emphases of a scheduler, for both link and processor scheduling. Well-known scheduling algorithms such as Surplus Round Robin (SRR) and Elastic Round Robin (ERR) suffer from two fold shortcomings: 1) additional pre-processing queuing delay and post-processing resequencing delay are incurred due to the lack of short-term load-balancing; 2) bursty scheduling is caused due to blind preservation of scheduling history under non-backlogged traffic. In this paper, we propose a Quantum-Adaptive Scheduling (QAS) algorithm, which: 1) synchronizes all the quanta in a fine-grained manner and, 2) adjusts the quanta intelligently based on processor utilization. We theoretically prove that the Queuing Fairness Bound (QFB) for QAS is one third tighter than SRR and ERR. This result approaches the optimal value as obtained in Shortest Queue First (SQF) algorithm, while still maintaining O(1) complexity. Trace-driven simulations show that QAS reduces average packet delay by 18%~24% while cutting down the resequencing buffer size by more than 40% compared to SRR and ERR.
A Genetic Algorithm for Text Classification Rule Induction
Authors: Adriana Pietramala, Veronica L. Policicchio, Pasquale Rullo, Inderbir Sidhu
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

This paper presents a Genetic Algorithm, called Olex-GA, for the induction of rule-based text classifiers of the form "classify document d under category c if t 1 ¿ d or ... or t n ¿ d and not (t n + 1 ¿ d or ... or t n + m ¿ d) holds", where each t i is a term. Olex-GA relies on an efficient several-rules-per-individual binary representation and uses the F-measure as the fitness function. The proposed approach is tested over the standard test sets Reuters-21578 and Ohsumed and compared against several classification algorithms (namely, Naive Bayes, Ripper, C4.5, SVM). Experimental results demonstrate that it achieves very good performance on both data collections, showing to be competitive with (and indeed outperforming in some cases) the evaluated classifiers.
Towards Specifying Multimodal Collaborative User Interfaces: A Comparison of Collaboration Notations
Authors: Frédéric Jourde, Yann Laurillau, Alberto Moran, Laurence Nigay
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

Interactive systems including multiple interaction devices and surfaces for supporting the collaboration of a group of co-located users are increasingly common in various domains. Nevertheless few collaborative and multimodal interface specification notations are proposed. As a first step towards a notation for specifying a design solution prior to its software design and development, we adopt an empirical approach. We applied and compared four existing notations for collaborative systems by considering a case study, namely, a system for supporting informal co-located collaboration in hospital work. This paper reports the conclusions from this empirical comparison.
Sharing of Real-Life Experimental Data in Smart Home and Data Analysis Tool Development
Authors: Tatsuya Yamazaki, Tetsuo Toyomura
Venue: Proceedings of the 6th international conference on Smart Homes and Health Telematics (2008)

Collecting smart environment experimental data in a real situation and sharing the data are necessary to make the technologies used in the smart environment more practical. We have developed a data analysis tool for the real-life experiment data collected in a smart home environment. The subjects of the 16-day experimental data were a couple of husband and wife in their sixties. The data analysis tool as well as the collected data with the consent of the subjects are open for the purpose of research and development. In this paper, we introduce how the data were collected and the outline of the data analysis tool to promote interdisciplinary research and standardization activities in the field of smart environments.
Applying a Rigorous Quasi-Steady State Approximation Method for Proving the Absence of Oscillations in Models of Genetic Circuits
Authors: François Boulier, Marc Lefranc, François Lemaire, Pierre-Emmanuel Morant
Venue: Proceedings of the 3rd international conference on Algebraic Biology (2008)

In this paper, we apply a rigorous quasi-steady state approximation method on a family of models describing a gene regulated by a polymer of its own protein. We study the absence of oscillations for this family of models and prove that Poincaré-Andronov-Hopf bifurcations arise if and only if the number of polymerizations is greater than 8. A result presented in a former paper at Algebraic Biology 2007 is thereby generalized. The rigorous method is illustrated over the basic enzymatic reaction.
A Novel Approach for Security and Robustness in Wireless Embedded Systems
Authors: Mohammad Iftekhar Husain, Shambhu Upadhyaya, Madhusudhanan Chandrasekaran
Venue: Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems (2008)

Security and robustness are paramount in wireless embedded systems due to the vulnerability of the underlying communication medium. To institute security and reliability, most of the existing schemes perform periodic re-establishment of authentication credentials and share secrets among various participating nodes. However, such measures result in overheads in an energy-constrained wireless environment. To alleviate this problem, we propose a software approach that exploits the features of the underlying communication protocol and uses the concept of steganography and covert channels. The highlight of our approach is that it does not require any changes to the protocol and relies only on the modification of frame contents without degrading the protocol performance. We argue that our covert-channel based communication scheme provides security and robustness at low cost and it neither requires centralized authority nor does it disrupt the overall network operation. We evaluate the security benefits of our proposed method in terms of the difficulty of detecting the covert channel by the adversary and compare our technique with other existing schemes. Performance evaluation is done by determining the bandwidth efficiency of the channel, backward compatibility with the standard MAC as well as the ease of implementation.
An Aspect Oriented Approach for Context-Aware Service Domain Adapted to E-Business
Authors: Khouloud Boukadi, Chirine Ghedira, Lucien Vincent
Venue: Proceedings of the 20th international conference on Advanced Information Systems Engineering (2008)

This paper proposes an architecture for a high-level structure called Service Domain which orchestrates a set a of related IT services based on BPEL specification. Service Domain was developed to enhance the Web service concept to suit e-business collaboration. Service Domains are developed to be context aware. Our approach highlights the benefits of bringing Aspect Oriented Programming to ensure context aware services. Thus, context awareness is guaranteed by enhancing BPEL execution using Aspect oriented paradigms. The proposed approach is illustrated with a running example that shows how Service Domain presents different behaviours according to the context changes.
Design and Development Methodology for Resilient Cyber-Physical Systems
Authors: Honguk Woo, Jianliang Yi, James C. Browne, Aloysius K. Mok, Ella Atkins, Fei Xie
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Mission-critical cyber-physical systems must be resilient to all classes of failures, both hardware and software components. Failures affecting a system’s ability to accurately control its physical actions are of special concern, requiring a meta-level monitoring and reaction ability to enable high-performance nominal and safe post-failure operation. This paper addresses these challenges by unifying formal software engineering with a suite of feedback control laws and efficient resource monitoring within a comprehensive design and development methodology.
Inference of Security Hazards from Event Composition Based on Incomplete or Uncertain Information
Authors: Segev Wasserkrug, Avigdor Gal, Opher Etzion
Venue: IEEE Transactions on Knowledge and Data Engineering (2008)

In many security-related contexts, a quick recognition of security hazards is required. Such recognition is challenging, since available information sources are often insufficient to infer the occurrence of hazards with certainty. This requires that the recognition of security hazard is carried out using inference based on patterns of occurrences distributed over space and time. The two main existing approaches to the inference of security hazards are a) custom-coded solutions, which are tailored to specific patterns, and cannot respond quickly to changes in the patterns of occurrences used for inference, and b) approaches based on direct statistical inferencing techniques, such as regression, which do not enable combining various kinds of evidence regarding the same hazard. In this work, we introduce a more generic formal framework which overcomes the aforementioned deficiencies, together with a case study illustrating the detection of DoS attacks.
Types for units-of-measure in f#: invited talk
Authors: Andrew Kennedy
Venue: Proceedings of the 2008 ACM SIGPLAN workshop on ML (2008)

Bugs caused by units-of-measure errors can have catastrophic consequences, the most famous of which was the loss in September 1999 of NASA's Mars Climate Orbiter probe, caused by a confusion between newtons (the SI unit of force) and lbf (the Imperial unit of force). This talk will describe support for static checking and inference of units-of-measure in the F# programming language. From the programmer's perspective, the feature is not intrusive. Numeric constants are annotated with their units, user-defined types may be parameterized on units, and the compiler does the rest, flowing unit-of-measure information through to inferred types. Behind the scenes, there are a number of technical subtleties. The type inference algorithm achieves principal types through the use of (a) Abelian group unification and (b) a change-of-basis procedure when inferring polymorphic types for let-bound variables. Type schemes are presented to the programmer in a consistent style that is related to the Hermite normal form from linear algebra. In addition, there are a number of interesting interactions with F#'s support for object-oriented programming. The talk will of course include a demonstration, and also a selection of case studies in the domains of machine learning, games programming, physics simulation, and finance.
A Case-Based Approach to Intelligent Virtual Agent's Interaction Experience Representation
Authors: Haris Supic
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

In this paper we describe a case-based representation of intelligent virtual agent's interaction experience. This allows us to develop an approach to creation of IVAs by using case-based reasoning. We called this agent CBRIVA. We can define a CBRIVA as an entity that selects the next step based on previous interaction experience. A CBRIVA's interaction experience is represented in the form of the three types of cases: plan, contextual, and action cases.
Further Exploration of the Dendritic Cell Algorithm: Antigen Multiplier and Time Windows
Authors: Feng Gu, Julie Greensmith, Uwe Aickelin
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

As an immune-inspired algorithm, the Dendritic Cell Algorithm (DCA), produces promising performance in the field of anomaly detection. This paper presents the application of the DCA to a standard data set, the KDD 99 data set. The results of different implementation versions of the DCA, including antigen multiplier and moving time windows, are reported. The real-valued Negative Selection Algorithm (NSA) using constant-sized detectors and the C4.5 decision tree algorithm are used, to conduct a baseline comparison. The results suggest that the DCA is applicable to KDD 99 data set, and the antigen multiplier and moving time windows have the same effect on the DCA for this particular data set. The real-valued NSA with contant-sized detectors is not applicable to the data set. And the C4.5 decision tree algorithm provides a benchmark of the classification performance for this data set.
Compact grid: a grid computing system using low resource compact computers
Authors: Takehiko Demiya, Tomoki Yoshihisa, Masanori Kanazawa
Venue: International Journal of Communication Networks and Distributed Systems (2008)

Recently, grid computing has attracted great attention. In grid computing, using multiple computers and executing processes in parallel, we can get great computational power. Grid computing systems usually employ regular computers such as personal computers and workstations. Although general grid computing systems do not focus on compact computers, compact computers face a problem of the lack of computational power. To solve the problem we can reap benefits of grid computing systems. In this paper, we propose a grid computing system using compact computers and develop a new prototype system. The system controls their computational powers so that processes required by the grid computing system do not interrupt commonly assigned processes for compact computers. The main target is realising grid computing, not compact computers. Also, we evaluate the prototype system and confirm the performance.
A Primer in Knowledge Management for Nanoinformatics in Medicine
Authors: Fernando Martín-Sanchez, Victoria López-Alonso, Isabel Hermosilla-Gimeno, Guillermo Lopez-Campos
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

In the last years new scientific knowledge and technological developments derived from the Human Genome Project have been affecting the way in which biomedical research and clinical practice is carried out. This fact has had a profound impact in the current scope and definition of the"biomedical informatics" discipline. The big "genomic wave" boosted efforts in the medical informatics community to adapt its systems and make it possible the integration of "omics" knowledge and bioinformatic tools. Recent advances in another discipline, Nanotechnology, seem to be similarly starting to affect clinical research and practice (nanomedicine). The purpose of this document is to review the state of the art and current developments in nanomedicine and its potential impact on Biomedical Informatics. The authors have recently been granted with an European Commission research project, Action-GRID, that will analyse the field of nanoinformatics with the aim of identifing needs and discuss ongoing challenges and priorities in terms of knowledge management and discovery in nanomedicine.