ppxscal/embedding_network huggingface dataset:
Reducing overfitting in process model induction
Authors: Will Bridewell, Narges Bani Asadi, Pat Langley, Ljupčo Todorovski
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

In this paper, we review the paradigm of inductive process modeling, which uses background knowledge about possible component processes to construct quantitative models of dynamical systems. We note that previous methods for this task tend to overfit the training data, which suggests ensemble learning as a likely response. However, such techniques combine models in ways that reduce comprehensibility, making their output much less accessible to domain scientists. As an alternative, we introduce a new approach that induces a set of process models from different samples of the training data and uses them to guide a final search through the space of model structures. Experiments with synthetic and natural data suggest this method reduces error and decreases the chance of including unnecessary processes in the model. We conclude by discussing related work and suggesting directions for additional research.
Self-organizing P2P Overlay Network applying Dynamic Landmark Mechanism for Contents Delivery Network
Authors: Jung-Il Namgung, Soo-Young Shin, Soo-Hyun Park, Lee-Sub Lee, Dongwon Jeong
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

CDN does not calculate connections between infra networks and user networks by increasing physical network. Instead, CDN decentralizes bottlenecked data traffics or contents to main parts of internet network. By this, an amount of traffics passing through Middle-Mile of complicated internet is decreased and CP (Contents Provider)'s server loads are reduced by allocating contents to many distributed servers. In this paper, we proposed an extended Rosary overlay network which is suitable for CDN environment by modification and supplement of Pastry. The proposed Rosary extends Pastry by dividing it into Inter-Pastry and Intra-Pastry to fit for CDN environment, makes application-level multicasting and adopts semi-hash scheme. By adopting geographic layout technology to proximity neighbor selection technology of Pastry, Rosary node was made to act as landmark server.
Optimizing Path Expression Queries of XML Data
Authors: Yang Li, Ping Yi, Qiyan Li
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. This poses a new challenge concerning indexing and searching XML data, because conventional approaches based on relational model may not meet the processing requirements for XML data. In this paper, we propose a path index based on Patricia-tries, namely PT index. Our PT index structure offers several novel features. First, it can support to fast search data by its structure based on Patricia-tries. Second, the path indexes are compressed so that they can be stored in memory. Thirdly, because PT index includes structure and text of XML data, we can get the results form the PT index without reading original XML data from disk. We further analyze time complexity and space complexity of PT index. Experimental results from our prototype system implementation show that the PT index can outperform some representative index approaches, such as DataGuide, B+tree index and Index Fabric.
Towards a Hybrid Formal Method for Swarm-Based Exploration Missions
Authors: Christopher A. Rouff, Michael G. Hinchey, James L. Rash, Walter F. Truszkowski
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

NASA is investigating the use of swarms of robotic vehicles for future space exploration missions. Such swarms offer many advantages of traditional, single spacecraft, missions. Intelligent swarms offer potential for selfmanagement and survivability, and their emergent properties make such swarms potentially very powerful. However, they are signi.cantly more dif.cult to design, and ensuring that proper behaviors will emerge is a complex task. NASA's FAST project is investigating the use of formal approaches to the speci.cation and veri.cation of such systems. Using ANTS, a NASA concept mission, as a case study, multiple formal methods were evaluated to determine their effectiveness in modeling and ensuring desired swarm behavior. We discuss this evaluation and propose a hybrid formal method for use in the development of future NASA intelligent swarms.
Hamiltonian formulation of the variable-h SPH equations
Authors: Javier Bonet, Miguel X. Rodríguez-Paz
Venue: Journal of Computational Physics (2005)

In this paper a variational formulation of smooth particle hydrodynamics for dynamic problems is presented. The resulting equations treat the continuum as a Hamiltonian system of particles where the constitutive equation of the material is represented via an internal energy term. In the case of fluids the internal energy term is a function of density. The new formulation introduces a variable smoothing length for the evaluation of density and incorporates a consistent approach for the treatment of rigid boundaries. The method overcomes some problems faced by standard SPH approaches that use constant smoothing lengths and provides a variational context for a variable smoothing length formulation. A numerical example shows the capabilities of this novel formulation.
Identification of Complexes of Operations System with Limited Measurement Possibilities
Authors: Jerzy Swiatek
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The paper presents the problem of complex operation system identification for the requirements of allocation tasks. A complex of operations system with a given structure and description known with accuracy to parameters' has been examined. The paper gives the methodology of identification algorithms on the assumption that it is possible to measure all quantities characterising particular operations that is for each operation, the task size or resource measurement and operation time are available. Next two cases of identification of complexes of operations system with limited measurement possibilities are discussed, in the first case the measurement of complex execution time and the size of task or resource allocated to particular operations are available, while in the other case the quantity of global task or resource is available.
Using Divisible Load Theory to Dimension Optical Transport Networks for Grid Excess Load Handling
Authors: Pieter Thysebaert, Marc De Leenheer, Bruno Volckaert, Filip De Turck, Bart Dhoedt, Piet Demeester
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

