ppxscal/embedding_network huggingface dataset:
Machine Learning: Modeling Data Locally and Globally, 1 edition
Authors: Kai-Zhu Huang, Hai-Qin Yang, Irwin King, Michael Lyu
Venue: Advanced Topics In Science And Technology In China (2008)

Machine Learning - Modeling Data Locally and Globally presents a novel and unified theory that tries to seamlessly integrate different algorithms. Specifically, the book distinguishes the inner nature of machine learning algorithms as either "local learning"or "global learning."This theory not only connects previous machine learning methods, or serves as roadmap in various models, but more importantly it also motivates a theory that can learn from data both locally and globally. This would help the researchers gain a deeper insight and comprehensive understanding of the techniques in this field. The book reviews current topics,new theories and applications. Kaizhu Huang was a researcher at the Fujitsu Research and Development Center and is currently a research fellow in the Chinese University of Hong Kong. Haiqin Yang leads the image processing group at HiSilicon Technologies. Irwin King and Michael R. Lyu are professors at the Computer Science and Engineering department of the Chinese University of Hong Kong.
Location-Aware Computing Comes of Age
Authors: Mike Hazas, James Scott, John Krumm
Venue: Computer (2004)

The widespread deployment of sensing technologies will make location-aware applications part of everyday life.
A Profile Modelling Approach for E-Learning Systems
Authors: Corrado Mencar, Ciro Castiello, Anna Maria Fanelli
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

This paper presents a user profile modelling approach based on fuzzy logic techniques. The proposed approach is conceived to find application in the context of e-learning processes, with the aim of providing personalised contents to different categories of users. Several concepts are introduced and formalised within a peculiar mathematical framework which bases its working engine on an innovative scheme of metadata exploiting the expressive strength of fuzzy sets. Along with the formal presentation of the profile modelling approach, suitable examples of application are provided for the sake of illustration.
Efficient Transport Protocol for Networked Haptics Applications
Authors: Raul Wirz, Manuel Ferre, Raul Marín, Jorge Barrio, José M. Claver, Javier Ortego
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

The performance of haptic application is highly sensitive to communication delays and losses of data. It implies several constraints in developing networked haptic applications. This paper describes a new internet protocol called Efficient Transport Protocol (ETP), which aims at developing distributed interactive applications. TCP and UDP are transport protocols commonly used in any kind of networked communication, but they are not focused on real time application. This new protocol is focused on reducing roundtrip time (RTT) and interpacket gap (IPG). ETP is, therefore, optimized for interactive applications which are based on processes that are continuously exchanging data. ETP protocol is based on a state machine that decides the best strategies for optimizing RTT and IPG. Experiments have been carried out in order to compare this new protocol and UDP.
Efficient generic on-line/off-line (threshold) signatures without key exposure
Authors: Xiaofeng Chen, Fangguo Zhang, Haibo Tian, Baodian Wei, Willy Susilo, Yi Mu, Hyunrok Lee, Kwangjo Kim
Venue: Information Sciences: an International Journal (2008)

The ''hash-sign-switch'' paradigm was firstly proposed by Shamir and Tauman with the aim to design an efficient on-line/off-line signature scheme. Nonetheless, all existing on-line/off-line signature schemes based on this paradigm suffer from the key exposure problem of chameleon hashing. To avoid this problem, the signer should pre-compute and store a plenty of different chameleon hash values and the corresponding signatures on the hash values in the off-line phase, and send the collision and the signature for a certain hash value in the on-line phase. Hence, the computation and storage cost for the off-line phase and the communication cost for the on-line phase in Shamir-Tauman's signature scheme are still a little more overload. In this paper, we first introduce a special double-trapdoor hash family based on the discrete logarithm assumption and then incorporate it to construct a more efficient generic on-line/off-line signature scheme without key exposure. Furthermore, we also present the first key-exposure-free generic on-line/off-line threshold signature scheme without a trusted dealer. Additionally, we prove that the proposed schemes have achieved the desired security requirements.
Mining Ambiguous Data with Multi-instance Multi-label Representation
Authors: Zhi-Hua Zhou
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

