ppxscal/embedding_network huggingface dataset:
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
Authors: Brent Waters
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

We present a new methodology for proving security of encryption systems using what we call Dual System Encryption. Our techniques result in fully secure Identity-Based Encryption (IBE) and Hierarchical Identity-Based Encryption (HIBE) systems under the simple and established decisional Bilinear Diffie-Hellman and decisional Linear assumptions. Our IBE system has ciphertexts, private keys, and public parameters each consisting of a constant number of group elements. These results are the first HIBE system and the first IBE system with short parameters under simple assumptions.In a Dual System Encryption system both ciphertexts and private keys can take on one of two indistinguishable forms. A private key or ciphertext will be normal if they are generated respectively from the system's key generation or encryption algorithm. These keys and ciphertexts will behave as one expects in an IBE system. In addition, we define semi-functional keys and ciphertexts. A semi-functional private key will be able to decrypt all normally generated ciphertexts; however, decryption will fail if one attempts to decrypt a semi-functional ciphertext with a semi-functional private key. Analogously, semi-functional ciphertexts will be decryptable only by normal private keys.Dual System Encryption opens up a new way to prove security of IBE and related encryption systems. We define a sequence of games where we change first the challenge ciphertext and then the private keys one by one to be semi-functional. We finally end up in a game where the challenge ciphertext and all private keys are semi-functional at which point proving security is straightforward.
Performance implications of synchronization structure in parallel programming
Authors: Arturo González-Escribano, Arjan J. C. van Gemund, Valentín Cardeñoso-Payo
Venue: Parallel Computing (2009)

The restricted synchronization structure of so-called structured parallel programming paradigms has an advantageous effect on programmer productivity, cost modeling, and scheduling complexity. However, imposing these restrictions can lead to a loss of parallelism, compared to using a programming approach that does not impose synchronization structure. In this paper we study the potential loss of parallelism when expressing parallel computations into a programming model which limits the computation graph (DAG) to series-parallel topology, which characterizes all well-known structured programming models. We present an analytical model that approximately captures this loss of parallelism in terms of simple parameters that are related to DAG topology and workload distribution. We validate the model using a wide range of synthetic and real-world parallel computations running on shared and distributed-memory machines. Although the loss of parallelism is theoretically unbounded, our measurements show that for all above applications the performance loss due to choosing a series-parallel structured model is invariably limited up to 10%. In all cases, the loss of parallelism is predictable provided the topology and workload variability of the DAG are known.
Dynamic Graph Clustering Using Minimum-Cut Trees
Authors: Robert Görke, Tanja Hartmann, Dorothea Wagner
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering algorithm by Flake et al. does however yield such a provable guarantee. We show that the structure of minimum-s-t-cuts in a graph allows for an efficient dynamic update of minimum-cut trees, and present a dynamic graph clustering algorithm that maintains a clustering fulfilling this quality quarantee, and that effectively avoids changing the clustering. Experiments on real-world dynamic graphs complement our theoretical results.
Using ASR for Transcription of Teleconferences in IM Systems
Authors: Ira R. Forman, Thomas Brunet, Paul Luther, Allen Wilson
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

The integration of voice transmission into instant messaging systems may be a boon for most of us, but causes a problem for others, that is, this integration will disadvantage those who are deaf and hard of hearing. This problem may be mitigated with transcription implemented with automated speech recognition (ASR). This paper describes a plug-in for IBM's Sametime instant messaging product that uses commercial ASR products to provide transcription. The user interface and the lessons learned from the wide use of the plug-in are described.
Towards Demonstrably Correct Compilation of Java Byte Code
Authors: Michael Leuschel
Venue: Formal Methods for Components and Objects: 7th International Symposium, FMCO 2008, Sophia Antipolis, France, October 21-23, 2008, Revised Lectures (2009)

