ppxscal/embedding_network huggingface dataset:
A Notion of Glue Expressiveness for Component-Based Systems
Authors: Simon Bliudze, Joseph Sifakis
Venue: Proceedings of the 19th international conference on Concurrency Theory (2008)

Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g. automaton and Turing machine. This leads to a notion of expressiveness which is not adequate for component-based systems where separation between behavior and coordination mechanisms is essential. The paper proposes a notion of glue expressiveness for component-based frameworks characterizing their ability to coordinate components.Glue is a closed under composition set of operators mapping tuples of behavior into behavior. Glue operators preserve behavioral equivalence. They only restrict the behavior of their arguments by performing memoryless coordination.Behavioral equivalence induces an equivalence on glue operators. We compare expressiveness of two glues G 1 and G 2 by considering whether glue operators of G 1 have equivalent ones in G 2 (strong expressiveness). Weak expressiveness is defined by allowing a finite number of additional behaviors in the arguments of operators of G 2.We propose an SOS-style definition of glues, where operators are characterized as sets of SOS-rules specifying the transition relation of composite components from the transition relations of their constituents. We provide expressiveness results for the glues of BIP and of process algebras such as CCS, CSP and SCCS. We show that for the considered expressiveness criteria, glues of the considered process calculi are less expressive than general SOS glue. Furthermore, glue of BIP has exactly the same strong expressiveness as glue definable by the SOS characterization.
Compression from Collisions, or Why CRHF Combiners Have a Long Output
Authors: Krzysztof Pietrzak
Venue: Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology (2008)

A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of the components is collision resistant.In this paper we prove a lower bound on the output length of black-box combiners for CRHFs. The bound we prove is basically tight as it is achieved by a recent construction of Canetti et al [Crypto'07]. The best previously known lower bounds only ruled out a very restricted class of combiners having a very strong security reduction: the reduction was required to output collisions for both underlying candidate hash-functions given a single collision for the combiner (Canetti et al [Crypto'07] building on Boneh and Boyen [Crypto'06] and Pietrzak [Eurocrypt'07]).Our proof uses a lemma similar to the elegant "reconstruction lemma" of Gennaro and Trevisan [FOCS'00], which states that any function which is not one-way is compressible (and thus uniformly random function must be one-way). In a similar vein we show that a function which is not collision resistant is compressible. We also borrow ideas from recent work by Haitner et al. [FOCS'07], who show that one can prove the reconstruction lemma even relative to some very powerful oracles (in our case this will be an exponential time collision-finding oracle).
Distributed Line Graphs: A Universal Framework for Building DHTs Based on Arbitrary Constant-Degree Graphs
Authors: Yiming Zhang, Ling Liu, Dongsheng Li, Xicheng Lu
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Most proposed DHTs have their unique maintenance mechanisms specific to the static graphs on which they are based. In this paper we propose distributed line graphs (DLG), a universal framework for building DHTs based on arbitrary constant-degree graphs. We prove that in a DLG-enabled, N-node DHT, the out-degree is d, the in-degree is between 1 and 2d, and the diameter is less than 2(logdN−logdN0+D0+1), where d, D0 and N0 represent the degree, diameter and number of nodes of the initial graph, respectively. The maintenance cost of DLG-enabled DHTs is O(logdN). We show the power of DLG technique by applying it to Kautz graphs to propose a new DHT scheme.
A Deformable Surface Model with Volume Preserving Springs
Authors: Sylvester Arnab, Vinesh Raja
Venue: Proceedings of the 5th international conference on Articulated Motion and Deformable Objects (2008)

This paper discusses the possibility of employing a surface model to emulate volume behaviour. This is inspired by a significant interest in employing the surface data due to its simplicity. However, there are issues in properties estimation and volume preservation. Therefore, the aim of the ongoing research includes exploring the potential of a surface mass spring model with shape-preserving springs for volume simulation. Initial evaluations illustrate the feasibility of employing a mass spring model with volume preserving springs to simulate the dynamic behaviour of a soft volume. The proposed framework can be further explored to address other material properties.
Study on Web-Page Classification Algorithm Based on Rough Set Theory
Authors: Shiqun Yin, Fang Wang, Zhong Xie, Yuhui Qiu
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

