ppxscal/embedding_network huggingface dataset:
Generic Summarization Using Non-negative Semantic Variable
Authors: Sun Park
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

The methods using supervised algorithms for generic document summarization are time-consuming because they need a set training data and associated summaries. We propose a new unsupervised method using the Non-negative Semantic Variable to select the sentences for automatic generic document summarization. The proposed method selects meaningful sentences for generic document summarization. Besides, it can improve the quality of generic summaries because the extracted sentences are well covered with the major topics of document. And also it doesn't need a set training data because it is an unsupervised method. The experimental results demonstrate that the proposed method achieves better performance the other method.
BART: A Tool for Automatic Refinement
Authors: Antoine Requet
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

Refining a B specification into an implementation can be a complex and time consuming process. This process can usually be separated in two distinct parts: the specification part, where the refinement is used to introduce new properties and specification details, and the implementation, where refinement is used to convert a detailed B specification into a B0 implementation. The first part requires human interaction, since it corresponds to writing the specification. However, the implementation part is more mechanical, and usually corresponds to apply known refinement schemes.
Characterizing Implications of Injective Partial Orders
Authors: José L. Balcázar, Gemma C. Garriga
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

It is known that implications in powerset-based closure systems correspond to Horn approximations in propositional logic frameworks. Here we focus on the problem of implications between injective partial orders. We set up the definitions that allow one to apply standard constructions of implications, and formally characterize the propositional theory obtained. We describe also some experimental applications of our development.
Xl: an efficient network routing algorithm
Authors: Kirill Levchenko, Geoffrey M. Voelker, Ramamohan Paturi, Stefan Savage
Venue: Proceedings of the ACM SIGCOMM 2008 conference on Data communication (2008)

In this paper, we present a new link-state routing algorithm called Approximate Link state (XL) aimed at increasing routing efficiency by suppressing updates from parts of the network. We prove that three simple criteria for update propagation are sufficient to guarantee soundness, completeness and bounded optimality for any such algorithm. We show, via simulation, that XL significantly outperforms standard link-state and distance vector algorithms - in some cases reducing overhead by more than an order of magnitude - while having negligible impact on path length. Finally, we argue that existing link-state protocols, such as OSPF, can incorporate XL routing in a backwards compatible and incrementally deployable fashion.
Experiences Using Mobile Phones as Patient-Terminal for Telemedical Home Care and Therapy Monitoring of Patients Suffering from Chronic Diseases
Authors: Matthias Pinsker, Karin Schindler, Jürgen Morak, Dieter Hayn, Peter Kastner, Michaela Riedl, Bernhard Ludvik, Günter Schreier
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Optimizing the treatment of chronic diseases requires continuous monitoring of the health status. With standard information and communication technology this challenge can be solved, with respect to special needs of patients, stated as marginal effort and simple handling. We present a therapy-management-system where patients acquired their health data using a Java-application running on mobile phones. The data were transferred to the health centre, which provided data visualization, individual feedback, reminders and surveillance of critical events. The system was evaluated in the course of two clinical trials with patients suffering from diabetes mellitus. Seven out of ten patients of the first trial returned questionnaires and reported feasibility of the concept for regular daily use. Patients of the second trial reported problems to a telephone-hotline, most were related to faulty data insertion. Based on their high user acceptance and ubiquitous availability mobile phones show the potential to be the patient-terminal of choice.
Federated Authentication and Authorization: A Case Study
Authors: Oliver Boehm, Jörg Caumanns, Markus Franke, Oliver Pfaff
Venue: Proceedings of the 2008 12th International IEEE Enterprise Distributed Object Computing Conference (2008)

The loose coupling of services is a key characteristic for modern IT-systems based on SOA. This paper analyzes the design and realization of SOA security in a SOA-compliant fashion. It focuses on federated authentication and authorization based on Web services security technologies. The SOA-style infrastructure of the eCR specification is used as a practical case study. eCR systems address the exchange of medical data within regional healthcare networks. Adequate IT-security and especially federated authentication and authorization are imperative for eCR systems.
A Simple Aplysia-Like Spiking Neural Network to Generate Adaptive Behavior in Autonomous Robots
Authors: Fady Alnajjar, Kazuyuki Murase
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2008)

