ppxscal/embedding_network huggingface dataset:
Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks
Authors: Theodoros Salonidis, Leandros Tassiulas
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

We present a framework for the provision of deterministic end-to-end bandwidth guarantees in wireless ad hoc networks. Guided by a set of local feasibility conditions, multi-hop sessions are dynamically offered allocations, further translated to link demands. Using a distributed Time Division Multiple Access (TDMA) protocol nodes adapt to the demand changes on their adjacent links by local, conflict-free slot reassignments. As soon as the demand changes stabilize, the nodes must incrementally converge to a TDMA schedule that realizes the global link (and session) demand allocation.We first derive sufficient local feasibility conditions for certain topology classes and show that trees can be maximally utilized.We then introduce a converging distributed link scheduling algorithm that exploits the logical tree structure that arises in several ad hoc network applications.Decoupling bandwidth allocation to multi-hop sessions from link scheduling allows support of various end-to-end Quality of Service (QoS) objectives. We focus on the max-min fairness (MMF) objective and design an end-to-end asynchronous distributed algorithm for the computation of the session MMF rates. Once the end-to-end algorithm converges, the link scheduling algorithm converges to a TDMA schedule that realizes these rates.We demonstrate the applicability of this framework through an implementation over an existing wireless technology. This implementation is free of restrictive assumptions of previous TDMA approaches: it does not require any a-priori knowledge on the number of nodes in the network nor even network-wide slot synchronization.
Snapshot Queries: Towards Data-Centric Sensor Networks
Authors: Yannis Kotidis
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

In this paper we introduce the idea of snapshot queries for energy efficient data acquisition in sensor networks. Network nodes generate models of their surrounding environment that are used for electing, using a localized algorithm, a small set of representative nodes in the network. These representative nodes constitute a network snapshot and can be used to provide quick approximate answers to user queries while reducing substantially the energy consumption in the network. We present a detailed experimental study of our framework and algorithms, varying multiple parameters like the available memory of the sensor nodes, their transmission range, the network message loss etc. Depending on the configuration, snapshot queries provide a reduction of up to 90% in the number of nodes that need to participate in a user query.
Mac OS X Tiger Killer Tips (Killer Tips)
Authors: Scott Kelby
Venue:  (2005)