The large number of Web-page documents is comprise high dimensional huge text database with the development of Internet technology. But it is only a very small portion with the relevant users. The Web-page should be assigned to a category structure through the Web-page classification technology. it is not only convenient for customers to browse Web-page, but also easier to make Web-page seek through restriction search scope. Mining in high dimensional data is extraordinarily difficult because of the curse of dimensionality. We must adopt feature select to solve these problems. A algorithm is given in this paper to reduce the Web-page feature term and extract classification rule at last used attribute reduction on rough set theory. Experimental results show that this method has been greatly reduced feature vector space dimension and gotten easy-to-understand classification rules, and its accuracy is higher and the speed of classification is faster than based on the classification of vector comparison.
Automated Induction with Constrained Tree Automata
Authors: Adel Bouhoula, Florent Jacquemard
Venue: Proceedings of the 4th international joint conference on Automated Reasoning (2008)

We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values), and may express syntactic equality, disequality, ordering and also membership in a fixed tree language. Constrained equational axioms between constructor terms are supported and can be used in order to specify complex data structures like sets, sorted lists, trees, powerlists...Our procedure is based on tree grammars with constraints, a formalism which can describe exactly the initial model of the given specification (when it is sufficiently complete and terminating). They are used in the inductive proofs first as an induction scheme for the generation of subgoals at induction steps, second for checking validity and redundancy criteria by reduction to an emptiness problem, and third for defining and solving membership constraints.We show that the procedure is sound and refutationally complete. It generalizes former test set induction techniques and yields natural proofs for several non-trivial examples presented in the paper, these examples are difficult (if not impossible) to specify and carry on automatically with other induction procedures.
Analysis and design of a broadband antenna for software defined radio
Authors: Jennifer Bernhard
Venue:  (2007)

This work presents the design and analysis of a broadband antenna capable of achieving an instantaneous 3:1 VSWR bandwidth and omnidirectional radiation coverage spanning a bandwidth greater than 20:1. The antenna is designed to accommodate the very large bandwidth requirements of software-defined radios and to minimize the effective volume of the overall design. The antenna is composed of a vertical radiating element over a wound plane, and utilizes a tuning strap to improve the impedance bandwidth over the frequency range in which the antenna is considered electrically small. Measurements demonstrate a 3:1 VSWR impedance bandwidth from 30 MHz to 6 GHz while maintaining a relatively omnidirectional radiation pattern over the majority of this bandwidth. Equivalent circuit model and analytical model are developed to calculate the input impedance of the antenna over different spectrums. A model of the tuning mechanism is also analyzed along with a discussion of the antenna's efficiency.
Delay-oriented reliable communication and coordination in wireless sensor-actuator networks
Authors: Michael R. Lyu
Venue:  (2007)

Wireless sensor-actuator networks, or WSANs, greatly enhance the existing wireless sensor network architecture by introducing powerful and mobile actuators. These actuators are expected to work with the sensor nodes and perform much richer application-specific actions. For the applications which request for fast and accurate report of the environmental events, an efficient and reliable communication/coordination scheme is urged. Unfortunately, multi-hop communication in a WSAN is inherently unreliable due to frequent sensor failures and network partitions. Excessive delays, introduced by congestion or in-network data aggregation, further aggravate the problem. In this thesis, we propose a general reliability-centric framework for event reporting in WSANs. We point out that the reliability in such a real-time system depends not only on the accuracy, but also the importance and freshness of the reported data. Our proposed design thus integrates three key modules, (1) an efficient and fault-tolerant event data aggregation algorithm, (2) a delay-aware data transmission protocol, and (3) an adaptive actuator allocation algorithm for unevenly distributed events. We further propose a latency-oriented fault tolerant data transport protocol (LOFT) and a power-controlled real-time data transport protocol (POWER-SPEED) for WSANs. LOFT balances the workload of sensors by checking their queue utilization and handles node/link failures by an adaptive replication algorithm. POWER-SPEED transmits packets in an energy-efficient manner while maintaining soft real-time packet transport. We evaluate our framework and the two proposed protocols through extensive simulations, and the results demonstrate that they achieve the desirable reliability for WSANs. To minimize the data collection time, we propose a new routing design. We present the mathematical formulation of the route design problem, and show that it is computationally intractable. We then propose two practical algorithms to reduce the delay of the sensors. Our algorithms adaptively adjust the actuator visiting frequencies to the sensors according to their relative weights and data generation patterns. We further propose a probabilistic route design (PROUD) algorithm which adapts to network dynamics. We present the distributed implementation for PROUD and an extension which accommodates actuators with variable speeds. We also propose algorithms for load balancing among the actuators. Simulation results show that our algorithms can effectively reduce the overall data collection time. They adapt to the network dynamics and balances the energy consumption of the actuators. Finally, we present a novel algorithm for intruder detection in a sinkhole attack of wireless sensor network. The algorithm can identify the intruder and deal with multiple malicious nodes effectively. We have evaluated the performance of the proposed algorithm through both numerical analysis and simulations, which confirmed the effectiveness and accuracy of our algorithm.
Metrics-based design selection tool for aspect oriented software development
Authors: Chitra Babu, R. Vijayalakshmi
Venue: ACM SIGSOFT Software Engineering Notes (2008)

