ppxscal/embedding_network huggingface dataset:
Efficient Scheduling of Data-Harvesting Trees
Authors: Bastian Katz, Steffen Mecke, Dorothea Wagner
Venue: Algorithmic Aspects of Wireless Sensor Networks: Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers (2008)

Many applications in sensor networks demand for energy and time optimal routing of data towards a sink. In this work we present mechanisms to set up energy and time efficient TDMA schedules for a given routing tree under very strict limitations: Nodes have only a constant size memory and must agree on a schedule using only a minimum of communication for set up: Each node is only allowed to send a single message to each of its neighbors.We propose and analyze solutions in two different interference models. We show that, despite these tight restrictions, it is possible to compute energy optimal schedules which are almost time optimal and time optimal schedules which are almost energy optimal in the total interference model and we describe a 4-approximative algorithm in the k-local interference model.We also show how to extend these mechanisms to settings with packet loss, while still guaranteeing bounds on energy consumption.
Padded frames: a novel algorithm for stable scheduling in load-balanced switches
Authors: Juan José Jaramillo, Fabio Milan, R. Srikant
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

The load-balanced Birkhoff-von Neumann switching architecture consists of two stages: a load balancer and a deterministic input-queued crossbar switch. The advantages of this architecture are its simplicity and scalability, while its main drawback is the possible out-of-sequence reception of packets belonging to the same flow. Several solutions have been proposed to overcome this problem; among the most promising are the Uniform Frame Spreading (UFS) and the Full Ordered Frames First (FOFF) algorithms. In this paper, we present a new algorithm called Padded Frames (PF), which eliminates the packet reordering problem, achieves 100% throughput, and improves the delay performance of previously known algorithms.
EuroITV2009 conference focuses on networked television
Authors: David Geerts
Venue: Issue Spring (March 2009) (2009)

EuroITV2009 is a forum for professionals not only from Europe, but from all over the world who are interested in, work with and do research on all aspects of interactive television. The conference will be held in the lively university town of Leuven, Belgium on 3, 4 and 5 June 2009. This annual conference features state-of-the-art academic as well as practitioner's work on different aspects of interactive television, e.g. IPTV, mobile TV, digital content production, entertainment computing, usability and user experience evaluation, changes in technical requirements and infrastructure and future technologies. EuroITV2009 is the seventh edition of the EuroITV conference series, which started in 2003 and has since been growing steadily. The conference has been held twice in Brighton (UK), and subsequently in Aalborg (Denmark), Athens (Greece), Amsterdam (The Netherlands) and Salzburg (Austria). More than 200 practitioners and academics attended EuroITV2008 in Salzburg. In 2009, we expect up to 300 participants to attend the conference in Leuven, Belgium. More information about the conference can be found at http://www.euroitv2009.org/.
A simple technique for controlled on-line system stimulation
Authors: Thomas E. Bell, Jo Ann Lockett
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

Most performance analysis tools are developed with the objective of providing data in a general way, using flexible techniques, with confidence that analysts will subsequently employ them in cost/effective procedures. The inadequacy of this approach is reflected by the frequency of questions about which data to collect and how to use them. The problem is the initial emphasis on tools as an end in themselves rather than on analysis techniques.
Algorithm-based fault tolerance applied to high performance computing
Authors: George Bosilca, Rémi Delmas, Jack Dongarra, Julien Langou
Venue: Journal of Parallel and Distributed Computing (2009)

We present a new approach to fault tolerance for High Performance Computing system. Our approach is based on a careful adaptation of the Algorithm-Based Fault Tolerance technique [K. Huang, J. Abraham, Algorithm-based fault tolerance for matrix operations, IEEE Transactions on Computers (Spec. Issue Reliable & Fault-Tolerant Comp.) 33 (1984) 518-528] to the need of parallel distributed computation. We obtain a strongly scalable mechanism for fault tolerance. We can also detect and correct errors (bit-flip) on the fly of a computation. To assess the viability of our approach, we have developed a fault-tolerant matrix-matrix multiplication subroutine and we propose some models to predict its running time. Our parallel fault-tolerant matrix-matrix multiplication scores 1.4 TFLOPS on 484 processors (cluster jacquard.nersc.gov) and returns a correct result while one process failure has happened. This represents 65% of the machine peak efficiency and less than 12% overhead with respect to the fastest failure-free implementation. We predict (and have observed) that, as we increase the processor count, the overhead of the fault tolerance drops significantly.
Modeling of supply chain with variation of inventory systems at nodes
Authors: González S. Fernando, Dávila R. Diana, Sumoza S. Marlloly, Ramírez P. Luis
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In this paper is analyze the advantages of using different inventory systems in supply chains involving echelons with different intentions in each one. This model is based on a network composed by eight nodes distributed between plants, distribution centers, warehouses and markets. The principal objective is analyze the influence of inventory systems as reorder point, periodic review and s-S inventory in the total cost of system and individual cost every node, through a simulation model development in Arena&reg; 10.0 with interface in visual BASIC and experiment design with two response variables, the averages of lost sales costs on markets and the average inventory costs on the distribution centers. The different systems of inventory influence in the total and individual cost.
MS SQL Server Interview Questions, Answers, and Explanations: MS SQL Server Certification Review
Authors: Terry Sanchez-Clark
Venue:  (2007)

