ppxscal/embedding_network huggingface dataset:
Supervisory control of the real-time fuzzy control systems
Authors: N. Muškinja
Venue: Systems Analysis Modelling Simulation (2003)

In real-time applications a discrete supervisory controller should stabilise the fuzzy control system. For this reason a discrete supervisory controller was developed and applied together with the fuzzy controller. The discrete supervisory controller performs like a continuous one. The main difference is in the sign function of the appended controller. We have proved that the fuzzy control system equipped with the discrete supervisory controller is globally stable only if we can predict the sign of supervisory action. On the other hand, discrete supervisory controllers require the knowledge of the bounds of the non-linear functions in the system, same as continuous one. Application to a balance control system was successful, both in simulations and in real-time control.
A Bidding Protocol for Deploying Mobile Sensors
Authors: Guiling Wang, Guohong Cao, Tom La Porta
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

In some harsh environments, manually deploying sensors is impossible. Alternative methods may lead to imprecise placement resulting in coverage holes. To provide the required high coverage in these situations, we propose to deploy sensor networks composed of a mixture of mobile and static sensors in which mobile sensors can move from dense areas to sparse areas to improve the overall coverage. This paper presents a bidding-protocol to assist the movement of mobile sensors. In the protocol, static sensors detect coverage holes locally by using Voronoi diagrams, and bid for mobile sensors based on the size of the detected hole. Mobile sensors choose coverage holes to heal based on the bid. Simulation results show that our algorithm provides suitable tradeoff between coverage and sensor cost.
The OASIS standard for office documents
Authors: Marco Fioretti
Venue: Linux Journal (2004)

A common file format lets apps competeon features and ease of use. 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
Generalized Methodology Formulation for the Time-Optimal Analog System Design
Authors: R. Peña, A. Zemliak
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

In order to improve the characteristics of thesystem design process a new general methodology forthe electronic system design was elaborated by meansof the optimum control theory formulation. Thisapproach generalizes the design process and generatesan infinite number of the different design strategiesthat will be resolved in time optimum. The principaldifference between this new method and previouslyelaborated methodology is the more general approachon the system parameters definition. The mainequations for the system design process wereelaborated. These equations include the special controlfunctions that are introduced into considerationartificially to generalize the total design process.Numerical results demonstrate the efficiency andperspective of the proposed approach.
Geocomputation's future at the extremes: high performance computing and nanoclients
Authors: K. C. Clarke
Venue: Parallel Computing (2003)

Recent developments in computing are reviewed, with consideration given to the nature of the human-computer interface and its development. The emergence of the desktop metaphor and the Windows-Icons-Menus Pointers interface, while suitable for most computing tasks, has now played out its course as far as innovation in hardware is concerned. The next phase of computing is only now emerging, and is being fed by changes at the "extremes" of computing, the parallel supercomputer at one end, and the extremely thin or "nano" client at the other. The paradox, of fat servers and ultrathin clients implies a further separation toward the extremes as systems develop. Examples are given of nanoclients, including wearable computers, smart dust, microelectromechanical systems and wireless integrated network sensors. Clearly, the user interface for nanoclients must explicitly or implicitly include geographical space, because the primitive of location, coordinates, will often be a critical part of the data stream. At the parallel and HPC end, the advantages and types of parallel computing are discussed, and examined in the light of what they can do for geographical systems. Some examples of the computing extremes are given in terms of application, including wearable computers, and geo-smart dust. Finally, the relationship between massive combined computing power at both the client and server side are considered in the light of tractability in geoscience. It seems quite likely that a new suite of methods, based in computing, will emerge to replace the standard set of mathematical tools, such as optimization methods, in use today.
Floppies for the new millennium
Authors: Rick Moen
Venue: Linux Journal (2003)

A practical guide to setting up and working with USB key chains. 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
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars
Authors: Ted Briscoe, John Carroll
Venue: Computational Linguistics (1993)

