ppxscal/embedding_network huggingface dataset:
Privacy Preserving Data Classification with Rotation Perturbation
Authors: Keke Chen, Ling Liu
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Data perturbation techniques are one of the most popular models for privacy preserving data mining [3, 1]. It is especially convenient for applications where the data owners need to export/publish the privacy-sensitive data. A data perturbation procedure can be simply described as follows. Before the data owner publishes the data, they randomly change the data in certain way to disguise the sensitive information while preserving the particular data property that is critical for building the data models. Several perturbation techniques have been proposed recently, among which the most typical ones are randomization approach [3] and condensation approach [1].
QoS Aware Policy-Based Management Architecture for Service Grids
Authors: Edgar Magana, Joan Serrat
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

This paper presents a flexible and versatile policy-based Grid Services Management Architecture. Although applicable to any user profiles, our system is essentially intended for non-massive resource owners accessing large amounts of computing, memory and storage resources. Unlike similar architectures, this approach is able to manage service resources requirements demanded by service's users, providers and services themselves. This architecture guarantees demanded levels of Quality of Service (QoS), based on the maximisation of a fair and balanced resources exploitation. The presented framework is scalable as well as extensible reducing procurement, deployment, maintenance and operational costs through multiple infrastructures regardless network technology, operative platform or administrative domain.
An Enhanced Application-Level Multicast Protocol: A Qos Perspective
Authors: Zi Chu, Yin-yin Yang
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Ubicast, an enhanced application-level multicast protocol, is presented in this paper. It is built upon Pastry, a robust and self-organizing peer-to-peer substrate overlay, and leverages its merits of reliable application- level routing and object location. Ubicast is mainly applied to real-time multimedia applications with QoS heterogeneity. It tries to minimize the delay radius of the multicast tree, while meeting different bandwidth requirements. It extends traditional degree- bound model and satisfies nodes' heterogeneous QoS requirements to provide customizable multicast services. Besides, Priority Joining Algorithm based on the concept of potential parents is proposed to limit the number of nodes that a participant needs to probe. The join cost is decreased substantially to guarantee the scalability for a potentially large network topology. Simulation and experimental analysis over large-scale topology confirm the performance improvement of Ubicast which is especially suited for small sized multicast groups.
Stochastic Inventory Routing Problem Under B2C E-commerce
Authors: Xie Binglei, An Shi, Wang Jian
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

In traditional B2C, customers' stocks are usually controlled by themselves, while the supplier needs only to meet requests of customers by sending right commodity on time. The operation mode results in disadvantages of hindering saving of cost and improvement of efficiency. Being one of the key contents in vendor managed inventory, inventory routing problem will help supplier to lower operation cost, improve efficiency and increase satisfaction of customers. In the paper, a heuristic algorithm is designed to solve stochastic inventory routing problem. In the algorithm, followed by converting stochastic demands of customers to regular demands, distribution period of every customer is calculated by the modified EOQ. Finally, approximate solution of stochastic inventory routing problem can be obtained by solving periodic vehicle routing problem.
PerfectDoc: A Ground Truthing Environment for Complex Documents
Authors: Sherif Yacoub, Vinay Saxena, Sayeed Nusrulla Sami
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we present PerfectDoc; a ground truthing and document correction tool. The tool provides post processing correction capabilities that are required after complex document analysis and understanding tasks. The tool has the advantage of being comprehensive (integration of most common correction tasks), easy to use (minimal clicks for corrections), configurable (can be used for different types of documents), and provides separate correction views. We used the tool to correct the output from a document understanding system used to extract articles from 80-years archive of Time weekly magazine.
Discovering Effective Strategies for the Iterated Prisoner's Dilemma using Genetic Algorithms
Authors: Michal Glomba, Tomasz Filak, Halina Kwasnicka
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

The iterated prisoner's dilemma is used to illustrate and model the phenomena in economics, sociology, psychology, as well as in the biological sciences such as evolutionary biology. The discovery and optimization of IPD strategies in real-world applications requires flexible strategy representation. The comparison of deterministic and non-deterministic finite state machines as the representations of strategies for the iterated prisoner's dilemma is presented. A novel chromosome representation scheme for nondeterministic Mealy finite state machines is proposed. The research on efficiency of the strategies evolved using genetic algorithms was made. Best results in competition with unknown strategies were obtained by non-deterministic strategies.
A Brooks-Type Theorem for the Generalized List T-Coloring
Authors: Jirí Fiala, Daniel Král', Riste Skrekovski
Venue: SIAM Journal on Discrete Mathematics (2005)

