ppxscal/embedding_network huggingface dataset:
Nonmigratory Online Deadline Scheduling on Multiprocessors
Authors: Ho-Leung Chan, Tak-Wah Lam, Kar-Keung To
Venue: SIAM Journal on Computing (2005)

In this paper we consider multiprocessor scheduling with hard deadlines and investigate the cost of eliminating migration in the online setting. Let I be any set of jobs that can be completed by some migratory offline schedule on m processors. We show that I can also be completed by a nonmigratory online schedule using m speed-5.828 processors (i.e., processors 5.828 times faster). This result supplements the previous results that I can also be completed by a nonmigratory offline schedule using 6m unit-speed processors [B. Kalyanasundaram and K. R. Pruhs, J. Algorithms, 38 (2001), pp. 2--24] or a migratory online schedule using m speed-2 processors [C. A. Phillips et al., Algorithmica, 32 (2002), pp. 163--200]. Our result is based on a simple conservative scheduling algorithm called PARK, which commits a processor to a job only when the processor has zero commitment before its deadline. A careful analysis of PARK further shows that the processor speed can be reduced arbitrarily close to 1 by exploiting more processors (say, using 16m speed-1.8 processors). PARK also finds application in overloaded systems; it gives the first online nonmigratory algorithm that can exploit moderately faster processors to match the performance of any migratory offline algorithm.
Dynamic topological predicates and notifications in moving objects databases
Authors: Goce Trajcevski, Peter Scheuermann, Hervé Brönnimann, Agnès Voisard
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

This work addresses the problem of efficient reactive management of topological predicates in MOD (Moving Objects Databases) settings. Detecting the satisfiability of such predicates in mobile and dynamic environments requires management of continuous and persistent conditions. We introduce two dynamical topological predicates: moving-along and moving-towards and we present efficient algorithmic solutions for their processing. Based on this, we subsequently take a deeper insight in the behavioral aspects of a MOD which manages them and we argue that the traditional ECA (Event Condition Action) paradigm, while it may ensure correct behavior, is not well-suited for enabling the users to declaratively specify some of the parameters that may affect the efficiency aspect of the reactive behavior. Towards this end, we introduce the (ECA)2 (Evolving and Context-Aware Event-Condition-Action) paradigm as a tool for specification of the triggers used by a MOD that handles requests which span over a time-interval in dynamic environments.
Similarity motion estimation and active tracking through spatial-domain projections on log-polar images
Authors: V. Javier Traver, Filiberto Pla
Venue: Computer Vision and Image Understanding (2005)

To cope with the huge amount of visual data in the environment, foveal sensing is not only an elegant biological solution, but also an appropriate mechanism in computer-based vision of artificial agents such as robots. An extremely important visual behavior in active vision systems is that of actively tracking moving targets, which is a problem closely related with foveal vision. The work described in this article has precisely to do with active tracking with space-variant images. The two main components of the proposed algorithm are the log-polar image format, and a projection-based motion estimator, whose joint use results in an efficient and effective active tracking scheme. For the successful real-time performance of the proposed approach, it is very important to have an appropriate combination of: (i) an efficient motion estimation technique, (ii) an adequate image representation, and (iii) the dynamic nature of purposive vision.
Automatic generation of rule-based software configuration management systems
Authors: Guozheng Ge, E. James Whitehead,  Jr.
Venue: Proceedings of the 27th international conference on Software engineering (2005)

We propose a model-driven methodology and toolset for automatic SCM system repository creation and feature composition using code generation and rule engine technologies.
A Linear Euclidean Distance Transform Algorithm Based on the Linear-Time Legendre Transform
Authors: Yves Lucet
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

We introduce a new exact Euclidean distance transform algorithm for binary images based on the Linear-time Legendre Transform algorithm. The three-step algorithm uses dimension reduction and convex analysis results on the Legendre-Fenchel transform to achieve linear-time complexity. First, computation on a grid (the image) is reduced to computation on a line, then the convex envelope is computed, and finally the squared Euclidean distance transform is obtained. Examples and an extension to non-binary images are provided.
Cache-oblivious R-trees
Authors: Lars Arge, Mark de Berg, Herman Haverkort
Venue: Proceedings of the twenty-first annual symposium on Computational geometry (2005)

