ppxscal/embedding_network huggingface dataset:
UML-B: A Plug-in for the Event-B Tool Set
Authors: Colin Snook, Michael Butler
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

UML-B is a graphical formal modelling notation that relies on Event-B for its underlying semantics and is closely integrated with the `Rodin', Event-B verification tools. UML-B is similar to UML but has its own meta-model. UML-B provides tool support, including drawing tools and a translator to generate Event-B models. When a UML-B drawing is saved the translator automatically generates the corresponding Event-B model. The Event-B verification tools (syntax checker and prover) then run automatically providing an immediate display of problems which are indicated on the relevant UML-B diagram.The UML-B modelling environment consists of a UML-B project containing a UML-B model. Four interlinked diagram types (package, context, class and statemachine) are available. Package Diagrams are used to describe the `refines' and `sees' relationships between top level components (machines and contexts) of a UML-B project. UML-B mirrors the Event-B approach where static data (sets and constants) are modelled in a separate package called a `context'. The context diagram is similar to a class diagram but has only constant data represented by ClassTypes, Attributes and Associations. ClassTypes define `carrier' sets or constant subsets of other ClassTypes.
Farmland appraisal based on the analytic network process
Authors: Mónica García-Melón, Javier Ferrís-Oñate, Jerónimo Aznar-Bellver, Pablo Aragonés-Beltrán, Rocío Poveda-Bautista
Venue: Journal of Global Optimization (2008)

This paper presents an application of the Analytic Network Process (ANP) to farmland appraisal. The purpose of this new methodology is to solve some of the drawbacks found in comparative and capitalisation methods, called classical appraisal methods, which cannot deal with contexts where only partial information is available and/or qualitative variables are used. The ANP is a method based on the Multiple Criteria Decision Analysis (MCDA). Previous works have already applied other MCDA techniques to the appraisal context, such as the Analytic Hierarchy Process (AHP), however they have not been able to handle all the complexities of many real world appraisal problems. The ANP provides a more accurate approach for modelling complex environment because it allows the general study of the quantitative and qualitative explanatory variables of the price and the incorporation of feedback and interdependence relationships among variables. The new proposed methodology has been applied to a case study of a farm located in Valencia (Spain) in order to demonstrate its goodness. Both quantitative and qualitative variables, such as the age of the trees, productivity or water quality, have been considered to assess the market value of the farm. Six farms from the same region have been selected as reference assets. The appraisal problem has been solved in three different ways in order to study the influence of each model on the value of the problem farm. In this study it has been proved that the more information is incorporated into the model, the higher accuracy of the solution. From the results of this work we can conclude that the approach proposed stands out as a good alternative to current farmland appraisal approaches, as it has proven to be useful when data are only partially available, qualitative variables are used and influences among the explanatory variables are present.
A CAD system for multi-style thermal functional design of clothing
Authors: Aihua Mao, Yi Li, Xiaonan Luo, Ruomei Wang, Shuxiao Wang
Venue: Computer-Aided Design (2008)

Designing clothing with good thermal functional performance is very demanding and time-consuming if we follow traditional design methods. An innovative method consisting of a CAD system, allowing the designer to perform multi-style clothing thermal functional design on a customized virtual human body, is presented in this paper. The new functionalities of the virtual system provide the abilities to perform intelligent design of different clothing styles and materials for different body parts according to individual design requirements, namely design of various categories of clothing, such as hat, coat, trousers, gloves and shoes in the same design scheme. The designed clothing can be worn on a virtual human body and set in various wearing scenarios. The thermal behaviors in the human body-clothing-environment are simulated to predict the thermal performance of clothing and thermal response of the human body at multi-parts. 2D/3D visualization and animation of the simulation results are presented to help the designers to preview and determine whether the thermal performance of clothing is satisfactory and then obtain feedback to improve their designs iteratively.
Mizar Course in Logic and Set Theory
Authors: Ewa Borak, Anna Zalewska
Venue: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference (2007)

From the very beginning of the development of the Mizar system experiments with using Mizar as a tool for teaching mathematics have been conducted. Numerous organized courses were based on different versions of the system: starting from the first implementation of its processor, through Mizar-MSE, Mizar---4 and PC---Mizar up till its present version. Now Mizar with its mathematical library gives us quite new didactic possibilities.The purpose of this paper is to present a certain course on logic and set theory offered by our Institute for freshman students. The course employs Mizar as the main tool of instruction. In the paper we discuss the organization of this course and describe some examples of students' tasks. Finally, some conclusions and remarks are given.
Authenticated Encryption: Relations among Notions and&#x00a0;Analysis of the Generic Composition Paradigm
Authors: Mihir Bellare, Chanathip Namprempre
Venue: Journal of Cryptology (2008)

