ppxscal/embedding_network huggingface dataset:
Development with Off-the-Shelf Components: 10 Facts
Authors: Jingyue Li, Reidar Conradi, Christian Bunse, Marco Torchiano, Odd Petter N. Slyngstad, Maurizio Morisio
Venue: IEEE Software (2009)

Several empirical studies have been conducted on issues related to the development of systems using commercial off-the-shelf and open source software components. The results demonstrate a discrepancy between academic theory and industrial practices regarding the use of components. One reason is that researchers have empirically evaluated only a few theoretical methods; so, industrial practitioners have no reason to adopt them. Another reason might be that researchers have specified the application contexts of only a small number of theories in sufficient detail to avoid misleading users. Academic researchers often hold false assumptions about industry. For example, research on requirement negotiations often assumes that a client will be interested in, and be capable of, discussing a project's technical details. However, in practice this is usually not true. In addition, the quality of a component in the final system is often attributed solely to component quality before integration, ignoring quality improvements by integrators during component integration.
Double variable neighbourhood search with smoothing for the molecular distance geometry problem
Authors: Leo Liberti, Carlile Lavor, Nelson Maculan, Fabrizio Marinelli
Venue: Journal of Global Optimization (2009)

We discuss the geometrical interpretation of a well-known smoothing operator applied to the Molecular Distance Geometry Problem (MDGP), and we then describe a heuristic approach based on Variable Neighbourhood Search on the smoothed and original problem. This algorithm often manages to find solutions having higher accuracy than other methods. This is important as small differences in the objective function value may point to completely different 3D molecular structures.
Tracking People on a Torus
Authors: Ahmed Elgammal, Chan-Su Lee
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

We present a framework for monocular 3D kinematic pose tracking and viewpoint estimation of periodic and quasi-periodic human motions from an uncalibrated camera. The approach we introduce here is based on learning both the visual observation manifold and the kinematic manifold of the motion using a joint representation. We show that the visual manifold of the observed shape of a human performing a periodic motion, observed from different viewpoints, is topologically equivalent to {\em a torus manifold}. The approach we introduce here is based on {\em supervised} learning of both the visual and kinematic manifolds. Instead of learning an embedding of the manifold, we learn the geometric deformation between an ideal manifold (conceptual equivalent topological structure) and a twisted version of the manifold (the data). Experimental results show accurate estimation of the 3D body posture and the viewpoint from a single uncalibrated camera.
Study on effects of nonholonomic constraints on dynamics of a new developed quadruped leg-wheeled passive mobile robot
Authors: Libo Song, Yanqiong Fei, Tiansheng Lu
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

A new passive wheel type leg-wheeled hybrid mobile robot based on surface motion principle was introduced. To produce the propulsion force, a passive wheel was installed at the end of the parallel mechanism structured leg connecting with the frame-body to make the wheel vertical to the ground at any time. With the inertia framework, the robot framework and some assumptions, two forms of Maggie Equation to model the nonholonomic constraint systems were derived from the Lagrangean Equation. To determine the effect of nonholonomic constraints on dynamics of the robot, the matrix method was used to calculate the Lagrangean multipliers together with the Routh Equation. Upon an Atmega8 MCU-based logic control system, the straight-line skating experiments and the turning experiments were conducted with the prototype machine and effects of nonholonomic constraints were analyzed. Last, some conclusions were drawn.
Is workplace surveillance legal in Canada?
Authors: Avner Levin
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

This paper reports on the results of a research project into employer practices with respect to workplace privacy, funded by the Federal Privacy Commissioner of Canada's Contributions Program. The paper discusses the variety of privacy invasive technologies used by Canadian Employers in order to survey and monitor their workers. It then discusses the legal basis for such workplace surveillance as perceived by the employers, and concludes with an assessment whether, and under what circumstances, such surveillance is lawful in Canada.
Security flaw of Hölbl et al.'s protocol
Authors: Jorge Munilla, Alberto Peinado
Venue: Computer Communications (2009)

Recently, Holbl et al. [M. Holbl, T. Welzer, B. Brumen, Improvement of the Peyravian-Jeffries's user authentication protocol and password change protocol, Computer Communications 31 (2008) 1945-1951] have proposed an improvement of Peyravian-Jeffries's user authentication protocol and password change protocol [M. Peyravian, C. Jeffries, Secure remote user access over insecure networks, Computer Communications 29 (5-6) (2006) 660-667]. Peyravian-Jeffries's scheme suffers from an active off-line password-guessing attack [J. Munilla, A. Peinado, Off-line password-guessing attack to Peyravian-Jeffries's remote user authentication protocol, Computer Communications 30 (1) (2006) 52-54], and Holbl et al. state that their improved protocol overcomes this weakness. However, we show in this paper that although this proposed protocol prevents this active attack, it remains vulnerable to a passive (simpler) off-line password-guessing attack.
A note on "Resolution of fuzzy relation equations (I) based on Boolean-type implications"
Authors: Jinquan Li, Kaibiao Sun, Hongxing Li
Venue: Computers Mathematics with Applications (2009)

