ppxscal/embedding_network huggingface dataset:
Teaching Math More Effectively, Through the Design of Calculational Proofs
Authors: David Gries, Fred B. Schneider
Venue:  (1994)

Lower-level college math courses usually avoid using formalism, in both definitions and proofs. Later, when students have mastered definitions and proofs written largely in English, they may be shown how informal reasoning could be formalized, but the impression is left that such formalization would not be worth the effort. The design of proofs is also not taught. Students see proofs and may be asked to develop a few themselves, but there is little or no discussion of principles or strategies for designing proofs. Few are happy with the results of these courses. Generally, students'' reasoning abilities are poor, even after several math courses. Many students still fear math and notation, and the development of proofs remains a mystery to most. In short, students are not being equipped with the tools needed to employ mathematics in solving new problems. We believe that this statee of affairs can be improved. This article describes our approach.
Rotational invariants in finite element formulation of three-dimensional beam theories
Authors: D. Zupan, M. Saje
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper presents a new finite element formulation of the 'geometrically exact finite-strain beam theory'. The formulation employs the generalized virtual work principle in which the main role is played by strain vectors. A set of governing equations of the beam is developed in which the only unknown functions are the strain vectors. The consistency condition that the equilibrium and the constitutive internal force and moment vectors are equal, is enforced to be satisfied at the chosen points. The accuracy and the efficiency of the derived numerical algorithm are demonstrated by several examples.
An Exception Handling Framework for N-Version Programming in Object-Oriented Systems
Authors: Alexander Romanovsky
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

An approach to introducing exception handling into object-oriented N-version programming (NVP) is proposed. General principles of structuring systems with diversity are outlined. The importance of using exceptions while applying diversely developed software is shown. Internal and external exceptions are clearly separated in our framework: each version has its own internal exceptions but the external exceptions of all versions have to be the same and identical to the interface exceptions of the diversely designed class.This scheme requires an adjudicator of a special kind to allow signaling interface exceptions when a majority of versions have signaled the same exception. These ideas are demonstrated using a general class diversity framework developed recently. An Ada implementation is outlined.
Three-Dimensional Integrated Circuits: Performance, Design Methodology, and CAD Tools
Authors: Shamik Das, Anantha Chandrakasan, Rafael Reif
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

hree-dimensional integration technologies have beenproposed in order to mitigate design challenges posed bydeep-submicron interconnect. By providing multiple layersof active devices together with high-density local interconnects between these layers,3-D technologies give digital-circuit designers greater freedom in meeting power and delay budgets that are increasingly interconnect-dominated.In this paper, we quantify the benefits 3-D integration canprovide, using specific circuit benchmarks.We perform thisanalysis using a suite of circuit design tools we have developed for 3-D integration. We observe that on average, 28%to 51% reduction in total wire length is possible over twoto five wafers respectively; similarly, 31% to 56% reduction in the length of the longest wire is achievable.We alsocharacterize the impact of technology parameters on thesereductions.
A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis
Authors: Hiroshi Konno, Jun-ya Gotoh, Takeaki Uno, Atsushi Yuki
Venue: Journal of Computational and Applied Mathematics (2002)

We will propose a new cutting plane algorithm for solving a class of semi-definite programming problems (SDP) with a small number of variables and a large number of constraints. Problems of this type appear when we try to classify a large number of multi-dimensional data into two groups by a hyper-ellipsoidal surface. Among such examples are cancer diagnosis, failure discrimination of enterprises. Also, a certain class of option pricing problems can be formulated as this type of problem. We will show that the cutting plane algorithm is much more efficient than the standard interior point algorithms for solving SDP.
Computer-aided Reliability Analysis of Fault-Tolerant Systems
Authors: S K Trivedi, B J Dugan
Venue:  (1987)

We present an overview of the major problems inherent in reliability modeling of fault-tolerant systems. The problems faced while modeling such systems include the need to consider a very large state space, non-exponential distributions, error analysis, the need to perform a combined evaluation of performance and reliability, and the need to include the details of fault/error handling behavior. Some of the proposed solutions are discussed and current tools (HARP, SAVE, DEEP and SHARPE) to facilitate evaluation of such systems are described. References are provided to many of the important techniques utilized in reliability, availability, and performance modeling of such systems.
Affective Wearables
Authors: R. W. Picard, J. Healey
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