We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point can be found efficiently. Our structure is an axis-aligned bounding-box hierarchy and as such it is the first cache-oblivious R-tree with provable performance guarantees. If no point in the plane is contained in B or more rectangles in S, the structure answers a rectangle query using O(√N/B + T/B) memory transfers and a point query using O((N/B)ε) memory transfers for any ε > 0, where B is the block size of memory transfers between any two levels of a multilevel memory hierarchy. We also develop a variant of our structure that achieves the same performance on input sets with arbitrary overlap among the rectangles. The rectangle query bound matches the bound of the best known linear-space cache-aware structure.
Content-Based SMIL Retrieval
Authors: Kennis Tam, Lam Ching Yu, Dacheng Tao, Hao Liu, Bo Luo, Xiaoou Tang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

The Synchronized Multimedia Integration Language (SMIL¿) fulfills the needs of integration, synchronization, and efficient online delivery of different media types such as text, music, speech, image, and video. In this paper, we represent these multimedia elements in a synchronized manner under a unified feature space. An efficient SMIL retrieval scheme based on textual feature and content feature is proposed. Pilot experiments on our SMIL database show that the proposed method can work well on SMIL retrieval.
HLA Federate Migration
Authors: Gary Tan, Anders Persson, Rassul Ayani
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

The High Level Architecture (HLA) is a standardized framework for distributed simulation that promotes reuse and interoperability of simulation components (federates). Federates are processes which communicate with each other in the simulation via the Run Time Infrastructure (RTI). When running a large scale simulation over many nodes/workstations, some may get more workload than others. To run the simulation as efficiently as possible, the workload should be uniformly distributed over the nodes. Current RTI implementations are very static, and do not allow any load balancing. Load balancing of a HLA federation can be achieved by scheduling new federates on the node with least load and migrating executing federates from a highly loaded node to a lightly loaded node. Process migration has been a topic of research for many years, but not within the context of HLA. This paper focuses on process migration within the HLA framework.
Computation in the Higher Visual Cortices: Map-Seeking Circuit Theory and Application to Machine Vision
Authors: David Arathorn
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Map-Seeking Circuit theory is a biologically based computational theory of vision applicable to difficult machine vision problems such as recognition of 3D objects in arbitrary poses amid distractors and clutter, as well as to non-recognition problems such as terrain interpretation. It provides a general computational mechanism for tractable discovery of correspondences in massive transformation spaces by exploiting an ordering property of superpositions. The latter allows a set of transformations of an input image to be formed into a sequence of superpositions which are then "culled" to a composition of single mappings by a competitive process which matches each superposition against a superposition of inverse transformations of memory patterns. The architecture that performs this is based on a number of neuroanatomical features of the visual cortices, including reciprocal dataflows and inverse mappings.
Replica Placement in Data Grid: Considering Utility and Risk
Authors: Rashedur M. Rahman, Ken Barker, Reda Alhajj
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Grid computing emerges from the need to integrate a collection of distributed computing resources to offer performance unattainable by any single machine. Grid technology facilitates data sharing across many organizations in different geographical locations. Data replication is an excellent technique to move and cache data close to users. Replication reduces access latency and bandwidth consumption. It also facilitates load balancing and improves reliability by creating multiple data copies. However, Gird environments introduce significant new challenges such as dynamic resource availability and network performance changes. As users requests vary constantly, the system needs a dynamic replication strategy that adapts to users' dynamic behavior. To address such issues, this paper presents and evaluates the performance of six dynamic replication strategies for two different kinds of access patterns. Our replication strategies are mainly based on utility and risk. Before placing a replica at a site, we calculate an expected utility and risk index for each site by considering current network load and user requests. A replication site is then chosen by optimizing expected utility or risk indexes.
Evolutionary algorithm-based face verification
Authors: Jun-Su Jang, Kuk-Hyun Han, Jong-Hwan Kim
Venue: Pattern Recognition Letters (2004)

This paper proposes a novel face verification method using principal components analysis (PCA) and evolutionary algorithm (EA). Although PCA related algorithms have shown outstanding performance, the problem lies in making decision rules or distance measures. To solve this problem, quantum-inspired evolutionary algorithm (QEA) is employed to find out the optimal weight factors in the distance measure for a predetermined threshold value which distinguishes between face images and non-face images. Experimental results show the effectiveness of the proposed method through the improved verification rate and false alarm rate.
Fields of Experts: A Framework for Learning Image Priors
Authors: Stefan Roth, Michael J. Black
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We develop a framework for learning generic, expressive image priors that capture the statistics of natural scenes and can be used for a variety of machine vision tasks. The approach extends traditional Markov Random Field (MRF) models by learning potential functions over extended pixel neighborhoods. Field potentials are modeled using a Products-of-Experts framework that exploits non-linear functions of many linear filter responses. In contrast to previous MRF approaches all parameters, including the linear filters themselves, are learned from training data. We demonstrate the capabilities of this Field of Experts model with two example applications, image denoising and image inpainting, which are implemented using a simple, approximate inference scheme. While the model is trained on a generic image database and is not tuned toward a specific application, we obtain results that compete with and even outperform specialized techniques.
Epi-Convergent Discretizations of Multistage Stochastic Programs
Authors: Teemu Pennanen
Venue: Mathematics of Operations Research (2005)

