ppxscal/embedding_network huggingface dataset:
Counter braids: a novel counter architecture for per-flow measurement
Authors: Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang Dharmapurikar, Abdul Kabbani
Venue: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2008)

Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amount of SRAM to store both the counters and a flow-to-counter association rule, so that arriving packets can update corresponding counters at link speed. This has made accurate per-flow measurement complex and expensive, and motivated approximate methods that detect and measure only the large flows. This paper revisits the problem of accurate per-flow measurement. We present a counter architecture, called Counter Braids, inspired by sparse random graph codes. In a nutshell, Counter Braids "compresses while counting". It solves the central problems (counter space and flow-to-counter association) of per-flow measurement by "braiding" a hierarchy of counters with random graphs. Braiding results in drastic space reduction by sharing counters among flows; and using random graphs generated on-the-fly with hash functions avoids the storage of flow-to-counter association. The Counter Braids architecture is optimal (albeit with a complex decoder) as it achieves the maximum compression rate asymptotically. For implementation, we present a low-complexity message passing decoding algorithm, which can recover flow sizes with essentially zero error. Evaluation on Internet traces demonstrates that almost all flow sizes are recovered exactly with only a few bits of counter space per flow.
Embedded System with Speech Recognition for Wireless Actuator Control
Authors: O. Sajdl, R. Vrba
Venue: Proceedings of the Seventh International Conference on Networking (2008)

An embedded system with speech recognition algorithm for wireless actuator control is presented. Speech commands can control any connected actuator like lights, air condition, etc. For wireless connectivity IEEE 802.15.4 radio (ZigBee lower layers) is used. It is maximally cost effective, low power, but fully functional and extendable solution.
Minimizing file download time in stochastic peer-to-peer networks
Authors: Yuh-Ming Chiu, Do Young Eun
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet's bandwidth usage. Measurement studies show that a typical download of a file can take from minutes up to several hours depending on the level of network congestion or the service capacity fluctuation. In this paper, we consider two major factors that have significant impact on average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuation in service capacity of a single source peer. We point out that the common approach of analyzing the average download time based on average service capacity is fundamentally flawed. We rigorously prove that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then analyze a simple, distributed algorithm to effectively remove these negative factors, thus minimizing the average download time. We show through analysis and simulations that it outperforms most of other algorithms currently used in practice under various network configurations.
Frobenius norm minimization and probing for preconditioning
Authors: T. Huckle, A. Kallischko
Venue: International Journal of Computer Mathematics (2007)

In this paper we introduce a new method for defining preconditioners for the iterative solution of a system of linear equations. By generalizing the class of modified preconditioners (e.g. MILU), the interface probing, and the class of preconditioners related to the Frobenius norm minimization (e.g. FSAI, SPAI) we develop a toolbox for computing preconditioners that are improved relative to a given small probing subspace. Furthermore, by this MSPAI (modified SPAI) probing approach we can improve any given preconditioner with respect to this probing subspace. All the computations are embarrassingly parallel. Additionally, for symmetric linear system we introduce new techniques for symmetrizing preconditioners. Many numerical examples, e.g. from PDE applications such as domain decomposition and Stokes problem, show that these new preconditioners often lead to faster convergence and smaller condition numbers.
A Web Based Business Game Built on System Dynamics Using Cognitive Agents as Virtual Tutors
Authors: Marco Remondino
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

An advanced Business Game is presented in the paper, built on the methodology of System Dynamics. It can be used for cognitive learning and knowledge transmission in schools and Universities; it allows the learners to take decisions at each time step, after which it calculates the corresponding results, showing them according to the principles of double entry accounting.An agent based framework is then discussed, which constitutes a form of virtual tutorship for the learners. The agents act as a decision support system for the decisions to be taken, and can explain some cause/effect relations. The agents themselves learn how the model work by practicing it, through some reinforcement learning techniques.
Circular choosability of graphs
Authors: Xuding Zhu
Venue: Journal of Graph Theory (2005)

This paper discusses the circular version of list coloring of graphs. We give two definitions of the circular list chromatic number (or circular choosability) &chi;c, l(G) of a graph G and prove that they are equivalent. Then we prove that for any graph G, &chi;c, l(G) &ge;&chi;l(G) - 1. Examples are given to show that this bound is sharp in the sense that for any &epsilon; 0, there is a graph G with &chi;c, l(G) > &chi;l(G) - 1 + &epsilon;. It is also proved that k-degenerate graphs G have &chi;c, l(G) &le; 2k. This bound is also sharp: for each &epsilon; < 0, there is a k-degenerate graph G with &chi;c, l(G) &ge; 2k - &epsilon;. This shows that &chi;c, l(G) could be arbitrarily larger than &chi;l(G). Finally we prove that if G has maximum degree k, then &chi;c, l(G) &le; k + 1. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 48: 210218, 2005
Conflicting treatment model for certainty rule-based knowledge
Authors: Chin-Jung Huang, Min-Yuan Cheng
Venue: Expert Systems with Applications: An International Journal (2008)

