ppxscal/embedding_network huggingface dataset:
Efficient Modular Arithmetic in Adapted Modular Number System Using Lagrange Representation
Authors: Christophe Negre, Thomas Plantard
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

In 2004, Bajard, Imbert and Plantard introduced a new system of representation to perform arithmetic modulo a prime integer p, the Adapted Modular Number System (AMNS). In this system, the elements are seen as polynomial of degree n ¿ 1 with the coefficients of size p 1/n . The best method for multiplication in AMNS works only for some specific moduli p. In this paper, we propose a novel algorithm to perform the modular multiplication in the AMNS. This method works for any AMNS, and does not use a special form of the modulo p. We also present a version of this algorithm in Lagrange Representation which performs the polynomial multiplication part of the first algorithm efficiently using Fast Fourier Transform.
A P2P Approach to Resource Discovery in On-Line Monitoring of Grid Workflows
Authors: BartBomiej Łabno, Marian Bubak, Bartosz Baliś
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

On-line monitoring of Grid workflows is challenging since workflows are loosely coupled and highly dynamic. An efficient mechanism of automatic resource discovery is needed in order to discover new producers of workflow monitoring data fast. However, currently used Grid information systems are not suitable for this due to insufficient performance characteristics. We propose to associate the monitoring infrastructure with a P2P DHT infrastructure in order to achieve the automatic resource discovery wherein consumers of monitoring data can be notified fast about new producers. In our solution, the consumer of monitoring data can subscribe to any monitoring endpoint and the automatic resource discovery is handled transparently. We evaluate performance of the presented solution, and demonstrated a case study scenario of monitoring of a traffic management workflow.
MapFace - An Editor for MetaMap Transfer (MMTx)
Authors: Katharina Kaiser, Theresia Gschwandtner, Patrick Martini
Venue: Proceedings of the 2008 21st IEEE International Symposium on Computer-Based Medical Systems (2008)

Mapping concepts from medical terminologies, such as the UMLS, to medical documents is a prerequisite for many tasks of (automatically) processing documents. Due to the nature of the UMLS and the tools to accomplish the mapping, it is not always possible to achieve a correct and unambiguous mapping. This drawback led us to the development of an editor for correcting the obtained information. Our editor, MapFace, visualizes information received by the MetaMap Transfer (MMTx) program and enables users to edit and correct this information on both a conceptual and a syntactical level. By means of this functionality we are able to provide further processing steps with correct and appropriate input. Furthermore, the visualization features enable users to validate or even generate hypotheses, as well as support the better understanding of medical text.
A Provably Secure One-Pass Two-Party Key Establishment Protocol
Authors: K. Chalkias, S. T. Halkidis, D. Hristu-Varsakelis, G. Stephanides, A. Alexiadis
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

For two parties to communicate securely over an insecure channel, they must be able to authenticate one another and establish a common session key. We propose a new secure one-pass authenticated key establishment protocol which is well suited to one-way communication channels. The protocol is examined using an extension of the Bellare-Rogaway model proposed by Blake-Wilson et. al., and is shown to be provably secure, in the sense that defeating the protocol is equivalent to solving a CDH problem. We compare our protocol to existing approaches, in terms of security and efficiency. To the best of our knowledge, ours is the only one-pass protocol that resists general key-compromise impersonation attacks, and avoids certain vulnerabilities to loss of information attacks found in other protocols of its class.
Lattice Formation in Space for a Swarm of Pico Satellites
Authors: Carlo Pinciroli, Mauro Birattari, Elio Tuci, Marco Dorigo, Marco Rey Zapatero, Tamas Vinko, Dario Izzo
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

We present a distributed control strategy that lets a swarm of satellites autonomously form a lattice in orbit around a planet. The system, based on the artificial potential field approach, proposes a novel way to split the artificial field in two main terms: a global artificial field that gathers the satellites around a predefined meeting point, and a local term that allows a satellite to place itself in the correct position relative to its closest neighbors. We apply the method to the problem of forming a two dimensional hexagonal lattice, using the well-known Lennard-Jones potential as local artificial field. The control parameters have been obtained with a genetic algorithm to maximize the precision of the formed lattice. The precision does not depend on the number of satellites and convergence is achieved from all initial distributions of the satellites.
What Do Focus Maps Focus On?
Authors: Kai-Florian Richter, Denise Peters, Gregory Kuhnmünch, Falko Schmid
Venue: Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space (2008)

