ppxscal/embedding_network huggingface dataset:
Hands-free mouse-pointer manipulation using motion-tracking and speech recognition
Authors: Frank Loewenich, Frederic Maire
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

Technology is advancing at a rapid pace, automating many everyday chores in the process. Information technology (IT) is changing the way we perform work and providing society with a multitude of entertainment options. Unfortunately, in the past designers of many software systems have not considered the disabled as active users of technology, and thus this significant part of the world population has often been neglected. A change in this mindset has been emerging in recent years, however, as private-sector organizations and governments have started to realize that including this user group is not only profitable, but also beneficial to society as a whole. This paper introduces an alternative method to the traditional mouse input device, using a modified Lucas-Kanade optical-flow algorithm for tracking head movements, and speech recognition to activate mouse buttons.
Speeding up evolutionary algorithms through asymmetric mutation operators
Authors: Benjamin Doerr, Nils Hebbinghaus, Frank Neumann
Venue: Evolutionary Computation (2007)

Successful applications of evolutionary algorithms show that certain variation operators can lead to good solutions much faster than other ones. We examine this behavior observed in practice from a theoretical point of view and investigate the effect of an asymmetric mutation operator in evolutionary algorithms with respect to the runtime behavior. Considering the Eulerian cycle problem we present runtime bounds for evolutionary algorithms using an asymmetric operator which are much smaller than the best upper bounds for a more general one. In our analysis it turns out that a plateau which both algorithms have to cope with changes its structure in a way that allows the algorithm to obtain an improvement much faster. In addition, we present a lower bound for the general case which shows that the asymmetric operator speeds up computation by at least a linear factor.
A Framework to build an object oriented mathematical tool with computer algebra system (CAS) capability
Authors: Dil Muhammad Akbar Hussain, Ole Thomsen Buus, Fsehazion Kiros, Nicholas Wichmann, Balatharan Selvarajah, Zaki Ahmad
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Computer Algebra System (CAS) applications are mathematical applications developed with the purpose of solving mathematical problems which are too difficult or even impossible to solve by hand. Modern versions of CAS applications are known for their rather large set of features such as support for graphical representations of results, symbolic manipulation, big-integer calculations, and complex-number arithmetic. The proposed idea in developing framework for a mathematical tool with CAS capability is derived from the motivation of object oriented design that integrate each application process in terms of an independent object module. Additional motivation is scalability and interface, meaning more functionality can be integrated without changing any core existed module, that is just create a new object and plug in.
Ontology module extraction for ontology reuse: an ontology engineering perspective
Authors: Paul Doran, Valentina Tamma, Luigi Iannone
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

Problems resulting from the management of shared, distributed knowledge has led to ontologies being employed as a solution, in order to effectively integrate information across applications. This is dependent on having ways to share and reuse existing ontologies; with the increased availability of ontologies on the web, some of which include thousands of concepts, novel and more efficient methods for reuse are being devised. One possible way to achieve efficient ontology reuse is through the process of ontology module extraction. A novel approach to ontology module extraction is presented that aims to achieve more efficient reuse of very large ontologies; the motivation is drawn from an Ontology Engineering perspective. This paper provides a definition of ontology modules from the reuse perspective and an approach to module extraction based on such a definition. An abstract graph model for module extraction has been defined, along with a module extraction algorithm. The novel contribution of this paper is a module extraction algorithm that is independent of the language in which the ontology is expressed. This has been implemented in ModTool; a tool that produces ontology modules via extraction. Experiments were conducted to compare ModTool to other modularisation methods.
Self-Adjusting Fuzzy Logic Control for Vehicle Lateral Control
Authors: Jie Ji, Yinong Li, Ling Zheng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

This paper deals with the lateral control of vehicles in Automated Highway Systems with the main emphasis on the lane change maneuvers. The desired trajectory for the lane change maneuvers, called the Virtual Desired Trajectory (VDT), is designed considering passenger's comfort and required transition time for the maneuver. The Self-Adjusting Fuzzy Logic controller is proposed as the tracking controller to make the vehicle to follow the VDT. Simulations have been conducted to evaluate the performance of the closed loop system under various driving conditions, and the results is presented to show the feasibility of using the designed Self-Adjusting Fuzzy Logic control for the lane change maneuver.
The CAD Challenge to Engineering Training and Practice-an Aerospace View
Authors: D. H. W. Harris
Venue: IEEE Computer Graphics and Applications (1981)

