ppxscal/embedding_network huggingface dataset:
A Self-selection Technique for Flooding and Routing in Wireless Ad-hoc Networks
Authors: Gilbert G. Chen, Joel W. Branch, Boleslaw K. Szymanski
Venue: Journal of Network and Systems Management (2006)

There is a fundamental difference between wireless and wired networks, since the latter employ point-to-point communication while the former use broadcast transmission as the communication primitive. In this paper, we describe an algorithm, called self-selection, which takes advantage of broadcast communication to efficiently implement the basic operation of selecting a node possessing some desired properties among all the neighbors of the requestor. Self-selection employs a prioritized transmission back-off delay scheme in which each node's delay of transmitting a signal is dependent on the probability of the node's ability to best perform a pertinent task, and in turn, enables the node to autonomously select itself for the task. We demonstrate the benefits of self-selection in two basic wireless ad hoc network communication algorithms: flooding and routing. By relating back-off delay to the signal strength of a received packet, we design an efficient variant of conventional flooding called Signal Strength Aware Flooding. By using distance-to-destination to derive back-off delay, we design a novel and fault-tolerant wireless ad hoc network routing protocol named Self-Selective Routing.
Digital light field photography
Authors: Patrick Hanrahan
Venue:  (2006)

Focusing images well has been difficult since the beginnings of photography in 1839. Three manifestations of the problem are: the chore of having to choose what to focus on before clicking the shutter, the awkward coupling between aperture size and depth of field, and the high optical complexity of lenses required to produce aberration-free images. These problems arise because conventional cameras record only the sum of all light rays striking each pixel on the image plane. This dissertation presents a unified solution to these focus problems by instead recording the light field inside the camera: not just the position but also the direction of light rays striking the image plane. I describe the design, prototyping and performance of a digital camera that records this light field in a single photographic exposure. The basic idea is to use an array of microlenses in front of the photosensor in a regular digital camera. The main price behind this new kind of photography is the sacrifice of some image resolution to collect directional ray information. However, it is possible to smoothly vary the optical configuration from the light field camera back to a conventional camera by reducing the separation between the microlenses and photosensor. This allows a selectable trade-off between image resolution and refocusing power. More importantly, current semiconductor technology is already capable of producing sensors with an order of magnitude more resolution than we need in final images. The extra ray directional information enables unprecedented capabilities after exposure. For example, it is possible to compute final photographs that are refocused at different depths, or that have extended depth of field, by re-sorting the recorded light rays appropriately. Theory predicts, and experiments corroborate, that blur due to incorrect focus can be reduced by a factor approximately equal to the directional resolution of the recorded light rays. Similarly, digital correction of lens aberrations re-sorts aberrant light rays to where they should ideally have converged, improving image contrast and resolution. Future cameras based on these principles will be physically simpler, capture light more quickly, and provide greater flexibility in finishing photographs.
MuSwikis: a graphical collaboration system
Authors: Lex Spoon, Mark Guzdial
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

Many collaborative systems use text as the primary modality and only use multimedia via attachments. MuSwikis are a collaboration system where graphics are the primary modality, and text is treated just like any other graphical element. This paper describes the MuSwiki system for the first time, describes a pilot study that was run on MuSwikis, and discusses ideas generated from that study.
Dynamics of current regulator with hysteresis control and clocked commutation in application to power electronic systems
Authors: Y. Kolokolov, S. Koschinsky, C. Hatziadoniu, G. Galanos
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

The results of dynamics analysis of a current regulator with hysteresis control and clocked commutation are given in application to electric drive systems. Some new bifurcation phenomena were studied.
Blind linear recursive equalizer with decorrelation algorithm
Authors: T. S. Castelein, Y. Bar-Ness, R. Prasad
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

High-speed communications suffer from intersymbol interference (ISI) introduced by the channel. In order to combat ISI one commonly uses equalizers that need a training sequence to adjust the equalizer tap weights. When sending a training sequence is not appropriate, blind equalization has to be used. A new blind linear equalizer is proposed. The equalizer has a recursive structure. To avoid stability problems, a soft limiter is used in the feedback loop. The weights are controlled by means of the decorrelation algorithm. For channels without precursors, the equalizer converges to the desired weights in around 500 iterations, depending on the amount of distortion. The novel blind equalization technique is globally convergent for minimum and non-minimum phase channels.
SPARTAN: speculative avoidance of register allocations to transient values for performance and energy efficiency
Authors: Deniz Balkan, Joseph Sharkey, Dmitry Ponomarev, Kanad Ghose
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