This paper shows, by examples, that Lemma 2.1, Lemma 3.1, Corollary 3.1, Corollary 3.2, Theorem 3.1, Corollary 3.3, Theorem 3.3 and Lemma 4.1 in [Y. Luo, Resolution of fuzzy relation equation (I) based on Boolean-type implications, Comput. Math. Appl. 52 (2006) 421-428] about resolution of fuzzy relation equations based on Boolean-type implications, are false. We also point out that the solution set of Example 5.1 is not right and we give the right solution set of Example 5.1.
Petri Net Controlled Finite Automata
Authors: Berndt Farwer, Matthias Jantzen, Manfred Kudlek, Heiko Rölke, Georg Zetzsche
Venue: Fundamenta Informaticae (2008)

We present a generalization of finite automata using Petri nets as control, called Concurrent Finite Automata for short. Several modes of acceptance, defined by final markings of the Petri net, are introduced, and their equivalence is shown. The class of languages obtained by *-free concurrent finite automata contains both the class of regular sets and the class of Petri net languages defined by final marking, and is contained in the class of context-sensitive languages.
EyeSpy: supporting navigation through play
Authors: Marek Bell, Stuart Reeves, Barry Brown, Scott Sherwood, Donny MacMillan, John Ferguson, Matthew Chalmers
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

This paper demonstrates how useful content can be generated as a by-product of an enjoyable mobile multiplayer game. In EyeSpy, players tag geographic locations with photos or text. By locating the places in which other players' tags were created and 'confirming' them, players earn points for themselves and verify the tags' locations. As a side effect of game-play, EyeSpy produces a collection of recognisable and findable geographic details, in the form of photographs and text tags, that can be repurposed to support navigation tasks. Two user trials of the game successfully produced an archive of geo-located photographs and tags, and in a follow-up experiment we compared performance in a navigation task using photographs from the game, with geo-referenced photos collected from the Flickr website. Our experiences with EyeSpy support reflection upon the design challenges presented by 'human computation' and the production of usable by-products through mobile game-play.
Discontinuous observers for non-linear time-delay systems
Authors: Ali J. Koshkouei, Keith J. Burnham
Venue: International Journal of Systems Science (2009)

This article presents the problem of non-linear observer design for a class of time-delay non-linear systems with uncertainty. The non-linearity of this class of systems has to satisfy the Lipschitz condition whilst the uncertain term is a bounded function. Various performance indices are analysed to test the stability of the error system when all the non-linear terms satisfy the Lipschitz condition. A discontinuous observer for the system in the presence of a time-dependent uncertainty, based upon the sliding mode techniques, is designed to yield a feedforward compensation input to stabilise the error estimation system. The delays are not constant but they are bounded with bounded derivatives. A sufficient condition is required to ensure the stability of a non-linear observer for systems with uncertainties.
Spatial Color Indexing: A Novel Approach for Content-Based Image Retrieval
Authors: Yi Tao, William I. Grosky
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper examines the use of a computational geometry-based spatial color indexing methodology for efficient and effective image retrieval. In this scheme, an image is evenly divided into a number of M*N non-overlapping blocks, and each individual block is abstracted as a unique feature point labeled with its spatial location, dominant hue, and dominant saturation. For each set of feature points labeled with the same hue or saturation, we construct a Delaunay triangulation and then compute the feature point histogram by discretizing and counting the angles produced by this triangulation. The concatenation of all these feature point histograms serves as the image index. An important contribution of this work is to encode the spatial color information using geometric triangulation, which is translation, rotation, and scale independent. We have implemented the proposed approach and have tested it over two image collections of 2000 JPEG images and 1380 GIF images. Various experimental results demonstrate the efficacy of our techniques.
Gaming: back to the basics
Authors: Jean-Marc Gauthier
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