Maps are an important, everyday medium to communicate spatial information. We are faced with a great variety of different maps used for different purposes. While many of these maps are task-specific and concentrate on specific pieces of information, often they do not support map reading to extract the information relevant for the task at hand. In this paper, we explore the concept of focus maps. This concept has been previously presented with a restricted scope, however it covers a range of different kinds of maps that all focus a map user's attention on the relevant information, be it specific features or areas. We discuss their general properties and the importance of context for designing such maps, and introduce a toolbox for constructing schematic maps that provides a generic way of generating the different kinds of maps discussed. Furthermore, we provide empirical evidence supporting our approach and outline how navigation in 3D virtual environments may benefit from a transfer of the proposed concept of focus maps from 2D to 3D.
An Investigation on Interdisciplinary Structure of Service Science
Authors: William W. Song, Deren Chen
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

Since it was proposed in 2003, service science has become a keen topic in the communities of web services, semantic web, and e-businesses. According to a recent proposal by IBM, it covers service science, service management, and service engineering (SSME). Although there have been many discussions and reports on this topic, it is still quite unclear these debates would contribute to the establishment of service science as a research subject. This paper intends to address this issue by comparing related studies on service science or SSME, discussing interrelationships among the components of Service Science (SSME), outlining its evolutionary process in terms of the enterprise modeling approach, and illustrating a number of possible research sub-topics.
Categorized Sliding Window in Streaming Data Management Systems
Authors: Marios Papas, Josep-L. Larriba-Pey, Pedro Trancoso
Venue: Proceedings of the 19th international conference on Database and Expert Systems Applications (2008)

For many applications, data is collected at very large rates from various sources. Applications that produce results from this data have a requirement for very efficient processing in order to achieve timely decisions. An example of such a demanding applications is one that takes decisions on stock acquisition based on the price updates that happen constantly while the market is open for transactions. Our proposed technique is a simple yet effective way to reduce the access time to the streaming data.In this paper we propose an efficient indexing technique that improves the access time to data elements in sliding windows of streamed database systems. This technique, called Categorized Sliding Window, is based on splitting the data into categories and using bit vectors to avoid accesses to non-relevant data.Our experimental results show large improvements compared with simpler techniques. For the standard Linear Road benchmark we observe a performance improvement of 3.3x for a complex continuous query. Also relevant is the fact that 90% of the performance improvement is achieved with only 65% of the maximum number of categories, which represents a memory overhead of only 13.5%.
Network Awareness, Social Context and Persuasion
Authors: Donald Steiny
Venue: Proceedings of the 3rd international conference on Persuasive Technology (2008)

This paper brings a sociological perspective to an area dominated by social psychology, that of persuasion. It discusses how networks can be used to describe context for persuasive messages. It has been previously argued that network awareness, having knowledge of how networks affect behavior and perception, combined with knowledge of the networks in some part of society such as an organization or region, is important for innovation and productivity. This paper expands on this by introducing the concept of "social context." While the idea of location in social structure is not new, the difference here is that this paper talks not just about abstract location in social space, but the more concrete realization of it in communication networks based on cell phones, social networking software, IM, email and other new technology is. I argue that the ability to observe and measure these networks can give insight into the user's behavior, attitudes and worldview and provide a context for persuasion to take place.
A Comparison between Hardware Accelerators for the Modified Tate Pairing over $\mathbb{F}_{2^m}$ and $\mathbb{F}_{3^m}$
Authors: Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Francisco Rodríguez-Henríquez
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

In this article we propose a study of the modified Tate pairing in characteristics two and three. Starting from the &eta; T pairing introduced by Barreto et al. [1], we detail various algorithmic improvements in the case of characteristic two. As far as characteristic three is concerned, we refer to the survey by Beuchat et al. [5]. We then show how to get back to the modified Tate pairing at almost no extra cost. Finally, we explore the trade-offs involved in the hardware implementation of this pairing for both characteristics two and three. From our experiments, characteristic three appears to have a slight advantage over characteristic two.
Installation of the German Computer Z4 in Zurich in 1950
Authors: Konrad Zuse
Venue: IEEE Annals of the History of Computing (1980)

Computer developments in Germany before and during World War II were nearly unknown until 1949. In 1950 the model Zuse Z4, the only one that could be rescued from Berlin, was leased by Eduard Stiefel for the Eidgenossische Technische Hochschule at Zurich. This was the beginning of a friendly cooperation. Some stories of this pioneer time are reported.
An Executive for Task-driven Multimicrocomputer Systems
Authors: Eli Fathi, Moshe Krieger
Venue: IEEE Micro (1983)

