ppxscal/embedding_network huggingface dataset:
Identification of commutative covariance structures by successive testing of statistical hypotheses
Authors: L. P. Sysoev, M. E. Shaikin
Venue: Automation and Remote Control (2005)

For the multidimensional stochastic systems obeying the regression models with unknown covariances of disturbances, consideration was given to the choice of a covariance model and estimation of its parameters. The invariant behavior of the regression model with the covariance matrix of a special structure was studied. In the problem of identifying the structure of a set of feasible covariance matrices, a procedure of successive testing of hypotheses was proposed. The unbiased and invariant uniformly optimal estimates of the parameters of the observation-based model were determined. The problem of identifying the model of covariances in experiment design with random factors was considered as an example.
No-wait scheduling in single-hop multi-channel LANs
Authors: Fengfeng Zhou, Yinlong Xu, Guoliang Chen
Venue: Information Processing Letters (2005)

An extended version of the multiprocessor machine scheduling problem with makespan objective, which arises from single-hop multi-channel LANs, is presented in this paper. In this scheduling model, each job consists of two operations, and each operation may be processed by anyone of a given set of machines, while in the job shop scheduling problem, such a set contains only one machine. For this NP-complete problem, we first analyze the performance ratios of two simple strategies, List Scheduling and Longest Processing Time First, for the off-line cases, which have performance ratios (5/2 - 1/2m) and (2 + 1/2(m + 1)), respectively, with (m + 1) being the number of the machines. We also show that the competitive ratio of the List Scheduling strategy for the on-line cases is (7/2 - 1/2m).
Reaching students at a distance: from videotape to the internet to online, interactive books
Authors: Jim Kurose
Venue: Journal of Computing Sciences in Colleges (2005)

I'm now approaching the 20th year that my semester-long courses have been carried over various distance learning systems to remote students, and the 10th year that I've been experimenting with using the Internet to distribute multimedia classroom material to these students. During this same time, many textbooks have created web sites and/or supplemental materials (such as recorded multimedia) that often overlap with activities that have traditionally taken place in the classroom. I will reflect on some of the lessons learned over this period, and what this might mean for the future. As a textbook author and a teacher, I'm also interested in how textbooks and their supplemental materials are continuing to evolve, and what this might mean for us as teachers and for our remote and in-class students.
Overhead camera implementation for robot colony
Authors: Vimal Vishwanathan
Venue: Journal of Computing Sciences in Colleges (2004)

There are three main tasks in the robot colony: establishing power supply to the robots, creating a communication link from the learning computer to the robot, and the task of implementing an overhead video camera to track the positions of the individual robots in the colony. The focus of this project was to have a tracking system for the colony of robots so that we can use the data obtained from the camera images for future learning algorithms. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Real-time 3D shape reconstruction, dynamic 3D mesh deformation, and high fidelity visualization for 3D video
Authors: T. Matsuyama, X. Wu, T. Takai, S. Nobuhara
Venue: Computer Vision and Image Understanding (2004)

3D video [IEEE Multimedia (1997) 18] is the ultimate image media recording dynamic visual events in the real world as is; it records time varying 3D object shape with high fidelity surface properties (i.e., color and texture), Its applications cover wide varieties of personal and social human activities: entertainment (e.g., 3D game and 3D TV), education (e.g., 3D animal picture books), sports (e.g., sport performance analysis), medicine (e.g., 3D surgery monitoring), culture (e.g., 3D archive of traditional dances), and so on. In this paper, we propose: (1) a PC cluster system for real-time reconstruction of dynamic 3D object action from multiview video images, (2) a deformable 3D mesh model for reconstructing the accurate dynamic 3D object shape, and (3) an algorithm of rendering natural-looking texture on the 3D object surface from the multi-view video images. Experimental results with quantitative performance evaluations demonstrate the effectiveness of these methods in generating high fidelity 3D video from multi-view video images.
Investigation on the Threshold Setting of Intracellular Calcium Ion Concentration in Hippocampal CA3 Network Model for Synaptic Plasticity
Authors: Kazuumi Tashiro, Noriaki Suetake, Eiji Uchino
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

An intracellular calcium ion concentration ([Ca^{2+} ]_i ) is closely related to plasticity of biological cells.In this paper, in order to find a relation between a distribution of [Ca^{2+} ]_i and an activity of network models, th distribution of [Ca^{2+} ]_i is investigated.We propose a presumption for making the modification rule of interconnection plasticity among cells.
An adaptive extrapolation algorithm for automatic integration
Authors: Elise de Doncker
Venue: ACM SIGNUM Newsletter (1978)