An important aspect of Grid deployment is the allocation and activation of installed network capacity. Due to the data-intensive nature of Grid jobs, it is expected that optical transport networks will play an important role in Grid deployment. As Grids possibly consist of high numbers of resources and users, solving the network dimensioning problem using straightforward Integer Linear Programs (ILP) does not scale well with increasing number of jobs. Therefore, we propose the use of Divisible Load Theory (DLT) when modelling this OCS (with wavelength translation) dimensioning problem. We establish the suitability of this approach as an Optical Transport Network dimensioning tool in an excess load scenario for varying wavelength granularity, fiber/wavelength cost models, network topology, traffic demand asymmetry and Grid scheduling strategy.
Mobile RFID Technology for Improving M-Commerce
Authors: Weiping Zhu, Dong Wang, Huanye Sheng
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

The RFID technology is called a revolution to our life in new century. This paper introduces how improve m-commerce utilizing mobile RFID technology. Complete and validated information could be gathered for the later m-commerce wherever and whenever you see nice products. On the way transportation, the exception events could be detected in real-time and used to notice deliver people and control center. When receiving, the customer could check the messages in the RFID tag along with the products and verify quality of the products. The mobile RFID middleware and monitor device are also designed and implemented to support the practice application. Mobile RFID technology makes convenient to the information gathering and enhance customer's confidence of m-commerce . It also improves the retailer's management level, competition ability and commerce profit.
Learning to verify branching time properties
Authors: Abhay Vardhan, Mahesh Viswanathan
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

We present a new model checking algorithm for verifying computation tree logic (CTL) properties. To our knowledge, this is the first CTL model checking algorithm for infinite state systems that can also handle fairness constraints. Our technique is based on using language inference to learn the fixpoints necessary for checking a CTL formula instead of computing them iteratively as is done in traditional model checking. This allows us to analyze infinite or large state-space systems where the traditional iterations may not converge or may take too long to converge. Our procedure is guaranteed to terminate with the correct answer if fixpoints needed for all subformulas of the CTL property are regular. We have extended our LEVER tool to use the technique presented in this paper and demonstrate its effectiveness by verifying a number of parametric and integer systems.
Pernicious ports
Authors: Hal Berghel, David Hoelzer
Venue: Communications of the ACM (2005)

Identifying and defending against port-related vulnerabilities.
Local Authentication with Bluetooth enabled Mobile Devices
Authors: Fabio Dellutri, Gianluigi Me, Maurizio A. Strangio
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

As the processing power of mobile devices such as PDAs and smartphones increase they constitute the target platforms for new value-added services and applications and excellent candidates for Personal Trusted Devices (PTDs). Furthermore, handheld devices are increasingly networked and thus provide a natural and ubiquitous token for authentication purposes. This paper presents a framework and prototype system for exploiting these facts. A Bluetoothenabled smartphone is used to protect a laptop from unauthorised access with an approach that improves convenience and usability from the user's perspective. The main building blocks are a Diffie-Hellmann based two-party key agreement protocol with authentication mechanisms based on Java midlets and low-entropy human memorable passwords. The results are readily extended to other environments such as payment transactions, remote control of appliances and services, transactions on unattended dispensers of goods such as parking meters, petrol stations, etc.
Generating dance verbs and assisting computer choreography
Authors: Chi-Min Hsieh, Annie Luciani
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

