ppxscal/embedding_network huggingface dataset:
A new algorithm for layout of dark field alternating phase shifting masks
Authors: Qinglang Luo, Xianlong Hong, Qiang Zhou, Yici Cai
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

A new methodology is proposed to accelerate AltPSM design flow for dark field AltPSM for large-scale layouts. When scaling to large-scale layouts, designing AltPSM may be much time consuming. Our new algorithm solves this problem by splitting a layout into smaller, easier-to-solve parts, solving the sub-layouts independently and simultaneously, and then recombining the sub-layouts. The experimental results on industry layouts indicate that parallel algorithm has potential to provide more significant improvement in speed and achieve a better quality of solutions.
Knuth--bendix constraint solving is NP-complete
Authors: Konstantin Korovin, Andrei Voronkov
Venue: ACM Transactions on Computational Logic (TOCL) (2005)

We show the NP-completeness of the existential theory of term algebras with the Knuth--Bendix order by giving a nondeterministic polynomial-time algorithm for solving Knuth--Bendix ordering constraints.
Bugzilla, ITracker, and Other Bug Trackers
Authors: Nicolas Serrano, Ismael Ciordia
Venue: IEEE Software (2005)

Bug-tracking systems help us identify the error in our software, resolve it, and learn from it. This column compares two open source products--Bugzilla and ITracker--and provides useful hints for working with any bug-tracking tool.
Text knowledge bases: University of Texas at Austin
Authors: Robt F. Simmons
Venue: Issue 79 (January 1982) (1982)

Our research is concentrated in two primary natural language research programs, one aimed at understanding expository text and the other at automated translation for technical text from German to English. (This latter project is described separately - see section from "Linguistics Research Center" above. -Ed.)
Analysis of blocking probability for distributed lightpath establishment in WDM optical networks
Authors: Kejie Lu, Gaoxi Xiao, Imrich Chlamtac
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

In this paper, we analyze the blocking probability of distributed lightpath establishment in wavelength-routed WDM networks by studying the two basic methods: destination-initiated reservation (DIR) and source-initiated reservation (SIR). We discuss three basic types of connection blocking: 1) blocking due to insufficient network capacity; 2) blocking due to outdated information; and 3) blocking due to over-reservation. It is shown that the proposed models are highly accurate for both the DIR and the SIR methods, in both the regular and irregular network topologies, under the whole range of traffic loads.
International conference on design automation standards for test
Venue: ACM SIGDA Newsletter (1989)

This conference is dedicated to Test Standards for the CAE and test communities and will have presentations by the leaders of test standards. The timing of the conference is significant. Key portions of the work of the groups is nearing completion. Mature standard proposals are about to be balloted. 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
Spring: : A Developer's Notebook (Developer's Notebook)
Authors: Bruce Tate, Justin Gehtland
Venue:  (2005)

Since development first began on Spring in 2003, there's been a constant buzz about it in Java development publications and corporate IT departments. The reason is clear: Spring is a lightweight Java framework in a world of complex heavyweight architectures that take forever to implement. Spring is like a breath of fresh air to overworked developers. In Spring, you can make an object secure, remote, or transactional, with a couple of lines of configuration instead of embedded code. The resulting application is simple and clean. In Spring, you can work less and go home early, because you can strip away a whole lot of the redundant code that you tend to see in most J2EE applications. You won't be nearly as burdened with meaningless detail. In Spring, you can change your mind without the consequences bleeding through your entire application. You'll adapt much more quickly than you ever could before. Spring: A Developer's Notebook offers a quick dive into the new Spring framework, designed to let you get hands-on as quickly as you like. If you don't want to bother with a lot of theory, this book is definitely for you. You'll work through one example after another. Along the way, you'll discover the energy and promise of the Spring framework. This practical guide features ten code-intensive labs that'll rapidly get you up to speed. You'll learn how to do the following, and more: install the Spring Framework set up the development environment use Spring with other open source Java tools such as Tomcat, Struts, and Hibernate master AOP and transactions utilize ORM solutions As with all titles in the Developer's Notebook series, this no-nonsense book skips all the boring prose and cuts right to the chase. It's an approach that forces you to get your hands dirty by working through one instructional example after another-examples that speak to you instead of at you.
Fast degree elevation and knot insertion for B-spline curves
Authors: Qi-Xing Huang, Shi-Min Hu, Ralph R. Martin
Venue: Computer Aided Geometric Design (2005)

