ppxscal/embedding_network huggingface dataset:
Brake Control Assist on a Four-Castered Walker for Old People
Authors: Tetsuya Hirotomi, Yasutomo Hosomi, Hiroyuki Yano
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Brake control assist for a four-castered walker for old people has been developed. The prototype system is equipped with a set of simple sensors, such as three-axis acceleration sensor and distance sensor. Our system estimates three walking states to control the application of the brake. Emergency strong brake can be predicted to prevent and/or forestall a fall. Individual characteristics related to brake control can be acquired within a short time and taken effect. In this paper, the implementation of brake control assist and its evaluations from performance and usability points of view are presented.
R-Automata
Authors: Parosh Aziz Abdulla, Pavel Krcal, Wang Yi
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

We introduce R-automata --- finite state machines which operate on a finite number of unbounded counters. The values of the counters can be incremented, reset to zero, or left unchanged along the transitions. R-automata can be, for example, used to model systems with resources (modeled by the counters) which are consumed in small parts but which can be replenished at once. We define the language accepted by an R-automaton relative to a natural number D as the set of words allowing a run along which no counter value exceeds D. As the main result, we show decidability of the universality problem, i.e., the problem whether there is a number D such that the corresponding language is universal. We present a proof based on finite monoids and the factorization forest theorem. This theorem was applied for distance automata in [12]--- a special case of R-automata with one counter which is never reset. As a second technical contribution, we extend the decidability result to R-automata with Büchi acceptance conditions.
Extensions of the Re-identification Risk Measures Based on Log-Linear Models
Authors: Daniela Ichim
Venue: Proceedings of the UNESCO Chair in data privacy international conference on Privacy in Statistical Databases (2008)

A global measure of the re-identification risk in microdata files is analyzed. Two extensions of the log-linear models are presented. The first methodology considers the weights in the analysis of contingency tables. The results of several tests performed on real data are presented. In the framework of statistical disclosure control, the second methodology proposes a maximum penalized likelihood approach to the computation of smooth estimates.
Euler Formulas and Geometric Modeling
Authors: P. R Wilson
Venue: IEEE Computer Graphics and Applications (1985)

This Physial Approach to the Euler Formula Demonstrates how Different version Can be in this article we demonstrates how different versions can be Obtained And how They Can Be Used in Boundary Geometric Modeling
Detecting Problematic Dialogs with Automated Agents
Authors: Alexander Schmitt, Carolin Hank, Jackson Liscombe
Venue: Proceedings of the 4th IEEE tutorial and research workshop on Perception and Interactive Technologies for Speech-Based Systems: Perception in Multimodal Dialogue Systems (2008)

We present a supervised machine learning approach for detecting problematic human-computer dialogs between callers and an automated agent in a call center. The proposed model can distinguish problematic from non-problematic calls after only five caller turns with an accuracy of over 90%. Based on a corpus of more than 69,000 dialogs we further employ the classifier's decision to given business models and present the cost savings that can be achieved by deploying classification techniques to Interactive Voice Response systems.
Intelligent supervisory control of continuous processes exposed to faults: a practical approach
Authors: Carlos Parra Ortega, Eliezer Colina Morles, Edgar Chacòn Ramírez
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

In order to carry out Supervisory Control in continuous industrial processes exposed to faults it is required to provide intelligence to the supervision mechanism, to cope with the identification of a diversity of faults, the origin of them and to be able to anticipate the consequences derived by their occurrence. In this article we propose to extend the idea of using of multiresolutional models [1] to construct a framework for supervisory control based upon a fuzzy and agent event detection approach. The suggested approach is validated using discrete-event simulation techniques applied to a hydro-pneumatic system.
Autonomous Scheduling with Unbounded and Bounded Agents
Authors: Chetan Yadati, Cees Witteveen, Yingqian Zhang, Mengxiao Wu, Han Poutre
Venue: Proceedings of the 6th German conference on Multiagent System Technologies (2008)

Autonomous scheduling deals with the problem - how to enable agents to schedule a set of interdependent tasks in such a way that whatever schedule they choose for their tasks, the individual schedules always can be merged into a global feasible schedule? Unlike the traditional approaches to distributed scheduling we do not enforce a fixed schedule to every participating agent. Instead we guarantee flexibility by offering a set of schedules to choose from in such a way that every agent can choose its own schedule independently from the others. We show that in case of agents with unbounded concurrency, optimal make-span can be guaranteed. Whenever the agents have bounded concurrency optimality cannot be guaranteed, but we present an approximation algorithm that ensures a constant make-span ratio.
Model Checking of Infinite State Space Markov Chains by Stochastic Bounds
Authors: Mouad Ben Mamoun, Nihal Pekergin
Venue: Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications (2008)