As quoted in the philosophy of contemporary dance: <<Understanding the directions for a Free Dance performer stems mainly from the qualities and energy of the movement rather from spatial criteria>>, a lot of emphasis is put currently on generating computing dance movement by dynamic and energy, which is totally different from producing movement by kinematical based gestures in sequence. We argue that it is an ideal interactive media to connect computer and choreographer.In this paper, we present a set of dynamic models according to dance verbs: "to rebound", "to jump", "to flip", "to wave", etc, served by physically based particle modeling based on Newton's law. Among them, user has a high-level motion control to modify the quality of such dynamically generated movement, for example, light/strong, free/bound, sudden/sustained, etc. These dynamic models are hence well suited to produce spontaneous motion that looks natural and plausible. To sum up, we propose a methodology, focusing on the birth, the growth and the death of cause, which include mystic anticipation, inner propagation and virtual momentum exchange. Our methodology exhibits energetic succession and connects well the dance, physics and computer. It is convincingly a well-suited direction for computer-aided choreography.
Recent Advances and Future Trends in Low Power Wireless Systems for Medical Applications
Authors: Kenneth A. Townsend, James W. Haslett, Tommy K. K. Tsang, Mourad N. El-Gamal, Krzysztof Iniewski
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper describes current state-of-the-art research on low power wireless systems for medical applications. Distinct design criteria and challenges in this area are addressed. A study of existing wireless technologies and their key applications are presented. A brief assessment of future trends for wireless medicine with a focus on emerging technologies is provided. Finally, a number of different energy-scavenging techniques for the future development of autonomous wireless nodes are reviewed.
Segmentation and Recognition of Characters in Scene Images Using Selective Binarization in Color Space and GAT Correlation
Authors: Minoru Yokobayashi, Toru Wakahara
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper proposes a new technique of segmentation and recognition of characters with a wide variety of image degradations and complex backgrounds in natural scenes. The key ideas are twofold. One is segmentation of character and background by local/adaptive binarization of one of Cyan/Magenta/Yellow (CMY) color planes with the maximum breadth of histogram. The other is affineinvariant grayscale character recognition using global affine transformation (GAT) correlation. In experiments, we use a total of 698 test images extracted from the public ICDAR 2003 robust OCR dataset containing images of single characters in natural scenes. In advance, we classify those images into seven groups according to the degree of image degradations and/or background complexity. On the other hand, we prepare a single-font set of 62 alphanumerics for templates. Experimental results show an average recognition rate of 70.3%, ranging from 95.5% for clear images to 24.3% for littlecontrast images.
An adaptive method with rigorous error control for the Hamilton-Jacobi equations. Part II: The two-dimensional steady-state case
Authors: Bernardo Cockburn, Bayram Yenikaya
Venue: Journal of Computational Physics (2005)

In this paper, we devise and study an adaptive method for finding approximations to the viscosity solution of Hamilton-Jacobi equations. The method, which is an extension to two space dimensions of a similar method previously proposed for one space dimension, is studied in the framework of steady-state Hamilton-Jacobi equations with periodic boundary conditions. It seeks numerical approximations whose L^~-distance to the viscosity solution is no bigger than a prescribed tolerance. A thorough numerical study is carried out which shows that a strict error control is achieved and that the method exhibits an optimal computational complexity which does not depend on the value of the tolerance or on the type of Hamiltonian.
Digital memories in an era of ubiquitous computing and abundant storage
Authors: Mary Czerwinski, Douglas W. Gage, Jim Gemmell, Catherine C. Marshall, Manuel A. Pérez-Quiñones, Meredith M. Skeels, Tiziana Catarci
Venue: Communications of the ACM (2006)

A lifetime of digital memories is possible but raises many social, as well as technological, questions.
MML: A Language for Modeling Interactive Multimedia Applications
Authors: Andreas PleuB
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

The development of highly interactive multimedia applications is still a challenging and complex task. In addition to the application logic multimedia applications typically provide a sophisticated user interface with integrated media objects. As a consequence, the development process involves different experts for software design, user interface design, and media design. There is still a lack of concepts for a structured development process to integrate these requirements. In this paper we introduce the Multimedia Modeling Language (MML), a visual modeling language supporting the design process in multimedia application development. It is part of a model-driven development approach for multimedia applications. The language is oriented on well-established software engineering concepts, in particular UML 2.0. It integrates the results of two different research lines: application-oriented multimedia modeling and model-based user interface development. In this paper we describe the concepts of the language and present the modeling process with MML. In particular we show how MML aims to integrate the different developer roles in multimedia application design.
Caste-Centric Agent-Oriented Programming
Authors: Ji Wang, Rui Shen, Hong Zhu
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