We give a new, simple algorithm for simultaneous degree elevation and knot insertion for B-spline curves. The method is based on the simple approach of computing derivatives using the control points, resampling the knot vector, and then computing the new control points from the derivatives. We compare our approach with previous algorithms and illustrate it with examples.
Illustrating the curse of dimensionality numerically through different data distribution models
Authors: Ian Eccles, Meng Su
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

The purpose of this paper is to numerically illustrate a known problem, the curse of dimensionality in high dimensional database applications. The curse of dimensionality occurs when information is retrieved from indexed structures such as an R-tree and its variants that store feature vectors, which are extracted from multimedia data such as images. The "curse" says that as the dimension of the vectors increases, the cost of retrieving data increases dramatically. This problem has been discussed by other authors in some special cases. In this paper, we discuss distance distributions of vectors by assuming many well known distribution models. A Java applet. jCurse. has been built to show that the distance distributions of vectors always approach the boundary of a considered data region as the dimension increases. We discuss these vectors by using different distance metrics and distribution models. The program can easily be applied to more distribution models.
Virtual Chat World (VCW)
Authors: Jonathan Kelly, Jennifer Skibitsky, Jay Kenney, Chen Dai, Diza Suleman
Venue: Journal of Computing Sciences in Colleges (2004)

Chat software has revolutionized the way people all over the world interact with one another. Not only has it bridged the gap between continents but it has also made the transfer of data over long distances very fast and reliable. While many of today's internet chat applications offer many features besides straightforward text-based communication (i.e., games, file sharing, voice communication), not many have attempted to place the user in a virtual setting where they can walk around an artificial environment and interact with other users in real time.
Processor Allocation for Tasks that is Robust Against Errors in Computation Time Estimates
Authors: Prasanna V. Sugavanam, H. J. Siegel, Anthony A. Maciejewski, Syed Amjad Ali, Mohammad Al-Otaibi, Mahir Aydin, Kumara Guru, Aaron Horiuchi, Yogish G. Krishnamurthy, Panho Lee, Ashish Mehta, Mohana Oltikar, Ron Pichel, Alan J. Pippin, Michael Raskey, Vladimir Shestak, Junxing Zhang
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02 (2005)

Heterogeneous computing systems composed of interconnected machines with varied computational capabilities often operate in environments where there may be sudden machine failures, higher than expected load, or inaccuracies in estimation of system parameters. Makespan (defined as the completion time for an entire set of tasks) is often the performance feature that is optimized in such systems. It is important that the makespan of a resource allocation (mapping) be robust against errors in task computation time estimates. The problem of optimally mapping tasks onto machines of a heterogeneous computing environment has been shown, in general, to be NP-complete. Therefore, heuristic techniques to find near optimal solutions to this mapping problem are required. The goal of this research is to find a static mapping of tasks so that the robustness of the desired system feature, makespan, is maximized against the errors in task execution time estimates. Seven heuristics to derive near-optimal solutions and an upper bound to this problem are presented and evaluated.
Upper bound for the approximation ratio of a class of hypercube segmentation algorithms
Authors: Jouni K. Seppänen
Venue: Information Processing Letters (2005)

The HYPERCUBE SEGMENTATION problem was recently introduced by Kleinberg et al. [J. ACM 51 (2004) 263-280], along with several algorithms that select each segment's prototype vector from the segment. The algorithms were shown to have an approximation ratio of at least 2(√2 - 1) ≈ 0.828. We show that a lemma used in this proof is tight, and that the asymptotic approximation ratio of no algorithm of this type can exceed 5/6 ≈ 0.833.
Review of "What Can be Automated by Bruce W. Arden", MIT Press, 1983, ISBN 0-262-51026-x.
Authors: Keith Price
Venue: Issue 89 (July 1984) (1984)

<u>What Can be Automated</u> is a massive tome that reports on the <u>C</u>omputer <u>S</u>cience and <u>E</u>ngineering <u>R</u>esearch <u>S</u>tudy (COSERS). In about 1K pages, it presents a record of research in computer science with some evaluation of the past results and projections of the future directions for research. The title comes from the fact that most of Computer Science is concerned with the problems of automating various manual tasks, be it numerical computations, database management, weather forecasting, industrial processes, or language understanding.
Recent Dissertations
Authors: Lewis Johnson
Venue: ACM SIGART Bulletin (1992)

