ppxscal/embedding_network huggingface dataset:
An integrated NTP-RTCP solution to audio skew detection and compensation for VoIP applications
Authors: H. Melvin, L. Murphy
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

The circuit switched POTS (plain old telephone system) preserves the timing relationship between media samples from sender to receiver through use of a common clock. For PC-based Internet multimedia, the existence of separate audio and system clocks on either end-host can introduce significant complications. Much work has taken place in recent years that addresses the issue of system clock skew and its effect on precise delay measurement. In a voice over IP (VoIP) environment, where adaptive buffering techniques are employed, system and audio clock skew can distort both delay measurement and playout control as well as lead to poor buffer performance. This paper presents a high level mechanism to measure and compensate for the skew relationships between system and audio clocks at each end of a multimedia session. The mechanism utilises both the network time protocol (NTP) and the RTP (realtime transport protocol) control protocol or RTCP. Preliminary and positive results are presented from a testbed system and plans for further work are outlined.
The Role of Prefrontal Cortex in Verbal Episodic Memory: rTMS Evidence
Authors: Marco Sandrini, Stefano F. Cappa, Simone Rossi, Paolo M. Rossini, Carlo Miniussi
Venue: Journal of Cognitive Neuroscience (2003)

Long-term, episodic memory processing is supposed to involve the prefrontal cortex asymmetrically. Here we investigate the role of the dorsolateral prefrontal cortex (DLPFC) in encoding and retrieval of semantically related or unrelated word pairs. Subjects were required to perform a task consisting of two parts: a study phase (encoding), in which word pairs were presented, and a test phase (retrieval), during which stimuli previously presented had to be recognized among other stimuli. Consistently with our previous findings using pictures, repetitive transcranial magnetic stimulation (rTMS) had a significant impact on episodic memory. The performance was significantly disrupted when rTMS was applied to the left or right DLPFC during encoding, and to the right DLPFC in retrieval, but only for unrelated word pairs. These results indicate that the nature of the material to be remembered interacts with the encoding&ndash;retrieval DLPFC asymmetry; moreover, the crucial role of DLPFC is evident only for novel stimuli.
No-commitment branch and bound search for distributed constraint optimization
Authors: Anton Chechetka, Katia Sycara
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modifications for efficiency in a multiagent setting. Two main features of the algorithm are: (a) using different agents to search non-intersecting parts of a search space concurrently, and (b) communicating lower bounds on solution cost every time there is a possibility the bounds might change due to changed variable assignments. The first leads to a better utilization of computational resources of multiple participating agents, while the second provides for more efficient pruning of search space.Experimental results show that NCBB has significantly better performance than another polynomial-space algorithm, ADOPT, on random graph coloring problems. Under assumptions of cheap communication it also has comparable performance with DPOP despite using only polynomial memory as opposed to exponential memory for DPOP.
Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion
Authors: Xiaoyang Tan, Songcan Chen, Jun Li, Zhi-Hua Zhou
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

The performance of many computer vision and machine learning algorithms critically depends on the quality of the similarity measure defined over the feature space. Previous works usually utilize metric distances which are ofen epistemologically different from the perceptual distance of human beings. In this paper a novel non-metric partial similarity measure is introduced, which is born to automatically capture the prominent partial similarity between two images while ignoring the confusing unimportant dissimilarity. This measure is potentially useful in face recognition since it can help identify the inherent intra-personal similarity and thus reducing the influence caused by large variations such as expression and occlusions. Moreover; to make this method practical, this paper proposes an automatic and class-dependent similarity threshold setting mechanism based on the maximal margin criterion, and uses a Self- Organization Map-based embedding technique to alleviate the computational problem. Experimental results show the feasibility and effectiveness of the proposed method.
Application of Componential IRT Model for Diagnostic Test in a Standard-Conformant eLearning System
Authors: Feng-Hsu Wang
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Diagnostic test plays an important role in personalized eLearning by providing information about cognitive levels of students' learning states. While many diagnosis algorithms have been proposed, most of them lack a solid theory base. On the other hand, item response theory (IRT) is a widely-accepted test theory and has been shown very effective in estimating a learner's latent ability. However, it did not tell much about conceptual cognitive states. This paper proposes an extension of IRT model for diagnostic test by extending it into a componential IRT model. This diagnostic test feature has been added into a standard-conformant eLearning system, called IDEAL, where a model-based diagnosis and remediation architecture is implemented. Preliminary results show that the proposed approach is effective.
A Distributed Channel Access Protocol for Ad Hoc Networks with Feedback Power Control
Authors: S. Hasan Raza Naqvi L. M. Patnaik
Venue: IEEE Transactions on Mobile Computing (2006)

