ppxscal/embedding_network huggingface dataset:
A comparison of rough set strategies for pre-term birth data
Authors: Jerzy W. Grzymala-Busse, Linda K. Goodwin, Witold J. Grzymala-Busse, Xinqun Zheng
Venue: Technologies for constructing intelligent systems: Tasks (2002)

In many applications data are inconsistent: for two distinct cases attribute values are the same but the decisions are different. For example, two patients are characterized identically by all tests, demographic variables, etc., however, one delivers a baby prematurely and the other delivers at full term.Our main objective was to increase sensitivity, i.e., a conditional probability of true positives. In order to achieve this objective we changed a strength multiplier for rules describing preterm cases. In our experiments we induced rules from preterm birth data using LERS (Learning from Examples using Rough Sets). The problem was to make the best use of certain and possible rule sets induced by LERS from inconsistent data. To solve this problem we used eight different strategies: using only certain rules, only possible rules, first certain then possible rules, and both rule sets; combined with two different ways to use rules in complete and partial matching.
A Probabilistic Approach to Evaluate Strategies for Selecting a Parking Space
Authors: C. Richard Cassady, John E. Kobza
Venue: Transportation Science (1998)

Upon entering the parking lot of a facility, a driver must select a parking space. This paper proposes and evaluates strategies which are intended to find a "good" parking space. Three performance measures are defined for evaluating the "goodness" of a selected parking space. One of these is based on the amount of walking required of the customer, another is based on the amount of driving required, and the third is a combination of the first two and represents the time required for the customer to reach the front door of the facility. Two strategies are defined for selecting a parking space. The first is simple and somewhat conservative, whereas the second strategy is more complicated and aggressive. A probabilistic approach is used to evaluate the three performance measures for each strategy using a parking lot of somewhat "typical" configuration. This approach treats driver decisions and parking space availability as random experiments, and uses conditional probability to evaluate the performance of the strategies.
Quantified beliefs and believed quantities
Authors: Dov Samet
Venue: Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge (1998)

It is shown that probabilistic beliefs and estimation of quantities give rise to the same model, that of a type space, and can be viewed as the two sides of the same coin. We study the axiom of correct estimation, which states that an agent's estimation of his own estimation is correct, showing it to be weaker than the introspection axiom, according to which an agent is certain of his own probabilistic beliefs. The correct estimation axiom implies, however, that the agent is certain that he is introspective, and it is equivalent to the axioms of averaging and conditioning, which are expressed in terms of probabilistic beliefs.
Algorithms for data migration with cloning
Authors: Samir Khuller, Yoo-Ah Kim, Yung-Chun (Justin) Wan
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

Our work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high demand storage servers are used as web servers, or multimedia servers for handling high demand for data. As the system is running, it needs to dynamically respond to changes in demand for different data items. In this work we study the data migration problem, which arises when we need to quickly change one storage configuration into another. We show that this problem is NP-hard. In addition, we develop polynomial-time approximation algorithms for this problem and prove a worst case bound of 9.5 on the approximation factor achieved by our algorithm. We also compare the algorithm to several heuristics for this problem.
Development of industrial information systems on the web using business components
Authors: Somjit Arch-int, Dentcho N. Batanov
Venue: Computers in Industry (2003)

Web technologies, as tools, are most popular and widely used today not only in the everyday life but in industry as well. Examples of such technologies are the browsers, search engines, related communication protocols and their implementations, mechanisms for creating dynamic and active Web sites, security mechanisms, etc. These technologies lead to requirements for substantial changes in the methodologies for development and deployment of all systems and subsystems, which constitute any business process. Changes and/or new decisions are necessary to make possible the modern Web-based technological tools to be used effectively for Web-based business processes. A methodology for developing business software components as basic building elements of industrial information systems, implemented and deployed in Web-based computing environment is proposed and discussed in this paper. The methodology is based on the idea of creating a unified framework for representing business activities as a basis for business process modeling. Respective models, methods and techniques ensure the business objects and components to applied to currently most accepted three-tier Web application architecture using XML document as distributed object. For illustrative purposes only the proposed methodology is applied step by step, with respective comments, to developing a part of inventory subsystem of industrial information system as a case study.
ISOSLIDER: a system for interactive exploration of isosurfaces
Authors: Jatin Chhugani, Sudhir Vishwanath, Jonathan Cohen, Subodh Kumar
Venue: Proceedings of the symposium on Data visualisation 2003 (2003)