Software metrics provide a means for software practitioners to assess the quality of their software. Ideally, this information should be available earlier in the software development lifecycle, since changes are much more expensive to incorporate in the later stages. Design level metrics offer an elegant way of capturing this information. Research in software design metrics has focused primarily on procedural and object oriented software. However, such metrics are currently not available for Aspect Oriented Software Development (AOSD), which is an emerging paradigm. Aspect Oriented Programming (AOP) is an approach that allows programmers to modularize crosscutting concerns that are scattered across multiple modules. Separation of concerns through aspects has the advantages of increased reliability, adaptability and better reuse. The objective of this paper is to propose suitable metrics for the Aspect Oriented Design (AOD) and to develop a tool that will automatically select a better design based on the proposed metrics. In this paper, class and sequence diagrams are used to represent an AOD. The proposed design level metrics are applied to two alternative designs of an illustrative case study. The tool selects the design that better suits stakeholder requirements, based on logical inferences obtained from these metrics regarding the quality of the Aspect Oriented software.
Evidential Reasoning Based on Multisensor Data Fusion for Target Identification
Authors: Xin Wang, Yunxiao Wang, Xiao Yu, Zhengxuan Wang, Yunjie Pang
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Air target identification is an important issue in threat warning, airline security and surveillance. To obtain accuracy and reliability, the multisensor is used to give multiple sources information. Thus, an algorithm to fuse the information from the multisensor is needed. The (Dempster-Shafer) evidence theory is a generalization of Bayesian statistics. Evidential reasoning is suited to a range of decision-making activities. But it is invalid when dealing with conflicting probabilities. In this paper, a new weighted D-S combination rule is proposed to solve the conflicting management in the air target identification system. In the weighted method presented here, it is to modify evidences rather than to modify the combination rule. The rationality and effectiveness of the weighted method are evaluated by the target identification system.
Extending the ANSI/SPARC Architecture Database with Explicit Data Semantics: An Ontology-Based Approach
Authors: Chimène Fankam, Stéphane Jean, Ladjel Bellatreche, Yamine Aït-Ameur
Venue: Proceedings of the 2nd European conference on Software Architecture (2008)

The database (DB) design process follows the traditional ANSI/SPARC architecture proposed by Bachman [1]. A conceptual model (CM) is translated into a logical model corresponding to a data specification implemented in a DB system. The physical model defines how data are stored and accessed. External models allow a DB designer to adapting data according to user's requirements. Regarding the semantic exploitation of data models, this architecture has two major drawbacks [2]: (1) a strong dependency of models with designers and specific application requirements; (2) a gap between conceptual and logical models that increases with the discrepancy of the conceptual modelling languages.The maintenance and/or evolution of the CM, that must be consensual when dealing with semantic integration of data sources (semantics and schema conflicts), are in the kernel of these problems. Recently, some works give more importance to CMs by materializing them in a DB [3]. In these works, the design of a CM is preceded by the design or by pre-existence of ontology. In this case, both ontology and data are represented in the DB. Such a DB is called an ontologybased database (OBDB). Hence our proposition is to extend the ANSI/SPARC architecture to support OBDBs.
Tutorial I: Hilbert space, orthogonality and quality measurement milestones of HDMR, high dimensional model representation
Authors: Metin Demiralp
Venue: Proceedings of the 7th WSEAS International Conference on Microelectronics, Nanoelectronics, Optoelectronics (2008)

High Dimensional Model Representation is perhaps the most interesting and efficient tool developed in last fifteen years for multivariate analysis. The basic concept was proposed by Sobol. Rabitz brought the weight function and geometry extensions to the method although the orthogonality of the geometry proposed by Sobol was preserved. Later, Demiralp established the bridge between the vanishing conditions and the orthogonality conditions amongst the HDMR components. He also defined certain functionals to measure the contribution percentage of different variete HDMR components to norm square of the whole HDMR expansion. Sobol, Rabitz and his group, and Demiralp's group is continuing to make research in various aspects of HDMR. Today, a lot of new variants of HDMR are constructed and being successfully used. Quite recently constructed fluctuation expansion technique, which is proceeding in the way of becoming a theory, has facilitated to construct an approximate but integration free algorithm in HDMR. This tutorial will focus on the Hilbert space components of HDMR theory starting from its birth to the present form.
Collision Avoidance Algorithms: Multi-agent Approach
Authors: Pavel Vrba, Vladimír Mařík, Libor Přeučil, Miroslav Kulich, David Šišlák
Venue: Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2007)

