ppxscal/embedding_network huggingface dataset:
LazyCut: content-aware template-based video authoring
Authors: Xian-Sheng Hua, Zengzhi Wang, Shipeng Li
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Though there are many commercial video authoring tools available today, video authoring remains as a tedious and extremely time consuming task that often requires trained professional skills. To tackle this issue, this demonstration presents a novel end-to-end system, called LazyCut, which enables fast, flexible and personalized video authoring and sharing. LazyCut provides a semi-automatic video authoring and sharing system that significantly reduces users' efforts in video editing while preserving sufficient flexibility and personalization.
Discovery of Repetitive Patterns in DNA with Accurate Boundaries
Authors: Jie Zheng, Stefano Lonardi
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

The accurate identification of repeats remains a challenging open problem in bioinformatics. Most existing methods of repeat identification either depend on annotated repeat databases or restrict repeats to pairs of similar sequences that are maximal in length. The fundamental flaw in most of the available methods is the lack of a definition that correctly balances the importance of the length and the frequency. In this paper, we propose a new definition of repeats that satisfies both criteria. We give a novel characterization of the building blocks of repeats, called elementary repeats, which leads to a natural definition of repeat boundaries. We design efficient algorithms and test them on synthetic and real biological data. Experimental results show that our method is highly accurate.
Does Over-Provisioning Become More or Less Efficient as Networks Grow Larger?
Authors: Yaqing Huang, Roch Guerin
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

IP networks have seen tremendous growth in not only their size and speed, but also in the volume of traffic they carry. Over-provisioning is commonly used to protect network performance against traffic variations, be they caused by failures or transient surges. This paper investigates the influence that increasing network size has on the efficacy of over-provisioning in absorbing a certain range of traf- fic variations and preserving performance guarantees. For that purpose, we develop a general model that accounts for network topology, base offered traffic, and traffic variations, and allows us to explore how their combination behaves as the network and the traffic it carries grow. The model¿s generality enables us to investigate several representative scenarios and to identify critical thresholds in the relation between network and traffic growth, which delineate regions where a given amount of over-provisioning provides increasingly better protection against traffic variations. The results offer insight into how to grow IP networks in order to enhance their robustness.
Performance evaluation of the mobile peer-to-peer service
Authors: I. Gruber, R. Schollmeier, W. Kellerer
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

The utilization of peer-to-peer (P2P) overlay networks on mobile ad hoc networks (MANET) introduces new services and possibilities such as content based routing and location based services (LBS). A simple layering of both networks is inefficient and does not scale well because the virtual P2P overlay network does not match the frequently changing physical network topology of the MANET. The mobile peer-to-peer (MPP) protocol stack offers a very promising concept by introducing a cross-layer communication channel between the physical network layer and the virtual P2P network layer. This reduces significantly the messaging overhead and increases the search success rate, as we can prove in this work. Therefore, we describe an implementation of the MPP protocol stack in the Network Simulator 2 (ns-2). With this implementation, we prove the significant performance improvements which can be achieved with MPP, to allow P2P networking in mobile ad hoc environments.
A strategy for efficient verification of relational specifications, based on monotonicity analysis
Authors: Marcelo F. Frias, Rodolfo Gamarra, Gabriela Steren, Lorena Bourg
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

We introduce a strategy for the verification of relational specifications based on the analysis of monotonicity of variables within formulas. By comparing with the Alloy Analyzer, we show that for a relevant class of problems this technique drastically outperforms analysis of the same problems using SAT-solvers, while consuming a fraction of the memory SAT-solvers require.
Improved estimation of regression parameters in measurement error models
Authors: H. M. Kim, A. K. Md. Ehsanes Saleh
Venue: Journal of Multivariate Analysis (2005)

The problem of simultaneous estimation of the regression parameters in a multiple regression model with measurement errors is considered when it is suspected that the regression parameter vector may be the null-vector with some degree of uncertainty. In this regard, we propose two sets of four estimators, namely, (i) the unrestricted estimator, (ii) the preliminary test estimator, (iii) the Stein-type estimator and (iv) the postive-rule Stein-type estimator. In an asymptotic setup, properties of these estimators are studied based on asymptotic distributional bias, MSE matrices, and risks under a quadratic loss function. In addition to the asymptotic dominance of the Stein-type estimators, the paper contains discussion of dominating confidence sets based on the Stein-type estimation. Asymptotic analysis is considered based on a sequence of local alternatives to obtain the desired results.
3DSim: rapid prototyping ambient intelligence
Authors: Ali A. Nazari Shirehjini, Felix Klar
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

