ppxscal/embedding_network huggingface dataset:
Proxy Ring Signature: Formal Definitions, Efficient Construction and New Variant
Authors: Jin Li, Xiaofeng Chen, Tsz Hon Yuen, Yanming Wang
Venue: Computational Intelligence and Security: International Conference, CIS 2006, Guangzhou, China, November 3-6, 2006, Revised Selected Papers (2007)

Proxy ring signatures allows proxy signer to sign messages on behalf of the original signer while providing anonymity. In this paper, we give the first formal security definitions and notions of proxy ring signatures. Subsequently, we propose a short proxy ring signature scheme, with rigorous security proofs. It is more efficient than the existing proxy ring signature schemes. Finally, we propose a new kind of proxy ring signatures. Existing proxy ring signatures in the literature provide anonymity for proxy signer only. We extend the notion to support anonymity for original signer as well. We give an efficient and secure instantiation of it.
Mosaicking Cluttered Ground Planes Based on Stereo Vision
Authors: José Gaspar, Miguel Realpe, Boris Vintimilla, José Santos-Victor
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

Recent stereo cameras provide reliable 3D reconstructions. These are useful for selecting ground-plane points, register them and building mosaics of cluttered ground planes. In this paper we propose a 2D Iterated Closest Point (ICP) registration method, based on the distance transform, combined with a fine-tuning-registration step using directly the image data. Experiments with real data show that ICP is robust to 3D reconstruction differences due to motion and the fine tuning step minimizes the effect of the uncertainty in the 3D reconstructions.
Modeling dynamic substate chains among massive states
Authors: Viet Phuong Nguyen, Takashi Washio
Venue: Intelligent Data Analysis (2008)

This paper proposes a novel framework, named HIgh-order Substate Chain (HISC) modeling, to capture the entire system dynamics underlying the transaction time series, where the transaction contains explosive states due to the combinatorics of massively observed inputs. In a practical situation, the objective system consists of multiple subsystems where a state of each subsystem is represented by a subset of the transaction. Thus, a transaction observed from the entire objective system is considered to be a collection of such subsets, and each subset is called a "substate" of the objective system. The basic task of our HISC modeling is to efficiently and simultaneously identify the substates and their transitions embedded in the time series. For application, the methods for system dynamics simulation and substate prediction by using the HISC model have been developed. Its significant performance has been confirmed through the evaluation on synthetic data, the comparisons with some High-order Markov chain models in the state of the art and the application to practical data analysis.
Distributed power control (dpc) based energy efficient protocols for wireless networks
Authors: S. Jagannathan
Venue:  (2006)

Energy efficiency is an important issue for wireless networks since it extends the lifetime of a wireless network and improves quality of service (QoS). Therefore, the overall objective of this dissertation is to develop energy efficient schemes and medium access control (MAC) protocols for wireless networks in the presence of fading channels while satisfying network constraints and user defined QoS requirements.First, a novel distributed power control (DPC) scheme is introduced for cellular networks and subsequently extended to wireless ad hoc and sensor networks by using a new channel prediction scheme. DPC minimizes energy consumption by predicting the least transmission power required to maintain a desired Signal-to-Noise-Ratio (SNR). Next, innovative predictive congestion control schemes for wireless ad hoc and sensor networks are presented. They exercise flow control to overcome buffer overflows thus reducing retransmissions and minimizing excess energy consumption. The ad hoc version of the protocol relies on rate adaptation of packets by using multiple modulation schemes. Tradeoff between higher throughput and lower energy consumption is addressed using dynamic programming (DP) approach. In the case of sensor networks, nodes are limited to a single modulation rate. Hence, the proposed protocol relies on the adaptive selection of back-off intervals in order to prevent buffer overflows and satisfy a predefined QoS.The stability and convergence analysis of the proposed algorithms are guaranteed analytically and through extensive simulation studies by using the ns-2 simulator. Performance comparison of the proposed schemes with the ones available in the literature is also reported, with the proposed DPC scheme transmitting up to 3 times more data per joule than the 802.11, and the congestion control scheme adding further 15% to the efficiency over the DPC.
Free-Traversing Syntactic and Semantic Comparison on Semi-Structured Languages
Authors: Hyun-Joo Moon, Jae-Woo Yoo
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Tree traversing for syntactic and semantic comparison causes expensive time and space consumption. Internet, heterogeneous computing environments, and ubiquitous computing technologies all cause an explosive increase of Web data, and most Web data is written in semi-structured language format. With the growth of Web data usage and the importance of the management, comparison techniques such as similarity detection are more and more needed for efficient information and database management. This paper introduces a free-traversing technique without tree traversing on parse trees generated by the corresponding language parser to analyze its syntactic and semantic meaning. This free-traversing technique uses DIES (Direct Invariant Encoding Scheme) encoding method and has similar results with DFS (Depth First Search) of parse tree traversing. We use XML schema DTDs to evaluate our free-traversing technique. We adopt some of ontological technologies, and apply LCS (Longest Common String) and LNS (Longest Nesting common String) structure extraction methods. With this free-traversing technique, semi-structured Web data management can be much easier and faster than existing tree traversing methods.
Investigation of Partial Directed Coherence for Hand-Eye Coordination in Laparoscopic Training
Authors: Julian J. Leong, Louis Atallah, George P. Mylonas, Daniel R. Leff, Roger J. Emery, Ara W. Darzi, Guang-Zhong Yang
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