We present ISOSLIDER, a system for interactive exploration of isosurfaces of a scalar field. Our algorithm focuses on fast update of isosurfaces for interactive display as a user makes small changes to the isovalue of the desired surface. We exploit the coherence of this update. Larger changes are supported as well. The update to the isosurface is made at a correct level of detail so that not too many operations need be performed nor too many triangles need be rendered. ISOSLIDER does not need to retain the entire volume in the main memory and stores most data out of core. The central idea of the ISOSLIDER algorithm is to determine salient isovalues where surface topology changes and pre-encode these changes so as to facilitate fast updates to the triangulation.
Data exchange: getting to the core
Authors: Ronald Fagin, Phokion G. Kolaitis, Lucian Popa
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

Data exchange is the problem of taking data structured under a source schema and creating an instance of a target schema that reflects the source data as accurately as possible. Given a source instance, there may be many solutions to the data exchange problem, that is, many target instances that satisfy the constraints of the data exchange problem. In an earlier paper, we identified a special class of solutions that we call universal. A universal solution has homomorphisms into every possible solution, and hence is a "most general possible" solution. Nonetheless, given a source instance, there may be many universal solutions. This naturally raises the question of whether there is a "best" universal solution, and hence a best solution for data exchange. We answer this question by considering the well-known notion of the core of a structure, a notion that was first studied in graph theory, but has also played a role in conjunctive-query processing. The core of a structure is the smallest substructure that is also a homomorphic image of the structure. All universal solutions have the same core (up to isomorphism); we show that this core is also a universal solution, and hence the smallest universal solution. The uniqueness of the core of a universal solution together with its minimality make the core an ideal solution for data exchange. Furthermore, we show that the core is the best among all universal solutions for answering unions of conjunctive queries with inequalities. After this, we investigate the computational complexity of producing the core. Well-known results by Chandra and Merlin imply that, unless P = NP, there is no polynomial-time algorithm that, given a structure as input, returns the core of that structure as output. In contrast, in the context of data exchange, we identify natural and fairly broad conditions under which there are polynomial-time algorithms for computing the core of a universal solution. Finally, we analyze the computational complexity of the following decision problem that underlies the computation of cores: given two graphs G and H, is H the core ofG? Earlier results imply that this problem is both NP-hard and coNP-hard. Here, we pinpoint its exact complexity by establishing that it is a DP-complete problem.
Teaching together: a three-year case study in genomics
Authors: Mark D. LeBlanc, Betsey D. Dyer
Venue: Journal of Computing Sciences in Colleges (2003)

The emerging field of "Genomics" (the analysis of DNA sequences) requires interdisciplinary collaborations between computer scientists and biologists. Whereas most colleges and universities do not and may not ever have full programs in bioinformatics/genomics, new models of teaching and associated supporting materials are needed if we are to provide undergraduate science majors with experiences in the art of cooperation necessary to solve tomorrow's problems in genomics. We report here on our recent three-year experiences with "linking" computer science and biology courses. By infusing genomics into existing computer science and biology courses ("Algorithms," "Software Engineering," "Genetics," and "Cell Evolution"), interdisciplinary classes and labs in genomics are provided to all computer science majors and over half of all majors in the biological sciences (biology, biochemistry, environmental science, and psychobiology).
GuiGen: a toolset for creating customized interfaces for grid user communities
Authors: Alexander Reinefeld, Hinnerk Stüben, Florian Schintke, George Din
Venue: Future Generation Computer Systems (2002)

GuiGen is a comprehensive set of tools for creating customized graphical user interfaces (GUIs). It draws from the concept of computing portals, which are here seen as interfaces to application-specific computing services for user communities. While GuiGen was originally designed for the use in computational grids, it can be used in client/server environments as well.Compared to other GUI generators, GuiGen is more versatile and more portable. It can be employed in many different application domains and on different target platforms. With GuiGen, application experts (rather than computer scientists) are able to create their own individually tailored GUIs.
The Latest MML (Medical Markup Language) Version 2.3&mdash;XML-Based Standard for Medical Data Exchange/Storage
Authors: Jinqiu Guo, Kenji Araki, Koji Tanaka, Junzo Sato, Muneou Suzuki, Akira Takada, Toshiaki Suzuki, Yusei Nakashima, Hiroyuki Yoshihara
Venue: Journal of Medical Systems (2003)

As a set of standards, Medical Markup Language (MML) has been developed over the last 8 years to allow the exchange of medical data between different medical information providers. MML version 2.21 was characterized by XML as metalanguage and was announced in 1999, at which time full-scale implementation tests were carried out&semi; subsequently, various information and functional inadequacies were discovered in this version. MML was therefore updated to version 2.3 in 2001. At present, MML contains 12 MML modules including the new referral, test result, and report modules. In version 2.3, the group ID element was added&semi; the access right definition and health insurance module were amended.
Distributed data mining on the grid
Authors: Mario Cannataro, Domenico Talia, Paolo Trunfio
Venue: Future Generation Computer Systems (2002)