As we enter a period of high inflation, the aerospace industry is at a crossroads. While trying to hold the line on cost, managers are faced with growing customer and governmental requirements and the need for significant technological advances, particularly in the areas of improved performance and efficiency, longer life, and environmental safeguards.
Executable Grammars in Newspeak
Authors: Gilad Bracha
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We describe the design and implementation of a parser combinator library in Newspeak, a new language in the Smalltalk family. Parsers written using our library are remarkably similar to BNF; they are almost entirely free of solution-space (i.e., programming language) artifacts. Our system allows the grammar to be specified as a separate class or mixin, independent of tools that rely upon it such as parsers, syntax colorizers etc. Thus, our grammars serve as a shared executable specification for a variety of language processing tools. This motivates our use of the term executable grammar. We discuss the language features that enable these pleasing results, and, in contrast, the challenge our library poses for static type systems.
A Study on Applying Roles of Variables in Introductory Programming
Authors: Pauli Byckling, Jorma Sajaniemi
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

Expert programmers possess programming knowledge, which is language independent and abstract. Still, programming is mostly taught only via constructs of a programming language and explicit teaching of programming knowledge is often disregarded. Experts' high level programming knowledge can, however, be explicitly taught in an introductory programming course. This paper reports the results of a study in which the effects of teaching roles of variables to novices in an elementary programming course were examined. In the course expert programming knowledge was taught explicitly with the concept of roles and by using PlanAni, a role-based animator, which elaborates role knowledge and the concept of a variable in general. The study replicates methodologically our earlier study conducted in the same course a year earlier when roles were not used in the teaching. In this paper we discuss also the differences between the two student groups taught differently. The overall results show that students who were taught with roles learned high level programming plans faster and were able to use some complex programming plans better than students who were taught only with traditional methods.
A New Self-Adapting Knowledge Fusion System
Authors: Jin Gou, Yunliang Jiang, Yangyang Wu, Wei Luo
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

This paper presents a new knowledge fusion method with a feedback and self-adapting mechanism. Representing structure of distributed knowledge objects is uniformed by ontology technology and meta-knowledge. A detailed improved knowledge fusion algorithm based on genetic algorithm and semantic filter is described. The proposed feedback mechanism is based on message communication between knowledge space and application service, which can evaluate the fusion results and optimize the fusion process to adapt to the requirements. Experimental results of emulator procedures show the validity and feasibility of design rationale.
Feature extraction of a vectorcardiogram by employing a wavelet network guaranteeing a global minimum
Authors: Takashi Samatsu, Eiji Uchino, Takeshi Yamakawa
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2000)

This paper describes a wavelet network with convex wavelets. The distinctive features of this network are (1) guarantee of a global minimum, (2) good designability (the number of connection weights is determined by the resolution given by a designer) and (3) high ability of generalization especially in local nonlinearity. It is applied to feature extraction from a vectorcardiogram and its feature visualization.
The book review column
Authors: William Gasarch
Venue: ACM SIGACT News (2007)

In this column we review the following books. 1. The Political Mapping of Cyberspace by Jeremy W. Crampton. Reviewed by Rajesh Natarajan. 2. Probability and Computing: Randomized Algorithms and Probabilitic Analysis by Michael Mitzenmacher and Eli Upfal. There are two reviews, one by Jonathan Katz and one by Yannis C. Stamatiou. 3. Computational Techniques of the Simplex Method by Istv&aacute;n Maros. Review by Brian Borchers.
A Dynamic and Interactive Diagnosing and Testing Method for Development of Digital TV Receiver System
Authors: GuangDe Wang, Fang Miao, WenJia Zhang, HongYang Yu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Test is important to development of a large complex embedded system, like Digital TV system. A good test method gets twice the result with half the effort. The paper introduces a useful, dynamical and interactive diagnosing and test approach to the system. With this approach, some important OS's level object such as thread, queue, memory and semaphore related information could be collected as required and in real-time. Analyzing those could judge whether there are deadlocks, memory leaks, task starvation etc. Meanwhile a configurable stub module for collecting status and attribute of main software module is presented. Also a monitoring method of digital TV system was described. With those diagnose method and tools, bugs and issues could be located easily and some elusive problem could be solved efficiently. All the diagnosing tools and description were based on Nucleus OS and Conexant Corp.'s Digital TV chip cx2417x--one chip solution for DTV.
Remote Failure Analysis of Micro-Based Instrumentation
Authors: G. L. Zick
Venue: Computer (1977)