Effective hand-eye coordination is an important aspect of training in laparoscopic surgery. This paper investigates the interdependency of the hand and eye movement along with the variability of their temporal relationships based on Granger-causality. Partial directed coherence is used to reveal the subtle effects of improvement in hand-eye coordination, where the causal relationship between instrument and eye movement gradually reverse during simple laparoscopic tasks. For assessing the practical value of the proposed technique for minimally invasive surgery, two laparoscopic experiments have been conducted to examine the ability of the trainees in handling mental rotation tasks, as well as dissection and manipulation skills in laparoscopic surgery. Detailed experimental results highlight the value of the technique in investigating hand-eye coordination in laparoscopic training, particularly during early motor learning for complex bimanual procedures.
Eulogy: Herman Lukoff, 1923-1979
Venue: IEEE Annals of the History of Computing (1980)

We can no longer consult one of the pioneers of the computer industry. Herman Lukoff died on September 24, 1979, at the age of 56. He will be missed as an advisor and friend, and as one of the engineers who brought to fruition the visions of such luminaries as John Mauchly and Presper Eckert. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
eRehabilitation: A Portal Framework for Aural Rehabilitation
Authors: Dimitar Denev, Sion Morris, Carlos A Velasco, Yehya Mohamad
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This paper reports on the development of a prototype of an online rehabilitation support service ("eRehabilitation"). This service will provide long-term support to new users of hearing devices as they undergo the process of aural rehabilitation. The information service will be tailored to the situational and individual needs of patients. The development fits closely with the development of self-screening tests for hearing impairment that can be conducted over the Internet. Aural rehabilitation pathways can vary between European countries, not only in terms of language, but also in terms of procedures and regulations. This makes localization of such services a challenging task.
Order picking plan to maximize the order fill rate
Authors: Suk-Chul Rim, In-Sun Park
Venue: Computers and Industrial Engineering (2008)

In distribution centers, some orders may not be fulfilled due to the shortage of inventory. We consider the case where an order is picked and shipped only when all items in the order is available in the inventory; and the unfulfilled orders are transferred to the next day with higher priority. Given daily inventory and a set of orders arrived during a day, the problem is to assign the inventory to the orders so as to maximize the order fill rate (OFR). We formulate this problem as a linear programming problem. We also consider the weighted OFR to reflect the importance of each order. Simulation results indicate that the proposed LP approach outperforms the existing simple rules; and, more importantly, the improvement ratio increases as the number of items and/or orders increases.
HMM-Based Speech Synthesis for the Greek Language
Authors: Sotiris Karabetsos, Pirros Tsiakoulis, Aimilios Chalamandaris, Spyros Raptis
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

The success and the dominance of Hidden Markov Models (HMM) in the field of speech recognition, tends to extend also in the area of speech synthesis, since HMM provide a generalized statistical framework for efficient parametric speech modeling and generation. In this work, we describe the adaption, the implementation and the evaluation of the HMM speech synthesis framework for the case of the Greek language. Specifically, we detail on both the development of the training speech databases and the implementation issues relative to the particular characteristics of the Greek language. Experimental evaluation depicts that the developed text-to-speech system is capable of producing adequately natural speech in terms of intelligibility and intonation.
Particle-Based Shape Analysis of Multi-object Complexes
Authors: Joshua Cates, P. Thomas Fletcher, Martin Styner, Heather Cody Hazlett, Ross Whitaker
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

