ppxscal/embedding_network huggingface dataset:
Converting Space Shared Resources into Intermittent Resources for use in Bag-of-Tasks Grids
Authors: Lauro Beltrao Costa, Walfredo Cirne, Daniel Fireman
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

Grid Computing is turning from promise into reality. Naturally, however, this is not happening for all applications at once. Bag-of-Tasks (BoT) applications (those parallel applications whose tasks are independent) are, due to their simplicity, the first class of applications to be massively executed on grids (e.g. SETI@home). BoT applications are especially amendable for grid execution because they can run on intermittent resources (i.e. resources with no guarantees on availability or reliability). In this scenario, good performance and reliable results are provided by eager schedulers, which rely on replication to overcome unfortunate task-to-processor assignments. A little surprisingly, however, eager schedulers are not prepared to use space-shared resources (e.g. parallel supercomputers). This happens because using a space-shared resource involves submitting a detailed request to the resource scheduler, specifying the number of processors needed and the amount of time these processors are to be allocated - an information that eager schedulers are not prepared to provide. This is unfortunate because space-shared computers are the most powerful computing resources available today and thus could greatly improve the execution time of BoT applications. This work proposes an automatic way to craft such requests in order to convert space-shared resources into intermittent ones, therefore rendering them naturally usable by eager schedulers. Such conversion is based on adaptive heuristics and allows eager schedulers use such powerful computing resources without modifications.
Software engineering problems in the design of an integrated modelling system
Authors: Warren T. Jones
Venue: ACM SIGSIM Simulation Digest (1977)

Integrative modelling is a concept which suggests that the modelling and simulation enterprise can best be advanced within a framework which provides a strong theory and software domain for dealing with many models at many levels of specification and application at once. This approach to modelling is important for several reasons; first, and perhaps most important, the appraoch will provide for a more cumulative development of the modelling and simulation enterprise, and thus indirectly more cumulative development of the ultimately desired knowledge and understanding of large-scale complex systems. Secondly, once the required computer software is designed and implemented, the system of integrated models should enable the development of additional related models for a lower total "cost" in terms of total effort. The lower cost is due to the fact that new models will also be integrated and therefore derived from earlier available ones. Third, this approach, when implemented, will tend to centralize the data and models of a particular large-scale system thus making it more readily available in responding to the needs of public policymaking.
Introduction
Authors: Rahul Singh, Lakshmi S. Iyer, A. F. Salam
Venue: Communications of the ACM (2005)

Much work is required to understand how the conceptualizations that comprise business processes across the extended enterprise can be captured, represented, shared, and processed by both human and intelligent software agents. This effort will ultimately lead to transparent and secure information and knowledge flows in service and supply chains to increase economic efficiency in the digital economy.
Automatic Initialization of 3D Deformable Models for Cartilage Segmentation
Authors: Jurgen Fripp, Stuart Crozier, Simon Warfield, Sebastien Ourselin
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Deformable models are a highly accurate and flexible approach to segmenting structures in medical images. The primary drawback of deformable models is that they are sensitive to initialisation, with accurate and robust results often requiring initialisation close to the true object in the image. Automatically obtaining a good initialisation is problematic for many structures in the body. The cartilages of the knee are a thin elastic material that cover the ends of the bone, absorbing shock and allowing smooth movement. The degeneration of these cartilages characterize the progression of osteoarthritis. The state of the art in the segmentation of the cartilage are 2D semi-automated algorithms. These algorithms require significant time and supervison by a clinical expert, so the development of an automatic segmentation algorithm for the cartilages is an important clinical goal. In this paper we present an approach towards this goal that allows us to automatically providing a good initialisation for deformable models of the patella cartilage, by utilising the strong spatial relationship of the cartilage to the underlying bone.
Design-Level Performance Prediction of Component-Based Applications
Authors: Yan Liu, Alan Fekete, Ian Gorton
Venue: IEEE Transactions on Software Engineering (2005)

Server-side component technologies such as Enterprise JavaBeans (EJBs), .NET, and CORBA are commonly used in enterprise applications that have requirements for high performance and scalability. When designing such applications, architects must select a suitable component technology platform and application architecture to provide the required performance. This is challenging as no methods or tools exist to predict application performance without building a significant prototype version for subsequent benchmarking. In this paper, we present an approach to predict the performance of component-based server-side applications during the design phase of software development. The approach constructs a quantitative performance model for a proposed application. The model requires inputs from an application-independent performance profile of the underlying component technology platform, and a design description of the application. The results from the model allow the architect to make early decisions between alternative application architectures in terms of their performance and scalability. We demonstrate the method using an EJB application and validate predictions from the model by implementing two different application architectures and measuring their performance on two different implementations of the EJB platform.
CoLe: A Cooperative Data Mining Approach and Its Application to Early Diabetes Detection
Authors: Jie Gao, Jorg Denzinger, Robert C. James
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

