ppxscal/embedding_network huggingface dataset:
A Metasemantics to Refine Fuzzy If-Then Rules
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

Fuzzy if-then rules are used to represent fuzzymodels. Real data is later used to tune the model.Usually this forces a modification of the initiallinguistic terms of the linguistic variables used forthe model. Such modifications may lead to a loss ininterpretability of the rules. In this paper we suggestusing a form of multiresolution to tune the rules, byintroducing more linguistic terms in the regions ofthe universe of discourse where this is needed.Starting with triangular shaped linguistic terms andrecalling that symmetric triangles are first degreesplines, a form of multiresolution is readilyobtained, supporting a better accuracy of the model.It is shown that by using the linguistic modifiers"very" and "more or less" as well as themetasemantic modifiers "between" and "from - to"the interpretability of the original rule may bepreserved.
A Data Warehouse Conceptual Data Model
Authors: Enrico Franconi, Anand Kamble
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

In this short paper we will briefly introduce a Data WarehouseConceptual Data Model, which gracefully extends thestandard Entity-Relationship (ER) conceptual data modelwith multi-dimensional aggregated entities. The conceptualdata model has a clear model-theoretic semantics groundedon the extension of the standard ER semantics with theGMD logic-based multi-dimensional data model.
Graduate students learning strategies through research collaboration
Authors: Eduardo Argollo, Mauricio Hanzich, Diego Mostaccio, Germán Bianchini, Paula Fritzsche, Ferran Bonàs, Emilio Luque, Juan Carlos Moure, Dolores Rexachs
Venue: ACM SIGCSE Bulletin (2004)

It is already known that the learning process can be accelerated with the mixture of theoretical classes and experimental work. This paper describes an interesting experiment with that combination in the teaching of computer architecture for Ph.D. students in collaboration with a researcher in a real design investigation. As the work progressed, a simple cyclical methodology arose as reference for future works.
Incorporating ideas from computer-supported cooperative work
Authors: Wanda Pratt, Madhu C. Reddy, David W. McDonald, Peter Tarczy-Hornoch, John H. Gennari
Venue: Journal of Biomedical Informatics (2004)

Many information systems have failed when deployed into complex health-care settings. We believe that one cause of these failures is the difficulty in systematically accounting for the collaborative and exception-filled nature of medical work. In this methodological review paper, we highlight research from the field of computer-supported cooperative work (CSCW) that could help biomedical informaticists recognize and design around the kinds of challenges that lead to unanticipated breakdowns and eventual abandonment of their systems. The field of CSCW studies how people collaborate with each other and the role that technology plays in this collaboration for a wide variety of organizational settings. Thus, biomedical informaticists could benefit from the lessons learned by CSCW researchers. In this paper, we provide a focused review of CSCW methods and ideas we review aspects of the field that could be applied to improve the design and deployment of medical information systems. To make our discussion concrete, we use electronic medical record systems as an example medical information system, and present three specific principles from CSCW: accounting for incentive structures, understanding workflow, and incorporating awareness.
A modified algorithm for generalized discriminant analysis
Authors: Wenming Zheng, Li Zhao, Cairong Zou
Venue: Neural Computation (2004)

Generalized discriminant analysis (GDA) is an extension of the classical linear discriminant analysis (LDA) from linear domain to a nonlinear domain via the kernel trick. However, in the previous algorithm of GDA, the solutions may suffer from the degenerate eigenvalue problem (i.e., several eigenvectors with the same eigenvalue), which makes them not optimal in terms of the discriminant ability. In this letter, we propose a modified algorithm for GDA (MGDA) to solve this problem. The MGDA method aims to remove the degeneracy of GDA and find the optimal discriminant solutions, which maximize the between-class scatter in the subspace spanned by the degenerate eigenvectors of GDA. Theoretical analysis and experimental results on the ORL face database show that the MGDA method achieves better performance than the GDA method.
Limits of the successive breakdown statistics to assess chip reliability
Authors: Jordi Suñé, Ernest Y. Wu, Wing L. Lai
Venue: Microelectronic Engineering (2004)

The possible application of the successive breakdown reliability methodology to ultrathin oxides of about 1 nm is examined. It is shown that these ultrathin oxides show both soft and hard breakdown. Two criteria for the application of this methodology are considered, chip fails after K events in the chip or in one of its devices. The implications of total chip leakage and maximum hard breakdown probability are shown to limit the application of the successive breakdown theory.
What is lacking in curriculum schemes for computing/informatics?
Authors: Maarten van Veen, Fred Mulder, Karel Lemmen
Venue: ACM SIGCSE Bulletin (2004)

