ppxscal/embedding_network huggingface dataset:
Identity-Based Online/Offline Encryption
Authors: Fuchun Guo, Yi Mu, Zhide Chen
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

We consider a scenario of identity-based encryption (IBE) where the encryption device (such as a smartcard) has low power. To improve the computation efficiency, it is desirable that part of computation can be done prior to knowing the message and the recipient (its identity or public key). The real encryption can be conducted efficiently once the message and the recipient's identity become available. We borrow the notion of online/offline signatures introduced by Even, Goldreich and Micali in 1990 and call this kind of encryption identity-based online/offline encryption (IBOOE), in the sense that the pre-computation is referred to as offline phase and the real encryption is considered as online phase. We found that this new notion is not trivial, since all previously proposed IBE schemes cannot be separated into online and offline phases so that the online phase is very efficient. However, we also found that with a proper transformation, some existing identity-based encryption schemes can be converted into IBOOE schemes with or without random oracles. We look into two schemes in our study: Boneh-Boyen IBE (Eurocrypt 2004), and Gentry IBE (Eurocrypt 2006).
Investigating Usability Metrics for the Design and Development of Applications for the Elderly
Authors: Andreas Holzinger, Gig Searle, Thomas Kleinberger, Ahmed Seffah, Homa Javahery
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Metrics-based benchmarks are crucial for measuring usability, particularly for special end user groups such as older adults. So far, usability metrics that are accessible and useful for software developers are still missing. Although usability standards are continually being developed and adapted to the rapid change in both software and computing hardware, the increasing diversity of elderly populations, both culturally and educationally, requires the development of a specific set of criteria. This paper studies two different aspects of usability for the elderly; passive and active interaction. It explores the limitations of active interaction, its potential causes and results. The long term goal is the development of new methods to counteract potential negative bias with regard to passive interaction. More specifically, we are investigating achievable metrics for the evaluation of passive technology trustworthiness and usability while categorizing them according to applicability for usability testing.
An Online Platform for Web APIs and Service Mashups
Authors: E. Michael Maximilien, Ajith Ranabahu, Karthik Gomadam
Venue: IEEE Internet Computing (2008)

On the newly programmable Web, mashups are flourishing. Designers create mashups by combining components of existing Web sites and applications. Although rapid mashup proliferation offers many opportunities, a lack of standarization and compatibility offers considerable challenges. IBM Sharable Code is an online service platform for developing and sharing situational Web 2.0 applications and mashups. The platform is based on an innovative domain-specific language that streamlines and standardizes the development and deployment of applications consuming and exposing Web APIs. Parts of the DSL and the resulting applications and mashups can be shared and reused by members of the IBM Sharable Code community. In this article, the authors offer an overview of the platform's architecture and the DSL language at its core.
Domain-specific languages and program generation with meta-AspectJ
Authors: Shan Shan Huang, David Zook, Yannis Smaragdakis
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2008)

Meta-AspectJ (MAJ) is a language for generating AspectJ programs using code templates. MAJ itself is an extension of Java, so users can interleave arbitrary Java code with AspectJ code templates. MAJ is a structured metaprogramming tool: a well-typed generator implies a syntactically correct generated program. MAJ promotes a methodology that combines aspect-oriented and generative programming. A valuable application is in implementing small domain-specific language extensions as generators using unobtrusive annotations for syntax extension and AspectJ as a back-end. The advantages of this approach are twofold. First, the generator integrates into an existing software application much as a regular API or library, instead of as a language extension. Second, a mature language implementation is easy to achieve with little effort since AspectJ takes care of the low-level issues of interfacing with the base Java language. In addition to its practical value, MAJ offers valuable insights to metaprogramming tool designers. It is a mature metaprogramming tool for AspectJ (and, by extension, Java): a lot of emphasis has been placed on context-sensitive parsing and error reporting. As a result, MAJ minimizes the number of metaprogramming (quote/unquote) operators and uses type inference to reduce the need to remember type names for syntactic entities.
A Simple Goal Seeking Navigation Method for a Mobile Robot Using Human Sense, Fuzzy Logic and Reinforcement Learning
Authors: Hamid Boubertakh, Mohamed Tadjine, Pierre-Yves Glorennec
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

