ppxscal/embedding_network huggingface dataset:
Generalized Load Sharing for Packet-Switching Networks I: Theory and Packet-Based Algorithm
Authors: Ka-Cheong Leung, Victor O. K. Li
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

In this paper, we propose a framework to study how to effectively perform loadsharing in multipath communication networks. A generalized load sharing (GLS) model has been developed to conceptualize how traffic is split ideally on a set of active paths. A simple traffic splitting algorithm, called packet-by-packet weighted fair routing (PWFR), has been developed to approximate GLS with the given routing weight vector by transmitting each packet as a whole. We have developed some performance bounds for PWFR and found that PWFR is a deterministically fair traffic splitting algorithm. This attractive property is useful in the provision of service with guaranteed performance when multiple paths can be used simultaneously to transmit packets which belong to the same flow. Our simulation studies, based on a collection of Internet backbone traces, reveal that PWFR outperforms two other traffic splitting algorithms, namely, packet-by-packet generalized round robin routing (PGRR), and packet-by-packet probabilistic routing (PPRR).
Authorship analysis: discovering the author of a software document
Authors: William Edwards,  Jr.
Venue:  (2006)

The purpose of this research is to study and develop methods of determining the author of software programs. The authorship techniques developed analyze a collection of the author's past programs to extract information to choose the likeliest author of a suspect program. Two approaches were attempted to accomplish this task. First, traditional software complexity measures were examined, using analysis of variance, to identify differences between authors; however, no significant differences were detected using these measures alone (with the exception of measures on the comments of the programs). The second approach created lists of characterizing terms (words and phrases within the programs) for each author that can be used to identify the author in any future programs written by the author. The focus of this dissertation is on these term selection techniques and their ability to choose the most influential terms for author identification. The techniques were developed and tested on programs using the C++ programming language (obtained from intermediate level programming classes). Five term selection techniques were attempted. The Probability Technique selects terms that are used more often by one programmer than the group of programmers. The Rank Technique selects terms that are ranked relatively higher for a programmer than for the group of programmers. The Quintile Technique groups the terms into six bins according to rank and selects the terms in a bin that few programmers use. The Probability Deviation Technique selects terms for each author with probabilities a number of deviations above the mean of probabilities for all authors. The final technique, the Bayesian Inference Ratio Technique, uses a ratio that compares the probability that the term is used by the programmer to the probability that the term is used by any programmer to determine if a term is selected. Of these term selection techniques, the Bayesian Technique produces the best results in terms of Authorship Accuracy (percentage of correctly identified suspect programs) and terms selected. The Bayesian Technique was validated in further studies on additional sets of programs. Term selection techniques, in general, and the Bayesian Technique specifically, are considered to be valid author identification methods.
A Provably Secure True Random Number Generator with Built-In Tolerance to Active Attacks
Authors: Berk Sunar, William J. Martin, Douglas R. Stinson
Venue: IEEE Transactions on Computers (2007)

This paper is a contribution to the theory of true random number generators based on sampling phase jitter in oscillator rings. After discussing several misconceptions and apparently insurmountable obstacles, we propose a general model which, under mild assumptions, will generate provably random bits with some tolerance to adversarial manipulation and running in the megabit-per-second range. A key idea throughout the paper is the fill rate, which measures the fraction of the time domain in which the analog output signal is arguably random. Our study shows that an exponential increase in the number of oscillators is required to obtain a constant factor improvement in the fill rate. Yet, we overcome this problem by introducing a postprocessing step which consists of an application of an appropriate resilient function. These allow the designer to extract random samples only from a signal with only moderate fill rate and, therefore, many fewer oscillators than in other designs. Last, we develop fault-attack models and we employ the properties of resilient functions to withstand such attacks. All of our analysis is based on rigorous methods, enabling us to develop a framework in which we accurately quantify the performance and the degree of resilience of the design.
Audio Watermark Enhanced by LDPC Coding for Air Transmission
Authors: Yoiti Suzuki, Ryouichi Nishimura, Hao Tao
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A decrease in the watermark detection rate is a fatal problem in employing audio watermarks for applications in which a watermarked signal is transmitted through the air. The enforcement of watermarks using an error-correcting code is a solution to this problem. Low-density Parity Check (LDPC) coding is a recent error-correcting code; it shows good performance close to Shannon's limit. Therefore, in the present study, watermark detection rates when the watermarks were coded combined with and without LDPC coding were evaluated through computer simulations and experiments in a real room. The results showed that employing LDPC coding raised the watermark detection rate by around 15 percentage points for an additive white Gaussian noise and by around 20 points from around 60% to around 80% in an actual reverberation environment.
Anytime Classification Using the Nearest Neighbor Algorithm with Applications to Stream Mining
Authors: Ken Ueno, Xiaopeng Xi, Eamonn Keogh, Dah-Jye Lee
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

