ppxscal/embedding_network huggingface dataset:
Voltage scheduling under unpredictabilities: a risk management paradigm
Authors: Azadeh Davoodi, Ankur Srivastava
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2005)

This article addresses the problem of voltage scheduling in unpredictable situations. The voltage scheduling problem assigns voltages to operations such that the power is minimized under a clock delay constraint. In the presence of unpredictabilities, meeting the clock latency constraint cannot be guaranteed. This article proposes a novel risk management based technique to solve this problem. Here, the risk management paradigm assigns a quantified value to the amount of risk the designer is willing to take on the clock cycle constraint. The algorithm then assigns voltages in order to meet the expected value of clock cycle constraint while keeping the maximum delay within the specified &ldquo;risk&rdquo; and minimizing the power. The proposed algorithm is based on dynamic programming and is optimal for trees. Experimental results show that the traditional voltage scheduling approach is incapable of handling unpredictabilities. Our approach is capable of generating an effective tradeoff between power and &ldquo;risk&rdquo;: the more the risk, the less the power. The results show that a small increase in design risk positively affects the power dissipation.
Singularity Avoidance in Uncalibrated Visual Servoing
Authors: Masoud Shahamiri, Martin Jagersand
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

The singularity avoidance problem in image-based visual servoing can be formulated as a constrained optimization problem where the constraint is typically the distance from singular points. This paper develops a new approach to vision-based robot control, which avoids the robot singularities by using a new method for nonlinear programming, called biased Quasi-Newton. Contrary to classical singularity avoidance this approach does not need any a-priori knowledge of kinematics or robot model to avoid singular points or regions. Furthermore we also illustrate how to apply the bias method for simple visual obstacle avoidance. Finally to show the practical applicability of our method. We have implemented it on Barrett WAM and PUMA560 manipulators and tested both numerous real trajectories, as well as run exhaustive simulations around critical configurations using a simulation model to confirm empirically that both safe and efficient trajectory are chosen around singular regions.
A New Undo Function for Web-Based Management Information Systems
Authors: Nicolas Serrano, Fernando Alonso, Jose Mari Sarriegi, Javier Santos, Ismael Ciordia
Venue: IEEE Internet Computing (2005)

Recovery from human operator error is key to system dependability: users are usually the main source for incorrect data, and this data can render a system unusable. Although current management information systems allow for the reversal of some processes, they donýt offer an undo function to correct the errors human operators might introduce while editing data. The authors propose a method for correcting this potential problem with a new undo function that allows the recovery of previous states even after records have changed.
Monte Carlo analysis of near-infrared light propagation in a neonatal head model
Authors: Shuhei Eda, Eiji Okada
Venue: Systems and Computers in Japan (2004)

In brain function measurement using near-infrared light, it is very important to make a theoretical analysis of light propagation in the head tissue, since it is impossible to measure the effect of optical fiber arrangement on the region of measurement or its sensitivity. The Monte Carlo method is widely used in the analysis of near-infrared light propagation in biological tissue, since it allows light propagation analysis of heterogeneous tissue by a relatively simple algorithm. In this study, a model simulating the cross-sectional structure of the neonatal head is constructed by using square elements, and the light propagation is analyzed. First, the variance-reduction (VR) method and the delta-scattering (DS) method, which are typical algorithms of the Monte Carlo method, are applied to the model composed of square elements, and the results of the analysis and the computation time for light propagation are compared and discussed. It is shown that the DS method is useful for a model composed of small square elements, since the computation time depends little on the size of the elements. As a result of analysis of light propagation in the neonatal head model using the DS method, we see that light propagation is greatly affected by the heterogeneity of the head tissue. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(9): 60&ndash;69, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10246
Toward computational description of written Polish: Warsaw University, Poland
Authors: Janusz S. Bien, Stanislaw Szpakowicz
Venue: Issue 79 (January 1982) (1982)

We present briefly the activity of the Warsaw University. computational linguistics team. The team is an informal group that consolidates around a seminar at the Institute of Informatics, coordinated by Prof. Zygmunt Saloni. The group adheres to a "bootstrapping methodology": we focus on developing surface linguistic descriptions which should allow the creation of efficient tools for low-level processing of natural language texts, in the hope that it will pay when more sophisticated problems are attacked.
Trade-Offs in Protecting Storage: A Meta-Data Comparison of Cryptographic, Backup/Versioning, Immutable/Tamper-Proof, and Redundant Storage Solutions
Authors: Joseph Tucek, Paul Stanton, Elizabeth Haubert, Ragib Hasan, Larry Brumbaugh, William Yurcik
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