Microprocessors have brought flexibility and versatility to a wide range of instrumentation. They have brought new problems as well. Two such problems-the difficulty of remote reprogramming and the need in certain circumstances for peripheral storage-can be especially troublesome for the design engineer who needs to test his prototype instruments at the site of application.
A Burst Scheduling Access Reordering Mechanism
Authors: Jun Shao, Brian T. Davis
Venue: Proceedings of the 2007 IEEE 13th International Symposium on High Performance Computer Architecture (2007)

Utilizing the nonuniform latencies of SDRAM devices, access reordering mechanisms alter the sequence of main memory access streams to reduce the observed access latency. Using a revised M5 simulator with an accurate SDRAM module, the burst scheduling access reordering mechanism is proposed and compared to conventional in order memory scheduling as well as existing academic and industrial access reordering mechanisms. With burst scheduling, memory accesses to the same rows of the same banks are clustered into bursts to maximize bus utilization of the SDRAM device. Subject to a static threshold, memory reads are allowed to preempt ongoing writes for reduced read latency, while qualified writes are piggybacked at the end of bursts to exploit row locality in writes and prevent write queue saturation. Performance improvements contributed by read preemption and write piggybacking are identi-field. Simulation results show that burst scheduling reduces the average execution time of selected SPEC CPU2000 benchmarks by 21% over conventional bank in order memory scheduling. Burst scheduling also outperforms Intel's patented out of order memory scheduling and the row hit access reordering mechanism by 11% and 6% respectively.
TIP-OPC: a new topological invariant paradigm for pixel based optical proximity correction
Authors: Peng Yu, David Z. Pan
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

As the 193nm lithography is likely to be used for 45mm and even 32nm processes, much more stringent requirement will be posed on Optical Proximity Correction (OPC) technologies. Currently, there are two OPC approaches --- the model-based OPC (MB-OPC) and the inverse lithography technology (ILT). MB-OPC generates masks which is less complex compared with IL.T. But IL.T produces much better results than MB-OPC in terms of contour fidelity because ILT is a pixel based method. Observing that MB-OPC preserves the mask shape topologies which leads to a lower mask complexity, we combine the strengths of both methods --- the topology invariant property and the pixel based mask representation. To the best of our knowledge, it is the first time that this topological invariant pixel based OPC (TIP-OPC) paradigm is proposed, which fills the critical hole of the OPC landscape and potentially has many new applications. Our technical novelty includes the lithography friendly mask topological invariant operations, the efficient Fast Fourier Transform based cost function sensitivity computation and the TIP-OPC algorithm. The experimental results show that TIP-OPC can achieve much better post OPC contours compared with MB-OPC while maintaining the mask shape topologies.
Graph Matching Constraints for Synthesis with Complex Components
Authors: Ana Fuentes Martinez, Krzysztof Kuchcinski
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In this paper we present a new method for high-level synthesis that enhances design flexibility, specialization and performance primarily conceived for programmable hardware. New programmable hardware devices often provide fast dedicated components that perform complex computations. Arbitrary complex computations can be efficiently extracted from the CDFG using our new graph matching constraint to produce final implementations that better suit the design to the targeted architecture. Our algorithm also reduces possible syntactic variances detecting semantically equivalent structures in the graph. This new graph matching constraint was integrated in our own Constraint Programming solver engine together with other constraints to naturally model the heterogeneous features present in the synthesis problem. The use of complex functional modules is taken into account in the optimization process during binding and scheduling yielding significantly shorter schedules and gains in terms of area and performance. We demonstrate our technique on a variety of HLS benchmarks and show that efficient design space exploration can be accomplished using this technique.
Using Fuzzy-Word Correlation Factors to Compute Document Similarity Based on Phrase Matching
Authors: Jun Won Lee, Yiu-Kai Ng
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