An authenticated encryption scheme is a symmetric encryption scheme whose goal is to provide both privacy and integrity. We consider two possible notions of authenticity for such schemes, namely integrity of plaintexts and integrity of ciphertexts, and relate them, when coupled with IND-CPA (indistinguishability under chosen-plaintext attack), to the standard notions of privacy IND-CCA and NM-CPA (indistinguishability under chosen-ciphertext attack and nonmalleability under chosen-plaintext attack) by presenting implications and separations between all notions considered. We then analyze the security of authenticated encryption schemes designed by &#x201c;generic composition,&#x201d; meaning making black-box use of a given symmetric encryption scheme and a given MAC. Three composition methods are considered, namely Encrypt-and-MAC, MAC-then-encrypt, and Encrypt-then-MAC. For each of these and for each notion of security, we indicate whether or not the resulting scheme meets the notion in question assuming that the given symmetric encryption scheme is secure against chosen-plaintext attack and the given MAC is unforgeable under chosen-message attack. We provide proofs for the cases where the answer is &#x201c;yes&#x201d; and counter-examples for the cases where the answer is &#x201c;no.&#x201d;
Evaluating Cellular Automata Models by Evolutionary Multiobjective Calibration
Authors: Maria Vittoria Avolio, Donato D'Ambrosio, Salvatore Gregorio, Valeria Lupiano, Rocco Rongo, William Spataro, Giuseppe A. Trunfio
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

This paper proposes a multi-objective approach for Cellular Automata (CA) calibration. The method exploits the available temporal sequences of spatial data in order to produce CAs which are non-dominated (i.e. Pareto optimal) with respect to multiple objectives representing the disagreement between the simulated and real dynamics. A preliminary application, based on a parallel multi-objective Genetic Algorithm, showed that the proposed approach can provide significant insights about potentialities and limits of a CA model.
Location-based trust for mobile user-generated content: applications, challenges and implementations
Authors: Vincent Lenders, Emmanouil Koukoumidis, Pei Zhang, Margaret Martonosi
Venue: Proceedings of the 9th workshop on Mobile computing systems and applications (2008)

The recent explosion in shared media content and sensed data produced by mobile end-users is challenging well-established principles and assumptions in data trust models. A fundamental issue we address in this paper is how to establish some trust level in the authenticity of content created by untrusted mobile users. We advocate a secure localization and certification service that allows content producers to tag their content with with a spatial times-tamp indicating its physical location. At the same time, however, our approach preserves the privacy of producers by not exposing their identity to the potential content consumers. We provide a list of existing and possible applications that would profit from such a secure localization service and sketch possible implementations of the service, highlighting advantages and drawbacks.
Software Patterns in ITS Architectures
Authors: Vladan Devedzic, Andreas Harrer
Venue: International Journal of Artificial Intelligence in Education (2005)

The paper discusses ITS architectures in terms of patterns that exist within them. The concept of patterns has received surprisingly little attention so far from researchers in the field of ITS. A recent analysis of a number of existing ITS architectures has revealed that many ITS designers and developers use their own solutions when faced with design problems that are common to different systems, models, and paradigms. However, a closer look into such solutions and their comparison often shows that different solutions and the contexts in which they apply also have much in common, just like the corresponding problems do. In all such cases we can talk of the existence of patterns. A pattern is a generalized solution of a typical problem within a typical context. Discovering such patterns can help clarify general guiding principles of ITS-architectural design in a more systematic way.
Estimating MIMO channel covariances from training data under the Kronecker model
Authors: Karl Werner, Magnus Jansson
Venue: Signal Processing (2009)

Many algorithms for transmission in multiple input multiple output (MIMO) communication systems rely on second order statistics of the channel realizations. The problem of estimating such second order statistics of MIMO channels, based on limited amounts of training data, is treated in this article. It is assumed that the Kronecker model holds. This implies that the channel covariance is the Kronecker product of one covariance matrix that is associated with the array and the scattering at the transmitter and one that is associated with the receive array and the scattering at the receiver. The proposed estimator uses training data from a number of signal blocks (received during independent fades of the MIMO channel) to compute the estimate. This is in contrast to methods that assume that the channel realizations are directly available, or possible to estimate almost without error. It is also demonstrated how methods that make use of the training data indirectly via channel estimates can be biased. An estimator is derived that can, in an asymptotically optimal way, use, not only the structure implied by the Kronecker assumption, but also linear structure on the transmit- and receive covariance matrices. The performance of the proposed estimator is analyzed and numerical simulations illustrate the results and also provide insight into the small sample behaviour of the proposed method.
A Mini Challenge: Build a Verifiable Filesystem
Authors: Rajeev Joshi, Gerard J. Holzmann
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

