ppxscal/embedding_network huggingface dataset:
Small cylindrical display for anthropomorphic agents
Authors: T. Kawanishi, M. Tsuchida, S. Takagi, H. Murase
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This paper describes a small cylindrical display for an anthropomorphic agent that communicates with users in a three-dimensional (3D) environment. Conventional displays for anthropomorphic agents are designed for a single user or a fixed viewing direction. We suggest a new small cylindrical display that is visible from the outside in any direction. Image data for the projector is calculated by the image-warping method. Light emitted from the image projector is reflected by a spherical mirror and projected on the inside of the rear of the cylindrical screen. This cylindrical display enables 3D agent actions, such as head turning. We evaluated our display by measuring pixel brightness in different situations. We demonstrate an application of anthropomorphic agents and a telecommunications system using omnidirectional images.
Data Mining Approaches to Criminal Career Analysis
Authors: Jeroen S. de Bruin, Tim K. Cocx, Walter A. Kosters, Jeroen F. J. Laros, Joost N. Kok
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Narrative reports and criminal records are stored digitally across individual police departments, enabling the collection of this data to compile a nation-wide database of criminals and the crimes they committed. The compilation of this data through the last years presents new possibilities of analyzing criminal activity through time. Augmenting the traditional, more socially oriented, approach of behavioral study of these criminals and traditional statistics, data mining methods like clustering and prediction enable police forces to get a clearer picture of criminal careers. This allows officers to recognize crucial spots in changing criminal behaviour and deploy resources to prevent these careers from unfolding. Four important factors play a role in the analysis of criminal careers: crime nature, frequency, duration and severity. We describe a tool that extracts these from the database and creates digital profiles for all offenders. It compares all individuals on these profiles by a new distance measure and clusters them accordingly. This method yields a visual clustering of these criminal careers and enables the identification of classes of criminals. The proposed method allows for several user-defined parameters.
A Business Service Network to Aid Collaboration between Small to Medium Enterprises
Authors: Thomas Kirkham, Thomas Varsamidis
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

Short term integration repeated multiple times in a year can create complex and potentially damaging integration architectures for the Small to Medium Enterprise (SME). The solution to this problem proposed in this paper is a model which involves building Business Service Networks (BSNs) based around a dynamic community approach to integration. The model is implemented using a grid service architecture and applies existing work on dynamic virtual organisations in the area of business to business integration.
Authentication in Stealth Distributed Hash Tables
Authors: Andrew MacQuire, Andrew Brampton, Idris A. Rai, Nicholas J. P. Race, Laurent Mathy
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

Most existing DHT algorithms assume that all nodes have equal capabilities. This assumption has previously been shown to be untrue in real deployments, where the heterogeneity of nodes can actually have a detrimental effect upon performance. In this paper, we acknowledge that nodes on the same overlay may also differ in terms of their trustworthiness. However, implementing and enforcing security policies in a network where all nodes are treated equally is a non-trivial task. We therefore extend our previous work on Stealth DHTs to consider the differentiation of nodes based on their trustworthiness rather than their capabilities alone.
A case study of icon-scenario based animated menu's concept development
Authors: Lim Chee Koon
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

This paper reports on the implementation of the Icon-Scenario Based Animated Menu graphical user interface that is adopted across our latest 2G platform. We describe the concept development process of the phone's menu enhanced by the use of a captivating Icon-Scenario Based Animated Menu that takes usability into consideration and brings delight to users.
Cache performance impacts for stack machines in embedded systems
Authors: Antonio Carlos S. Beck, Mateus B. Rutzig, Luigi Carro
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

Java, with its advantages as being an overspread multiplatform object oriented language, has been gaining popularity in the embedded system market over the years. However, because of its extra layer of interpretation, it is also believed that it is a slow language while being executed. Nevertheless, when this execution is done directly in hardware, Java advantages caused by its stack nature start to appear. One of these advantages concerns memory utilization, impacting in less accesses and cache misses. In this work we analyze this impact in performance and energy consumption, comparing a Java processor with a RISC one based on aMIPS architecture with similar characteristics.
Research on the Grid/Web-Service-Based Visualization Model and Its Application
Authors: Chunmei Duan, Xiangxu Meng
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