A two-level hierarchical structure, with interlevel communications performed via asynchronous handshake lines, makes this executive modular, easy to implement, and transportable.
Iterative image reconstruction for multi-slice x-ray computed tomography
Authors: Ken Sauer
Venue:  (2006)

Image reconstruction from multi-slice axial and helical x-ray Computed Tomography (CT) offers many challenges to resolve in order to benefit from its multiple advantages for medical diagnostic imaging. Direct techniques, such as Filtered Back-Projection (FBP) often fail in producing artifact-free images from three-dimensional helical scan data, and are faced with the traditional trade-off between image resolution and noise distribution. Thus far, no conventional, analytical method has demonstrated capability for accurate reconstruction under high pitch or low-dose conditions. Iterative algebraic methods originate from a substantially different description of the image recovery problem, with little inherent dependence on the scanning geometry. These techniques are applicable to a far broader class of problems than conventional convolution back-projection, and offer significant opportunities for image quality improvement, although at the cost of greater computational load. This work focuses on the use of iterative methods for reconstruction of three-dimensional CT data for application to patient imaging in a real clinical environment. The final objective of this research is to improve the imaging capabilities of CT scanners with advanced reconstruction methods, and ultimately re-define acceptable diagnostic image quality in clinical x-ray CT.
A Novel Approach for Practical Semantic Web Data Management
Authors: Giorgio Gianforme, Roberto Virgilio, Stefano Paolozzi, Pierluigi Nostro, Danilo Avola
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

The growing importance of RDF as a tool for describing information on the Web has risen a number of interesting works regarding the management of RDF documents. The effective management of RDF data has been an increasingly pressing active area of the current research. However current data management solutions for RDF data present the following shortcomings: (i) they often define new query languages difficult to integrate in database applications, with a consequent lack of uniformity among the different approaches, (ii) they present extendibility limitations, and (iii) most of them are considered complicated by the final user. In this paper we propose a feasible and intuitive approach for practical RDF management, providing a logical organization technique for RDF data, making use of a formalism to represent concepts and properties of RDF and RDF(S), and an extension of a DataLog rule system for querying RDF documents.
Blog Mining for the Fortune 500
Authors: James Geller, Sapankumar Parikh, Sriram Krishnan
Venue: Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition (2007)

In recent years there has been a tremendous increase in the number of users maintaining online blogs on the Internet. Companies, in particular, have become aware of this medium of communication and have taken a keen interest in what is being said about them through such personal blogs. This has given rise to a new field of research directed towards mining useful information from a large amount of unformatted data present in online blogs and online forums. We discuss an implementation of such a blog mining application. The application is broadly divided into two parts, the indexing process and the search module. Blogs pertaining to different organizations are fetched from a particular blog domain on the Internet. After analyzing the textual content of these blogs they are assigned a sentiment rating. Specific data from such blogs along with their sentiment ratings are then indexed on the physical hard drive. The search module searches through these indexes at run time for the input organization name and produces a list of blogs conveying both positive and negative sentiments about the organization.
New high performance computational strategies for inverse problems with application to analytical ultracentrifugation
Authors: Hugh Maynard
Venue:  (2008)

In the physical sciences experimental data are often analyzed to determine model parameters by solving inverse problems. Solving such problems is complicated by the presence of random noise in the data. Traditional regularization methods used to eliminate the effects of noise introduce a bias which smooths the solution. In the problems considered here, the answer is sharp, containing a sparse set of parameters. We introduce high-performance techniques to find the correct set of parameters through the sequential application of our new methods. The first method is a novel divide and conquer technique for parallelizing a large scale multivariate linear optimization problem, which is commonly solved using a sequential algorithm with the entire parameter space as the input. By partitioning the parameters and the associated computations, our technique overcomes memory constraints when used in the context of a single workstation and is scalable with high processor utilization when clusters are used. We describe this technique and present an analytical model for performance prediction which is validated on a cluster of 512 processors. The second method uses a Genetic Algorithm and the results of the first method to find the simplest set of model parameters for the data with an equivalent goodness-of-fit. A method of representation, initialization and mutation is introduced to efficiently find this model. Analysis of analytical ultracentrifugation sedimentation velocity experimental data is the primary example application, where these methods are currently being used by researchers worldwide.
Notes on the CRTDH Group Key Agreement Protocol
Authors: Spyros Magliveras, Wandi Wei, Xukai Zou
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Group key management (GKM) is one of the primary issues for secure group communication (SGC). Contributory group key agreement is crucial for SGC over wireless and mobile ad hoc networks (MANETs) when there is lack of a fixed infrastructure and it is difficult to have a central trusted entity. Recently, Balachandran et al. proposed a contributory key agreement protocol for MANETs, called CRTDH [5]. This protocol is based upon both the Chinese Remainder Theorem and the Diffie-Hellman key exchange scheme. CRTDH exhibits a very nice idea, but contains some problems that make it not very practical in terms of efficiency and security. We point out these problems and propose a solution to them. Analysis and experiments are also presented which show our improved protocol outperforms the original CRTDH protocol in terms of both efficiency and security.
A Deontic Logic for Socially Optimal Norms
Authors: Jan Broersen, Rosja Mastop, John-Jules Ch. Meyer, Paolo Turrini
Venue: Proceedings of the 9th international conference on Deontic Logic in Computer Science (2008)