An algorithm for automatic integration has been developed, which is globally adaptive and makes use of a non-linear extrapolation technique. It allows jump discontinuities and singularities of several types to be integrated automatically in an accurate and efficient way.It will be outlined with regard to both its theoretical background and its application for general-purpose integration over finite and infinite ranges.
A two-level scheduling method: an effective parallelizing technique for uniform nested loops on a DSP multiprocessor
Authors: Yi-Hsuan Lee, Cheng Chen
Venue: Journal of Systems and Software (2005)

A digital signal processor (DSP), which is a special-purpose microprocessor, is designed to achieve higher performance on DSP applications. Because most DSP applications contain many nested loops and permit a very high degree of parallelism, the DSP multiprocessor has a suitable architecture to execute these applications. Unfortunately, conventional scheduling methods used on DSP multiprocessors allocate only one operation to each DSP every time unit, even if the DSP includes several function units that can operate in parallel. Obviously they cannot achieve full function unit utilization. Hence, in this paper, we propose a two-level scheduling method (TSM) to overcome this common failing. TSM contains two approaches, which integrates unimodular transformations, loop tiling technique, and conventional methods used on single DSP. Besides introducing algorithm, we also use an analytic module to analyze its preliminary performance. Based on our analyses the TSM can achieve shorter execution time and more scalable speedup results. In addition, the TSM causes less memory access and synchronization overheads, which are usually negligible in the DSP multiprocessor architecture.
A Timed Petri Net Approach for Pre-Runtime Scheduling in Partial and Dynamic Reconfigurable Systems
Authors: Remy Eskinazi, Manoel E. Lima, Paulo R. M. Maciel, Carlos A. Valderrama, Abel G. S. Filho, Paulo S. B. Nascimento
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

Dynamic Reconfigurable Systems (DRS) offer a very interesting alternative for embedded digital systems design. Tasks scheduling within a reconfigurable environment allows the development of systems with better execution performance, chip area economy and lower power consumption. This paper describes an algorithm for design of dynamically reconfigurable systems where tasks scheduling have as prime objective the overall application performance speedup. The methodology includes the generation of an embedded controller supporting the scheduling process in a target architecture.
Indexing mobile objects using dual transformations
Authors: George Kollios, Dimitris Papadopoulos, Dimitrios Gunopulos, J. Tsotras
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2005)

With the recent advances in wireless networks, embedded systems, and GPS technology, databases that manage the location of moving objects have received increased interest. In this paper, we present indexing techniques for moving object databases. In particular, we propose methods to index moving objects in order to efficiently answer range queries about their current and future positions. This problem appears in real-life applications such as predicting future congestion areas in a highway system or allocating more bandwidth for areas where a high concentration of mobile phones is imminent. We address the problem in external memory and present dynamic solutions, both for the one-dimensional and the two-dimensional cases. Our approach transforms the problem into a dual space that is easier to index. Important in this dynamic environment is not only query performance but also the update processing, given the large number of moving objects that issue updates. We compare the dual-transformation approach with the TPR-tree, an efficient method for indexing moving objects that is based on time-parameterized index nodes. An experimental evaluation shows that the dual-transformation approach provides comparable query performance but has much faster update processing. Moreover, the dual method does not require establishing a predefined query horizon.
Unifying the cisco intranet through hierarchical navigation
Authors: Michael Lenz, Jim Beno, Mathew Burns, Sharon Meaney
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Cisco web-enabled numerous processes during a period of rapid growth, resulting in a number of disconnected sites and tools. Although this innovation cut costs, employees could not easily find information and had to learn new models of navigation and interaction. This paper describes how the Intranet Strategy team responded by designing a hierarchical navigation system that met user and business requirements, connected numerous isolated sites, and encouraged standardization and governance of the Intranet. The team leveraged prior work on navigation for Cisco's public web site, created and tested a series of prototypes, and integrated the final design with an innovative template framework. The result was better navigation, increased relevancy, and reduced costs.
Is that your final answer?
Authors: Florence Reeder
Venue: Proceedings of the first international conference on Human language technology research (2001)

The purpose of this research is to test the efficacy of applying automated evaluation techniques, originally devised for the evaluation of human language learners, to the output of machine translation (MT) systems. We believe that these evaluation techniques will provide information about both the human language learning process, the translation process and the development of machine translation systems. This, the first experiment in a series of experiments, looks at the intelligibility of MT output. A language learning experiment showed that assessors can differentiate native from non-native language essays in less than 100 words. Even more illuminating was the factors on which the assessors made their decisions. We tested this to see if similar criteria could be elicited from duplicating the experiment using machine translation output. Subjects were given a set of up to six extracts of translated newswire text. Some of the extracts were expert human translations, others were machine translation outputs. The subjects were given three minutes per extract to determine whether they believed the sample output to be an expert human translation or a machine translation. Additionally, they were asked to mark the word at which they made this decision. The results of this experiment, along with a preliminary analysis of the factors involved in the decision making process will be presented here.
Interval methods for semi-infinite programs
Authors: Binita Bhattacharjee, William H. Green,  Jr., Paul I. Barton
Venue: Computational Optimization and Applications (2005)