Modern storage systems are responsible for increasing amounts of data and the value of the data itself is growing in importance. Several primary storage system solutions have emerged for the protection of data: (1) Secure Storage through Cryptography, (2) Backup and Versioning Systems, (3) Immutable and Tamper-Proof Storage, and (4) Redundant Storage. Using results from published studies, we compare these four solutions against different requirements highlighting trade-offs in performance, space, attack resistance, and cost. We also present a case study of applying these solutions based on design work at NCSA. Lastly, we conclude that while different storage protection solutions may be appropriate for different requirements, some general conclusions can be made about current state-of-the-art storage protection solutionsas well as directions for future research.
XSQ: A streaming XPath engine
Authors: Feng Peng, Sudarshan S. Chawathe
Venue: ACM Transactions on Database Systems (TODS) (2005)

We have implemented and released the XSQ system for evaluating XPath queries on streaming XML data. XSQ supports XPath features such as multiple predicates, closures, and aggregation, which pose interesting challenges for streaming evaluation. Our implementation is based on using a hierarchical arrangement of augmented finite state automata. A design goal of XSQ is buffering data for the least amount of time possible. We present a detailed experimental study that characterizes the performance of XSQ and related systems, and that illustrates the performance implications of XPath features such as closures.
Conversing with the user based on eye-gaze patterns
Authors: Pernilla Qvarfordt, Shumin Zhai
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Motivated by and grounded in observations of eye-gaze patterns in human-human dialogue, this study explores using eye-gaze patterns in managing human-computer dialogue. We developed an interactive system, iTourist, for city trip planning, which encapsulated knowledge of eye-gaze patterns gained from studies of human-human collaboration systems. User study results show that it was possible to sense users' interest based on eye-gaze patterns and manage computer information output accordingly. Study participants could successfully plan their trip with iTourist and positively rated their experience of using it. We demonstrate that eye-gaze could play an important role in managing future multimodal human-computer dialogues.
Usability and MMS uses on mobile phones
Authors: Rachel Demumieux, Farid Habbouche
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

This paper presents studies carried out in France Telecom R&D on MMS's service (multimedia messaging) available on compatible mobile phones since September 2002. With the MMS, the users can send and receive photos, pictures and sound. Two user tests enabled us to identify some difficulties of use. Currently, we carry out a global study (qualitative and quantitative) in order to understand the uses. The first results show that MMS are especially employed for private communication. The users send pictures (shooting with camera phone) and text. The camera phone users, who don't send MMS estimate that the service is too expensive. Moreover, people around about them have not always a compatible MMS mobile phone.
Model-Based Exploration of the Design Space for Heterogeneous Systems on Chip
Authors: H. Blume, H. T. Feldkaemper, T. G. Noll
Venue: Journal of VLSI Signal Processing Systems (2005)

The exploration of the design space for heterogeneous Systems on Chip (SoC) becomes more and more important. As modern SoCs include a variety of different architecture blocks ensuring flexibility as well as highest performance, it is mandatory to prune the design space in an early stage of the design process in order to achieve short innovation cycles for new products. Thus, the goal of this work is to provide estimations of implementation specific parameters like throughput rate, power dissipation and silicon area by means of cost functions featuring reasonable accuracy at low modeling effort. A model based exploration strategy supporting the design flow for heterogeneous SoCs is presented. In order to demonstrate the feasibility of this exploration strategy, in a first step implementation cost parameters are provided for a variety of basic operations frequently required in digital signal processing which were implemented on discrete components like DSPs, FPGAs or dedicated ASICs. These implementation parameters serve as a basis for deriving cost models for the design space exploration concept.
CAD for nanometer silicon design challenges and success
Authors: Jeong-Taek Kong
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2004)

As silicon CMOS technology is scaled into the nanometer regime, the paradigm shift of computer-aided design (CAD) technology is indispensable to cope with two major challenges (i.e., the ever-increasing design complexity of gigascale integration and complicated physical effects inherent from the nanoscale technology). System-level design and verification methodologies manage the functional complexity, and manufacturing-aware design techniques control the nanoscale physical effects. In this highlight paper, most nanometer design issues are described and the issues related to the higher level of abstraction are summarized. Process variability can be controlled by statistical design, resolution enhancement, planarity control, and other manufacturing-aware design techniques. Continuously growing problems such as leakage power, signal integrity, and reliability are also discussed. Finally, technology CAD for future nanometer devices is presented. For successful nanometer silicon design, closer cooperation among the design, process technology, mask, and CAD communities are essential.
Efficient Search Space Exploration for HW-SW Partitioning
Authors: Sudarshan Banerjee, Nikil Dutt
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

