ppxscal/embedding_network huggingface dataset:
Behind Deep Blue: Building the Computer that Defeated the World Chess Champion
Authors: Feng-Hsiung Hsu
Venue:  (2002)

:On May 11, 1997, as millions worldwide watched a stunning victory unfold on television, a machine shocked the chess world by defeating the defending world champion, Garry Kasparov. Written by the man who started the adventure, Behind Deep Blue reveals the inside story of what happened behind the scenes at the two historic Deep Blue vs. Kasparov matches. This is also the story behind the quest to create the mother of all chess machines. The book unveils how a modest student project eventually produced a multimillion dollar supercomputer, from the development of the scientific ideas through technical setbacks, rivalry in the race to develop the ultimate chess machine, and wild controversies to the final triumph over the world's greatest human player. In nontechnical, conversational prose, Fenghsiung Hsu, the system architect of Deep Blue, tells us how he and a small team of fellow researchers forged ahead at IBM with a project they'd begun as students at Carnegie Mellon in the mid-1980s: the search for one of the oldest holy grails in artificial intelligence -- a machine that could beat any human chess player in a bona fide match. Back in 1949 science had conceived the foundations of modern chess computers but not until almost fifty years later -- until Deep Blue -- would the quest be realized. Hsu refutes Kasparov's controversial claim that only human intervention could have allowed Deep Blue to make its decisive, "uncomputerlike" moves. In riveting detail he describes the heighteing tension in this war of brains and nerves, the "smoldering fire" in Kasparov's eyes. Behind Deep Blue is not just another tale of man versus machine. This fascinating book tells us how man as genius was given an ultimate, unforgettable run for his mind, no, not by the genius of a computer, but of man as toolmaker.
Efficient Global Optimization for Image Registration
Authors: Y. Chen, R. R. Brooks, S. S. Iyengar, N. S. V. Rao, J. Barhen
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

The image registration problem of finding a mapping that matches data from multiple cameras is computationally intensive. Current solutions to this problem tolerate Gaussian noise, but are unable to perform the underlying global optimization computation in real time. This paper expands these approaches to other noise models and proposes the Terminal Repeller Unconstrained Subenergy Tunneling (TRUST) method, originally introduced by Cetin et al. as an appropriate global optimization method for image registration. TRUST avoids local minima entrapment, without resorting to exhaustive search by using subenergy-tunneling and terminal repellers. The TRUST method applied to the registration problem shows good convergence results to the global minimum. Experimental results show TRUST to be more computationally efficient than either tabu search or genetic algorithms.
Hierarchical Case-Based Reasoning Integrating Case-Based and Decompositional Problem-Solving Techniques for Plant-Control Software Design
Authors: Barry Smyth, Mark T. Keane, Pádraig Cunningham
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Case-based reasoning (CBR) is an artificial intelligence technique that emphasises the role of past experience during future problem solving. New problems are solved by retrieving and adapting the solutions to similar problems, solutions that have been stored and indexed for future reuse as cases in a case-base. The power of CBR is severely curtailed if problem solving is limited to the retrieval and adaptation of a single case so most CBR systems dealing with complex problem solving tasks have to use multiple cases. This paper describes and evaluates the technique of hierarchical case-based reasoning, which allows complex problems to be solved by reusing multiple cases at various levels of abstraction. The technique is described in the context of Déjà Vu, a CBR system aimed at automating plant-control software design.
The De Casteljau Algorithm on Lie Groups and Spheres
Authors: P. Crouch, G. Kun, F. Silva Leite
Venue: Journal of Dynamical and Control Systems (1999)

We examine the De Casteljau algorithm in the context of Riemannian symmetric spaces. This algorithm, whose classical form is used to generate interpolating polynomials in {\Bbb R}^n, was also generalized to arbitrary Riemannian manifolds by others. However, the implementation of the generalized algorithm is difficult since detailed structure, such as boundary value expressions, has not been available. Lie groups are the most simple symmetric spaces, and for these spaces we develop expressions for the first and second order derivatives of curves of arbitrary order obtained from the algorithm. As an application of this theory we consider the problem of implementing the generalized De Casteljau algorithm on an m-dimensional sphere. We are able to fully develop the algorithm for cubic splines with Hermite boundary conditions and more general boundary conditions for arbitrary m.
Some bounds for the b-chromatic number of a graph
Authors: Mekkia Kouider, Maryvonne Mahéo
Venue: Discrete Mathematics (2002)

In this paper we study the b-chromatic number of a graph G. This number is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i has at least one representant xi adjacent to a vertex of every color j, 1 ≤ j ≠ i ≤ k. The main result is the determination of two lower bounds for the b-chromatic number of the cartesian product of two graphs.
Completing the Job Interface Design
Authors: Jim Rudolf, Cathy Waite
Venue: IEEE Software (1992)