In this paper, we discuss how to check Probablistic Computation Tree Logic (PCTL) logic operators over infinite state Discrete Time Markov Chains (DTMC). Probabilistic model checking has been largely applied over finite state space Markov models. Recently infinite state models have been considered when underlying infinite Markov models have special structures. We propose to consider finite state models providing bounds on transient and the stationary distributions in the sense of the $\preceq_{st}$ stochastic order to check infinite state models. The operators of the PCTL logic are then checked by considering these finite bounding models.
Grid-Enabled Non-Invasive Blood Glucose Measurement
Authors: Ibrahim Elsayed, Jianguo Han, Ting Liu, Alexander Wöhrer, Fakhri Alam Khan, Peter Brezany
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Earth and life sciences are at the forefront to successfully include computational simulations and modeling. Medical applications are often mentioned as the killer applications for the Grid. The complex methodology and models of Traditional Chinese Medicine offer different approaches to diagnose and treat a persons health condition than typical Western medicine. A possibility to make this often hidden knowledge explicit and available to a broader audience will result in mutual synergies for Western and Chinese medicine as well as improved patient care. This paper proposes the design and implementation of a method to accurately estimate blood glucose values using a novel non-invasive method based on electro-transformation measures in human body meridians. The framework used for this scientific computing collaboration, namely the China-Austria Data Grid (CADGrid) framework, provides an Intelligence Base offering commonly used models and algorithms as Web/Grid-Services. The controlled execution of the Non-Invasive Blood Glucose Measurement Service and the management of scientific data that arise from model execution can be seen as the first application on top of the CADGrid.
Multiplexor Categories and Models of Soft Linear Logic
Authors: Brian F. Redmond
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

We give a categorical interpretation of Lafont's Soft Linear Logic, a logical system complete for polynomial time computation, in terms of multiplexor categories. We present two main classes of models and methods for constructing examples in each case. As a concrete example of the first type, we introduce a simple game semantics for Multiplicative Soft Linear Logic. To illustrate the second type, we give a realizability model and a new proof of the polytime soundness of Soft Linear Logic. These results further our semantic understanding of Soft Linear Logic and polynomial time.
On the Benefit of Caching Traffic Flow Data in the Link Buffer
Authors: Konstantin Septinus, Christian Grimm, Vladislav Rumyantsev, Peter Pirsch
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

In this paper we review local caching of TCP/IP flow context data in the link buffer or a comparable other local buffer. Such connection cache is supposed to be a straight-forward optimization strategy for look-ups of flow context data in a network processor environment. The connection cache can extend common table-based look-up schemes and also be implemented in SW. On the basis of simulations with different IP network traces, we show a significant decrease of average search times. Finally, well-suited cache and table sizes are determined, which can be used for a wide range of IP network systems.
Ontologies and Software Engineering
Authors: Waralak V. Siricharoen
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

This paper is about using ontologies to identify the objects from a problem domain text description. At the center of object models and ontologies are objects within a given problem domain is similar to the concept provided by ontologies. This paper addresses ontologies as a basis of a methodology for object modeling, including available tools, particularly OntoExtract, which can help the conversion process. This paper describes how the developers can implement this methodology on the base of an illustrative example.
Applying patterns to build a lightweight middleware for embedded systems
Authors: D. Bellebia, J-M. Douin
Venue: Proceedings of the 2006 conference on Pattern languages of programs (2006)

Today, patterns are used in several domains (distributed applications, security, software requirements, architecture...). Our purpose is double: first, to know if existing patterns can be applied in the particular domain of embedded systems middleware, second, to establish the grounding towards a patterns language for that domain. In this paper, we describe how to design and build a lightweight middleware for embedded systems with well known patterns such as Composite, Proxy, Visitor, Observer, Publish/Subscribe, Leasing, Evictor or Configurator. The patterns we selected and implemented allow keeping the memory footprint reduced. Yet, they were relevant to address the need of creating topology views of Networked Embedded Systems (NES), to monitor and to manage them. As a result, the middleware is modular, flexible, extensible, and lightweight (< 128 kb) according to targeted embedded systems requirements. In addition, this paper describes a concrete case study, illustrating how to select appropriate patterns to build a dedicated middleware in order to interconnect numerous small devices.
Web, Graphs and Semantics
Authors: Olivier Corby
Venue: Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning (2008)