In traditional data mining and machine learning settings, an object is represented by an instance (or feature vector) which is associated with a class label. However, real-world data are usually ambiguous and an object may be associated with a number of instances and a number of class labels simultaneously. For example, an image usually contains multiple salient regions each can be represented by an instance, while in image classification such an image can belong to several classes such as lion, grassland and tree simultaneously. Another example is text categorization, where a document usually contains multiple sections each can be represented as an instance, and the document can be regarded as belonging to different categories such as scientific novel, Jules Verne's writing or even books on travelling simultaneously. Web mining is another example, where each of the links or linked pages can be regarded as an instance while the web page itself can be recognized as a news page, sports page, soccer page, etc. This talk will introduce a new learning framework, multi-instance multi-label learning (MIML), which is a choice in addressing such kind of problems.
CATPro: context-aware task prompting system with multiple modalities for individuals with cognitive impairments
Authors: Wan Chih Chang
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Difficulties in executing daily living tasks hamper the quality of life of many individuals with cognitive impairments who are otherwise physically mobile. For example, an adult with mental disorder may want to lead a more independent life and be capable of getting trained and keeping employed, but may experience difficulty in using public transportation to and from the workplace. Task prompting systems for the cognitively impaired have been developed for skill training of activities of daily living. Recently, supported employment programs targeted for people transitioning from institutional to community care have created more demand of cognitive aids to increase their workplace independence. One of the key research issues in task prompting is the timing of the prompts. Put it in more precise terms, researchers are faced with challenges of when, where, and how the prompts are delivered to the users. By bringing context awareness to handheld prompting devices, reducing cognitive load on users, and eliminating the need of shadow teams as "wizards", people with cognitive impairments can have the prompting experiences in easier and more comfortable ways. In collaboration with NGOs dedicated to supported employment programs, a novel Context-Aware Task Prompting system (CATPro) is presented in this research to increase work and life independence for cognitive-impaired patients such as people with traumatic brain injury, cerebral palsy, mental retardation, schizophrenia, dementia, and Alzheimer's disease.
Between Mapping, Sonification and Composition: Responsive Audio Environments in Live Performance
Authors: Christopher L. Salter, Marije A. Baalman, Daniel Moody-Grigsby
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

This paper describes recent work on a large-scale, interactive dance theater performance entitled Schwelle as a platform to pose critical questions around the conception, design and implementation of what is commonly labeled responsive audio environments. The authors first discuss some principal issues in the design of responsive audio environments specifically within the domain of stage performance, addressing existing human-computer interaction paradigms in three key areas: sensing, mapping and data sonification. Next, we explore larger questions of composition in relation to these key areas, suggesting that potential strategies cross three different domains: mapping within algorithmic composition, data sonification techniques, and time-based evolutionary processes emerging from dynamical systems theory. We then examine recent work on Schwelle, which employs real time, distributed sensor data to drive a continuous dynamical system-based composition engine. The project's conceptual and technical challenges are discussed as well as audience evaluation and feedback from the first presentation in Berlin in February 2007, and the subsequent revisions for the second presentation in Montréal in May 2007. Finally, the paper concludes with a set of issues that may act as a framework for future research focused on compositional strategies for larger scale, distributed, network-based sensor environments.
Extracting Tractosemas from a Displacement Probability Field for Tractography in DW-MRI
Authors: Angelos Barmpoutis, Baba C. Vemuri, Dena Howland, John R. Forder
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

In this paper we present a novel method for estimating a field of asymmetric spherical functions, dubbed tractosemas, given the intra-voxel displacement probability information. The peaks of tractosemas correspond to directions of distinct fibers, which can have either symmetric or asymmetric local fiber structure. This is in contrast to the existing methods that estimate fiber orientation distributions which are naturally symmetric and therefore cannot model asymmetries such as splaying fibers. We propose a method for extracting tractosemas from a given field of displacement probability iso-surfaces via a diffusion process. The diffusion is performed by minimizing a kernel convolution integral, which leads to an update formula expressed in the convenient form of a discrete kernel convolution. The kernel expresses the probability of diffusion between two neighboring spherical functions and we model it by the product of Gaussian and von Mises distributions. The model is validated via experiments on synthetic and real diffusion-weighted magnetic resonance (DW-MRI) datasets from a rat hippocampus and spinal cord.
Effective Program Verification for Relaxed Memory Models
Authors: Sebastian Burckhardt, Madanlal Musuvathi
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