We study the notion of a generalized list $T$-coloring which is a common generalization of the channel assignment problem and the $T$-coloring. An instance of the generalized list $T$-coloring is described by a triple $(G,\Lambda,t)$, where $G$ is a graph, $\Lambda$ is a mapping which assigns the vertices of $G$ lists of numbers (colors), and $t$ is a mapping which assigns each edge of $G$ a set of forbidden differences. We require that $0\in t(e)$ for each edge $e$ of $G$. The goal is to find a labeling $c$ of the vertices of $G$ with $c(v)\in\Lambda(v)$ for each vertex $v$, and $|c(u)-c(v)|\not\in t(uv)$ for each edge $uv$ of $G$. An instance is balanced if the size of the list $\Lambda(v)$ for each vertex $v$ is equal to the sum of the sizes of $t(e)$ for edges $e$ incident with $v$.We state and prove a Brooks-type theorem for the generalized list $T$-coloring problem. This generalizes and unifies the previously known Brooks-type theorems for the channel assignment problem and for the $T$-coloring. The theorem characterizes balanced instances of the generalized list $T$-coloring with a good labeling. As a consequence, if $G$ is a connected graph different from a Gallai tree, then all balanced instances on $G$ have good labelings.
Multi-point Stereo Camera System for Controlling Safety at Railroad Crossings
Authors: Ikushi Yoda, Katsuhiko Sakaue, Daisuke Hosotani
Venue: Proceedings of the Fourth IEEE International Conference on Computer Vision Systems (2006)

Dozens of people are killed every year at railroad crossings, a situation that requires urgent action by railroad companies, especially in major cities. We are therefore developing a ubiquitous stereo vision based system for ensuring safety at railroad crossings. In this system, stereo cameras are installed at four corners and are pointed toward the center of the railroad crossing to monitor the passage of people. The system determines automatically and in real-time whether anyone or anything is inside the railroad crossing, and whether anyone remains in the crossing. The system can be configured to automatically switch over to a surveillance monitor or automatically connect to an emergency brake system in the event of trouble.
Stochastic Analysis of Chain Based File Distribution Architectures with Heterogeneous Peers
Authors: Damiano Carra, Renato Lo Cigno
Venue: Proceedings of the 10th International Workshop on Web Content Caching and Distribution (2005)

Performance analysis of P2P systems is necessary to understand the real impact on the network of such applications. In this paper we study the performance that can be achieved by a simple file distribution architecture in a heterogeneous environment, i.e., when the access links of peers have randomly distributed capacities. The distribution architecture is a chain, where each peer downloads the content from exactly one node and uploads the content to exactly one node. Our analysis starts from a complete knowledge about peers, so that we can derive analytically the deterministic behavior and use the results as reference. We then remove part of the knowledge a peer has about its neighbors and derive the performance that can be obtained in such an environment. Results show that, if peers have suf- ficient information about neighbors, they can be organized in such a way that slow peers obtain near optimal performance without affecting faster peers. On the other hand, if peers do not know neighbor characteristics, slow peers have a significant impact on global performance, and other, more sophisticated, distribution architectures are required to maintain proper scalability.
An analysis of how antivirus methodologies are utilized in protecting computers from malicious code
Authors: Daniel J. Sanok,  Jr
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

Antivirus software utilizes several methodologies in scanning, detecting, and protecting computers and systems from viruses. As understanding increases about the vectors malicious code uses to attack and how antivirus software protects computer systems from the viruses, people will be able to more effectively help in creating an environment that is secure and virus free. This paper examines the techniques of signature detection, heuristics, and general decryption that antivirus software uses to detect and clean viruses.
Esdcat: a new cad software package for full-chip esd protection circuit design verification
Authors: Albert Z. Wang
Venue:  (2005)

