ppxscal/embedding_network huggingface dataset:
An integration framework for sensor networks and data stream management systems
Authors: Daniel J. Abadi, Wolfgang Lindner, Samuel Madden, Jörg Schuler
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

This demonstration shows an integrated query processing environment where users can seamlessly query both a data stream management system and a sensor network with one query expression. By integrating the two query processing systems, the optimization goals of the sensor network (primarily power) and server network (primarily latency and quality) can be unified into one quality of service metric. The demo shows various steps of the unified optimization process for a sample query where the effects of each step that the optimizer takes can be directly viewed using a quality of service monitor. Our demo includes sensors deployed in the demo area in a tiny mockup of a factory application.
First-Order Glue
Authors: Miltiadis Kokkonidis
Venue: Journal of Logic, Language and Information (2008)

Glue has evolved significantly during the past decade. Although the recent move to type-theoretic notation was a step in the right direction, basing the current Glue system on System F (second-order ¿-calculus) was an unfortunate choice. An extension to two sorts and ad hoc restrictions were necessary to avoid inappropriate composition of meanings. As a result, the current system is unnecessarily complicated. A first-order Glue system is hereby proposed as its replacement. This new system is not only simpler and more elegant, as it captures the exact requirements for Glue-style compositionality without ad hoc improvisations, but it also turns out to be more powerful than the current two-sorted (pseudo-) second-order system. First-order Glue supports all existing Glue analyses as well as more elegant alternatives. It also supports new, more demanding analyses.
Implementing Fault-Tolerant Distributed Objects
Authors: K. P. Birman
Venue: IEEE Transactions on Software Engineering (1985)

This paper describes a technique for implementing k-resilient objects-distributed objects that remain available, and whose operations are guaranteed to progress to completion, despite up to k site failures. The implementation is derived from the object specification automatically, and does not require any information beyond what would be required for a nonresilient nondistributed implementation. It is therefore unnecessary for an applications programmer to have knowledge of the complex protocols nonnally employed to implement fault-tolerant objects. Our technique is used in ISIS, a system being developed at Cornell to support resilient objects.
Macro-modeling for the compact simulation of single electron transistor using SIMPLORER
Authors: M. Troudi, Na. Sghaier, A. Boubaker, A. Souifi, A. Kalboussi
Venue: Microelectronics Journal (2007)

In this paper we present analog and digital studies of the single electron transistor (SET), in which only one electron at the time is transferred through the circuit. In the first part of this paper, we show numerical simulations of fundamental characteristics of SET using MATLAB. As a second part of this work we develop a closely example of macro-model of SET using SIMPLORER. Our idea to concept this macro-model was based on the quantification of the output signal on the island level. In order to obtain a quantified output signal on the island we have modeled a quantum dots as a quantizer bloc. This signal quantified was correlated to the energy levels. This description of a model let us to valid our conception and to value the impact of quantizer bloc on the output response of the SET.
Facilitating the Use of TPM Technologies through S&D Patterns
Authors: Sigrid Gurgens, Carsten Rudolph, Antonio Mana, Antonio Munoz
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Trusted platform modules (TPMs) can provide a variety of security functionalities. However, the TPM specification is highly complex and the deployment of TPM-based solutions is a difficult and delicate task. In this paper we propose the use of security patterns to specify TPM-based security solutions. The refined notion of security patterns developed in the SERENITY research project allows us to produce precise specifications of TPM-based solutions for particular security goals. This approach makes TPM technology available to system engineers without in-depth knowledge of trusted computing specifications.
Integrating Quality of Service Aspects in Top-Down Business Process Development Using WS-CDL and WS-BPEL
Authors: Florian Rosenberg, Christian Enzi, Anton Michlmayr, Christian Platzer, Schahram Dustdar
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Developing cross-organizational business processes is a tedious task. The partners have to agree on a com- mon data format and meaning as well as on the Quality of Service (QoS) requirements each partner has to fulfill. The QoS requirements are typically described using Ser- vice Level Agreements (SLAs) among the partners. In this paper, we propose a top-down modeling approach for Web service based business processes to capture the functional and non-functional aspects using a choreography language (WS-CDL) which describes the message interactions among the participants. The choreography is annotated with SLAs for the different partners. For each partner in the process, an orchestration (in WS-BPEL) and the necessary Web ser- vice templates are automatically generated. Additionally, the Service Level Objectives (SLOs) from the partner SLAs are automatically translated into policies which can then be enforced by a BPEL engine during execution.
OntoNotes: A Unified Relational Semantic Representation
Authors: Sameer S. Pradhan, Eduard Hovy, Mitch Marcus, Martha Palmer, Lance Ramshaw, Ralph Weischedel
Venue: Proceedings of the International Conference on Semantic Computing (2007)

