ppxscal/embedding_network huggingface dataset:
C1 Hermite interpolation using MPH quartic
Authors: Gwang-Il Kim, Min-Ho Ahn
Venue: Computer Aided Geometric Design (2003)

In this paper, we study the C1 Hermite interpolation problem using Minkowski Pythagorean Hodograph (MPH) quartics in R2,1. As a preliminary step, we characterize MPH curves in R2,1 by the roots of the hodographs of their complexified spine curves. We present two schemes for this interpolation problem: one is a subdivision scheme using direct C1 interpolation and the other is a two step scheme using a new concept, C1/2 interpolation.
Publishing and Querying the Histories of Archived Relational Databases in XML
Authors: Fusheng Wang, Carlo Zaniolo
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

There is much current interest in publishing and viewing databases as XML documents. The general benefits of this approach follow from the popularity of XML and the tool set available for visualizing and processing information encoded in this universal standard. In this paper, we explore the additional and unique benefits achieved by this approach on temporal database applications. We show that XML views combined with XQuery can provide surprisingly effective solutions to the problem of supporting historical queries on past content of database relations and their evolution. Indeed, using XML, the histories of database relations can be naturally represented by temporally grouped data models. Thus, we identify mappings from relations to XML that are most conducive to modeling and querying database histories, and show that temporal queries that would be very difficult to express in SQL can be easily expressed in standard XQuery.Then, we turn to the problem of supporting efficiently the storage and the querying of relational table histories. We present an experimental study of the pros and cons of using native XML databases, versus using traditional databases, where the XML-represented histories are supported as views on the historical tables.
Virtual government: online-services within the public sector
Authors: Birgit J. Oberer
Venue: Current issues in IT education (2003)

In this chapter, an overview of electronic government is given. Online electronic services, like inquiry possibilities that are made available to its interaction partners (citizens and businesses) by administration authorities, are one proof of changes in the public sector because of modern information and communication technologies. Electronic government includes all governmental measures at the levels (union, states, and local governments) for qualitative improvements in citizen's different spheres of life and for optimization of business processes within the administration. It can cause an improvement of the relationship between administration, citizens, and businesses. The author gives an overview about selected current international electronic government incentives, introduces analysis methods for these governmental strategies, and shows developed guidelines for implementing electronic government.
Digital face cloning
Authors: Henrik Wann Jensen
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

This sketch describes the process and the technology used in the creation of a digital clone of a human face for a story in the November 2002 issue of National Geographic on skin[Swerdlow 2002].
Architectural Support for Uniprocessor and Multiprocessor Active Memory Systems
Authors: Daehyun Kim, Mainak Chaudhuri, Mark Heinrich, Evan Speight
Venue: IEEE Transactions on Computers (2004)

Abstract--We introduce an architectural approach to improve memory system performance in both uniprocessor and multiprocessor systems. The architectural innovation is a flexible active memory controller backed by specialized cache coherence protocols that permit the transparent use of address remapping techniques. The resulting system shows significant performance improvement across a spectrum of machine configurations, from uniprocessors through single-node multiprocessors (SMPs) to distributed shared memory clusters (DSMs). Address remapping techniques exploit the data access patterns of applications to enhance their cache performance. However, they create coherence problems since the processor is allowed to refer to the same data via more than one address. While most active memory implementations require cache flushes, we present a new approach to solve the coherence problem. We leverage and extend the cache coherence protocol so that our techniques work transparently to efficiently support uniprocessor, SMP and DSM active memory systems. We detail the coherence protocol extensions to support our active memory techniques and present simulation results that show uniprocessor speedup from 1.3 to 7.6 on a range of applications and microbenchmarks. We also show remarkable performance improvement on small to medium-scale SMP and DSM multiprocessors, allowing some parallel applications to continue to scale long after their performance levels off on normal systems.
A noncommutative version of the bispectral problem
Authors: F. Alberto Grünbaum, Plamen Iliev
Venue: Journal of Computational and Applied Mathematics (2003)

We consider a matrix valued version of the bispectral problem involving a block tridiagonal doubly infinite matrix and a first-order differential operator with matrix coefficients. We give a set of necessary conditions that the coefficients need to satisfy and solve these equations under a variety of conditions. The situations discussed here should make it plain that while the corresponding problem in the scalar case is relatively trivial and devoid of any interest, the noncommutative version of the problem is much richer and subtle. The results here should be useful, for instance, in the study of a noncommutative version of the nonlinear Toda lattice.
Acquiring engineering knowledge from design processes
Authors: Yoko Ishino, Yan Jin
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