For many real world problems we must perform classification under widely varying amounts of computational resources. For example, if asked to classify an instance taken from a bursty stream, we may have from milliseconds to minutes to return a class prediction. For such problems an anytime algorithm may be especially useful. In this work we show how we can convert the ubiquitous nearest neighbor classifier into an anytime algorithm that can produce an instant classification, or if given the luxury of additional time, can utilize the extra time to increase classification accuracy. We demonstrate the utility of our approach with a comprehensive set of experiments on data from diverse domains.
High-performance switching based on buffered crossbar fabrics
Authors: Lotfi Mhamdi, Mounir Hamdi, Christopher Kachris, Stephan Wong, Stamatis Vassiliadis
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

As buffer-less crossbar scheduling algorithms reach their practical limitations due to higher port numbers and data rates, internally buffered crossbar (IBC) switches have gained a lot of interest recently due to their great potential in solving the complexity and scalability issues faced by their buffer-less predecessors. The IBC switching architecture combined with the virtual output queueing (VOQ) architecture was shown, through distributed scheduling algorithms, to be able to sustain the current and expected increases in Internet throughput rates. Due to the architectural similarity between the input queued (IQ) and IBC switches, all the algorithms proposed for the latter were just a simple mapping of earlier algorithms proposed for the former. In this paper, we propose a set of scheduling schemes that are purely advocated for the VOQ/IBC switch architecture. We first address the issue of the internal buffers importance in the arbitration process. We propose a weighted scheduling algorithm, named Critical internal Buffer First (CBF), which takes full advantage of the internal buffer elements and makes its decision exclusively on the internal buffer information. Second, in order to simplify the scheduling scheme and make it practical, we propose a class of scheduling algorithms, named Current Arrival First-Priority Removal (CAF-PRMV) that use priority levels instead of weights. We argue that the interaction, through the internal buffer element, between the input and output schedulers is very important in designing such practical and highly scalable schemes for the IBC switching architecture. Our hardware implementation, in reconfigurable logic, shows that our CAF-PRMV class of algorithms can sustain a 10 Gbps line speed for a 32 × 32 VOQ/IBC switch.
A new 8-node quadrilateral spline finite element
Authors: Chong-Jun Li, Ren-Hong Wang
Venue: Journal of Computational and Applied Mathematics (2006)

By using bivariate quadratic splines on triangulated quadrangulations (or FVS triangulations), we construct a new 8-node quadrilateral element, which reproduces polynomials of degree 2, and possesses second-order completeness in Cartesian coordinates. The computation of derivatives, integrals and products of the element shape functions can be simplified greatly by using their Bézier coefficients on each triangle cell. Some appropriate examples are employed to evaluate the performance of the proposed element. The numerical results show that the new spline element is superior to the standard 8-node isoparametric element, and is comparable to some other 8-node quadrilateral elements.
Guest Editor's Introduction: Computational Photography-The Next Big Step
Authors: Oliver Bimber
Venue: Computer (2006)

Computational photography extends digital photography by providing the capability to record much more information and by offering the possibility of processing this information afterward.
Mobile broadband evolution: from controversy to convergence
Authors: Andrew J. Viterbi
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

Wireless personal communication has existed for about a quarter century. In the 1980's analog FDMA served a small mostly North American base of wireless telephony users. The 1990's witnessed the start of widespread worldwide digital telephony and limited data service, categorized as 2nd Generation, employing two conflicting technologies, TDMA and CDMA. The first decade of the new century brought full wireless data and Internet connectivity with two competing 3rd Generation CDMA implementations: CDMA2000 and WCDMA. For the second decade beginning in 2010, early indications point to convergence upon a single 4th Generation high speed data technology, OFDMA, generally referred to as Mobile WiMax for which a standard 802.16e has recently been adopted. After describing this historical evolution, we shall address the challenges and opportunities of both 3rd and 4th Generation Wireless Broadband service.
A Database-Reduction-Based Algorithm for Episode Mining
Authors: Yunlan Wang, Xingshe Zhou, Peiqi Liu
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Event Sequence arises naturally in many applications. Episode mining can discovery the knowledge hidden in the event sequence. Currently, the most influential algorithm for episode mining is WINEPI. However, it is likely to suffer from the tendency of generating too many of candidate episodes. In this paper, a novel algorithm named DRE for mining frequent episodes is presented. It studied the conditions for the events which can be pruned from the database, so the size of database is reduced gradually. The performance of algorithm DRE was evaluated and compared with WINEPI algorithm. The results demonstrate that the DRE has better performance.
Context-parametric polykinded types
Authors: Pablo Nogueira
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming (2006)