What makes a viewer's experience more fun? How elements of design associated with behaviors inside a game can help reinforcing (or can be distractions) for the player's experience? This talk covers the exploration of relationships between play, design and interaction. The presentation covers the creation of basic games and observations of the viewer's experience playing interactive prototypes. The demos presented during the talk show how small changes of the game mechanics can change a game scenario. A few 2D and 3D games demos created by students and professionals will be played live with the participation of the audience.
Nonparametric Monotone Classification with MOCA
Authors: Nicola Barile, Ad Feelders
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We describe a monotone classification algorithm called MOCA that attemptsto minimize the mean absolute prediction error for classification problems with ordered class labels.We first find a monotone classifier with minimum L1 loss on the training sample, and then use a simpleinterpolation scheme to predict the class labels for attribute vectors not present in the training data.We compare MOCA to the Ordinal Stochastic Dominance Learner (OSDL), on artificial as well asreal data sets. We show that MOCA often outperforms OSDL with respect to mean absolute prediction error.
A Study of the Acceptability of a Web 2.0 Application by Higher-Education Students Undertaking Collaborative Laboratory Activities
Authors: Sandy El Helou, Denis Gillet, Christophe Salzmann, Chiu Man Yu
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

This paper presents the findings of a study on the acceptability in higher education of a Web 2.0 collaborative application, namely eLogbook. The latter offers several features for sustaining collaboration and supporting personal and group learning. It was introduced to students taking a laboratory course that spans over one semester and mainly consists of in-class group experiments. In this paper, we present eLogbook. We then describe our hypotheses as well as the qualitative and quantitative methods used to evaluate the usefulness and usability of eLogbook in a formal learning context. Finally, we discuss our findings and its implications.
Simultaneous checking of completeness and ground confluence for algebraic specifications
Authors: Adel Bouhoula
Venue: ACM Transactions on Computational Logic (TOCL) (2009)

Algebraic specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundamental notions for building algebraic specifications in a correct and modular way. Related works for checking ground confluence are based on the completion techniques or on the test that all critical pairs between axioms are valid with respect to a sufficient criterion for ground confluence. It is generally accepted that such techniques may be very inefficient, even for very small specifications. Indeed, the completion procedure often diverges and there often exist many critical pairs of the axioms. In this article, we present a procedure for simultaneously checking completeness and ground confluence for specifications with free/nonfree constructors and parameterized specifications. If the specification is not complete or not ground confluent, then our procedure will output the set of patterns on whose ground instances a function is not defined and it can easily identify the rules that break ground confluence. In contrast to previous work, our method does not rely on completion techniques and does not require the computation of critical pairs of the axioms. The method is entirely implemented and allowed us to prove the completeness and the ground confluence of many specifications in a completely automatic way, where related techniques diverge or generate very complex proofs. Our system offers two main components: (i) a completeness and ground confluence analyzer that computes pattern trees of defined functions and may generate some proof obligations; and (ii) a procedure to prove (joinable) inductive conjectures which is used to discharge these proof obligations.
Preparation and properties of thin parylene layers as the gate dielectrics for organic field effect transistors
Authors: J. Jakabovič, J. Kováč, M. Weis, D. Haško, R. Srnánek, P. Valent, R. Resel
Venue: Microelectronics Journal (2009)

We report on the fabrication and characterization of parylene C thin layers for organic electronic devices passivation and gate dielectric of organic field effect transistors (OFETs) development. The investigated thin parylene layers were deposited from the vapour phase in thickness ranging from 3 to 800nm at room temperature. The thickness and surface morphology of parylene layers were characterized by ellipsometry and AFM technique. The quality of parylene structures were analysed by X-ray reflectivity and diffraction as well as micro-Raman spectroscopy. The measurements confirmed perfect homogeneity and structural properties of parylene layers. Two types of pentacene OFETs were prepared on the silicone dioxide and parylene surface with bottom contact structures. The results demonstrated that using parylene, as the gate dielectric layer is an effective method to fabricate OFETs with improved electric characteristics.
Broadband Cable Access Networks, Volume 5: The HFC Plant (The Morgan Kaufmann Series in Networking), 3rd Ed edition
Authors: David Large, James Farmer
Venue:  (2008)

