ppxscal/embedding_network huggingface dataset:
Book review: Macintosh Printer Secrets by Larry Pina (Hayden Books 1990)
Venue: ACM SIGSMALL/PC Notes (1991)

In Macintosh Printer Secrets, the author, Larry Pina, does a credible job of covering dot-matrix and ink-jet printing on the Macintosh. I must admit that after reading this book, it is doubtful even the most diehard Macintosh user will come away without learning something new about printers and printing on the Mac. 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
CatchUp!: capturing and replaying refactorings to support API evolution
Authors: Johannes Henkel, Amer Diwan
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Library developers who have to evolve a library to accommodate changing requirements often face a dilemma: Either they implement a clean, efficient solution but risk breaking client code, or they maintain compatibility with client code, but pay with increased design complexity and thus higher maintenance costs over time.We address this dilemma by presenting a lightweight approach for evolving application programming interfaces (APIs), which does not depend on version control or configuration management systems. Instead, we capture API refactoring actions as a developer evolves an API. Users of the API can then replay the refactorings to bring their client software components up to date.We present catchup!, an implementation of our approach that captures and replays refactoring actions within an integrated development environment semi-automatically. Our experiments suggest that our approach could be valuable in practice.
Information gain ratio as term weight: the case of summarization of IR results
Authors: Tatsunori Mori
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

This paper proposes a new term weighting method for summarizing documents retrieved by IR system. Unlike query-biased summarization, our method utilizes not the information of query, but the similarity information among original documents by hierarchical clustering. To map the similarity structure of the clusters into the weight of each word, we adopt the information gain ratio of probabilistic distribution of each word as term weight.
Automatic hyperparameter estimation in probabilistic image restoration algorithm based on Gibbs microcanonical distribution
Authors: Kazuyuki Tanaka
Venue: Systems and Computers in Japan (2005)

For an original image given as an 8-gray-level image, the framework for image restoration is composed of Bayes statistics for the a priori probability distribution based on the microcanonical distribution. In this process, the a priori probability distribution serving as the microcanonical distribution is formulated on the basis of the variables characterizing the spatial flatness and smoothness of the image in terms of the number of nearest pixel pairs with different gray levels and the number of nearest pixel pairs with gray levels differing by 1. In the present paper, we propose a new method of estimation, from a degraded image, of the number of nearest pixel pairs with different gray levels and the number of nearest pixel pairs with gray levels differing by 1 in the original image. Then, based on that formulation, an iterative computation algorithm for the restoration of a 256-gray-level image is presented from the viewpoint of statistical mechanics. Through some numerical experiments, we investigate how the proposed method can improve the quality of the restored image. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 36(1): 68&ndash;78, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10365
Home Networking: The Missing Manual
Authors: Scott Lowe
Venue:  (2005)

Millions of computers around the world today are connected by the Internet, so why is it still so hard to hook up a few PCs in you own home? Whether you want to share an Internet connection, install WiFi, or maybe just cut down on the number of printers you own, home networks are supposed to help make your life easier. Instead, most aspiring home networkers get lost in a confusing maze of terms and technologies: 802.11g, Fast Ethernet, Cat 5 cable (or was it Cat 5e?), Powerline, and on and confusingly on. That's where Home Networking: The Missing Manual comes in. Using clear language, straightforward explanations, and a dash of humor, this book shows you how to do everything you need to set up a home network. Coverage includes: WiFi, Ethernet, or Powerline? There are several kinds of digital pipes that you can use to create your network, and none of them have friendly names. This book tells you what they are, explains the pros and cons of each, and helps you figure out what you need to buy, and how to install it. Windows and Mac info included. Half the battle in home networking takes place after you've bought your gear and plugged it in. That's because the routers, network adapters, and cables that you need get you only part way towards networking nirvana. Whether you've got PCs or Macs or both, you'll need help tweaking your computers' settings if you want to get all your machines talking to each other. This book covers most known operating system flavors, including Windows XP, 2000, Me, and 98, and Mac OS X and OS 9. Fun things to do with your network. The real fun starts once your network is up and running. This book shows you how to do much more than simply share an Internet connection and a printer. You'll learn how to stream music from your PCs to your stereo, how to display pictures on your TV, how to hook up game consoles to your network, and more! Most important, this book helps you understand the difference between what you need to know to create and use your home network and what's best left to those looking for a career as a system administrator. In Home Networking: The Missing Manual you'll find everything you need to get your network running-and nothing more.
Application of genetic algorithm to flight schedule planning
Authors: Nobue Adachi, Makihiko Sato, Shigenobu Kobayashi
Venue: Systems and Computers in Japan (2004)