We propose tackling a "mini challenge" problem: a nontrivial verification effort that can be completed in 2-3 years, and will help establish notational standards, common formats, and libraries of benchmarks that will be essential in order for the verification community to collaborate on meeting Hoare's 15-year verification grand challenge. We believe that a suitable candidate for such a mini challenge is the development of a filesystem that is verifiably reliable and secure. The paper argues why we believe a filesystem is the right candidate for a mini challenge and describes a project in which we are building a small embedded filesystem for use with flash memory.
Improving Musical Expressiveness by Time-Varying Brightness Shaping
Authors: Mathieu Barthet, Richard Kronland-Martinet, Sølvi Ystad
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

Former studies show that removing brightness temporal variations of tones in an expressive clarinet performance induces a decrease in the appreciation judgments among listeners. This study aims to investigate the reciprocal process where a time-varying brightness pattern is extracted from a clarinet performance and added to MIDI sound sequences generated by sampler-based instruments. Performances with and without brightness temporal variations have hereby been generated using samples from three sustained instruments (piccolo flute, clarinet and cello) and two non-sustained instruments (guitar and sitar). 20 listeners were asked to rate the dissimilarities between the performances in terms of interpretation, and then to select the performance they preferred. Results show that the application of the brightness temporal variations extracted from the clarinet performance increases the appreciation judgment of the performances for almost all the instruments used in the experiment.
Techniques for exploring global time and achieving high-level qos in multi-party videoconferencing systems
Authors: Kane Kim
Venue:  (2008)

Even though steadily growing in both variety and functional complexity, one of the key issues in enabling high-level QoS in multi-party videoconferencing (MPVC) systems is still the accurate maintenance of the temporal relationship among Media Units (MUs) without the loss of real-time performance required by the human perceptions. Ubiquitous two-way videoconferencing systems focus on synchronizations for one or two streams among two sites while multiple streams delivered to multiple sites need to be synchronized in MPVC. In this dissertation, the principle of global-time-based coordination of distributed actions (TCoDA) is exploited to form a fundamental and promising approach for solving this problem. An innovative global time-based synchronization technique (TPT scheme) based on this principle is proposed to provide high-precision intra-stream, inter-stream, and inter-destination synchronizations for MPVC. Reducing the amount of efforts for designing and implementing MPVC while synchronizing various kinds of distributed actions to provide high-level QoS in MPVC has become another major challenge in the distributed real-time multimedia software research community. While the conventional remote method invocation mechanism has been considered for a long time as the primary high-level programming model for facilitating interactions among real-time objects in distributed systems, a multicast support mechanism has been recognized in recent years as an attractive supplement, if not a favored approach, in many applications. One highly promising concrete formulation of a multicast mechanism and an associated programming model is the real-time multicast and memory-replication channel (RMMC). This dissertation presents an API set designed for facilitating easy use of RMMCs and a middleware subsystem devised to support RMMCs. As a validation, an MPVC with high-level QoS support is constructed with the use of the Time-triggered Message-triggered Object (TMO) scheme and its tool-kit, including RMMC. Its performance over Wide Area Network (WAN) demonstrates that TCoDA, including the TPT scheme, is a fundamental and promising approach for distributed multimedia applications. It is also a demonstration that the TMO scheme and its tool-kit (including RMMC), which enable relatively easy high-level programming of manipulations of global time-stamps and timely processing of MUs, are significantly helpful in reducing the amount of efforts for designing and implementing complex distributed multimedia applications.
A Reputation Management Scheme Improving the Trustworthiness of P2P Networks
Authors: Junghwa Shin, Taehoon Kim, Sungwoo Tak
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Because of the openness and anonymity of Peer-to-Peer (P2P) networks, P2P participants can easily spread inauthentic resources such as viruses or worms throughout Internet. Besides, the deployment of such inauthentic resources in P2P networks has a chance of posing serious problems, thus, the trust on P2P participants needs to be carefully considered. A possible way to cope with this issue is to prevent inauthentic resources from being distributed in a way to refer peers' reputation which reflect their past behaviors. However, a peer intentionally plays along with other peers in order to increase/decrease its reputation through false feedback exchanges. Therefore, we propose a new reputation management scheme, called TrustRM (Trustworthy Reputation Management for resource sharing), which identifies peers who give false feedback as well as provide shared resources and peers with reliability by identifying malicious peers. A case study based on NS2-simulator experiments is conducted to illustrate the application and efficiency of the TrustRM scheme. It shows that our TrustRM scheme yields efficient performance in terms of minimal download ratio of inauthentic resources, even distribution of traffic loads among peers, and efficient response to peers' trust changes according to their false feedback exchanges.
Investigating the Suitability of FPAAs for Evolved Hardware Spiking Neural Networks
Authors: Patrick Rocke, Brian Mcginley, John Maher, Fearghal Morgan, Jim Harkin
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