Knowledge management has recently become the focus of public attention in business and engineering. Because knowledge acquisition is situated in the upstream of knowledge management, capturing knowledge is an important step for enterprises to achieve successful knowledge management. We focus on how engineers solve their design problems under given design contexts and propose a novel model and methods to capture knowledge from engineering design processes. Our goal is to acquire know-how knowledge without disrupting the normal design process. A three-layer design process model is introduced to represent generic design processes, and a grammar and extended dynamic programming (GEDP) method is developed based on the process model. GEDP adopts the grammar approach and EDP to automatically identify meaningful clusters, called operations, from primitive design events. Our approach is evaluated through a case study of designing a double-reduction gear system.
Tolerance of Control-Flow Testing Criteria
Authors: Sergiy A. Vilkomir, Kalpesh Kapoor, Jonathan P. Bowen
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Effectiveness of testing criteria is the ability to detect failuresin a software program. We consider not only effectivenessof some testing criterion in itself but a variance ofeffectiveness of different test sets satisfied the same testingcriterion. We name this property 'tolerance' of a testingcriterion and show that, for practical using a criterion, ahigh tolerance is as well important as high effectiveness.The results of empirical evaluation of tolerance for differentcriteria, types of faults and decisions are presented. Aswell as quite simple and well-known control-flow criteria,we study more complicated criteria: Full Predicate Coverage,Modified Condition/Decision Coverage and ReinforcedCondition/Decision Coverage criteria.
The Economic Rationale of Offering Media Files in Peer-to-Peer Networks
Authors: Jan U. Becker, Michel Clement
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

File sharing is one of the most controversial applications in the Internet. Millions of users enjoy downloads of billions of media files such as songs or movies. But where do these files come from? While the economic rationale to download files is obvious, the motives of individuals to actually share and, therefore, internalize the costs (i.e. the risk of being sued for copyright infringement) are less obvious. Consequently, empirical studies have shown a large proportion of users demanding files but not offering any and, therefore, free riding on their peers. Nevertheless, sharing can be rational. This paper offers a theoretical base to explainsharing behavior and proves that the users' utility considerations depend on the network's life cycle. At the beginning of a network's life cycle the incentives to share files are high if an individual understands the economics of network externalities. Nonetheless, the user's utility to share files decreases over time, especially if the network grows and becomes anonymous.The strategies of individual users to share or free ride are explained using game theoretic approaches. Depending on the life cycle, the expectations and utilities of the users differ, leading to various games and optimal strategies. We empirically test our hypotheses usingmixture regression models and explain the rationale of sharers in different stages of the life cycle. In order to prevent the (theoretically) inevitable break-down of the file sharing network, the authors finally present strategies for file sharing networks to enhance the user's willingness to share.
Distributed Code Constructions for the Entire Slepian-Wolf Rate Region for Arbitrarily Correlated Sources
Authors: D. Schongberg, K. Ramchandran, S. S. Pradhan
Venue: Proceedings of the Conference on Data Compression (2004)

Slepian-Wolf coding tackles the problem of distributed encoding of correlateddiscrete-alphabet sources for decoding at a common receiver.In thiswork, we propose a distributed linear block code construction for attainingany point on the Slepian-Wolf achievable rate region for arbitrarily correlatedsources using only a single code.Specifically, our prescription allows for anyarbitrary memoryless joint probability distribution over any arbitrary numberof distributed sources, and allows for any arbitrary rate combination thatlies in the Slepian-Wolf achievable region.Special cases of our framework includethe single source case (wherein our construction reduces to an entropycoder), source coding with side-information at the receiver (so-called cornerpoints of the Slepian-Wolf region), and specific source correlation models (suchas induced by a virtual Binary Symmetric Channel model).In this work, wedescribe how to use Low Density Parity Check (LDPC) codes in the proposedframework to solve the general Slepian-Wolf problem constructively.
Making connections: using classroom assessment to elicit students' prior knowledge and construction of concepts
Authors: Sarah Schwarm, Tammy VanDeGrift
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

Students bring prior knowledge and experiences to the classroom. According to the constructivist learning theory, students incorporate new knowledge into their existing knowledge frameworks. We used Classroom Assessment Techniques in an information technology course to elicit the construction of knowledge process. We found that CATs and instructor feedback can help shape and reveal this construction process. For example, responses to CATs revealed students' understandings of variables, digital representation, and iteration in the information technology domain. Some students claimed that the CATs helped put new ideas into their own words and helped them simplify the concepts.
An Object-Passing Model for Parallel Programming
Authors: Jameela Al-Jaroodi, Nader Mohamed
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