In this paper we show how Conceptual Graphs (CG) are a powerful metaphor for identifying and understanding the W3C Resource Description Framework. We also presents CG as a target language and graph homomorphism as an abstract machine to interpret/implement RDF/S, SPARQL and Rules. We show that CG components can be used to implement such notions as named graphs and properties as resources.In brief, we think that CG are an excellent framework to progress in the Semantic Web because the W3C now considers that RDF graphs are--- along with XML trees --- one of the two standard formats for the Web.
Strata of Intervenient Concepts in Normative Systems
Authors: Lars Lindahl, Jan Odelstad
Venue: Proceedings of the 9th international conference on Deontic Logic in Computer Science (2008)

Writing a contract of a specific content is a ground for purchase, purchase is a ground for ownership, ownership is a ground for power to dispose. Also power to dispose is a consequence of ownership, ownership is a consequence of purchase. etc. The paper presents a continuation of the authors' previous algebraic representation on ground - consequence chains in normative systems.The paper analyzes different kinds of "implicative closeness" between grounds and consequences in chains of legal concepts, in particular combinations of "weakest ground", "strongest consequence" and "minimal joining". The idea of a concept's being intermediate between concepts of two different sorts is captured by the technical notion of "intervenient", defined in terms of weakest ground and strongest consequence. A legal example concerning grounds and consequences of "ownership" and "trust" is used to illustrate the application of the formal theory.
Person and Vehicle Tracking in Surveillance Video
Authors: Andrew Miller, Arslan Basharat, Brandyn White, Jingen Liu, Mubarak Shah
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 evaluation for person and vehicle tracking in surveillance presented some new challenges. The dataset was large and very high-quality, but with difficult scene properties involving illumination changes, unusual lighting conditions, and complicated occlusion of objects.Since this is a well-researched scenario [1], our submission was based primarily on our existing projects for automated object detection and tracking in surveillance. We also added several new features that are practical improvements for handling the difficulties of this dataset.
Waiting times for M/M systems under state-dependent processor sharing
Authors: Andreas Brandt, Manfred Brandt
Venue: Queueing Systems: Theory and Applications (2008)