The present paper introduces 3DSim, a tool for rapid prototyping Ambient Intelligence, applications. A major feature of this work is the use of a 3D-based virtual environment to represent an intelligent meeting space allowing for prototyping a number of components such as lights, blinds, SMART Boards&trade; large display walls, projectors, aware chairs, and humans as well as human activity animation. As a result of using standardized interfaces, any UPnP control point may be used to invoke actions on virtual, UPnP devices. Such devices are dynamically inserted to the environment and can be removed at run-time. Data delivered by sensors is interpreted by an environment monitoring component which routes higher-level atomic context information to virtual objects. As a result of invoked device actions and gathered context information, resulting state changes (e.g., switching light states) are visualized within the scene.
Shape Shifting Tries for Faster IP Route Lookup
Authors: Haoyu Song, Jonathan Turner, John Lockwood
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithms grows in proportion to the address length, making them less attractive for IPv6. This paper describes and evaluates a new data structure called a shape-shifting trie, in which the data structure nodes correspond to arbitrarily shaped subtrees of the underlying binary trie for a given set of address prefixes. The ability to adapt the node shape to the trie reduces the number of nodes that must be accessed to perform a lookup, especially for tries with large sparse regions. We give a fast algorithmfor optimally dividing a trie into nodes so as to minimize the maximum lookup depth. We show that seven data structure accesses are suffi- cient for route tables with more than 150,000 IPv6 prefixes. This makes it possible to achieve wire-speed processing for OC192 link using a single QDRII SRAM chip.
Patch scheduling for on-line games
Authors: Chris Chambers, Wu-chang Feng
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

One of the challenges facing the on-line gaming community is the delivery of new content to players. While the initial distribution of a game is typically done via large media formats such as CD-ROM or DVD-ROM, consumers expect regular updates to on-line games such as bug fixes, balance adjustments, and new content. In this paper, we develop a model for the bandwidth impact of patch delivery based on the time of day of the patch release. We evaluate our model against the Steam content delivery network and determine the best time to release a patch to be midway between the peak and trough of daily player load.
A Matched FIR Filter Bank for Audio Coding.
Authors: Rodrigo Capobianco Guido, Lucimar Sasso Vieira, Fabrycio Lopes Sanchez, Jan Frans Willem Slaets, Lyrio Onofre Almeida, Adilson Gonzaga, Marcelo Bianchi
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

This paper describes a novel technique for audio coding, a lossy compression algorithm, that considers perceptual and rate-distortion criteria. It is based on matched finite impulse response (FIR) wavelet-packet-like filter banks, the filter coefficients being produced adaptively according to the input signal. This technique achieves perceptually transparent coding of high-quality audio, signals sampled at 44.1 KHz - 16 bits PCM, at bit rates of about 54 - 64 Kbps. The matched filter-bank makes a time-frequencyshape analysis, reducing the number of sub-bands requiring quantization. The decoder that implements this algorithm works effectively in real time. This reassures the efficacy of our technique.
Dempster-Shafer Theory for Intrusion Detection in Ad Hoc Networks
Authors: Thomas M. Chen, Varadharajan Venkataramanan
Venue: IEEE Internet Computing (2005)

Without a fixed security infrastructure, mobile ad hoc networks must distribute intrusion detection among their nodes. But even though a distributed intrusion detection system can combine data from multiple nodes to estimate the likelihood of an intrusion, the observing nodes might not be reliable. The Dempster-Shafer theory of evidence is well suited for this type of problem because it reflects uncertainty. Moreover, Dempster¿s rule for combination gives a numerical procedure for fusing together multiple pieces of evidence from unreliable observers. The authors review the Dempster-Shafer theory in the context of distributed intrusion detection and demonstrate the theory¿s usefulness.
A Method of Generating Massive Virtual Clients and Model-based Performance Test
Authors: Gyu-Baek Kim
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

Testing the performance of a server that handles massive connections requires to generate massive virtual client connections and to model realistic traffic. In this paper, we propose a novel approach to generate massive virtual clients and realistic traffic. Our approach exploits the Windows I/O Completion Port (IOCP), which is the Windows NT Operating System support for developing a scalable, high throughput server, and model-based testing scenarios. We describe implementation details of the proposed approach. Through analysis and experiments, we prove that the proposed method can predict and evaluate performance data more accurately in costeffective way.
Admissible traffic load of real time class of service for inter-domain peers
Authors: Halina Tarasiuk, Robert Janowski, Wojciech Burakowski
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