We present CoLe, a cooperative data mining approach for discovering hybrid knowledge. It employs multiple different data mining algorithms, and combines results from them to enhance the mined knowledge. For our medical application area, we analyse several focusing strategies that allowed us to gain medically significant results.
Insights from Viewing Ranked Retrieval as Rank Aggregation
Authors: Holger Bast, Ingmar Weber
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

We view a variety of established methods for ranked retrieval from a common angle, namely as a process of combining query-independent rankings that were precomputed for certain attributes. Apart from a general insight into what effectively distinguishes various schemes from each other, we obtain three specific results concerned with conceptbased retrieval. First, we prove that latent semantic indexing (LSI) can be implemented to answer queries in time proportional to the number of words in the query, which improves over the standard implementation by an order of magnitude; a similar result is established for LSI's probabilistic sibling PLSI. Second, we give a simple and precise characterization of the extent, to which latent semantic indexing (LSI) can deal with polysems, and when it fails to do so. Third, we demonstrate that the recombination of the intricate, yet relatively cheap mechanism of PLSI for mapping queries to attributes, with a simplistic, easy-to-compute set of document rankings gives a retrieval performance which is at least as good as that of the most sophisticated conceptbased retrieval schemes and which does not require any precomputation.
Optimal sample length for efficient cache simulation
Authors: Lieven Eeckhout, Smaïl Niar, Koen De Bosschere
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

Architectural simulations of microprocessors are extremely time-consuming nowadays due to the ever increasing complexity of current applications. In order to get realistic workloads on current hardware, benchmarks need to be constructed with huge dynamic instruction counts. For example, SPEC released the CPU2000 benchmark suite containing benchmarks that have a dynamic instruction count of several hundreds of billions of instructions. This is beneficial for real hardware evaluation. However, simulating these workloads is impractical if not impossible if we take into account that many simulation runs are needed in order to evaluate a large number of design points. Trace sampling is often used as a practical solution for this problem. In trace sampling, several representative samples are chosen from a real program trace. Since the sampled trace is much shorter than the original trace, a significant simulation speedup is obtained. In this paper, we study what is the optimal sample size to achieve a given level of accuracy while maximizing the total simulation speedup. From various experiments using SPEC CPU2000, we conclude that the optimal sample length (i) is not fixed over benchmarks, and (ii) increases with increasing warmup lengths. As such, we propose an algorithm that determines the optimal sample length per benchmark under different warmup scenarios. This is done within the context of sampled cache simulation.
Characterization of interface state densities by photocurrent analysis: comparison of results for different insulator layers
Authors: M. Rommel, M. Groß, A. Ettinger, M. Lemberger, A. J. Bauer, L. Frey, H. Ryssel
Venue: Microelectronic Engineering (2005)

In this work, silicon insulator interfaces are characterized by detailed photocurrent analysis. Results obtained for a variety of samples with different insulator layers and layer thicknesses are presented and discussed. The results show the applicability of the technique for a reliable process control and include data on high-k layers for the first time. Comparison of experiment and simulation is used to explain the injection level dependence of the measurements.
Prise en compte du contexte dans l'&eacute;tude des applications multimodales sur t&eacute;l&eacute;phone mobile
Authors: Marc Mersiol
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

This paper describes two usability tests conducted on a multimodal application. This application is designed for mobile phones. The first test is done in a laboratory. The second test is done in the street. The aim of this paper is to present both tests and to compare them. The main result is that both tests present advantages and drawbacks and that they complement each other. The in-laboratory test allows more precise analysis. The in-street test gives the possibility to observe behaviours induced by a richer context.
On complexities of finding disjoint paths and related problems
Authors: Bing Yang
Venue:  (2005)