In many industrial, scientific and commercial applications, it is often necessary to analyze large data sets, maintained over geographically distributed sites, by using the computational power of distributed and parallel systems. The grid can play a significant role in providing an effective computational support for knowledge discovery applications. We describe a software architecture for geographically distributed high-performance knowledge discovery applications called KNOWLEDGE GRID, which is designed on top of computational grid mechanisms, provided by grid environments such as Globus. The KNOWLEDGE GRID uses the basic grid services such as communication, authentication, information, and resource management to build more specific parallel and distributed knowledge discovery tools and services. The paper discusses how the KNOWLEDGE GRID can be used to implement distributed data mining services.
Inside PARC
Authors: Ubiquity staff
Venue: Ubiquity (2002)

Johan de Kleer talks about knowledge tracking, smart matter and other new developments in AI.
Communication speed selection for embedded systems with networked voltage-scalable processors
Authors: Jinfeng Liu, Pai H. Chou, Nader Bagherzadeh
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

High-speed serial network interfaces are gaining wide use in connecting multiple processors and peripherals in modern embedded systems, thanks to their size advantage and power efficiency. Many such interfaces also support multiple data rates, and this ability is opening a new dimension in the power/performance trade-offs between communication and computation on voltage scalable embedded processors. To minimize energy consumption in these networked architectures, designers must not only perform functional partitioning but also carefully balance the speeds between communication and computation, which compete for time and energy. Minimizing communication power without considering computation may actually lead to higher energy consumption at the system level due to elongated on-time as well as lost opportunities for dynamic voltage scaling on the processors. We propose a speed selection methodology for globally optimizing the energy consumption in embedded networked architectures. We formulate a multi-dimensional optimization problem by modeling communication dependencies between processors and their timing budgets. This enables engineers to systematically solve the problem of optimal speed selection for global energy reduction. We demonstrate the effectiveness of our speed selection approach with an image processing application mapped onto a multi-processor architecture with a multi-speed Ethernet.
The Role of Multimedia in Changing First Impression Bias
Authors: Kai H. Lim, Izak Benbasat, Lawrence M. Ward
Venue: Information Systems Research (2000)

First impression bias refers to a limitation of human information processing in which people are strongly influenced by the first piece of information that they are exposed to, and that they are biased in evaluating subsequent information in the direction of the initial influence. The psychology literature has portrayed first impression bias as a virtually "inherent" human bias. Drawing from multimedia literature, this study identifies several characteristics of multimedia presentations that have the potential to alleviate first impression bias. Based on this literature, a set of predictions was generated and tested through a laboratory experiment using a simulated multimedia intranet.Half of the 80 subjects were provided with a biased cue. Subjects were randomly assigned to four groups: (1) text with first impression bias cue, (2) multimedia with first impression bias cue, (3) text without biased cue, and (4) multimedia without biased cue. The experimental task involved conducting a five-year performance appraisal of a department head. The first impression bias cue was designed to provide incomplete and unfavorable information about the department head, but the information provided subsequently was intended to be favorable of his performance.Results show that the appraisal score of the text with biased cue group was significantly lower than the text only (without biased cue) group. On the other hand, the appraisal score of the multimedia with biased cue group was not significantly different from the multimedia only (without biased cue) group. As a whole, the results suggest that multimedia presentations, but not text-based presentations, reduce the influence of first impression bias.
Molecular electronics: devices, systems and tools for gigagate, gigabit chips
Authors: Michael Butts, Andrée DeHon, Seth Copen Goldstein
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

New electronics technologies are emerging which may carry us beyond the limits of lithographic processing down to molecular-scale feature sizes. Devices and interconnects can be made from a variety of molecules and materials including bistable and switchable organic molecules, carbon nanotubes, and, single-crystal semiconductor nanowires. They can be self-assembled into organized structures and attached onto lithographic substrates. This tutorial reviews emerging molecular-scale electronics technology for CAD and system designers and highlights where ICCAD research can help support this technology.
Kansei Information Processing and Virtual Reality Techniques for Japanese Traditional Crafting Presentation
Authors: Yoshitaka Shibata, Akihiro Miyakawa
Venue: Multimedia Tools and Applications (2003)