The combined exploration of grid technology and science of data visualization is a new paradigm in cross-domain science research. GVis presented in the paper is a distributed and collaborative web-service-based visualization environment that we developed to support automated availability and allocation of heterogeneous visualization resources. It provides a flexible framework for sharing of visualization components by geologically distributed collaborative users. The framework based on grid/web services specified by OGSA model uses Visualization resources Broker (VisBroker) for the availability and allocation of remote components. Visualization Grid Services (VGS) runs as the core layer of GVis which splits and distributes visualization components on the grid following distributed visualization pipeline mapping model. Data driven mechanism is used for updating data and pipeline of collaborative users.
EEDS NR: An Online Energy-Efficient I/O Device Scheduling Algorithm for Hard Real-Time Systems with Non-preemptible Resources
Authors: Hui Cheng, Steve Goddard
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

The challenge in conserving energy in embedded real-time systems is to reduce power consumption while preserving temporal correctness. Much research has focused on power conservation for the processor, while power conservation for I/O devices has received little attention. In this paper, we analyze the problem of online energy-aware I/O scheduling for hard real-time systems based on the preemptive periodic task model with non-preemptible shared resources. We extend the concept of device slack proposed in [3] to support non-preemptible shared resources; and propose an online energy-aware I/O scheduling algorithm: Energyefficient Device Scheduling with Non-preemptible Resources (EEDS NR). The EEDS NR algorithm utilizes device slack to perform device power state transitions to save energy, without jeopardizing temporal correctness. An evaluation of the approach shows that it yields significant energy savings.
Algorithms for Web Services Discovery and Composition Based on Syntactic and Semantic Service Descriptions
Authors: Seog-Chan Oh, Hyunyoung Kil, Dongwon Lee, Soundar R. T. Kumara
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

As the number of available web services is rapidly increasing, the effective and efficient service discovery and composition becomes a pressing problem for value-added distributed applications. To address this problem, in this paper, we present efficient service discovery and composition algorithms that exploit both syntactic and semantic service descriptions of web services.
Fine-grained and History-based Access Control with Trust Management for Autonomic Grid Services
Authors: Hristo Koshutanski, Fabio Martinelli, Paolo Mori, Anna Vaccarelli
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

Grid technology provides an Internet-wide environment where a very large set of entities share their resources. The main feature of a Grid environment is that resource providers belong to distinct administrative domains each with its own security policies and enforcement mechanisms. Even more, service providers and entities, exploiting the Grid infrastructure, typically have incomplete information about each other mainly because each administrative domain manages its policies and resources with high degree of autonomy. Thus, controlling access to Grid resources has become a major security issue and a Grid infrastructure has to provide a proper set of mechanisms and tools that allow for a fine-grained and history-based access control management. This paper proposes a comprehensive access control and enforcement framework for Grid computational resources. The framework is based on a behavioral model that defines fine-grained and history-based monitoring and on a trust management model that provides access decisions and proper access rights management. The framework provides dynamic and context-aware access control enforcement by generating temporal credentials at run time while user's applications are exploiting Grid's resources.
Efficient Parallel Pattern Matching Using Partition Method
Authors: S. Viswanadha Raju, S. R. Mantena, A. Vinaya Babu, G. V. S. Raju
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

In this paper we consider the problem of exact string matching algorithm based on a two-dimensional array. This has applications such as string databases, cellular automata and computational biology. The main use of this method is to reduce the time spent on comparisons in string matching by finding common characters in pattern string which achieves a constant time O(1) for pattern string in a text string .This reduces many calls across backend interface.
A Knowledge-based Security Policy Framework for Business Process Management
Authors: Dong Huang, Yi Yang, Jacques Calmet
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

Business Process Management (BPM) is often a key component of the business change. Business rules, whether embedded within BPM or on their own, have begun playing an ever-increasing role of prominence in process-centric business and system strategies. Service-oriented architec- ture (SOA) is used to support the business processes and a novel approach to share service knowledge and application- specific information is needed. In this paper, we model web service policy with corporate knowledge, which is de- fined as the amount of knowledge provided by individual agents. The proposal builds upon the project AKT's1 work in defining a Semantic Web Constraint Interchange Format (CIF), which itself builds on the proposed Semantic Web Rule Language (SWRL). The main contribution include also a new ontology for representing security constraints as pol- icy and a knowledge management method to our proposed knowledge-based policy framework; we also show the pos- sibility to integrate the business rules into policy specifica- tion by means of converting them into Constraint Satisfac- tion Problem (CSP) using CIF.
Common Neural Basis for Phoneme Processing in Infants and Adults
Authors: G. Dehaene-lambertz, T. Gliga
Venue: Journal of Cognitive Neuroscience (2004)