In this paper we investigate the feasibility of a demonstrably correct compiler for Java bytecode. We first examine the suitability of adapting the existing high assurance compiler DeCCo for the Pascal-like language PASP, based on a Z formalisation of the compiler manually transcribed to Prolog. During the investigation we have uncovered several problematic issues and argue that these can be avoided by formally deriving the code of the compiler from the formal specification, rather than manually transcribing it. We have conducted a case study, developing a compiler for a subset of Java bytecode to an idealised RISC processor using the B-method. We show that refinement is a natural way to model compilation and that the B-method can in principle be used to develop a demonstrably correct compiler. In particular, the tool support for B turned out to be extremely valuable: animation, automated refinement checking, and proof each uncovered a series of mistakes.
Fingerprint Texture Feature for Discrimination and Personal Verification
Authors: Zahoor Ahmad Jhat, Ajaz Hussain Mir, Simeen Rubab
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Fingerprint is a reliable biometric which is used for personal verification. Current fingerprint verification techniques can be broadly classified as Minutiae-based, ridge feature-based and correlation-based each having its own merits and demerits. In this paper, we propose use of the statistical texture analysis of a fingerprint using spatial grey level dependence method (SGLDM) for discrimination and personal verification. This method extracts texture features by an algorithm based on the spatial grey level dependence method.The fingerprint images were randomly chosen from the fingerprint databases of FVC 2000 and FVC2002. Results show that fingerprint texture feature can be reasonably used for discrimination and for personal verification.
Efficient algorithms to solve Bayesian Stackelberg games for security applications
Authors: Praveen Paruchuri, Jonathan P. Pearce, Janusz Marecki, Milind Tambe, Fernando Ordonez, Sarit Kraus
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the adversary chooses its own strategy. We consider Bayesian Stackelberg games, in which the leader is uncertain about the type of the adversary it may face. Such games are important in security domains, where, for example, a security agent (leader) must commit to a strategy of patrolling certain areas, and an adversary (follower) can observe this strategy over time before choosing where to attack. We present here two different MIP-formulations, ASAP (providing approximate policies with controlled randomization) and DOBSS (providing optimal policies) for Bayesian Stackelberg games. DOBSS is currently the fastest optimal procedure for Bayesian Stackelberg games and is in use by police at the Los Angeles International Airport(LAX) to schedule their activities.
Study on Fuzzy Control Technology for Starting Process of AMT Clutch
Authors: Kong Huifang, Yan Gang
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

The clutch engagement control of Automated Mechanical Transmission (AMT) system is the core and difficult issue in the development of AMT. This paper analyzes the clutch engagement process during starting in a bid to realize a stable starting with minor jerk and friction work. On the basis of the driver’s intention, the vehicle work states and the road information, fuzzy controller was used to control the clutch engagement degree and engagement speed to realized stable starting. The simulation results show that the system performances are satisfied. This method is useful to improve vehicle performances.
Cryptanalysis of the LAKE Hash Family
Authors: Alex Biryukov, Praveen Gauravaram, Jian Guo, Dmitry Khovratovich, San Ling, Krystian Matusiewicz, Ivica Nikolić, Josef Pieprzyk, Huaxiong Wang
Venue: Fast Software Encryption: 16th International Workshop, FSE 2009 Leuven, Belgium, February 22-25, 2009 Revised Selected Papers (2009)

We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitives of LAKE, we show three different collision and near-collision attacks on the compression function. The first attack uses differences in the chaining values and the block counter and finds collisions with complexity 233. The second attack utilizes differences in the chaining values and salt and yields collisions with complexity 242. The final attack uses differences only in the chaining values to yield near-collisions with complexity 299. All our attacks are independent of the number of rounds in the compression function. We illustrate the first two attacks by showing examples of collisions and near-collisions.
Improvement of Association Rules Mining Algorithm in Wireless Network Intrusion Detection
Authors: Ye Changguo, Zhang Qin, Zhou Jingwei, Wei Nianzhong, Zhu Xiaorong, Wang Tailei
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

This paper, first analyzes the method of wireless network intrusion detection, presents a wireless network intrusion detection algorithm based on association rule mining. The application of fuzzy association rules in the wireless network intrusion detection is mainly discussed, and the steps to implement the algorithm are expressed. A comparative analysis with the classical algorithm Apriori is made by experiment. The results show that wireless network intrusion detecting using fuzzy association rules mining algorithm is a feasible method.
Adding mechanisms for QoS to a network-on-chip
Authors: Marcelo Daniel Berejuck, Cesar Albenes Zeferino
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

