ppxscal/embedding_network huggingface dataset:
Oscillatory dynamics of inviscid planar liquid sheets
Authors: J. I. Ramos
Venue: Applied Mathematics and Computation (2003)

One-dimensional models of inviscid, planar liquid sheets surrounded by dynamically passive gases are obtained by means of perturbation methods, integral formulations, series expansions and variational principles. It is shown that integral formulations, series expansions and variational principles provide analogous one-dimensional models under certain approximations for the velocity and pressure fields. The equations for slender and thin sheets obtained from integral formulations are shown to be asymptotically equivalent to the exact equations of inviscid, planar liquid membranes. Algebraic and differential methods are employed to determine the singularities of the steady equations obtained from integral formulations, and indicate that the liquid does not leave the nozzle with an angle equal to that of the exit if the Weber number is equal to or less than one. Numerical studies of the time-dependent governing equations are presented in order to illustrate the nonlinear dynamics and bifurcations of confined, inviscid, planar liquid sheets when they are subjected to time-dependent pressure differences or gases are injected on either side of the sheet, in the absence of heat and mass transfer between the gases and the liquid.
SOI Technology for Future High-Performance Smart Cards
Authors: Amaury Neve, Denis Flandre, Jean-Jacques Quisquater
Venue: IEEE Micro (2003)

Chips based on silicon-on-insulator technology meet the tough performance and security requirements presented by smart cards. A test chip manufactured in a fully depleted SOI process incorporates a charge pump and random-number generator, critical smart-card circuit blocks.
Recognizing User Context via Wearable Sensors
Authors: Brian Clarkson, Alex Pentland, Kenji Mase
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

We describe experiments in recognizing a person's situation from only a wearable camera and microphone. The types of situations considered in these experiments are coarse locations (such as at work, in a subway or in a grocery store) and coarse events (such as in a conversation or walking down a busy street) that would require only global, non-attentional features to distinguish them.
Concurrent Simulations of Plasma Reactors for VLSI Manufacturing
Authors: Marc A. Rieffel
Venue:  (1995)

No Abstract.
Automatic Detection of Handwriting Forgery
Authors: Sung-Hyuk Cha, Charles C. Tappert
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

We investigated the detection of handwriting forgery by both human and machine. We obtained experimental handwriting data from subjects writing samples in their natural style and writing forgeries of other subjects' handwriting. These handwriting samples were digitallyscanned and stored in an image database. We investigated the ease of forging handwriting, and found that many subjects can successfully forge the handwriting of others in terms of shape and size by tracing the authentic handwriting. Our hypothesis is that the authentic handwriting samples provided by subjects in their own natural writing style will have smooth ink traces, while forged handwritings will have wrinkly traces. We believe the reason for this is that forged handwriting is often either traced or copied slowly and is therefore more likely toappear wrinkly when scanned with a high-resolution scanner. Using seven handwriting distance features, we trained an artificial neural network to achieved 89% accuracy on test samples.
A distributable algorithm for optimizing mesh partitions
Authors: N. Bouhmala, P. A. Knutti, H. H. Naegeli
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Much effort has been directed towards developing mesh partitioning strategies to distribute a finite element mesh among the processors of a distributed memory parallel computer. The distribution of the mesh requires a partitioning strategy. This partitioning strategy should be designed such that the computational load is balanced and the communication is minimized. Unfortunately, many of the existing approaches for the mesh partitioning are sequential and are performed as a sequential pre-processing step on a serial machine. These approaches may not be appropriate if the mesh is very large, that is to say, this pre-processing on a serial machine may not be feasible due to memory or time constraints, or on a parallel machine if the mesh is already distributed. In this paper we propose an algorithm with a fundamentally distributed design for the optimization of mesh partitions. To assess the quality of the partitioning, the size of edge cuts is the taken as the chosen metric.
Load Redundancy Removal through Instruction Reuse
Authors: Jun Yang, Rajiv Gupta
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Instruction reuse techniques have been developed to detect and remove redundancy at runtime. By maintaining the execution history of an instruction, reuse techniques detect if a subsequent execution of an instruction will yield the same result as its previous execution, and if this is the case, the result is made available to dependent instructions without executing the instruction. This approach eliminates same instruction redundancy, that is, redundancy across different dynamic instances of the same static instruction. However, the main limitation of existing instruction reuse techniques is that they do not detect or eliminate different instruction redundancy, that is, redundancy across dynamic instances of static ally distinct instructions.We present instruction reuse techniques for load redundancy removal that eliminate both same and different instruction redundancy. We first present a study that shows that in addition to significant levels of same instruction redundancy (average of 20%), load instructions also contain high levels (average of 35%) of different instruction redundancy arising at other load or store instructions. We also describe studies that characterize the behavior of the redundancy and develop a hardware implementation guided by this characterization. Our experiments show that our techniques yield IPC improvements of up to 11% and reduces off-chip traffic due to cache misses by as much as 32% for SPECint95 benchmarks.
An Autonomous Decentralized System Platform under Multi-vendor Environments in Building Automation
Authors: Akio Orihara, Ken Nozaki, Nobuhisa Kobayashi, Masahiro Oguri, Shinobu Tajima, Masahiro Inoue
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