The paper presents a caste-centric approach to agentoriented programming by introducing SLABSp language. The fundamental concepts of caste-centric methodology, caste and scenario, as well as environment descriptions, are available as language facilities in SLABSp in a coherent way. In SLABSp programming, agents are organized into castes to represent their structure and behavior characteristics, and their behaviors are defined by scenarios and rules in the context of their environment. The relations between agents and castes are bound at runtime, and the perceptions and interactions between agents are supported with scenarios and behavior rules. Two selected SLABSp programs are demonstrated to illustrate the programming style.
Solving the aircraft engine maintenance scheduling problem using a multi-objective evolutionary algorithm
Authors: Mark P. Kleeman, Gary B. Lamont
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Scheduling problems are a very common research topic. This is because, for efficiency reasons, our world relies heavily on schedules and deadlines. Aircraft engine maintenance is no exception. The United States Air Force has many planes that it must keep up and running. But with the downsizing that has occurred in recent years, the number of planes that are operational has become more critical. This means that every effort needs to be made to ensure that not only are the engines repaired in an efficient manner, but that their component's scheduled maintenance cycles are in sync so that the engine has fewer trips to the logistics maintenance center.
Stability and Sensitivity for Congestion Control in Wireless Networks with Time Varying Link Capacities
Authors: Guohua Zhang, Yiyu Wu, Yonghe Liu
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

While extensive efforts have been devoted to providing optimization based, distributed congestion control schemes for efficient bandwidth utilization and fair allocation in both wireline and wireless networks, a common assumption therein is fixed link capacities. This unfortunately will limit the application scope in multi-hop wireless networks where channels are ever changing. In this paper, we explicitly model link capacities to be time varying and investigate congestion control problems in multi-hop wireless networks. In particular we propose a primal-dual congestion control algorithm which is proved to be trajectory stable in the absence of feedback delay. Different from system stability around a single equilibrium point, trajectory stability guarantees the system is stable around a time varying reference trajectory. Moreover, we obtain sufficient conditions for the scheme to be locally stable in the presence of delay. Our key technique is to model time variations of capacities as perturbations to a constant link. Furthermore, to study the robustness of the algorithm against capacity variations, we investigate the sensitivity of the control scheme and through simulations to study the tradeoff between stability and sensitivity.
Strategies and Benefits of Fusion of 2D and 3D Face Recognition
Authors: Michael Husken, Michael Brauckmann, Stefan Gehlen, Christoph Von der Malsburg
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

The extension of 2D image-based face recognition methods with respect to 3D shape information and the fusion of both modalities is one of the main topics in the recent development of facial recognition. In this paper we discuss different strategies and their expected benefit for the fusion of 2D and 3D face recognition. The face recognition grand challenge (FRGC) provides for the first time ever a public benchmark dataset of a suitable size to evaluate the accuracy of both 2D and 3D face recognition. We use this benchmark to evaluate hierarchical graph matching (HGM), an universal approach to 2D and 3D face recognition, and demonstrate the benefit of different fusion strategies. The results show that HGM yields the best results presented at the recent FRGC workshop, that 2D face recognition is significantly more accurate than 3D face recognition and that the fusion of both modalities leads to a further improvement of the 2D results.
A Hybrid Distributed Test Generation Method Using Deterministic and Genetic Algorithms
Authors: Haidar Harmanani, Bassem Karablieh
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

Test generation is a highly complex and time-consuming task. In this work, we present a distributed method for combinational test generation. The method is based on a hybrid approach that combines both deterministic and genetic approaches. The deterministic phase is based on the D-algorithm and generates an initial set of test vectors that are evolved in the genetic phase in order to achieve a high fault coverage in a short time. The algorithm is parallelized based on a cluster of workstations using the Message Passing Interface (MPI) library. Several benchmark circuits were attempted, and favorable results comparisons are reported.
Transaction Analysis of Multiprocessor Based Platform with Bus Matrix
Authors: Seungbeom Lee, Sin-Chong Park
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper presents an analysis of transaction of multiprocessor platform with bus matrix. Simple equations about the latency and throughput for this architecture are derived. From this equation we evaluate operating frequency to meet latency and throughput requirements. This architecture is modeled as transaction level model (TLM) in SystemC in order to confirm the validation of the governing equation. The result of simulation corresponds to that of the derived equation.