This paper introduces an object-passing model forparallel and distributed application development. Objectpassing provides the object-oriented application developerwith powerful yet simple methods to distribute andexchange data and logic (objects) among processes. Themodel extends message passing, while exploiting theadvantages of the object-oriented paradigm. In addition,the model provides a portable framework for executingapplications across multiple platforms, thus effectivelyexploiting available resources to gain more processingpower. A number of advantageous aspects of adoptingobject passing are discussed, in addition to highlightingthe differences between message passing, represented byMPI, and object passing. Another advantage is the model'ssuitability for heterogeneous systems. When implementedwith a portable language like Java, it can support paralleland distributed applications spanning a collection ofheterogeneous platforms. This form of execution willeventually allow for full utilization of available resourcesfor any given application written using this model.
Efficient andness-directed importance weighted averaging operators
Authors: Henrik Legind Larsen
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

Importance weighted averaging is a central information processing task in multicriteria decision problems of many kinds, such that selection, classification, object recognition, query answering, and information retrieval. These problems are characterized by a query, i.e., a set of importance weighted criteria, and a set of options queried. While each criterion determines a ranking of the options, the task of the averaging operator is essentially to aggregate these rankings into an overall ranking under the consideration of the criterion importance. We present a class of such operators, based on the power means, namely the Andness-directed Importance Weighted Averaging (AIWA) operators. The operators are equipped with an approximate andness measure allowing an easy, direct control of the andness in the unit interval. The aggregation behavior of the operators appears to be similar to that of importance weighted maximum entropy OWA operators. However, AIWA operators aggregates n arguments (criterion satisfaction values) in O(n) time as opposed to O(n log n) time for OWA operators. An interesting property provided by AIWA operators is decomposability, allowing us to consider new or improved criteria without recomputing with all arguments. Overall, the AIWA operators appear to be effective as andness controlled, importance weighted averaging operators, as well as easy to apply and computationally efficient.
Proton exchanged LiNbO3 and LiTaO3 optical waveguides and integrated optic devices
Authors: Yu. N. Korkishko, V. A. Fedorov, S. M. Kostritskii, A. N. Alkaev, E. I. Maslennikov, E. M. Paderin, D. V. Apraksin, F. Laurell
Venue: Microelectronic Engineering (2003)

We show that proton exchanged LiNbO3 waveguides exhibit very complex structural chemistry. Seven HxLi1-x NbO3 and six HxLi1-xTaO3 crystallographic phases have been identified in PE LiNbO3 and LiTaO3 waveguides, respectively. A correlation is done between the electrooptical, nonlinear and photorefractive properties, the processing conditions and the refractive index changes of the waveguides. Some integrated optical devices have been realized.
An iterative algorithm for the binate covering problem
Authors: M. Pipponzi, F. Somenzi
Venue: Proceedings of the conference on European design automation (1990)

Many problems of interest in the field of electronic design automation can be formulated as binate covering problems. This occurs whenever the solution sought for is the minimum cost assignment satisfying a boolean formula in conjunctive form. Practical problems may have hundreds of variables and thousands of clauses; hence efficient techniques are important. In this paper we propose a new iterative scheme that is based on solving a sequence of sub-problems that normally lead to the solution of the original problem in a fraction of the time.
A system implementation study: management commitment to project management
Authors: Robert P. Marble
Venue: Information and Management (2003)

Recent literature has shown a renewed interest in systems implementation research. Current trends in the organizational deployment of IT have motivated new studies of implementation efforts. This paper reports on one phase of a pluralistic investigation of systems implementation projects. A survey instrument, based on previously validated Measurement items, is described; it was tested and validated. In the process, a method for appraising the significance of interaction effects was determined. The results of the analysis show that, for the data of this study, the organizational priority given to implementation projects by top management is only associated indirectly with improved user information satisfaction (UIS). Only when this priority occurs in the management of continuing development and enhancement, does top management support seem to be significant to users. It was also found that the efficiency and flexibility of the development process was significant in its own right, even without any effects of top management support.
Developing trust in internet commerce
Authors: Ildemaro Araujo, Iván Araujo
Venue: Proceedings of the 2003 conference of the Centre for Advanced Studies on Collaborative research (2003)