Electrostatic Discharge (ESD) induced failure is one of the most devastating reliability problems to ICs (integrated circuits). On-chip ESD protection is therefore required for all IC chips to prevent ESD damages from happening. New CAD (computer-aided design) tools are essential to ESD protection design prediction and verification at full chip level. This work focuses on developing the first intelligent CAD tool package, entitled ESDCat, for full-chip ESD design verification at both layout level and schematic level. At the layout level, the ESDCat package consists of two modules: ESDExtractor, and ESDInspector. ESDExtractor is a new arbitrary ESD protection device extraction CAD tool that allows extraction of all possible ESD protection devices of arbitrary types, intentional or parasitic, from IC layout files. The main function of the ESDInspector is to remove non-critical ESD devices extracted and perform intelligent physical design checking at layout level based upon a novel smart parametric checking mechanism. At the schematic level, ESD device modeling and circuit simulation using HSPICE is discussed. The future work is to develop a mix-mode circuit simulator, called ESDSimulator. Finally, ESDZapper is developed to simulate the complex ESD measurements, called ESD zapping tests.
Generating Aspects-Classes Integration Testing Sequences: A Collaboration Diagram Based Strategy
Authors: Philippe Massicotte, Mourad Badri, Linda Badri
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Aspect-oriented software development is an emerging software engineering paradigm. It provides new constructs and tools to improve separation of crosscutting concerns into single units called aspects. The aspect paradigm introduces, in fact, new abstractions in software development. AspectJ is an aspect-oriented extension for Java. Actually, existing object-oriented programming languages suffer from a serious limitation in modularizing adequately crosscutting concerns. Many concerns crosscut several classes in an object-oriented system. However, the aspect paradigm introduces new dimensions in terms of control and complexity. New dependencies between aspects and classes result in new testing challenges. In fact, aspects can interact with any class in a program. Interactions between aspects and classes are new sources for program faults. Object-oriented testing techniques do not cover the new dimensions introduced by aspects. Thus, new aspect-oriented testing techniques must be developed. We propose, in this paper, a new technique to generate test sequences based on the dynamic interactions between aspects and classes. We focus, in particular, on the integration of one or more aspects in a collaboration between a group of objects. The paper also introduces associated testing criteria. The proposed approach follows an iterative process.
Hint and Run: Accelerating XPath Queries
Authors: Ioana Stanoi, Christian A. Lang, Sriram Padmanabhan
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

XML documents are often represented as DOM structures or trees. In some instances, due to the complexity of queries, XPath queries are better evaluated by traversing these structures rather than using summarization indexes. A requirement for the optimization of document navigation, is to efficiently decrease the number of traversed nodes. The optimization task is more difficult when the query framework allows a syntax that enlarges the search space, such as wildcards and descendant queries. To reduce the overhead of query processing, many database systems supporting XML rely on indexes. Such indexes are typically not able to adapt to memory restrictions or workload changes. A secondary data structure that uses little storage space and tunes itself to address hot spots in processing, can therefore be beneficial. In this paper, we propose a first method for creating, using, and maintaining selective signatures called hints to aid in the navigation of XML documents. Hints form a flexible data structure for pruning the search space, that can be used on its own or it can complement existing indexes. The amount of hints used is variable, and it depends on the storage limitation set a priori, and on the efficiency of the hints. Our experiments show that hints can improve the efficiency of navigational XML query processing by a large margin while using only little extra memory.
A Formal Approach Facilitating the Evolution of Component-Based Software
Authors: Nguyen Truong Thang, Takuya Katayama
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

The component-based approach is very effective in software development and evolution. The most challenging issue of the approach is component composition. Though components are syntactically compatible in their interfaces, once plugged together, they do not perform as expected because components are semantically inconsistent with each other, i.e. the component consistency problem. This paper gives a formal approach to strengthen component specification by including component semantic written in the temporal logic CTL. Based on this semantic information, components can be efficiently cross-checked for their consistency, even for future unanticipated component extensions during system evolution.
Dynamic Slicing of Java Bytecode Programs
Authors: Attila Szegedi, Tibor Gyimothy
Venue: Proceedings of the Fifth IEEE International Workshop on Source Code Analysis and Manipulation (2005)

A forward global method for obtaining backward dynamic slices of Java bytecode programs is presented. In contrast with existing published techniques that require either a customized Java compiler (which also implies access to the source code) or bytecode instrumentation and eventual manual dependency specifications, our approach was to produce an instrumented virtual machine for Java. This approach works with programs compiled with arbitrary third party compilers and does not require access to the source code during the slicing process. However, we still retain the ability to express the slicing criterion and the resulting slice in terms of source code locations using the supplemental information present in the compiled code. Our technique also handles advanced aspects of the Java environment, such as exception handling, multithreaded execution and, to a certain degree, the execution of native machine code linked with the Java classes.
Innovative technologies for high density non-volatile semiconductor memories
Authors: Roberto Bez
Venue: Microelectronic Engineering (2005)

article-57-abstract
Floating-Gate Devices, Circuits, and Systems, invited
Authors: Paul Hasler
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper describes our programmable analog technology based around floating-gate transistors that allow for non-volitile storage as well as computation through the same device. We describe the basic concepts for floating-gate devices, capacitor-based circuits, and the basic charge modification mechanisms that makes this analog technology programmable. We describes the techniques to extend these techniques to program an nonhomogenious array of floating-gate devices.
A low cost and accurate guidance system for laparoscopic surgery: validation on an abdominal phantom
Authors: S. A. Nicolau, L. Goffin, L. Soler
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