The Ultimate Reference & Learning Guide for the SQL Professional! In depth and current overview of common challenges with SQL! Fluency with Structural Query Language (SQL) is essential for the database professional, however, a user-friendly and thorough resource can be difficult to locate. From helping you to assess your current skill level to preparing for an interview, this guide will tell any programmer with any level of SQL fluency the details of what you really need to know. Set yourself apart from other candidates and show that you have what it takes to land the job. More than just a rehash of the basics, more than just documentation and sales presentations, each section is based on project knowledge and experience gained on successful high-profile implementations so you can set yourself apart! Key topics include: . SQL Language Reference, SQL FAQ . Challenges in data projection . Transaction control . Trouble-shooting for runaway results and Cartesian joins
FPGA technology mapping with encoded libraries andstaged priority cuts
Authors: Andrew Kennings, Kristofer Vorwerk, Arun Kundu, Val Pevzner, Andy Fox
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Technology mapping is an important step in the FPGA CAD flow in which a network of simple gates is converted into a network of logic blocks. We consider enhancements to a traditional LUT-based mapping algorithm for an FPGA comprised of logic blocks which implement only a subset of functions of up to k variables--specifically, the logic block is a partial LUT, but it possesses more inputs than typical LUTs. Numerical results are presented to demonstrate the efficacy of our proposed techniques using real circuits mapped to a commercial FPGA architecture.
An efficient online secondary path estimation for feedback active noise control systems
Authors: Hamid Hassanpour, Pooya Davari
Venue: Digital Signal Processing (2009)

In practical cases for active noise control (ANC), the secondary path has usually a time varying behavior. For these cases, an online secondary path modeling method that uses a white noise as a training signal is required to ensure convergence of the system. The modeling accuracy and the convergence rate are increased when a white noise with a larger variance is used. However, the larger variance increases the residual noise, which decreases performance of the system and additionally causes instability problem to feedback structures. A sudden change in the secondary path leads to divergence of the online secondary path modeling filter. To overcome these problems, this paper proposes a new approach for online secondary path modeling in feedback ANC systems. The proposed algorithm uses the advantages of white noise with larger variance to model the secondary path, but the injection is stopped at the optimum point to increase performance of the algorithm and to prevent the instability effect of the white noise. In this approach, instead of continuous injection of the white noise, a sudden change in secondary path during the operation makes the algorithm to reactivate injection of the white noise to correct the secondary path estimation. In addition, the proposed method models the secondary path without the need of using off-line estimation of the secondary path. Considering the above features increases the convergence rate and modeling accuracy, which results in a high system performance. Computer simulation results shown in this paper indicate effectiveness of the proposed method.
Practice, systems and technology for seniors
Authors: David Prendergast, Simon Roberts
Venue: Universal Access in the Information Society (2009)