HyperNews, a user-interface management system that lets a user separate application and interface design to link a new interface to an old application with very little programming, is described. Much of a HyperNews interface can be designed without writing any code at all. With direct manipulation, a user can design a graphical user interface simply by creating, moving, and resizing objects on the screen. Experimentation with different interface styles is possible with less effort in HyperNews compared to specification languages and tool kits, and immediate feedback can result in extremely fast development. The ways HyperNews provides communication capabilities among all HyperNews objects (such as control objects, cards, backgrounds, and stacks) and links interfaces to internal applications, which were developed within HyperNews, to external applications, or to existing applications developed without HyperNews are discussed.
Guest Editorial
Authors: S. S. Yau
Venue: IEEE Transactions on Computers (1989)

No abstract availavle. 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
Systematic Integration of Design Methods
Authors: Xiping Song
Venue: IEEE Software (1997)

Design method integration has many benefits, but designers lack a framework to make such efforts more systematic and cost effective. The author describes a possible framework and uses it to guide the integration of the Booch and OMT design methods.
Dynamic Spatial Channel Assignment for Smart Antenna
Authors: Zhenghe Feng, Zhijun Zhang
Venue: Wireless Personal Communications: An International Journal (1999)

The paper describes an optimal dynamic channel assignment algorithm for smart antennas. This algorithm can deal with the Spatial Division Multiple Access (SDMA) and traditional channel multiple accesses (FDMA, TDMA, or CDMA) simultaneously to enlarge the capacity of communication systems. This algorithm has several merits, including less computer time, the largest capacity, and avoidance of co-channel interference. The paper also describes the idea of a spatial channel pattern, in which several users can share a channel. Several simulation results are presented in the paper.
On (P5, diamond)-free graphs
Authors: Claudio Arbib, Raffaele Mosca
Venue: Discrete Mathematics (2002)

We study the stability number, chromatic number and clique cover of graphs with no induced P5 and diamonds. In particular, we provide a way to obtain all imperfect (P5, diamond)-free graphs by iterated point multiplication or substitution from a finite collection of small basic graphs. Corollaries of this and other structural properties, among which a result of Bacsó and Tuza, are (i) combinatorial algorithms to solve coloring, clique cover and stable set in the class of (P5, diamond)-free graphs, (ii) a complete description of the stable set polytope of (P5, diamond)-free graphs, and (iii) the existence of non-trivial h-perfect graphs which are not t-perfect.
Stock Photo Smart: How to Choose and Use Digital Stock Photography
Authors: Joe Farace
Venue:  (1998)

:This is the first book available to the designer and the desktop publisher that provides information on finding the right digital stock photos, managing the images that you have acquired, and designing with digital photos. Each chapter addresses in detail a different user element in various areas, making this the essential addition to every designer's desktop reference library.
Symbolic vs. Connectionist Learning: An Experimental Comparison in a Structured Domain
Authors: Pasquale Foggia, Roberto Genna, Mario Vento
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

During the last two decades, the attempts of finding effective and efficient solutions to the problem of learning any kind of structured information have been splitting the scientific community. A ¿holy war¿ has been fought between the advocates of a symbolic approach to learning and the advocates of a connectionist approach. One of the most repeated claims of the symbolic party has been that symbolic methods are able to cope with structured information while connectionist ones are not. However, in the last few years, the possibility of employing connectionist methods for structured data has been widely investigated and several approaches have been proposed. Does this mean that the connectionist partisans are about to win the ultimate battle? Is connectionism the ¿One True Approach¿ to knowledge learning? The paper discusses this topic and gives an experimental answer to these questions. In details, first, a novel algorithm for learning structured descriptions, ascribable to the category of symbolic techniques, is proposed. It faces the problem directly in the space of graphs by defining the proper inference operators, as graph generalization and graph specialization, and obtains general and consistent prototypes with a low computational cost with respect to other symbolic learning systems. Successively, the proposed algorithm is compared with a recent connectionist method for learning structured data [17] with reference to a problem of handwritten character recognition from a standard database publicly available on the Web. Finally, after a discussion highlighting pros and cons of symbolic and connectionist approaches, some conclusions, quantitatively supported by the experimental data, are drawn. The orthogonality of the two approaches strongly suggests their combination in a multiclassifier system so as to retain the strengths of both of them, while overcoming their weaknesses. The results on the experimental case-study demonstrated that the adoption of a parallel combination scheme of the two algorithms could improve the recognition performance of about 10 percent. A truce or an alliance between the symbolic and the connectionist worlds?
Performance Analysis of Affinity Clustering on Transaction Processing Coupling Architecture
Authors: P. S. Yu, A. Dan
Venue: IEEE Transactions on Knowledge and Data Engineering (1994)