This paper presents a new method for optimizing surface point correspondences for shape modeling of multiobject anatomy, or shape complexes. The proposed method is novel in that it optimizes correspondence positions in the full, joint shape space of the object complex. Researchers have previously only considered the correspondence problem separately for each structure, thus ignoring the interstructural shape correlations that are increasingly of interest in many clinical contexts, such as the study of the effects of disease on groups of neuroanatomical structures. The proposed method uses a nonparametric, dynamic particle system to simultaneously sample object surfaces and optimize correspondence point positions. This paper also suggests a principled approach to hypothesis testing using the Hotelling T 2 test in the PCA space of the correspondence model, with a simulation-based choice of the number of PCA modes. We also consider statistical analysis of object poses. The modeling and analysis methods are illustrated on brain structure complexes from an ongoing clinical study of pediatric autism.
Data processing requirements for the purposes of numerical weather prediction
Authors: Joseph Smagorinsky
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

The physical background and historical development of numerical weather prediction is summarized. The nature of the mathematical problem and the work-load for a digital computer are then described. The existing system of processing meteorological information (particularly upper air data) for operational weather prediction is examined in the light of the anticipated needs for operational numerical weather prediction. The critique exposes deficiencies which may be intolerable for operational numerical weather prediction. Some suggestions are offered for revamping the existing system utilizing modern technological advances.
SAGE Overview
Authors: John F. Jacobs
Venue: IEEE Annals of the History of Computing (1983)

Editor's Note: I would like to thank Jack Jacobs for this overview, which gives a brief review of the history of SAGE and of some of the organizations involved. I cannot think of anyone better able to discuss SAGE than Jake who, along with his many other contributions, created and ran the Systems Office that coordinated the design efforts of the numerous organizations having subsystem design responsibilities.
A Conceptual Graph Based Approach to Ontology Similarity Measure
Authors: Madalina Croitoru, Bo Hu, Srinandan Dashmapatra, Paul Lewis, David Dupplaw, Liang Xiao
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

This paper presents a combinatorial, structure based approach to the problem of finding a (di)similarity measure between two Conceptual Graphs. With a growing number of ontologies and an increasing need for quick, on the fly knowledge integration and querying, ontology similarity measures are essential for building the foundations of the Semantic Web. Conceptual Graphs benefit from a graph based representation that can be exploited in versatile optimisation techniques. We propose a disimilarity measure based on the content and the structure of two graphs. This disimilarity measure is based on the clique number of the matching graph, a combinatorial structure which encodes the two graphs projection information.
Learning to Look at Humans -- What Are the Parts of a Moving Body?
Authors: Thomas Walther, Rolf P. Würtz
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

We present a system that can segment articulated, non-rigid motion without a priori knowledge of the number of clusters present in the analyzed scenario. We combine existing algorithms for tracking and extend clustering techniques by a self-tuning heuristic. Application to video sequences of humans shows good segmentation into limbs.
A Model-Driven Development Approach to Mapping UML State Diagrams to Synthesizable VHDL
Authors: Steve K. Wood, David H. Akehurst, Oleg Uzenkov, W. G. J. Howells, Klaus D. McDonald-Maier
Venue: IEEE Transactions on Computers (2008)

With the continuing rise in the complexity of embedded systems, there is an emerging need for a higher level modelling environment that facilitates efficient handling of this complexity. The aim here is to produce such a high level environment using Model Driven Development (MDD) techniques that maps a high level abstract description of an electronic embedded system into its low level implementation details. The Unified Modelling Language (UML) is a high level graphical based language that is broad enough in scope to model embedded systems hardware circuits. The authors have developed a framework for deriving Very High Speed Integrated Circuits Hardware Description Language (VHDL) code from UML state diagrams and defined a set of rules that enable automated generation of synthesisable VHDL code from UML specifications using MDD techniques. By adopting the techniques and tools described in this paper the design and implementation of complex state-based systems is greatly simplified.
Energy Dissipation Effect on a Quantum Neural Network
Authors: Mitsunaga Kinjo, Shigeo Sato, Koji Nakajima
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

A quantum neural network based on the adiabatic quantum computation is one of candidates to overcome the difficulty for developing a quantum computation algorithm. Furthermore, by applying energy dissipation to the adiabatic quantum computation, an application of the quantum neural network is expanded. In this paper, we discuss effect which arises from the utilization of energy dissipation on a quantum neural network. Preliminary results which have been shown by numerical simulations indicate an availability of the energy dissipation for the quantum neural network.
Protection Against Packet Fragmentation Attacks at 6LoWPAN Adaptation Layer
Authors: HyunGon Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