In many dynamic stochastic optimization problems in practice, the uncertain factors are best modeled as random variables with an infinite support. This results in infinite-dimensional optimization problems that can rarely be solved directly. Therefore, the random variables (stochastic processes) are often approximated by finitely supported ones (scenario trees), which result in finite-dimensional optimization problems that are more likely to be solvable by available optimization tools. This paper presents conditions under which such finite-dimensional optimization problems can be shown to epi-converge to the original infinite-dimensional problem. Epi-convergence implies the convergence of optimal values and solutions as the discretizations are made finer. Our convergence result applies to a general class of convex problems where neither linearity nor complete recourse are assumed.
Automatic Image Orientation Detection via Confidence-Based Integration of Low-Level and Semantic Cues
Authors: Jiebo Luo, Matthew Boutell
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

Automatic image orientation detection for natural images is a useful, yet challenging research topic. Humans use scene context and semantic object recognition to identify the correct image orientation. However, it is difficult for a computer to perform the task in the same way because current object recognition algorithms are extremely limited in their scope and robustness. As a result, existing orientation detection methods were built upon low-level vision features such as spatial distributions of color and texture. Discrepant detection rates have been reported for these methods in the literature. We have developed a probabilistic approach to image orientation detection via confidence-based integration of low-level and semantic cues within a Bayesian framework. Our current accuracy is 90 percent for unconstrained consumer photos, impressive given the findings of a psychophysical study conducted recently. The proposed framework is an attempt to bridge the gap between computer and human vision systems and is applicable to other problems involving semantic scene content understanding.
Proteomic analysis of colorectal cancer: prefractionation strategies using two-dimensional free-flow electrophoresis: Conference Reviews
Authors: Robert L. Moritz, Anita R. Skandarajah, Hong Ji, Richard J. Simpson
Venue: Comparative and Functional Genomics (2005)