In this article, we describe an adaptive controller for an autonomous mobile robot with a simple structure. Sensorimotor connections were made using a three-layered spiking neural network (SNN) with only one hidden-layer neuron and synapses with spike timing-dependent plasticity (STDP). In the SNN controller, synapses from the hidden-layer neuron to the motor neurons received presynaptic modulation signals from sensory neurons, a mechanism similar to that of the withdrawal reflex circuit of the sea slug, Aplysia. The synaptic weights were modified dependent on the firing rates of the presynaptic modulation signal and that of the hidden-layer neuron by STDP. In experiments using a real robot, which uses a similar simple SNN controller, the robot adapted quickly to the given environment in a single trial by organizing the weights, acquired navigation and obstacle-avoidance behavior. In addition, it followed dynamical changes in the environment. This associative learning scheme can be a new strategy for constructing adaptive agents with minimal structures, and may be utilized as an essential mechanism of an SNN ensemble that binds multiple sensory inputs and generates multiple motor outputs.
Optimization for Cyclosporine Blood Concentration Prediction Based on Genetic Algorithm - BP Neural Network
Authors: Shan Li, Haibing Chen, JunXian Yun, LiuZheng Zhou, Jie Xia, Jiong Zhang, Yasha Yin
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

The paper proposes the new model of the genetic algorithm and BP neural networks to predict the blood concentration of Cyclosporine. The BP model was optimized by genetic algorithm to overcome the slower convergence speed, and the best result was found in the particular condition with the strong search function of genetic algorithm. The prediction precision of average blood concentration of Cyclosporine by using the GABP neural network model was 97.5%. It was found that the GABP model was superior to BP neural network in the prediction of Cyclosporine blood concentration. We conclude the GABP model can be used in the prediction of the Cyclosporine blood concentration and help clinicians provide better care for patients taking CsA.
3-Way Composition of Weighted Finite-State Transducers
Authors: Cyril Allauzen, Mehryar Mohri
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

Composition of weighted transducers is a fundamental algorithm used in many applications, including for computing complex edit-distances between automata, or string kernels in machine learning, or to combine different components of a speech recognition, speech synthesis, or information extraction system. We present a generalization of the composition of weighted transducers, 3-way composition, which is dramatically faster in practice than the standard composition algorithm when combining more than two transducers. The worst-case complexity of our algorithm for composing three transducers T 1, T 2, and T 3 resulting in T, is O(|T| Q min (d(T 1) d(T 3), d(T 2)) + |T| E ), where |·| Q denotes the number of states, |·| E the number of transitions, and d(·) the maximum out-degree. As in regular composition, the use of perfect hashing requires a pre-processing step with linear-time expected complexity in the size of the input transducers. In many cases, this approach significantly improves on the complexity of standard composition. Our algorithm also leads to a dramatically faster composition in practice. Furthermore, standard composition can be obtained as a special case of our algorithm. We report the results of several experiments demonstrating this improvement. These theoretical and empirical improvements significantly enhance performance in the applications already mentioned.
A New Approach for Separation of Functional MRI Images' Components Using Modified FastICA Algorithm
Authors: Houtan Haddad Larijani, Gholamali Rezai Rad
Venue: Proceedings of the 2008 Fifth International Conference BioMedical Visualization: Information Visualization in Medical and Biomedical Informatics (2008)

This paper proposes a new approach for separation of components in functional MRI sequences using FastICA. In this paper we will demonstrate that if we subtract background (which is separated from sources by PCA) from other principal components, the algorithm converges very fast. The proposed method is more robust and much more computationally efficient than methods, which previously has been applied for separation of components in functional MRI sequences.
LEAP++: A Robust Key Establishment Scheme for Wireless Sensor Networks
Authors: Chae Hoon Lim
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

This paper presents a security-enhanced variant of LEAP+, called LEAP++. The proposed scheme not only improves the security against node capture attacks but also provides additional robustness against denial-of-service and node fabrication attacks. It also provides an easy way to detect in many cases, if not all, node replication and wormhole attacks during key establishment. We also propose a variant of LEAP++ robust even under master key compromise using a small-size ECDH.
Performance study by simulations of intersection location service compared to two location service algorithms for vehicular ad hoc networks in metropolitan environments
Authors: Yao-Jen Chang, Tai-Cheng Liao
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