This paper investigates the use of a network of cascaded Field Programmable Analogue Arrays (FPAAs) to implement an evolved, analogue, Spiking Neural Network (SNN) pole balance controller. The SNN hardware platform interfaces to a simulated pole balancing model for evaluation. Performance of the evolved analogue hardware controller is compared to that of a software-based SNN controller. The evolved hardware network displays an improved tolerance to changing environments compared with networks evolved solely in simulation. The paper goes on to discuss the suitability of low density FPAA devices for analogue-centric hardware neural network platforms. It concludes by outlining some possible directions which address the observed limitations of using FPAAs for ANNs.
Motion Control of Swedish Wheeled Mobile Robots in the Presence of Actuator Saturation
Authors: Giovanni Indiveri, Jan Paulus, Paul G. Plöger
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

Swedish wheeled mobile robots have remarkable mobility properties allowing them to rotate and translate at the same time. Being holonomic systems, their kinematics model results in the possibility of designing separate and independent position and heading trajectory tracking control laws. Nevertheless, if these control laws should be implemented in the presence of unaccounted actuator saturation, the resulting saturated linear and angular velocity commands could interfere with each other thus dramatically affecting the overall expected performance. Based on Lyapunov's direct method, a position and heading trajectory tracking control law for Swedish wheeled robots is developed. It explicitly accounts for actuator saturation by using ideas from a prioritized task based control framework.
On the Minimum Hitting Set of Bundles Problem
Authors: Eric Angel, Evripidis Bampis, Laurent Gourvès
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

We consider a natural generalization of the classical minimum hitting set problem, the minimum hitting set of bundles problem (mhsb) which is defined as follows. We are given a set $\mathcal{E}=\{e_1, e_2 , \ldots , e_n\}$ of n elements. Each element e i (i = 1, ...,n) has a non negative cost c i . A bundle b is a subset of $\mathcal{E}$. We are also given a collection $\mathcal{S}=\{S_1, S_2 , \ldots , S_m\}$ of m sets of bundles. More precisely, each set S j (j = 1, ..., m) is composed of g(j) distinct bundles $b_j^1, b_j^2, \ldots , b_j^{g(j)}$. A solution to mhsb is a subset $\mathcal{E}' \subseteq \mathcal{E}$ such that for every $S_j \in \mathcal{S}$ at least one bundle is covered, i.e. $b_j^l \subseteq \mathcal{E}'$ for some l ¿ {1,2, ¿ ,g(j)}. The total cost of the solution, denoted by $C(\mathcal{E'})$, is $\sum_{\{i \mid e_i \in \mathcal{E'}\}} c_i$. The goal is to find a solution with minimum total cost.We give a deterministic $N(1-(1-\frac{1}{N})^M)$-approximation algorithm, where N is the maximum number of bundles per set and M is the maximum number of sets an element can appear in. This is roughly speaking the best approximation ratio that we can obtain since, by reducing mhsb to the vertex cover problem, it implies that mhsb cannot be approximated within 1.36 when N = 2 and N ¿ 1 ¿ ¿ when N ¿ 3. It has to be noticed that the application of our algorithm in the case of the min k ¿sat problem matches the best known approximation ratio.
A Networked, Lightweight and Partially Reconfigurable Platform
Authors: Pierre Bomel, Guy Gogniat, Jean-Philippe Diguet
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

In this paper we present a networked lightweight and partially reconfigurable platform assisted by a remote bitstreams server. We propose a software and hardware architecture as well as a new data-link level network protocol implementation dedicated to dynamic and partial reconfiguration of FPGAs. It requires a network controller and much less external memories to store reconfiguration software, bitstreams and buffer pools used by standard communication protocols. Our measures, based on a real implementation, show that our system can download remote bistreams with a reconfiguration speed ten times faster than known solutions.
Parameter Estimation of Vector-Sensor Array in Colored Noise with Quaternion-MUSIC
Authors: Kunlei Zhang, Shuxun Wang, Fei Wang, Jianguo Han
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

This paper addresses the problem of estimating direction of arrival (DOA) and polarization parameters for vector-sensor array in MA noise based on quaternion. First, the computation method of right eigenvalue decomposition of quaternion matrix (REVDQ) is introduced in detail. Then, duplicate auto-correlation function (that's auto-correlation function of auto-correlation function) of quaternion signal is defined, which can not only express signal parameters but also restrain MA noise. Finally, Toeplitz matrix based on duplicate auto-correlation function is constructed, and right eigenvalue decomposition of the Toeplitz matrix is used to part signal subspace and noise subspace. Thus, signal parameters are estimated with Quaternion-MUSIC (Q-MUSIC) taking advantage of orthogonality between signal subspace and noise subspace. Some simulations illustrate our idea.