The paper discusses the interaction properties between preference and choice of coalitions in a strategic interaction. A language is presented to talk about the conflict between coalitionally optimal and socially optimal choices. Norms are seen as social constructions that enable to enforce socially desirable outcomes.
Secure Ethernet Point-to-Point Links for Autonomous Electronic Ballot Boxes
Authors: Armando Astarloa, Unai Bidarte, Jaime Jiménez, Jesús Lázaro, Iñigo Martinez De Alegría
Venue: Proceedings of the 5th international conference on Autonomic and Trusted Computing (2008)

Rapid growth of computer networks and advances in cryptographic techniques allow new approaches of electronic voting systems. In this research, we present a System-on-Programmable-Chip crypto-bridge module that enables secure ethernet point-to-point connections between electronic ballot boxes and the remote host of the central electoral office through insecure Ethernet networks. The proposed crypto-bridge is implemented using reconfigurable devices, and two implementations are presented: a single channel module and multi-channel module. HDL source code of the AES cipher, Ethernet MAC controller and tiny processor embedded in the crypto-bridge is public and open enforcing the confidence in the system.
The Role of Classical Computation in Measurement-Based Quantum Computation
Authors: Dan Browne, Janet Anders
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

Measurement-based quantum computation (MBQC) is an important model of quantum computation, which has delivered both new insights and practical advantages. In measurement-based quantum computation, more specifically the "one-way model" of computation, the computation proceeds in the following way. A large number of quantum bits (qubits) are prepared in a special entangled state called a cluster state. The qubits are then measured in a particular basis and particular order, the measurements are adaptive, some bases depending on the outcome of previous measurements. A classical control computer processes the measurement results in order to feed forward the bases for future measurements. In this paper we focus on the role played by the classical computer in this model and investigate some of its properties.
Improving Robustness Using Query Expansion
Authors: Angel F. Zazo, José L. Berrocal, Carlos G. Figuerola
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper describes our work at CLEF 2007 Robust Task. We have applied local query expansion using windows of terms, but considering different measures of robustness during the training phase in order to optimize the performance: MAP, GMAP, MMR, GS@10, P@10, number of failed topics, number of topics below 0.1 MAP, and number of topics with P@10=0. The results were not disappointing, but no settings were found that simultaneously improved all measures. A key issue for us was to decide which set of measures we had to select for optimization.This year all our runs also gave good rankings, both base runs and expanded ones. However, our expansion technique does not improve significantly the retrieval performance. At TREC and CLEF Robust Tasks other expansion techniques have been used to improve robustness, but results were not uniform. In conclusion, regarding robustness the objective must be to make good information retrieval systems, rather than to tune some query expansion techniques.
Equal-Area Locus-Based Convex Polygon Decomposition
Authors: David Adjiashvili, David Peleg
Venue: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity (2008)

This paper presents an algorithm for convex polygon decomposition around a given set of locations. Given an n-vertex convex polygon P and a set X of k points positioned arbitrarily inside P, the task is to divide P into k equal area convex parts, each containing exactly one point of X. The problem is motivated by a terrain covering task for a swarm of autonomous mobile robots. The algorithm runs in time O(k n + k 2logk).
Access Control Labeling Scheme for Efficient Secure XML Query Processing
Authors: Dong Chan An, Seog Park
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Recently XML has become an active research area. In particular, the need for an efficient secure access control method of dynamic XML data in a ubiquitous data streams environment has become very important. In this paper, we propose the access control labeling scheme for efficient secure query processing under dynamic XML data streams. The proposed labeling scheme supports the process of dynamic XML data without re-labeling existing labels and secure query processing. We have shown that our approach is efficient and secure through experiments.