Program verification for relaxed memory models is hard. The high degree of nondeterminism in such models challenges standard verification techniques. This paper proposes a new verification technique for the most common relaxation, store buffers. Crucial to this technique is the observation that all programmers, including those who use low-lock techniques for performance, expect their programs to be sequentially consistent. We first present a monitor algorithm that can detect the presence of program executions that are not sequentially consistent due to store buffers while only exploring sequentially consistent executions. Then, we combine this monitor with a stateless model checker that verifies that every sequentially consistent execution is correct. We have implemented this algorithm in a prototype tool called Sober and present experiments that demonstrate the precision and scalability of our method. We find relaxed memory model bugs in several programs, including two previously unknown bugs in a production-level concurrency library that would have been difficult to find by other means.
Automated Diagnosis of Product-Line Configuration Errors in Feature Models
Authors: J. White, D. C. Schmidt, D. Benavides, P. Trinidad, A. Ruiz-Cortés
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

Feature models are widely used to model software product-line (SPL) variability. SPL variants are configured by selecting feature sets that satisfy feature model constraints. Configuration of large feature models can involve multiple stages and participants, which makes it hard to avoid conflicts and errors. New techniques are therefore needed to debug invalid configurations and derive the minimal set of changes to fix flawed configurations. This paper provides three contributions to debugging feature model configurations: (1) we present a technique for transforming a flawed feature model configuration into a Constraint Satisfaction Problem (CSP) and show how a constraint solver can derive the minimal set of feature selection changes to fix an invalid configuration, (2) we show how this diagnosis CSP can automatically resolve conflicts between configuration participant decisions, and (3) we present experiment results that evaluate our technique. These results show that our technique scales to models with over 5,000 features, which is well beyond the size used to validate other automated techniques.
Optimizing Distributed Top-k Queries
Authors: Thomas Neumann, Matthias Bender, Sebastian Michel, Ralf Schenkel, Peter Triantafillou, Gerhard Weikum
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

Top-k query processing is a fundamental building block for efficient ranking in a large number of applications. Efficiency is a central issue, especially for distributed settings, when the data is spread across different nodes in a network. This paper introduces novel optimization methods for top-k aggregation queries in such distributed environments that can be applied to all algorithms that fall into the frameworks of the prior TPUT and KLEE methods. The optimizations address 1) hierarchically grouping input lists into top-k operator trees and optimizing the tree structure, and 2) computing data-adaptive scan depths for different input sources. The paper presents comprehensive experiments with two different real-life datasets, using the ns-2 network simulator for a packet-level simulation of a large Internet-style network.
Dirichlet process mixture models for finding shared structure between two related data sets
Authors: Gayle Leen, Colin Fyfe
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

A nonparametric Bayesian approach is used for the problem of learning from two related data sets. We model the shared structure between two data sets using a Dirichlet process mixture model of probabilistic canonical correlation analysers, which allows the flexibility of the mappings from shared feature to data spaces to be automatically determined from the data.
Declarative language extensions for prolog courses
Authors: Ulrich Neumerkel, Markus Triska, Jan Wielemaker
Venue: Proceedings of the 2008 international workshop on Functional and declarative programming in education (2008)

In this paper we present several extensions to support a more declarative view of programming in Prolog. These extensions enable introductory Prolog courses to concentrate on the pure parts of Prolog for longer periods than without. Even quite complex programs can now be written free of any reference to the more problematic constructs. Our extensions include an alternate way to handle the occurs-check, efficient side-effect free I/O with DCGs, and a uniform approach to integer arithmetic that overcomes the disadvantages of arithmetical evaluation and finite domain constraints, but combines and amplifies their strengths. All extensions have been included recently into the SWI-Prolog distribution.
Expressive Subgroup Signatures
Authors: Xavier Boyen, Cécile Delerablée
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

In this work, we propose a new generalization of the notion of group signatures, that allows signers to cover the entire spectrum from complete disclosure to complete anonymity. Previous group signature constructions did not provide any disclosure capability, or at best a very limited one (such as subset membership). Our scheme offers a very powerful language for disclosing exactly in what capacity a subgroup of signers is making a signature on behalf of the group.
Generalized predictive controller design for AC motors
Authors: Bektache Abdeldjebar, Benmahammed Khier
Venue: Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science (2008)

Generalized predictive control (GPC) is nowadays, widely, spread in control theory as well as in the industrial world. Generalized predictive control (GPC) belong to this family has been demonstrated as a powerful controlling process plants, In this work a polynomial approach of generalized predictive control is proposed whose aim to find optimal values for the tuning control and application of predictive control with polynomial form RST and application of induction motor and developed prediction optimal equation with cost function and resolved of the Diophantine equations this application is reserved in our work for the induction motor with example of a dynamic system and non linear multivariable with load torque.
Fuzzy Rules Generation Method for Pattern Recognition Problems
Authors: Dmitry Kropotov, Dmitry Vetrov
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

