ppxscal/embedding_network huggingface dataset:
Knowledge Management in Distributed Environments: Roles of Informal Network Players
Authors: Yukika Awazu
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

In today's globally, hyper-competitive marketplace, generation and dissipation of knowledge can no longer be understood from within the boundaries of formal organizational mechanisms.Previously, researchers have studied distributed knowledge management in global contexts based on these formal mechanisms; however, few have examined the role played by informal mechanisms. In this paper, we will examine the role played by informal networks on knowledge management and will devise propositions describing how informal roles can affect knowledge management activities.
Open frameworks for information cities
Authors: Donald Ferguson, Jakka Sairamesh, Stuart Feldman
Venue: Communications of the ACM (2004)

Helping mimic full-scale urban environments, this middleware promises to help build a vast ecosystem of e-commerce, collaboration, and social computing, along with access to real-world municipal regulations and services.
The internal machine
Authors: Andrew M. Welin
Venue: Proceedings of a symposium on High-level-language computer architecture (1973)

Two results are presented in this paper: an enlargement of the concept of machine languages and a way to design computers based on an inner machine oriented toward interpretation of machine languages in general. In Part I we discuss attributes of "directly interpretable languages" and processing mechanisms related to their interpretation. "Sequential extraction" allows an instruction to be of arbitrary form, while "linear decoding" allows us to organize the interpreting routines into structures. This leads to powerful machine language level capabilities. Using the mechanisms of Part I, we build in Part II the case for the "internal machine" approach to computer design. The internal machine (unlike microprocessors) is not oriented towards low level (gate, register) manipulation of data, but its operations reflect elementary actions related to the process of interpretation. The advantages of the internal machine include simplicity, programming interface (as opposed to the interface offered by microprocessors), and the ability to handle directly interpretable languages.One can choose among many architectures for the internal machine. An organization based on the execution stack is suggested as the most general solution. The essential "general purpose" organizations of the internal machines lend themselves to extensions and specializations which provide extra efficient handling of specific subprocesses related to interpretation.
Creating touch-screens anywhere with interactive projected displays
Authors: Claudio Pinhanez, Rick Kjeldsen, Lijun Tang, Anthony Levas, Mark Podlaseck, Noi Sukaviriya, Gopal Pingali
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

We demonstrate a system that combines steerable projection and computer vision technologies to create "touch-screen" style interactive displays on any flat surface in a space. A high-end version of the system -- the Everywhere Display (ED) -- combines an LCD projector with motorized focus and zoom, a computer controlled pan-tilt mirror, and a pan-tilt zoom camera to enable steering of interactive projections around space. A low-end version (ED-lite) enables creation of interactive displays using a portable projector and camera attached to a laptop computer. Unlike traditional augmented reality systems, the ED systems enable delivery of interactive multimedia content on ordinary objects without requiring users to wear head mounted displays or carry special input devices.
Performance Analysis Issues for Parallel Implementations of Propagation Algorithm
Authors: Leonardo Brenner, Luiz Gustavo Fernandes, Paulo Fernandes, Afonso Sales
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

This paper presents a theoretical study to evaluate the performance of a family of parallel implementations of the propagation algorithm. The propagation algorithm is used to an image interpolation application. The theoretical performance analysis is based on the construction of generic models using Stochastic Automata Networks (SAN) formalism to describe each implementation scheme. The prediction results can be compared to the achieved performancein some real test cases to verify the accuracy of our modeling technique. The main contribution of this paper is to point out the advantages and problems of our approach to the development of generic models of parallel implementations.
Case study: severe rainfall events in northwestern Peru (visualization of scattered meteorological data)
Authors: Lloyd A. Treinish
Venue: Proceedings of the conference on Visualization '94 (1994)

The ordinarily arid climate of coastal Peru is disturbed every few years by a phenomenon called El Ni&ntilde;o, characterized by a warming in the Pacific Ocean. Severe rainstorms are one of the consequences of El Ni&ntilde;o, which cause great damage. An examination of daily data from 66 rainfall stations in the Chiura-Piura region of north-western Peru from late 1982 through mid-1983 (associated with an El Ni&ntilde;o episode) yields information on the mesoscale structure of these storms. These observational data are typical of a class that are scattered at irregular locations in two dimensions. The use of continuous realization techniques for qualitative visualization (e.g., surface deformation or contouring) requires an intermediate step to define a topological relationship between the locations of data to form a mesh structure. Several common methods are considered, and the results of their application to the study of the rainfall events are analyzed.
Measuring the performance of electronic government services
Authors: Joan C. Steyaert
Venue: Information and Management (2004)