An "affective wearable" is a wearable system equipped with sensors and tools which enables recognition of its wearer's affective patterns. Affective patterns include expressions of emotion such as a joyful smile, an angry gesture, a strained voice or a change in autonomic nervous system activity such as accelerated heart rate or increasing skin conductivity. This paper describes new applications of affective wearables, and presents a prototype which gathers physiological signals and their annotations from its wearer. Results of preliminary experiments of its performance are reported for a user wearing four different sensors and engaging in several natural activities.
Hardware architectures for public key cryptography
Authors: Lejla Batina, Siddika Berna Örs, Bart Preneel, Joos Vandewalle
Venue: Integration, the VLSI Journal (2003)

This paper presents an overview of hardware implementations for the two commonly used types of public key cryptography, i.e. RSA and elliptic curve cryptography, both based on modular arithmetic. We first discuss the mathematical background and the algorithms to implement these cryptosystems. Next an overview is given of the different hardware architectures which have been proposed in the literature.
Fast, Reliable Head Tracking under Varying Illumination: An Approach Based on Registration of Texture-Mapped 3D Models
Authors: Marco La Cascia, Stan Sclaroff, Vassilis Athitsos
Venue:  (1999)

Abstract An improved technique for 3D head tracking under varying illumination conditions is proposed. The head is modeled as a texture mapped cylinder. Tracking is formulated as an image registration problem in the cylinder''s texture map image. The resulting dynamic texture map provides a stabilized view of the face that can be used as input to many existing 2D techniques for face recognition, facial expressions analysis, lip reading, and eye tracking. To solve the registration problem in the presence of lighting variation and head motion, the residual error of registration is modeled as a linear combination of texture warping templates and orthogonal illumination templates. Fast and stable on-line tracking is achieved via regularized, weighted least squares minimization of the registration error. The regularization term tends to limit potential ambiguities that arise in the warping and illumination templates. It enables stable tracking over extended sequences. Tracking does not require a precise initial fit of the model; the system is initialized automatically using a simple 2D face detector. The only assumption is that the target is facing the camera in the first frame of the sequence. The formulation is tailored to take advantage of texture mapping hardware available in many workstations, PC''s, and game consoles. The non-optimized implementation runs at about 15 frames per second on a SGI O2 graphic workstation. Extensive experiments evaluating the effectiveness of the formulation are reported. The sensitivity of the technique to illumination, regularization parameters, errors in the initial positioning and internal camera parameters are analyzed. Examples and applications of tracking are reported.
Applied soft computing strategies for autonomous field robotics
Authors: Edward Tunstel, Ayanna Howard, Terry Huntsberger, Ashitey Trebi-Ollennu, John M. Dolan
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

This chapter addresses computing strategies designed to enable field mobile robots to execute tasks requiring effective autonomous traversal of natural outdoor terrain. The primary focus is on computer vision-based perception and autonomous control. Hard computing methods are combined with applied soft computing strategies in the context of three case studies associated with real-world robotics tasks including planetary surface exploration and land survey or reconnaissance. Each case study covers strategies implemented on wheeled robot research prototypes designed for field operations.
Fast concurrent dynamic linking for an adaptive operating system
Authors: C. Cowan, T. Autrey, C. Krasic, C. Pu, J. Walpole
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

The need for customizable and application-specific operating systems has been recognized for many years. A customizable operating system is one that can adapt to some particular circumstance to gain some functional or performance benefits. Microkernels have attempted to address this problem, but suffer performance degradation due to the cost of inter-process protection barriers. Commercial operating systems that can efficiently adapt themselves to changing circumstances have failed to appear, in part due to the difficulty of providing an interface that is efficient to invoke, provides a protection barrier, and can be dynamically reconfigured. Providing such a safe, efficient, and dynamic interface in a concurrent operating system requires an effective concurrency control mechanism to prevent conflicts between system components proposing to execute specialized components, and those components responsible for dynamically replacing specialized components. We outline our basic approach to specialization of operating systems, and detail our dynamic replacement mechanism and its concurrency control features.
Modified moment estimation for the two-parameter Birnbaum--Saunders distribution
Authors: H. K. T. Ng, D. Kundu, N. Balakrishnan
Venue: Computational Statistics Data Analysis (2003)

The maximum likelihood estimators and a modification of the moment estimators of a two-parameter Birnbaum-Saunders distribution are discussed. A simple bias-reduction method is proposed to reduce the bias of the maximum likelihood estimators and the modified moment estimators. The jackknife technique is also used to reduce the bias of these estimators. Monte Carlo simulation is used to compare the performance of all these estimators. The probability coverages of confidence intervals based on inferential quantities associated with all these estimators are evaluated using Monte Carlo simulations for small, moderate and large sample sizes. Two illustrative examples and some concluding remarks are finally presented.
Multimedia web searching trends: 1997-2001
Authors: Seda Ozmutlu, Amanda Spink, Huseyin C. Ozmutlu
Venue: Information Processing and Management: an International Journal (2003)