One of the Web information Retrieval (IR) problems these days is to identify redundant information that exist in (replicated) Web documents. These documents can eas- ily be found in several forms, such as documents in dif- ferent versions, small documents combined with others to form a larger document, etc. As the Web is becoming more and more popular, the number of documents on the Web is increasing on a daily basis, and filtering redundant ones among this huge number of documents becomes a more dif- ficult and an urgent task. As one of the solutions to this problem, we present a new method that identifies similar documents based on phrase matching using the fuzzy-word correlation factors among words in phrases. Since phrases can be treated as sequences of words in a sentence in any document, we consider the correlation factors of different words in any two phrases of two different documents to de- termine the degree of similarity of the phrases, which in turns can determine the similarity of the documents based on the number of matched phrases/sentences in the docu- ments. Experimental results show that our phrase-matching approach is accurate and outperforms the word-based sim- ilarity matching approach.
Sculptured Surfaces in Solid Models: Issues and Alternative Approaches
Authors: James Miller
Venue: IEEE Computer Graphics and Applications (1986)

The fields of surface modeling and solid modeling have been developing quite independently. Today users of each system find they must employ functionality traditionally present only in the other system. This article focuses on issues related to the incorporation of sculptured surface functionality into solid modeling systems. Mathematical concepts related to sculptured surface modeling are reviewed and approaches to the representation of intersection curves and trimmed surfaces are discussed. Difficulties arise from the high polynomial degree resulting from many free-form surface operations. Some methods are described that keep the surface degree low, while retaining many of the advantages of sculptured surfaces. Compromises may be required when integrating this technology into boundary representation (B-rep) and constructive solid geometry (CSG) solid modelers. 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
Optimization of road networks using evolutionary strategies
Authors: Frank Schweitzer, Werner Ebeling, Helge Rosé, Olaf Weiss
Venue: Evolutionary Computation (1997)

A road network usually has to fulfill two requirements: (i) it should as far as possible provide direct connections between nodes to avoid large detours; and (ii) the costs for road construction and maintenance, which are assumed proportional to the total length of the roads, should be low. The optimal solution is a compromise between these contradictory demands, which in our model can be weighted by a parameter. The road optimization problem belongs to the class of frustrated optimization problems. In this paper, a special class of evolutionary strategies, such as the Boltzmann and Darwin and mixed strategies, are applied to find differently optimized solutions (graphs of varying density) for the road network, depending on the degree of frustration. We show that the optimization process occurs on two different time scales. In the asymptotic limit, a fixed relation between the mean connection distance (detour) and the total length (costs) of the network exists that defines a range of possible compromises. Furthermore, we investigate the density of states, which describes the number of solutions with a certain fitness value in the stationary regime. We find that the network problem belongs to a class of optimization problems in which more effort in optimization certainly yields better solutions. An analytical approximation for the relation between effort and improvement is derived.
Semantic Layers for Illustrative Volume Rendering
Authors: Peter Rautek Stefan Bruckner Eduard Groller
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Direct volume rendering techniques map volumetric attributes (e.g., density, gradient magnitude, etc.) to visual styles. Commonly this mapping is specified by a transfer function. The specification of transfer functions is a complex task and requires expert knowledge about the underlying rendering technique. In the case of multiple volumetric attributes and multiple visual styles the specification of the multi-dimensional transfer function becomes more challenging and non-intuitive. We present a novel methodology for the specification of a mapping from several volumetric attributes to multiple illustrative visual styles. We introduce semantic layers that allow a domain expert to specify the mapping in the natural language of the domain. A semantic layer defines the mapping of volumetric attributes to one visual style. Volumetric attributes and visual styles are represented as fuzzy sets. The mapping is specified by rules that are evaluated with fuzzy logic arithmetics. The user specifies the fuzzy sets and the rules without special knowledge about the underlying rendering technique. Semantic layers allow for a linguistic specification of the mapping from attributes to visual styles replacing the traditional transfer function specification.
Self-Synchronized Asynchronous Sequential Machines
Authors: C. A. Rey
Venue: IEEE Transactions on Computers (1974)

In this correspondence, a new circuit structure is proposed which basically supresses the possibility of hazards and critical races in asynchronous sequential machines. In contrast to many approaches which try to solve these problems by changing the form of the automaton model, we suggest a more general "hardware" solution. This configuration provides performance extremely close to that of classical circuits while allowing substantial reduction in circuit cost.