ppxscal/embedding_network huggingface dataset:
GnuStream: a P2P media streaming system prototype
Authors: Xuxian Jiang, Yu Dong, Dongyan Xu, B. Bhargava
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

We present the design and prototype of GnuStream, a peer- to-peer (P2P) and receiver-driven media streaming system. GnuStream is built on top of Gnutella, and it integrates dynamic peer location and streaming capacity aggregation. Each GnuStream streaming session is controlled by the receiver peer and involves a dynamic set of peer senders instead of one fixed sender. The receiver aggregates streaming bandwidth from the multiple senders, achieving load distribution and fast reaction to sender capacity and on/off-line status changes. The effectiveness of GnuStream is demonstrated by our experiments with its prototype, which serves as the basis for real-world development and evaluation of resilient P2P media streaming services.
Identity Representability of Facial Expressions: An Evaluation Using Feature Pixel Distributions
Authors: Qi Li, Chandra Kambhamettu
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

The study on how to represent appearance instances was the focus in most previous work in face recognition. Little attention, however, was given to the problem of how to select "good" instances for a gallery, which may be called the facial identity representation problem. This paper gives an evaluation of the identity representability of facial expressions. The identity representability of an expression is measured by the recognition accuracy achieved by using its samples as the gallery data. We use feature pixel distributions to represent appearance instances. A feature pixel distribution of an image is based on the number of occurrence of detected feature pixels (corners) in regular grids of an image plane. We propose imbalance oriented redundancy reduction for feature pixel detection. Our experimental evaluation indicates that certain facial expressions, such as the neutral, have stronger identity representability than other expressions, in various feature pixel distributions.
Resource-Efficient Routing and Scheduling of Time-Constrained Network-on-Chip Communication
Authors: Sander Stuijk, Twan Basten, Marc Geilen, Amir Hossein Ghamarian, Bart Theelen
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Network-on-chip-based multiprocessor systems-onchip are considered as future embedded systems platforms. One of the steps in mapping an application onto such a parallel platform involves scheduling the communication on the network-on-chip. This paper presents different scheduling strategies that minimize resource usage by exploiting all scheduling freedom offered by networks-on-chip. Our experiments show that resource-utilization is improved when compared to existing techniques.
Topology control, routing protocols and performance evaluation for mobile wireless ad hoc networks
Authors: Yi Pan
Venue:  (2005)

A mobile ad-hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the support of any established infrastructure or centralized administration. There are many potential applications based the techniques of MANETs, such as disaster rescue, personal area networking, wireless conference, military applications, etc. MANETs face a number of challenges for designing a scalable routing protocol due to their natural characteristics. Guaranteeing delivery and the capability to handle dynamic connectivity are the most important issues for routing protocols in MANETs. In this dissertation, we will propose four algorithms that address different aspects of routing problems in MANETs. Firstly, in position based routing protocols to design a scalable location management scheme is inherently difficult. Enhanced Scalable Location management Service (EnSLS) is proposed to improve the scalability of existing location management services, and a mathematical model is proposed to compare the performance of the classical location service, GLS, and our protocol, EnSLS. The analytical model shows that EnSLS has better scalability compared with that of GLS. Secondly, virtual backbone routing can reduce communication overhead and speedup the routing process compared with many existing on-demand routing protocols for routing detection. In many studies, Minimum Connected Dominating Set (MCDS) is used to approximate virtual backbones in a unit-disk graph. However finding a MCDS is an NP-hard problem. In the dissertation, we develop two new pure localized protocols for calculating the CDS. One emphasizes forming a small size initial near-optimal CDS via marking process, and the other uses an iterative synchronized method to avoid illegal simultaneously removal of dominating nodes. Our new protocols largely reduce the number of nodes in CDS compared with existing methods. We show the efficiency of our approach through both theoretical analysis and simulation experiments. Finally, using multiple redundant paths for routing is a promising solution. However, selecting an optimal path set is an NP hard problem. We propose the Genetic Fuzzy Multi-path Routing Protocol (GFMRP), which is a multi-path routing protocol based on fuzzy set theory and evolutionary computing.
3D Face Recognition Using 3D Alignment for PCA
Authors: Trina Russ, Chris Boehnen, Tanya Peters
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