The OntoNotes project is creating a corpus of large-scale, accurate, and integrated annotation of multiple levels of the shallow semantic structure in text. Such rich, integrated annotation covering many levels will allow for richer, cross-level models enabling significantly better automatic semantic analysis. At the same time, it demands a robust, efficient, scalable mechanism for storing and accessing these complex inter-dependent annotations. We describe a relational database representation that captures both the inter- and intra-layer dependencies and provide details of an object-oriented API for efficient, multi-tiered access to this data.
An Improved Video Compression Algorithm for Lane Surveillance
Authors: Shu-long Zhao, Zhi-sheng You, Shi-yong Lan, Xin Zhou
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In order to process huge volume of data efficiently in video surveillance system, it is very necessary and important to find out high efficient video retrieval techniques and advanced video compression techniques. This paper presents an improved video compression algorithm for lane supervision, which considers the implementation of video retrieval at the stage of video compression. This improved video compression algorithm combines the following three parts: shot segmentation based on detection of moving vehicle; key frame extraction based on vehicle-license-plate locating; video compression in which the I frame, B frame and P frame is decided by the former two steps. Experimental results show that the algorithm presented in this paper not only increases the compression ratio, but also improves the quality of the video reverting from compressed video and improves the efficiency and performance of the later video retrieval.
Dielectric polarization and particle shape effects
Authors: Ari Sihvola
Venue: Journal of Nanomaterials (2007)

This article reviews polarizability properties of particles and clusters. Especially the effect of surface geometry is given attention. The important parameter of normalized dipolarizability is studied as function of the permittivity and the shape of the surface of the particle. For nonsymmetric particles, the quantity under interest is the average of the three polarizability dyadic eigenvalues. The normalized polarizability, although different for different shapes, has certain universal characteristics independent of the inclusion form. The canonical shapes (sphere, spheroids, ellipsoids, regular polyhedra, circular cylinder, semisphere, double sphere) are studied as well as the correlation of surface parameters with salient polarizability properties. These geometrical and surface parameters are essential in the material modeling problems in the nanoscale.
Research on Comprehensive Evaluation of Agent Coalition Based on D-S Evidential Reasoning
Authors: Jianguo Jiang, Zhaopin Su, Na Xia, Guofu Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Agent coalition is an important cooperative manner for applications where an agent can't efficiently finish a task by itself and coalition performance counts for much to the ac- complishment of tasks. Existing researches in agent coali- tion problem lack for sound evaluation of coalition after coalition formation. The hard topic is how to evaluate a coalition from multi-point of view and to aggregate all experts' opinion. In this paper, D-S evidential theory is adopted to make an uncertain and incomplete evaluation of agent coalition according to ability, cooperation, communi- cation spending, familiarity and sustainable development. And a two-layered evaluation method of agent coalition is proposed. Finally, a typical example is displayed to analyze the process of evaluation.
Industrial application of machine-in-the-loop-learning for a medical robot vision system - Concept and comprehensive field study
Authors: Michael Eberhardt, Siegfried Roth, Andreas König
Venue: Computers and Electrical Engineering (2008)

The availability of increasingly powerful sensors and processing hardware provides the means for performing more and more complex signal processing and recognition tasks. In particular, vision systems have been the subject of intensive research and successful application during the last two decades, whereby they have often been augmented by auxiliary sensors. However, several fundamental challenges concerning the design and application of such systems remain. From the plethora of off-the-shelf-hardware, sensors and algorithms which is available a selection must be made which results in a feasible and well performing system which at the same time is capable of meeting constraints such as cost and power consumption, for instance. Currently, the design process is undergoing a paradigm shift from expert driven to automated design. Learning and optimisation techniques have proved to be more than able to compete with expert based solutions in many cases. As soon as a developed solution is deployed to more than one installation site and operated for an extended period of time under significantly varying environmental conditions, the initial solution will no longer be applicable and adjustment or fine-tuning will be required. This paper presents a conceptual solution to this challenge for the application of a medical robot vision system for the task of tube type detection. Laboratories employ this robot system for semi-automated or automated analysis of medical samples at numerous sites. The varying environmental conditions and variations in the classification task from situation to situation require reconfiguration capabilities. In our approach, these capabilities are realised in the form of a holistic training concept, designated as machine-in-the-loop-learning (MILL). The current state of concept implementation in the robot vision system with MILL support has allowed for its successful implementation in more than 250 machines at 150 sites worldwide with more than 5000 classifications per day and machine. An error rate of 0.06% was reported in a long-term study of three months duration involving two representative installations. Future work will focus on the refinement of the system architecture and incorporation of recent advances in optimisation, e.g., particle swarm optimisation (PSO) and related methods.
Evaluating exploratory learning in LAVA
Authors: K. Getchell, J. Nicoll, C. Kerbey, A. Miller, C. Allison, R. Sweetman, R. Michaelson
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