The paper^1 deals with the problem of assuring predefined QoS for real time (RT) class of service (CoS), which we define as one of inter-provider or inter-domain classes of service in IP network. We propose an analysis and adequate formulas to obtain admissible traffic load in a case when we map two end-to-end classes of service dedicated for telephony CoS and video conference CoS into one inter-domain RT CoS. The aim of the analysis is to determine the admissible load when the target packet loss ratio and buffer size dedicated for RT CoS are known. The proposed solution accounts for the difference between packet sizes of streams generated by voice (about 100 bytes) and video conference (rather 1500 bytes) applications. We illustrate our studies by simulation results.
Tile rewriting grammars and picture languages
Authors: Stefano Crespi Reghizzi, Matteo Pradella
Venue: Theoretical Computer Science (2005)

Tile rewriting grammars (TRG) are a new model for defining picture languages. A rewriting rule changes a homogeneous rectangular subpicture into an isometric one tiled with specified tiles. Derivation and language generation with TRG rules are similar to context-free grammars. A normal form and some closure properties are presented. We prove this model has greater generative capacity than the tiling systems of Giammarresi and Restivo and the grammars of Matz, another generalization of context-free string grammars to 2D. Examples are shown for pictures made by nested frames and spirals.
The impact of internet usage and organizational policy upon managerial decision-making effectiveness in the public sector
Authors: Michael J. Belak
Venue:  (2005)

During the past decade, Internet usage has grown rapidly in the public sector. Today, public sector managers have more information and tools available to them via the Internet than ever before. Recent studies have shown how the Internet exerts a positive influence upon managerial decision-making. However, there is a gap in the current body of knowledge regarding how Internet usage skills and organizational policy for Internet usage impacts managerial decision-making effectiveness in the public sector. This research study investigates the relationship between an individual's Internet usage skills, an organization's support for Internet usage and the decision-making effectiveness of managers in the public sector. For this study, one hundred and sixty-two managers within thirty-four agencies of the District of Columbia, the capital city of the United States, participated in this research effort. This study adopted a non-experimental, correlational research method using an established survey instrument. Quantitative data analysis techniques are employed to assess the problem area, including descriptive statistics, correlation analysis, factor analysis and multiple regression analysis. The findings of this research show that a positive, linear relationship exists between an individual's Internet usage skill and an organization's facilitating conditions for Internet usage with managerial decision-making effectiveness. Seven distinct Internet usage skills were identified that have the strongest impact upon managerial decision-making effectiveness in the public sector. Additionally, the more strategic the management position is within the organization, the greater the impact these usage skills have upon decision-making effectiveness. While no conclusive relationship was identified between an organization's Internet management policy and managerial decision-making effectiveness, a correlation was identified between an organization's Internet management policy and the facilitating conditions for Internet usage. This finding provides a fertile ground for future research efforts. The Internet continues to provide great value for managers in the public sector. Over time, it is anticipated the Internet will continue to evolve, generating new functions capable of providing an even greater impact on managerial decision-making. Future researchers should monitor this situation and work closely with public sector managers to fully capitalize upon these developments.
Design space exploration for aggressive test cost reduction in CircularScan architectures
Authors: B. Arslan, A. Orailoglu
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

Scan-based designs effectively reduce test generation complexity and thus deliver improved fault coverage. Nevertheless, the traditional scan architectures suffer from increased test time and test data volume. The CircularScan architecture (Arslan and Orailoglu) provides a flexible environment for test cost reduction. The new scan design enables the use of the captured response of the previously applied test pattern as a template. The subsequent pattern is loaded by efficiently performing the necessary changes on the template through the functionality provided by the new architecture, conceptually exploiting the inherent low specified bit density of the test patterns. We explore the space of possible design alternatives built on the CircularScan architecture; the design alternatives are presented with accompanying test application methods. The experimental results indicate a substantial test cost reduction, reaching 90% levels. The proposed scheme is not only easily scalable but also promises further reductions in test cost when applied to large state of the art ICs.
Version Control
Authors: Panagiotis Louridas
Venue: IEEE Software (2006)

Although CVS (Concurrent Versions System) is the oldest, it's still the mostly widely used version control system because it's mature, stable, and fielded in a vast corpus of projects. CVS is the standard for comparison among all other VC tools.
Pheromone communication in a robot swarm: necrophoric bee behaviour and its replication
Authors: Anies Hannawati Purnamadjaja, R. Andrew Russell
Venue: Robotica (2005)