This dissertation describes PAGODA (Probabilistic Autonomous GOal-Directed Agent), a model for an intelligent agent that learns autonomously in domains containing uncertainty. The model includes techniques for deciding what to learn, selecting a learning bias, inductive learning of probabilistic theories, and planning with the learned theories. PAGODA has been implemented and tested in a simulated robot environment. The model and the results of the tests are summarized, and future work and conclusions are presented briefly.
3D Geometric and Optical Modeling of Warped Document Images from Scanners
Authors: Li Zhang, Zheng Zhang, Chew Lim Tan, Tao Xia
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

When one scans a document page from a thick bound volume, the curvature of the page to be scanned results in two kinds of distortion in the scanned document images: i) shade along the ýspineý of the book, ii) warping in the shade area. In this paper, we propose an efficient restoration method based on the discovery of the 3D shape of a book surface from the shading information in a scanned document image. We first build practical models namely a 3D geometric model and a 3D optical model for the practical scanning conditions to reconstruct the 3D shape of book surface. We next restore the scanned document image using this shape based on de-shading and dewarping models. Finally, we evaluate the restoration results by comparing the OCR (Optical Character Recognition) performance on the original and restored document images. The experiments show that the geometric and photometric distortions are mostly removed and the OCR results are improved markedly.
Managing projects with Webcollab
Authors: Mike Cohen
Venue: Linux Journal (2005)

Keep your project status info and the key files in one place with this easy-to-use tool.
Perceptual Biases in Tactile Flow
Authors: Antonio Bicchi, Davide Dente, Enzo Pasquale Scilingo, Nicola Sgambelluri
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper we report on results of a psychophysical experiment in which the optic illusion of Ouchi is reproduced in the tactile domain. In the vision field, when eyes scan over a texture grid, consisting in two rectangular checkerboard patterns oriented in orthogonal directions, the inset pattern appears to move relatively to the surrounding grid. A simplified 3D version of this pattern was realized and a group of subjects were asked to touch it while it was vibrating. Outcomes of this experiment are discussed in terms of tactile flow and the related aperture problem.
An effective hybrid algorithm for the problem of packing circles into a larger containing circle
Authors: De-fu Zhang, An-sheng Deng
Venue: Computers and Operations Research (2005)

Simulated annealing is a powerful stochastic search method, but it still has the disadvantage of blind search. Tabu search (TS) which can prevent cycling and enhance diversification, is an adaptive strategy based on tabu list. By reasonably combining simulated annealing with TS, an effective hybrid algorithm for the problem of packing circles into a larger containing circle is presented. Based on a special neighborhood and tabu strategy, some benchmark problem instances can be well solved by the presented hybrid algorithm, and the computational results can compete with the best literature results.
A Parallelized Design for an Elliptic Curve Cryptosystem Coprocessor
Authors: Fabio Sozzani, Guido Bertoni, Stefano Turcato, Luca Breveglieri
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In many applications a software implementation of ECC (Elliptic Curve Cryptography) might be inappropriate due to performance requirements, therefore hardware implementations are needed. We present some results about a novel hardware implementation for ECC, that introduces also a form of parallelism to maximize the use of function units and hence to improve the throughput. Then we propose a comprehensive comparison of this new architecture with both some RSA architectures and other ECC implementations in ASIC VLSI technology.
Automatic Decomposition of Java Program for Implementation on Mobile Terminals
Authors: Takaaki Umedu, Shigeharu Urata, Akio Nakata, Teruo Higashino
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In this paper, we propose a method for partitioning a given application program that exceeds resource limits of mobile terminals into two module sets. Only a part of modules of the given application is assigned on a mobile terminal and the rest of modules are running on its proxy server, and that the mobile terminal invokes the modules on the server using remote method invocation. It is desirable that we can minimize the total amount of communication, delay time and power consumption between the mobile terminal and its server (here, we call the total amount as the total cost). In the proposed technique, first, a given Java program is repeatedly simulated on a single machine, and we collect the statistics information to estimate the total cost. Then, we give the resource limitation of the mobile terminal such as the memory size and an objective function that shows what total cost should be minimized. Under those constraints, our tool divides optimized division by using Simulated Annealing (SA). We have applied our technique to some application programs and examined its usefulness by evaluating their total costs.
Study and comparison of genetic algorithms when applied to lego mindstorms robots
Authors: Jacob B. Schrum
Venue: Journal of Computing Sciences in Colleges (2004)