In this dissertation, we study the complexities of several problems related to finding disjoint paths in a graph. These problems include (1) Min-Min 2-Path, (2) Normalized &alpha;&minus;-Min-Sum 2-Path, (3) Normalized &alpha;+-Min-Sum 2-Path, (4) MinSum-MinMin 2-Path, (5) Min-Sum Single-Source All-Destination-Pairs Shortest Disjoint 2-Paths, (6) Min-Sum k-Paths Subject to Minimum Vulnerability, (7) Optimal Dual-Homing Assignment for Multicast, and (8) Partitioning a Sequence into Monotone Subsequences. We also consider their generalizations and restrictions. Most of these problems arise from the need for reliable network communications. We show that some of these problems are polynomial-time solvable, and some are NP-complete. For polynomial-time solvable problems, we present efficient algorithms. For NP-complete problems, we provide approximation algorithms or proofs for the intractability of approximation, integer linear programming formulation, pseudo-polynomial-time algorithms, or heuristic algorithms.
Video2Cartoon: generating 3D cartoon from broadcast soccer video
Authors: Dawei Liang, Yang Liu, Qingming Huang, Guangyu Zhu, Shuqiang Jiang, Zhebin Zhang, Wen Gao
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this demonstration, a prototype system for generating 3D cartoon from broadcast soccer video is proposed. This system takes advantage of computer vision (CV) and computer graphics (CG) techniques to provide users new experience that can not be obtained from original video. Firstly, it uses CV techniques to obtain 3D positions of the players and ball. Then, CG techniques are applied to model the playfield, players, and ball. Finally, 3D cartoon is generated. Our system allows users to watch the game at any point of view using a 3D viewer based on OpenGL.
High-order runge-kutta discontinuous galerkin methods for computational electromagnetics
Authors: Bernardo Cockburn
Venue:  (2005)

We introduce a new Runge-Kutta Discontinuous Galerkin (RKDG) method for problems of wave propagation that achieves full high-order convergence in time and space. For the time integration, it uses an mth-order, m-stage, low storage Strong Stability Preserving Runge-Kutta (SSP-RK) scheme which is an extension to a class of non-autonomous linear systems of a recently designed method for autonomous linear systems. This extension allows a high-order accurate treatment of the inhomogeneous, time-dependent terms that enter the semi-discrete problem on account of physical or artificial boundary conditions. Thus, if polynomials of degree k are used in the space discretization, the RKDG method is of overall order m = k + 1, for any k > 0. Numerical results in one- and two-space dimensions are presented which confirm this property.
Partial Product Reduction Based on Look-Up Tables
Authors: H. Mora Mora, J. Mora Pascual, J. L. Sanchez Romero, F. Pujol Loopez
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

In this paper a new technique for partial product reduction based on the use of look-up tables for efficient processing is presented. We describe how to construct counter devices with pre-calculated data and their subsequent integration into the whole operation. The development of reduction trees organizations for this kind of devices uses the inherent integration benefits of computer memories and offers an alternative implementation to classic operation methods. Therefore, in our experiments we compare our implementation model with CMOS technology model in homogeneous terms.
An Efficient Scan Tree Design for Compact Test Pattern Set
Authors: Shibaji Banerjee, Dipanwita Roy Chowdhury, Bhargab B. Bhattacharya
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Various designs of scan paths based on tree-like structures have recently been suggested for reducing test application time or test data volume in today's high density VLSI circuits. Most of these techniques strongly rely on the existence of a large number of compatible sets of flip-flops under the given test set, and therefore, are unsuitable for highly compact test sets generated by efficient ATPG tools. In this paper, to circumvent this problem, a new two-pass hybrid method is proposed to design an efficient scan tree architecture. Given a compact test set, compatibility relationships among the flip-flops are first explored, and a graph-based heuristic algorithm is employed to construct a scan tree with minimal incompatibility. Next, the same combinational ATPG tool is rerun to generate a new test set satisfying the logical constraints on the secondary inputs imposed by the structure of the scan tree. To cover the remaining hard-to-detect faults, if any, a few test vectors are chosen from the original test set for application in the serial mode. Experimental results on various benchmark circuits demonstrate that the proposed algorithm outperforms the earlier methods in reducing the total test application time significantly without any degradation of fault coverage.
Skewed mirror symmetry detection from a 2D sketch of a 3D model
Authors: H. L. Zou, Y. T. Lee
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Mirror symmetry is an important constraint in 3D reconstruction of an object from a 2D sketch and the subsequent beautification of the 3D model. This paper proposes a new method to detect symmetry planes from a sketch by exploiting the topological connections of the edges it contains. Experiments show that the method can detect all the symmetry planes and the corresponding symmetric vertex pairs, edge pairs and face pairs as well.
Multi-objective evolutionary algorithms and phylogenetic inference with multiple data sets
Authors: L. Poladian, L. S. Jermiin
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

