ppxscal/embedding_network huggingface dataset:
Key Replicating Attack on Certificateless Authenticated Key Agreement Protocol
Authors: Mengbo Hou, Qiuliang Xu
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Authenticated key agreement protocol is crucial in providing data confidentiality and integrity to subsequent communications among two or more parties over a public network. Certificateless public key cryptography (CL-PKC) combines the advantage of the identity-based public key cryptography (ID-PKC) and the traditional PKI. In 2007, Y.J Shi and J.H Li proposed a two-party authenticated key agreement protocol based on the certificateless encryption scheme proposed by B. Libert and J.J. Quisquater. It is found that the scheme is vulnerable to the key replicating attack (one form of the man-in-the-middle attack), so it doesn’t possess the security attribute of implicit key authentication and key control. We analyze such an attack of this protocol in the BR93 model in detail, and demonstrate that the protocol is not secure if the adversary is allowed to send a reveal query to reveal non-partner players who had accepted the same session key.
Reconciliation of unsupervised clustering, segmentation and cohesion
Authors: David M. W. Powers
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

This extended abstract examines the progress of a project on unsupervised language learning, and focuses on two different approaches to segmentation, as well as how cohesion may be generalized from it definitive morpho-syntactic instantiation. It is intended as a discussion paper, and outlines the specific hypotheses currenlty being tested.
Simulation Analysis of Probabilistic Timing Covert Channels
Authors: Yunchuan Guo, Lihua Yin, Yuan Zhou, Chao Li, Li Guo
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

It is very important to analyze the bandwidth and transmission error rate in the study of probabilistic timing covert channels. For the purpose, a simulation system of probabilistic timing covert channels has been set up in the paper. The simulation results show that (1) the bandwidth and the transmission error rate of probabilistic timing covert channels are closely related to the hardware/software environment, probability factor, time factor and/or coding methods as well as scheduling times; (2) the approximate transmission error rate can be measured with the central limit theorem; (3) it is not accurate to estimate the amount of information leakage based on weak probabilistic bisimulation; and (4) in probabilistic timing covert channels, there exist some characteristics which are different from non-deterministic covert channels.
Planar and Grid Graph Reachability Problems
Authors: Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
Venue: Theory of Computing Systems (2009)