A new approach for the numerical solution of smooth, nonlinear semi-infinite programs whose feasible set contains a nonempty interior is presented. Interval analysis methods are used to construct finite nonlinear, or mixed-integer nonlinear, reformulations of the original semi-infinite program under relatively mild assumptions on the problem structure. In certain cases the finite reformulation is exact and can be solved directly for the global minimum of the semi-infinite program (SIP). In the general case, this reformulation is over-constrained relative to the SIP, such that solving it yields a guaranteed feasible upper bound to the SIP solution. This upper bound can then be refined using a subdivision procedure which is shown to converge to the true SIP solution with finite ε-optimality. In particular, the method is shown to converge for SIPs which do not satisfy regularity assumptions required by reduction-based methods, and for which certain points in the feasible set are subject to an infinite number of active constraints. Numerical results are presented for a number of problems in the SIP literature. The solutions obtained are compared to those identified by reduction-based methods, the relative performances of the nonlinear and mixed-integer nonlinear formulations are studied, and the use of different inclusion functions in the finite reformulation is investigated.
Semi-Probabilistic Content-Based Publish-Subscribe
Authors: Paolo Costa, Gian Pietro Picco
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Mainstream approaches to content-based distributed publish-subscribe typically route events deterministically based on information collected from subscribers, and do so by relying on a tree-shaped overlay network. While this solution achieves scalability in fixed, large-scale settings, it is less appealing in scenarios characterized by high dynamicity, e.g., mobile ad hoc networks or peer-to-peer systems. At the other extreme, researchers in the related fields of multicast and group communication have successfully exploited probabilistic techniques that provide increased fault tolerance, resilience to changes, and yet are scalable. In this paper, we propose a novel approach where event routing relies on deterministic decisions driven by a limited view on the subscription information and, when this is not sufficient, resorts to probabilistic decisions performed by selecting links at random. Simulations show that the particular mix of deterministic and probabilistic decisions we put forth in this work is very effective at providing high event delivery and low overhead in highly dynamic scenarios, without sacrificing scalability.
Medical Image Retrieval and Registration: Towards Computer Assisted Diagnostic Approach
Authors: Mahmudur Rahman, Tongyuan Wang, Bipin C. Desai
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

A large number of medical images in digital format are generated by hospitals and clinics every day. Such images constitute an important source of anatomical and functional information for diagnosis of diseases, medical research and education. These images include high-resolution 2-D or 3-D spatial and temporal data of various modalities (CT, MRI, X-ray, ultrasound etc.) require effective processing and organization techniques. Two of the most important techniques along this direction are; image retrieval and image registration. Image retrieval is the technique to find similar images from an image archive by their textual and visual contents and image registration is the establishment of correspondences between images or between image and physical space. Characteristics of medical images differ significantly from other generalpurpose images and hence require special treatment. This article presents a highlight of recent research in medical image retrieval and registration, main techniques and trends, key issues and limitations. We also point out some promising research directions and propose a system architecture for computer aided diagnosis, where both technologies can be integrated and complement each other.
2004 Franz Edelman Award for Achievement in Operations Research and the Management Sciences
Venue: Interfaces (2005)

This special issue ofInterfaces presents the finalists and winners of the 33rd annual competition for the Franz Edelman Award for Achievement in Operations Research and the Management Sciences, the profession's prestigious award for the practice of operations research and the management sciences. Thomas Spencer III, chairman of the competition, and Stephen C. Graves, editor of the special issue, provide an overview of the competition and introduce the finalists and winner.
A model for slicing JAVA programs hierarchically
Authors: Bi-Xin Li, Xiao-Cong Fan, Jun Pang, Jian-Jun Zhao
Venue: Journal of Computer Science and Technology (2004)

Program slicing can be effectively used to debug, test, analyze, understand and maintain object-oriented software. In this paper, a new slicing model is proposed to slice Java programs based on their inherent hierarchical feature. The main idea of hierarchical slicing is to slice programs in a stepwise way, from package level, to class level, method level, and finally up to statement level. The stepwise slicing algorithm and the related graph reachability algorithms are presented, the architecture of the Java program Analyzing TOol (JATO) based on hierarchical slicing model is provided, the applications and a small case study are also discussed.
Extracting layers and analyzing their specular properties using epipolar-plane-image analysis
Authors: Antonio Criminisi, Sing Bing Kang, Rahul Swaminathan, Richard Szeliski, P. Anandan
Venue: Computer Vision and Image Understanding (2005)