This paper proposes a new fuzzy logic-based navigation method for a mobile robot moving in an unknown environment. This method endows the robot the capabilities of obstacles avoidance and goal seeking without being stuck in local minima. A simple Fuzzy controller is constructed based on the human sense and a fuzzy reinforcement learning algorithm is used to fine tune the fuzzy rule base parameters. The advantages of the proposed method are its simplicity, its easy implementation for industrial applications, and the robot joins its objective despite the environment complexity. Some simulation results of the proposed method and a comparison with previous works are provided.
Cryptanalysis of SPA Protocol
Authors: Hong Lei, Tianjie Cao
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

In this paper, we analyze the security vulnerabilities of SPA, a Strong and lightweight RFID Private Authentication protocol proposed by Li Lu et al. We present an effective de-synchronization attack against the protocol, which permanently disables the authentication capability of a RFID tag by destroying synchronization between the tag and the reader. The de-synchronization attack can be carried out in just two rounds of interaction in SPA. Then we improved their scheme to protect against DoS attack.
Rational Biquartic Interpolating Surface Based on Function Values
Authors: Siqing Deng, Kui Fang, Jin Xie, Fulai Chen
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

In this paper a bivariate rational biquartic interpolating spline based on function values with two parameters is constructed , and this spline is with biquartic numerator and bilinear denominator. The interpolating function has a simple and explicit mathematical representation, which is convenient both in practical application and in theoretical study. The interpolating surface is C 1 in the interpolating region when one of the parameters satisfies a simple condition. The interpolating surface can be modified by selecting suitable parameters under the condition that the interpolating data are not changed. It is proved that the values of the interpolating function in the interpolating region are bounded no matter what the parameters might be; this is called the bounded property of the interpolation. The approximation expressions of the interpolation are derived:they do not depend on the parameters.
Design of the B 5000 System
Authors: William Lonergan, Paul King
Venue: IEEE Annals of the History of Computing (1987)

Computing systems have conventionally been designed via the 'hardware' route. Subsequent to design, these systems have been handed over to programming systems people for the development of a programming package to facilitate the use of the hardware. In contrast to this, the B 5000 system was designed from the start as a total hardware-software system. The assumption was made that higher level programming languages, such as ALGOL, should be used to the virtual exclusion of machine language programming, and that the system should largely be used to control its own operation. A hardware-free notation was utilized to design a processor with the desired word and symbol manipulative capabilities. Subsequently this model was translated into hardware specifications at which time cost constraints were considered.
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
Authors: Bruno Courcelle
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

Graph structure is a flexible concept covering many different types of graph properties. Hierarchical decompositions yielding the notions of tree-width and clique-width, expressed by terms written with appropriate graph operations and associated with Monadic Second-order Logic are important tools for the construction of Fixed-Parameter Tractable algorithms and also for the extension of methods and results of Formal Language Theory to the description of sets of finite graphs. This informal overview presents the main definitions, results and open problems and tries to answer some frequently asked questions.
Global Progress in Dynamically Interleaved Multiparty Sessions
Authors: Lorenzo Bettini, Mario Coppo, Loris D'Antoni, Marco Luca, Mariangiola Dezani-Ciancaglini, Nobuko Yoshida
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

A multiparty session forms a unit of structured interactions among many participants which follow a prescribed scenario specified as a global type signature. This paper develops, besides a more traditional communication type system, a novel static interaction type system for global progress in dynamically interleaved multiparty sessions.
High Accuracy Tracking of Underwater Objects
Authors: Juan Hui, Guo-long Liang, Bo Fan
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Instantaneous frequency and time-delay measured accurately are important technologies for high precise underwater positioning. In order to prevent the leakage interference from other frequency channels, variability of instantaneous frequency sequence (VIFS) calculation and frequency estimations were adopted. The synchronous positioning model (spherical) combined with asynchronously model (hyperbolical) overcomes the ambiguous ranging for high rate trace. At last, the results of the sea experiment were provided, that met with the theory.
Supporting Industry in the Development of Design for All Curriculum
Authors: Yehya Mohamad, Stefan Carmien, Carlos A. Velasco
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