We describe work toward the construction of a very wide-coverage probabilistic parsing system for natural language (NL), based on LR parsing techniques. The system is intended to rank the large number of syntactic analyses produced by NL grammars according to the frequency of occurrence of the individual rules deployed in each analysis. We discuss a fully automatic procedure for constructing an LR parse table from a unification-based grammar formalism, and consider the suitability of alternative LALR(1) parse table construction methods for large grammars. The parse table is used as the basis for two parsers; a user-driven interactive system that provides a computationally tractable and labor-efficient method of supervised training of the statistical information required to drive the probabilistic parser. The latter is constructed by associating probabilities with the LR parse table directly. This technique is superior to parsers based on probabilistic lexical tagging or probabilistic context-free grammar because it allows for a more context-dependent probabilistic language model, as well as use of a more linguistically adequate grammar formalism. We compare the performance of an optimized variant of Tomita's (1987) generalized LR parsing algorithm to an (efficiently indexed and optimized) chart parser. We report promising results of a pilot study training on 150 noun definitions from the Longman Dictionary of Contemporary English (LDOCE) and retesting on these plus a further 55 definitions. Finally, we discuss limitations of the current system and possible extensions to deal with lexical (syntactic and semantic) frequency of occurrence.
A simulation of the Heckscher-Ohlin theorem
Authors: Toshitaka Fukiharu
Venue: Mathematics and Computers in Simulation (2004)

The Heckscher-Ohlin (H-O) theorem is one of the classical results in international trade theory. In the real world, however, this tendency has not been observed. Two restrictive assumptions are required for this theorem to hold. One is the identity of utility functions between the two trading countries, and the other relates to production functions. In this paper, simulations are conducted to identity which assumption is more important in order for the H-O theorem to hold. Production functions (constant returns to scale) and utility functions are assumed to be of Cobb-Douglas type. In the first simulation, 10,000 pairs of parameters on production and utility functions are selected randomly, where production function on both countries are identical and utility functions can be different. The H-O property is observed for approximately 70% of the solutions. In the second simulation, the same simulation is conducted where utility functions in both countries are identical and production functions can be different. Then, H-O property is observed for approximately 50% of the solutions.
Case studies in admissions to and early performance in computer science degrees
Authors: Sylvia Alexander, Martyn Clark, Ken Loose, June Amillo, Mats Daniels, Roger Boyle, Cary Laxer, Dermot Shinners-Kennedy
Venue: Working group reports from ITiCSE on Innovation and technology in computer science education (2003)

We present seven case-studies of undergraduate recruitment to Computer Science courses together with analysis of students' success during the early part of their study. We focus particularly upon qualification on entry, the subjects studied in the early university curriculum, and student grades.We find that while university admissions are complex processes, there exists sufficient commonality to permit some useful comparisons. These suggest that predicting undergraduate performance on the basis of entry qualifications is fraught. Nevertheless, it seems that students who arrive at university with a record of success in earlier studies may be more likely to succeed than otherwise. In particular, good grades in pre-university study may indicate that they are more likely to do well in the mathematical part of the university curriculum. Conversely, we find nothing in entry qualifications to indicate which students will be successful in the study of programming.
Adaptive enlargement of state spaces in evolutionary designing
Authors: John S. Gero, Vladimir Kazakov
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

In designing a state space of possible designs is implied by the representation used and the computational processes that operate on that representation. GAs are a means of effectively searching that state space which is defined by the length of the genotype's bit string. Of particular interest in design computing are processes that enlarge that state space to change the set of possible designs. This paper presents one such process based on the generalization of the genetic crossover operation. A crossover operation of genetic algorithms is reinterpreted as a random sampling of interpolating phenotypes, produced by a particular case of phenotypic interpolation. Its generalization is constructed by using a more general version of interpolation and/or by adding extrapolation to interpolation. This generalized crossover has a potential to move the current population outside of the original state space. An adaptive strategy for state space enlargement, which is based on this generalization, is designed. This strategy can be used for computational support of creative designing. An example is given.
Microarchitecture Development via Metropolis Successive Platform Refinement
Authors: Douglas Densmore, Sanjay Rekhi, Alberto Sangiovanni-Vincentelli
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Productivity data for IC designs indicates an exponential increase in design time and cost with the number of elements that are to be included in a device. Present applications require thedevelopment of complex systems to support novel functionality. To cope with these difficulties, we need to change radically the present design methodology to allow for extensive re-use, early verification in the design cycle, pervasive use of software, and architecture-level optimization. Platform-based design as defined in [1], has these characteristics. We present the application of this methodology to a complex industrial application provided by Cypress Semiconductor. In this case study, we focus on a particular aspect of this methodology thateases considerably the verification process: successive refinement. We compare this approach versus a parallel team of designers who developed the IC using standard designapproaches.
A Petri Net Representation for Dynamic Programming Problems in Management Applications
Authors: Holger Mauch
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