This paper presents a 3D approach for recognizing faces based on Principal Component Analysis (PCA). The approach addresses the issue of proper 3D face alignment required by PCA for maximum data compression and good generalization performance for new untrained faces. This issue has traditionally been addressed by 2D data normalization, a step that eliminates 3D object size information important for the recognition process. We achieve correspondence of facial points by registering a 3D face to a scaled generic 3D reference face and subsequently perform a surface normal search algorithm. 3D scaling of the generic reference face is performed to enable better alignment of facial points while preserving important 3D size information in the input face. The benefits of this approach for 3D face recognition and dimensionality reduction have been demonstrated on components of the Face Recognition Grand Challenge (FRGC) database versions 1 and 2.
Approximating weighted matchings in parallel
Authors: Stefan Hougardy, Doratha E. Vinkemeier
Venue: Information Processing Letters (2006)

We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ε), This improves the previously best approximation ratio of (1/2 - ε) of an NC algorithm for this problem.
Peer-to-Peer Knowledge Sharing in Collaboration Supported VirtualLearning Communities
Authors: Irene Y. L. Chen, Stephen J. H. Yang
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In this paper, we apply peer-to-peer and instant messenger for the augmentation of knowledge sharing in collaboration supported virtual learning communities. We enhance current peer-to-peer and instant messenger with content quality control and social network to further improve content discovery and group discussion. Content found by peer-to-peer is referred to accessible explicit knowledge, while the discussion and interaction details recorded in instant messenger is referred to tacit knowledge. Results of this study demonstrate that with our enhanced mechanism, it can help learners find relevant content as well as knowledgeable collaborators who are willing to share their knowledge.
Resource Management for Networked Classifiers in Distributed Stream Mining Systems
Authors: Deepak S. Turaga, Olivier Verscheure, Upendra V. Chaudhari, Lisa D. Amini
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Networks of classifiers are capturing the attention of system and algorithmic researchers because they offer improved accuracy over single model classifiers, can be distributed over a network of servers for improved scalability, and can be adapted to available system resources. This work provides a principled approach for the optimized allocation of system resources across a networked chain of classifiers. We begin with an illustrative example of how complex classification tasks can be decomposed into a network of binary classifiers. We formally define a global performance metric by recursively collapsing the chain of classifiers into one combined classifier. The performance metric trades off the end-to-end probabilities of detection and false alarm, both of which depend on the resources allocated to each individual classifier. We formulate the optimization problem and present optimal resource allocation results for both simulated and state-of-the-art classifier chains operating on telephony data.
Composite Templates for Cloth Modeling and Sketching
Authors: Hong Chen, Zi Jian Xu, Zi Qiang Liu, Song Chun Zhu
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Cloth modeling and recognition is an important and challenging problem in both vision and graphics tasks, such as dressed human recognition and tracking, human sketch and portrait. In this paper, we present a context sensitive grammar in an And-Or graph representation which will produce a large set of composite graphical templates to account for the wide variabilities of cloth configurations, such as T-shirts, jackets, etc. In a supervised learning phase, we ask an artist to draw sketches on a set of dressed people, and we decompose the sketches into categories of cloth and body components: collars, shoulders, cuff, hands, pants, shoes etc. Each component has a number of distinct subtemplates (sub-graphs). These sub-templates serve as leafnodes in a big And-Or graph where an And-node represents a decomposition of the graph into sub-configurations with Markov relations for context and constraints (soft or hard), and an Or-node is a switch for choosing one out of a set of alternative And-nodes (sub-configurations) - similar to a node in stochastic context free grammar (SCFG). This representation integrates the SCFG for structural variability and the Markov (graphical) model for context. An algorithm which integrates the bottom-up proposals and the topdown information is proposed to infer the composite cloth template from the image.
Finite volume treatment of dispersion-relation-preserving and optimized prefactored compact schemes for wave propagation
Authors: Mihaela Popescu, Wei Shyy, Marc Garbey
Venue: Journal of Computational Physics (2005)