This paper reports on some initial experiences developing and evaluating a games-based approach to explorative learning. The approach adopted has particular relevance to subjects such as archaeology and geography that have scope for a significant fieldwork element, but which in practice are limited by the problems and costs associated with arranging real experience for potentially large numbers of students. A virtual simulation environment, LAVA, has been developed based on real world archaeological excavation data, with the aim of supporting exploratory learning and encouraging the development of an understanding of fieldwork techniques amongst undergraduate students within a classroom environment. LAVA seeks to make the processes involved in arranging and participating in an excavation engaging by use of a computer games approach, whereby a user, or group of users, is faced with a series of challenges with which they engage until such time as they have shown a certain level of competence within the virtual environment, at which point they can progress forward to the next level. We describe LAVA in outline, its initial deployment with a cohort of archaeology students, and the subsequent evaluation of the students' initial experiences with the system.
Note: On the variance of Shannon products of graphs
Authors: József Balogh, Clifford Smyth
Venue: Discrete Applied Mathematics (2008)

We study the combinatorial problem of finding an arrangement of distinct integers into the d-dimensional N-cube so that the maximal variance of the numbers on each @?-dimensional section is minimized. Our main tool is an inequality on the Laplacian of a Shannon product of graphs, which might be a subject of independent interest. We describe applications of the inequality to multiple description scalar quantizers (MDSQ), to get bounds on the bandwidth of products of graphs, and to balance edge-colorings of regular, d-uniform, d-partite hypergraphs.
The PLC System of Egg Powder Treatment Based on Fuzzy Control Algorithm
Authors: Yanmin Song, Zhongwei Bi, Kun Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In this paper, we take the electric control system of egg powder treatment as an example. By means of fuzzy control technology and transducer technology, the system overcomes the instability of the system, the difficulty in parameter tuning and the problem of grading speed regulation in the traditional control field. Fuzzy controller based on PLC (Programmable Logic Controller) direct lookup table and fuzzied input value are also studied. Fuzzy control rule based on consulting fuzzy control table are analyzed and the design of ladder diagram is given. The system realizes the uniformity of egg powder's water content and decreases the cost. The principle and method of fuzzy control mentioned in this paper is implemented on Siemens S7-200.
Off-Line Handwritten Character Recognition of Devnagari Script
Authors: U. Pal, N. Sharma, T. Wakabayashi, F. Kimura
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper we present a system towards the recognition of off-line handwritten characters of Devnagari, the most popular script in India. The features used for recognition purpose are mainly based on directional information obtained from the arc tangent of the gradient. To get the feature, at first, a 2× 2 mean filtering is applied 4 times on the gray level image and a non-linear size normalization is done on the image. The normalized image is then segmented to 49 x 49 blocks and a Roberts filter is applied to obtain gradient image. Next, the arc tangent of the gradient (direction of gradient) is initially quantized into 32 directions and the strength of the gradient is accumulated with each of the quantized direction. Finally, the blocks and the directions are down sampled using Gaussian filter to get 392 dimensional feature vector. A modified quadratic classifier is applied on these features for recognition. We used 36172 handwritten data for testing our system and obtained 94.24% accuracy using 5-fold cross-validation scheme.
Multi-bend bus driven floorplanning
Authors: Jill H. Y. Law, Evangeline F. Y. Young
Venue: Integration, the VLSI Journal (2008)

