ppxscal/embedding_network huggingface dataset:
Robust approximate aggregation in sensor data management systems
Authors: Jeffrey Considine, Marios Hadjieleftheriou, Feifei Li, John Byers, George Kollios
Venue: ACM Transactions on Database Systems (TODS) (2009)

In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collect. An approach to this data management problem is the use of sensor database systems, which allow users to perform aggregation queries such as MIN, COUNT, and AVG on the readings of a sensor network. In addition, more advanced queries such as frequency counting and quantile estimation can be supported. Due to energy limitations in sensor-based networks, centralized data collection is generally impractical, so most systems use in-network aggregation to reduce network traffic. However, even these aggregation strategies remain bandwidth-intensive when combined with the fault-tolerant, multipath routing methods often used in these environments. To avoid this expense, we investigate the use of approximate in-network aggregation using small sketches. We present duplicate-insensitive sketching techniques that can be implemented efficiently on small sensor devices with limited hardware support and we analyze both their performance and accuracy. Finally, we present an experimental evaluation that validates the effectiveness of our methods.
Enterprise Organization Oriented Workflow Task Assignment Language
Authors: Tao Wang, Qingping Tan, Yonglin Guo
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

Task assignment is one of the key technologies of workflow management. We analyzed the current existed workflow task assignment methods and found that they are not agile enough to cope with the complex task assignment requirements in the large complicated enterprise organizations. We provided an enterprise organization model oriented workflow task assignment language. It has the features of strong descriptive ability and ease of use. We also provide an example to show how the language to meet the complex task assignment requirements.
Optimal Burn-in for Minimizing Total Warranty Cost
Authors: Ji Hwan Cha, Hisashi Yamamoto, Won Young Yun
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Burn-in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, optimal burn-in procedures for a system with two types of failures (i.e., minor and catastrophic failures) are investigated. A new system surviving burn-in time b is put into field operation and the system is used under a warranty policy under which the manufacturer agrees to provide a replacement system for any system that fails to achieve a lifetime of at least w. Upper bounds for optimal burn-in time minimizing the total expected warranty cost are obtained under a more general assumption on the shape of the failure rate function which includes the bathtub shaped failure rate function as a special case.
Search Engine Ad Auctions
Authors: Hal R. Varian
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

Auctions for search engine advertising have been one of the most successful examples of economic mechanism design, at least in the private sector. This talk will review some of the history, theory, and practical issues surrounding these auctions.
An inquiry-based learning approach to teaching information retrieval
Authors: Gareth J. Jones
Venue: Information Retrieval (2009)

The study of information retrieval (IR) has increased in interest and importance with the explosive growth of online information in recent years. Learning about IR within formal courses of study enables users of search engines to use them more knowledgeably and effectively, while providing the starting point for the explorations of new researchers into novel search technologies. Although IR can be taught in a traditional manner of formal classroom instruction with students being led through the details of the subject and expected to reproduce this in assessment, the nature of IR as a topic makes it an ideal subject for inquiry-based learning approaches to teaching. In an inquiry-based learning approach students are introduced to the principles of a subject and then encouraged to develop their understanding by solving structured or open problems. Working through solutions in subsequent class discussions enables students to appreciate the availability of alternative solutions as proposed by their classmates. Following this approach students not only learn the details of IR techniques, but significantly, naturally learn to apply them in solution of problems. In doing this they not only gain an appreciation of alternative solutions to a problem, but also how to assess their relative strengths and weaknesses. Developing confidence and skills in problem solving enables student assessment to be structured around solution of problems. Thus students can be assessed on the basis of their understanding and ability to apply techniques, rather simply their skill at reciting facts. This has the additional benefit of encouraging general problem solving skills which can be of benefit in other subjects. This approach to teaching IR was successfully implemented in an undergraduate module where students were assessed in a written examination exploring their knowledge and understanding of the principles of IR and their ability to apply them to solving problems, and a written assignment based on developing an individual research proposal.
Ontology Design for Scientific Theories That Make Probabilistic Predictions
Authors: David Poole, Clinton Smyth, Rita Sharma
Venue: IEEE Intelligent Systems (2009)