The authors developed a system that automatically creates regular aircraft flight schedules and minimizes the total number of aircraft required. Since the target problems are real-world problems having constraints that are intertwined in a complex manner, the authors used a genetic algorithm to achieve the optimization. In this paper, the authors describe the problem setup and genetic algorithm configuration and verify the algorithm's effectiveness through experiments using real data. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 83&ndash;92, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10036
Phoenix software development system overview
Authors: A. F. Rosene
Venue: ACM SIGDA Newsletter (1978)

The Eastern Division Automated Software Development System is a life-cycle software development methodology expedited and enforced by use of a collection of software tools which run on the DECsystem-20 engineering computing facility. These three items - methodology, tools, and computer - have been integrated into a system which appears to the user as (1) commands which can be used to create, modify, and display the data which comprises the project design, (2) standards which are implemented and enforced by the execution of the commands, and (3) reports for management visibility. The objective of this system is to improve the quality, increase the management control, and reduce the costs of software. 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
Heuristic compression of an English word list: Research Articles
Authors: Robert P. Cook
Venue: Software&mdash;Practice Experience (2005)

The goal of the project was to design and implement an English word-list representation suitable for spell-checking in space-constrained environments. The compression algorithm was derived by statistically analyzing the word list. A compression ratio of 18&percnt; was achieved through a combination of prefix and suffix encoding. The compressed file can be randomly accessed by prefix marker positions. A simple spell-checker based on the encoding was implemented and tested in Java. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Color Image Segmentation in Visual Prostheses
Authors: Yilun Cao, Xudong Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

The area of visual prosthesis by electrically stimulating neural tissue of blind person is more and more attractive with the development of electrode array and biological technology. Processing the images captured by the camera is the first step in the whole project. We use a new algorithm to get the accurate edge of color images. The result is better than that obtained through some edge operators like Canny, Soble. Then we use simple methods to segment the image into regions that base on gray level to get the objects we most interest in images. Finally we integrate the results from the two steps above. These methods are simple and have low computational complexity that can be used in real time process and in the volume-limited chip. The result is good in visual prostheses and also adapt to pixelized vision in later steps.
StackOFFence: A Technique for Defending Against Buffer Overflow Attacks
Authors: Bharat B. Madan, Shashi Phoha, Kishor S. Trivedi
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Software coding practices, in the interest of efficiency, often ignore to enforce strict bound checking on buffers, arrays and pointers. This results in software code that is more vulnerable to security intrusions exploiting buffer overflow vulnerabilities. Unfortunately, such attacks form the most common type of security threats to the computer and information systems, making it imperative to find efficient solutions for the buffer overflow vulnerabilities. Typically, an attacker is able to affect a successful intrusion by causing buffer overflow in the stack frame of a function call, thereby causing the valid return address to get overwritten by a malicious value. This allows the attacker to redirect the return from a function call to a malicious piece of code introduced by the attacker. Depending on the nature of the malicious code, the attacker is able to compromise availability, integrity, or confidentiality of a system. Researchers have suggested transforming the return address or even using an entirely separate stack for managing the return addresses. This paper describes a simple technique that ensures the integrity of the return address by pushing on the stack two copies of the return address, a transformed (or encrypted) return address value along with the original one. Before popping the return address, two return address values are compared to detect any malicious activity, thus preventing the exploitation of the stack based buffer overflow vulnerabilities. The proposed modification may be implemented at the CPU architecture level or by simple modification to the compiler's prologue and epilogue code.
Interface changes causing accidents: an empirical study of negative transfer
Authors: Denis Besnard, Lucile Cacitti
Venue: International Journal of Human-Computer Studies (2005)