This book focuses on broadband distribution and systems architecture and concentrates on practical concepts that will allow the reader to do their own design, improvement, and troubleshooting work. The objective is to enhance the skill sets of a large population that designs and builds broadband cable plants, as well as those maintaining and troubleshooting it. A large cross-section of technical personnel who need to learn these skills design, maintain, and service HFC systems from signal creation through transmission to reception and processing at the customer end point. In addition, data/voice and video specialists need to master and reference the basics of HFC design and distribution before contending with the intricacies of their own unique services. This book serves as an essential reference to all cable engineersthose who specifically design and maintain the HFC distribution plant as well as those primarily concerned with data/voice technology as well as video technology. Included is an online component consisting of spreadsheets that were used in developing the material presented in the book.* Concentrates on practical concepts that will allow the user to do his own design, improvement, and trouble-shooting work. * Prepares cable engineers and technicians to work with assurance as they face the latest developments and future directions.* Concise and tightly focused, allowing readers to easily find answers to questions about an idea or concept they are developing in this area.
Resource Management Policy Handling Multiple Use-Cases in MPSoC Platforms Using Constraint Programming
Authors: Luca Benini, Davide Bertozzi, Michela Milano
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Multi-processor system-on-chip (MPSoC) technology is finding widespread application in the embedded system domain, like in cell phones, automotive control units or avionics. Once deployed in field, these devices always run the same set of applications, in a well-characterized context. It is therefore possible to spend a large amount of time for off-line software optimization and then deploy the results on the field. Each possible set of applications that can be active simultaneously in an MPSoC platform leads to a different use-case that the system has to be verified and tested for. Above all, smooth switching between use-cases falls within the scope of the resource manager, since users should not experience artifacts or delays when a transition between any two consecutive use-cases takes place. In this paper, we propose a semi-static approach to the resource management problem, where the allocation and scheduling solutions for the tasks in each use-case are computed off-line via a Logic Based Benders Decomposition approach using Constraint Programming and stored for use in run-time mapping decisions. The solutions are logically organized in a lattice, so that the transition costs between any two consecutive use-cases can be bound. The resulting framework exhibits both a high level of flexibility and orders of magnitude speed ups w.r.t. monolithic approaches that do not exploit decomposition.
Prolog Based Description Logic Reasoning
Authors: Gergely Lukácsy, Péter Szeredi, Balázs Kádár
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

In this paper we present the recent developments of the DLog system, an ABox reasoning engine for the the $\mathcal{SHIQ}$ description logic language. DLog differs from traditional description logic reasoners in that it transforms description logic axioms into a Prolog program. The transformation is done independently from the ABox, i.e. the set of assertions about the individuals. This makes it possible to store the ABox assertions in a database, rather than in memory. This approach results in better scalability and helps using description logic ontologies directly on top of existing information sources.The transformation involves several optimisation steps, which aim at producing more efficient Prolog programs. In this paper we focus on the partial evaluation technique we apply to obtain programs that do not use logic variables. This simplifies the implementation, improves performance and opens up the possibility of compiling into Mercury code.In the paper we also present the recent architectural changes in the DLog system, summarise the most important features of the implementation and evaluate the performance of DLog by comparing it to the best available description logic reasoners.
Efficient communication between the embedded processor and the reconfigurable logic on an FPGA
Authors: Joshua Noseworthy, Miriam Leeser
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Increasing device densities have prompted FPGA manufacturers, such as Xilinx and Altera, to incorporate larger embedded components, including multipliers, DSP blocks and even embedded processors. One of the recent architectural enhancements in the Xilinx Virtex family architecture is the introduction of the PowerPC405 hard-core embedded processor. In this paper we present a Software Defined Radio application that serves as a vehicle for investigating effective communication between the PowerPC405 processor and the surrounding FPGA fabric. A challenging aspect of developing applications that target the PowerPC is the interfacing of the processor with the surrounding reconfigurable logic. We have implemented a dozen different versions of a Software Defined Radio (SDR) application to exercise the various interfaces that enable communication between the processor and the surrounding FPGA fabric. The implementations differ only in the interfaces used. Our results indicate that the performance of the SDR application can be increased by as much as 60 percent just by choosing the interfaces that are most appropriate for the different types of data in the implementation. This demonstrates that the performance of FPGA applications that use the embedded processor are dramatically affected by the mechanisms chosen to enable communication between the processor and its surrounding resources. The best implementations use all of the different interfaces; this makes the best use of the bandwidth available to the PowerPC core.
Multicomponent reaction modelling using a stochastic algorithm
Authors: Jegathambal Palanichamy, Torsten Becker, Martin Spiller, J&#x00fc;rgen K&#x00f6;ngeter, Sankaralingam Mohan
Venue: Computing and Visualization in Science (2009)

The numerical simulation of multicomponent reactive transport has become a dynamic field of subsurface hydrology. Efficient simulation models are necessary which are capable of representing a multitude of parameters influencing geochemical reactions. The mathematical structure of reactive transport problems in porous media is determined by the decision in the chemical model part whether reactions are kinetically controlled or whether a local equilibrium assumption is made between various species involved in the geochemical reactions. The assumptions made in deterministic models are not hold true for reactions involving chemical species of low concentration. Here the emergent phenomenon evolving out of the random fluctuations of the species is difficult to be captured. The stochastic behaviour of the physicochemical processes can be modelled at mesoscopic level by application of stochastic algorithms. The proposed model was verified by comparing the results of Gillespie&#x2019;s algorithms with a deterministic solution for PCE and BTEX degradation reactions.