Distributed power control schemes are extensively employed in the cellular networks and are capable of improving the capacity of the network. However, the power control schemes from the cellular networks suffer from performance degradation due to self and direct-interference and hidden-terminal problems when directly employed in ad hoc networks. Most of the existing channel reservation-based power control protocols for ad hoc networks employ incremental power allocation rather than global allocation of the power to the incoming links; thus, they may not effectively utilize the spatial frequency reuse in the network. This paper presents a distributed channel access protocol that couples the channel reservation and the iterative/global transmission power control schemes in ad hoc networks. The designed protocol considers the convergence problem of the global power control in ad hoc networks. The designed access criteria employ the local admission control based on the sufficient criteria for admissibility and global power control for balancing the SIR (signal to interference ratio) of the links. In the performance evaluation study of the designed protocol, an almost twofold increase in the throughput and capacity is observed compared to the existing power-controlled protocol for ad hoc networks.
Performance of variance updating ranking and selection procedures
Authors: Gwendolyn J. Malone, Seong-Hee Kim, David Goldsman, Demet Batur
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Kim and Nelson (2005) developed two indifference-zone procedures for steady-state simulation where the goal is to find the system with the largest or smallest expected steady-state performance measure. One of the procedures, called KN++, updates a variance estimate as more observations become available and is proven to be asymptotically valid when there is no dependence across systems (for example, there is no use of common random numbers). Their procedure exhibits significant improvement over other existing procedures for use in steady-state simulation. In this paper, we first present a modification of KN++ that is asymptotically valid with the use of common random numbers. Then, we study how well KN++ works when data within a system are independent and identically distributed, but data between systems may be positively correlated. Specific applications include the finding-the-best problem when (i) the data are normal, and (ii) the data are Bernoulli.
Learning Neural Networks for Visual Servoing Using Evolutionary Methods
Authors: Nils T. Siebel, Yohannes Kassahun
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

In this article we introduce a method to learn neural networks that solve a visual servoing task. Our method, called EANT, Evolutionary Acquisition of Neural Topologies, starts from a minimal network structure and gradually develops it further using evolutionary reinforcement learning. We have improved EANT by combining it with an optimisation technique called CMA-ES, Covariance Matrix Adaptation Evolution Strategy. Results from experiments with a 3 DOF visual servoing task show that the new CMAES based EANT develops very good networks for visual servoing. Their performance is significantly better than those developed by the original EANT and traditional visual servoing approaches.
Efficient resource allocation for policy-based wireless/wireline interworking
Authors: Yu Cheng, Wei Song, Weihua Zhuang, Alberto Leon-Garcia, Rose Qingyang Hu
Venue: Mobile Networks and Applications (2006)

This paper proposes efficient resource allocation techniques for a policy-based wireless/wireline interworking architecture, where quality of service (QoS) provisioning and resource allocation is driven by the service level agreement (SLA). For end-to-end IP QoS delivery, each wireless access domain can independently choose its internal resource management policies to guarantee the customer access SLA (CASLA), while the border-crossing traffic is served by a core network following policy rules to meet the transit domain SLA (TRSLA). Particularly, we propose an engineered priority resource sharing scheme for a voice/data integrated wireless domain, where the policy rules allow cellular-only access or cellular/WLAN interworked access. By such a resource sharing scheme, the CASLA for each service class is met with efficient resource utilization, and the interdomain TRSLA bandwidth requirement can be easily determined. In the transit domain, the traffic load fluctuation from upstream access domains is tackled by an inter-TRSLA resource sharing technique, where the spare capacity from underloaded TRSLAs can be exploited by the overloaded TRSLAs to improve resource utilization. Advantages of the inter-SLA resource sharing technique are that the core network service provider can freely design the policy rules that define underload and overload status, determine the bandwidth reservation, and distribute the spare resources among bandwidth borrowers, while all the policies are supported by a common set of resource allocation techniques.
A spectral clustering approach to motion segmentation based on motion trajectory
Authors: Hongbin Wang, Hua Lin
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Multibody motion segmentation is important in many computer vision tasks. This paper presents a novel spectral clustering approach to motion segmentation based on motion trajectory. We introduce a new affinity matrix based on the motion trajectory and map the feature points into a low dimensional subspace. The feature points are clustered in this subspace using a graph spectral approach. By computing the sensitivities of the larger eigenvalues of a related Markov transition matrix with respect to perturbations in affinity matrix, we improve the piecewise constant eigenvectors condition [M. Meila et al., 2001] dramatically. This makes clustering much reliable and robust. We confirm it by experiments.
New paradigms and new challenges
Authors: Paul K. Davis
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper lays out provocative assertions about major challenges for the modeling and simulation community. One relates to building M&S for the purpose of assisting the search for strategies that are flexible, adaptive, and robust despite uncertainty. A key aspect of this search is exploratory analysis, coupled with selective zoom. These, in turn, require multiresolution modeling with sound models (albeit, with uncertain data). But sound models must be adaptive models, since humans are adaptive. And rigorous analysis with adaptive models, such as those involving agents, requires new methods and attitudes, as well as new tools.
A Classification for Comparing Standardized XML Data
Authors: Lena Stromback
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