When expert operators interact with a new device, they inevitably reuse former interaction modes and actions. This phenomenon is due to the human cognition seeking resources savings. Schemas support this strategy and are implemented in such a way that perfection is disregarded at the profit of an intuitive trade-off between performance and cognitive resources savings. As a consequence, humans have a strong inclination to fit well-known solution procedures into new problems. For this reason, changes in work environments can cause accidents when they allow operators to interact with a new device if the latter is erroneously perceived as familiar. This research issue originates from an industrial background. The suspected cause of a fatal error performed by an operator in a steelworks factory is replicated in an experiment. The results support the hypothesis according to which errors (and possible subsequent accidents) due to changes in the interface are more likely when the latter does not inhibit former modes of interaction modes. This main result is discussed under the angle of cognitive ergonomics and used as a basis to provide design guidelines.
Monitoring k-Nearest Neighbor Queries over Moving Objects
Authors: Xiaohui Yu, Ken Q. Pu, Nick Koudas
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Many location-based applications require constant monitoring of k-nearest neighbor (k-NN) queries over moving objects within a geographic area. Existing approaches to this problem have focused on predictive queries, and relied on the assumption that the trajectories of the objects are fully predictable at query processing time. We relax this assumption, and propose two efficient and scalable algorithms using grid indices. One is based on indexing objects, and the other on queries. For each approach, a cost model is developed, and a detailed analysis along with the respective applicability are presented. The Object-Indexing approach is further extended to multi-levels to handle skewed data. We show by experiments that our grid-based algorithms significantly outperform R-tree-based solutions. Extensive experiments are also carried out to study the properties and evaluate the performance of the proposed approaches under a variety of settings.
Energy-aware variable partitioning and instruction scheduling for multibank memory architectures
Authors: Zhong Wang, Xiaobo Sharon Hu
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2005)

Many high-end DSP processors employ both multiple memory banks and heterogeneous register files to improve performance and power consumption. The complexity of such architectures presents a great challenge to compiler design. In this article, we present an approach for variable partitioning and instruction scheduling to maximally exploit the benefits provided by such architectures. Our approach is built on a novel graph model which strives to capture both performance and power demands. We propose an algorithm to iteratively find the variable partition such that the maximum energy saving is achieved while satisfying the given performance constraint. Experimental results demonstrate the effectiveness of our approach.
Adaptive anti-spam filtering for agglutinative languages: a special case for Turkish
Authors: Levent Özgür, Tunga Güngör, Fikret Gürgen
Venue: Pattern Recognition Letters (2004)

We propose anti-spare filtering methods for agglutinative languages in general and for Turkish in particular. The methods are dynamic and are based on Artificial Neural Networks (ANN) and Bayesian Networks. The developed algorithms are user-specific and adapt themselves with the characteristics of the incoming e-mails. The algorithms have two main components. The first one deals with the morphology of the words and the second one classifies the e-mails by using the roots of the words extracted by the morphological analysis. Two ANN structures, single layer perceptron and multi-layer perceptron, are considered and the inputs to the networks are determined using binary model and probabilistic model. Similarly, for Bayesian classification, three different approaches are employed: binary model, probabilistic model, and advanced probabilistic model. In the experiments, a total of 750 e-mails (410 spare and 340 normal) were used and a success rate of about 90% was achieved.
Book review: Readings in Distributed Artificial Intelligence. Ed by A. H. Bond and L. Gasser (Morgan Kaufmann, 1988)
Venue: Issue 110 (October 1989) (1989)

New sciences often begin as cliques of closely-coupled researchers. Precisely because the work is new, there are no journals focused on it, and the growing body of insights appears in privately circulated working papers and publications in the organs of disciplines only tangentially related to the central focus of the emerging field. This process has several results.
Semantics for a theory of defeasible reasoning
Authors: Quoc Bao Vo, Norman Y. Foo, Joe Thurbon
Venue: Annals of Mathematics and Artificial Intelligence (2005)

In this paper, we establish a formal semantics for Pollock's [23] theory of defeasible reasoning. As a notion of argument or argumentation has never been formalised in this theory, it is important that such a formal account be introduced to couple with the algorithmic description of the theory. In particular, it makes Pollock's theory become more comparable to other related frameworks as shown in the paper. In also enforces a well-defined semantical account for Pollock's theory of defeasible reasoning based on the argumentation-theoretic approach proposed by Dung and Bondarenko et al. [1,5]. Our formalisation thus enables further studies to the meta-theoretic properties of Pollock's defeasible reasoning system.
A Java web application for allowing multiuser collaboration and exploration of existing VRML worlds
Authors: Clifton G. M. Presser
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