Coupling multiple computing nodes for transaction processing has become increasingly attractive for reasons of capacity, cost, and availability. This paper presents a comparison of robustness (in terms of performance) of three different architectures for transaction processing. In the shared nothing (SN) architecture, neither disks nor memories are shared. In the shared disk (SD) architecture, all disks are accessible from all nodes, whereas in the shared intermediate memory (SIM) architecture, a shared intermediate level of memory is introduced. Coupling multiple nodes inevitably introduces certain interferences and overheads, which take on different forms and magnitudes under the different architectures. Affinity clustering, which attempts to partition the transactions into affinity clusters according to their database reference patterns, can be employed to reduce the coupling degradation under the different architectures, though in different ways. However, the workload may not be partitionable into N affinity clusters of equal size, where N is the number of nodes in the coupled system, so that the load can be evenly spread over all nodes. In addition to balancing the load, we need to maintain a large fraction of data references within the database affiliated with the affinity cluster. These become increasingly harder to achieve for large values of N. In this paper, we examine the impact of affinity on the performance of these three different coupling architectures.
Hyperplane Approximation for Template Matching
Authors: Frédéric Jurie, Michel Dhome
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Hager and Belhumeur recently proposed a general framework for object tracking in video images. It consists of low-order parametric models for the image motion of a target region. These models are used to predict movement and to track the target. The difference in intensity between the pixels belonging to the current region and the pixels of the selected target (learned during an offline stage) allows a straightforward prediction of the region position in the current image. The main aim of this article is to propose an important improvement within this framework, making the convergence faster with the same amount of online computation.
A visual programming approach for teaching cognitive modelling
Authors: Trevor D. Collins, Pat Fung
Venue: Computers Education (2002)

This paper describes an investigation into the use of a visual programming language to teach computer-based modelling to undergraduate cognitive psychology students. Four sets of evaluation studies were carried out. The findings of these theoretical and empirical evaluations are related to the design principles that informed the language and the context in which it was examined. The educational benefits of gaining some practical experience of cognitive modelling where highlighted in these studies, as was the importance of introducing the visual language within a sound teaching framework. The comments of the students and tutors regarding the use of the Hank visual programming language to teach cognitive modelling indicate that Hank avoids some of the syntactic problems associated with textual programming languages, it can be used to illustrate the flow of control during a program's execution, and it is intuitive and easy to use.
A Formal Approach to Managing Design Processes
Authors: Reid A. Baldwin, Moon Jung Chung
Venue: Computer (1995)

To capture market opportunities, competition within the microelectronics industry demands ever-faster product development, which means ever-shorter design cycles. Shorter design cycles can be achieved by carefully managing the design process during rapid prototyping. Traditionally, designers have used whatever tools were convenient at the time. This practice has resulted in steps being skipped and designs not being checked for important criteria until it's too late to make changes. These problems can be avoided through design methodology management, which ensures that appropriate tools are selected and executed in the appropriate sequence. The authors propose a maintainable, flexible methodology management system that supports parallel execution of methodologies. Although initially developed for digital hardware synthesis, this system can also apply to such domains as software development. The prototype is based on process flow graphs and design process grammars. The graphs describe the information flow of a design process, while the grammars transform high-level process flow graphs into progressively more detailed ones. The designer interacts with a Unix program called Cockpit, which tracks process flow graphs and informs the designer of possible actions. Process flow graphs are developed in a top-down manner by applying a set of substitution rules to nodes that represent abstract tasks. New tools and processes can easily be integrated into the framework.
Polling an Image for Circles by Random Lines
Authors: Y. C. Cheng, Y.-S. Liu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

A new random sampling strategy, designed for retrieving subsets consisting of two edge pixels from an input image, is proposed as the sampling process for RANSAC circle detection using coaxal transform. The proposed strategy is shown to have the following advantages over the conventional random sampling strategy. First, a poll size can be planned in a principled manner. Second, once a poll size is set, the probability that a circle is missed by the sampling process is kept relatively constant regardless of noise. Third, the actual number of subsets taken is automatically adjusted for different image complexities. Experimental results in agreement with the claimed advantages are presented.
Performance Tools
Authors: Kathleen D. Nichols
Venue: IEEE Software (1990)