The rule-based knowledge based expert system has traditionally emphasized the verification of structural errors in the rule base. For conflicting or overlapping rules, designated rules are usually followed to implement prioritized or direct deletions. However, there exist no proper methods by which to resolve conflicts, inconsistencies or redundancies in values. The citation of erroneous knowledge can lead to mistakes in reaching decisions. This study proposes the conditional probability knowledge similarity algorithm and calculation system. The calculation system can quickly and accurately calculate rule-based knowledge similarity matrices and determine the conflicting or overlapping rules. Employing the group decision idea, an algorithm is provided that uses a ''reliability factor'' to refer to the reliability level of the knowledge item with a conflict, redundancy or inconsistency in value, and constructs a conflict treatment model for certainty rule-based knowledge. Most users, 94% report perplexity at the moment that conflicting or redundant rules are cited. Moreover, 92% of users hold that the algorithm is helpful to knowledge application and as an aid to the decision-making process. It can more effectively prevent mistakes in decision making and enable users to acquire more benefits from the knowledge application.
A PSO-based neuro-sliding mode controller for the stability enhancement of power systems with UPFC
Authors: Stella Morris, P. K. Dash, Ezra Morris
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

This paper presents a particle swarm optimization (PSO)-based neuro-sliding mode controller for the transient stability enhancement of multimachine power systems with unified power flow controller (UPFC). The UPFC is modeled as controllable loads. These controllable parameters are obtained using the sliding mode control (SMC) strategy. A PSO-based single neuron controller is used to adapt the parameters of the SMC. The efficacy of this new approach in damping the local-mode and inter-area mode of oscillations over a wide range of operating conditions is confirmed by comparing the performance with that of a conventional proportional-plus-integral (PI) controller and that of a single neuron controller.
A New DNA Fragment Assembly Method Based on Long Fragment Filtration
Authors: Guang-Ri Quan, Yong-Dong Xu, Ya-Dong Wang, Zhi-Ming Xu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

As an important aspect of bioinformatics, the main problem of Genome Sequencing is DNA Fragment Assembly. This paper proposed a new fragment assembly algorithm based on the long fragment filtration. Firstly, the fragment set was divided into two parts according to a threshold of the filtration length and the Bruijn graph was formed by the short fragments set. Subsequently system automatically selected long fragments which met the filtration condition by the Bruijn graph and the path searching method and constructed the filtrated fragments set. On the basis of not missing essential fragment information in the process of fragment assembly, our method effectively resolved the problem of high spatial cost and limited processing scale caused by traditional Eulerian Super path method. Finally, we certified the feasibility and the validity of our method through a series of experiments.
On the teaching of embedded Linux system
Authors: Sung-Yuan Ko
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

Embedded systems are dedicated computers that have fixed functions. Although they have been around for sometime, they have explosive growth recently due to the ability of making smaller and faster semiconductor chips. Embedded systems can be divided into two categories. One has the operating system, the other one is without the operating system. When the functions of embedded systems are getting more and more sophisticated, especially when networking is involved, the operating system is needed to make the embedded system design easier. Although there are several embedded operating systems available, the embedded Linux has gained wide popularity. This paper is about the curriculum design of how to teach an embedded Linux system course. It also gives several references which are helpful for the course..
A discrete filled function algorithm for approximate global solutions of max-cut problems
Authors: Ai-Fan Ling, Cheng-Xian Xu, Feng-Min Xu
Venue: Journal of Computational and Applied Mathematics (2008)

A discrete filled function algorithm is proposed for approximate global solutions of max-cut problems. A new discrete filled function is defined for max-cut problems and the properties of the filled function are studied. Unlike general filled function methods, using the characteristic of max-cut problems, the parameters in proposed filled function need not be adjusted. This greatly increases the efficiency of the filled function method. By combining a procedure that randomly generates initial points for minimization of the filled function, the proposed algorithm can greatly reduce the calculation cost and be applied to large scale max-cut problems. Numerical results on different sizes and densities test problems indicate that the proposed algorithm is efficient and stable to get approximate global solutions of max-cut problems.
An Efficient (t, n)-Threshold Multi-Secret Sharing Scheme
Authors: Shi Runhua, Huang Liusheng, Zhong Hong
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