The World Wide Web (WWW) and the Internet have streamlined government information, products, and services. Electronic government now includes on-line filing of documents, notification of entitlements, permits, registration, and disaster relief. This paper addresses the question, can a marketing model be used by Federal and state agencies to improve the content and value of electronic services to the public? Six Federal and state e-service programs were analyzed--the National Institutes of Health (NIH), the US Mint, the Internal Revenue Service (IRS), the US Postal Service (USPS), and the e-State-government systems of California and New Jersey. Five marketing indicators were used--consumer awareness, popularity, contact efficiency, conversion, and retention. Awareness deals with the number of visitors to a site. Popularity refers to the rank of the site. Contact efficiency indicates site usability and content. Conversion refers to customer satisfaction, transactions and time on the site. Retention deals with customer loyalty. Web traffic reports and customer surveys were used as proxies to analyze and compare a sample of Federal and state e-service agencies. The results support the use of a marketing framework in organizing and evaluating these sites. The case studies demonstrate how statistical and survey data were combined for a robust assessment of the e-services.
Distant Vertex Partitions of Graphs
Authors: Chris Jagger
Venue: Combinatorics, Probability and Computing (1998)

We consider the function &chi;(Gk), defined to be the smallest number of colours that can colour a graph G in such a way that no vertices of distance at most k receive the same colour. In particular we shall look at how small a value this function can take in terms of the order and diameter of G. We get general bounds for this and tight bounds for the cases k=2 and k=3.
Software Reviews: The State of the Practice
Authors: Marcus Ciolkowski, Oliver Laitenberger, Stefan Biffl
Venue: IEEE Software (2003)

This article presents the results of a 2002 survey on industry adoption of software review technologies. The study offers two important insights. First, many responding companies take advantage of reviews for various purposes, including early defect detection, monitoring and controlling quality, and better communication within the development team. Second, many companies use reviews unsystematically, with a mismatch between the expected outcome and the review implementation. So, although review ideas have reached software practitioners, their full potential is seldom exploited.
Control based on fuzzy logic of a flywheel energy storage system associated with wind and diesel generators
Authors: Ludovic Leclercq, Benoit Robyns, Jean-Michel Grave
Venue: Mathematics and Computers in Simulation (2003)

The aim of this paper is to propose a control strategy of a flywheel energy storage system associated with a diesel generator and a fixed speed wind generator. To control the power exchanged between the flywheel energy storage system and the ac grid, a fuzzy logic based supervisor is proposed with the aim to minimize variations of the power generated by the diesel generator. The interesting performance of the proposed supervisor is shown with the help of simulations.
Matching system and component behaviour in MIMOLA synthesis tools
Authors: P. Marwedel
Venue: Proceedings of the conference on European design automation (1990)

This paper discusses the selection of available components during high-level synthesis. We stress the importance of describing the behaviour of available components in some language which is readable for the designer. This behaviour is internally represented by implications. This concept is the key for formal reasoning about the component's capabilities. Alternative functions and sequential and concurrent cooperation of components can be easily described.
Real Time Dynamic Voltage Scaling For Embedded Systems
Authors: Venkat Rao, Gaurav Singhal, Anshul Kumar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper presents a very efficient and versatile methodto handle Dynamic Voltage Scaling for minimizing energyconsumption in an embedded system processor while maintainingreal time deadlines. It achieves this by creatingpseudo operating frequency levels between the discrete frequencylevels supported by the system, thereby addressingthe root cause of inefficiency i.e. inability to vary frequencycontinuously. Simulation suggests that this method, in conjunctionwith DVS algorithms, achieves upto 70% energysavings which is an improvement of upto 25% over the bestexisting algorithms.
Toward a semiotic theory of programming languages
Authors: Steven I. Laszlo
Venue: ACM SIGPLAN Notices (1968)

Based on previous results in a variety of related areas, a schema is described to produce a unified semiotic theory specifically applicable to programming languages. An alternative to BNF-like descriptions is referred to, and the structure of the semantic and pragmatic components is outlined. Programming languages are treated as any other algorithmic notation, and no reference is allowed in the proposed theory to equipment, object code, compiler, or environment. 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
Schema extraction for semi-structured data
Authors: Kam-Fai Wong
Venue:  (2003)