Generic Haskell is a language extension of Haskell for polytypic programming. Constrained types are parametric algebraic types with at least one argument constrained by type-class membership. We explain Generic Haskell, discuss the relevance of constrained types, and show that they are not supported by Generic Haskell. We propose context-parametric polykinded types as a solution, thereby making polytypic functions generic on a larger class of types. Our proposal entails an extension to the Generic Haskell compiler, not the language, and is therefore transparent to the generic programmer.
Slides, sushi, and sixth-graders: a case study of elementary student art-based learning in a museum setting
Authors: Sandra Toro Martell
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This poster presents findings from an ethnographic study about elementary students' art-based learning in accordance with students' personal, physical, and sociocultural contexts of learning (Falk and Dierking, 2000). Findings include that while art activities integrated learning about Japanese art history and aesthetics and engaging in artistic production by creating sushi and watercolors, as a community of practice, (Hapgood and Palincsar, 2002,) the group engaged in traditional classroom-based behavior and conversational structures (Cazden, 1988; Phillips, 1972).
Identifying and Blocking Pornographic Content
Authors: W. H. Ho, P. A. Watters
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Content filtering on the WWW is significant social issue, since children can easily access pornography and other illegal material with ease. In this study, a descriptive and predictive model of pornographic web page characteristics was developed, to assist with recognition of pornographic pages in a content filter. Support and confidence results from simple association rules suggest that using individual terms to identify pornographic web pages is useful for description, but unreliable for prediction. However, Bayesian classification provided 99.1% accuracy in classifying test pages from both pornographic and non-pornographic corpora. The challenges for multimodal filtering are discussed.
Multimedia Group Synchronization Algorithm Based on RTP/RTCP
Authors: Fernando Boronat Segui, Juan Carlos Guerri Cebollada, Jaime Lloret Mauri
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Most of actual multimedia tools use RTP/RTCP for inter-stream synchronization, but not for group synchronization. In this paper we describe and evaluate a proposal of modification of RTCP packets to provide a sender-based method for synchronization of a group of receivers.
A Locality-Driven Atomic Group Checkpoint Protocol
Authors: Zunce Wei, Hon F. Li, Dhrubajyoti Goswami
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

This paper explores the use of locality of dependen-cies in large-scale distributed systems towards devel-oping efficient checkpoint strategies. Dependencies among processes evolve into message interactions, which often spread and affect recovery dependencies and logging requirements. On the other hand, message interactions are usually localized within small sub-regions formed in space and time. Aiming at both minimizing message logging and localizing recovery effect, we propose a strategy that forms group check-points around such regions and meanwhile selectively logs inter-region messages. A simple and efficient Atomic Group Checkpoint (AGC) protocol is devel-oped based on the locality information of a distributed computation, e.g., in agent communication protocol sessions in multi-agent systems. Atomicity guarantees consistency of group checkpoint and uniformity of group logging, and hence minimizes logging overhead. The correctness of the AGC protocol is analyzed and proved through a generic Checkpoint Dependency Graph (CDG) model, which captures the recovery dependency relations among checkpoints.
A model for video-based virtual field experience
Authors: Ugur Kale, Jung Won Hur, Theano Yerasimou, Thomas Brush
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The purpose of this project is to introduce a model of using video-based virtual field experiences for pre-service teachers mainly in social studies. Although video-based virtual fields become more practical for pre-service teachers to observe various teaching situations, the use of such video-based classroom cases may be limited to provide meaningful experiences. This paper presents four key affordances of a model that may alleviate such limitations.
Gait analyzer based on a cell phone with a single three-axis accelerometer
Authors: Toshiki Iso, Kenichi Yamazaki
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

We propose a fuss-free gait analyzer based on a single three-axis accelerometer mounted on a cell phone for health care and presence services. It is not necessary for users not to wear sensors on any part of their bodies; all they need to do is to carry the cell phone. Our algorithm has two main functions; one is to extract feature vectors by analyzing sensor data in detail using wavelet packet decomposition. The other is to flexibly cluster personal gaits by combining a self-organizing algorithm with Bayesian theory. Not only does the three-axis accelerometer realize low cost personal devices, but we can track aging or situation changes through on-line learning. A prototype that implements the algorithm is constructed. Experiments on the prototype show that the algorithm can identify gaits such as walking, running, going up/down stairs, and walking fast with an accuracy of about 80%.
Inferring Facial Action Units with Causal Relations
Authors: Yan Tong, Wenhui Liao, Qiang Ji
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