In the paper we consider the problem of automatic fuzzy rules mining. A new method for generation of fuzzy rules according to the set of precedents is suggested. The proposed algorithm can find all significant rules with respect to wide range of reasonable criterion functions. We present the statistical criterion for knowledge quality estimation that provides high generalization ability. The theoretical results are complemented with the experimental evaluation.
Cross-Language and Cross-Media Image Retrieval: An Empirical Study at ImageCLEF2007
Authors: Steven C. Hoi
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper summarizes our empirical study of cross-language and cross-media image retrieval at the CLEF image retrieval track (ImageCLEF2007). In this year, we participated in the ImageCLEF photo retrieval task, in which the goal of the retrieval task is to search natural photos by some query with both textual and visual information. In this paper, we study the empirical evaluations of our solutions for the image retrieval tasks in three aspects. First of all, we study the application of language models and smoothing strategies for text-based image retrieval, particularly addressing the short text query issue. Secondly, we study the cross-media image retrieval problem using some simple combination strategy. Lastly, we study the cross-language image retrieval problem between English and Chinese. Finally, we summarize our empirical experiences and indicate some future directions.
The Pions Graphics System
Authors: Juergen Bettels, David Myers
Venue: IEEE Computer Graphics and Applications (1986)

During 1979, CERN began to evaluate how interactive computer graphics displays could aid the analysis of high-energy physics experiments at the new Super Proton Synchrotron collider. This work led to PIONS, a 3D graphics system, which features the ability to store and view hierarchical graphics structures in a directed-acyclic-graph database. It is possible to change the attributes of these structures by making selections on nongraphical information also stored in the database. PIONS is implemented as an object-oriented message-passing system based on Small Talk design principles. It supports multiple viewing transformations, logical input devices, and 2D and 3D primitives. The design allows full use to be made of display hardware that provides dynamic 3D picture transformation.
A Conceptual Schema Based XML Schema with Integrity Constraints Checking
Authors: Oviliani Yenty Yuliana, Suphamit Chittayasothorn
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The more popular XML for exchanging and representing information on Web, the more important Flat XML (XML) and intelligent editors become. For data exchanging, an XML Data with an XML Schema and integrity constraints are preferred. We employ an Object-Role Modeling (ORM) for enriching the XML Schema constraints and providing better validation the XML Data. An XML conceptual schema is presented using the ORM conceptual model. Editor Meta Tables are generated from the conceptual schema diagram and are populated. A User XML Schema base on the information in the Editor Meta Tables is generated. However, W3C XML Schema language does not support all of the ORM constraints. Therefore, we propose an Editor XML Schema and an Editor XML Data to cover unsupported the ORM constraints. We propose the algorithms for defining constraint in the User XML Schema and extending validity constraint checking. Finally, XQuery is used for extending validity checking.
Formal Analysis of Workflows Using UML 2.0 Activities and Graph Transformation Systems
Authors: Vahid Rafe, Adel T. Rahmani
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

Graph transformation has recently become more and more popular as a general visual language to formally state the dynamic semantics of the designed models. Using this technique, we present a highly understandable yet precise approach to formally model the behavioral semantics of UML 2.0 Activity diagrams. Automated formal verification and analysis of UML Activities is the main advantage of our approach. In our proposal, AGG toolset is used to design Activities, then using our previous approach to model checking graph transformation systems, designers can verify and analyze designed Activity diagrams. One of the main application areas of the Activities is workflow modeling; hence to illustrate our approach, we use our proposed semantics for modeling and verification of workflows.
Designing productive spaces for mobile workers: Role insights from network analysis
Authors: Camille Venezia, Verna Allee, Oliver Schwabe
Venue: Information-Knowledge-Systems Management (2008)

Workspace design has not been keeping up with the evolving needs of mobile workers. Although the economic benefits of mobile work have been expanding for companies, few companies have mobile worker strategies that seriously address how new ways of working require different kinds of physical space, mobile devices, and office equipment. Popular mobile worker ``myths'' about the work they do, what they need when they are in the office, and even gender and age have led to costly mistakes in office design and installations and technology purchases. This paper presents findings from a mobile workforce study, in which value network analysis was used to define the roles mobile workers play, map the ways they interact with others and explore how this interaction impacts technology and workspace needs. The insights gained from this approach are helping workplace designers, technology providers, and workspace managers better meet the real needs of workers and use resources more effectively.