Investigating the degree of similarity between infants' and adults' representation of speech is critical to our understanding of infants' ability to acquire language. Phoneme perception plays a crucial role in language processing, and numerous behavioral studies have demonstrated similar capacities in infants and adults, but are these subserved by the same neural substrates or networks? In this article, we review event-related potential (ERP) results obtained in infants during phoneme discrimination tasks and compare them to results from the adult literature. The striking similarities observed both in behavior and ERPs between initial and mature stages suggest a continuity in processing and neural structure. We argue that infants have access at the beginning of life to phonemic representations, which are modified without training or implicit instruction, but by the statistical distributions of speech input in order to converge to the native phonemic categories.
Efficient allocation algorithms for OLAP over imprecise data
Authors: Doug Burdick, Prasad M. Deshpande, T. S. Jayram, Raghu Ramakrishnan, Shivakumar Vaithyanathan
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Recent work proposed extending the OLAP data model to support data ambiguity, specifically imprecision and uncertainty. A process called allocation was proposed to transform a given imprecise fact table into a form, called the Extended Database, that can be readily used to answer OLAP aggregation queries.In this work, we present scalable, efficient algorithms for creating the Extended Database (i.e., performing allocation) for a given imprecise fact table. Many allocation policies require multiple iterations over the imprecise fact table, and the straightforward evaluation approaches introduced earlier can be highly inefficient. Optimizing iterative allocation policies for large datasets presents novel challenges, and has not been considered previously to the best of our knowledge. In addition to developing scalable allocation algorithms, we present a performance evaluation that demonstrates their efficiency and compares their performance with respect to straight-foward approaches.
Probabilistically induced domain decomposition methods for elliptic boundary-value problems
Authors: Juan A. Acebrón, Maria Pia Busico, Piero Lanucara, Renato Spigler
Venue: Journal of Computational Physics (2005)

Monte Carlo as well as quasi-Monte Carlo methods are used to generate only few interfacial values in two-dimensional domains where boundary-value elliptic problems are formulated. This allows for a domain decomposition of the domain. A continuous approximation of the solution is obtained interpolating on such interfaces, and then used as boundary data to split the original problem into fully decoupled subproblems. The numerical treatment can then be continued, implementing any deterministic algorithm on each subdomain. Both, Monte Carlo (or quasi-Monte Carlo) simulations and the domain decomposition strategy allow for exploiting parallel architectures. Scalability and natural fault tolerance are peculiarities of the present algorithm. Examples concern Helmholtz and Poisson equations, whose probabilistic treatment presents additional complications with respect to the case of homogeneous elliptic problems without any potential term and source.
Beyond RANSAC: User Independent Robust Regression
Authors: Raghav Subbarao, Peter Meer
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

RANSAC is the most widely used robust regression algorithm in computer vision. However, RANSAC has a few drawbacks which make it difficult to use in a lot of applications. Some of these problems have been addressed through improved sampling algorithms or better cost functions, but an important problem still remains. The algorithms are not user independent, and require some knowledge of the scale of the inlier noise. The projection based M-estimator (pbM) offers a solution to this by reframing the regression problem in a projection pursuit framework. In this paper we derive the pbM algorithm for heteroscedastic data. Our algorithm is applied to various real problems and its performance is compared with RANSAC and MSAC. It is shown that pbM gives better results than RANSAC and MSAC in spite of being user independent.
Business driven simulation of a postal letter sorting facility in Oslo, Norway
Authors: Knud Erik Wichmann, Niels Erik Larsen
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Using advanced 3D simulation models (incorporating physical layout and logic control rules) to verify that the mechanical system can handle a certain flow of parcels, products whatever are well known. Yet, many systems do not perform quite as expected even after a simulation study has been conducted? We will argue that key to successfully modelling the new business, production or material handling system is to ensure that all constraints and fluctuations within actual operation, and variations in external business demands are reflected such that scenarios in this regard can be tested. This mean that modellers should be adopting a philosophy with more emphasis on specific customer insights and analysis - a "customer business pull" rather than a "vendor solution push" in the approach to modelling.
Composing Adaptive Learning Systems
Authors: Dirk Frosch-Wilke, Salvador Sanchez-Alonso
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Adaptive learning systems are recognized as one of the most interesting research topics in intelligent learning management systems. Taking as a point of departure the practices and experience in compositional adaptation of software in the computing field, we point out in this paper a number of important issues regarding adaptive learning systems, with an emphasis on the aspect of adaptation of learning systems in mobile environments and quality assurance of adaptation.
Initial transient problem for steady-state output analysis
Authors: Peter W. Glynn
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This tutorial is concerned with providing an overview of the key issues that arise in consideration of the initial transient problem for steady-state simulations. In addition, we will discuss the related problem of construction of low-bias estimators.
Striving for ubiquitous citizenship with mobile PICOLA
Authors: Samantha Konwinski, Zachary Sam Zaiss
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