Scientific theories that make predictions about observable quantities can be evaluated by their fit to existing data and can be used for predictions on new cases. The authors' goal is to publish such theories along with observational data and the ontologies needed to enable the interoperation of the theories and the data. This article is about designing ontologies that take into account the defining properties of classes. The authors show how a multidimensional design paradigm based on Aristotelian definitions is natural, can easily be represented in OWL, and can provide random variables that provide structure for theories that make probabilistic predictions. They also show how such ontologies can be the basis for representing observational data and probabilistic theories in their primary application domain of geology.
Transmission property of flip chip package with adhesive interconnection for RF applications
Authors: Jong-Woong Kim, Wansoo Nah, Seung-Boo Jung
Venue: Microelectronic Engineering (2009)

The radio frequency (RF) and high frequency performance of the flip chip interconnects with anisotropic conductive film (ACF) and non-conductive film (NCF) was investigated and compared by measuring the scattering parameters (S-parameters) of the flip chip modules. Low cost electroless-Ni immersion-Au (ENIG) plating was employed to form the bumps for the adhesive bonding. To compare the accurate intrinsic RF performance of the ACF and NCF interconnect without lossy effect of chip and substrate, a de-embedding modeling algorithm was employed. The effects of two chip materials (Si and GaAs), the height of ENIG bumps, and the metal pattern gap between the signal line and ground plane in the coplanar waveguide (CPW) on the RF performance of the flip chip module were also investigated. The transmission properties of the GaAs were markedly improved on those of the Si chip, which was not suitable for the measurement of the S-parameters of the flip chip interconnect. Extracted impedance parameters showed that the RF performance of the flip chip interconnect with NCF was slightly better than that of the interconnect with ACF, mainly due to the capacitive component between the bump and substrate and self inductance of the conductive particle surface in the ACF interconnect.
Cryptographic Spread Spectrum Relay Communication
Authors: Zahoor Ahmed, J. P. Cances, V. Meghdadi
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

Spread spectrum (SS) is a technique of secure communication, which increases resistance to natural interference and jamming, and prevents detection. If a cryptographically secure pseudo random sequence is used, the communication becomes more secure. Generally some short pseudo-random sequences are used in Spread spectrum. In this paper we present comparatively a different technique of signal hiding where we use a non secret communication and a secret Spread spectrum communication. We present a class of relay channel with orthogonal components for transmission of our proposed SS communication.
1.5-Approximation algorithm for weighted maximum routing and wavelength assignment on rings
Authors: Zhengbing Bian, Qian-Ping Gu
Venue: Information Processing Letters (2009)

We give a 1.5-approximation algorithm for the weighted maximum routing and wavelength assignment problem on undirected ring networks. This improves the previous 1.58-approximation result.
Approximate solutions of moral dilemmas in multiple agent system
Authors: Matteo Cristani, Elisa Burato
Venue: Knowledge and Information Systems (2009)

Moral dilemmas are one of the major issues of current research in ethical reasoning. In particular, it is well known that admitting moral dilemmas in Standard Deontic Logic generates a family of inconsistencies that are intrinsically unsolvable. Since managing dilemmas means performing preferential reasoning, we argue that one simple approach to both types of problems is by ordering actions. We notice that in general, more than local orderings between two actions, agents have intrinsic preferences based on classification issues, like the action type, and that, once we have discharged the dilemma as it is intrinsically, preferential reasoning is performed by using a second-level choice approach. Decision theory has dealt with the problem of making decisions in presence of conflicting decision criteria, and some researcher has pointed out that this is the case of moral dilemmas as well. In practice, the choice of preferences in presence of conflicting criteria can be seen as a form of preferential-ethical reasoning. Although this is certainly an important topic in multiple agent investigations, it is definitely neglected in the current investigations. It is well known that humans are quite clever in solving moral dilemmas, and the usage they make of preferential reasoning is very complex. In this paper we address the problems of preferential-ethical reasoning in a combinatorial fashion and provide an algorithm for making decisions on moral dilemmas in presence of conflicting decision criteria. We then evaluate the complexity of the algorithm and prove that this approach can be applied in practice.
Bio-inspired fault-tolerance
Authors: Elena Dubrova
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