XML has gained popularity as the standard of data exchange on the Web. It bears striking similarity to semi-structured data. Both of them are self-describing and no predefined schemas are required to create or use such data. However schema is very useful. It describes the data, helps data integration and facilitates query evaluation and storage management. Automatic schema extraction is necessary when we have a set of data but no schema is available. In this thesis, we investigate the problem in a general framework. We propose several extraction algorithms based on an incremental conceptual clustering method and automaton theory. Focusing on exploiting schema information in query evaluation, we implement a prototype system of storing and querying semi-structured data with graph schemas in an RDBMS and evaluate the algorithms.
Information awareness: a prospective technical assessment
Authors: David Jensen, Matthew Rattigan, Hannah Blau
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Recent proposals to apply data mining systems to problems in law enforcement, national security, and fraud detection have attracted both media attention and technical critiques of their expected accuracy and impact on privacy. Unfortunately, the majority of technical critiques have been based on simplistic assumptions about data, classifiers, inference procedures, and the overall architecture of such systems. We consider these critiques in detail, and we construct a simulation model that more closely matches realistic systems. We show how both the accuracy and privacy impact of a hypothetical system could be substantially improved, and we discuss the necessary and sufficient conditions for this improvement to be achieved. This analysis is neither a defense nor a critique of any particular system concept. Rather, our model suggests alternative technical designs that could mitigate some concerns, but also raises more specific conditions that must be met for such systems to be both accurate and socially desirable.
Suds: automatic parallelization for raw processors
Authors: Matthew Ian Frank
Venue:  (2003)

A computer can never be too fast or too cheap. Computer systems pervade nearly every aspect of science, engineering, communications and commerce because they perform certain tasks at rates unachievable by any other kind of system built by humans. A computer system's throughput, however, is constrained by that system's ability to find concurrency. Given a particular target work load the computer architect's role is to design mechanisms to find and exploit the available concurrency in that work load. This thesis describes SUDS (Software Un-Do System), a compiler and runtime system that can automatically find and exploit the available concurrency of scalar operations in imperative programs with arbitrary unstructured and unpredictable control flow. The core compiler transformation that enables this is scalar queue conversion. Scalar queue conversion makes scalar renaming an explicit operation through a process similar to closure conversion, a technique traditionally used to compile functional languages. The scalar queue conversion compiler transformation is speculative, in the sense that it may introduce dynamic memory allocation operations into code that would not otherwise dynamically allocate memory. Thus, SUDS also includes a transactional runtime system that periodically checkpoints machine state, executes code speculatively, checks if the speculative execution produced results consistent with the original sequential program semantics, and then either commits or rolls back the speculative execution path. In addition to safely running scalar queue converted code, the SUDS runtime system safely permits threads to speculatively run in parallel and concurrently issue memory operations, even when the compiler is unable to prove that the reordered memory operations will always produce correct results. Using this combination of compile time and runtime techniques, SUDS can find concurrency in programs where previous compiler based renaming techniques fail because the programs contain unstructured loops, and where Tomasulo's algorithm fails because it sequentializes mispredicted branches. Indeed, we describe three application programs, with unstructured control flow, where the prototype SUDS system, running in software on a Raw microprocessor, achieves speedups equivalent to, or better than, an idealized, and unrealizable, model of a hardware implementation of Tomasulo's algorithm. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Bifurcation phenomena in molecular vibrational spectroscopy
Authors: S. C. Farantos
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Spectroscopic techniques such as the Dispersed Fluorescence (DF), and Stimulated Emission Pumping (SEP)[1] have revealed a new dynamical picture of small polyatomic molecules excited at very high vibrational states. Spectra of high complexity at high resolution may show regularities at low resolution, intense regular progressions of spectral lines may coexist with congested bands, and even irregular spectra may be replaced by regular ones as energy increases. Vibrational spectra of excited molecules are the fingerprints of the nonlinear mechanical behaviour of the molecule. The assignment of the spectral lines particularly of the regular ones, and thus the extraction of dynamics, is a challenging task, since the picture which emerges defies the previous simple ideas that a molecule shows regular behaviour at low energies and chaotic one above a threshold energy. Furthermore, when elementary chemical processes such as isomerization and dissociation are involved the understanding of how a bond is breaking and a new one is formed brings back fundamental questions of chemical dynamics.
Smart home &ndash; digitally engineered domestic life
Authors: Sang Hyun Park, So Hee Won, Jong Bong Lee, Sung Woo Kim
Venue: Personal and Ubiquitous Computing (2003)