An efficient (t, n) threshold multi-secret sharing scheme is proposed in this paper. This scheme has the same power as Yang et al.'s scheme, in which there are secrets to be shared among n participants according to (t, n)-threshold access structure. But it uses the fixed ( )th degree Lagrange interpolation polynomial whenever p ) 1 ( > p 1 t t p or t p > while Yang et al.' scheme employs the ( 1 t ), ( )th degree Lagrange interpolation polynomial when , 1 p t p t p > , respectively. Thus, the computing time and the storage cost of this scheme is less than that of Yang et al.'s scheme.
Grid emulation for managing random sensor networks
Authors: Zvi Lotker, Alfredo Navarra
Venue: Ad Hoc Networks (2008)

A common assumption in sensor networks is that sensors are located according to a uniform random distribution. In this paper, we show that uniform random points on the two dimensional unit square are almost a ''grid''. In particular, for a synchronous geographic sensor network we show how to emulate any grid protocol on random sensor networks, with high probability. This suggests the following framework. In order to solve a problem on a random sensor network, we solve the same problem on a grid. Then we use our emulation to make the obtained solution suitable for random sensor network. We analyze the cost of the emulation in terms of consumed energy and time. Finally, we provide some examples that illustrate our method.
Mobile Agents in Heterogeneous Database Environment for Emergency Healthcare System
Authors: Sharmila S. Gaikwad
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper applies agents to the highly dynamic and variable context of healthcare emergency decision-support domain. More specifically the use of mobile agents to support the deployment of an ambulance service in real-time. An implementation of the proposed agent based architecture, which was based on the specific functional and non-functional application requirements set out based on thorough analysis of literature.
Evaluating one handed thumb tapping on mobile touchscreen devices
Authors: Keith B. Perry, Juan Pablo Hourcade
Venue: Proceedings of graphics interface 2008 (2008)

In spite of the increasing popularity of handheld touchscreen devices, little research has been conducted on how to evaluate and design one handed thumb tapping interactions. In this paper, we present a study that researched three issues related to these interactions: 1) whether it is necessary to evaluate these interactions with the preferred and the non-preferred hand; 2) whether participants evaluating these interactions should be asked to stand and walk during evaluations; 3) whether targets on the edge of the screen enable participants to be more accurate in selection than targets not on the edge. Half of the forty participants in the study used their non-preferred hand and half used their preferred hand. Each participant conducted half of the tasks while walking and half while standing. We used 25 different target positions (16 on the edge of the screen) and five different target sizes. The participants who used their preferred hand completed tasks more quickly and accurately than the participants who used their non-preferred hand, with the differences being large enough to suggest it is necessary to evaluate this type of interactions with both hands. We did not find differences in the performance of participants when they walked versus when they stood, suggesting it is not necessary to include this as a variable in evaluations. In terms of target location, participants rated targets near the center of the screen as easier and more comfortable to tap, but the highest accuracy rates were for targets on the edge of the screen.
Kings in semicomplete multipartite digraphs
Authors: Gregory Gutin, Anders Yeo
Venue: Journal of Graph Theory (2000)

A digraph obtained by replacing each edge of a complete p-partite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a semicomplete p-partite digraph, or just a semicomplete multipartite digraph. A semicomplete multipartite digraph with no cycle of length two is a multipartite tournament. In a digraph D, an r-king is a vertex q such that every vertex in D can be reached from q by a path of length at most r. Strengthening a theorem by K. M. Koh and B. P. Tan (Discr Math 147 (1995), 171&ndash;183) on the number of 4-kings in multipartite tournaments, we characterize semicomplete multipartite digraphs, which have exactly k 4-kings for every k = 1, 2, 3, 4, 5. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 33: 177-183, 2000
Temporal semantic compression for video browsing
Authors: Brett Adams, Stewart Greenhill, Svetha Venkatesh
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

We present a video browsing approach, termed Temporal Semantic Compression (TSC), that uses automated measures of interest to support today's foraging behaviours. Conventional browsers 'compress' a video stream using simple 2x or 8x fast-forward. TSC browsers dynamically filter video based on a single user gesture to leave out more or less of the boring bits. We demonstrate a browser with an example interest measure, derived from an automated estimate of movie tempo, to forage in terms of narrative structures such as crises, climaxes, and action sequence book-ends. Media understanding algorithms facilitate browsing, and interactivity enables the human-in-the-loop to cope when those algorithms fail to cross the semantic gap.
Joint source-channel coding for scalable video atomic bitstream by adaptive turbo code
Authors: Naeem Ramzan, Ebroul Izquierdo
Venue: Proceedings of the 2nd international conference on Mobile multimedia communications (2006)