This work describes a new Java web application that enables users to explore and annotate VRML worlds collaboratively. The web application consists of a Java servlet, Java Server Pages (JSP) and supporting classes. There are two significant features of this work. First, users can explore existing standard VRML worlds collaboratively with automatic multiuser augmentation. Second, the user is free from the inconsistencies of interacting web browsers, a VRML browsers and a Java virtual machines. The clients are only required to have a web browser and a working VRML browser that can employ ECMAScript script nodes. Further, Java is not required on the client end. Through this web application, users can collaboratively navigate and annotate a virtual world with images, audio, text, video, viewpoints and tours.
Context management for end user development of context-aware applications
Authors: Panu Korpipää, Esko-Juhani Malm, Ilkka Salminen, Tapani Rantakokko, Vesa Kyllönen, Ilkka Känsälä
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Mobile device context-aware features should be closely coupled to the end user demands. This is achieved by enabling end user development of context-aware applications. A context framework and a tool are presented for facilitating easy customization of context-aware features into existing mobile terminal applications. A blackboard-based context framework for mobile devices is extended with a component for handling user-defined context-action rules, and a component for activating application actions. Example cases of context-aware features customized with the implemented framework and the tool are presented, with discussion of the potential scope of end user development in mobile devices.
CAD for LSI: productions's interest is in its economics
Authors: J. G. M. Klomp
Venue: ACM SIGDA Newsletter (1976)

CAD for LSI design means a total package from basic circuit analysis up to programs which generate tapes for numerical controlled pattern generators and testing equipment.
The global digital divide in the Internet: developed countries constructs and Third World realities
Authors: Jeffrey James
Venue: Journal of Information Science (2005)

Defined as the differential degree to which rich and poor countries benefit from new information and communications technologies such as the Internet, the global digital divide is widely measured by international institutions in terms of the number of persons with individual access to those technologies. Yet, while this measure makes sense in the rich countries, where individual ownership is widespread among the population, it makes very little sense in poor countries. For, in the latter, what we find is that although individual access is indeed very limited, a remarkable number of local innovations ensure that the benefits of the Internet are made available to at least 10 million people throughout the Third World. Many such persons are illiterate, unskilled and resident in the rural areas of developing countries. These findings directly contradict the commonly held notion that there are few, if any, local innovations in the applications of the Internet outside the rich countries and those parts of poorer countries with close connections to the former (most typically through multinational corporations). From a policy point of view, we suggest that foreign aid donors and national governments pay less attention to providing individual access facilities such as so-called telecentres and focus instead on ways to foster indigenous rural innovation systems devoted to finding relevant and cost-effective applications of the Internet.
Finite element mesh generation over intersecting curved surfaces by tracing of neighbours
Authors: S. H. Lo, W. X. Wang
Venue: Finite Elements in Analysis and Design (2005)

The use of discrete data to represent engineering structures as derivatives from intersecting components requires algorithms to perform Boolean operations between groups of triangulated surfaces. In the intersection process, an accurate and efficient method for the determination of intersection lines is a crucial step for large scale and complex surface intersections. Given the node numbers at the vertices of the triangles, the neighbour relationship is first established. A background grid is employed to limit the scope of searching for candidate triangles that may intersect. This will drastically reduce the time of geometrical check for intersections between triangles, making the surface intersection and mesh generation a quasi-linear process with respect to the number of elements involved. The intersection lines are determined by the robust algorithm based on tracing the neighbours of intersecting triangles. In the determination of intersection between two triangles, four fundamental cases are identified and treated systematically to enhance robustness and reliability.In this paper, the consistent treatment of mesh generation along intersection lines is emphasized. The procedure ensures that all mesh generation operations are carried out on the surface concerned without leaving the surface so that elements generated will always be on the surface. Five examples on a great variety of surface and mesh characteristics are given to illustrate the efficiency and robustness of the algorithm.
NLP research at the Yale AI Project
Authors: Natalie Dehn
Venue: Issue 79 (January 1982) (1982)

The Yale Al Project is an interdisciplinary research effort, made up primarily of computer scientists and psychologists, but also including, over the last several years, researchers trained in linguistics, philosophy, and anthropology. Current graduate students are officially affiliated with either the Computer Science or Psychology departments, but are educated, beyond general departmental requirements as Cognitive Scientists.