This paper proposes an autonomous decentralized building control system to cope with the requirements of building control systems under multi-vendor environments. In the proposed system, building equipment is horizontally distributed on a network and autonomously works by sharing communication data on the network according to objects for building control systems. The proposed system deals with the requirements of building control systems and offers its users, such as building designers, a user-friendly tool for the system construction. In this paper, we call such a communication platform an autonomous decentralized system (ADS) platform. By utilizing the ADS platform, the building control system obtains two ADS properties, i.e., autonomous controllability and autonomous coordinability. Furthermore, the proposed system can realize the on-line expandability, on-line maintainability and fault tolerance of the system by relaying messages between the building system objects on the ADS platform without specifying the sending addresses.
Teens.Library: Developing Internet Services for Young Adults
Authors: Linda W. Braun
Venue:  (2002)

:"To compete with other information and entertainment sources libraries must meet and even exceed the high expectations of today's savvy young adults when it comes to library services. Because teenagers are Internet enthusiasts of the first order one sure fire way to do that is through teen-friendly online services and websites. Children's and young adult specialist Linda Braun shares proven and innovative strategies - including getting teens involved in the process - that you can use to harness that interest via web-based services." Library websites and services must integrate teen-friendly technology, content, and attitude, or risk losing an entire generation of potential library customers. Every youth services librarian school library media specialist, and technology specialist can use this exceptional guide to get teens to think of the library as the place to be.
Clarifying the Axioms of Kleene Algebra based on the Method of Indeterminate Coefficients
Authors: Tomoko Ninomiya, Masao Mukaidono
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

After introducing the Method of Indeterminate Coefficients, by which we can derive all finite models satisfying a given set of axioms, we derive all models of 8 elements of Kleene algebra by using the method , and find out many examples of a set of independent and complete axioms of Kleene algebra by checking whether each axiom in Kleene algebra is independent from others or not based on the method.
Interband RTDs with nanoelectronic HBT-LED structures for multiple-valued computation
Authors: L. J. Micheel, H. L. Hartnagel
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

For future nanoelectronic arrays, complex signal processing methods and highly efficient computation are required. A proposed new family of HBT-LED-RTD circuitry chiefly addresses the latter with multiple-valued logic. We use internal optical methods of signal summation in otherwise electronic circuitry. Precision photon streams are generated and summed that are equivalent to electron currents in conventional circuitry. These strictly local interactions of HBTs and LEDs are combined with the folding and thresholding functions of vertically integrated RTDs. Power-of-two bit patterns implement the positive-digit radix-2 MVL. The same circuitry with a summation range of seven also facilitates nanoelectronic signal processing with its innate A/D conversion capability. Our new circuitry is aimed at very high packing density on the order of 10/sup 4/ to 10/sup 6/ gates per IC die. For this purpose it is resistor free and requires no signal-level shifting subcircuits, the HBT-RTD structure is 3-dimensional, and parasitic electrostatic interaction of densely packed circuits is prevented by the optical isolation and the buried optical interconnects. Non-local (especially vertical free-space) optical interconnects are also feasible with our approach using LEDs or microcavity lasers.
Business Specialization Track Masters of Software Engineering (MSE) Program
Authors: Carol L. Hoover
Venue:  (1995)

MSE students who aspire to obtain business management positions within a computer-related technology company, to specialize in the development of software to support production and operations, and/or to start their own technical companies will need fundamental business skills and expertise. The MSE Program offers the Business Specialization Track to help students acquire appropriate business skills while completing their master''s degree in software engineering. The track is flexible in that it allows students to choose their own set of track courses from a list of approved business-related courses and, therefore, to match their career objectives with suitable courses. For instance, students can select courses to help them prepare for careers as executive-level managers of computer technology companies, as designers of information systems, as developers of software systems to support production and operations, and/or as founders of high technology companies. This report describes the track rationale and requirements, provides educational guidelines to help students select courses, lists the approved courses, and presents brief synopses of the approved courses. The report is based the author''s work in developing specialization tracks for the MSE program. The author started her work on specialization tracks in graduate software engineering education during the spring of 1993.
Optimal Parallel Evaluation of Matrix Product Expressions
Authors: F A Fahmy
Venue:  (1992)