We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for $\mathsf{NL}$. In particular, we focus on different classes of planar graphs, of which grid graphs are an important special case. Our main results are: Reachability in graphs of genus one is logspace-equivalent to reachability in grid graphs (and in particular it is logspace-equivalent to both reachability and non-reachability in planar graphs). Many of the natural restrictions on grid-graph reachability (GGR) are equivalent under $\mathsf{AC}^{0}$reductions (for instance, undirected GGR, outdegree-one GGR, and indegree-one-outdegree-one GGR are all equivalent). These problems are all equivalent to the problem of determining whether a completed game position in HEX is a winning position, as well as to the problem of reachability in mazes studied by Blum and Kozen (IEEE Symposium on Foundations of Computer Science (FOCS), pp. 132&#x2013;142, [1978]). These problems provide natural examples of problems that are hard for $\mathsf{NC}^{1}$under $\mathsf{AC}^{0}$reductions but are not known to be hard for&#x00a0; $\mathsf{L}$; they thus give insight into the structure of $\mathsf{L}$. Reachability in layered planar graphs is logspace-equivalent to layered grid graph reachability (LGGR). We show that LGGR lies in $\mathsf{UL}$(a subclass of $\mathsf{NL}$). Series-Parallel digraphs (on which reachability was shown to be decidable in logspace by Jakoby et al.) are a special case of single-source-single-sink planar directed acyclic graphs (DAGs); reachability for such graphs logspace reduces to single-source-single-sink acyclic grid graphs. We show that reachability on such grid graphs $\mathsf{AC}^{0}$reduces to undirected GGR. We build on this to show that reachability for single-source multiple-sink planar DAGs is solvable in $\mathsf{L}$.
Controlling tiny multi-scale robots for nerve repair
Authors: Tad Hogg, David W. Sretavan
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

We designed and evaluated multiagent control for microscopic robots ("nanorobots") aiding the surgical repair of damaged nerve cells. This repair operates on both nerves as a whole, at scales of hundreds of microns, and individual nerve cell axons, at scales of about a micron. We match the robots to these sizes using a combination of microelectomechanical (MEMS) machines for the larger operations and nanorobots for operations on individual cells. Muitiagent control allows accurate and rapid repair with such robots, with only modest computational and communication requirements for the nanorobots, a significant benefit due to their physical limitations. Our simulations, using physical parameters dictated by nerve biology and plausible nanorobotic capabilities, show how specific control choices lead to trade-offs in clinical outcome. Beyond the specific example of nerve repair treated here, multi-scale robots could aid a variety of medical and biological tasks involving both the large scale of organs or tissues and the microscopic scale of individual cells.
Scheduling Real-Time of the Synchronous Hybrid Tasks under Energy Constraint
Authors: Akli Abbas, Hamid Hentous, Tayeb Kenaza
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

In this paper, we are interested by the integration ofprecedence and resources sharing constraints in the real time scheduling of periodic and aperiodic tasks. We also treat the problem of dynamic voltage scaling of the processor in the same context. Many dynamic voltage scaling algorithms have been proposed in the literature. However, these algorithms do not consider the constraints of precedence and shared resources on the scheduling of periodic and aperiodic tasks. In this case, we propose two algorithms with the constraints cited above. Experimental results show that the proposed algorithms reduce the energy consumption under earliest deadline firstscheduling policy and the stack resource policy.
Sonic Gestures Applied to a Percussive Dialogue in TanGram Using Wii Remotes
Authors: Carlos D. Perales, Cristina Portalés, Francisco Sanmartín
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

TanGram, is an original music score composed by Carlos D. Perales for Percussion Quartet and Nintendo Wii Remotes used as a wireless interface for Live Electronics. This paper examines how this composition explores exiting research in interaction and communication between instruments and digital sound processing discourse to produce a unique music mixed-media score, to explore the sonic possibilities of a multi-timbrical instrument with the integration of the visual gestures of an accessible device using processes of real-time gestural mimesis.
Long Term Repair of Learning Disability through Short-Term Reduction of CNS Inhibition
Authors: H. Craig Heller, Damien Colas, Norman F. Ruby, Fabian Fernandez, Bayarasaikhan Chuluun, Martina Blank, Craig C. Garner
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Learning disabilities are serious societal problems contributing to a loss of quality of life for affected individuals and their families. We hypothesized that the learning disability in Down Syndrome and perhaps in other neurodegenerative disorders is due to an imbalance between inhibitory and excitatory tone in the CNS. Specifically, we predicted that reduction of GABA related inhibition would improve learning. We used the TsDn65 mouse model of Down Syndrome and treated adult mice with daily doses of different GABA antagonists. Following treatments learning performance of these mice in several rodent learning tasks was indistinguishable from the performance of wild type mice, and the learning improvement lasted for months after the treatment ended. We are now exploring the mechanism of this durable neuroplastic effect and asking whether it would generalize to other learning disorders or optimize learning in wild type mice.
The Analysis of Water and Health Database by One Improved A-Priori Algorithm
Authors: Jinsheng Liu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Water quality and local illnesses have some relationships which can not be predicted by simple statistical algorithm so one improved A-Priori algorithm is introduced to objectively meet this question. A-Priori algorithm, which can efficiently find useful associational relationships among databases, is one popular algorithm in associational rule mining. Moreover, this paper introduced some useful and extended conceptions to improve the efficiency of A-Priori algorithm, such as independent support counts and error support count on these properties. Statistical graph of database is applied in the experience of database to directly describe the relationship between elements in pollution water and illness. At the same time, many experiences on mining associational rules are done so as to test the efficiency of algorithm. These experiences proved that statistical graph of database can straightforward discover associational rules on elements in water and illnesses in database.
Mathematical modeling and convergence analysis of trail formation
Authors: Sameena Shah, Ravi Kothari, Jayadeva Jayadeva, Suresh Chandra
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

An ant deposits pheromone along the path that it travels and is more likely to choose a path with a higher concentration of pheromone. The sensing and dropping of pheromone makes it easy to understand the trail forming behavior of ants. The reinforcement tendency of pheromone following behavior ensures selection of the shortest path from a set of paths. The reinforcement tendency of pheromone following behavior also ensures a biased selection of the initially followed paths over a path, which is shorter but discovered through chance at a later point in time. Under what conditions and limits can this initial bias be reversed? In this paper, we answer this question based on a theoretical analysis of the trail forming behavior of ants. We believe our results to contribute to the overall area of understanding how to build scalable systems that evolve to solve complex problems (e.g. point covering or the traveling salesman problem) without the necessity of central command-and-control.
Scheduling mixed-parallel applications with advance reservations
Authors: Kento Aida, Henri Casanova
Venue: Cluster Computing (2009)

This paper investigates the scheduling of mixed-parallel applications, which exhibit both task and data parallelism, in advance reservations settings. Both the problem of minimizing application turn-around time and that of meeting a deadline are studied. For each several scheduling algorithms are proposed, some of which borrow ideas from previously published work in non-reservation settings. Algorithms are compared in simulation over a wide range of application and reservation scenarios. The main finding is that schedules computed using the previously published CPA algorithm can be adapted to advance reservation settings, notably resulting in low resource consumption and thus high efficiency.
Spatial-Temporal Changes of Vegetation Coverage and Its Responses to Global Climate Changes in the Tibetan Plateau
Authors: Liu Junhui, Gao Jix
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Recent global climate changes have affected vegetation coverage in the Tibetan Plateau. Based on the remote sensing images and the meteorological data from 1986 to 2000, using the model of extracting vegetation coverage, the spatiotemporal changes of vegetation coverage and its responses to global climate changes in the Tibetan Plateau during 1986-2000 were studied. The results showed that from 1986 to 2000 vegetation coverage increased 0.011 as a whole, except some small regions degradation in the Tibetan Plateau. Global climate changes have contributed to an increase of vegetation coverage in the Tibetan Plateau, and the vegetation coverage change was positively correlated with the changes of precipitation and temperature. The regions with decreasing vegetation coverage were mainly distributed in the southeast where the recent warming trends contribute to humid weather and favorable conditions for vegetation growth, while increasing vegetation coverage were in the northwest where higher temperature have led to arid conditions and insufficient rainfall of the Tibetan Plateau. The responses of vegetation coverage to climate changes varied with different vegetation types.
Maximum Orbit Weights in the &#x03c3;-game and Lit-only &#x03c3;-game on Grids and Graphs
Authors: John L. Goldwasser, William F. Klostermeyer
Venue: Graphs and Combinatorics (2009)

Let G be a graph in which each vertex can be in one of two states: on or off. In the &#x03c3;-game, when you &#x201c;push&#x201d; a vertex v you change the state of all of its neighbors, while in the &#x03c3;+-game you change the state of v as well. Given a starting configuration of on vertices, the object of both games is to reduce it, by a sequence of pushes, to the smallest possible number of on vertices. We show that any starting configuration in a graph with no isolated vertices can, by a sequence of pushes, be reduced to at most half on, and we characterize those graphs for which you cannot do better. The proofs use techniques from coding theory. In the lit-only versions of these two games, you can only push vertices which are on. We obtain some results on the minimum number of on vertices one can obtain in grid graphs in the regular and lit-only versions of both games.
Methodology for Precisely Estimating the Generation of Standalone Photovoltaic System
Authors: Gang Yang, Ming Chen
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

In order to settle the problem of blindness before installations of PV arrays, a methodology for precisely estimating the generation capacity of standalone photovoltaic (SPV) systems is investigated. The proposed model for the calculation process is based on the local solar radiation data and the system characteristics and thus has a better precision. A case study of a photovoltaic system by using the meteorology data of Beijing is illustrated as an example to present the method.
COOPML: towards annotating cooperative discourse
Authors: Farah Benamara, Véronique Moriceau, Patrick Saint-Dizier
Venue: Proceedings of the 2004 ACL Workshop on Discourse Annotation (2004)

In this paper, we present a preliminary version of COOPML, a language designed for annotating cooperative discourse. We investigate the different linguistic marks that identify and characterize the different forms of cooperativity found in written texts from FAQs, Forums and emails.
Proxy Re-encryption Scheme from IBE to CBE
Authors: Xu an Wang, Xiaoyuan Yang, Minqing Zhang
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

In 1998, Blaze, Bleumer, and Strauss proposed a kind of cryptographic primitive called proxy re-encryption. In proxy re-encryption, a proxy can transform a ciphertext computed under Alice's public key into one that can be opened under Bob's decryption key. They predicated that proxy re-encryption and re-signature will play an important role in our life. In 2007, Matsuo proposed the concept of four types of re-encryption schemes: CBE to IBE(type 1), IBE to IBE(type 2), IBE to CBE (type 3), CBE toCBE (type 4 ). Now CBE to IBE and IBE to IBE proxy re-encryption schemes are being standardized by IEEEP1363.3 working group. In this paper, based on we propose a proxy re-encryption scheme from IBE to CBE. To the best of our knowledge, this is the first type 3 scheme. We give the security model for proxy re-encryption scheme from IBE to CBE and prove our scheme's security in this model without random oracle.
Data Stream Prediction Using Incremental Hidden Markov Models
Authors: Kei Wakabayashi, Takao Miura
Venue: Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery (2009)

In this paper, we propose a new technique for time-series prediction. Here we assume that time-series data occur depending on event which is unobserved directly, and we estimate future data as output from the most likely event which will happen at the time. In this investigation we model time-series based on event sequence by using Hidden Markov Model(HMM), and extract time-series patterns as trained HMM parameters. However, we can't apply HMM approach to data stream prediction in a straightforward manner. This is because Baum-Welch algorithm, which is traditional unsupervised HMM training algorithm, requires many stored historical data and scan it many times. Here we apply incremental Baum-Welch algorithm which is an on-line HMM training method, and estimate HMM parameters dynamically to adapt new time-series patterns. And we show some experimental results to see the validity of our method.
Improved state estimation in multiagent settings with continuous or large discrete state spaces
Authors: Prashant Doshi
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

State estimation in multiagent settings involves updating an agent's belief over the physical states and the space of other agents' models. Performance of the previous approach to state estimation, the interactive particle filter, degrades with large state spaces because it distributes the particles over both, the physical state space and the other agents' models. We present an improved method for estimating the state in a class of multiagent settings that are characterized in part by continuous or large discrete state spaces. We factor out the models of the other agents and update the agent's belief over these models, as exactly as possible. Simultaneously, we sample particles from the distribution over the large physical state space and project the particles in time. This approach is equivalent to Rao-Blackwellising the interactive particle filter. We focus our analysis on the special class of problems where the nested beliefs are represented using Gaussians, the problem dynamics using conditional linear Gaussians (CLGs) and the observation functions using softmax or CLGs. These distributions adequately represent many realistic applications.
Bi-clustering of Gene Expression Data Using Conditional Entropy
Authors: Afolabi Olomola, Sumeet Dua
Venue: Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics (2009)

The inherent sparseness of gene expression data and the rare exhibition of similar expression patterns across a wide range of conditions make traditional clustering techniques unsuitable for gene expression analysis. Biclustering methods currently used to identify correlated gene patterns based on a subset of conditions do not effectively mine constant, coherent, or overlapping biclusters, partially because they perform poorly in the presence of noise. In this paper, we present a new methodology (BiEntropy) that combines information entropy and graph theory techniques to identify co-expressed gene patterns that are relevant to a subset of the sample. Our goal is to discover different types of biclusters in the presence of noise and to demonstrate the superiority of our method over existing methods in terms of discovering functionally enriched biclusters. We demonstrate the effectiveness of our method using both synthetic and real data.
A Novel Measurement System of Electric Power Parameters Based on DSP and ARM
Authors: Qiufeng Shang, Chonggao Du
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

The accurate and high-speed measurement of electric power parameters has an important impact on the realization of automation of power network management, the safety and economy operations of power network. This paper proposes a novel electric power parameters measurement system based on a dualcore architecture of DSP (Digital Signal Processor) and ARM (Advanced RISC Machines). It makes full use of the DSP’s excellent capability to calculate, and the ARM’s capability to manage the rich peripheral resources, to accomplish the real-time online measurement. The system is composed of two parts: DAM (Data acquisition Module), and SSM (System Supervise Module). A detailed description of the hardware and software is presented. DAM samples 6-channel electric power signals simultaneously, and then completes the calculation of parameters including the harmonic component. SSM has a friendly and easy-to-use User Interface, providing store and management of the measure data.
Classifying Java class transformations for pervasive virtualized access
Authors: Phil McGachey, Antony L. Hosking, J. Eliot B. Moss
Venue: Proceedings of the eighth international conference on Generative programming and component engineering (2009)

The indirection of object accesses is a common theme for target domains as diverse as transparent distribution, persistence, and program instrumentation. Virtualizing accesses to fields and methods (by redirecting calls through accessor and indirection methods) allows interposition of arbitrary code, extending the functionality of an application beyond that intended by the original developer. We present class modifications performed by our RuggedJ transparent distribution platform for standard Java virtual machines. RuggedJ abstracts over the location of objects by implementing a single object model for local and remote objects. However the implementation of this model is complicated by the presence of native and system code; classes loaded by Java's bootstrap class loader can be rewritten only in a limited manner, and so cannot be modified to conform to RuggedJ's complex object model. We observe that system code comprises the majority of a given Java application: an average of 76% in the applications we study. We consider the constraints imposed upon pervasive class transformation within Java, and present a framework for systematically rewriting arbitrary applications. Our system accommodates all system classes, allowing both user and system classes alike to be referenced using a single object model.