Tips rule!Have you ever noticed that in just about every Mac book, the author will include a couple of tips in each chapter (you'll usually find them in the sidebar, or at the bottom of the page in a tinted box). Sometimes it's a shortcut, a faster way to do something, or a clever workaround that just makes your life easier. People really love those tips, but there's only one problem--there's never enough of them.That's why Scott Kelby, bestselling author and Editor-in-Chief of Mac Design magazine came up with the idea to create a book that's nothing but "sidebar" tips. That's right--this entire book, cover-to-cover is packed with nothing but those cool inside secrets, slick workarounds, undocumented shortcuts, and sneaky little tricks that will make you faster, better, and have more fun using Mac OS 10.4 (Tiger).Nothing but the tips!You're not going to find complicated descriptions on how to configure a network, how to partition a hard drive, or lines and lines of scary-looking UNIX code--instead this book is nothing but cool tips--and it's all written in Scott's casual, plain English style so you can start using these tips today. Plus, this book does the standard "sidebar tip" one better by including a clear screen capture with nearly every tip, so you can see exactly how it's all done.Not just tips. Killer tips!To be in this book, every tip has got to be a "Killer Tip" (the kind of tip that makes you nod and smile, then call all your Mac buddies to tune them up with your new-found power). Scott's a total "hip hound" (in fact, it was Scott who created the entire smash-bestselling "Killer Tips" book series), and he doesn't hold anything back--it's all here from the man who literally "wrote the book" on cool productivity tips.If you like doing things the easy way, if you like getting twice the work done in half the time, and if you get a kick out of knowing all the "inside secrets and undocumented shortcuts" that will wow your friends and coworkers, you're absolutely going to love this book.
Invisible sculpture #1
Authors: Lorraine Oades
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

Invisible sculpture #1 uses interactive digital interfaces to question the nature of materiality within information-based post-corporal societies. In this artwork the viewer's body controls the speed and direction of a short video sequence inspired by H.G. Wells' science fiction classic "The Invisible Man".
Canonical products of small order and related Pick functions
Authors: Henrik L. Pedersen
Venue: Journal of Computational and Applied Mathematics (2005)

We show that various functions related to the logarithms of the canonical products Pρ(z) = Πn=1∞ (1 + Z/nρ), ρ > 1 and Q(z) = Πn=0∞(1 + zqn, q ∈ (0,1) are Pick functions. As a consequence we find an integral expansion of a function involving the logarithm of Jacksons q-gamma function.
Performance of peps in cellular wireless networks
Authors: Pablo Rodriguez, Vitali Fridman
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

In this paper we study the main performance problems experienced by Web applications in Cellular Wireless networks. To this extend we identify the particular problems at each protocol layer (transport, session and application layer). We present our practical experience results, and investigate how a Wireless Performance Enhancing Proxy can improve the performance over these networks.
Cooperative usability testing: complementing usability tests with user-supported interpretation sessions
Authors: Erik Frøkjær, Kasper Hornbæk
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Recent criticism of think-aloud testing (TA) discusses discrepancies between theory and practice, the artificiality of the test situation, and inconsistencies in the evaluators' interpretation of the process. Rather than enforcing a more strict TA procedure, we describe Cooperative Usability Testing (CUT), where test users and evaluators join expertise to understand the usability problems of the application evaluated. CUT consists of two sessions. In the interaction session, the test user tries out the application to uncover potential usability problems while the evaluators mainly observe, e.g. as in TA or contextual inquiry. In the interpretation session, evaluators and test users discuss what they consider the most important usability problems, supported by a video of the interaction session. In an exploratory study comparing CUT to TA, seven evaluators find that interpretation sessions contribute important usability information compared to TA. Also test users found participation in the interpretation session interesting.
Special Edition Using Mac OS X Tiger (Special Edition Using)
Authors: Brad Miser
Venue:  (2005)

One of the best Mac OS X reference books has just gotten better. Special Edition Using Mac OS X Tiger is the ultimate guide to your new Mac operating system. Written in a straightforward style with no fluff, You will thoroughly cover everything you need to know to use Mac OS X Tiger as efficiently and effectively as possible. In addition to coverage of the core functionality of the desktop, you will find extensive coverage of topics that enable you to accomplish productive work with your Mac, such as creating digital movies, surfing the Net, and creating and hosting a Web site. This book also contains substantial amounts of information to help you add devices to expand your system so you can accomplish even more. You'll learn about the iLife suite of applications, including iTunes, iDVD, iPhoto, Garage Band and iMovie and how to configure the technologies so that they can be used to expand your system and maximize its performance. This comprehensive user's guide provides you with the in-depth, wide-ranging information that you need to get the most out of your operating system.
On the Co-P3-Structure of Perfect Graphs
Authors: Chính T. Hoàng, Bruce Reed
Venue: SIAM Journal on Discrete Mathematics (2005)

Let ${\cal F}$ be a family of graphs. Two graphs G1 = (V1,E1), G2=(V2,E2) are said to have the same ${\cal F}$-structure if there is a bijection $f: V_1 \rightarrow V_2$ such that a subset S induces a graph belonging to ${\cal F}$ in G1 if and only if its image f(S) induces a graph belonging to ${\cal F}$ in G2. We characterize those graphs which have the same $\{P_3,\overline{P}_3\}$-structure, or the same $\{K_3,\overline{K}_3\}$-structure. This characterization shows that graph H is perfect if and only if it has the $\{P_3,\overline{P}_3\}$-structure of some perfect graph G. In proving the main result, we need and prove the following result, which is of independent interest: If a graph J is claw-free and co-claw-free, then either (i) J has at most nine vertices, or (ii) every component of J is a path or a hole, or (iii) every component of $\overline{J}$ is a path or a hole.
The Meta-Orchestra: research by practice in group multi-disciplinary electronic arts
Authors: Yolande Harris
Venue: Organised Sound (2004)

Group multi-disciplinary projects face difficult challenges in social collaboration, diverse technologies and aesthetic grounds. Combining sound, image and space into a sufficiently malleable set of materials for creation is a complex task. As such projects lack a common ground from which to start, an experimental, practical approach is suggested, with a non-hierarchical, informal group structure. The Meta-Orchestra project, tackling these problems since 2000, re-engaged with the issues in a fourth meeting in Maastricht in 2004. This paper lays out the context of multi-disciplinary work, influenced by developments in computer technologies, by outlining the changed roles of the orchestra, the score and audio-visual theories. The Meta-Orchestra is described against a theoretical frame of social, technical and aesthetic considerations. Although the project will not be forced into this framework, descriptions of the palette, the strategies to create common grounds, the areas opened up by wireless network technologies, aesthetic issues of layering sounds and images, and the development of a central score system, illustrate the layered complexities of the Meta-Orchestra.
A color image compression scheme based on the adaptive orthogonalized transform: Accelerated by product code technique
Authors: Takashi Miura, Shinobu Kumaoka, Kenta Matsumoto, Takamitsu Simomura
Venue: Systems and Computers in Japan (2005)

This paper proposes an improvement of the coding performance of a vector quantization method based on the adaptive orthogonalized transform (AOT). The principle of the proposed method is based on the product code technique, which divides an error vector into lower-order vectors and then quantizes them. For a lower-order vector, a smaller size dictionary can give the same approximation gain. Thus, the number of vector comparison will be reduced, and the coding time will be shortened. Two speed-up techniques for the proposed method are added. One consists of sorting the dictionary according to the first element of the dictionary vector, and selecting the search range from the value of the first element of the error vector. The other consists of switching the dictionary set in terms of the required approximation gain. The effectiveness of the proposed method is confirmed by numerical experiments. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(5): 23&ndash;32, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20226
Alpha-Beta pruning: they've seen it before
Authors: Joseph S. Fulda
Venue: Issue 94 (October 1985) (1985)

One of the most apparently subtle techniques taught in a typical Al survey course is minimaxing with alpha-beta pruning. As Winston writes in his text: "It is not unusual to get lost in this.... Even seasoned game specialists still feel magic in the alpha-beta procedure. Each individual conclusion seems right, but somehow the global result is strange." One way of lessening the apparent mystery of the technique is to ground it in something virtually every computer science student has seen and mastered earlier: cutoff of evaluation in conditionals. After encountering a true disjunct or a false conjunct in thre protasis of an IF statement a reasonable compiler will cease evaluation and return true and false respectively. It is easy to see by constructing some quick truth tables that the MAX function and disjunction are the same. Likewise, the MIN function and conjunction are equivalent. To stop evaluation of a MAX function, what occurs in alpha-beta pruning, is thus no different from what happens to everyday compound conditions with a disjunction. <u>Mutatis mutandis</u>, the same thing can be said of the MIN function and conjunction. There is one slight difference, however. Ordinary conditionals are based on standard, two-state logic, while the MAX and MIN functions in minimaxing can take on many values. We thus have to complete our comparison by noting that for multi-valued logics a true statement is as true as its truest disjunct, while a false statement is as false as its falsest conjunct.
A methodology for studying persistency aspects of internet flows
Authors: Jörg Wallerich, Holger Dreger, Anja Feldmann, Balachander Krishnamurthy, Walter Willinger
Venue: ACM SIGCOMM Computer Communication Review (2005)

We focus in this paper on Internet flows, consider their contributions to the overall traffic per time unit or bin, and perform a multi-scale and multi-protocol analysis to explore the persistency properties of those flows that contribute the most (also known as "heavy hitters" or "elephants"). Knowing the persistency features (or a lack thereof) of the heavy hitters and understanding their underlying causes is crucial when developing traffic engineering tools that focus primarily on optimizing system performance for elephant flows.The main difficulty when studying the persistency properties of flows is that the available measurements are either too fine-grained to perform large-scale studies (i.e., packet-level traces) or too coarse-grained to extract the detailed information necessary for the purpose at hand (i.e., Netflow traces, SNMP). We deal with this problem by assuming that flows have constant throughput through their lifetime. We then check the validity of this assumption by comparing our Netflow-derived findings against those obtained from directly studying the corresponding detailed packet-level traces. By considering different time aggregations (e.g., bin sizes between 1--10 minutes) and flow abstractions (e.g., raw IP flows, pre-fix flows), varying the definition of what constitutes an "elephant", and slicing by different protocols and applications, we present a methodology for studying persistency aspects exhibited by Internet flows. For example, we find that raw IP flows that are elephant flows for at least once (i.e., one bin or time unit) in their lifetimes tend to show a remarkable persistence to be elephants for much of their lifetimes, but certain aggregate flows exhibit more intricate persistency properties.
Wearable Kinesthetic System for Capturing and Classifying Upper Limb Gesture
Authors: R. Bartalesi, F. Lorussi, M. Tesconi, A. Tognetti, G. Zupone, D. De Rossi
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Electrically conductive elastomer composites (CEs) show piezoresistive properties when a deformation is applied. In several applications, CEs can be integrated onto fabric or other flexible substrate and can be employed as strain sensors. Moreover, integrated CE sensors may be used in biomechanical analysis to realize wearable kinesthetic interfaces able to detect posture and movement of the human body. In the following a kinesthetic upper limb garment realized by CEs which allows to reconstruct shoulder, elbow and wrist movements is presented.
Jensen-Shannon Boosting Learning for Object Recognition
Authors: Xiangsheng Huang, Stan Z. Li, Yangsheng Wang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper, we propose a novel learning method, called Jensen-Shannon Boosting (JSBoost) and demonstrate its application to object recognition. JSBoost incorporates Jensen-Shannon (JS) divergence [2] into AdaBoost learning. JS divergence is advantageous in that it provides more appropriate measure of dissimilarity between two classes and it is numerically more stable than other measures such as Kullback-Leibler (KL) divergence (see [2]). The best features are iteratively learned by maximizing the projected JS divergence, based on which best weak classifiers are derived. The weak classifiers are combined into a strong one by minimizing the recognition error. JSBoost learning is demonstrated with face object recognition using a local binary pattern (LBP) [13] based representation. JSBoost selects the best LBP features from thousands of candidate features and constructs a strong classifier based on the selected features. JSBoost empirically produces better face recognition results than other AdaBoost variants such as RealBoost [12], GentleBoost [5] and KL-Boost [7], as demonstrated by experiments.
Troubleshooting multihop wireless networks
Authors: Lili Qiu, Paramvir Bahl, Ananth Rao, Lidong Zhou
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Effective network troubleshooting is critical for maintaining efficient and reliable network operation. Troubleshooting is especially challenging in multihop wireless networks because the behavior of such networks depends on complicated interactions between many unpredictable factors such as RF noise, signal propagation, node interference, and traffic flows. In this paper we propose a new direction for research on fault diagnosis in wireless networks. Specifically, we present a diagnostic system that employs trace-driven simulations to detect faults and perform root cause analysis. We apply this approach to diagnose performance problems caused by packet dropping, link congestion, external noise, and MAC misbehavior. In a 25 node multihop wireless network, we are able to diagnose over 10 simultaneous faults of multiple types with more than 80% coverage. Our framework is general enough for a wide variety of wireless and wired networks.
Using structural context to recommend source code examples
Authors: Reid Holmes, Gail C. Murphy
Venue: Proceedings of the 27th international conference on Software engineering (2005)

When coding to a framework, developers often become stuck, unsure of which class to subclass, which objects to instantiate and which methods to call. Example code that demonstrates the use of the framework can help developers make progress on their task. In this paper, we describe an approach for locating relevant code in an example repository that is based on heuristically matching the structure of the code under development to the example code. Our tool improves on existing approaches in two ways. First, the structural context needed to query the repository is extracted automatically from the code, freeing the developer from learning a query language or from writing their code in a particular style. Second, the repository can be generated easily from existing applications. We demonstrate the utility of this approach by reporting on a case study involving two subjects completing four programming tasks within the Eclipse integrated development environment framework.
Interactivity in large class: state of Art and DRIM-AP project
Authors: B. David, F. Mercier, R. Chalon, O. Delotte, J. P. Berthet
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

The aim of this paper is to present how to make teaching in large class livelier and more participative by using wireless devices. This paper describes the challenge of teaching in large class, presents the state of the art and introduces DRIM-AP project (French acronym for Multiple Interactive Radio Devices and Participative Theaters) at Ecole Centrale of Lyon.
Reliability assessment and sensitivity analysis of software reliability growth modeling based on software module structure
Authors: Jung-Hua Lo, Chin-Yu Huang, Ing-Yi Chen, Sy-Yen Kuo, Michael R. Lyu
Venue: Journal of Systems and Software (2005)

Software reliability is an important characteristic for most systems. A number of reliability models have been developed to evaluate the reliability of a software system. The parameters in these software reliability models are usually directly obtained from the field failure data. Due to the dynamic properties of the system and the insufficiency of the failure data, the accurate values of the parameters are hard to determine. Therefore, the sensitivity analysis is often used in this stage to deal with this problem. Sensitivity analysis provides a way to analyzing the impact of the different parameters. In order to assess the reliability of a component-based software, we propose a new approach to analyzing the reliability of the system, based on the reliabilities of the individual components and the architecture of the system. Furthermore, we present the sensitivity analysis on the reliability of a component-based software in order to determine which of the components affects the reliability of the system most. Finally, three general examples are evaluated to validate and show the effectiveness of the proposed approach.