In developing suitable numerical techniques for computational aero-acoustics, the dispersion-relation-preserving (DRP) scheme by Tam and co-workers and the optimized prefactored compact (OPC) scheme by Ashcroft and Zhang have shown desirable properties of reducing both dissipative and dispersive errors. These schemes, originally based on the finite difference, attempt to optimize the coefficients for better resolution of short waves with respect to the computational grid while maintaining pre-determined formal orders of accuracy. In the present study, finite volume formulations of both schemes are presented to better handle the nonlinearity and complex geometry encountered in many engineering applications. Linear and nonlinear wave equations, with and without viscous dissipation, have been adopted as the test problems. Highlighting the principal characteristics of the schemes and utilizing linear and nonlinear wave equations with different wavelengths as the test cases, the performance of these approaches is documented. For the linear wave equation, there is no major difference between the DRP and OPC schemes. For the nonlinear wave equations, the finite volume version of both DRP and OPC schemes offers substantially better solutions in regions of high gradient or discontinuity.
Using workflow business process tools in simulation modeling
Authors: John G. Everton, Richard D. Stafford
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This article will present several model automation strategies used to improve the modeling operations such as data maintenance, model analysis and model visualization. There are several new products that have emerged in academics and industry that help reduce the costs of simulation and provide a solution that obtains more ROI from a new and/or existing simulation model. In addition these modeling techniques provide the capability to make models an operational component of a manufacturing system. As an operational component, models can provide planned work schedules, prediction estimates, and an operational decision tool that engineers and managers can used in making better operational decisions.
Steady-state simulation analysis using ASAP3
Authors: Natalie M. Steiger, Emily K. Lada, James R. Wilson, Jeffrey A. Joines, Christos Alexopoulos, David Goldsman
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We discuss ASAP3, a refinement of the batch means algorithms ASAP and ASAP2. ASAP3 is a sequential procedure designed to produce a confidence-interval estimator for the expected response of a steady-state simulation that satisfies user-specified precision and coverage-probability requirements. ASAP3 operates as follows: the batch size is increased until the batch means pass the Shapiro-Wilk test for multivariate normality; and then ASAP3 fits a first-order autoregressive (AR(1)) time series model to the batch means. If necessary, the batch size is further increased until the autoregressive parameter in the AR(1) model does not significantly exceed 0.8. Next ASAP3 computes the terms of an inverse Cornish-Fisher expansion for the classical batch means t-ratio based on the AR(1) parameter estimates; and finally ASAP3 delivers a correlation-adjusted confidence interval based on this expansion. ASAP3 compared favorably with other batch means procedures (namely, ABATCH, ASAP, ASAP2, and LBATCH) in an extensive experimental performance evaluation.
Calibrating credit portfolio loss distributions
Authors: Menghui Cao, William J. Morokoff
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Determination of credit portfolio loss distributions is essential for the valuation and risk management of multi-name credit derivatives such as CDOs. The default time model has recently become a market standard approach for capturing the default correlation, which is one of the main drivers for the portfolio loss. However, the default time model yields very different default dependency compared with a continuous-time credit migration model. To build a connection between them, we calibrate the correlation parameter of a single-factor Gaussian copula model to portfolio loss distribution determined from a multi-step credit migration simulation. The deal correlation is produced as a measure of the portfolio average correlation effect that links the two models. Procedures for obtaining the portfolio loss distributions in both models are described in the paper and numerical results are presented.
Invited Paper: Middleware for Next Generation Distributed Systems: Main Challenges and Perspectives
Authors: Guy Bernard
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

In the recent past, the scope of distributed systems has drastically changed. Advances in device miniaturization and wireless networking have made distributed systems components evolve from workstations and servers linked by wired networks, to internet of things linked by a variety of networks. Middleware technology designed for legacy distributed systems is no longer suitable to these new kinds of distributed systems. In this paper we describe the main challenges raised by this evolution, with stress put on ad hoc, spontaneous and sensor systems. A survey of the current state of the art will be given, together with major pending issues and perspectives in the domain.
The Power of the Defender
Authors: Marina Gelastou, Marios Mavronicolas, Vicky Papadopoulou, Anna Philippou, Paul Spirakis
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