High-performance microprocessors use large, heavily-ported physical register files (RFs) to increase the instruction throughput. The high complexity and power dissipation of such RFs mainly stem from the need to maintain each and every result for a large number of cycles after the result generation. We observed that a significant fraction (about 45%) of the result values are never read from the register file and are not required to recover from branch mispredictions. In this paper, we propose SPARTAN - a set of micro-architectural extensions that predicts such transient values and in many cases completely avoids physical register allocations to them. We show that the transient values can be predicted as such with more than 97% accuracy on the average across simulated SPEC 2000 benchmarks. We evaluate the performance of SPARTAN on a variety of configurations and show that significant improvements in performance and energy-efficiency can be realized. Furthermore, we directly compare SPARTAN against a number of previously proposed schemes for register optimizations and show that our technique significantly outperforms all those schemes.
Traffic analysis-based unlinkability measure for IEEE 802.11b-based communication systems
Authors: Dijiang Huang
Venue: Proceedings of the 5th ACM workshop on Wireless security (2006)

Measuring communication anonymity (e.g., unlinkability) of wireless ad hoc networks is a critical but still unsolved problem. In order to solve this problem, we propose a two-step unlinkability measuring approach: (a) statistical traffic analysis-based evidence collection, (b) evidence theory-based unlinkability measure. To demonstrate our approach, we use IEEE 802.11b-based ad hoc networks as our analyzing communication systems. Based on our proposed IEEE 802.11b transmission and channel models, we can collect, a set of evidence which can be used to set up a probability assignment for each possible communication relation (i.e., the data sender and corresponding receiver): and then we can apply the evidence theory-based unlinkability measuring approach to the collected evidence to derive the unlinkability measure of the given 802.11b-based ad hoc network.
A new cumulant based parameter estimation method for noncausal autoregressive systems
Authors: Chong-Yung Chi, Jian-Lin Hwang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

In this paper, a new nonlinear parameter estimation method for a noncausal autoregressive (AR) system based on a new quadratic equation relating the unknown AR parameters to higher-order (/spl ges/3) cumulants of non-Gaussian output measurements in the presence of additive Gaussian noise, is described. It is applicable no matter whether or not the order of the system is known in advance; it is also applicable for the case of causal AR system. Some simulation results are offered to justify that the proposed method is effective.
Impact of communication infrastructure on forwarding in pocket switched networks
Authors: Anders Lindgren, Christophe Diot, James Scott
Venue: Proceedings of the 2006 SIGCOMM workshop on Challenged networks (2006)

Recently, it has been established on multiple experimental data sets that human contact processes exhibit heavy-tailed inter-event distributions. This characteristic makes it difficult to transport data with a finite transfer time in a network of mobile devices, relying on opportunistic contacts only. Using various experimental data sets, we analyze how different types of communication infrastructure impact the feasibility of data transfers among mobile devices.The first striking result is that the heavy tailed nature of the contact processes persists after infrastructure is introduced. We establish experimentally that infrastructure improves significantly multiple opportunistic contact properties, relevant to opportunistic forwarding algorithms. We discuss how infrastructure can be used to design simpler and more efficient (in terms of delay and number of hops) opportunistic forwarding algorithms. In addition to this, for the first time in a study like this, the communication pattern of nodes is taken into account in the analysis. We also show that node pairs that have a real-life history of communication have contact properties that are better for opportunistic message forwarding to each other than what other node pairs have.
Next frontier
Authors: Rakesh Agrawal
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

