ppxscal/embedding_network huggingface dataset:
Locally Adaptive Support-Weight Approach for Visual Correspondence Search
Authors: Kuk-Jin Yoon, In-So Kweon
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper, we present a new area-based method for visual correspondence search that focuses on the dissimilarity computation. Local and area-based matching methods generally measure the similarity (or dissimilarity) between the image pixels using local support windows. In this approach, an appropriate support window should be selected adaptively for each pixel to make the measure reliable and certain. Finding the optimal support window with an arbitrary shape and size is, however, very difficult and generally known as an NP-hard problem. For this reason, unlike the existing methods that try to find an optimal support window, we adjusted the support-weight of each pixel in a given support window. The adaptive support-weight of a pixel is computed based on the photometric and geometric relationship with the pixel under consideration. Dissimilarity is then computed using the raw matching costs and support-weights of both support windows, and the correspondence is finally selected by the WTA (Winner-Takes-All) method. The experimental results for the rectified real images show that the proposed method successfully produces piecewise smooth disparity maps while preserving sharp depth discontinuities accurately.
Hacking and cybercrime
Authors: Nataliya B. Sukhai
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

This paper explores the fast growing Cyberworld and its components. It starts with definitions of who is the hacker, and what is a cybercrime. Types and offenses of cybercrime are addressed as well. The paper concentrates on the possibilities to protect ourselves from the cybercrime, and guard Cyberworld from us. Therefore, it emphasizes the importance of users' education, starting from the early age, creation and enforcement of policies, and awareness training. The paper presents laws, applicable to the computer related crime, highlights the U.S. Department of Homeland Security involvement, and investigates on the fact why businesses do not report hackers' attacks and why is it important.
Utilization of GIS and graph theory for determination of optimal mailing route
Authors: Mufid Abudiab, Michael Starek, Rene Lumampao, An Nguyen
Venue: Journal of Computing Sciences in Colleges (2004)

A real-world application of GIS and graph theory for analysis of an optimization problem is presented in this paper. The problem entailed determining the optimal route for distribution of mail on our University's campus. We focused our work only on the processes utilized to deliver mail externally from building to building. Information was collected on the procedure and routes utilized by the mailing department for the daily delivery of mail. To determine the optimal closed path, geographic information systems (GIS) techniques were utilized for analysis of the delivery routes and measurement of distances from building to building. The problem domain was modeled as a complete graph and approached as being a variant of the traditional Traveling Salesman Problem. An implementation of the Brute Force method developed in C++ code was utilized to solve the problem.
Generative 3D models: a key to more information within less bandwidth at higher quality
Authors: Rene Berndt, Dieter W. Fellner, Sven Havemann
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

This paper proposes a novel, yet extremely compact shape representation method. Its main feature is that 3D shapes are represented in terms of functions instead of geometric primitives. Given a set of - typically only a few - specific parameters, the evaluation of such a function results in a model that is one instance of a general shape. Particularly important for the web context with client systems of widely varying rendering performance is the support of a semantic level-of-detail superior to any low-level polygon reduction scheme.The shape description language has the power of a full programming language, but it has an extremely simple syntax. It serves as a ***mesh creation/manipulation language'. It is designed to facilitate the composition of more complex modeling operations out of simpler ones. Thus, it allows to create high-level operators which evaluate to arbitrarily complex, parameterized shapes. The underlying low-level shape representation is a boundary representation mesh in combination with Catmull/Clark subdivision surfaces.
Empirical evaluation of multi-level buffer cache collaboration for storage systems
Authors: Zhifeng Chen, Yan Zhang, Yuanyuan Zhou, Heidi Scott, Berni Schiefer
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