We consider a security problem on a distributed network. We assume a network whose nodes are vulnerable to infection by threats (e.g. viruses), the attackers. A system security software, the defender, is available in the system. However, due to the network's size, economic and performance reasons, it is capable to provide safety, i.e. clean nodes from the possible presence of attackers, only to a limited part of it. The objective of the defender is to place itself in such a way as to maximize the number of attackers caught, while each attacker aims not to be caught. In [7], a basic case of this problem was modeled as a non-cooperative game, called the Edge model. There, the defender could protect a single link of the network. Here, we consider a more general case of the problem where the defender is able to scan and protect a set of k links of the network, which we call the Tuple model. It is natural to expect that this increased power of the defender should result in a better quality of protection for the network. Ideally, this would be achieved at little expense on the existence and complexity of Nash equilibria (profiles where no entity can improve its local objective unilaterally by switching placements on the network). In this paper we study pure and mixed Nash equilibria in the model. In particular, we propose algorithms for computing such equilibria in polynomial time and we provide a polynomial-time transformation of a special class of Nash equilibria, called matching equilibria, between the Edge model and the Tuple model, and vice versa. Finally, we establish that the increased power of the defender results in higher-quality protection of the network.
Generating Surface Textures based on Cellular Networks
Authors: Stephane Gobron, Denis Finck
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

This paper describes a method allowing the automatic multi-texturing and simulation of surface imperfections based on a cellular network. In this representation, networks of connected cells are constructed in a natural and dynamic way allowing simultaneously real-time and multi-behavior simulation. We also introduce an original technique to store cells in space in a fast and boundless manner without any waste of memory. To show the efficiency of our model, a set of detailed surface aspect simulations is presented, including water painting propagation, crack-pattern texture, destructive effects, and melting-like simulation.
Quick multivariate kernel density estimation for massive data sets: Research Articles
Authors: K. F. Cheng, C. K. Chu, Dennis K. J. Lin
Venue: Applied Stochastic Models in Business and Industry (2006)

Massive data sets are becoming popular in this information era. Due to the limitation of computer memory space and the computing time, the kernel density estimation for massive data sets, although strongly demanding, is rather challenging. In this paper, we propose a quick algorithm for multivariate density estimation which is suitable for massive data sets. The term quick is referred to indicate the computing ease. Theoretical properties of the proposed algorithm are developed. Its empirical performance is demonstrated through a credit card example and numerous simulation studies. It is shown that in addition to its computational ease, the proposed algorithm is as good as the traditional methods (for the situations where these traditional methods are feasible). Copyright &copy; 2006 John Wiley & Sons, Ltd.
From PRIMI to PRIMIFaces: Technical Concepts for Selective Information Disclosure
Authors: Tom Gross, Christoph Oemig
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

Instant messaging platforms facilitate coordination in workgroups by providing users with mutual information on their presence and availability, allowing for ad-hoc conversations with little disturbance. For this purpose they typically capture, process, and present information from and to the users involved. Thereby, they have to address a fundamental trade-off: on the one hand users want and need up-to-the-minute information about each other, yet on the other hand the users whose information is captured have a legitimate right for privacy and the users whom the information is presented have a legitimate need for avoiding frequent disruptions. In this paper we present advanced technical concepts for selective information disclosure. We introduce the concept of face-based instant messaging platforms that allow end-users on one side to flexibly integrate static and dynamic data sources, and to easily specify their preferences as to the data to be shared as well as the granularity and the timing of the sharing, and on the other side to easily specify their preferences for notification.
Towards Integrated Query Processing for Object-Relational and XML Data Sources
Authors: Iryna Kozlova, Norbert Ritter, Olga Reimer
Venue: Proceedings of the 10th International Database Engineering and Applications Symposium (2006)

The recently increased amount of information stored in XML format has lead to the development and wide deployment of so-called native XML database management systems (XML DBMS). In parallel, (object-)relational DBMS remain well known, approved and widely used for persistent storage of data. There are many research and industrial areas, including virtual enterprises, Web portals, digital libraries, data management systems, etc., where applications need to manage both (object-) relational DBMS and XML DBMS to retrieve information from these kinds of data sources. This has created a need for integrated access to (object-)relational and XML data sources. The focus of our investigation in this context comprises design and development of an integration middleware between the application and the data sources, allowing unified access to the entire information for SQL- and XML-based applications. In this paper, we propose a query processing technique supporting integrated access to (object-)relational and XML data sources via both query languages, SQL and XQuery. The local data sources under integration can be queried from the corresponding unified global views, an SQL-View (for SQL-based applications) as well as an XML-View (for XML-based applications), both offering access to the entire integrated information.