The increasing amount of XML data provided via the web imposes a large need for efficient data exchange and import. This has led to an increasing interest in XML standards within a large number of areas. However, in most application domains there are several competing standards capturing the same kind of information. This work presents a method for classification and comparison of standards within an area. The method can be applied to XML-standards in any domain. We report on the situation for two different areas, molecular interactions and digital television and use our method to compare the standards within the two domains. The classification gives information on how similar the standards are, in terms of information content and structure. This information is useful for deciding which kind of methods are interesting for providing automatic matching and efficient development of tools for import of standardised data.
Guest Editor's Introduction: Computation in Physics Courses
Authors: David Winch
Venue: Computing in Science and Engineering (2006)

You know one if you see one, but can you define a computational physics course in general? Even more fundamentally, can you specify what role numerical computations should have in any standard physics course? The quest to address such questions was the motivation for a project that has culminated in the publication of this special issue. I believe and hope that our nonphysicists readers will regard this special issue as an opportunity to gather information and learn lessons that extend beyond physics to other disciplines.
What Should We Collect to Preserve the History of Software?
Authors: Len Shustek
Venue: IEEE Annals of the History of Computing (2006)

Software is more than cards, tapes and disks; it is the meaning of the bits that they contain. To properly preserve the history of computing, we must preserve the software code, especially the source code, for analysis by future historians.
The global lambda visualization facility: an international ultra-high-definition wide-area visualization collaboratory
Authors: Jason Leigh, Luc Renambot, Andrew Johnson, Byungil Jeong, Ratko Jagodic, Nicholas Schwarz, Dmitry Svistula, Rajvikram Singh, Julieta Aguilera, Xi Wang, Venkatram Vishwanath, Brenda Lopez, Dan Sandin, Tom Peterka, Javier Girado, Robert Kooima, Jinghua Ge, Lance Long, Alan Verlo, Thomas A. DeFanti, Maxine Brown, Donna Cox, Robert Patterson, Patrick Dorn, Paul Wefel, Stuart Levy, Jonas Talandis, Joe Reitzer, Tom Prudhomme, Tom Coffin, Brian Davis, Paul Wielinga, Bram Stolk, Gee Bum Koo, Jaeyoun Kim, Sangwoo Han, Jong Won Kim, Brian Corrie, Todd Zimmerman, Pierre Boulanger, Manuel Garcia
Venue: Future Generation Computer Systems (2006)

The research outlined in this paper marks an initial global cooperative effort between visualization and collaboration researchers to build a persistent virtual visualization facility linked by ultra-high-speed optical networks. The goal is to enable the comprehensive and synergistic research and development of the necessary hardware, software and interaction techniques to realize the next generation of end-user tools for scientists to collaborate on the global Lambda Grid. This paper outlines some of the visualization research projects that were demonstrated at the iGrid 2005 workshop in San Diego, California.
The Role of Workflow in Next Generation Business Oriented Grids: Two Different Approaches Leading to a Unified Vision
Authors: Stefano Beco, Barbara Cantalupo, Annalisa Terracina
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