In the last decade, there has been a considerable increase of interest in fault-tolerant computing due to dependability problems related to process scaling, embedded software, and ubiquitous computing. In this paper, we consider an approach to fault-tolerance which is inspired by gene regulatory networks of living cells. Living cells are capable of maintaining their functionality under a variety of genetic changes and external perturbations. They have natural self-healing, self-maintaining, self-replicating and self-assembling mechanisms. The fault-tolerance of living cells is due to the intrinsic robustness of attractors' landscapes of their gene regulatory networks. Previously, we introduced a technique which exploits the stability of attractors to achieve a fault-tolerant computation. In this paper, we evaluate this technique on the example of a gene regulatory network model of Arabidopsis thaliana and show that it can tolerate 70% single-point mutations in the outputs of the defining tables of gene functions.
A cube framework for incorporating inter-gene information into biological data mining
Authors: Kuan-ming Lin, Jaewoo Kang, Hanjun Shin, Jusang Lee
Venue: International Journal of Data Mining and Bioinformatics (2009)

Large volumes of microarray data are registered daily in public repositories such as SMD (Belkin and Niyogi, 2003) and GEO (Ashburner et al., 2000). Such repositories have quickly become a community resource. However, due to the inherent heterogeneity of the microarray experiments, the data generated from different experiments could not be directly integrated and hence the resources have not been fully utilised. To address this problem, we propose a new microarray integration framework that achieves high-quality integration through exploiting invariant features such as relative information among genes. We also show how the proposed approach generalises the previous frameworks.
Formal consistency verification between BPEL process and privacy policy
Authors: Yin Hua Li, Hye-Young Paik, Boualem Benatallah
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

Despite the increased privacy concerns in the Internet, not much attention has been paid into enforcing privacy policies of organisations who collect and consume personal data using automatic means (e.g., Web services). In this paper, we propose a graph-transformation based framework to check whether an internal business process (implemented using a standard Web service composition language such as BPEL) adheres to the organisation's privacy policies. The graph-based specification formalism combines the advantages of an intuitive visual framework with rigorous semantical foundation that allows consistency checking between a business process and privacy policy. The privacy consistency verification framework is defined by a set of rules to build the system state and sets of constraints (positive and negative) to specify the wanted and unwanted substates.
JavaScript and Ajax for the Web: Visual QuickStart Guide (7th Edition), 7th edition
Authors: Tom Negrino, Dori Smith
Venue:  (2008)

This task-based, visual reference guide has been fully revised. It uses step-by-step instructions and plenty of screenshots to give beginning and intermediate Web designers what they need to know to learn JavaScript. Readers can start from the beginning to get a tour of the programming language, or look up specific tasks to learn just what they need to know. In this updated seventh edition, readers will find new information on Ajax design and modern coding techniques.
Prototyping pipelined applications on a heterogeneous FPGA multiprocessor virtual platform
Authors: Antonino Tumeo, Marco Branca, Lorenzo Camerini, Marco Ceriani, Matteo Monchiero, Gianluca Palermo, Fabrizio Ferrandi, Donatella Sciuto
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

Multiprocessors on a chip are the reality of these days. Semiconductor industry has recognized this approach as the most efficient in order to exploit chip resources, but the success of this paradigm heavily relies on the efficiency and widespread diffusion of parallel software. Among the many techniques to express the parallelism of applications, this paper focuses on pipelining, a technique well suited to data-intensive multimedia applications. We introduce a prototyping platform (FPGA-based) and a methodology for these applications. Our platform consists of a mix of standard and custom heterogeneous cores. We discuss several case studies, analyzing the interaction of the architecture and applications and we show that multimedia and telecommunication applications with unbalanced pipeline stages can be easily deployed. Our framework eases the development cycle and enables the developers to focus directly on the problems posed by the programming model in the direction of the implementation of a production system.
Augmenting a regular expression-based temporal logic with local variables
Authors: Cindy Eisner, Dana Fisman
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not control the behavior of the atomic propositions, it merely observes their behavior. Local variables are a twist on this approach, in which the user can declare variables local to the formula and control their behavior from within the formula itself. Local variables were introduced in 2002, and a formal semantics was given to them in the context of SVA, the assertion language of System Verilog, in 2004. That semantics suffers from several drawbacks. In particular, it breaks distributivity of the operators corresponding to intersection and union. In this paper we present a formal semantics for local variables that solves that problem and others, and compare it to the previous solution.
Hierarchical cross-layer fuzzy control for compromise of multiple objectives in wireless mobile networks
Authors: Chao-Lieh Chen, Syue-You Chen, Jeng-Wei Lee, Yau-Hwang Kuo
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Adapting to wireless environment is an important and challenging issue. Optimization methods could fail since a priori finding objectives and constraints requires exact identification of wireless network's behavior which is almost impossible. Rather than using optimization theory, we propose a generic hierarchical cross-layer fuzzy control (HCLFC) model where hierarchical fuzzy control algorithms are mapped into hierarchy of protocol layers. In addition to aggregation of rule implications in an individual controller at a specific layer, aggregation controllers compromise inference results from different layers. We adopt HCLFC for collaboration of physical (PHY) and application (APP) layers where physical layer modulation and application layer packet length adaptation are compromised to meet traffic requirements. Being perfectly compatible to the open systems interconnection (OSI) architecture, the HCLFC is a generic solution to emergent wireless networks. Simulation results demonstrate that HCLFC optimally compromises objectives of different layers in highly uncertain and dynamic network conditions.
Power efficient tree-based crosslinks for skew reduction
Authors: Inna Vaisband, Ran Ginosar, Avinoam Kolodny, Eby G. Friedman
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Clock distribution networks are an important design issue that is highly dependent on delay variations and load imbalances, while requiring power efficiency. Existing mesh solutions significantly increase the dissipated power, whereas existing link based methods only address skew caused by variations and do not consider power consumption. The power dissipated by the inserted crosslinks within a buffered clock tree is investigated in this paper, and is shown to be a strong function of the resistance and capacitance of the crosslink. A crosslink may be power efficient despite the presence of short-circuit currents caused by multiple drivers in a non-tree clock network. The power characteristics of crosslink size and placement are also discussed, showing that the crosslink is best placed as close as possible to the target leaves of the tree. Crosslink insertion as both an alternative and complement to buffer sizing for low power skew reduction is also considered.
Task Decomposition for Optimization Problem Solving
Authors: Ehab Z. Elfeky, Ruhul A. Sarker, Daryl L. Essam
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

