ppxscal/embedding_network huggingface dataset:
Performance Measurement of XML Compression Algorithms for DSRC Messages
Authors: Sabit Sayeed, Ramiro Liscano, Allauddin Ahmad
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The DSRC standard gives the provision to process messages in XML format instead of the default binary encoding scheme. Although, use of XML encoding provides flexibility, it also introduces bandwidth communication overhead since the message size will increase and end to end communication delay since processing time will also increase. There are many proposed XML compression algorithms to decrease message size but few have been tested for processing and communication delays for inter vehicle communication. In this paper, performance measurements for various compression algorithms on DSRC messages are presented.
Database Transformation, Query Translation, and Performance Analysis of a New Database Computer in Supporting Hierarchical Database Management
Authors: J. Banerjee
Venue: IEEE Transactions on Software Engineering (1980)

Database computers are special-purpose storage and processing devices which are intended to relieve the database management (software) systems running on the general-purpose computers and provide improved storage and processing capabilities (via hardware) for the existing and new database application. However, to support existing database applications, two steps must be followed. First, the existing database must be transformed into the storage format of the new database computer. This one-time tranformation, known as database transformation, is required to preserve the semantics of the database and to take advantage of the advanced hardware features of the new computer. Second, the database sublanguage used in the existing application programs must be supported in real time by the new database computer so that application programs may be executed in the new environment without the need of program conversion. Such real-time translation of sublanguage calls to the instructions of the new database computer, known as query translation, must be straightforward with minimal software support.
The Self-Tuning Neural Speed Regulator Applied to DC Servo Motor
Authors: Yuan Kang, Ming-Hui Chu, Chuan-Wei Chang, Yi-Wei Chen, Min-Chou Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This study utilizes the direct neural control (DNC) based on back propagation neural networks (BPN) with specialized learning architecture applied to regulate the speed of a DC servo motor. The proposed neural controller is treated as a speed regulator to keep the motor in constant speed without the specified reference model. A tangent hyperbolic function is used as the activation function, and the back propagation error is approximated by a linear combination of error and error's differential. The simulation and experiment results reveal that the proposed speed regulator keeps motor in constant speed with high convergent speed, and enhances the adaptability of the accurate speed control system.
Fast data anonymization with low information loss
Authors: Gabriel Ghinita, Panagiotis Karras, Panos Kalnis, Nikos Mamoulis
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Recent research studied the problem of publishing microdata without revealing sensitive information, leading to the privacy preserving paradigms of k-anonymity and l-diversity. k-anonymity protects against the identification of an individual's record. l-diversity, in addition, safeguards against the association of an individual with specific sensitive information. However, existing approaches suffer from at least one of the following drawbacks: (i) The information loss metrics are counter-intuitive and fail to capture data inaccuracies inflicted for the sake of privacy. (ii) l-diversity is solved by techniques developed for the simpler k-anonymity problem, which introduces unnecessary inaccuracies. (iii) The anonymization process is inefficient in terms of computation and I/O cost. In this paper we propose a framework for efficient privacy preservation that addresses these deficiencies. First, we focus on one-dimensional (i.e., single attribute) quasi-identifiers, and study the properties of optimal solutions for k-anonymity and l-diversity, based on meaningful information loss metrics. Guided by these properties, we develop efficient heuristics to solve the one-dimensional problems in linear time. Finally, we generalize our solutions to multi-dimensional quasi-identifiers using space-mapping techniques. Extensive experimental evaluation shows that our techniques clearly outperform the state-of-the-art, in terms of execution time and information loss.
Service adoption strategies of push over cellular
Authors: Timo Ali-Vehmas, Sakari Luukkainen
Venue: Personal and Ubiquitous Computing (2008)

Push to talk over Cellular (PoC) is a new still evolving service concept for mobile systems. Traditionally Push to Talk (PTT) service has been used in proprietary networks for decades but recently new Internet Protocol (IP) based specifications for PoC have been introduced. The service has been available in lead markets since 2004 but the mass-market adoption has not yet taken place. Commercialization process of PoC still includes many technical and market risks. The PoC technology has, however, potential to create new mobile service evolution path starting from voice and extending later on to other group applications. This document reviews different strategies related to standardization, system architecture, vendors' product strategies, substitutes, regulation and service provision relevant for PoC and discusses the various options for mobile operators and vendors how to implement this new service successfully.
Evaluate Nodes Importance in the Network Using Data Field Theory
Authors: Nan He, Wen-yan Gan, De-yi Li
Venue: Proceedings of the 2007 International Conference on Convergence Information Technology (2007)