Hardware/software (HW-SW) partitioning is a key problem in the codesign of embedded systems, studied extensively in the past. One major open challenge for traditional partitioning approaches ¿ as we move to more complex and heterogeneous SOCs ¿ is the lack of efficient exploration of the large space of possible HW/SW configurations,coupled with the inability to efficiently scale up with larger problem sizes. In this paper, we make two contributions for HW-SW partitioning of applications represented as procedural callgraphs: 1) we prove that during partitioning, the execution time metric for moving a vertex needs to be updated only for the immediate neighbours of the vertex, rather than for all ancestors along paths to the root vertex; consequently, we observe faster run-times for move-based partitioning algorithms such as Simulated Annealing (SA), allowing call graphs with thousands of vertices to be processed in less than a second, and 2) we devise a new cost function for SA that allows frequent discovery of better partitioning solutions by searching spaces overlooked by traditional SA cost functions. We present experimental results on a very large design space, where several thousand configurations are explored in minutes as compared to several hours or days using a traditional SA formulation. Furthermore, our approach is frequently able to locate better design points with over 10 % improvement in application execution time compared to the solutions generated by a Kernighan-Lin partitioning algorithm starting with an all-SW partitioning.
The accuracy of a procedural approach to specifying feedforward neural networks for forecasting
Authors: Kua-Ping Liao, Robert Fildes
Venue: Computers and Operations Research (2005)

The comparative accuracy of feedforward neural networks (NN) when applied to time series forecasting problems remains uncertain. This is because most studies suffer from either of two defects--they choose the NN from a wide range of alternatives in order to present the forecast accuracy results in the best light or they do not compare the results with suitable benchmarks. In order to overcome both these objections, this paper proposes an objective procedure for specifying a feedforward NN model and evaluates its effectiveness by examining its forecasting performance compared with established benchmarks. After the selection of input nodes based on cross-validation, a three-stage procedure is proposed here which consists of sequentially selecting first the learning rate followed by the number of nodes and the initial weights. This paper shows that NNs only perform robustly if they are built by considering these three factors jointly. In an empirical demonstration of the strength of the approach, those NN models, built by considering all three factors, performed better than other competitive statistical methods when evaluated rigorously on a standard test data set.
Physical computing and multimodal input in human-computer interfaces
Authors: Lori Scarlatos, Tony Scarlatos
Venue: Journal of Computing Sciences in Colleges (2005)

The human-computer interface is widely recognized as an important part of any software project. Consequently, the principles of human-computer interaction are increasingly being taught in computer science departments. Usually, this type of course will focus on the design, implementation and testing of graphical user interfaces. Yet today's ubiquitous computing applications require interfaces that are context aware and respond to more than text from a keyboard or the click of a mouse. Students who have experience developing interfaces with a range of multimodal inputs will be better prepared to meet this growing need.This paper describes a new course that is being taught at two different colleges at the undergraduate level. Students in these classes learn the theory behind good interface design while obtaining practical experience implementing applications that respond to speech, sensor input, and computer vision. This paper also describes how students go on to apply this knowledge to educational applications in subsequent independent projects, working with teachers as clients. Finally, the paper presents several of the projects produced by students in these classes and in subsequent collaborations.
Organizing Numerical Theories Using Axiomatic Type Classes
Authors: Lawrence C. Paulson
Venue: Journal of Automated Reasoning (2004)

Mathematical reasoning may involve several arithmetic types, including those of the natural, integer, rational, real, and complex numbers. These types satisfy many of the same algebraic laws. These laws need to be made available to users, uniformly and preferably without repetition, but with due account for the peculiarities of each type. Subtyping, where a type inherits properties from a supertype, can eliminate repetition only for a fixed type hierarchy set up in advance by implementors. The approach recently adopted for Isabelle uses axiomatic type classes, an established approach to overloading. Abstractions such as semirings, rings, fields, and their ordered counterparts are defined, and theorems are proved algebraically. Types that meet the abstractions inherit the appropriate theorems.
Measuring High Performance Computing Productivity
Authors: Stuart Faulk, John Gustafson, Philip Johnson, Adam Porter, Walter Tichy, Lawrence Votta
Venue: International Journal of High Performance Computing Applications (2004)