To bridge the increasing processor-disk performance gap, buffer caches are used in both storage clients (e.g. database systems) and storage servers to reduce the number of slow disk accesses. These buffer caches need to be managed effectively to deliver the performance commensurate to the aggregate buffer cache size. To address this problem, two paradigms have been proposed recently to collaboratively manage these buffer caches together: the hierarchy-aware caching maintains the same I/O interface and is fully transparent to the storage client software, and the aggressively-collaborative caching trades off transparency for performance and requires changes to both the interface and the storage client software. Before storage industry starts to implement collaborative caching in real systems, it is crucial to find out whether sacrificing transparency is really worthwhile, i.e., how much can we gain by using the aggressively-collaborative caching instead of the hierarchy-aware caching? To accurately answer this question, it is required to consider all possible combinations of recently proposed local replacement algorithms and optimization techniques in both collaboration paradigms.Our study provides an empirical evaluation to address the above questions. Particularly, we have compared three aggressively-collaborative approaches with two hierarchy-aware approaches for four different types of database/file I/O workloads using traces collected from real commercial systems such as IBM DB2. More importantly, we separate the effects of collaborative caching from local replacement algorithms and optimizations, and uniformly apply several recently proposed local replacement algorithms and optimizations to all five collaboration approaches.When appropriate local optimizations and replacement algorithms are uniformly applied to both hierarchy-aware and aggressively-collaborative caching, the results indicate that hierarchy-aware caching can deliver similar performance as aggressively-collaborative caching. The results show that the aggressively-collaborative caching only provides less than 2.5% performance improvement on average in simulation and 1.0% in real system experiments over the hierarchy-aware caching for most workloads and cache configurations. Our sensitivity study indicates that the performance gain of aggressively-collaborative caching is also very small for various storage networks and different cache configurations. Therefore, considering its simplicity and generality, hierarchy-aware caching is more feasible than aggressively-collaborative caching.
Dealing with interconnect process variations
Authors: N. S. Nagaraj
Venue: Proceedings of the 2005 international workshop on System level interconnect prediction (2005)

Historically, transistor process variations have been studied in great detail. As interconnect becomes a significant portion of circuit performance, signal integrity, power integrity and chip reliability, study of interconnect process variations has gained increased importance. This paper provides a comprehensive overview of types and sources of all aspects interconnect process variations, including VIA, contact, metal, dielectric barriers and low-k dielectrics. Chemical Mechanical Polishing (CMP) induced variations and etch induced variations in metal topography are covered. Both systematic and random process variations are discussed. Impact of these interconnect process variations on RC delay, circuit delay, crosstalk noise, voltage drop and EM are discussed. Methods to determine intra-level/inter-level variations and their impact on potential circuit hazards are covered.
Addressing fear of heights through virtual reality
Authors: Chia-Li Chang, Benjamin Insler
Venue: Journal of Computing Sciences in Colleges (2004)

Virtual reality is an area of computer science that provides a method for implementing three-dimensional, immersive, interactive worlds that can allow humans to experience situations that may be unlikely or impossible in the real world. The following research will examine the capabilities of virtual reality to fully immerse individuals within an artificial, three-dimensional environment. Individuals with a varying fear of heights will be immersed within an interactive three-dimensional environment. Furthermore, we will explore the effectiveness of the capability of virtual reality to treat psychological phobias, specifically acrophobia.
Introduction to the Special Issue on Constraint Handling Rules
Authors: Slim Abdennadher, Thom Frühwirth, Christian Holzbaur
Venue: Theory and Practice of Logic Programming (2005)

During the last decade, Constraint Handling Rules (CHR) have become a major specification and implementation language for logical, constraint-based algorithms and intelligent applications (as witnessed for example by several hundred publications available online that mention CHR). Algorithms are often specified using inference rules, rewrite rules, sequents, proof rules, or logical axioms that can be almost directly written in CHR.
Application of Wavelet-Based POCS Superresolution for Cardiovascular MRI Image Enhancement
Authors: J. T. Hsu, C. C. Yen, C. C. Li, M. Sun, B. Tian, M. Kaygusuz
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper presents a study of applying an image superresolution method to enhance spatial resolution of MRI heart images from a temporal sequence. The particular method is a wavelet-based projection-onto-convex-set super-resolution reconstruction. It makes use of the non-stationary effect in the successive images in the sequence to extract some detail information for image reconstruction at a higher spatial resolution. Our experimental result shows better visual quality than that obtained by using the cubic-spline interpolation.
Color Based Grayscale-Fused Image Enhancement Algorithm for Video Surveillance
Authors: Jing Li, Quan Pan, Tao Yang, Yong mei Cheng
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Multiple sensors image fusion is increasingly being employed in video surveillance. This paper presents a color based grayscale-fused image enhancement algorithm. The main advantage of this algorithm is to stand out meaningful information of a certain sensor in selected band of the color space, while maintain the high resolution of the grayscale-fused image. Moreover, a performance evaluation method based on analyzing the average gradients of the color-fused image is presented and experiments are performed using images under complex environment. The results show that the addition of color to grayscale-fused image can significantly increase observerýs sensitivity and the accuracy of further classification and recognition.
National Science Foundation News
Authors: Laurence C. Rosenberg
Venue: ACM SIGART Bulletin (1992)