The Grid is currently living an exciting evolution step to turn from a niche technological infrastructure to a widely used Business environment. To this aim, Workflows are playing an important role acting as the link towards the well-established Business Process Management environment. A number of Grid projects worldwide are trying to implement this link and create the Business Grid but no definitive proposal has been provided yet. In this paper, we analyse two European Grid projects, Akogrimo and NextGRID, both investigating the Business usage of Grid from architectural perspectives but each one adopting a different approach in proposing solutions. The comparative analysis we report provides interesting elements to define a unified vision of the Next Generation Grids where Workflow Models, Languages, and Engines constitute a fundamental building block. Understanding and sharing this vision can be the first step to get to an effective architectural design for Business Grids.
Towards a Tutoring Process Model with Time
Authors: Alke Martens
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The tutoring process model is a formal model, which is based on automaton theory. It has been developed to describe the central steering module of an e-learning system. The formal model consists of a basic tutoring process model with several extensions. The basic tutoring process model allows modeling the central steering component of simple teaching and training systems. Extended with a learner model, the adaptive tutoring process model describes the process of adaptation. In several training systems, adaptation comes in two shapes, one of which is the adaptation of content to the learner's decisions and provides logical coherence (e.g. in case-based training). The other one is adaptation to the learner's abilities. The tutoring process model with time also contains a temporal dimension, which broadens the adaptation possibilities towards realizing delays and acting under time pressure.
A Model for the Effective Reuse of Learning Objects in Repositories
Authors: Isabel Azevedo, Constantino Martins, Eurico Carrapatoso, Carlos Vaz Carvalho
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Learning objects repositories intend to endorse reutilization but this purpose has not been fully achieved yet. In this paper, we describe a project addresses the effective reuse of learning objects in repositories. The initial model presented and discussed introduces new requirements in the way contents are stored and searched and in the contextual definition of learning objects. Considering IMS LD templates, we propose examples of its use for learning objects.
Manipulation of Elastically Deformable Surfaces through Maya Plug-in
Authors: L. H. You, Javier Romero Rodriguez, Jian J. Zhang
Venue: Proceedings of the conference on Geometric Modeling and Imaging: New Trends (2006)

In this paper, we develop a mathematical model from the theory of plate bending in elasticity which relates physical properties of a surface to its elastic deformation. We present the finite difference solution of the mathematical model and implement it using the Maya API and the MEL scripting language. We examine the effects of material properties and other factors on surface shapes and demonstrate applications of the proposed approach in controlling the shape of elastically deformable surfaces.
Behavioral and Electrophysiological Evidence of a Right Hemisphere Bias for the Influence of Negative Emotion on Higher Cognition
Authors: Emiliana R. Simon-thomas, Kemi O. Role, Robert T. Knight
Venue: Journal of Cognitive Neuroscience (2005)

We examined how responses to aversive pictures affected performance and stimulus-locked event-related potentials (ERPs) recorded during a demanding cognitive task. Numeric Stroop stimuli were brief ly presented to either left or right visual hemifield (LVF and RVF, respectively) after a centrally presented aversive or neutral picture from the International Affective Picture System. Subjects indicated whether a quantity value from each Stroop stimulus matched the preceding Stroop stimulus while passively viewing the pictures. After aversive pictures, responses were more accu- rate for LVF Stroops and less accurate for RVF Stroops. Early-latency extrastriate attention-dependent visual ERPs were enhanced for LVF Stroops. The N2 ERP was enhanced for LVF Stroops over the right frontal and parietal scalp sites. Slow potentials (300&ndash;800 msec) recorded over the frontal and parietal regions showed enhanced picture related modulation and amplitude for LVF Stroops. These results suggest that emotional responses to aversive pictures selectively facilitated right hemisphere processing during higher cognitive task performance.
Deconstructing commit
Authors: G. B. Bell, M. H. Lipasti
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

Many modern processors execute instructions out of their original program order to exploit instruction-level parallelism and achieve higher performance. However even though instructions can execute in an arbitrary order, they must eventually commit, or retire from execution, in program order. This constraint provides a safety mechanism to ensure that mis-speculated instructions are not inadvertently committed, but can consume valuable processor resources and severely limit the degree of parallelism exposed in a program. We assert that such a constraint is overly conservative, and propose conditions under which it can be relaxed. This paper deconstructs the notion of commit in an out-of-order processor, and examines the set of necessary conditions under which instructions can be permitted to retire out of program order. It provides a detailed analysis of the frequency and relative importance of these conditions, and discusses microarchitectural modifications that relax the in-order commit requirement. Overall, we found that for a given set of processor resources our technique achieves speedups of up to 68% and 8% for floating point and integer benchmarks, respectively. Conversely, because out-of-order commit allows more efficient utilization of cycle-time limiting resources, it can alternatively enable simpler designs with potentially higher clock frequencies.
Multi-Mode Segmented Scan Architecture with Layout-Aware Scan Chain Routing for Test Data and Test Time Reduction
Authors: Po-Chang Tsai, Sying-Jyan Wang
Venue: Proceedings of the 15th Asian Test Symposium (2006)

This paper presents a multi-mode segmented scan architecture. Three operation modes are supported: broadcast, multicast, and serial. Efficient test data compression can be achieved under this architecture with limited hardware overhead. An efficient two-way partitioning algorithm is given to construct multicastmode configurations. Finally, we present a layoutaware scan chain routing for test compaction, which has not yet explored by the researchers. Experimental results show that most of the serial scan operations can be replaced by multicast operations, and thus achieve much better compression rate.