One key to improving high performance computing (HPC) productivity is to find better ways to measure it. We define productivity in terms of mission goals, i.e. greater productivity means that more science is accomplished with less cost and effort. Traditional software productivity metrics and computing benchmarks have proven inadequate for assessing or predicting such end-to-end productivity. In this paper we introduce a new approach to measuring productivity in HPC applications that addresses both development time and execution time. Our goal is to develop a public repository of effective productivity benchmarks that anyone in the HPC community can apply to assess or predict productivity.
The embedding in AG(3,q) of (0, 2)-geometries with no planar nets
Authors: Nikias De Feyter
Venue: Journal of Combinatorial Theory Series A (2005)

This paper is part of the classification of (0, α)-geometries (α > 1) embedded in AG(n, q). We study (0, 2)-geometries of order (2h - 1, t) embedded in AG(3, 2h) such that there are no planar nets. In the case t ≠ 2h, we prove some severe combinatorial restrictions. In the case t = 2h we provide a classification.
Research on natural-language processing: SRI International
Authors: Barbara Grosz
Venue: Issue 79 (January 1982) (1982)

Research on natural-language processing at SRI spans a broad spectrum of activity. Two of our major current efforts are a pair of research projects under the sponsorship of the Defense Advanced Research Projects Agency. The TEAM project is intended to provide natural-language access to large databases via systems that are easily adaptable to a wide range of new application domains. The KLAUS project is a longer-range effort to address basic research problems in natural-language semantics, commonsense reasoning, and the pragmatics of natural-language communication. These two projects share a common core-language-processing system called DIALOGIC.
Deriving Linear Transformations in 3D Using Quaternion Algebra
Authors: Hua Zhang, Changqian Zhu
Venue: IEEE Computer Graphics and Applications (2005)

The recent method of deriving linear transformation in 3D physical space described by R. Goldman (see IEEE CG&A, vol. 23, no. 3, 2003, pp. 66-71) provided a unified framework, and works well with quaternion techniques in many transformations, but the other two kinds of the transformations, which are the parallel projection onto a plane and parallel projection onto a line, still work in the vector method. In this article, we propose a novel method to make the deriving linear transformation in the two parallel projections work well with quaternion techniques, therefore all the transformations described in Goldman's article could be derived with quaternion techniques.
Designing GUI Components for UML Use Cases
Authors: Jesus M. Almendros-Jimenez, Luis Iribarne
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

In this paper we present how to develop graphical user interfaces from two UML models: use case and activity diagrams. Our method obtains from them a UML class diagram for representing GUI components, and it is suitable for generating code fragments which can be considered as GUI prototypes.
On the Signature Trees and Balanced Signature Trees
Authors: Yangjun Chen
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Advanced database application areas, such as computer aided design, office automation, digital libraries, data-mining as well as hypertext and multimedia systems need to handle complex data structures with set-valued attributes, which can be represented as bit strings, called signatures. A set of signatures can be stored in a file, called a signature file. In this paper, we propose a new method to organize a signature file into a tree structure, called a signature tree, to speed up the signature file scanning and query evaluation.
Text mining for finding functional community of related genes using TCM knowledge
Authors: Zhaohui Wu, Xuezhong Zhou, Baoyan Liu, Junli Chen
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

We present a novel text mining approach to uncover the functional gene relationships, maybe, temporal and spatial functional modular interaction networks, from MEDLINE in large scale. Other than the regular approaches, which only consider the reductionistic molecular biological knowledge in MEDLINE, we use TCM knowledge(e.g. Symptom Complex) and the 50,000 TCM bibliographic records to automatically congregate the related genes. A simple but efficient bootstrapping technique is used to extract the clinical disease names from TCM literature, and term co-occurrence is used to identify the disease-gene relationships in MEDLINE abstracts and titles. The underlying hypothesis is that the relevant genes of the same Symptom Complex will have some biological interactions. It is also a probing research to study the connection of TCM with modern biomedical and post-genomics studies by text mining. The preliminary results show that Symptom Complex gives a novel top-down view of functional genomics research, and it is a promising research field while connecting TCM with modern life science using text mining.
Internet search engines: past and future
Authors: Jan O. Pedersen
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

I will review the short history of Internet Search Engines from early first generation systems to the current crop of stock market darlings. Many of the underlying technology problems remain the same, but the business has become significantly more sophisticated and high-powered. I will touch on some of the economics driving the remarkable success of these services and make some predictions about future trends.