Evaluating nodes importance in the network is an important research topic in the fields of complex networks, social network analysis and graph-based data mining. Enlightened by the knowledge of physical field, this paper proposes a topological ranking algorithm based on data field theory. Its basic idea is that each node in the network can be viewed as a material particle which creates a potential field around itself and the interaction of all nodes forms a topological field over the network. By defining and computing the topological potential score of each node, we can obtain a more accurate global ranking which can reflect nodes importance in the network. The theory and experimental results on toy and real-world networks indicate that when each node only influences its neighbors, the topological ranking is consistent with the degree ranking; as the node's influence spreads, the topological ranking turns out to have similar linear relevance with PageRank sort; when the influence reaches the diameter of the network, the topological ranking is close to the closeness ranking this time. Hence, this method not only provides a general framework for some classic ranking measures, but is also able to obtain an accurate ranking of vital nodes by optimizing correlative parameters, which can reveal the position differences of network topology. Keywords-- node importance; data field; graph; complex networks
TILTle: exploring dynamic balance
Authors: Paulina Modlitba, Dietmar Offenhuber, Moses Ting, Dido Tsigaridi, Hiroshi Ishii
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

In this paper we introduce a novel interface for exploring dynamic equilibria using the metaphor of a traditional balance scale. Rather than comparing and identifying physical weight, our scale can be used for contrasting digital data in different domains. We do this by assigning virtual weight to objects, which physically affects the scale. Our goal is to make complex comparison mechanisms more visible and graspable.
Logical Structure Analysis for Form Images with Arbitrary Layout by Belief Propagation
Authors: A. Minagawa, Y. Fujii, H. Takebe, K. Fujimoto
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

A new method for analyzing the specific logical structure of forms with unknown layout is proposed. This method uses both the target form image and a generic logical structure as inputs, and models two types of relationships probabilistically: that between strings and logical components, and that between neighboring strings having different logical components. This modeling approach allows strings to be assigned to logical components softly but robustly, and allows the use of an intuitive Bayesian probability network similar to the generic logical structure. Based on this probability network model, strings corresponding to logical components can be determined by belief propagation. This method is demonstrated to be effective by conducting tests on three types of forms.
A cooperative SIP infrastructure for highly reliable telecommunication services
Authors: Ali Fessi, Heiko Niedermayer, Holger Kinkelin, Georg Carle
Venue: Proceedings of the 1st international conference on Principles, systems and applications of IP telecommunications (2007)

Voice over IP (VoIP) has been a promising technology for several years. Although it has become very popular, the vision to substitute the "good old" Public Switched Telephone Network (PSTN) is still far from being true. Several issues, such as security, reliability and emergency calls are slowing down the integration of VoIP. Currently, there is a mixture of technologies where VoIP is often used for reducing costs, while still keeping the PSTN if a reliable communication is needed. Peer-to-Peer (P2P) and overlay networks received a large attention in the research community in the last few years. P2P networks provide self-organization and scalability. Recent work involved P2P-based signaling for lookup services for Voice over IP (VoIP) communication based on the Session Initiation Protocol (SIP). The main motivation behind P2P-basd SIP is to support ad hoc communication, to simplify the configuration of SIP networks, to make SIP networks more scalable and to provide services independently of other network components such as DNS. However, pure P2P networks do not have only their advantages. They create also several security threats which are hard to solve. Some of them, for example, the Sybil attack, have been proven to be unsolvable without centralized authorities or an additional out-of-band mechanism. P2P-based SIP may also create a high potential for Spam over IP Telephony (SPIT). In this paper, we present a hybrid solution for telecommunication networks that fills the gap between centralized (and therefore vulnerable to Denial-of-Service (DoS) attacks) telecommunication infrastructures and pure P2P-based telecommunication networks (which are vulnerable to SPIT, Sybil attacks, eclipse attacks, partition attacks, etc.). Our approach works with a SIP server under normal operation, while SIP User Agents (UAs) organize themselves into a P2P network. In the normal case, SIP UAs can profit from the lookup performance provided by the SIP server, which is usually better than the performance provided by the P2P network. In case of a service interruption of the infrastructure, the SIP network will function further due to the interconnection in the P2P network. Since the server and the P2P network cooperate in order to improve reliability, survivability, performance and security, we call this approach Cooperative SIP (CoSIP). We present our prototype implementation of CoSIP and discuss the potential for improvements compared to server-based SIP and P2P-based SIP.
Information Management System Using Structure Analysis of Paper/Electronic Documents and Its Applications
Authors: Minenobu Seki, Masakazu Fujio, Takeshi Nagasaki, Hiroshi Shinjo, Katsumi Marukawa
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