The paper deals with the methods for detection and avoidance of collisions of autonomously moving vehicles utilizing the principles and techniques of multi-agent systems. Three different scenarios are discussed: (i) movement of AGVs in 2D space with fixed trajectories, (ii) movement of autonomous robots in an open 2D space and (iii) collision-free flights of unmanned aerial vehicles. For each category, an agent-based solution is proposed. Presented experiments show that the cooperative approach to detecting and avoiding collisions based on negotiation and goal sharing of agents, representing vehicles, seems to be highly efficient. The multi-layer architecture combining cooperative approach with algorithms based on dynamic no-access zones for avoiding non-cooperative vehicles provides good results in generating collision-free flight corridors.
Pattern minimization problems over recursive data types
Authors: Alexander Krauss
Venue: ACM SIGPLAN Notices (2008)

In the context of program verification in an interactive theorem prover, we study the problem of transforming function definitions with ML-style (possibly overlapping) pattern matching into minimal sets of independent equations. Since independent equations are valid unconditionally, they are better suited for the equational proof style using induction and rewriting, which is often found in proofs in theorem provers or on paper. We relate the problem to the well-known minimization problem for propositional DNF formulas and show that it is £P/2-complete. We then develop a concrete algorithm to compute minimal patterns, which naturally generalizes the standard Quine-McCluskey procedure to the domain of term patterns.
Benchmarking Next-Generation Switch Fabrics
Authors: Itamar Elhanany, Vahid Tabatabaee
Venue: Computer (2003)

Switch fabrics are a principal building block in networking and communications platforms, but the growing use of merchant fabric silicon for diverse market segments is making it increasingly challenging to evaluate and compare the various product offerings.
Incremental Multimodal Feedback for Conversational Agents
Authors: Stefan Kopp, Thorsten Stocksmeier, Dafydd Gibbon
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

Just like humans, conversational computer systems should not listen silently to their input and then respond. Instead, they should enforce the speaker-listener link by attending actively and giving feedback on an utterance while perceiving it. Most existing systems produce direct feedback responses to decisive (e.g. prosodic) cues. We present a framework that conceives of feedback as a more complex system, resulting from the interplay of conventionalized responses to eliciting speaker events and the multimodal behavior that signals how internal states of the listener evolve. A model for producing such incremental feedback, based on multi-layered processes for perceiving, understanding, and evaluating input, is described.
Application of Parallel Programming in Collaborative Design
Authors: Tieming Su, Xiaoliang Tai, Zhixiang Xu
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

Aiming at improving the design and assembly efficiency of complex products in collaborative design, this paper proposes a parallel assembly model which is based on parallel computing. It divides assembly task into subtasks according to main branch in the virtual-link structure, and finally the subtasks run in parallel. This model supports large scale design, improves the speed and at the same time improves the computing resource utilization of collaborative design in Grid environment. A collaborative design prototype system based on Grid, which takes hybrid CSG/B-Rep model as geometric kernel, is developed to realize parallel assembly. Experimental results obtained from Lenovo DeepComp 1800 System are displayed and analyzed.
Fingerprint Image Postprocessing Using Windowing Technique
Authors: Anam Tariq, M. Usman Akram, Sarwat Nasir, Rabia Arshad
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

Performance of Automatic Fingerprint Identification System (AFIS) is greatly affected by its matching rate, means it should have low False Acceptance Rate (FAR) and False Rejection Rate (FRR). Minutiae based fingerprint matching techniques are normally used for fingerprint matching. In this paper, we present a new technique for fingerprint image postprocessing. This postprocessing is used to eliminate a large number of false extracted minutiae from skeletonized fingerprint images. We propose a windowing postprocessing method that takes into account the neighborhood of each minutia within defined window and check for minutia validation and invalidation. The results are confirmed by visual inspections of validated minutiae of the FVC2004 reference fingerprint image database. Experimental results obtained by the proposed approach show efficient reduction of false minutiae.
The business of softwareThe ontology of paper
Authors: Phillip G. Armour
Venue: Communications of the ACM (2009)

The next generation of software engineering will involve designing systems without using paper-based formats, instead using software to develop software.