This paper examines a new way of dividing computational tasks into smaller interacting components, in order to effectively solve constrained optimization problems. In dividing the tasks, we propose problem decomposition, and the use of GAs as the solution approach. In this paper, we consider problems with block angular structures with or without overlapping variables. We decompose not only the problem but also appropriately the chromosome for different components of the problem. We also design a communication process for exchanging information between the components. The approach can be implemented for solving large scale optimization problems using parallel machines. A number of test problems have been solved to demonstrate the use of the proposed approach. The results are very encouraging.
The combinatorics of associated Hermite polynomials
Authors: Dan Drake
Venue: European Journal of Combinatorics (2009)

We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected complete matchings, oscillating tableaux, and rooted maps and show weight-preserving bijections between these objects. Several identities, linearization formulas, the moment generating function, and a second combinatorial model are also derived.
Real-time motion control by data gloves
Authors: Katsuya Ishiguro, Masaki Oshita
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Nowadays, there is a demand that users want to move a character freely for computer games and communications using avatar in a virtual world such as Second Life. However, the flexibility of the current motion control interfaces are very limited, because the character is simply controlled by playing the motion data that are created in advance in response to on the user's input. In this research, we proposed a motion control method that uses data gloves as an input device to make virtual character perform various motions.
Cooperative Asynchronous Multichannel MAC: Design, Analysis, and Implementation
Authors: Tie Luo, Mehul Motani, Vikram Srinivasan
Venue: IEEE Transactions on Mobile Computing (2009)

MAC protocols have been studied under different contexts for decades. In decentralized MAC protocols, transmitter-receiver pairs make independent decisions, which are often sub-optimal due to insufficient knowledge about the communication environment. In this paper, we introduce control-plane cooperation at the MAC layer, where neighboring nodes share control information with transmitter-receiver pairs to aid them in making more informed decisions. This augments conventional cooperation, which sits at the data plane where intermediate nodes help relay data for other nodes. In a multi-channel environment, control-plane cooperation enables neighboring nodes to notify transmitter-receiver pairs of channel conflicts and deaf terminals to prevent collisions and retransmissions. Accordingly, we design a cooperative asynchronous multi-channel MAC protocol called CAM-MAC, which uses a single transceiver and is fully asynchronous. We evaluate CAM-MAC from both theoretical and practical perspectives, and show that it closely approaches system capacity and does not realistically suffer from control channel bottleneck. We compare CAM-MAC with its non-cooperative version, UNCOOP, and three recent multi-channel MAC protocols, MMAC, SSCH and AMCP. The results show that CAM-MAC significantly outperforms all of them. We also implement CAM-MAC and UNCOOP on commercial off-the-shelf hardware. The experimental results confirm the viability of CAM-MAC and the cooperation idea.