Despite progress in stereo reconstruction and structure from motion, 3D scene reconstruction from multiple images still faces many difficulties, especially in dealing with occlusions, partial visibility, textureless regions, and specular reflections. Moreover, the problem of recovering a spatially dense 3D representation from many views has not been adequately treated. This document addresses the problems of achieving a dense reconstruction from a sequence of images and analyzing and removing specular highlights. The first part describes an approach for automatically decomposing the scene into a set of spatio-temporal layers (namely EPI-tubes) by analyzing the epipolar plane image (EPI) volume. The key to our approach is to directly exploit the high degree of regularity found in the EPI volume. In contrast to past work on EPI volumes that focused on a sparse set of feature tracks, we develop a complete and dense segmentation of the EPI volume. Two different algorithms are presented to segment the input EPI volume into its component EPI tubes. The second part describes a mathematical characterization of specular reflections within the EPI framework and proposes a novel technique for decomposing a static scene into its diffuse (Lambertian) and specular components. Furthermore, a taxonomy of specularities based on their photometric properties is presented as a guide for designing further separation techniques. The validity of our approach is demonstrated on a number of sequences of complex scenes with large amounts of occlusions and specularity. In particular, we demonstrate object removal and insertion, depth map estimation, and detection and removal of specular highlights.
Requirements for a real-time .NET framework
Authors: A. Zerzelidis, A. J. Wellings
Venue: ACM SIGPLAN Notices (2005)

The Microsoft .NET Framework is a comparatively new technology that has already gained considerable momentum. Its user base and popularity is expanding. In addition, it offers a number of important traits, such as code portability and cross-language development. It is these features that have attracted our attention into investigating the possibility of using .NET for architecture -neutral real-time systems. As a result, this paper tries to set the groundwork for implementing a real-time version of the Microsoft .NET Framework by specifying a set of requirements.
An "off-the-shelf" dynamic mesh capability
Authors: R. M. Corless, R. B. Simpson
Venue: ACM SIGNUM Newsletter (1983)

In this note, we describe some experimental computations to examine embedding two point boundary value problem software in a time stepping procedure to solve one space variable dynamic problems. By using a general bvp solver with adaptive mesh selection in a simple, black box manner, we could expect to get a program package that could handle quite general system dynamics and boundary values and with a dynamic mesh capability for a relatively small development cost. This would, of course, be a trade-off of low development costs for high execution time costs and one of the main goals of our experiment has been to obtain some idea of the run time costs. We give here a brief overview of these computations, without references; details and references are available in University of Waterloo, Computer Science research report CS-82-32 "A Feasibility Study of the Use of COLSYS in the Solution of Systems of Partial Differential Equations"
Distributed Approximation of Fixed-Points in Trust Structures
Authors: Karl Krukow, Andrew Twigg
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

We consider distributed algorithms for solving a range of problems in a framework for trust in large-scale distributed systems. The framework is based on the notion of trust structures; a set of ýtrust-levelsý with two distinct partial orderings. In the trust model, a global trust-state is defined as the least fixed-point of a collection of local policies of nodes in the network. We show that it is possible to compute the global trust-state using a simple, robust and totally asynchronous distributed-algorithm. We also consider a distributed notion of proof-carrying-requests as a means of approximating the least fixed-point, enabling sound reasoning about the global trust-state without computing the exact fixed-point. Our proof-carrying-request model is different than the notion of proof-of-compliance from traditional trust-management; in particular, all proofs are efficientlyverifiable or easily rejected, but, in the worst case, may require as much communication as computing the actual trust-state itself.
PalmHashing: a novel approach for cancelable biometrics
Authors: Tee Connie, Andrew Teoh, Michael Goh, David Ngo
Venue: Information Processing Letters (2005)

We propose a novel cancelable biometric approach, known as PalmHashing, to solve the non-revocable biometric issue. The proposed method hashes palmprint templates with a set of pseudo-random keys to obtain a unique code called palmhash. The palmhash code can be stored in portable devices such tokens and smartcards for verification. Multiple sets of palmhash codes can be maintained in multiple applications. Thus the privacy and security of the applications can be greatly enhanced. When compromised, revocation can also be achieved via direct replacement of a new set of palmhash code. In addition, PalmHashing offers several advantages over contemporary biometric approaches such as clear separation of the genuine-imposter populations and zero EER occurrences. In this paper, we outline the implementation details of this method and also highlight its potentials in security-critical applications.