We consider the problem of parallel evaluation of the expression \begin{displaymath} M = M_{1} \times M_{2} \times M_{3} \ldots \times M_{n} \end{displaymath} We demonstrate, using an example, that the optimal order for sequential evaluation is not necessarily optimal for parallel evaluation. There are two different levels of parallelism that we shall consider. The first is that of evaluating different products in parallel and the second is that of evaluating a single product using several processors. Given a matrix multiplication algorithm, sequential or parallel, we derive a Dynamic Programming algorithm that computes the minimum number of operations required for parallel evaluation of the expression. An algorithm that orders the evaluation process to achieve the minimum cost is also given. 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
How good are branching rules in DPLL?
Authors: Ming Ouyang
Venue:  (1996)

The Davis-Putnam-Logemann-Loveland algorithm is one of the most popular algorithms for solving the satisfiability problem. Its efficiency depends on its choice of a branching rule. We construct a sequence of instances of the satisfiability problem that fools a variety of ``sensible'''' branching rules in the following sense: when the instance has n variables, each of the ``sensible'''' branching rules brings about Omega(2^(n/5)) recursive calls of the Davis-Putnam-Logemann-Loveland algorithm, even though only O(1) such calls are necessary.
Perl Database Programming, 1 edition
Authors: Brent Michalski
Venue:  (2002)

:Here's your in-depth guide to creating database-driven applications using Perl.In this authoritative reference, Perl expert Brent Michalski uses plenty of examples to help you master Perl's capabilities in database applications with MySQL, PostgreSQL, and Oracle. Along the way, he explores practical applications for cutting-edge technologies like XML and Web services. If you're a Perl novice, the comprehensive code samples and step-by-step explanations will have you writing database applications quickly and confidently. If you're experienced, this definitive guidebook has everything you need to move ahead with Web programming, problem tracking, automatic e-mail reports, and much more.You'll learn how to:Understand different database models, DBIs, and DBDsSet up relational databases, retrieve information, and generate reportsTie a Perl hash to a database and track users with cookiesGenerate and deliver automatic e-mail reportsUse tied hashes to create Web-based shopping cartsHandle binary data and submit BLOB dataCreate phonebooks, photo albums, and a SOAP-based catalogThe companion Web site features source code from the book and other useful information.
Towards Predictable CORBA-Based Web-Services
Authors: Andreas Polze, Jan Richling, Janek Schwarz, Miroslaw Malek
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Over the past several years, the World Wide Web has emerged from a research project to an environment for open, commercial services, such as online-banking, travel reservation, and stock-trading. However, in contrast to the best-effort approach provided by the Web, many of those services demand higher predictability and quality- of-service properties such as security, end-to-end availability, dependability, and real time. The development of a systematic, architectural approach for connecting Web- interfaces to legacy systems, such as databases and transaction processing is an open research question.The Common Object Request Broker Architecture (CORBA) is a widely-accepted, standardized open system integration framework based on distributed object technologies, which has been successfully used for implementation of open Web services. CORBA is focused on facilitating general computing environments and does not explicitly address quality-of-service parameters neither for its communication links nor its endsystems. However efforts like the Real-Time CORBA Special Interest Group (SIG) at OMG and the ''pluggable protocols'' proposal will ultimately lead to support of quality-of-service properties for CORBA communication links.Within this paper we are concentrating on architectural approaches for fault-tolerant, highly available endsystems. We present the ''Observer'' approach for implementation of reliable CORBA clients. Consensus protocols based on the ''Composite Objects'' technique is our solution for constructing CORBA servers with high predictability regarding timely and reliable method execution. Our middleware uses commercial off-the-shelf (COTS) technology and aims at conversion of legacy applications into reliable Web-services.We present Java-based Web-interfaces to the ''Balancing Robots'' soft real-time simulation. Also, we demonstrate a fault-tolerant version of the Netscape Navigator based on our ''Observer'' technique.
Integrating Reactive and Deliberative Planning for Agents
Authors: Jim Blythe, W. S Reilly
Venue:  (1993)