In this paper, we propose a user-friendly three-dimensional CG presentation system for a typical traditional Japanese crafting industry based on agent and virtual reality functions over Japan Gigabit Network (JGN) which is a testbed highspeed backbone network with 2.4 Gbps. A large number of traditional Japanese fittings in a local city are redesigned by three-dimensional computer graphics into CAD data and stored in the database servers distributed over JGN. Although each fitting data consists of more than several Mbytes size, user can interactively retrieve the desired fittings and put those into the traditional Japanese interior to design more creative and original houses, hotels and other buildings in realtime. We prototyped a presentation system using VRML and JAVA on networked CG workstations. User can walk through the desired virtual space as a Japanese interior organized by various Japanese traditional fittings and interactively change those fittings by selecting from the database and replacing by simple operations. As a result, we could verify the usefulness of our suggested system not only for Japanese crafting but also for worldwide design industries.
Review of "The power of events: An introduction to complex event processing in distributed enterprise systems" by David Luckham, Addison Wesley Professional, May 2002
Venue: Ubiquity (2003)

An overview of more than a decade of work on event systems, formal specification and temporal reasoning
Personal universal controllers: controlling complex appliances with GUIs and speech
Authors: Jeffrey Nichols, Brad A. Myers, Michael Higgins, Joseph Hughes, Thomas K. Harris, Roni Rosenfeld, Kevin Litwack
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

We envision a future where each person will carry with them a personal universal controller (PUC), a portable computerized device that allows the user to control any ap-pliance within their environment. The PUC has a two-way communication channel with each appliance. It downloads a specification of the appliance's features and then automati-cally generates an interface for controlling that appliance (graphical, speech, or both). In this demonstration we pre-sent a working PUC system that automatically generates graphical and speech interfaces, and controls real appli-ances, including a shelf stereo and a Sony camcorder.
Discovering characteristic expressions in literary works
Authors: Masayuki Takeda, Tetsuya Matsumoto, Tomoko Fukuda, Ichiro Nanri
Venue: Theoretical Computer Science (2003)

We attempt to extract characteristic expressions from literary works. That is, given two collections of literary works, one of which is written by a particular author (positive examples) and the other by a different author (negative examples), the problem is to find expressions that appear frequently in the positive examples but which are seldom found in the negative examples. This is considered as a special case of the optimal pattern discovery from textual data, in which only the substring patterns are considered. One approach would be to create a list of text substrings sorted according to goodness, and to scrutinize the first part of the list by human efforts. Since there is no word boundary in Japanese texts, a substring is often a fragment of a word or phrase. A method to assist domain experts who are involved in this task is a key problem. In this paper, we propose partitioning the text substrings into equivalence classes under an equivalence relation on strings, originally defined by Blumer et al. (J. ACM 34(3) (1987) 578). The equivalence relation has the desirable property that all members of each equivalence class necessarily have a unique goodness value. This idea effectively reduces the inefficiency of the task of evaluating mined patterns. We also present a method for browsing possible superstrings of a focused string as well as its context. We report successful results with two pairs of anthologies of classical Japanese poems. We expect that the extracted expressions may lead to discovering overlooked aspects of individual poets.
Electromagnetic Signatures as a Tool for Connectionless Test
Authors: Mahnaz Salamati, Dag Stranneby
Venue: IEEE Design Test (2003)

Editor's note:When we test boards, we usually think in terms of traditional electrical test(in-circuit, flying probe) and nonelectrical test (optical, x-ray). This OrebroUniversity article develops an alternative, connectionless technique basedon scanning the electromagnetic field generated by active on-board devices.Could this make it into industry as an additional diagnostic tool?ýR.G. (Ben) BennettsBennetts Associates
Usability and CMMI: does a higher maturity level in product development mean better usability?
Authors: Timo Jokela, Tuomo Lalli
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

The new process improvement model, Capability Maturity Model Integration (CMMI) is analytically examined from the point of view of usability. The results show that a development organization even at the high levels of maturity may produce products with usability problems. The challenge for the field of HCI is to develop universal usability measures for the high maturity levels of CMMI.
Translating a convex polyhedron over monotone polyhedra
Authors: Tetsuo Asano, Antonio Hernández-Barrera, Subhas C. Nandy
Venue: Computational Geometry: Theory and Applications (2002)

Let S be a collection of geometric objects in K3 and let P be another geometric object in K3 The free configuration space of P with respect to S is the set of all possible placements of P so that P does not intersect the set S. Finding combinatorial and computational bounds for the computation of the free configuration space is a currently active area of research in computational geometry. We show in this paper that the free configuration space of a convex polyhedron P freely translating over a polyhedral terrain having a convex projection T can be computed in O(nm + k + t) time in the worst case, where m and n are the number of faces of P and T, respectively, k denotes the size of the output and t is a parameter whose value could be, at most, O(n2m log n).