A system that could automatically analyze the facial actions in real time have applications in a number of different fields. However, developing such a system is always a challenging task due to the richness, ambiguity, and dynamic nature of facial actions. Although a number of research groups attempt to recognize action units (AUs) by either improving facial feature extraction techniques, or the AU classification techniques, these methods often recognize AUs individually and statically, therefore ignoring the semantic relationships among AUs and the dynamics of AUs. Hence, these approaches cannot always recognize AUs reliably, robustly, and consistently. In this paper, we propose a novel approach for AUs classification, that systematically accounts for relationships among AUs and their temporal evolution. Specifically, we use a dynamic Bayesian network (DBN) to model the relationships among different AUs. The DBN provides a coherent and unified hierarchical probabilistic framework to represent probabilistic relationships among different AUs and account for the temporal changes in facial action development. Under our system, robust computer vision techniques are used to get AU measurements. And such AU measurements are then applied as evidence into the DBN for inferencing various AUs. The experiments show the integration of AU relationships and AU dynamics with AU image measurements yields significant improvements in AU recognition.
Robust controllability of interval fractional order linear time invariant systems
Authors: YangQuan Chen, Hyo-Sung Ahn, Dingyü Xue
Venue: Signal Processing (2006)

We consider uncertain fractional-order linear time invariant (FO-LTI) systems with interval coefficients. Our focus is on the robust controllability issue for interval FO-LTI systems in state-space form. We revisit the controllability problem for the case when there is no interval uncertainty. It turns out that the controllability check for FO-LTI systems amounts to checking the controllability of conventional integer order state space. Based on this fact, we further show that, for interval FO-LTI systems, the key is to check the linear dependency of a set of interval vectors. Illustrative examples are presented.
Adaptive Compensated Dynamic Inversion Control for a Helicopter with Approximate Mathematical Model
Authors: Shuo Zeng, Jihong Zhu
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

This paper presents an effective method to achieve altitude and attitude (pitch, roll and yaw) control of a helicopter in hovering and low-speed forward flight conditions with an approximate mathematical model. To facilitate control design, a simplified multi-inputmulti- output (MIMO) affine nonlinear model that describes the angular rate responses of a helicopter is derived. The controller consists of two separated parts: altitude loop and attitude loop. A PID controller is used in the altitude loop and a dynamic inversion controller is used in the attitude loop. To compensate the dynamic inversion error caused by modeling uncertainties and disturbances, an adaptive compensating algorithm is employed. Simulation results of a YAMAHA R-50 unmanned helicopter simulation model show that the algorithm is stable and robust with good tracking performance and decoupling capability.
Building Interest-Oriented Web Search Union
Authors: Yonghua Zhang, Feng Hong, Minglu Li, Guangtao Xue
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

The variance of user interest is a significant factor for designing peer-to-peer content-based retrieval system which leads to the birth of this paper. This paper gives the preliminary scheme to solve the problem of web search of Internet scale. All the personalized peers form an interest-oriented web server union (IOWSU) by employing structured P2P routing mechanism. After a query request from a peer is posted to the union, an optimized and deterministic result based on the search peer's interest is returned from the union. The result of our simulation demonstrates the method proposed in this paper is practicable and efficient.
AI and Science's Lost Realm
Authors: Colin Hales
Venue: IEEE Intelligent Systems (2006)

An empirical scientific treatment of science identifies anomalous beliefs by science about itself. The effect of these is depicted as having a role in thwarting access to a physics of phenomenal consciousness. To remove the anomalies a dual-aspect framework for science is proposed. The implication for AI is that if science continues under the old framework, AI may be unwittingly enrolled in science's anomalous belief system. AI performance expectations may therefore be impacted for unjustified reasons.This article is part of a special issue on the Future of AI.
Iterative Local-Global Energy Minimization for Automatic Extraction of Objects of Interest
Authors: Gang Hua, Zicheng Liu, Zhengyou Zhang, Ying Wu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

We propose a novel global-local variational energy to automatically extract objects of interest from images. Previous formulations only incorporate local region potentials, which are sensitive to incorrectly classified pixels during iteration. We introduce a global likelihood potential to achieve better estimation of the foreground and background models and, thus, better extraction results. Extensive experiments demonstrate its efficacy.