Since the success of Web-based businesses depends essentially on their customers, consumers' trust is critical for Internet commerce. This article outlines essential issues that may affect customers' trust on Web sites or vendors. It also discusses key elements that can be used to improve the visitors' sense of trustworthiness on Web sites.
On the Expected Depth of Random Circuits
Authors: Sunil Arya, Mordecai J. Golin, Kurt Mehlhorn
Venue: Combinatorics, Probability and Computing (1999)

In this paper we analyse the expected depth of random circuits of fixed fanin f. Such circuits are built a gate at a time, with the f inputs of each new gate being chosen randomly from among the previously added gates. The depth of the new gate is defined to be one more than the maximal depth of its input gates. We show that the expected depth of a random circuit with n gates is bounded from above by ef ln n and from below by 2.04 &hellip; f ln n.
Context-aware mobile assistants for optimal interaction: a prototype for supporting the business traveler
Authors: Patrick Hertzog, Marc Torrens
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

Travel has many situations where context-aware computing can bring important benefits: pointing out notorious delays or bad weather during the planning phase, allowing the user to replan for handling unexpected situations, or suggesting flight alternatives to avoid strikes.This paper briefly describes an approach for integrating context-aware computing to a mobile travel assistant. We show how context-aware techniques can ease user interaction within mobile device applications. The presented ideas are illustrated with a scenario using a first version of a working prototype called Pocket reality.
Enhanced Utilization Bounds for QoS Management
Authors: Chang-Gun Lee, Lui Sha, Avinash Peddi
Venue: IEEE Transactions on Computers (2004)

Abstract--In many practical real-time applications, there is a given set of task frequencies (i.e., inverse of task periods) corresponding to predetermined QoS options that the applications can choose. For example, in audio applications, the typical choices of playback frequencies are for CD quality, radio quality, and phone quality. Similar configurations can be found in streaming video and in control applications. In such systems, applications dynamically arrive requesting one of the periods provided by the QoS manager. Thus, the accurate and efficient online schedulability test is essential for any task set whose periods are chosen from the QoS period set. For this purpose, this paper proposes new utilization bounds as a function of given QoS periods. As long as there is a set of given periods that can be chosen by applications, the bounds developed in this paper can be used by the QoS manager to quickly determine the schedulability of dynamic applications.
Workflow Management for Multiple Sclerosis Patients: IT and Organization
Authors: Margreet B. Michel-Verkerke, Roel W. Schuring, Ton A. M. Spil
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

Patients with Multiple Sclerosis (MS) visit various healthcare providers during the course of their disease. It was suggested that IT might help to orchestrate their care provision. We have applied the USE IT-tool to get insight in the relevant problems, solutions and constraints of the MS-care and the MS care providers both in the organizational and the information technological area. There is hardly a chain of healthcare, but rather, a network in which informal communication plays an important role. This informal network worked reasonably effective, but inefficient and slow. The patient himself plays a key-role in information exchange between care-providers. Many providers were unaware of the services that other healthcare providers could give in general or did provide to a specific patient. MS patients-count is onlysmall for most care providers. None of the interviewed patients mentioned a lack of contacts between care-providers as a problem. They thought that lack of experience caused their major problems: insufficient and inadequate care. To improve care, we proposed a solution that combines a "short MS-protocol", the introduction of a central coordinator of care and aPatient Relation Management (PRM) System. This is a simple web-based application that is based on agreement by the caregivers that supports routing, tracking and tracing of a MS patient and supplies the care-givers with professional guidelines, as written down in the protocol. It is likely that we would have suggested a far more complicated ICT solution if wehad only analyzed the MS-care process as such, without specific consideration of the USE ITdimensions.
Process/Thread Migration and Checkpointing in Heterogeneous Distributed Systems
Authors: Hai Jiang, Vipin Chaudhary
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Process/thread migration and checkpointing are indispensable for resource sharing, cycle stealing, and other modes of interaction. To provide a flexible, transparent, and portable solution in heterogeneous environments, we have developed a multi-grained migration/checkpointing package, MigThread, which can migrate/checkpoint multiple threads to different machines or file systems simultaneously, and also perform single coarse-grained process migration/checkpointing. For scalability and portability, computation states are extracted out of their original places and abstracted to the language level. With the user-levelstack/heap management, MigThread does not rely on any thread libraries and operating systems. For heterogeneity, a novel data conversion scheme is proposed to analyze data types automatically and convert data only on the receiver side. For safety, MigThread detects and overcomes "unsafe" factors to qualify virtually all C programs for migration/checkpointing. Some performance measurements are given to illustrate its effectiveness.