Autonomous agents that respond intelligently in dynamic, complex environments need to be both reactive and deliberative. Reactive systems have traditionally fared better than deliberative planers in such environments, but are often hard to code and inflexible. To fill in some of these gaps, we propose a hybrid system that exploits the strengths of both reactive and deliberative systems. We demonstrate how our system controls a simulated household robot and compare our system to a purely reactive one in this domain. We also look at a number of relevant issues in anytime planning.
What Killed BPR?: Some Evidence from the Literature
Authors: Eric Deakins, Hugh H. Makgill
Venue: Proceedings of the 1996 Information Systems Conference of New Zealand (ISCNZ '96) (1996)

Throughout the first half of the 1990's Business Process Reengineering (BPR) was one of the most eagerly embraced management techniques, although often with results that were far from satisfactory. This tended to reinforce peoples' suspicions of Information Technology since IT is a key enabling agent, if not the driver, for BPR. The aim of this study was to provide literary evidence and reasons for the current widespread dissatisfaction with BPR. Using the keyword Business Process Reengineering/Re-engineering, a total of 2019 article abstracts was collected that spanned the period from January 1990 to December 1995 inclusive. The literature was analyzed for 18 themes, 6 article types and 32 business areas, in addition to geographic origin, author origin, date, etc. The analysis showed that 97.8% of the BPR literature has been written since the beginning of 1993, since which time there has been an explosive growth in the number of publications. However, a recent sharp downturn in the number of articles may be a sign that BPR is maturing, if not reaching the end, of its useful life cycle. The almost complete absence of research articles to underpin BPR is a distinctive feature of the literature. Thus, opportunities for researchers, as well as hitherto untapped opportunities for consulting practitioners, are clearly identified. The article concludes that, while BPR may not have suffered a sudden fatality, it is the victim of neglect in some critical areas of life support.
VideoScheme: A Programmable Video Editing System for Automation and Media Recognition
Authors: James Matthews, Peter A. Gloor, Fillia Makedon
Venue:  (1993)

The recent development of powerful, inexpensive hardware and software support had made digital video editing possible on personal computers and workstations. To date the video editing application category has been dominated by visual, easy-to-use, direct manipulation interfaces. These systems bring high-bandwidth human-computer interaction to a task formerly characterized by slow, inflexible, indirectly-operated machines. However, the direct manipulation computer interfaces are limited by their manual nature, and can not easily accommodate algorithmically- defined operations. This paper proposes a melding of the common direct manipulation interfaces with a programming language which we have enhanced to manipulate digital audio and video. The result is a system which can automate routine tasks as well as perform tasks based on sophisticated media recognition algorithms.
An extended inverted file approach for information retrieval
Authors: I. Ounis, M. Pasca
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

In information retrieval, the way in which the correspondence procedure works is highly important for the performance of the underlying system as a whole. An inverted file ensures quick access to the information items because the index alone is examined, rather than the actual file of items, in order to determine the items which satisfy a search request. This technique was a prominent feature of the old commercial information retrieval systems (IRSs). However it has been used only for keyword-based IRSs. Since that time, the inverted file design has not been radically modified. With the recent use of more expressive and richly structured languages in information retrieval, this method has not been used very much lately because it has been overrun by the expressiveness that new indexing languages, such as knowledge representation languages, have brought about. We propose to make use again of an extended version of the almost forgotten inverted file techniques, so that the complexity of our algorithms is polynomial. This allows us to implement, with a few modifications, a retrieval engine based on conceptual graphs on top of the O/sub 2/ object-oriented DBMS.
Methodology and Programming Techniques in GCLA II
Authors: Martin Aronsson
Venue:  (1992)

We will demonstrate various implementation techniques in the language GCLA. First an introduction to GCLA is given, followed by some examples of program developments, to demonstrate the development methodology. Other examples are also given to show various implementation techniques and properties of the system.
Automatic Query Formulations in Information Retrieval
Authors: Gerard Salton, Chris Buckley, Edward A. Fox
Venue:  (1982)

Modern information retrieval systems are designed to supply relevant information in response to requests received from the user population. In most retrieval environments the search requests consist of keywords, or index terms, interrelated by appropriate Boolean operators. Since it is difficult for untrained users to generate effective Boolean search requests, trained search intermediaries are normally used to translate original statements of user need into useful Boolean search formulations. Methods are introduced in this study which reduce the role of the search intermediaries by making it possible to generate Boolean search formulations completely automatically from natural language statements provided by the system patrons. Frequency considerations are used automatically to generate appropriate term combinations as well as Boolean connectives relating the terms. Methods are covered to produce automatic query formulations both in a standard Boolean logic system, as well as in an extended Boolean system in which the strict interpretation of the connectives is relaxed. Experimental results are supplied to evaluate the effectiveness of the automatic query formulation process in practice.