An information management system using analyzing document structure is presented. The purpose is simultaneous management of information in various paper and electronic documents. The system contains image document analysis, PDF document analysis, and HTML document analysis. The two applications are presented and the developed prototypes are described. One application is document summarization. The other application is table understanding to correlate data to items.
Max Newman: Topologist, Codebreaker, and Pioneer of Computing
Authors: David Anderson
Venue: IEEE Annals of the History of Computing (2007)

The dominant discourse in the History of Computing holds that the world's first stored-program digital electronic computer--the Manchester "Baby"--was developed under the sole leadership and direction of the Department of Electro-Technics. This biography, which arises out of a detailed re-examination of the historical evidence, challenges the dominant account of the project and re-situates the mathematician M.H.A. Newman as its overall leader.
A new channel coding algorithm based on phosphorylation/dephosphorylation-proteins and GTPases
Authors: Jian-Qin Liu, Hidefumi Sawai
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

Although molecular signaling of phosphorylation/dephosphorylation-proteins and GTPases has been extensively studied in molecular biology, it is still an open problem as to how information be coded in these molecules for molecular communication. In this paper, we propose a new channel coding algorithm based on signaling pathways in cells, extending our previous work on source codes to channel codes. The time complexity of the encoding/decoding algorithm we proposed is O(Qxm+Lx(P+&zeta;)) where Q refers to the number of the elements in the set of information vectors, m refers to the length of GTPase codeword, L refers to the number of the GTPase groups, P is the number of phosphorylation/dephosphorylation-proteins, &zeta; refers to the number of GTPases that are embedded in X'-codeword. This result shows the algorithm is theoretically realistic because the encoding/decoding process in a linear order time complexity is efficient. This benefits the studies on engineered cell communication in terms of information theory.
Restraining False Feedbacks in Peer-to-Peer Reputation Systems
Authors: Yu Jin, Zhimin Gu, Zhijie Ban
Venue: Proceedings of the International Conference on Semantic Computing (2007)

The efficiency of reputation system depends on the quality of feedbacks. However current reputation models in peer-to-peer systems can not process such strategic feedbacks as correlative and collusive ratings. Furthermore in them there exists unfairness to blameless peers. We propose a new reputation management mechanism to restrain false feedbacks. Our method uses two metrics to evaluate peers: feedback and service trust. After a transaction both service consumer and provider report the quality of this transaction. According to two ratings, service trust of server and feedback trust of consumer are separately updated. Furthermore the former is closely related to the latter. Besides reputation model we also propose a punishment mechanism to prevent malicious servers and liars from iteratively exerting bad behaviors in the system. However under punishment server is only restrained from providing services and it can continuously send out service requests; consumer is restrained from launching requests while it can provide services. Simulation shows our approach can effectively process aforesaid strategic feedbacks and mitigate unfairness.
Balancing Privacy and Risk in the E-Messaging World
Authors: Dianne Solomon
Venue: IEEE Security and Privacy (2007)

As the confluence of security, privacy, and opportunity within organizations, e-messaging has become the center of a legal and regulatory maelstrom. Solomon examines some of the more significant legal and regulatory drivers and illustrates what risk might look like within an organization.
Evaluation of real-time physics simulation systems
Authors: Adrian Boeing, Thomas Bräunl
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

We present a qualitative evaluation of a number of free publicly available physics engines for simulation systems and game development. A brief overview of the aspects of a physics engine is presented accompanied by a comparison of the capabilities of each physics engine. Aspects that are investigated the accuracy and computational efficiency of the integrator properties, material properties, stacks, links, and collision detection system.
Improved Lempel-Ziv Algorithm Based on Complexity Measurement of Short Time Series
Authors: Feng-tao Liu, Yong Tang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

The Lempel-Ziv algorithm is not fully suitable for measuring the complexity of short series. When the Lempel-Ziv algorithm is applied, the assumption that the sequence must be long enough is always ignored: the series length is usually too large, and the equi-probability assumption also is not considered in some papers. Based on these facts, the universal algorithm of trial and error is presented when the conditions of different sequence lengths and different symbol probabilities are comprehensively considered. The facts that the over- valuation would occur in measuring normalized complexity of short sequences with the original Lempel-Ziv algorithm and obtained results through improved Lempel- Ziv algorithm more in accord with the reality are testified by virtue of tests of ultra-short series, Logistic equation of different state, observed traffic flow.
Manipulating Data Structures in Pictorial Information Systems
Authors: M. Chock
Venue: Computer (1981)