This paper explores how research teams in Intel&#x2019;s Digital Health Group are using ethnography to identify &#x2018;designable moments&#x2019;&#x2014;spaces, times, objects, issues and practices which suggest opportunities for appropriate interventions. It argues that technology innovation should aim to incorporate the views, experiences and practices of users from the start of the design process to support independent living and develop culturally sensitive enhancements that contribute towards wellbeing and a life of quality for local older populations.
Image Segmentation Using Fuzzy Clustering with Spatial Constraints Based on Markov Random Field via Bayesian Theory
Authors: Xiaohe Li, Taiyi Zhang, Zhan Qu
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Image segmentation is an essential processing step for many image analysis applications. In this paper, a novel image segmentation algorithm using fuzzy C-means clustering (FCM) with spatial constraints based on Markov random field (MRF) via Bayesian theory is proposed. Due to disregard of spatial constraint information, the FCM algorithm fails to segment images corrupted by noise. In order to improve the robustness of FCM to noise, a powerful model for the membership functions that incorporates local correlation is given by MRF defined through a Gibbs function. Then spatial information is incorporated into the FCM by Bayesian theory. Therefore, the proposed algorithm has both the advantages of the FCM and MRF, and is robust to noise. Experimental results on the synthetic and real-world images are given to demonstrate the robustness and validity of the proposed algorithm.
Input-Output Exact Feedback Linearization for Depth Positioning of Spherical URV
Authors: Bambang Sumantri, M. N. Karsiti, Salman Ahmed
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In this paper, depth positioning of a spherical URV which utilizes variable ballast as actuator is presented. Since the model of this system is nonlinear therefore feedback linearization is utilized in this depth positioning. The idea of feedback linearization is to algebraically transform nonlinear systems dynamics into (fully or partly) linear ones, so that linear control techniques can be applied. This method can stabilize the equilibrium point of this system which is unstable in open loop system. From the control analysis and simulation results, it can be observed that the asymptotical stabilization is achieved by tracking the error. Hence, feedback linearization can also be applied for tracking a trajectory of desired depth position.
AVS Encoder Performance and Complexity Analysis Based on Mobile Video Communication
Authors: Bo Tang, Yiqiang Chen, Wen Ji
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

The real-time mobile video communication requires the balance between performance and complexity. In this paper, we study and analyze the complexity of a software-based AVS encoder, and then we make the performance and complexity co-evaluation. It includes computational complexity and storage requirement analysis of AVS encoder and the Pareto optimization problem of configurable tools of AVS encoder for mobile video communication. The experimental results provide feedback on the realization bottlenecks and indicate that when we select the right configurable tools, AVS encoder will be suitable for application of mobile video communications.
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
Authors: Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
Venue: Theory of Computing Systems (2009)

We consider cryptographic and physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party, the verifier, that the prover has solved a Sudoku puzzle, without revealing the solution to the verifier. The question of interest is how a prover can show: (i)&#x00a0;that there is a solution to the given puzzle, and (ii)&#x00a0;that he knows the solution, while not giving away any information about the solution to the verifier. In this paper we consider several protocols that achieve these goals. Broadly speaking, the protocols are either cryptographic or physical. By a cryptographic protocol we mean one in the usual model found in the foundations of cryptography literature. In this model, two machines exchange messages, and the security of the protocol relies on computational hardness. By a physical protocol we mean one that is implementable by humans using common objects, and preferably without the aid of computers. In particular, our physical protocols utilize items such as scratch-off cards, similar to those used in lotteries, or even just simple playing cards. The cryptographic protocols are direct and efficient, and do not involve a reduction to other problems. The physical protocols are meant to be understood by &#x201c;lay-people&#x201d; and implementable without the use of computers.
Marching Cubes without Skinny Triangles
Authors: Carlos A. Dietrich, Carlos E. Scheidegger, João L. D. Comba, Luciana P. Nedel, Cláudio T. Silva
Venue: Computing in Science and Engineering (2009)

Most computational codes that use irregular grids depend on the single worst triangle's quality: skinny triangles can lead to bad performance and numerical instabilities. Marching cubes (MC) is the standard isosurface grid generation algorithm, and, whereas most triangles it generates are good, it almost always generates some bad triangles. Here, we show how simple changes to MC can lead to a drastically reduced number of degenerate triangles, making it a more practical choice for isosurface grid generation, reducing or eliminating the need for and cost of postprocessing.
On the Variance of the Least Attained Service Policy and Its Use in Multiple Bottleneck Networks
Authors: Matthias Auchmann, Guillaume Urvoy-Keller
Venue: Network Control and Optimization: Second Euro-NF Workshop, NET-COOP 2008 Paris, France, September 8-10, 2008. Revised Selected Papers (2009)

Size-based scheduling has proved to be effective in a lot of scenarios involving Internet traffic. In this work, we focus on the Least Attained Service Policy, a popular size-based scheduling policy. We tackle two issues that have not received much attention so far. Firstly, the variance of the conditional response time. We prove that the classification proposed by Wierman et al. [11], which classifies LAS as an always unpredictable policy, is overly pessimistic. We illustrate the latter by focusing on the M/M/1/LAS queue. Secondly, we consider LAS queues in tandem. We provide preliminary results concerning the characterization of the output process of an M/M/1/LAS queue and the conditional average response time of LAS queues in tandem.
Multi-label Classification Using Ensembles of Pruned Sets
Authors: Jesse Read, Bernhard Pfahringer, Geoff Holmes
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