In this paper we present a guiding system for laparoscopic surgery which tracks in real time the laparoscopic tools and registers at 10 Hz a preoperative CT/MRI model of the patient. To help surgeons, this system provides simultaneously three kinds of supplementary information. It displays the relative positions of the laparoscopic tools and the 3D patient model. It provides two external views of the patient on which his 3D model and tool positions are superimposed. Finally, it displays an endoscopic view augmented with the 3D patient model. Contrary to most systems for laparoscopic surgery, this one is low cost (one PC, two cameras and a printer are necessary) and we have rigorously validated its tracking accuracy in simulated clinical conditions (tracking accuracy of an instrument tip close to 1.5 mm, and endoscopic overlay error under 1.0 mm). Besides, our system accuracy is comparable with commercial system's ones. Eventually, experiments on an abdominal phantom with surgeons demonstrate its usefulness. We plan to realize our first experiments on patients in a few months.
What do meta-analyses tell us about CALL effectiveness?
Authors: Uschi Felix
Venue: ReCALL (2005)

A great deal of research has been carried out over the past two decades related to the effectiveness of computer-assisted teaching and learning. This large body of work, however, has not produced unequivocal findings, especially in the area of CALL. Our study takes a systematic look at what dedicated meta-research since 1991 might have contributed to this controversial field. Data was gathered from several hundred studies including ca 20,000 subjects. The paper highlights the benefits and limitations associated with this type of research, synthesizes findings and recommends models and strategies for future research in the context of an agreed research agenda. Our synthesis suggests consistent positive findings related to L1 spelling, writing and reading. While there is some support for this related to CALL per se, much work needs to be done before we might reach the levels of confidence enjoyed by some of the findings reported here.
"UBWALL", ubiquitous wall changes an ordinary wall into the smart ambience
Authors: Minoru Sekiguchi, Hirohisa Naito, Akinobu Ueda, Toru Ozaki, Masao Yamasawa
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

This paper describes how smart ambience improves information services. For information services in a public space, UBWALL is developed named after "ubiquitous wall", which has a large display and eight-series of built-in RFID reader/writer so that people can get individual information appropriately by using IC cards (RFID cards) or mobile terminals. UBWALL is usually installed in a public space for the purpose of advertisements or directory services, where people can see both the public and personalized information at a time identifying user profile by touching with RFID cards. UBWALL was exhibited in several exhibitions and we confirmed its effectiveness and availability as a new system for information services.
OWL-WS: A Workflow Ontology for Dynamic Grid Service Composition
Authors: Stefano Beco, Barbara Cantalupo, Ludovico Giammarino, Nikolaos Matskanis, Mike Surridge
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Semantic Grid is becoming a key enabler for next generation Grid and the need of supporting process description and enactment, by means of composition of multiple resources, emerged as one of the fundamental requirements. Within NextGRID1 project, the idea of adopting business processes (expressed as workflow policies) as architectural components in a next generation Grid has been developed with the aim of providing architecture with dynamic behaviour and interoperability. The need of a semantic workflow representation language then emerged and was developed defining an OWL-S extension able to support workflow description. The resulting OWL-WS (OWL for Workflow and Services) ontology allows us modelling concept like abstract and concrete services and workflows according to a Semantic Workflow Model also enabling specification of higher-order workflows and semantic service grouping. This language is being used for specifying adaptive business processes (policy) that are used as evaluation and binding mechanisms by a Workflow Enactment Engine.
Security of erasable memories against adaptive adversaries
Authors: Giovanni Di Crescenzo
Venue: Proceedings of the 2005 ACM workshop on Storage security and survivability (2005)

We study cryptographic modeling and encryption-based design techniques for guaranteeing privacy of data that is first stored in some type of computer memory and then deleted. We continue the investigation started in [3] by presenting an enhanced privacy notion that captures practical scenarios of adversaries repeatedly and adaptively attacking the memory to inspect its entire content before trying to obtain information about deleted data. We prove that the new notion is strictly stronger than the previous one considered in [3] (allowing the adversary a single intrusion), and show then that the efficient protocol in [3] still satisfies the new notion. One question implicitly raised by the previous work was whether it is indeed possible to define one meaningful and applicable notion of security even against adversaries that can repeatedly and adaptively obtain total control of the memory. Perhaps unexpectedly, our paper affirmatively answers this question.