Performance tools are a way of making systematic the work needed to carry out performance studies so that several studies can be carried out more easily and be compared in a consistent way. After a brief overview by K. Nichols, 11 selected tools are introduced, in separate presentations, by their originating organizations. Four are strictly commercial products; most of the rest are available for a small distribution fee. They cover algorithms, architectures, their interactions, and testing of programs to meet real-time constraints. They target a range of systems: communications, computers, manufacturing, control, and embedded systems. Subjects included in the descriptions include Ada program tuning, real-time monitoring of N-cube programs, animated and analytical solution of queueing-system models, real-time and postmortem event-trace display, instrumented systems, and discrete-event simulation. The tools covered are: Network Architecture Simulation System; Q+, PM; Perspective; Axe; Hyperview; Simple/Care; Poker; Triplex; Arts; and Jed.
Composing Domain-Specific Design Environments
Authors: Ákos Lédeczi, Árpád Bakay, Miklós Maróti, Péter Völgyesi, Greg Nordstrom, Jonathan Sprinkle, Gábor Karsai
Venue: Computer (2001)

Domain-specific integrated development environments can help capture specifications in the form of domain models. These tools support the design process by automating analysis and simulating essential system behavior. In addition, they can automatically generate, configure, and integrate target application components. The high cost of developing domain-specific, integrated modeling, analysis, and application- generation environments prevents their penetration into narrower engineering fields that have limited user bases. Model-integrated computing (MIC), an approach to model-based engineering that helps compose domain-specific design environments rapidly and cost effectively, is particularly relevant for specialized computer-based systems domains--perhaps even single projects. The authors describe how MIC provides a way to compose such environments cost effectively and rapidly by using a metalevel architecture to specify the domain-specific modeling language and integrity constraints. They also discuss the toolset that implements MIC and describe a practical application in which using the technology in a tool environment for the process industry led to significant reductions in development and maintenance costs.
Selective memoization
Authors: Umut A. Acar, Guy E. Blelloch, Robert Harper
Venue: ACM SIGPLAN Notices (2003)

We present a framework for applying memoization selectively. The framework provides programmer control over equality, space usage, and identification of precise dependences so that memoization can be applied according to the needs of an application. Two key properties of the framework are that it is efficient and yields programs whose performance can be analyzed using standard techniques.We describe the framework in the context of a functional language and an implementation as an SML library. The language is based on a modal type system and allows the programmer to express programs that reveal their true data dependences when executed. The SML implementation cannot support this modal type system statically, but instead employs run-time checks to ensure correct usage of primitives.
Calling Down the Lightning
Venue: IEEE Software (1994)

The bolt of lightning that sparks a new product idea is totally unpredictable. The authors consider the crucial question for a product-development organization: what context allows creativity to happen and how does an organization call down the lightning? They consider the example of spreadsheet design.
Calculation of gas hydrate equilibrium in the presence of aqueous salt solutions using a new predictive activity model
Authors: A. Jøssang, E. Stange
Venue: Iranian Journal of Science and Technology (2002)

The objective of this work is to develop a general and predictive hydrate model for hydrates in equilibrium with brines. The model developed, only needs the ionic radius, the charge on the ions and the concentration of each salt to predict the inhibition effect of the salts in the brines. The model has proven to be consistent with experimental data.
Simulation-based Testing of Communication Protocols for Dependable Embedded Systems
Authors: Guillermo A. Alvarez, Flaviu Cristian
Venue: The Journal of Supercomputing (2000)

We present a novel approach to testing fault-tolerant and real-time protocol implementations. Cesium, our testing environment, executes the protocols in a centralized simulator of the distributed system. It simulates the occurrence of inputs and the failure scenarios the protocols are designed to tolerate, while automatically verifying that the required safety and timeliness properties hold at all times during test experiments. Within this framework, the human tester can define failure operations that simulate every failure class studied in the literature. We apply our approach to two fault-tolerant protocols typical in embedded systems. The results show that Cesium can pinpoint implementation errors that would be very difficult to identify in a real system, and can also compute accurate performance predictions that would be problematic to measure in the real embedded platform without ad hoc hardware instrumentation.
SAPS: A Production System with Active Data Structures
Authors: John W. Benoit
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

SAPS (still another production system), a specialized forward chaining production system developed to support research in planning and plan recognition systems, is described. This planning research is based on mixed initiative development of military logistic and tactical operations plans. To support it, SAPS was designed with a flexible, innovative control structure and an unusual use of active plan nodes and data structures. SAPS synthesizes networks of independent, active nodes that support planning activities, an approach that applies to problem solving in general. SAPS views computation as a network of cooperating, independent nodes, each able to perform arbitrary computation. Each node is controlled by activating and deactivating rule sets assigned to it. Even though the same rule set can be assigned to several nodes, the control is by rule sets in each node. As an example, SAPS is applied to the n queens problem.