This review deals with the application of a new prefractionation tool, free-flow electrophoresis (FFE), for proteomic analysis of colorectal cancer (CRC). CRC is a leading cause of cancer death in the Western world. Early detection is the single most important factor influencing outcome of CRC patients. If identified while the disease is still localized, CRC is treatable. To improve outcomes for CRC patients there is a pressing need to identify biomarkers for early detection (diagnostic markers), prognosis (prognostic indicators), tumour responses (predictive markers) and disease recurrence (monitoring markers). Despite recent advances in the use of genomic analysis for risk assessment, in the area of biomarker identification genomic methods alone have yet to produce reliable candidate markers for CRC. For this reason, attention is being directed towards proteomics as a complementary analytical tool for biomarker identification. Here we describe a proteomics separation tool, which uses a combination of continuous FFE, a liquid-based isoelectric focusing technique, in the first dimension, followed by rapid reversed-phase HPLC (1&ndash;6 min&#x002F;analysis) in the second dimension. We have optimized imaging software to present the FFE&#x002F;RP-HPLC data in a virtual 2D gel-like format. The advantage of this liquid based fractionation system over traditional gel-based fractionation systems is the ability to fractionate large quantity protein samples. Unlike 2D gels, the method is applicable to both high-Mr proteins and small peptides, which are difficult to separate, and in the case of peptides, are not retained in standard 2D gels. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Graphical user interface of an interactive system for schemes design, used in distance learning
Authors: Plamen Manoilov, Vladimir Mateev, Mihail Iliev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Distance education, in which the teacher and students are separated by time and place, is currently the fastest growing form of domestic and international education.An Graphical User Interface (GUI) of an artificial intelligence system for self learning and testing of students' knowledge about electronic circuits schemes design has been presented in this paper. The system could be used in all subjects where schematic diagrams have been included.Java has been used as powerful programming language for developing platform independent interactive and computational based software that can be used through a Java-enabled Web browser.
Asynchronous e-learning resources for hardware design issues
Authors: Artur Jutman, Alexander Sudnitson, Raimund Ubar, Heinz-Dietrich Wuttke
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper presents a conception of how to improve the skills of the students studying digital design and test related topics. A learning method based on using the so-called "living pictures" is applied. The goal of this method is to put interactive teaching modules on the Internet so that they can be used in asynchronous-mode learning of digital design and test. The system is implemented in the form of Java applets and can be freely accessed through the Internet. The principal message of the conception is to inspire students to learn, and to prepare them for developing problem-solving strategies.
The advantages of web service orchestration in perspective
Authors: Jeffrey Gortmaker, Marijn Janssen, René W. Wagenaar
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Governments from all over the world are looking for technologies to facilitate the coordination of their inter-agency processes in order to improve the service-delivery to their customers. Web Service Orchestration (WSO) technology supports the coordination of cross-departmental processes. The advantages of WSO for governments, however, are not very clear. As a result, governments hesitate to adopt orchestration technology.Advantages of WSO, as found in literature, have a narrow-focus, mainly concerning technological advantages. The advantages of Workflow Management (WFM), a related technology that has been around for years, are much broader. We found a large gap between the advantages that were found for WSO and WFM. We conducted a case study at a business counter to test whether the advantages of WSO and WFM as found in literature were also found for a practical application of WSO.
Towards increasing the compatibility of student pair programmers
Authors: Neha Katira, Laurie Williams, Jason Osborne
Venue: Proceedings of the 27th international conference on Software engineering (2005)

As pair programming is used widely in software engineering education, instructors may wish to proactively form pairs to increase the likelihood of compatible pairs. A study involving 361 software engineering students was carried out at North Carolina State University to understand and predict pair compatibility. We have found that students are compatible with partners whom they perceive of similar skill, although instructors cannot proactively manage this perception. Pairing of two minority students is more likely and mixed gender pairs are less likely to be compatible. Additionally, pairing of students with similar actual skill level as measured by midterm grades in class, GPA, and SAT/GRE scores also likely results in compatible pairs. Our research addresses the following challenges faced by instructors in software engineering: 1) organizational concern in pairing of students; 2) increasing the retention rates of female and minority students in classes; and 3) proactively forming mutually-compatible pairs.
Student competitions and bots in an introductory programming course
Authors: Brian Ladd, Ed Harcourt
Venue: Journal of Computing Sciences in Colleges (2005)

An introductory programming course that is both an introduction to the major and a university-wide distribution course can suffer from a large disparity of interest as well as ability. Motivating all students to participate improves outcomes. At St. Lawrence University we have found that competitions are fun and engaging for students while providing a vehicle for both individual and collaborative team projects. We use homegrown robot simulation software to draw students into the course with microworld interaction and animation; student competitions based on popular winter sporting events fit our northern clime and improve engagement.
Letter to the editor: on quadrature of Bessel transformations
Authors: Shuhuang Xiang
Venue: Journal of Computational and Applied Mathematics (2005)

A method for integral transformations of highly oscillatory functions, Bessel functions, is presented. It is based on the Filon-type method and the decay of the error can be increased as α increases. The effectiveness and accuracy of the quadrature is tested for both large arguments and higher orders of Bessel functions in the case where the orders are nonnegative integers.
Pixels that Sound
Authors: Einat Kidron, Yoav Y. Schechner, Michael Elad
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

People and animals fuse auditory and visual information to obtain robust perception. A particular benefit of such cross-modal analysis is the ability to localize visual events associated with sound sources. We aim to achieve this using computer-vision aided by a single microphone. Past efforts encountered problems stemming from the huge gap between the dimensions involved and the available data. This has led to solutions suffering from low spatio-temporal resolutions. We present a rigorous analysis of the fundamental problems associated with this task. Then, we present a stable and robust algorithm which overcomes pastdeficiencies. It grasps dynamic audio-visual events with high spatial resolution, and derives a unique solution. The algorithm effectively detects pixels that are associated with the sound, while filtering out other dynamic pixels. It is based on canonical correlation analysis (CCA), where we remove inherent ill-posedness by exploiting the typical spatial sparsity of audio-visual events. The algorithm is simple and ef- ficient thanks to its reliance on linear programming and is free of user-defined parameters. To quantitatively assess the performance, we devise a localization criterion. The algorithm capabilities were demonstrated in experiments, where it overcame substantial visual distractions and audio noise.