Networks-on-Chip (NoCs) are recognized as an interconnection architecture with capability of providing scalable performance, which is an important feature for communication in future SoCs (Systems-on-Chip) with high density. Most NoC models proposed in the last years are best effort networks, which offer no guarantees of Quality of Service (QoS) in communication. However, many of the applications envisaged for future SoCs have QoS requirements. In this work, they are presented the deployment of three different mechanisms for providing QoS to a best effort NoC: circuit switching, virtual channels and virtual channels combined with aging scheduling. All the deployments were made in VHDL, and testbenches were used to verify their correct operation. SystemC-based models were also described in order to evaluate the impact of these techniques on the network performance. Results show how the implemented techniques improve the ability of the network in meeting QoS requirements.
UDWGA Operator and its Application to Dynamic Multiple Attribute Decision Making
Authors: Guiwu Wei
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

With respect to dynamic multiple attribute decision making(DMADM) problems with uncertain preference relations. Definition and some operational laws of uncertain variables are introduced, and two new operators called dynamic uncertain weighted geometric averaging (DUWGA) operator and dynamic uncertain geometric averaging (DUGA) operator are presented. A model based on DUWGA and UWGA operators is developed to solve the dynamic multiple attribute decision making problems which the attribute values takes the form of uncertain information collected at the different periods. Then the DUWGA and UWGA operators are utilized to aggregate the overall uncertain information corresponding to each alternative, and then rank the alternatives and select the most desirable one(s). Finally, an illustrative example is given to verify the developed approach and to demonstrate its practicality and effectiveness.
Embedded Control System Design for Autonomous Navigation Mobile Robot
Authors: Wei Wu, Geng HaiFei, Guo Yan
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

This paper presents Embedded Based Control System Design for Autonomous Navigation Mobile Robot. A hierarchical control systems that based on multi-processor is given, including the main control system based on the S3C2440, subordinate control system based on the IDM240/640 and PC control system; we also describe the design method of control system from hardware to software detailed.. The robot can achieve visual navigation and manner to reach the target point timely and accurately in the complex unknown environment.
Towards Parametric Verification of Prioritized Time Petri Nets
Authors: Anna Dedova, Irina Virbitskaite
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

The intention of the paper is to develop an algorithm for parametric timing behaviour verification of real-time and concurrent systems represented by prioritized time Petri nets (PrTPNs). To achieve the purpose, we introduce a notion of the parametric PrTPN which is a modification of the PrTPN by using parameter variables in specification of timing constraints on transition firings. System properties are given as formulae of a parametric extension of the real-time branching time temporal logic TCTL, PTCTL. The verification algorithm consists in constructing conditions on timing parameter variables under which the PrTPN with bounded parameters works w.r.t. the checked PTCTL-formula. It is also shown the correctness and evaluated the complexity of the algorithm proposed.
A Unified Framework for MR Based Disease Classification
Authors: Kilian M. Pohl, Mert R. Sabuncu
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

In this paper, we employ an anatomical parameterization of spatial warps to reveal structural differences between medical images of healthy control subjects and disease patients. The warps are represented as structure-specific 9-parameter affine transformations, which constitute a global, non-rigid mapping between the atlas and image coordinates. Our method estimates the structure-specific transformation parameters directly from medical scans by minimizing a Kullback-Leibler divergence measure. The resulting parameters are then input to a linear Support Vector Machine classifier, which assigns individual scans to a specific clinical group. The classifier also enables us to interpret the anatomical differences between groups, as we can visualize the discriminative warp that best differentiates the two groups. We test the accuracy of our approach on a data set consisting of Magnetic Resonance scans from 16 first episode schizophrenics and 17 age-matched healthy control subjects. The data set also contains manual labels for four regions of interest in both hemispheres: superior temporal gyrus, amygdala, hippocampus, and para-hippocampal gyrus. On this small size data set, our approach, which performs classification based on the MR images directly, yields a leave-one-out cross-validation accuracy of up to 90%. This compares favorably with the accuracy achieved by state-of-the-art techniques in schizophrenia MRI research.
Agent-based simulation of electricity markets: a survey of tools
Authors: Zhi Zhou, Wai Kin Chan, Joe H. Chow
Venue: Artificial Intelligence Review (2007)

Agent-based simulation has been a popular technique in modeling and analyzing electricity markets in recent years. The main objective of this paper is to study existing agent-based simulation packages for electricity markets. We first provide an overview of electricity markets and briefly introduce the agent-based simulation technique. We then investigate several general-purpose agent-based simulation tools. Next, we review four popular agent-based simulation packages developed for electricity markets and several agent-based simulation models reported in the literature. We compare all the reviewed packages and models and identify their common features and design issues. Based on the study, we describe an agent-based simulation framework for electricity markets to facilitate the development of future models for electricity markets.
An Improved PSO-Based Rule Extraction Algorithm for Intrusion Detection
Authors: Zhao Chang, Wang Wei-ping
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