In this paper, the problem of bus-driven floorplanning is addressed. Given a set of blocks and bus specifications (the width of each bus and the blocks that the bus need to go through), we will generate a floorplan solution such that all the buses go through their blocks, with the area of the floorplan and the total area of the buses minimized. The approach proposed is based on a simulated annealing framework. Using the sequence pair representation, we derived and proved some necessary conditions for feasible buses, for which we allow 0-bend, one-bend, or two-bend. A checking will be performed to identify those buses that cannot be placed simultaneously. Finally, a solution will be generated giving the coordinates of the modules and the buses. Comparing with the results of the most updated work on this problem by Xiang et al. [Bus-driven floorplanning, in: Proceedings of IEEE International Conference on Computer-Aided Design, 2003, pp. 66-73], our algorithm can handle buses going through many blocks and the dead space of the floorplan obtained is also reduced. For example, if the buses have to go through more than 10 blocks, the approach in Xiang et al. [Bus-driven floorplanning, in: Proceedings of IEEE International Conference on Computer-Aided Design, 2003, pp. 66-73] is not able to generate any solution while our algorithm can still give solutions of good quality.
Theft in a wireless world
Authors: Luc Small
Venue: Ethics and Information Technology (2007)

I explore philosophically the phenomenon of home wireless networks as used to share broadband Internet connections. Because such networks are frequently unsecured, third parties can use them to access the Internet. Here I consider carefully whether this kind of behaviour should be properly called theft. I begin with a brief non-technical introduction to 802.11 wireless networks. Subsequently, I present a four part argument --- appealing to the unsecured nature of the networks discussed, entrenched software and hardware behaviours, trespass law, and the openness of ¿public park' spectrum --- suggesting that this kind of behaviour is permissible and should not be construed as theft. Substantively, I conclude that, despite the quite compelling considerations that these arguments bring to bear, this behaviour is theft. Additionally, I draw attention to significant flaws in the design and implementation of wireless technology (specifically in the out-of-the-box configuration for wireless access points and in the wireless connectivity of early versions of Windows XP) that facilitate the intentional and unintentional theft of Internet bandwidth. I suggest some simple mechanisms that could be incorporated into the technology which would serve to remove the ethical ambiguity in its usage by third parties, including adding the ability for a network owner to explicitly mark her network as not for public use,¿and changes to default hardware and software behaviours. I conclude by encouraging increased use of value-sensitive design practices in the development of future wireless technologies.
Fault-Tolerant 256K Memory Designs
Authors: R. M. Tanner
Venue: IEEE Transactions on Computers (1984)

A series of designs for a 256K memory are presented which integrate error-correcting coding into the memory organization. Starting from a simple single-error correcting product code, the successive designs explore trade-offs in coding efficiency, access delay, and complexity of communication and computation. In the most powerful design, all the 256K bits are organized so that they form a codeword in a double-error-correcting triple-error-detecting code derived from a projective plane. Because all of the bits are components of this single codeword, the coding efficiency is very high; the required parity check bits increase the storage by only 3 percent, approximately. Single error correction can take place at the time of a read with very little additional delay compared to that of a normal irredundant memory. Multiple error correction can be performed by the memory management system. A variety of failure modes, including failure of a whole column of one of the constituent 64 x 64 subarrays can be tolerated. Writing into the memory is somewhat slower than in a conventional memory, involving a read-write cycle.
Comparative study on proximity indices for cluster analysis of gene expression time series
Authors: Ivan G. Costa, Francisco A. T. de Carvalho, Marcílio C. P. de Souto
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2002)

In the computational analysis of gene expression time series, the main aspect in finding co-expressed genes is the proximity (similarity or dissimilarity) index used in the clustering method. In this context, the proximity indices should find genes that have similar patterns of expression change through time. There are a number of proximity indices used for such a task. However, the majority of these works has given emphasis on the biological results, with no critical evaluation of the suitability of the proximity index used. As a consequence, so far, there is no validity study on which proximity indices are more suitable for the analysis of gene expression time series. Based on this, a comparative study of proximity indices broadly used in the literature is accomplished in this work. More specifically, versions of three distinct proximity indices are compared: Euclidean distance, Pearson correlation and angular separation. In order to evaluate the results, an adaptation of the k-fold cross-validation procedure suitable for unsupervised methods is used. The accuracies of the proximity indices are assessed with the use of an external index, which measures the agreement between the clustering results and gene annotation data.
Rotation constrained power factorization for structure from motion of nonrigid objects
Authors: Guanghui Wang, Hung-Tat Tsui, Q.M. Jonathan Wu
Venue: Pattern Recognition Letters (2008)

The paper addresses the problem of recovering 3D structure and motion of nonrigid objects from image sequences. We propose a rotation constrained power factorization (RCPF) algorithm that combines the orthonormality and the replicated block structure of the motion matrix directly into iterations. The algorithm overcomes some limitations of previous SVD-based methods and can work with missing data. Based on the shape bases of the batch-type factorization, we also propose a sequential factorization technique to recover the shape and motion of new frames conveniently. Extensive experiments show the effectiveness of the proposed algorithm.