In this paper we elaborate on the work done by IFIP Working Group 3.2 in 1997 and 2002 on various curriculum schemes for computing/informatics. It is the aim of this paper to contribute to this work by bringing in concepts and insights from curriculum research and curriculum theory. This offers an additional view on the curriculum schemes besides the more disciplinary content driven approach that mostly dominates the curriculum work. We analyze three curriculum schemes: Computing Curricula 2001 (CC2001), Informatics Curriculum Framework 2000 (ICF-2000) and Career Space (CSP) with two confronting exercises. The first exercise introduces the concepts of planned, enacted, experienced, and hidden curriculum and applies these to the process of development and implementation of curriculum schemes in general. The second exercise positions the three curriculum schemes in a generic set of curriculum components that is being used frequently in, for example, secondary education as well as in other disciplines. It appears that quite a few components are not included. The paper concludes with some suggestions for improving the development process of curriculum schemes.
A Small Cover for Convex Unit Arcs
Authors: Joseph A. Johnson, George D. Poole, John E. Wetzel
Venue: Discrete Computational Geometry (2004)

An arc in the plane is convex if it is simple (i.e., one&#x2013;one except that its endpoints may coincide) and lies on the boundary of its convex hull. We describe a compact convex plane set of area about 0.2466 that contains a congruent copy of each convex plane arc of unit length, a reduction of about 1.1% from the smallest such set previously known.
Object pointing: a complement to bitmap pointing in GUIs
Authors: Yves Guiard, Renaud Blanch, Michel Beaudouin-Lafon
Venue: Proceedings of Graphics Interface 2004 (2004)

Pointing has been conceptualized and implemented so far as the act of selecting pixels in bitmap displays. We show that the current technique, which we call bitmap pointing (BMP), is often sub-optimal as it requires continuous information from the mouse while the system often just needs the discrete specification of objects. The paper introduces object pointing (OP), a novel interaction technique based on a special screen cursor that skips empty spaces, thus drastically reducing the waste of input information. We report data from 1D and 2D Fitts' law experiments showing that OP outperforms BMP and that the performance facilitation increases with the task's index of difficulty. We discuss the implementation of OP in current interfaces.
Seamless Mobile Computing on Fixed Infrastructure
Authors: Michael Kozuch, Mahadev Satyanarayanan, Thomas Bressoud, Casey Helfrich, Shafeeq Sinnamohideen
Venue: Computer (2004)

The authors envision a world in which computers are provided for public use in locations ranging from coffee shops to medical office waiting rooms. In such a world, only when a user starts to use a computer will it acquire his unique customization and state, which will likewise disappear when he stops using it. For this to be a compelling vision from a user's viewpoint, the customization and state acquisition process must be accurate and nearly instantaneous. For it to be a viable business model, the management and system administration costs of pervasive deployments of machines must be low. To address these challenges, the authors have developedInternet Suspend/Resume, a pervasive computing technology that rapidly personalizes and depersonalizes anonymous hardware for transient use.
Aunt Luisa
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

This film features an aging widow who, through a whiskey induced haze, has become convinced that bandleader Guy Lombardo and his Royal Canadians have taken up residence in her house. She hears them playing, but she's never actually seen them as the performance is always happening in another room. Blur Studio wrote and produced "Aunt Luisa" entirely in-house, with the studio's team of artists and animators handling concept design, storyboards and every phase of the animation process. Copyright held by creator.
A note on linear complementarity problems and multiple objective programming
Authors: S. R. Mohan, S. K. Neogy, A. K. Das
Venue: Mathematical Programming: Series A and B (2004)

Kostreva and Wiecek [3] introduced a problem called LCP-related weighted problem in connection with a multiple objective programming problem, and suggested that a given linear complementarity problem (LCP) can be solved by solving the LCP-related weighted problem associated with it. In this note we provide several clarifications of the claims made in [3]. Finally, we feel that solving any LCP by the approach given in [3] may not be as useful as it is claimed.
Design of Single Sign-On
Authors: Gang Zhao, Dong Zheng, Kefei Chen
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

As IT systems proliferate to support business processes, users typically have to sign-on to multiple systems, necessitating an equivalent number of sign-on dialogues. Single sign-on can resolve the problem well. We first introduce the situation which makes the SSO becomes necessary. Then we elaborate the first version of our system and analyze its problems. Next, we improve the first version and propose the second version. Finally, we analysis the system and acknowledge the problems left open.
Searching databases for sematically-related schemas
Authors: Gauri Shah, Tanveer Syeda-Mahmood
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this paper, we address the problem of searching schema databases for semantically-related schemas. We first give a method of finding semantic similarity between pair-wise schemas based on tokenization, part-of-speech tagging, word expansion, and ontology matching. We then address the problem of indexing the schema database through a semantic hash table. Matching schemas in the database are found by hashing the query attributes and recording peaks in the histogram of schema hits. Results indicated a 90% improvement in search performance while maintaining high precision and recall.
A fully automated fault-tolerant system for distributed video processing and off-site replication
Authors: George Kola, Tevfik Kosar, Miron Livny
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

Different fields including biomedical-engineering, educational research and geology have an increasing need to process large amounts of video and make them electronically available at different locations. So far, this has been a failure-prone tedious operation with an operator needed to babysit the processing and off-site replication of processed video. In this work, we developed a fault-tolerant system that handles large scale processing and replication of digital video in a fully automated manner. The system is highly resilient and handles a variety of hardware, software and network failures making it possible to process videos using commodity clusters or grid resources. Finally, we discuss how the system is being used in educational research to process several hundred terabytes of video.
Regular Polytopes of Full Rank
Authors: Peter McMullen
Venue: Discrete Computational Geometry (2004)

The dimension of a faithful realization of a finite abstract regular polytope in some euclidean space is no smaller than its rank. Similarly, that of a discrete faithful realization of a regular apeirotope is at least one fewer than the rank. Realizations which attain the minimum are said to be of full rank. The regular polytopes and apeirotopes of full rank in two and three dimensions were classified in an earlier paper. In this paper these polytopes and apeirotopes are classified in all dimensions. Moreover, it is also shown that there are no chiral polytopes of full rank.
Feature-Sensitive 3D Shape Matching
Authors: Andrey Sharf, Ariel Shamir
Venue: Proceedings of the Computer Graphics International (2004)

Three dimensional shape matching plays an importantrole in many of todayýs applications. Nevertheless, shapematching is a difficult problem since there is no uniquemeasure that defines shape similarity and since computingshape distance using various measures is an elaborate task.In this paper we present a new framework for matchingshapes, represented by union of spheres hierarchies. Ourapproach is "feature-sensitive" since it extends the usualgeometry-based matching by adding sensitivity to shapetopology, shape features (sharp angles, chemical attributes)and their relative positioning on the shape. Our method canbe used in conjecture with other geometric matching methodsas a pre or post-processing filtering stage, or it can beused as a stand-alone feature-sensitive matching.
Parametrization of approximate algebraic curves by lines
Authors: Sonia Pérez-Díaz, Juana Sendra, J. Rafael Sendra
Venue: Theoretical Computer Science (2004)

It is well known that irreducible algebraic plane curves having a singularity of maximum multiplicity are rational and can be parametrized by lines. In this paper, given a tolerance ε > 0 and an ε-irreducible algebraic plane curve L of degree d having an ε-singularity of multiplicity d - 1, we provide an algorithm that computes a proper parametrization of a rational curve that is exactly parametrizable by lines. Furthermore, the error analysis shows that under certain initial conditions that ensures that points are projectively well defined, the output curve lies within the offset region of L at distance at most 2√2ε1(2d)exp(2).
Creating VR Scenes Using Fully Automatic Derivation of Motion Vectors
Authors: Kensuke Habuka, Yoshihisa Shinagawa
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

We propose a new method to create smooth VRscenes using a limited number of images and themotion vectors among them. We will discuss twospecific components to simulate a majority of VRscenes: MV VR Object and MV VR Panorama. Theyprovide similar functions to QuickTime VR Objectand QuickTime VR Panorama. However, ourmethod can interpolate between the existing images,and therefore, smooth movement of viewpoints isachieved. When we look at a primitive from arbitraryviewpoints, the images of an object associatedwith the primitive is transformed according to themotion vectors and to the location of the viewpoint.
VRML Scene Graphs on an Interactive Ray Tracing Engine
Authors: Andreas Dietrich, Ingo Wald, Markus Wagner, Philipp Slusallek
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

With the recent advances in ray tracing technology, high-qualityimage generation at interactive rates has finally becomea reality. As a consequence ray tracing will likely playa larger role in visualization systems, enabling the conceptionand creation of completely new interactive graphics applications.In this paper we describe the design and development ofa ray tracing-based VRML browser and editor as a casestudy of such an application. It exploits all advantagesof ray tracing, including physically-correct plug and playshading and support for large models.In particular we demonstrate how to overcome the limitationsthat result from existing scene graph libraries anddata exchange formats still being targeted towards rasterizationtechnology. Also we show how to extend the VRMLlighting model and to optimize scene graph handling for ray tracing.
Hosting the .NET Runtime in Microsoft SQL server
Authors: Alazel Acheson, Mason Bendixen, José A. Blakeley, Peter Carlin, Ebru Ersan, Jun Fang, Xiaowei Jiang, Christian Kleinerman, Balaji Rathakrishnan, Gideon Schaller, Beysim Sezgin, Ramachandran Venkatesh, Honggang Zhang
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

The integration of the .NET Common Language Runtime (CLR) inside the SQL Server DBMS enables database programmers to write business logic in the form of functions, stored procedures, triggers, data types, and aggregates using modern programming languages such as C#, Visual Basic, C++, COBOL, and J++. This paper presents three main aspects of this work. First, it describes the architecture of the integration of the CLR inside the SQL Server database process to provide a safe, scalable, secure, and efficient environment to run user code. Second, it describes our approach to defining and enforcing extensibility contracts to allow a tight integration of types, aggregates, functions, triggers, and procedures written in modern languages with the DBMS. Finally, it presents initial performance results showing the efficiency of user-defined types and functions relative to equivalent native DBMS features.
Generic Path Planning for Real-Time Applications
Authors: Christoph Niederberger, Dejan Radovic, Markus Gross
Venue: Proceedings of the Computer Graphics International (2004)

We present a fast and robust path planning algorithm forgeneric static terrains with polygonal obstacles. Our algorithmfinds shorter, and therefore more intuitive paths than atraditional A* approach with a similar underlying graph. Thepresented algorithm is derived from A* and is modified to circumventundecidable situations and unintuitive results. Additionally,we present two post-processing steps to enhance thequality and visual appearance of the resulting paths. The firstmethod minimizes the number of waypoints in a path whilethe second method takes the slope of the terrain into accountin order to generate visually more pleasing paths. We showthat our algorithm is fast and, therefore, well suited for realtimeapplications, such as games or virtual environments.
Solution of the Euler equations on Cartesian grids
Authors: Ainslie D. French
Venue: Applied Numerical Mathematics (2004)

A method is presented for the solution of the two-dimensional Euler equations on Cartesian grids. The method utilizes a conservative cell vertex Euler solver with Lax-Wendroff time-stepping. Results are presented for transonic flow for Ni's 2D channel flow problem and also for transonic flow about a circular cylinder.
Evaluation of the Group Study Using Peer Review in the Lesson of Programming
Authors: Yasuko Namatame
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

Abstractý The lessons of programming are made into thespecial foundation subjects at the curriculum of the faculty ofinformation system. However, it is difficult for the currentstudents to attain study targets in a standard classroom lecture.Then, we would propose adopting the group study method in apart of simultaneous lesson. One group is composed of severalstudents. And each student in a group teaches each other.Especially students evaluate flow charts mutually, which is calledpeer review. As a result of carrying out factor analysis of students'questionnaire after group study, the following three factors wereextracted. The 1st factor is the effect of group study. The 2ndfactor is the benefits of reviewers. The 3rd factor is the effect of areview. Furthermore, students were divided into thehigh-achieving group and the poor-achieving group, and t-test ofaverage of factor scores of both groups was performed. Theaverage of each factor score of the 1st factor and the 3rd factorwas intentionally high the poor-achieving group. The group studyaccompanied by a peer review is useful in order to make the studytarget of a simultaneous lesson attain. Students wish to carry outthe group study once for every five simultaneous lessons. Thisfrequency of group study also fits a curriculum.
On the development of a communication-aware task mapping technique
Authors: Juan Manuel Orduña, Federico Silla, José Duato
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

Clusters have become a very cost-effective platform for high-performance computing. In these systems, although currently existing networks actually provide enough bandwidth for the existing applications and workstations, the trend is towards the interconnection network becoming the system bottleneck. Therefore, in the future, scheduling strategies will have to take into account the communication requirements of the applications and the communication bandwidth that the network can offer. One of the key issues in these strategies is the task mapping technique used when the network becomes the system bottleneck.In this paper, we propose a communication-aware mapping technique that tries to match as well as possible the existing network resources to the communication requirements of the applications running on the system. Also, we evaluate the mapping technique using real MPI application traces with timestamps. Evaluation results show that the use of the proposed mapping technique better exploits the available network bandwidth, improving load balancing and increasing the throughput that can be delivered by the network. Therefore, the proposed technique can be used in the design of communication-aware scheduling strategies for those situations where the communication requirements lead the network bandwidth to become the system performance bottleneck.
Scalable and Area Efficient Concurrent Interleaver for High Throughput Turbo-Decoders
Authors: Filippo Speziali, Julien Zory
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Parallel Turbo Decoder architectures have recently been proposed to reach high-throughput channel decoding capacity.However, the implementation of the underlying parallel interleaving subsystem suffers from memory access conflicts; those translate into logic overhead and critical path issues which are blocking factors for handheld System-on-Chip solutions.In this paper, we explore several architecture and VLSI design strategies that drastically reduce the logic overhead and data-path delays of concurrent interleaving architectures.A novel stalling mechanism is introduced that reduces the interleaving subsystem die area and improves the architecture scalability with respect to the number of MAP producers. ASIC synthesis results in 0.18¿m and 0.13¿m CMOS STMicroelectronics technologies demonstrate the efficiency of the proposed VLSI concurrent interleaving architecture.
Puppet show
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 2 - Volume 146 (2003)

An accident that happens to puppets. Copyright held by creator. 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