There are very few sources of information about industry needs in regard to the required Design for All knowledge and skills for designers and engineers. A common finding of many studies, besides technical feasibility and commercial viability, is the lack of awareness among suppliers and users on DfA. In this paper, some of the results of a series of workshops organized by Fraunhofer FIT under the scope of some EU-financed projects will be presented. We claim the need to create common guidelines on teaching DfA, which should not be limited to curriculum at universities but also for training employees within the companies. The guidelines should contain topics like: what to teach, whom to teach, how to teach and where to teach.
IMPRECO: A Tool for Improving the Prediction of Protein Complexes
Authors: Mario Cannataro, Pietro Hiram Guzzi, Pierangelo Veltri
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Proteins interact among them and different interactions form a very huge number of possible combinations representable as protein to protein interaction (PPI) networks that are mapped into graph structures. The interest in analyzing PPI networks is related to the possibility of predicting PPI properties, starting from a set of known proteins interacting among each other. For example, predicting the configuration of a subset of nodes in a graph (representing a PPI network), allows to study the generation of protein complexes. Nevertheless, due to the huge number of possible configurations of protein interactions, automatic based computation tools are required. Available prediction tools are able to analyze and predict possible combinations of proteins in a PPI network which have biological meanings. Once obtained, the protein interactions are analyzed with respect to biological meanings representing quality measures. Nevertheless, such tools strictly depend on input configuration and require biological validation. In this paper we propose a new prediction tool based on integration of different prediction results obtained from available tools. The proposed integration approach has been implemented in an on line available tool, IMPRECO standing for IMproving PREdiction of COmplexes. IMPRECO has been tested on publicly available datasets, with satisfiable results.
Instantiation for Parameterised Boolean Equation Systems
Authors: A. Dam, B. Ploeger, T. A. Willemse
Venue: Proceedings of the 5th international colloquium on Theoretical Aspects of Computing (2008)

Verification problems for finite- and infinite-state processes, like model checking and equivalence checking, can effectively be encoded in Parameterised Boolean Equation Systems (PBESs). Solving the PBES solves the encoded problem. The decidability of solving a PBES depends on the data sorts that occur in the PBES. We describe a manipulation for transforming a given PBES to a simpler PBES that may admit solution methods that are not applicable to the original one. Depending on whether the data sorts occurring in the PBES are finite or countable, the resulting PBES can be a Boolean Equation System (BES) or an Infinite Boolean Equation System (IBES). Computing the solution to a BES is decidable. Computing the global solution to an IBES is still undecidable, but for partial solutions (which suffices for e.g. local model checking), effective tooling is possible. We give examples that illustrate the efficacy of our techniques.
Roughness in n-ary hypergroups
Authors: V. Leoreanu-Fotea, B. Davvaz
Venue: Information Sciences: an International Journal (2008)

This paper is aimed at studying the rough sets within the context of the commutative n-ary hypergroups. For this approach, the presentation of a detailed study of the various types of n-ary subhypergroups is of the greatest importance. This study was initiated in [V. Leoreanu-Fotea, Several types of n-ary subhypergroups, Italian Journal of Pure and Applied Mathematics, in press]. Subsequently, we shall use the findings in this study to define the upper and lower approximation of a subset with respect to an invertible n-ary subhypergroup of a commutative n-ary hypergroup. In the final part, the concept of n-ary rough subhypergroup is introduced.
Modeling and Performance Evaluation of the Network and Service Management Plane
Authors: Abdelkader Lahmadi, Laurent Andrey, Olivier Festor
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Today, little is known about the costs associated with the manageability of a system. This lack of knowledge has a deep impact both on the quality and the performance of managed networks and services and even the management system itself. Thus, it becomes crucial to assess this cost and better understand the performance of management systems both with common metrics and performance evaluation methodologies. Based on empirical observations and analytical results, we identify interesting performance behavior of JMX (Java Management eXtension) based-management frameworks.
Approximate range searching in the absolute error model
Authors: David M. Mount
Venue:  (2007)

Range searching is a well known problem in computational geometry. We consider this problem in the context of approximation, where an approximation parameter &epsiv; > 0 is provided. Most prior work on this problem has focused on the relative error model, where each range shape R is bounded, and points within distance &epsiv; &middot; diam(R) of the range's boundary may or may not be included. We introduce a different approximation model, called the absolute error model, in which points within distance &epsiv; of the range's boundary may or may not be included, regardless of the diameter of the range. We consider sets of ranges consisting of general convex bodies, axis-aligned rectangles, halfspaces, Euclidean balls, and simplices. We examine a variety of problem formulations, including range searching under general commutative semigroups, idempotent semigroups, groups, range emptiness, and range reporting. We apply our data structures to several related problems, including range sketching, approximate nearest neighbor searching, exact idempotent range searching, approximate range searching in the data stream model, and approximate range searching in the relative model.
SecondLife&reg; as an evaluation platform for multiagent systems featuring social interactions
Authors: Matthias Rehm, Peter Rosina
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