This talk is about the next frontier in knowledge discovery and data mining.
RVσ(t): a unifying approach to performance and convergence in online multiagent learning
Authors: Bikramjit Banerjee, Jing Peng
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We present a new multiagent learning algorithm (RV&sigma;(t) that can guarantee both no-regret performance (all games) and policy convergence (some games of arbitrary size). Unlike its predecessor ReDVaLeR, it (1) does not need to distinguish whether its opponents are self-play or otherwise non-stationary, (2) is allowed to know its portion of any equilibrium that, we argue, leads to convergence in some games in addition to no-regret. Although the regret of RV&sigma;(t) is analyzed in continuous time, we show that it grows slower than in other no-regret techniques like GIGA and GIGA-WoLF. We show that RV&sigma;(t) can converge to coordinated behavior in coordination games, while GIGA, GIGA-WoLF may converge to poorly coordinated (mixed) behaviors.
Motion Analysis for the Standing Long Jump
Authors: Hui-Huang Hsu, Sheng-Wen Hsieh, Wu-Chou Chen, Chun-Jung Chen, Che-Yu Yang
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

The standing long jump is a standard test for primary school students. It can be used to evaluate the development of basic sports skills of a child. This paper presents a system that can automatically detect the motion during a standing long jump from a video sequence. The silhouette of the jumper in the film is segmented from the background first for all frames. A stick model is applied to the silhouette found in the first frame. Then a GA-based search algorithm is used to find the stick models for the rest of the frames. The stick model points out the important joints of a person and can be used to represent the pose of the jumper in each frame. From the pose change in consecutive frames, we will be able to analyze the movement of the jumper.
Trickle: Resilient Real-Time Video Multicasting for Dynamic Peers with Limited or Asymmetric Network Connectivity
Authors: Yu-Hsuang Guo, John K. Zao, Wen-Hsiao Peng, Lin-Shung Huang, Fang-Po Kuo, Che-Min Lin
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

some of the most challenging scenarios for peer-to-peer multimedia applications arise when the applications require real-time interactions among their users. In those cases, the expectation of sub-second responses prohibits the use of popular P2P IPTV software because those programs invariably use large video buffers to amortize the propagation delays of individual frames and thus cause notable and dispersed viewing latencies among their users. The performance of these programs degrade even further if the users are connected to home networks that offer narrow uplink channels or through wireless links that experience frequent throughput fluctuations. In order to overcome these shortcomings, we develop Trickle, a peer-to-peer real-time media streaming system that can transport H.264 video streams with low link stresses (less than 250Kb/s) and stable sub-second frame delays through the use of erasure correction codes along with the clever construction of multiple multicast trees and the recruitment of many peer helpers. This paper presents the first fruits of our work including the principles and mechanisms of Trickle, its simulated performance based on H.264 video traces and its merit comparisons against SplitStream, the first application layer multicasting protocol for video streaming, and CoolStreaming, a news-making P2P IPTV program that works like BitTorrent.
Maximum likelihood and common factor analysis-based blind adaptive spatial filtering for cyclostationary signals
Authors: S. V. Schell, W. A. Gardner
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A blind adaptive spatio-temporal filter for unknown cyclostationary signals in noise is derived in two ways by maximizing a constrained conditional likelihood function and by solving a common factor analysis problem. It is shown that specific choices of free constraint-parameters within the resulting beamformer structure yield the existing cross spectral self-coherence restoral (SCORE) algorithms and conjugate cross-SCORE algorithms which blindly adapt and antenna array to extract signals having specified cyclostationarity properties from interference and noise. It is also show that other choices can substantially improve the convergence properties of SCORE algorithms.
Treatment of the interface between fine elastic structures and fluids
Authors: N. D. Botkin, K.-H. Hoffmann, V. N. Starovoitov, V. L. Turova
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

The interaction of fine pin or bristle structures with fluids is studied. Such problems arise when modeling bimolecular layers moving in liquids or when simulating epithelium surfaces of blood vessels. We propose a homogenized model where the interaction between the bristles and the fluid is accounted through an averaged material whose properties are derived using the passage to the limit in the model based on the fluid-solid interface conditions as the number of the bristles goes to infinity whereas their thickness goes to zero. The model of such an averaged material is used for the study of a Love wave biosensor.
Block approach: tabu search algorithm for single machine total weighted tardiness problem
Authors: Wojciech Bozejko, Józef Grabowski, Mieczysław Wodecki
Venue: Computers and Industrial Engineering (2006)

Problem of scheduling on a single machine to minimize total weighted tardiness of jobs can be described as follows: there are n jobs to be processed, each job has an integer processing time, a weight and a due date. The objective is to minimize the total weighted tardiness of jobs. The problem belongs to the class of NP-hard problems. Some new properties of the problem associated with the blocks have been presented and discussed. These properties allow us to propose a new fast local search procedure based on a tabu search approach with a specific neighborhood which employs blocks of jobs and a compound moves technique. A compound move consists in performing several moves simultaneously in a single iteration of algorithm and allows us to accelerate the convergence to good solutions. In the algorithm, we use an idea which decreases the complexity for the search of neighborhood from O(n3) to O(n2). Additionally, the neighborhood is reduced by using some elimination criteria. The method presented in this paper is deterministic one and has not any random element, as distinct from other effective but non-deterministic methods proposed for this problem, such as tabu search of Crauwels, H. A. J., Potts, C. N., & Van Wassenhove, L. N. (1998). Local search heuristics for the single machine total weighted tardiness Scheduling Problem. INFORMS Journal on Computing, 10(3), 341-350, iterated dynasearch of Congram, R. K., Potts C. N., & Van de Velde, S. L. (2002). An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14(1), 52-67 and enhanced dynasearch of Grosso, A., Della Croce, F., & Tadei, R. (2004). An enhanced dynasearch neighborhood for single-machine total weighted tardiness scheduling problem. Operations Research Letters, 32, 68-72. Computational experiments on the benchmark instances from OR-Library (http://people.brunel.ac.uk/mastjjb/jeb/info.html) are presented and compared with the results yielded by the best algorithms discussed in the literature. These results show that the algorithm proposed allows us to obtain the best known results for the benchmarks in a short time. The presented properties and ideas can be applied in any local search procedures.
Simulation-based planning for planetary rover experiments
Authors: David Joslin, Jeremy Frank, Ari K. Jónsson, David E. Smith
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Time and resource limitations mean that current Mars rovers (and any future planetary rovers) cannot hope to achieve every desirable scientific goal. We must therefore select and plan for a subset of the possible experiments, maximizing some utility metric. The use of simulation in planning is appealing because of its potential for representing complex, realistic details about the rover and its environment. We demonstrate a planning algorithm that performs high-level planning in a space of plan strategies, rather than actual plans. In the current implementation, candidate strategies are evaluated by a simple simulation, and a genetic algorithm is used to search for effective strategies. Preliminary results are encouraging, particularly the potential for modeling uncertainty about the time required to complete actions, and the ability to develop strategies that can deal with this uncertainty gracefully.
An Integrity Semantics for Open World Databases
Authors: Hendrik Decker
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

We develop a mode--based integrity semantics which is open for missing facts. We do so by instantiating a generic three-valued integrity semantics. We first recapitulate the latter. Based on that, we introduce and discuss the definitions for an OWA-compatible integrity semantics which caters for databases in which facts are possibly missing. We also touch upon some open issues, paraconsistency aspects and a related recent result.
Core architecture optimization for heterogeneous chip multiprocessors
Authors: Rakesh Kumar, Dean M. Tullsen, Norman P. Jouppi
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

Previous studies have demonstrated the advantages of single-ISA heterogeneous multi-core architectures for power and performance. However, none of those studies examined how to design such a processor; instead, they started with an assumed combination of pre-existing cores.This work assumes the flexibility to design a multi-core architecture from the ground up and seeks to address the following question: what should be the characteristics of the cores for a heterogeneous multi processor for the highest area or power efficiency? The study is done for varying degrees of thread-level parallelism and for different area and power budgets.The most efficient chip multiprocessors are shown to be heterogeneous, with each core customized to a different subset of application characteristics - no single core is necessarily well suited to all applications. The performance ordering of cores on such processors is different for different applications; there is only a partial ordering among cores in terms of resources and complexity. This methodology produces performance gains as high as 40%. The performance improvements come with the added cost of customization.
Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks
Authors: Shashidhar Gandham, Ying Zhang, Qingfeng Huang
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

We consider applications of sensor networks wherein data packets generated by every node have to reach the base station. This results in a many-to-one communication paradigm referred to as convergecast. We are interested in determining a TDMA schedule that minimizes the total time required to complete the convergecast. We consider a simple version of the problem wherein every node generates exactly one packet. We propose a distributed convergecast scheduling algorithm that requires at most 3N timeslots, where N represents the number of nodes in the network. Through extensive simulations, we demonstrate that actual number of timeslots needed is around 1.5N. In addition to time efficiency, we prove that our convergecast scheduling algorithm requires the nodes to buffer no more than two packets at any instance. We propose a sleep schedule that conserves more than 50% of the energy. We present simulation results for a real application scenario to show that our convergecast scheduling algorithm performs significantly better than existing convergecast algorithms.