This is first issue of a regular column describing NSF activities and items of interest to the AI community. The column will vary in length depending on the activity to be reported. 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
Performance Metrics Based on Computational Action
Authors: Robert W. Numrich
Venue: International Journal of High Performance Computing Applications (2004)

We propose a new performance metric based on computational action. We examine work as it evolves in time and compute computational action as the integral of the work function over time. We compare the action generated at less than full power with the action that could have been generated at full power. We claim that the goal of performance optimization is to minimize lost, or wasted, action. We calculate our metric for some computers in the Top500 list (http://www.top500.org) and propose a new ranking based on least action wasted. When work is a function of the resources applied, we use the classical techniques of the calculus of variations to minimize wasted action. From the result of this exercise, we calculate productivity as the ratio of work produced to resources used.
A model transformation framework for the automated building of performance models from UML models
Authors: Andrea D'Ambrogio
Venue: Proceedings of the 5th international workshop on Software and performance (2005)

In order to effectively validate the performance of software systems throughout their development cycle it is necessary to continuously build performance models from software models and then use the obtained models to check whether the system is being developed according to its performance requirements. The model building activity is a critical and effort-consuming activity. Several approaches have been envisaged to endow software designers with tools that automatically build ready-to-evaluate performance models from software development models. One essential requirement of such tools, often disregarded by current approaches, is a high degree of interoperability with software development tools, which has the positive effect of reducing both the level of required expertise in performance theory and the burden of learning separate tools. This paper introduces a framework for transforming source software models into target performance models. The transformation requires a clear understanding of the abstract syntax and semantics of both the source and target models, which is obtained by use of metamodeling techniques for defining the abstract syntax of models, the interrelationships between model elements and the model transformation rules. In the paper case, the framework is applied to the transformation of source models of UML type into target models of LQN (layered queueing network) type. The proposed approach is founded on the precepts recently introduced by model-driven development (MDA) and makes use of the set of related standards (MOF, QVT, XMI). This allows to obtain a high degree of automation, so that interoperable model transformation tools can be implemented in a timely and efficient way, leading to improvements in terms of software designers' productivity and system quality.
Impact of Document Types on the Performance of Caching Algorithms in WWW Proxies: A Trace Driven Simulation Study
Authors: Rachid El Abdouni Khayari, Michael Best, Axel Lehmann
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Caching has been recognized as one of the most important techniques to reduce Internet bandwidth in the WWW. Different caching algorithms have been developed to achieve this task. These caching algorithms have been developed for specific contexts and show different performance values depending on their application domains. This is caused by the fact that each caching algorithm rates document characteristics more important than others. In this paper we compare the performance of well-known caching strategies with respect to different document types. For this purpose, we use trace-driven simulation and consider the resulting hit rates as well as the byte hit rates for different extracted traces.
Computational simulation and analysis of double-swept blade in BVI noise reduction
Authors: Hong Hu, Leon A. Jordan,  Jr., James D. Baeder
Venue: Advances in Engineering Software (2005)

The TURNS computational fluid dynamics (CFD) code with the Beddoes prescribed wake and the WOPWOP computational acoustics code is used to study blade-sweep blade-vortex interaction (BVI) noise reduction design. The CFD three-dimensional unsteady solutions of blade surface pressure distributions are used as the input to WOPWOP acoustics computational code to produce the overall sound pressure level (OASPL) on a 3-rotor radiation observer hemisphere around the helicopter rotor. To study the effects of blade sweep on BVI noise reduction, computations are performed on a baseline rectangular blade and a corresponding double-swept blade to better understand the impact of blade sweep on BVI noise reduction in relation to the interaction angle between blade leading edge and the shed tip-vortex. The present study indicates that tip-region blade forward sweep produces favorable BVI angles for dominate BVIs to reduce the maximum BVI noise level on the advancing side, while increasing noise level on the retreating side. Increasing in the noise level on the retreating side as a trade-off for decreasing in the maximum noise level on the advancing side results favorably in the reduction of the overall maximum noise level and in changing the 'hot' noise spots into a more desirable 'less hot' noise region.
Automatic Task Scheduling / Loop Unrolling using Dedicated RTR Controllers in Coarse Grain Reconfigurable Architectures
Authors: Pascal Benoit, Lionel Torres, Gilles Sassatelli, Michel Robert, Gaston Cambon
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

When designing a SoC, matching the required performance both in terms of processing power and power consumption tends to become more and more challenging. Moreover, since the range of targeted applications for every single product is growing rapidly, employing reconfigurable accelerators makes more and more sense to this purpose. Coarse grain reconfigurable architectures bring an alternative providing interesting performance / flexibility trade-offs over traditional approaches. This paper presents an original method allowing to efficiently exploit dynamical parallelism at both loop-level and task-level, which remains rarely used. This method called DHM (Dynamic Hardware Multiplexing) is based upon the use of a hardwired controller dedicated to run-time task scheduling and automatic loop unrolling. This paper shows that significant performance improvements can be achieved through combining both intra and inter-task parallelism. Principles and validations are exposed through a case study on a coarse grain reconfigurable architecture.
Efficient integration of web services with distributed data flow and active mediation
Authors: David Liu, Jun Peng, Kincho H. Law, Gio Wiederhold
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

This paper presents a loosely coupled service-composition paradigm. This paradigm employs a distributed data flow that differs markedly from centralized information flow adopted by current service integration frameworks, such as CORBA, J2EE and SOAP. Distributed data flows support direct data transmission to avoid many performance bottlenecks of centralized processing. In addition, active mediation is used in applications employing multiple web services that are not fully compatible in terms of data formats and contents. Active mediation increases the applicability of the services, reduces data communication among the services, and enables the application to control complex computations. The benefits of distributed data flow and active mediation are illustrated with various applications, such as dynamic type conversion, result extraction, and engineering application. It is shown that active mediation, combining with distributed data flows, can greatly improve the performance of an application utilizing multiple web services.
Subject region segmentation in disparity maps for image retrieval
Authors: Hiroshi Mo, Yuichi Idehara, Shin'ichi Satoh, Takashi Hamada
Venue: Systems and Computers in Japan (2004)

In this paper, we propose a method for automatic segmentation of subject regions using disparity maps for image retrieval by real-world objects. If one wants to look up a particular object in image database, the subject region should be properly extracted from the image as a key for image retrieval. In our approach, we assume that we have the actual object in the real world to be looked up in image database. Taking advantage of disparity maps using a commercially available stereo range finder, subject region extraction is automated. We assume that the x-coordinate, y-coordinate, and disparity obtained from disparity map should yield multimodal Gaussian probability distribution, and subject regions are extracted by properly selecting particular modes of Gaussian densities. We construct a prototype system to retrieve images by real-world objects and show that adaptive and quick automatic extraction of the subject region could be achieved. &copy; 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 35(1): 47&ndash;57, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10389
USC: description of the SNAP system used for MUC-5
Authors: Dan Moldovan, Seungho Cha, Minhwa Chung, Tony Gallippi, Kenneth J. Hendrickson, Jun-Tae Kim, Changhwa Lin, Chinyew Lin
Venue: Proceedings of the 5th conference on Message understanding (1993)

The SNAP information extraction system has been developed as a part of a three-year SNAP project sponsored by the National Science Foundation. The main goal of the SNAP project is to build a massively parallel computer capable of fast and accurate natural language processing [5]. Throughout the project, a parallel computer was built in the Parallel Knowledge Processing Laboratory at USC, and various software was developed to operate the machine [3]. The approach in designing SNAP was to find a knowledge representation and a reasoning paradigm useful for natural language processing which exhibits massive parallelism. We have selected marker-passing on semantic networks as a way to represent and process linguistic knowledge.
Optimization of Distributed Implementation of Grayscale Electron-Beam Proximity Effect Correction on a Temporally Heterogeneous Cluster
Authors: Soo-Young Lee, Noppachai Anupongpaibool
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14 (2005)

Grayscale electron-beam lithography is one of the techniques used in transferring circuit patterns with multi-level structures onto substrates. The proximity effect caused by electron scattering imposes a severe limitation on the ultimate spatial resolution attainable by E-beam lithography. Therefore, proximity effect correction is essential particularly for fine-feature, high-density circuit patterns. One difficulty is that it is extremely time-consuming due to the intensive computation required in the correction procedure and a large size of circuit data to be processed. Hence, it is an ideal candidate for distributed computing where the otherwise-unused CPU cycles of a number of computers on a network (cluster) can be efficiently utilized. In this paper, optimization of the distributed grayscale proximity effect correction procedure previously developed is addressed for minimizing the correction time. Also, a different circuit partitioning approach (localized partitioning) is considered.