Joint source and channel coding enables efficient transmission of embedded video bitstream over unreliable channels. In this paper, we propose an efficient technique for joint source and channel coding. The technique consists of motion compensated spatio-temporal wavelet decomposition fully scalable video coder and turbo coding. The scalable atomic bitstream is adapted with unequal error protection according to the relevance of the video quality layers in the scalable bitstream. The adaptive turbo code is used to switch between simple equal error protection and the proposed unequal error protection technique. Experimental results show that the proposed approach outperforms conventional forward error correction techniques at medium to low signal to noise ratio. It also significantly improves the performance of end to end transmission at all signal to noise ratios.
Resistivity measurements of gold wires fabricated by stencil lithography on flexible polymer substrates
Authors: K. Sidler, O. Vazquez-Mena, V. Savu, G. Villanueva, M. A. F. van den Boogaart, J. Brugger
Venue: Microelectronic Engineering (2008)

We report on the patterning and characterization of titanium-gold (Ti-Au) wire test structures on polyethylene naphthalate (PEN), polyethylene terephthalate (PET) and polyimide (PI) substrates. PEN, PET and PI are flexible polymers which can withstand stress and strain. The used patterning method is stencil lithography, a resistless patterning method and based on the shadow mask technique. From the electrical characterization, the resistivity of the Ti-Au wires on the different flexible substrates was determined.
Unconditional pseudorandom generators for low degree polynomials
Authors: Shachar Lovett
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We give an explicit construction of pseudorandom generators against low degree polynomials over finite fields. We show that the sum of 2d small-biased generators with error ε2O(d) is a pseudorandom generator against degree d polynomials with error ε. This gives a generator with seed length 2O(d) log(n/ε). Our construction follows the recent breakthrough result of Bogadnov and Viola. Their work shows that the sum of d small-biased generators is a pseudo-random generator against degree d polynomials, assuming the Inverse Gowers Conjecture. However, this conjecture is only proven for d=2,3. The main advantage of our work is that it does not rely on any unproven conjectures.
Power reduction in on-chip interconnection network by serialization
Authors: Madan Arvind, Bharadwaj Amrutur
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

We explore the use of serialization in on-chip buses for reducing interconnect energy. Serialization reduces wire density and hence the coupling capacitance between adjacent data bits. This enables higher data rates, thus making it possible to send multiple data bits on a single wire within a single clock cycle. Energy reduction is brought about as a result of the decreased coupling capacitance, however this is offset by increased size and number of repeaters to obtain higher speed. A critical delay exists above which serialization is more energy efficient. We find this critical delay for a 2:1 serialization by solving an optimization problem formulated as minimization of power with serialization factor (1 or 2), area, bandwidth and frequency as constraints, and having repeater size, number of repeaters, and wire dimensions as design variables. We find that for delays above 40% of minimum delay for the wire, double pumping is more energy efficient across a range of technology nodes and supply voltages and matches well with a simple analytical derivation.
Message-passing for graph-structured linear programs: proximal projections, convergence and rounding schemes
Authors: Pradeep Ravikumar, Alekh Agarwal, Martin J. Wainwright
Venue: Proceedings of the 25th international conference on Machine learning (2008)

A large body of past work has focused on the first-order tree-based LP relaxation for the MAP problem in Markov random fields. This paper develops a family of super-linearly convergent LP solvers based on proximal minimization schemes using Bregman divergences that exploit the underlying graphical structure, and so scale well to large problems. All of our algorithms have a double-loop character, with the outer loop corresponding to the proximal sequence, and an inner loop of cyclic Bregman divergences used to compute each proximal update. The inner loop updates are distributed and respect the graph structure, and thus can be cast as message-passing algorithms. We establish various convergence guarantees for our algorithms, illustrate their performance, and also present rounding schemes with provable optimality guarantees.
Weak first- or second-order implicit Runge-Kutta methods for stochastic differential equations with a scalar Wiener process
Authors: Yoshio Komori
Venue: Journal of Computational and Applied Mathematics (2008)

New fully implicit stochastic Runge-Kutta schemes of weak order 1 or 2 are proposed for stochastic differential equations with sufficiently smooth drift and diffusion coefficients and a scalar Wiener process, which are derivative-free and which are A-stable in mean square for a linear test equation in some general settings. They are sought in a transparent way and their convergence order and stability properties are confirmed in numerical experiments.
Lemmatization and stopword elimination in Greek web searching
Authors: Fotis Lazarinis
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

This paper explores the effect of noun lemmatization and stopword removal in Greek Web searching. A light lemmatizer is presented and applied in a retrieval experiment. Stopwords are removed from user queries. In both experiments an increase in precision is reported. The main purpose of our work is to adapt and apply some "ancient" information retrieval techniques in non Latin queries and measure their effect in the retrieval of relevant documents.