The IPv6 over low-power wireless personal area network (6LoWPAN) typically includes devices that work together to connect the physical environment to real-world applications, e.g., wireless sensors. However, since, in some cases, security may be requested at the application layer as need, and then, security problems should be identified such as security threats model, threats analysis, attack scenarios, and light-weight security algorithms etc. This paper presents an analysis of security threats to the 6LoWPAN adaptation layer from the point of view of IP packet fragmentation attacks. And to protect replay attacks being occurred by IP packet fragmentations and to guarantee packet freshness, we also propose a protection mechanism against packet fragmentation attacks. The mechanism uses Timestamp and Nonce options that are added to the fragmented packets at the 6LoWPAN adaptation layer.
Identifying Frequent Items in P2P Systems
Authors: Mei Li, Wang-Chien Lee
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

As peer-to-peer (P2P) systems receive growing acceptance, the need of identifying 'frequent items' in such systems appears in a variety of applications. In this paper, we define the problem of identifying frequent items (IFI) and propose an efficient in-network processing technique, called in-network filtering (netFilter), to address this important fundamental problem. netFilter operates in two phases: 1) candidate filtering: data items are grouped into item groups to obtain aggregates for pruning of infrequent items; and 2) candidate verification: the aggregates for the remaining candidate items are obtained to filter out false frequent items. We address various issues faced in realizing netFilter, including aggregate computation, candidate set optimization, and candidate set materialization. In addition, we analyze the performance of netFilter, derive the optimal setting analytically, and discuss how to achieve the optimal setting in practice. Finally, we validate the effectiveness of netFilter through extensive simulation.
On Constructing and Pruning SVM Ensembles
Authors: Bing-Yu Sun, Xiao-Ming Zhang, Ru-Jing Wang
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

This paper proposes an effective method for constructing and pruning support vector machine ensembles for improved classification performance. Firstly we propose a novel method for constructing SVM ensembles. Traditionally an SVM ensemble is constructed by the data sampling method; In our method, however,each individual SVM classifier is trained by using the same original training set, but with different kernel parameters.Compared to traditional SVM ensemble methods, our method need not to tune the kernel parameters for each individual SVM, thus the training of the SVM ensemble can be simplified considerably. Furthermore, we also propose several efficient method for pruning the constructed SVM ensembles. The proposed pruning methods cannot only simplify the SVM ensemble, but also improve its performance. A set of experiments were conducted to prove the efficiency and affectivity of our proposed approaches.
Modeling and Analyzing Variability for Mobile Information Systems
Authors: Raian Ali, Fabiano Dalpiaz, Paolo Giorgini
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

Advances in size, power, and ubiquity of computing, sensors, and communication technology made possible the development of mobile or nomadic information systems. Variability of location and system behavior is a central issue in mobile information systems, where behavior of software has to change and re-adapt to the different location settings. This paper concerns modeling and analysis of the complementary relation between software and location variability. We use graphical and formal location modeling techniques, show how to elicit and use location model in conjunction with Tropos goal-oriented framework, and introduce automated analysis on the location-based models.
Evaluation and Comparison of Inferred Regular Grammars
Authors: Neil Walkinshaw, Kirill Bogdanov, Ken Johnson
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

The accuracy of an inferred grammar is commonly computed by measuring the percentage of sequences that are correctly classified from a random sample of sequences produced by the target grammar. This approach is problematic because (a) it is unlikely that a random sample of sequences will adequately test the grammar and (b) the use of a single probability value provides little insight into the extent to which a grammar is (in-)accurate. This paper addresses these two problems by proposing the use of established model-based testing techniques from the field of software engineering to systematically generate test sets, along with the use of the Precision and Recall measure from the field of information retrieval to concisely represent the accuracy of the inferred machine.
Deadlock-Free Adaptive Routing in 2D Tori with a New Turn Model
Authors: Dong Xiang, Qi Wang, Yi Pan
Venue: Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing (2008)

A new deadlock-free partially adaptive routing algorithm is proposed for 2 ¿ dimensional (2D) tori with only two virtual channels. The deadlock avoidance technique is presented based on a new turn model for 2D tori. In order to avoid cyclic channel dependencies completely, we propose the new odd-even turn model for 2D tori. The new model is an improved algorithm of the original turn model, and sets some constraints for some special turns. As far as we know, there is no existing algorithm for deadlock-free partially adaptive routing in 2D tori using only two virtual channels in the literature up to now. Sufficient simulation results are presented to demonstrate the effectiveness of the proposed algorithm by comparing with several previous methods.