The Particle Swarm Optimization (PSO) algorithm is already proved efficient in the rule extraction in intrusion detection. But in practice the most intrusion detection systems often have a high false alarm rate. To solve it, this paper gives anew PSO-based algorithm which has a special fitness function to extract better rules set with lower false alarm rate to detect the attacks. Experiments based on the 1999 KDD cup data show that the algorithm can efficiently lower the false alarm rate.
Augmenting Surface Interaction through Context-Sensitive Mobile Devices
Authors: Alex Olwal
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

We discuss the benefits of using a mobile device to expand and improve the interactions on a large touch-sensitive surface. The mobile device's denser arrangement of pixels and touch-sensor elements, and its rich set of mechanical on-board input controls, can be leveraged for increased expressiveness, visual feedback and more precise direct-manipulation. We also show how these devices can support unique input from multiple simultaneous users in collaborative scenarios. Handheld mobile devices and large interactive surfaces can be mutually beneficial in numerous ways, while their complementary nature allows them to preserve the behavior of the original user interface.
Data Transmission for Major Sporting Events on MPEG-2
Authors: Jesús Martínez Barbero, Eugenio Santos Menendez, Abraham Gutierrez Rodriguez
Venue: Proceedings of the 2009 Fourth International Conference on Digital Telecommunications (2009)

During mayor sporting events, such as the Olympic Games, in which a lot of stadiums are involved, each site will usually generate different types of video signal. The generation, distribution, integration and reproduction of data scores and results are very important for a good understanding of every sporting event. Data are sent securely across networks using any type of data protection and backup links shared by other applications. Video and audio material is transmitted over reliable networks with low error rates and high transmission capacity. Data-paths and video-paths are different. In this paper, the authors propose the use of the infrastructure needed for transporting video signal between venues, International Broadcast Center (IBC), international gateways, Broadcaster headquarters and user. Such design approach illustrates a possible architecture for next transfer model in mayor sporting events transmission.
Research on Clock Synchronization Mechanism in Wireless Sensor Networks
Authors: Gong Bo
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

The paper presented a Cluster-based Clock Synchronization mechanism for Wireless Sensor Networks (CBCS). The mechanism works in two phases: horizontal clock synchronization phase and vertical clock synchronization phase. In the horizontal synchronization phase, it adopts traditional pair-wise packet exchange mechanism to finish the clock synchronization between the Base Station and cluster heads through establishing a hierarchical topology structure. In the vertical synchronization phase, it adopts pair-wise packet exchange and unidirectional reference broadcast mechanism to finish the time synchronization between cluster heads and cluster members. Moreover, it used linear least square to estimate the clock offset of nodes which achieved a good precision. Finally, the local clocks of all nodes in the network cansynchronize to eachother. The results of which simulated on NS-2 show that CBCS has a good precision and low message cost.
Modularity in inductively-learned word pronunciation systems
Authors: Antal van den Bosch, Ton Weijters, Walter Daelemans
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

In leading morpho-phonological theories and state-of-the-art text-to-speech systems it is assumed that word pronunciation cannot be learned or performed without in-between analyses at several abstraction levels (e.g., morphological, graphemic, phonemic, syllabic, and stress levels). We challenge this assumption for the case of English word pronunciation. Using igtree, an inductive-learning decision-tree algorithms, we train and test three word-pronunciation systems in which the number of abstraction levels (implemented as sequenced modules) is reduced from five, via three, to one. The latter system, classifying letter strings directly as mapping to phonemes with stress markers, yields significantly better generalisation accuracies than the two multi-module systems. Analyses of empirical results indicate that positive utility effects of sequencing modules are outweighed by cascading errors passed on between modules.
Reconfigurable Computing in the New Age of Parallelism
Authors: Walid Najjar, Jason Villarreal
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

Reconfigurable computing is an emerging paradigm enabled by the growth in size and speed of FPGAs. In this paper we discuss its place in the evolution of computing as a technology as well as the role it can play in the current technology outlook. We discuss the evolution of ROCCC (Riverside Optimizing Compiler for Configurable Computing) in this context.