Genetic algorithms simulate the process of natural selection in order to solve a given problem. In this case the problem to be solved was the ability of a Lego Mindstorms robot to navigate in a confined space without colliding with obstacles. The robot was equipped with proximity sensor and touch sensors to provide it with information about its environment. Two programs were coded: one in Not-Quite-C and the other in LeJOS. The ability of the programs to "evolve" working solutions to the problem was tested, and the results of the two programs were compared to each other in order to determine the relative effectiveness of each. 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
Immersive Panoramic Imagery
Authors: Mark Fiala
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

An immersive experience where one views imagery captured from a panoramic camera with a head mounted display (HMD) or "cave" display system is an example of image processing that would be appreciated by the masses.In such a system, a user can see what would be seen from several viewpoints in a natural way by simply moving their head around. Virtual perspective views would be generated from recorded imagery collected by a panoramic camera from a set of locations.With image based rendering techniques, the user could also see views from view-points different from where the panoramic camera was placed.This paper proposes a simple framework for designing such systems based on image cubes which has the benefits of fast low latency operation and an efficient way to create intermediate images. The image cube method de-couples the image creation from the output image generation for the low latency required for realistic HMD immersive viewing. A fast algorithm for generating intermediate views along linear paths between capture sites based on pre-calculated disparity maps is also presented. A prototype system is shown.
Fast data-locality profiling of native execution
Authors: Erik Berg, Erik Hagersten
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Performance tools based on hardware counters can efficiently profile the cache behavior of an application and help software developers improve its cache utilization. Simulator-based tools can potentially provide more insights and flexibility and model many different cache configurations, but have the drawback of large run-time overhead.We present StatCache, a performance tool based on a statistical cache model. It has a small run-time overhead while providing much of the flexibility of simulator-based tools. A monitor process running in the background collects sparse memory access statistics about the analyzed application running natively on a host computer. Generic locality information is derived and presented in a code-centric and/or data-centric view.We evaluate the accuracy and performance of the tool using ten SPEC CPU2000 benchmarks. We also exemplify how the flexibility of the tool can be used to better understand the characteristics of cache-related performance problems.
Stability and control in a system with the first integral
Authors: V. N. Tkhai
Venue: Automation and Remote Control (2005)

A problem for stability of a zero solution of the system of ODEs with the first integral is solved. Using the above system as an example, the concept of the choice of a control employing in a substantial way the properties of a closed system is displayed.
Reducing the Scheduling Critical Cycle Using Wakeup Prediction
Authors: Todd E. Ehrhart, Sanjay J. Patel
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

For highest performance, a modern microprocessor must be able to determine if an instruction is ready in the same cycle in which it is to be selected for execution. This creates a cycle of logic involving wakeup and select. However, the time a static instruction spends waiting for wakeup shows little dynamic variance. This idea is used to build a machine where wakeup times are predicted, and instructions executed too early are replayed. This form of self-scheduling reduces the critical cycle by eliminating the wakeup logic at the expense of additional replays. However, replays and other pipeline effects affect the cost of misprediction. To solve this, an allowance is added to the predicted wakeup time to decrease the probability of a replay. This allowance may be associated with individual instructions or the global state, and is dynamically adjusted by a gradient-descent minimum-searching technique. When processor load is low, prediction may be more aggressive ¿ increasing the chance of replays, but increasing performance, so the aggressiveness of the predictor is dynamically adjusted using processor load as a feedback parameter.
Clustering of time-series subsequences is meaningless: implications for previous and future research
Authors: Eamonn Keogh, Jessica Lin
Venue: Knowledge and Information Systems (2005)

Given the recent explosion of interest in streaming data and online algorithms, clustering of time-series subsequences, extracted via a sliding window, has received much attention. In this work, we make a surprising claim. Clustering of time-series subsequences is meaningless. More concretely, clusters extracted from these time series are forced to obey a certain constraint that is pathologically unlikely to be satisfied by any dataset, and because of this, the clusters extracted by any clustering algorithm are essentially random. While this constraint can be intuitively demonstrated with a simple illustration and is simple to prove, it has never appeared in the literature. We can justify calling our claim surprising because it invalidates the contribution of dozens of previously published papers. We will justify our claim with a theorem, illustrative examples, and a comprehensive set of experiments on reimplementations of previous work. Although the primary contribution of our work is to draw attention to the fact that an apparent solution to an important problem is incorrect and should no longer be used, we also introduce a novel method that, based on the concept of time-series motifs, is able to meaningfully cluster subsequences on some time-series datasets.