The purpose of the Smart Home Project is to devise a set of intelligent home appliances that can provide an awareness of the users' needs, providing them with a better home life experience without overpowering them with complex technologies and intuitive user interfaces. Our main aim for the project is to improve day-to-day home life with smart computer technologies while still keeping the home life as normal as possible &ndash; we refer to this as &ldquo;digitally engineering analogue home life&rdquo;.
Superconducting cold-electron bolometer with proximity traps
Authors: Leonid Kuzmin
Venue: Microelectronic Engineering (2003)

A novel concept of the superconducting cold-electron bolometer (SCEB) with proximity traps and SIN tunnel junctions for electron cooling has been proposed for optimal performance of the supersensitive detector. The THz signal is concentrated by superconducting antenna and absorbed by superconducting strip fabricated in the same layer. The released heat diffuses to normal metal traps provided by the proximity effect in superconductor due to direct contact with normal metal. The SIN tunnel junction formed by normal metal trap and another superconductor removes this heat very effectively due to small volume of the normal metal and approximately 100% efficiency (!) of tunnel junction as electronic cooler (relation of an area of the tunnel junction to the area of cooled absorber). A dc SQUID can be used as a readout system in a voltage-biased mode, collecting signal from both junctions in parallel. Theoretical estimations show that it is possible to realize high performance of the SCEB with NEP of 10-18 W/Hz1/2 at temperature 0.3 K with moderate volume of superconducting absorber and relatively small volume of normal metal traps less than 0.01 µm3.
System-on-Chip (SoC): Clocking and Synchronization Issues
Authors: Ramalingam Sridhar
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Technology scaling continues to improve transistor performanceand integration to realize complex systems andadded functionality in SoC designs. This reduces the energyconsumed with a 30% speed improvement per technologygeneration. The scaling, however, comes with some adverseeffects posing perceived barriers.In this paper, we discuss the design challenges in UltraDeep Submicron (UDSM) technologies and the scalingproblems in SoC circuits for clocking and synchronization.This includes delay variations and functional errors due tovarious types of noise sources. Correct clocking and synchronizationcan be achieved through innovative strategiesthat work at all levels of abstraction.
Fast vertical mining using diffsets
Authors: Mohammed J. Zaki, Karam Gouda
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

A number of vertical mining algorithms have been proposed recently for association mining, which have shown to be very effective and usually outperform horizontal approaches. The main advantage of the vertical format is support for fast frequency counting via intersection operations on transaction ids (tids) and automatic pruning of irrelevant data. The main problem with these approaches is when intermediate results of vertical tid lists become too large for memory, thus affecting the algorithm scalability.In this paper we present a novel vertical data representation called Diffset, that only keeps track of differences in the tids of a candidate pattern from its generating frequent patterns. We show that diffsets drastically cut down the size of memory required to store intermediate results. We show how diffsets, when incorporated into previous vertical mining methods, increase the performance significantly.
Stability of an equilibrium solution for a gyrostat about an oscillating point
Authors: J. A. Vera, A. Vigueras
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In the present paper will study the stability of an equilibrium solution of the problem of motion of a symmetric gyrostat about a point belonging to its rigid part when this point deecribes an oscillatory motion with amplitude z0 and frequency ω.Two systems of reference are considered: a system OXYZ, whose axes are parallel to those of a fixed or inertial frame and another mobile Oxyz, fixed in the body, and whose axes are directed along the principal axes of inertia of the gyrostat.
Alerts for Healthcare Process and Data Integration
Authors: Dickson K. W. Chiu, Benny W. C. Kwok, Ray L. S. Wong, S. C. Cheung, Eleanna Kafeza, Marina Kafeza
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

In healthcare chain workflow management, urgent requests and critical messages in these systems (referred to as alerts) have to be delivered and handled timely. Presently, most systems cannot address urgency and alerts are often handled in an ad-hoc manner. In this paper, we propose a sophisticated alert management system (AMS) for effective healthcare chain workflow management under urgent constraints. We develop a model for specifying alerts, in which alerts are associated with healthcare tasks and a set of parameters are captured for their routing and urgency requirements. Further, alerts also serve as a mechanism for both process and data integration. The AMS matches the specialties of healthcare personnel and functionalities of Web Services providers to receive an alert, based on the alert specification. We then propose a routing mechanism that is initiated when the alert message is not acknowledged or serviced within the deadline, so that the alert can be re-routed if necessary. Monitoring is especially essential to ensure timeliness and availability of services, otherwise suitable exceptions should be raised and handled. We outline our implementation framework with Web Services for communications among healthcare service providers and mobile devices for medical professionals. We demonstrate the applicability of our approach with a pilot prototype medical house-call system (MHCS) with evaluations of medical professionals.