Dynamic programming (DP) is a very general optimization technique, which can be applied to numerous management decision problems. In order to develop a software system that automates many of the tasks a user encounters when attempting to solve an instance of an optimization problem with discrete DP an intermediate problem representation in the form of a Petri net (PN) turns out to be useful. The specialized PN model presented in this paper captures the essential components of a DP problem instance. It uses the standard semantics of place/transition nets, a low-level PN class, whereas previous work [3, 4, 5] relied on high-level PNs. This approach is illustrated by a simple .nancing example, but the methodology works for a wide range of management problems and can be applied to more complex instances. Among the bene.ts of this representation are the possibility to perform consistency checks on the PN level and the existence of a simple procedure to translate a model instance into executable code that could be integrated into existing solvers. Also, a software systemcurrently under development will automate the task of transforming a DP functional equation into the PN model suggested in this paper. Users need not construct the PN model directly.
WebODE in a nutshell
Authors: Julio César Arpírez, Oscar Corcho, Mariano Fernández-López, Asunción Gómez-Pérez
Venue: AI Magazine (2003)

WEBODE is a scalable workbench for ontological engineering that eases the design, development, and management of ontologies and includes middleware services to aid in the integration of ontologies into real-world applications. WEBODE presents a framework to integrate new ontology-based tools and services, where developers only worry about the new logic they want to provide on top of the knowledge stored in their ontologies.
The Method of Elementary Components for Approximately Studying Systems with Complex Delay
Authors: S. M. Muzafarov, Yumagulov
Venue: Automation and Remote Control (2003)

Linear components containing complex delays are studied. Transfer functions, pulse, and pulse-frequency characteristics of such components are decomposed into series of simple fractions. Conditions for the convergence of these series are formulated, their convergence rates are estimated, and application to study the dynamics of linear delay components is investigated.
Speech driven facial animation
Authors: P. Kakumanu, R. Gutierrez-Osuna, A. Esposito, R. Bryll, A. Goshtasby, O. N. Garcia
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

The results reported in this article are an integral part of a larger project aimed at achieving perceptually realistic animations, including the individualized nuances, of three-dimensional human faces driven by speech. The audiovisual system that has been developed for learning the spatio-temporal relationship between speech acoustics and facial animation is described, including video and speech processing, pattern analysis, and MPEG-4 compliant facial animation for a given speaker. In particular, we propose a perceptual transformation of the speech spectral envelope, which is shown to capture the dynamics of articulatory movements. An efficient nearest-neighbor algorithm is used to predict novel articulatory trajectories from the speech dynamics. The results are very promising and suggest a new way to approach the modeling of synthetic lip motion of a given speaker driven by his/her speech. This would also provide clues toward a more general cross-speaker realistic animation.
Temporal reasoning in process planning
Authors: Mira Balaban, Dan Braha
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

Computer-aided process planning has been recognized as an important tool for coordinating the different operations involved in making the product. While temporal knowledge is central to the design of efficient and reliable process plans, little attention is given to the integration of process planning and temporal processing and reasoning. To fill the void, we propose in this paper a practical approach, which is inspired by the framework of Temporal Constraint Satisfaction Problem (TCSP), to integrate process planning and temporal reasoning. We show that a TCSP formulation is a subset of a formulation using a reified temporal logic, and discuss the advantages of using such a restricted model. To reflect more realistic process planning encountered in real manufacturing environments, we present a model, called n-TCSP, which is a generalization of the TCSP framework. We envision the proposed temporal reasoning framework as one of the modules in the evolving new intelligent computer-aided process planning.
The role of spoken feedback in experiencing multimodal interfaces as human-like
Authors: Pernilla Qvarfordt, Arne Jönsson, Nils Dahlbäck
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