Multimedia is proliferating on Web sites, as the Web continues to enhance the integration of multimedia and textual information. In this paper we examine trends in multimedia Web searching by Excite users from 1997 to 2001. Results from an analysis of 1,025,910 Excite queries from 2001 are compared to similar Excite datasets from 1997 to 1999. Findings include: (1) queries per multimedia session have decreased since 1997 as a proportion of general queries due to the introduction of multimedia buttons near the query box, (2) multimedia queries identified are longer than non-multimedia queries, and (3) audio queries are more prevalent than image or video queries in identified multimedia queries. Overall, we see multimedia Web searching undergoing major changes as Web content and searching evolves.
Integration of Machine Learning and Knowledge Acquisition with a Generic Algorithm
Authors: Vladimir Estivill-Castro
Venue:  (1996)

Inductive inference techniques are showing signs of maturity as applications with real-world data are emerging. Techniques that allow symbolic representation of the acquired knowledge allow for its validation, revision and understanding by human experts. EFOPREL v. 1.1 (Evolutionary First Order PREdicate Logic) is an inductive and supervised learning system of first order predicate logic rules using a genetic algorithm for searching the space of theories explaining the set of examples. EFOPREL contributes to computer assisted knowledge acquisition because it not only allows discovery of flexible and/or alternative rules from examples, but it is intended to be used interactively with human experts.
Programming Microsoft.NET XML Web Services
Authors: Dan Maharry, Chris Ullman
Venue:  (2003)