In this paper we propose to use SecondLife&reg; as an evaluation environment for multiagent systems that model social group dynamics and social interactions. To this end we developed a control interface for NPCs in SecondLife&reg; that allows for running supervised or unsupervised long-term evaluations. Thus, this platform offers the possibility to move evaluation studies from the laboratory into a "natural" setting for the participants. First tests show the potential for this kind of evaluation.
UML Static Models in Formal Approach
Authors: Marcin Szlenk
Venue: Balancing Agility and Formalism in Software Engineering: Second IFIP TC 2 Central and East European Conference on Software Engineering Techniques, CEE-SET 2007, Poznan, Poland, October 10-12, 2007, Revised Selected Papers (2008)

The semantics of models written in UML is not precisely defined. Thus, it is hard to determine, how a given change in a model influences its meaning and, for example, to verify whether a given model transformation preserves the semantics of the model or not. In the paper a formal (mathematical) semantics of key elements of the UML static models is presented. The aim is to define the basic semantic relations between models: a consequence (implication) and equivalence. The goal of the definitions and examples presented in the article is to form a very basic, concise, theoretical foundation for the formal comparison of the UML static models, based on their meanings.
FDIR Architectures for Autonomous Spacecraft: Specification and Assessment with Event-B
Authors: Jean-Charles Chaudemar, Charles Castel, Christel Seguin
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

On-board Fault Detection, Isolation and Recovery (FDIR) systems are considered to ensure the safety and to increase the autonomy of spacecrafts. They shall be carefully designed and validated. Their implementation involves a relevant knowledge of items like functions and architectures of the system, and a fault model in relation with these items. Thus, the event-B method is well suited to correctly specify and validate on-board safety architectures.This paper focuses on the FDIR concept presentation and the use of event-B for formalising and for refining the FDIR concept.The paper is organised as follows: after a short presentation of on-board FDIR concept strongly bounded with autonomy architecture concept, we suggest activities enabling to implement FDIR concept. Then, we present the framework of formal modelling that we will use to describe our architecture and the properties related to this architecture. We illustrate our approach by modelling more specifically a safety architecture pattern that includes a primary functional component and a redundant one, under the hypothesis of no common fault. The safety property to be met is: "one single fault shall not lead to the total loss of the function". The last section of the paper deals with the objectives for the future work.
Analysis of Maximum Executable Length for Detecting Text-Based Malware
Authors: Parbati Kumar Manna, Sanjay Ranka, Shigang Chen
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

The possibility of using purely text stream (keyboard-enterable) as carrier of malware is under-researched and often under estimated. A text attack can happen at multiple levels, from code-injection attacks at the top level to host-compromising text-based machine code at the lowest level. Since a large number of protocols are text-based, at times the servers based on those protocols use ASCII filters to allow text input only. However, simply applying ASCII filters to weed out the binary data is not enough from the security viewpoint since the assumption that malware are always binary is false. We show that although text is a subset of binary, binary malware detectors cannot always detect text malware. We analyze the MEL (Maximum Executable Length)-based detection schemes, and make two contributions by this analysis. First, although the concept of MEL has been used in various detection schemes earlier, we are the first to provide its underlying mathematical foundation. We show that the threshold value can be calculated from the input character frequencies and that it can be tuned to control the detection sensitivity. Second, we demonstrate the effectiveness of a MEL-based text malware detector by exploiting the specific properties of text streams.
Enhancing Efficiency of Hierarchical BOA Via Distance-Based Model Restrictions
Authors: Mark Hauschild, Martin Pelikan
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

This paper analyzes the effects of restricting probabilistic models in the hierarchical Bayesian optimization algorithm (hBOA) by defining a distance metric over variables and disallowing dependencies between variables at distances greater than a given threshold. We argue that by using prior problem-specific knowledge, it is often possible to develop a distance metric that closely corresponds to the strength of interactions between variables. This distance metric can then be used to speed up model building in hBOA. Three test problems are considered: 3D Ising spin glasses, random additively decomposable problems, and the minimum vertex cover.