If user interfaces should be made human-like vs. tool-like has been debated in the HCI field, and this debate affects the development of multimodal interfaces. However, little empirical study has been done to support either view so far. Even if there is evidence that humans interpret media as other humans, this does not mean that humans experience the interfaces as human-like. We studied how people experience a multimodal timetable system with varying degree of human-like spoken feedback in a Wizard-of-Oz study. The results showed that users' views and preferences lean significantly towards anthropomorphism after actually experiencing the multimodal timetable system. The more human-like the spoken feedback is the more participants preferred the system to be human-like. The results also showed that the users experience matched their preferences. This shows that in order to appreciate a human-like interface, the users have to experience it.
Re-documenting, Visualizing and Understanding Software System Using DocLike Viewer
Authors: Shahida Sulaiman, Norbik Bashah Idris, Shamsul Sahibuddin, Sarina Sulaiman
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Visualizing the artifacts of a software systemgraphically has proven to improve the cognitivestrategies and understanding of the subject system byprogrammers. This is more crucial when they need tomaintain a software system with out-dated documentationor without system documentation at all. Many tools haveemerged and they predominantly consist of a reverseengineering environment and a viewer to visualizesoftware artifacts such as in the form of graphs. Thetools also grant structural re-documentation of existingsoftware system but they do not directly utilize document-likesoftware visualization in their approaches. Thispaper proposes DocLike Modularized Graph (DMG)method that represents the software architectures of areverse engineered subject system graphically in amodularized and standardized document-like manner. Torealize this method, we have built a prototype tool calledDocLike Viewer that enables a user to re-document,visualize and comprehend a subject system written in Clanguage that is parsed by an existing parser. From theexperiment conducted we found that our method managedto statistically improve cognition of a subject system interms of productivity and quality to solve certain types ofmaintenance tasks.
Designing Reconfigurable Systems in Lava
Authors: Satnam Singh
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

We present Lava, a hardware description language in which concisecircuit descriptions generate compact high performance reconfigurablecores on Xilinx' FPGAs. Lava provides a rich set ofconstructs for composing sub-circuit behaviour and layout. We alsodemonstrate how Lava also supports a flexible scheme for specifyingdynamic reconfiguration which allows the automatic synthesisof dynamic reconfiguration controllers.
National language architecture
Authors: G. D. A. (David) Weston
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

A fundamental concern for customers of software products worldwide is the lack of consistent, comprehensive national language support (NLS)' across operating system platforms and across high-level computer languages. This concern has been expressed both by application users who (rightly) feel inadequately supported by the product software and by developers who are frustrated at not being able to respond to customer requirements. The user wants to be able to interact with a product that works according to his language, culture and conventions. The software developer currently does not have the means or flexibility of providing this support cost-effectively; each application must provide its own resources and be reinvented for each target culture.This paper proposes a solution to this problem -- an architected set of interfaces and resources that will provide consistent, comprehensive, cost-effective support for national language. This solution will provide for migration from, and coexistence with, the current development environment. The architecture will also be extensible to permit user customization of preferences at run time.
Electronic Sourcing with Multi-Attribute Auctions
Authors: Stefan Strecker, Stefan Seifert
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Multi-attribute reverse auctions have been proposed as market institutions for "electronic request for quotation" buying processes. The choice of a multi-attribute auction institution for corporate sourcing is a challenge for the auctioneer in terms of utility maximization and allocational efficiency. The authors report on a computer-based laboratory experiment in a solesourcing scenario of a single, indivisible object and investigate whether a multi-attribute reverse English and a multi-attribute reverse Vickrey auction institution lead to identical outcomes with respect to the buyer's utility, suppliers' profits and allocational efficiency. The results show no significant difference in suppliers' profits. However, the English auction institution leads to both higher allocational efficiency and buyer's utility and is thus recommendable to corporate buyers. The documented breakdown of the outcome equivalence of the two auction institutions is attributed to bidders deviating from the dominant bidding strategy. The deviations are analyzed and explained by learning effects.
On a Class of Traceability Codes
Authors: Tran Van Trung, Sosina Martirosyan
Venue: Designs, Codes and Cryptography (2004)

Traceability codes are designed to be used in schemes that protect copyrighted digital data against piracy. The main aim of this paper is to give an answer to a Staddon&ndash;Stinson&ndash;Wei&rsquo;s problem of the existence of traceability codes with q< w2 and b>q. We provide a large class of these codes constructed by using a new general construction method for q-ary codes.