Spatial data handling systems generally use either topological or grid image data structures. It makes little sense for these systems to be incompatible.
Role-playing games for capacity building in water and land management: Some Brazilian experiences
Authors: Maria Eugênia Camargo, Pedro Roberto Jacobi, Raphaèle Ducrot
Venue: Simulation and Gaming (2007)

Role-playing games in natural resource management are currently being tested as research, training, and intervention tools all over the world. Various studies point out their potential to deal with complex issues and to contribute to training processes. The objective of this contribution is to analyze the limits and potentialities of this tool for capacity building in environmental management of stakeholders with low educational levels by comparing various Brazilian experiences. Five games that were developed and used to train local stakeholders or state technicians about specific aspects of new and di ficult to understand legislation are compared. The comparison of these experiences is based on (a) an analysis of the materials (game support) provided by the developers, (b) interviews with authors and game developers, and (c) participation in game sessions whenever possible.
Guest Editors' Introduction: GALS Design and Validation
Authors: Mike Kishinevsky, Sandeep K. Shukla, Kenneth S. Stevens
Venue: IEEE Design Test (2007)

Globally asynchronous, locally synchronous (GALS) design has grown in popularity in both academia and industry. Breaking the synchrony assumption in digital design is often unsettling for designers, and to alleviate the difficulty, researchers in EDA have been proposing various GALS-based solutions. However, the tools, verification techniques, and testing methodologies for asynchronous designs are not as widespread as for synchronous digital design, leading to the hitherto limited usage of GALS design approaches. This special issue introduces some of the basic issues of GALS design and validation in the hardware domain. The hope is that this special issue will generate more interest by researchers and industry practitioners in creating design tools, techniques, and validation methodologies for GALS design.
GRID-enabled Solution of Groundwater Inverse Problems on the TeraGrid Network
Authors: Mohamed Sayeed, Kumar Mahinthakumar, Nicholas T. Karonis
Venue: Simulation (2007)

Grid-computing environments are becoming increasingly popular for scientific computing due to the significant increase in capacity that they represent when compared to a single computational resource (e.g., a single cluster), their ubiquitous availability and advances in grid middleware components. Several such specialized grid environments are now available for users in the commercial and research sectors. One such effort for research is the TeraGrid, consisting of a collection of geographically distributed heterogeneous supercomputer resources including data storage resources. Parallel implementations for these environments are inherently multilevel and obtaining efficient mapping of work to processors can be eXtremely challenging. This paper eXtends an eXisting MPI application to the grid via the use of grid-enabled MPI libraries. The application uses a simulation-optimization framework involving coarse-grained parallelism in the optimizer and fine-grained parallelism in the finite-element-based simulator. Using parallelism at both these levels is essential for problems involving computationally intensive simulation steps. A hierarchical grid architecture consisting of a collection of supercomputers is ideally suited for these types of problems as a good application-to-architecture mapping can be obtained with a proper implementation. This paper presents the performance results of our implementation on the TeraGrid network consisting of three geographically distributed supercomputers.
A Framework for Studying Clones In Large Software Systems
Authors: Zhen Ming Jiang, Ahmed E. Hassan
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

Clones are code segments that have been created by copying-and-pasting from other code segments. Clones occur often in large software systems. It is reported that 5 to 50% of the source code of a large software system is cloned. A major challenge when studying code cloning in large software systems is handling the large amount of clone candidates produced by leading edge clone detection tools. For example, the CCFinder, clone detection tool, produces over 7 million pairs of clone candidates for the Linux kernel (which consists of over 4 MLOC). Moreover, the output of clone detection tools grows rapidly as a software system evolves. Researchers and developers need tools to help them study the large amount of clone data in order to better understand the clone phenomena in large systems. In this paper, we propose a data mining framework to help researchers cope with the large amount of data produced by clone detection tools. We propose techniques to reduce, abstract and highlight the most interesting data produced by clone detection tools. Our framework also introduces a visualization tool which allows users to query and explore clone data at various abstraction levels. We demonstrate our framework on a case study of the clone phenomena in the Linux kernel.
On the discrete version of Picone's identity
Authors: S. Amghibech
Venue: Discrete Applied Mathematics (2008)

For a real number p with 1
The Beta2-spline: A Special Case of the Beta-spline Curve and Surface Representation
Authors: Brian Barsky, Tony DeRose
Venue: IEEE Computer Graphics and Applications (1985)

Simpler equations and computationally more efficient algorithms make the Beta2-spline technique easier to understand and useful to the designer.