This paper presents a Pruned Sets method (PS) for multi-label classification. It is centred on the concept of treating sets of labels as single labels. This allows the classification process to inherently take into account correlations between labels. By pruning these sets, PS focuses only on the most important correlations, which reduces complexity and improves accuracy. By combining pruned sets in an ensemble scheme (EPS), new label sets can be formed to adapt to irregular or complex data. The results from experimental evaluation on a variety of multi-label datasets show that [E]PS can achieve better performance and train much faster than other multi-label methods.
End-to-end epidemic multicast loss recovery: Analysis of scalability and robustness
Authors: Öznur Özkasap
Venue: Computer Communications (2009)

For ensuring reliability at the transport level end-to-end multicasting, an efficient loss recovery mechanism is indispensable. We consider scalability, topology independence and robustness as the significant features that such a mechanism should offer, and demonstrate that an epidemic loss recovery approach is superior in all these aspects. We also show that the epidemic approach transparently handles network link failures by using pair-wise propagation of information, and compare it with feedback controlled loss recovery on identical network settings. The contribution of this work is the simulative analysis of recovery overhead distribution on multicast group members in the case of various link failures on the network, the impact of group size, randomized system-wide noise and message rate on scalability, and examination of various scenarios modeling the overlay networks. We investigate the important features of epidemic multicast loss recovery extensively together and reach concrete results on realistic network scenarios.
Automatic Control System of Water Conservancy Project Model Based on Multi Agent
Authors: Junhu Yang, Lizhi Yang, Tinghong Zhao, Zhiqiang Jia
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In order to improve the precision of model test of the water conservancy project, accelerate the speed of experiment, through bringing in the theory of Multi-Agent, this paper has proposed a kind of new-type Automatic Control System of Water Project Model based on Multi-Agent. This automatic System is made up of Monitoring Agent Federation, namely System control Agent, Flow control Agent, Water Level control Agent and Velocity of flow control Agent. System controls Agent is responsible for automatic control of the whole water project model test, other three control Agent mainly finish the task of testing and regulating the flow, water level and velocity of flow, and sending the final result to System control Agent, making the normal running of model test of the water project. This system has many communication advantages such as being swift, with convenient coordination, is of greater practical value to reach real automation of water project model test.
The Identifiability of Covarion Models in Phylogenetics
Authors: Elizabeth S. Allman, John A. Rhodes
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2009)

Covarion models of character evolution describe inhomogeneities in substitution processes through time. In phylogenetics, such models are used to describe changing functional constraints or selection regimes during the evolution of biological sequences. In this work the identifiability of such models for generic parameters on a known phylogenetic tree is established, provided the number of covarion classes does not exceed the size of the observable state space. `Generic parameters' as used here means all parameters except possibly those in a set of measure zero within the parameter space. Combined with earlier results, this implies both the tree and generic numerical parameters are identifiable if the number of classes is strictly smaller than the number of observable states.
An index selection method without repeated optimizer estimations
Authors: Kuo-Fong Kao, I-En Liao
Venue: Information Sciences: an International Journal (2009)

The index selection problem (ISP) concerns the selection of an appropriate index set to minimize the total cost for a given workload containing read and update queries. Since the ISP has been proven to be an NP-hard problem, most studies focus on heuristic algorithms to obtain approximate solutions. However, even approximate algorithms still consume a large amount of computing time and disk space because these systems must record all query statements and frequently request from the database optimizers the cost estimation of each query in each considered index. This study proposes a novel algorithm without repeated optimizer estimations. When a query is delivered to a database system, the optimizer evaluates the costs of various query plans and chooses an access path for the query. The information from the evaluation stage is aggregated and recorded with limited space. The proposed algorithm can recommend indexes according to the readily available information without querying the optimizer again. The proposed algorithm was tested in a PostgreSQL database system using TPC-H data. Experimental results show the effectiveness of the proposed approach.
The GHZ State in Secret Sharing and Entanglement Simulation
Authors: Anne Broadbent, Paul-Robert Chouha, Alain Tapp
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

In this note, we study some properties of the GHZ state. First, we present a quantum secret sharing scheme in which the participants require only classical channels in order to reconstruct the secret; our protocol is significantly more efficient than the trivial usage of teleportation. Second, we show that the classical simulation of an n-party GHZ state requires at least n log2 n − 2n bits of communication. Finally, we present a problem simpler than the complete simulation of the multi-party GHZ state, that could lead to a no-go theorem for GHZ state simulation.