Evolutionary relationships among species are usually (1) illustrated by means of a phylogenetic tree and (2) inferred by optimising some measure of fitness, such as the total evolutionary distance between species or the likelihood of the tree (given a model of the evolutionary process and a data set). The combinatorial complexity of inferring the topology of the best tree makes phylogenetic inference an ideal candidate for evolutionary algorithms. However, difficulties arise when different data sets provide conflicting information about the inferred `best' tree(s). We apply the techniques of multi-objective optimisation to phylogenetic inference for the first time. We use the simplest model of evolution and a four species problem to illustrate the method.
Peer-to-Peer Networks Based on Hierarchies of Trust
Authors: Apostolos Tramantzas, Barry M. G. Cheetham, Mark van Harmelen, Alexandria C. Walker
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

A new approach to peer-to-peer (P2P) networking is proposed, which is particularly suitable for real-time interactive multimedia communications over IP networks. This approach combines the concepts of both the hybrid and pure P2P approaches. It enables administration of P2P resources and peer privileges and allows for secure content exchange, while being scalable and robust in its performance as the P2P network grows. The administration is devolved among a ¿hierarchy of trust¿, which can evolve with the co-operation of peers with administrative privileges.
Automatic Eye Detection and Its Validation
Authors: Peng Wang, Matthew B. Green, Qiang Ji, James Wayman
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

The accuracy of face alignment affects the performance of a face recognition system. Since face alignment is usually conducted using eye positions, an accurate eye localization algorithm is therefore essential for accurate face recognition. In this paper, we first study the impact of eye locations on face recognition accuracy, and then introduce an automatic technique for eye detection. The performance of our automatic eye detection technique is subsequently validated using FRGC 1.0 database. The validation shows that our eye detector has an overall 94.5% eye detection rate, with the detected eyes very close to the manually provided eye positions. In addition, the face recognition performance based on the automatic eye detection is shown to be comparable to that of using manually given eye positions.
Non-negative tensor factorization with applications to statistics and computer vision
Authors: Amnon Shashua, Tamir Hazan
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We derive algorithms for finding a non-negative n-dimensional tensor factorization (n-NTF) which includes the non-negative matrix factorization (NMF) as a particular case when n = 2. We motivate the use of n-NTF in three areas of data analysis: (i) connection to latent class models in statistics, (ii) sparse image coding in computer vision, and (iii) model selection problems. We derive a "direct" positive-preserving gradient descent algorithm and an alternating scheme based on repeated multiple rank-1 problems.
Digital Imaging with Extreme Zoom: System Design and Image Restoration
Authors: Yi Yao, Besma Abidi, Mongi Abidi
Venue: Proceedings of the Fourth IEEE International Conference on Computer Vision Systems (2006)

Applications of digital imaging with extreme zoom are traditionally found in astronomy and wild life monitoring. More recently, the need for such capabilities has extended to wide area monitoring such as forest fires, harbors, and waterways. This paper presents a number of sensor arrangements for the acquisition of high magnification images. It also describes user interfaces developed for the system's remote control and data acquisition and processing. Hardware and software considerations are addressed, focusing on optical setups and image de-blurring techniques. An image restoration algorithm tailored to such systems is developed, where an adaptive sharpness measure is employed as a cost function to guide the search for an optimal point spread function (PSF) for image de-blur. Experimental results demonstrate a considerably enhanced robustness to noise and ability to select the optimum PSF, producing much superior restored images.
Motion Trajectory Learning in the DFT-Coefficient Feature Space
Authors: Andrew Naftel, Shehzad Khalid
Venue: Proceedings of the Fourth IEEE International Conference on Computer Vision Systems (2006)

Techniques for understanding video object motion activity are becoming increasingly important with the widespread adoption of CCTV surveillance systems. In this paper we propose a novel vision system for clustering and classification of object-based video motion clips using spatiotemporal models. Object trajectories are modeled as motion time series using the lowest order Fourier coefficients obtained by Discrete Fourier Transform. Trajectory clustering is then carried out in the DFT-coefficient feature space to discover patterns of similar object motion activity. The DFT coefficients are used as input feature vectors to a Self-Organising Map which can learn similarities between object trajectories in an unsupervised manner. Encoding trajectories in this way leads to efficiency gains over existing approaches that use discrete point-based flow vectors to represent the whole trajectory. Assuming the clusters of trajectory points are distributed normally in the coefficient feature space, we propose a simple Mahalanobis classifier for the detection of anomalous trajectories. Our proposed techniques are validated on three different datasets - Australian sign language, handlabelled object trajectories from video surveillance footage and real-time tracking data obtained in the laboratory. Applications to event detection and motion data mining for visual surveillance systems are envisaged.