We consider a system where the arrivals form a Poisson process and the required service times of the requests are exponentially distributed. The requests are served according to the state-dependent (Cohen's generalized) processor sharing discipline, where each request in the system receives a service capacity which depends on the actual number of requests in the system. For this system we derive systems of ordinary differential equations for the LST and for the moments of the conditional waiting time of a request with given required service time as well as a stable and fast recursive algorithm for the LST of the second moment of the conditional waiting time, which in particular yields the second moment of the unconditional waiting time. Moreover, asymptotically tight upper bounds for the moments of the conditional waiting time are given. The presented numerical results for the first two moments of the sojourn times in M/M/m¿PS systems show that the proposed algorithms work well.
Building Localized Basis Function Networks Using Context Dependent Clustering
Authors: Marcin Blachnik, Wodzisaw Duch
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

Networks based on basis set function expansions, such as the Radial Basis Function (RBF), or Separable Basis Function (SBF) networks, have non-linear parameters that are not trivial to optimize. Clustering techniques are frequently used to optimize positions of localized functions. Context-dependent fuzzy clustering techniques improve convergence of parameter optimization, leading to better networks and facilitating formulation of prototype-based logical rules that provide low-complexity models of data.
Representing Interwoven Surfaces in 2-1/2D Drawings
Authors: Keith Wiley, Lance R. Williams
Venue: IEEE Computer Graphics and Applications (2007)

Drawing programs must be able to distinguish which surface is on top anywhere that two surfaces overlap. Existing drawing programs do this by assigning surfaces to distinct layers, so they can't represent interwoven sets of surfaces. Druid uses a more general representation by maintaining local depth ordering of segments of a drawing's surface boundaries rather than a global depth relation between entire surfaces.
InterCondor: A Prototype High Throughput Computing Middleware for Geocomputation
Authors: Yong Xue, Yanguang Wang, Ying Luo, Jianping Guo, Jianqin Wang, Yincui Hu, Chaolin Wu
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

This paper presents the design, analysis and implementation of InterCondor system. The InterCondor system is an implementation of the concept of InterGrid. It uses Condor as a basic local Grid computing engine. It utilizes a series of Grid services, which including register service, data transfer service, task schedule service, security authentication service and status monitor service, to manage the resources such as remote sensing algorithms, remote sensing data, and computing resource under the management of Condor engine. We aim at integrating Grid Service data management, task schedule, and the computing power of Condor into remote sensing data processing and analysis to reduce the processing time of a huge amount of data and long-processing-time remote sensing task by algorithms issuance, data division, and the utilization of any computing resources unused on Internet.
Molecules as Automata
Authors: Luca Cardelli
Venue: Proceedings of the 22nd international workshop on Computer Science Logic (2008)

Molecular biology investigates the structure and function of biochemical systems starting from their basic building blocks: macromolecules. A macromolecule is a large, complex molecule (a protein or a nucleic acid) that usually has inner mutable state and external activity. Informal explanations of biochemical events trace individual macromolecules through their state changes and their interaction histories: a macromolecule is endowed with an identity that is retained through its transformations, even through changes in molecular energy and mass. A macromolecule, therefore, is qualitatively different from the small molecules of inorganic chemistry. Such molecules are stateless: in the standard notation for chemical reactions they are seemingly created and destroyed, and their atomic structure is used mainly for the bookkeeping required by the conservation of mass.
Effect of Spatial Attention in Early Vision for the Modulation of the Perception of Border-Ownership
Authors: Nobuhiko Wagatsuma, Ryohei Shimizu, Ko Sakai
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

We propose a computational model consisting of mutually linked V1, V2, and PP modules. The model reproduces the effect of attention in the determination of border-ownership (BO) that tells which side of the contour owns the border. The V2 module determines BO based on surrounding contrast extracted by the V1 module that could be influenced by top-down spatial attention from the PP module. We carried out the simulations of the model with random-block ambiguous figures to test whether spatial attention alters BO for these meaningless stimuli. To compare quantitatively these results with human perception, we carried out psychophysical experiments corresponding to the simulations. The results of these two showed good agreement in that the perception of BO was flipped when altering the location of spatial attention. These results suggest that spatial attention is a crucial factor for the modulation of figure direction in meaningless figures, and that the effects of spatial attention in early visual area are crucial for the modulation of figure direction.
An Efficient Strong Key-Insulated Signature Scheme and Its Application
Authors: Go Ohtake, Goichiro Hanaoka, Kazuto Ogawa
Venue: Proceedings of the 5th European PKI workshop on Public Key Infrastructure: Theory and Practice (2008)

The security of a system is often compromised by exposure of secret keys even if its underlying cryptographic tools are perfectly secure, assuming that their secret keys will be never exposed to adversaries. A key-insulated signature scheme is a useful cryptographic primitive for reducing the damage caused by such leakage. In this paper, we propose an efficient strong key-insulated signature (KIS) scheme and prove its security. This scheme is significantly more efficient than conventional strong KIS schemes especially in terms of signature size, and it is provably secure under the discrete logarithm (DL) assumption in the random oracle model. It is constructed by extending the Abe-Okamoto signature scheme [1]; we give a formal proof of adaptive key-exposure security as it is not addressed in [1]. A typical application of our scheme is to an authentication system in which one (or a small number of) sender communicates with many receivers since multiple copies of the sender's signature are transmitted to individual receivers in such a system. We discuss a bidirectional broadcasting service as an example.
On Three Closely Related Rough Inclusion Functions
Authors: Anna Gomolińska
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

The aim of this article is to explore further the idea leading to the standard rough inclusion function (standard RIF for short). In fact, two more RIFs may be derived which are different from the standard RIF, yet definable by means of it. We examine properties of the three RIFs and, in particular, the relationships among them.
GridEcon: A Market Place for Computing Resources
Authors: Jörn Altmann, Costas Courcoubetis, George D. Stamoulis, Manos Dramitinos, Thierry Rayna, Marcel Risch, Chris Bannink
Venue: Proceedings of the 5th international workshop on Grid Economics and Business Models (2008)

This paper discusses the rationales for a Grid market and, in particular, the introduction of a market place for trading commoditized computing resources. The market place proposed makes computing resources from different providers substitutable through virtualization. This includes the definition of a spot and future market as well as the parameters that a market mechanism for computing resources should consider. The above market place is complemented by a set of value-added services (e.g. insurance against resource failures, capacity planning, resource quality assurance, stable price offering) that ensure quality for Grid users over time. The market place technology for all of the above services has been designed by the GridEcon project, contributing to a broader adoption of Grid technology and enabling a service-oriented knowledge utility environment.