This book breaks new ground by providing a hands-on exploration of XML Web services to help programmers design, build, and consume best-of-breed Web services.
How Understanding and Restructuring Differ from Compiling " A Rewriting Perspective
Authors: Paul Klint
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Syntactic and semantic analysis are established topics in the area of compiler construction. Their application to the understanding and restructuring of large software systems reveals, however, that they have various shortcomings that need to be addressed. In this paper, we study these shortcomings and propose several solutions. First, grammar recovery and grammar composition are discussed as well as the symbiosis of lexical syntax and context-free syntax. Next, it is shown how a relational calculus can be defined by way of term rewriting and how a fusion of term rewriting and this relational calculus can be obtained to provide semantics-directed querying and restructuring. Finally, we discuss how the distance between concrete syntax and abstract syntax can be minimized for the benefit of restructuring. In particular, we pay attention to origin tracking, a systematic technique to maintain a mapping between the output and the input of the rewriting process. Along the way, opportunities for further research will be indicated.
Dynamic Behaviour of the Distributed Tree Quorum Algorithm
Authors: Nedal Kafri, Jan Janecek
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Mechanisms that ensure mutual access, replication and resilience to failures in large distributed systems can be based on quorum consensus. Effectiveness and scalability of themethod selected are crucial. The aim of this paper is to present a message/time cost analysis of a distributed algorithm based on the tree quorum, which needs no global information, and has message complexity independent of the load. Results obtained for the different identifications of the requests (a requester's identification, timestamp, and group priority) illustrate the flexibility of the method. The algorithm supports priority, the feature important for current middleware technologies.
Improving Visual Impact Analysis
Authors: Matthew Hutchins, Keith Gallagher
Venue: Proceedings of the International Conference on Software Maintenance (1998)

Visual impact analysis is a software visualisation technique that lets software maintainers judge the impact of proposed changes and plan maintenance accordingly. An existing CASE tool uses a directed acyclic graph display derived from decomposition slicing of a program for visual impact analysis. In this paper, we analyse the graph display and show that it is semantically ambiguous and fails to show important information. We propose requirements for an improved display based on a definition of "interference" between variables in a maintenance context. The design for a new display is presented, with a series of examples to illustrate its effectiveness. The display is focused on providing a straightforward method to analyse the impact of changes.
Collaborative Visualization: New Advances in Documenting Virtual Reality with IGrams
Authors: Ellen Sandor, Janine Fron, Fernando Orellana, Dana Plepys
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

(art)n Laboratory and the Electronic Visualization Laboratory (EVL) at the University of Illinois at Chicago have collaborated on the development of the first real-time, stereoscopic hardcopy output of virtual reality applications - the ImmersaGram (IGram). The results of this new technology directly address a broad range of information visualization issues along a wide spectrum of disciplines from art, architecture, and science, to medicine, engineering and education.
Management of a Secure WWW-Based Document Store
Authors: Michael Tschichholz, Michael Höft, Mehran Roshandel, Michael Gehrke
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

This paper describes the design of a manageable WWW based secure multimedia document store. This store consist of two main components, one offering the core service functionality and the other providing the management. Only the seamless integration of those components in conjunction with its security features into a comprehensive multimedia teleservice will offer the opportunity to use it in the currently evolving pan-European "Open Service Market". The design approach discussed in this document is based on ODP concepts, covering an enterprise model, an initial computational model and a technology model. The focus of this paper will be on the service session model, the CORBA and Java based management system and the security architecture.
Architecture, Memory and Interface Technology Integration of an Industrial/Academic Configurable System-on-Chip (CSoC)
Authors: Jürgen Becker, Martin Vorbach
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

This paper describes the actual status and results of a dynamically Configurable System-on-Chip (CSoC) integration, consisting of a SPARC-compatible LEON processor-core, a commercial coarse-grain XPP-array of suitable sizefrom PACT XPP Technologies AG, and application-tailoredglobal/local memory topology with efficient Amba-basedcommunication interfaces. The given adaptive architectureis synthesized within an industrial/academic SoC projectonto 0.18 and 0.13 mm UMC CMOS technologies at Universitaet Karlsruhe (TH). Due to exponential increasing CMOSmask costs, essential aspects for the industry are now adaptivity of SoCs, which can be realized by integrating reconfigurable re-usable hardware parts on differentgranularities into Configurable Systems-on-Chip (CSoCs).
Hypercomplex Society
Authors: Lars Qvortrup
Venue:  (2002)

:Should today's society be termed an "information" or a "network" society? This book provides an alternative choice - the hypercomplex society, which is a critical, complex-theoretical understanding of society whose growing level of social complexity represents the basic challenge of our current society. This original understanding of society is presented through a historical analysis of the emergence of the current state of hypercomplexity and polycentrism. The functioning of communication, mass media, and the public sphere in the hypercomplex society is also analyzed and the Internet is characterized as a communication infrastructure particularly shaped by the hypercomplex society. The book concludes with a cultural self-observation of the hypercomplex society.
Merging Partitioned Databases
Authors: David D. Wright, Dale Skeen
Venue:  (1983)

Partitioning of a distributed data base requires either that update activity be restricted or that a strategy for conflict resolution and partition merging be used once communication is restored. The graph-theoretic approach used by Davidson follows the latter approach and can be used to show that finding an optimum solution to the general problem is NP-complete. We give several methods of reducing the size of the graphs involved. Two open subproblems are shown to be NP-complete, while an extension of a known polynomial-time subproblem is given. Simulation results are used to study both the amount of compression achieved by the graph reduction techniques and their effects on heuristics for the problem. In addition, some modifications are made to existing heuristics to improve their performance. A probabilistic model is presented and compared with the simulations.
Trace Averaging Domain Decomposition Method with Nonconforming Finite Elements
Authors: Jin Gu, Zian Hu
Venue:  (1995)

We consider, in this paper, the trace averaging domain decomposition method for the second order self-adjoint elliptic problems discretized by a class of nonconforming finite elements, which is only continuous at the nodes of the quasi-uniform mesh. We show its geometric convergence and present the dependence of the convergence factor on the relaxation factor, the subdomain diameter H and the mesh parameter h. In essence, this method is equivalent to the simple iterative method for the preconditioned capacitance equation. The preconditioner implied in this iteration is easily invertible and can be applied to preconditioning the capacitance matrix with the condition number no more than O((1+ln H/h)max(1+H^-2, 1+lnH/h)).
The neglected battle fields of syntax errors
Authors: Sarah K. Kummerfeld, Judy Kay
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

Syntax error correction is an essential part of the debugging process. Yet there has been little research investigating how programmers approach syntax error correction and how to help beginner programmers learn to fix errors efficiently. This paper describes development and evaluation of a tool to support students learning how to correct syntax errors.We collected both quantitative and qualitative data for a small but varied group of students as they corrected syntax errors. This showed that even the more experienced students took significant time to correct some syntax errors. It also indicated that general and language specific programming experience provides both strategic skill in correcting errors and greater depth of understanding of the error messages themselves. At the same time, we observed that beginners can be almost as efficient as more expert users when they have access to our tool for explanations of the less intuitive compile error messages.