This paper describes a project to implement necrophoric bee behaviour in a robot swarm. Pheromone communication is an effective means of coordinating the activities of insect colonies including food gathering, alarm and defense, reproduction and recognition of conspecifics. In a similar manner it is anticipated that pheromones will provide a valuable form of communication between robots. In order to investigate the problems and potential for this form of interaction, it was decided to implement an example of pheromone communication in a physical robotic system. Inspiration for this project came from the necrophoric behaviour of bees. The necrophoric pheromone released by dead bees triggers corpse removal behaviour in passing worker bees. In the context of a robot swarm one of the proposed applications for this behaviour is to locate and rescue disabled robots that release a pheromone as a form of distress signal. This paper provides details of the swarm robots used in the project, their sensors and the simple reactive control algorithm that was developed to mimic the necrophoric behaviour of bees. Results of practical experiments and simulations are also given.
It's Time to Move On
Authors: Bob Colwell
Venue: Computer (2005)

Reflecting on his contributions to the At Random column during the past four years, Bob Colwell concludes that part of the fun of writing is recognizing the interconnections stimulated in real time while communicating.
Face Recognition from a Single Training Image under Arbitrary Unknown Lighting Using Spherical Harmonics
Authors: Lei Zhang, Dimitris Samaras
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

In this paper, we propose two novel methods for face recognition under arbitrary unknown lighting by using spherical harmonics illumination representation, which require only one training image per subject and no 3D shape information. Our methods are based on the recent result which demonstrated that the set of images of a convex Lambertian object obtained under a wide variety of lighting conditions can be approximated accurately by a low-dimensional linear subspace. We provide two methods to estimate the spherical harmonic basis images spanning this space from just one image. Our first method builds the statistical model based on a collection of 2D basis images. We demonstrate that, by using the learned statistics, we can estimate the spherical harmonic basis images from just one image taken under arbitrary illumination conditions if there is no pose variation. Compared to the first method, the second method builds the statistical models directly in 3D spaces by combining the spherical harmonic illumination representation and a 3D morphable model of human faces to recover basis images from images across both poses and illuminations. After estimating the basis images, we use the same recognition scheme for both methods: we recognize the face for which there exists a weighted combination of basis images that is the closest to the test face image. We provide a series of experiments that achieve high recognition rates, under a wide range of illumination conditions, including multiple sources of illumination. Our methods achieve comparable levels of accuracy with methods that have much more onerous training data requirements. Comparison of the two methods is also provided.
Wavelet Approximation-Based Affine Invariant Shape Representation Functions
Authors: Ibrahim El Rube', Maher Ahmed Mohamed Kamel
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

In this paper, new wavelet-based affine invariant functions for shape representation are presented. Unlike the previous representation functions, only the approximation coefficients are used to obtain the proposed functions. One of the derived functions is computed by applying a single wavelet transform; the other function is calculated by applying two different wavelet transforms with two different wavelet families. One drawback of the previously derived detail-based invariant representation functions is that they are sensitive to noise at the finer scale levels, which limits the number of scale levels that can be used. The experimental results in this paper demonstrate that the proposed functions are more stable and less sensitive to noise than the detail-based functions.
Bluetooth-based Indoor Proximity Sensing for Nursing Context Awareness
Authors: Futoshi Naya, Haruo Noma, Ren Ohmura, Kiyoshi Kogure
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

This paper proposes a Bluetooth-based indoor proximity detection method for nursing context awareness. We exploit proximity between Bluetooth devices attached to people and objects for estimating 1) room-level proximity of people and objects, and 2) mutual proximity between moving people and objects. We show that the proximity information exchanged between several devices can be updated at a rate of more than 1 Hz by effectively choosing the timing parameters of Bluetooth inquiry mechanism. Empirical results of evaluating the Receiver Signal Strength Indicator (RSSI) at various distances between devices are also shown.
Adaptive T-spline surface fitting to z-map models
Authors: Jianmin Zheng, Yimin Wang, Hock Soon Seah
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Surface fitting refers to the process of constructing a smooth representation for an object surface from a fairly large number of measured 3D data points. This paper presents an automatic algorithm to construct smooth parametric surfaces using T-splines from z-map data. The algorithm begins with a rough surface approximation and then progressively refines it in the regions where the approximation accuracy does not meet the requirement. The topology of the resulting T-spline surface is determined adaptively based on the local geometric character of the input data and the geometry of the control points is obtained by a least squares procedure. The advantage of the approach is that the resulting surface is C2 continuous and the refinement is essentially local, resulting in a small number of control points for the surface.