This paper introduces Mobile PICOLA - a mobile extension to the original PICOLA (Public Informed Citizens' OnLine Assembly) which is meant to provide an interactive online environment for the purpose of conducting deliberative polling. After justifying the exploration of the mobile environment, we discuss the usability analysis conducted with Mobile PICOLA, and the resulting design changes.
Agent-Based Petroleum Offshore Monitoring Using Sensor Networks
Authors: Sajid Hussain, M Rafiqul Islam, Elhadi Shakshuki, M. S. Zaman
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

This paper investigates the architecture and design of agent-based sensor networks for petroleum offshore monitoring. A few challenges to monitor the reservoir, wellbore and wellhead are identified. Moreover, the necessary components for a reliable, precise, and accurate monitoring are suggested. The paper describes the architecture of the routing agent and discusses the cross layer optimization issues for query processing. The paper also provides the software design and components for a web-based continuous monitoring application.
3D Navigable Interface for Interactive Movie Gormenghast Explore
Authors: Julia Sussner, Ludvig Lohse, Maureen Thomas, Gustavo Garcia, Isabel Alonso, Alberto Munoz
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

This paper discusses the multi-media 3D interface for Gormenghast Explore (EU Framework 6 IST Integrated Research Project NM2, "New Media for the New Millennium"), an interactive small-screen movie, enabling the viewer to reconfigure personalised video sequences in real-time. From conceptual framework design to establishing delivery platform architecture, this paper describes the process of developing a 3D interactive interface for reconfigurable drama by creating a digital environment which responds to the spatially organised esthetic of the source material and permits the interactor to communicate with the NM2 authoring tools through navigation and exploration.
Lean sigma and simulation, so what's the correlation?: V2
Authors: David M. Ferrin, Martin J. Miller, David Muthler
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper will explore the fundamental relationships between Lean Sigma and simulation. A basic overview of Lean Sigma includes: 1) Lean Sigma philosophy, 2) Basic tools, 3) Theory of Variation, 4) SPC, 5) Process capability, 6) Lean Sigma infrastructure, and 7) DMAIC and DFSS processes. Simulation will be applied to the appropriate areas of the overview. Improvement in the robustness of the Lean Sigma methodology will be discussed and the strengths of simulation will be presented as capable and preferable enhancements to the Lean Sigma processes. Quotes from Lean Sigma and industry leaders will be presented. Simulation will be presented as an innovation tool enhancing the Lean Sigma DMAIC and DFSS processes.
Pseudospectra and delay differential equations
Authors: Kirk Green, Thomas Wagenknecht
Venue: Journal of Computational and Applied Mathematics (2006)

In this paper, we present a new method for computing the pseudospectra of delay differential equations (DDEs) with fixed finite delay. This provides information on the sensitivity of eigenvalues under arbitrary perturbations of a given size, and hence insight into how stability may change under variation of parameters. We also investigate how differently weighted perturbations applied to the individual matrices of the delayed eigenvalue problem affect the pseudospectra. Furthermore, we compute pseudospectra of the infinitesimal generator of the DDE, from which a lower bound on the maximum transient growth can be inferred. To illustrate our method, we consider a DDE modelling a semiconductor laser subject to external feedback.
Index criteria for differential algebraic equations arising from linear-quadratic optimal control problems
Authors: Katalin Balla, Galina A. Kurina, Roswitha März
Venue: Journal of Dynamical and Control Systems (2006)

The index of DAE systems arising from linear quadratic optimal control problems is considered. Necessary and sufficient conditions ensuring regularity with tractability index one are proved. Then, it is shown that if the control problem DAE is regular with index one and if the leading term of the DAE to be controlled is given by one full-column-rank and one full-row-rank matrix, then it has a Hamiltonian inherent explicit ODE. For problems with regular index zero or index one DAEs to be controlled, the DAE of the control problem is shown to be regular with tractability index one or three, depending on whether the control coefficient R is singular.
Wireless Technology Leaps the Last Mile
Authors: Linda Dailey Paulson
Venue: Computer (2006)

Topics include "Wireless Technology Leaps the Last Mile," "Researcher Turns Computers into Better Listeners," and "IBM Puts Encryption in a Processor.