Numerous works have been found on location service algorithms for random waypoint VANETs but very few in metropolitan environments. In this paper, we have studied the performance of Intersection Location Service (ILS), a novel location service algorithm that is designed to work in the city environments with streets and intersections. A fault-recovery mechanism based on the Chord algorithm is used to retrieve location information of vehicles when the corresponding location services go out of service. The simulation analysis compares the performance of the proposed scheme with other two location based algorithms (GLS, HLS). The simulation results confirm the effectiveness of the ILS scheme in terms of increased success ratios under different network topologies. We also found the ILS algorithm not only remains robust at high car speeds but also demonstrates higher scalability than the other two with respect to network size.
A socio-technical perspective of mobile work
Authors: Leida Chen, Ravi Nath
Venue: Information-Knowledge-Systems Management (2008)

Developing an effective mobile work environment is one of the major challenges that many organizations are facing today. Organizations need to understand the myriad of issues that will determine the success of mobile work. These issues can be best studied from the socio-technical perspective in order to gain a holistic understanding of mobile work. The premise of the socio-technical theory is that the social and technical systems are interdependent and must be jointly optimized in order to determine the best overall solution for the organization. Based upon the information gleaned from structured interviews conducted with the Chief Information Officers (CIO) of ten organizations, this study identifies the primary elements of the social and technical subsystems related to mobile work. Additionally, the study provides a list of recommendations for organizations in order to improve their mobile work environment using the socio-technical perspective.
Mobile Payment: Towards a Customer-Centric Model
Authors: Krassie Petrova
Venue: Proceedings of the 2008 international workshops on Web Information Systems Engineering (2008)

Mobile payment normally occurs as a wireless transaction of monetary value and includes the initiation, authorization and the realization of the payment. Such transactions are facilitated by purpose-built mobile payment systems that are part of the service infrastructure supporting the functioning of mobile business applications. A number of stakeholder groups may be involved in concluding a mobile payment transaction, among them customers, mobile operators, financial institutions, merchants, and intermediaries. In this paper, mobile payment systems are characterised from the point of view of the stakeholder groups. Building on existing work, a supply and demand model for the investigation of mPayment services is presented, and applied to a case study.
Distributed Graphs Transformed by Multiagent System
Authors: Leszek Kotulski
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Graph transformations are a powerful notation formally describing different aspects of the software systems. Multiagent systems are one of the most promising ways to introduction of the parallel computation. The reason of difficulties in joining these approaches was centralized way of the graph representation. The GRADIS framework offers the possibility of splitting the graph describing the problem onto a few partial graphs, that can be maintained in different places. Moreover, the GRADIS distributed environment makes the application of old rules possible, in order to modify these set of partial graphs. Basing on this framework, we show how to introduce the multiagent system and we show an example estimation of improvement time complexity of the multiagent system in comparison to the centralized one.
A cultural probes study on video sharing and social communication on the internet
Authors: Marieke Oumard, Diana Mirza, Juliane Kroy, Konstantinos Chorianopoulos
Venue: Proceedings of the 3rd international conference on Digital Interactive Media in Entertainment and Arts (2008)

The focus of this article is the link between video sharing and interpersonal communication on the internet. Previous works on social television systems belong to two categories: 1) studies on how collocated groups of viewers socialize while watching TV, and 2) studies on novel Social TV applications (e.g. experimental set-ups) and devices (e.g. ambient displays) that provide technological support for TV sociability over a distance. The main shortcoming of those studies is that they have not considered the dominant contemporary method of Social TV. Early adopters of technology have been watching and sharing video online. We employed cultural probes in order to gain in-depth information about the social aspect of video sharing on the internet. Our sample consisted of six heavy users of internet video, watching an average of at least one hour of internet video a day. In particular, we explored how they are integrating video into their daily social communication practices. We found that internet video is shared and discussed with distant friends. Moreover, the results of the study indicate several opportunities and threats for the development of integrated mass and interpersonal communication applications and services.
Introduction
Authors: John Barnes
Venue: Ada 2005 Rationale: The Language, The Standard Libraries (2008)

This first chapter covers the background to the development of Ada 2005 and gives a brief overview of the main changes from Ada 95. Other chapters then look at the changes in more detail. 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 reservation mac protocol for ad-hoc underwater acoustic sensor networks
Authors: Leonard T. Tracy, Sumit Roy
Venue: Proceedings of the third ACM international workshop on Underwater Networks (2008)

In this paper we propose a new MAC protocol for ad-hoc underwater acoustic sensor networks that segregates the available bandwidth into a (small) control channel and a (majority bandwidth) data channel. Reservations for main channel time are made by transmission of request-to-Send(RTS) packets on the control channel. The effects of channel segregation are explored and simulation results are presented. We find that such a reservation MAC generally achieves good channel utilization with an optimal control channel bandwidth for a given data bandwidth.
Does the Common Criteria Paradigm Have a Future?
Authors: Jim Hearn
Venue: IEEE Security and Privacy (2004)

In the wake of the 4th International Common Criteria Conference, the need for substantial changes to the CC paradigm are evident. The strength of CC's future is less clear, despite the value it offers to security vendors and consumers.
Feature Construction Using Theory-Guided Sampling and Randomised Search
Authors: Sachindra Joshi, Ganesh Ramakrishnan, Ashwin Srinivasan
Venue: Proceedings of the 18th international conference on Inductive Logic Programming (2008)

It has repeatedly been found that very good predictive models can result from using Boolean features constructed by an an Inductive Logic Programming (ILP) system with access to relevant relational information. The process of feature construction by an ILP system, sometimes called "propositionalization", has been largely done either as a pre-processing step (in which a large set of possibly useful features are constructed first, and then a predictive model is constructed) or by tightly coupling feature construction and model construction (in which a predictive model is constructed with each new feature, and only those that result in a significant improvement in performance are retained). These represent two extremes, similar in spirit to filter and wrapper-based approaches to feature selection. An interesting, third perspective on the problem arises by taking search-based view of feature construction. In this, we conceptually view the task as searching through subsets of all possible features that can be constructed by the ILP system. Clearly an exhaustive search of such a space will usually be intractable. We resort instead to a randomised local search which repeatedly constructs randomly (but non-uniformly) a subset of features and then performs a greedy local search starting from this subset. The number of possible features usually prohibits an enumeration of all local moves. Consequently, the next move in the search-space is guided by the errors made by the model constructed using the current set of features. This can be seen as sampling non-uniformly from the set of all possible local moves, with a view of selecting only those capable of improving performance. The result is a procedure in which a feature subset is initially generated in the pre-processing style, but further alterations are guided actively by actual model predictions. We test this procedure on language processing task of word-sense disambiguation. Good models have previously been obtained for this task using an SVM in conjunction with ILP features constructed in the pre-processing style. Our results show an improvement on these previous results: predictive accuracies are usually higher, and substantially fewer features are needed.
Multi-stream Fusion for Speaker Classification
Authors: Izhak Shafran
Venue: Speaker Classification I: Fundamentals, Features, and Methods (2007)

Accurate detection of speaker traits has clear benefits in improving speech interfaces, finding useful information in multi-media archives, and in medical applications. Humans infer a variety of traits, robustly and effortlessly, from available sources of information, which may include vision and gestures in addition to voice. This paper examines techniques for integrating information from multiple sources, which may be broadly categorized into those in feature space, model space, score space and kernel space. Integration in feature space and model space has been extensively studied in the context of audio-visual literature, and here we focus on score space and kernel space. There are large number of potential schemes for integration in kernel space, and here we examine a particular instance which can integrate both acoustic and lexical information for affect recognition. The example is taken from a widely-deployed real-world application. We compare the kernel-based classifier with other competing techniques and demonstrate how it can provide a general and flexible framework for detecting speaker characteristics.
Does Mobile Television Challenge the Dimension of Viewing Television? An Explorative Research on Time, Place and Social Context of the Use of Mobile Television Content
Authors: Marinka Vangenck, An Jacobs, Bram Lievens, Eva Vanhengel, Jo Pierson
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

Television is one of the last media technologies to become disconnected from a fixed place like home. Media like newspaper, radio, audio recordings and computing have already been introduced in a mobile setting since some time. However with the wide spread and strong domestication of mobile devices, and the dominant character of television in households, it seems that the transition to mobile television is inevitable. Viewing patterns and behavior are strongly determined by dimensions of time, place and social context and it is exactly on those dimensions that the mobility aspect has a great impact. The question we therefore address in this paper is to what extent that relationship between mobility and these dimensions will influence the uptake and usage of mobile television.