ppxscal/embedding_network huggingface dataset:
Geometric and Illumination Invariants for Object Recognition
Authors: Ronald Alferez, Yuan-Fang Wang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

We propose invariant formulations that can potentially be combined into a single system. In particular, we describe a framework for computing invariant features which are insensitive to rigid motion, affine transform, changes of parameterization and scene illumination, perspective transform, and view point change. This is unlike most current research on image invariants which concentrates on either geometric or illumination invariants exclusively. The formulations are widely applicable to many popular basis representations, such as wavelets, short-time Fourier analysis, and splines. Exploiting formulations that examine information about shape and color at different resolution levels, the new approach is neither strictly global nor local. It enables a quasi-localized, hierarchical shape analysis which is rarely found in other known invariant techniques, such as global invariants. Furthermore, it does not require estimating high-order derivatives in computing invariants (unlike local invariants), whence is more robust. We provide results of numerous experiments on both synthetic and real data to demonstrate the validity and flexibility of the proposed framework.
An optimum virtual paths network-based atm network using the genetic algorithm
Authors: Surat Tanterdtid, Worawit Steanputtanagul, Watit Benjapolakul
Venue: International Journal of Network Management (1998)

In this article, we propose the use of the Genetic Algorithm &lpar;GA&rpar; to optimize a Virtual Paths &lpar;VPs&rpar; network and describe a simple coding technique. &copy; 1998 John Wiley & Sons, Ltd.
A Multi-Frame Structure-from-Motion Algorithm under Perspective Projection
Authors: John Oliensis
Venue: International Journal of Computer Vision (1999)

We present a fast, robust algorithm for multi-frame structure from motion from point features which works for general motion and large perspective effects. The algorithm is for point features but easily extends to a direct method based on image intensities. Experiments on synthetic and real sequences show that the algorithm gives results nearly as accurate as the maximum likelihood estimate in a couple of seconds on an IRIS 10000. The results are significantly better than those of an optimal two-image estimate. When the camera projection is close to scaled orthographic, the accuracy is comparable to that of the Tomasi/Kanade algorithm, and the algorithms are comparably fast. The algorithm incorporates a quantitative theoretical analysis of the bas-relief ambiguity and exemplifies how such an analysis can be exploited to improve reconstruction. Also, we demonstrate a structure-from-motion algorithm for partially calibrated cameras, with unknown focal length varying from image to image. Unlike the projective approach, this algorithm fully exploits the partial knowledge of the calibration. It is given by a simple modification of our algorithm for calibrated sequences and is insensitive to errors in calibrating the camera center. Theoretically, we show that unknown focal-length variations strengthen the effects of the bas-relief ambiguity. This paper includes extensive experimental studies of two-frame reconstruction and the Tomasi/Kanade approach in comparison to our algorithm. We find that two-frame algorithms are surprisingly robust and accurate, despite some problems with local minima. We demonstrate experimentally that a nearly optimal two-frame reconstruction can be computed quickly, by a minimization in the motion parameters alone. Lastly, we show that a well known problem with the Tomasi/Kanade algorithm is often not a significant one.
Mechanical analysis of bone and its microarchitecture based on in vivo voxel images
Authors: D. Ulrich, B. Rietbergen, A. Laib, P. Rüegsegger
Venue: Technology and Health Care (1998)

Prevention of osteoporotic fractures requires accurate methods to detect the increase in bone fragility at an early disease stage as well as effective therapies to reduce the risk of bone fractures. Presently the prediction of the patient-specific bone fracture risk is primarily based on bone density, since this is the only parameter which can routinely be measured in vivo. However, these predictions might not always be precise because the fracture risk is also determined by the bone microarchitecture and the bones loading conditions. The aim of this paper is to introduce and evaluate new methods which could contribute to a better quantification of bone fracture risk. Recently, a new approach, combining computational engineering methods (finite element (FE) method) and 3D high-resolution imaging techniques, has been introduced which can account not only for bone density but also for microarchitecture and loading conditions. High-resolution imaging techniques allow acquisition of 3D images of the bone microarchitecture, whereas FE methods applied to these images allow very precise calculation of the mechanical properties of bone. However, such a detailed FE analysis was not feasible for bone in vivo mainly because the resolution was not sufficient to measure the bone microarchitecture. It is shown here, from preliminary results, that the FE approach based on high-resolution images from a new CT scanner now allows prediction of the mechanical behavior of peripheral bones in vivo. It is expected that, eventually, the FE approach will lead to a better patient-specific fracture risk prediction than earlier methods based on bone density alone. Hence, with this new approach, it might be possible to detect the increase in bone fragility at an early stage of osteoporosis and it might also be possible to evaluate treatments more accurately.
Mastrovito Multiplier for General Irreducible Polynomials
Authors: A. Halbutoğullari, Çetin K. Koç
Venue: IEEE Transactions on Computers (2000)

We present a new formulation of the Mastrovito multiplication matrix for the field $GF(2^m)$ generated by an arbitrary irreducible polynomial. We study in detail several specific types of irreducible polynomials, e.g., trinomials, all-one-polynomials, and equally-spaced-polynomials, and obtain the time and space complexity of these designs. Particular examples illustrating the properties of the proposed architecture are also given. The complexity results established in this paper match the best complexity results known to date. The most important new result is the space complexity of the Mastrovito multiplier for an equally-spaced-polynomial, which is found as $(m^2 - \Delta)$ XOR gates and $m^2$ AND gates, where $\Delta$ is the spacing factor.
A Simple Derivation of a Result in Electrostatics
Authors: Eduardo Sánchez-Velasco
Venue: SIAM Review (1998)

We present a simple derivation of the following result in electrostatics. The value of the electric field at the center of a sphere with no charge inside equals three times the average over the surface of the sphere of the radial part of the electric field.
Nomadic radio: scaleable and contextual notification for wearable audio messaging
Authors: Nitin Sawhney, Chris Schmandt
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Mobile workers need seamless access to communication and information services on portable devices. However current solutions overwhelm users with intrusive and ambiguous notifications. In this paper, we describe scaleable auditory techniques and a contextual notification model for providing timely information, while minimizing interruptions. Users actions influence local adaptation in the model. These techniques are demonstrated in Nomadic Radio, an audio-only wearable computing platform.
Lecturelets: web based Java enabled lectures
Authors: Fintan Culwin
Venue: ACM SIGCSE Bulletin (2000)

The traditional lecture has, for a long time, been subject to significant criticisms regarding its learning effectiveness. Despite this it remains popular and several attempts have been made to transport aspects of its format to the Web. Many of these projects appear to have been ill informed and, like many pedagogic uses of the Web, under evaluated. This paper describes the design, implementation and deployment of lecturelets, small low-cost Web hosted lecture like presentations. One design intention was to include effective support for their evaluation and the mechanisms and intentions for this are described.
High-Level Test Synthesis for Behavioral and Structural Designs
Authors: Christos A. Papachristou, Mikhail Baklashov, Kowen Lai
Venue: Journal of Electronic Testing: Theory and Applications (1998)

High-Level Test Synthesis (HLTS), a term introduced in recent years, promises automatic enhancement of testability of a circuit. In this paper we will show how HLTS can achieve higher testability for BIST-oriented test methodologies. Our results show considering testability during high-level synthesis, better testability can be obtained when compared to DFT at low level. Transformation for testability, which allows behavioral modification for testability, is a very powerful HLTS technique.
Greenstone: a comprehensive open-source digital library software system
Authors: Ian H. Witten, Stefan J. Boddie, David Bainbridge, Rodger J. McNab
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

This paper describes the Greenstone digital library software, a comprehensive, open-source system for the construction and presentation of information collections. Collections built with Greenstone offer effective full-text searching and metadata-based browsing facilities that are attractive and easy to use. Moreover, they are easily maintainable and can be augmented and rebuilt entirely automatically. The system is extensible: software "plugins" accommodate different document and metadata types.
LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes
Authors: Witold Litwin, Thomas Schwarz
Venue: ACM SIGMOD Record (2000)

LH*RS is a new high-availability Scalable Distributed Data Structure (SDDS). The data storage scheme and the search performance of LH*RS are basically these of LH*. LH*RS manages in addition the parity information to tolerate the unavailability of k &gne; 1 server sites. The value of k scales with the file, to prevent the reliability decline. The parity calculus uses the Reed -Solomon Codes. The storage and access performance overheads to provide the high-availability are about the smallest possible. The scheme should prove attractive to data-intensive applications.
Java I/O
Authors: Elliotte Rusty Harold
Venue:  (1999)

All of Java's Input/Output (I/O) facilities are based on streams, which provide simple ways to read and write data of different types. Java provides many different kinds of streams, each with its own application. The universe of streams is divided into four large categories: input streams and output streams, for reading and writing binary data; and readers and writers, for reading and writing textual (character) data. You're almost certainly familiar with the basic kinds of streams--but did you know that there's a CipherInputStream for reading encrypted data? And a ZipOutputStream for automatically compressing data? Do you know how to use buffered streams effectively to make your I/O operations more efficient? Java I/O tells you all you ever need to know about streams--and probably more. A discussion of I/O wouldn't be complete without treatment of character sets and formatting. Java supports the UNICODE standard, which provides definitions for the character sets of most written languages. Consequently, Java is the first programming language that lets you do I/O in virtually any language. Java also provides a sophisticated model for formatting textual and numeric data. Java I/O shows you how to control number formatting, use characters aside from the standard (but outdated) ASCII character set, and get a head start on writing truly multilingual software. Java I/O includes: Coverage of all I/O classes and related classesIn-depth coverage of Java's number formatting facilities and its support for International character sets
A Multigrid Preconditioned Newton--Krylov Method
Authors: D. A. Knoll, W. J. Rider
Venue: SIAM Journal on Scientific Computing (1999)

We study multigrid preconditioning of matrix-free Newton--Krylov methods as a means of developing more efficient nonlinear iterative methods for large scale simulation. Newton--Krylov methods have proven dependable in solving nonlinear systems while not requiring the explicit formation or storage of the complete Jacobian. However, the standard algorithmic scaling of Krylov methods is nonoptimal, with increasing linear system dimension. This motivates our use of multigrid-based preconditioning. It is demonstrated that a simple multigrid-based preconditioner can effectively limit the growth of Krylov iterations as the dimension of the linear system is increased. Different performance aspects of the proposed algorithm are investigated on three nonlinear, nonsymmetric, boundary value problems. Our goal is to develop a hybrid methodology which has Newton--Krylov nonlinear convergence properties and multigrid-like linear convergence scaling for large scale simulation.
Connected Domination and Spanning Trees with Many Leaves
Authors: Yair Caro, Douglas B. West, Raphael Yuster
Venue: SIAM Journal on Discrete Mathematics (2000)

Let G=(V,E) be a connected graph. A connected dominating set $S \subset V$ is a dominating set that induces a connected subgraph of G. The connected domination number of G, denoted $\gamma_c(G)$, is the minimum cardinality of a connected dominating set. Alternatively, $|V|-\gamma_c(G)$ is the maximum number of leaves in a spanning tree of $G$. Let $\delta$ denote the minimum degree of G. We prove that $\gamma_c(G) \leq |V| \frac{\ln(\delta+1)}{\delta+1}(1+o_\delta(1))$. Two algorithms that construct a set this good are presented. One is a sequential polynomial time algorithm, while the other is a randomized parallel algorithm in RNC.
Exploiting model independence for parallel PCS network simulation
Authors: Azzedine Boukerche, Sajal K. Das, Alessandro Fabbri, Oktay Yildiz
Venue: Proceedings of the thirteenth workshop on Parallel and distributed simulation (1999)

In this paper, we present a parallel simulator (SWiMNet) for PCS networks using a combination of optimistic and conservative paradigms. The proposed methodology exploits event precomputation permitted by model independence within the PCS components. The low percentage of blocked calls is exploited in the channel allocation simulation of precomputed events by means of an optimistic approach. %To illustrate and verify the developed approach, Experiments were conducted with various call arrival rates and mobile host densities on a cluster of Pentium workstations. Performance results indicate that the SWiMNet achieves a speedup of 6 employing 8 workstations, and a speedup of 12 with 16 workstations.
Pruned Feed-forward Networks for Efficient Implementation ofMultiple FIR Filters with Arbitrary Frequency Responses
Authors: Ki-Hwan Ahn, Yoon Kyung Choi, Soo-Young Lee
Venue: Neural Processing Letters (1998)

A new algorithm is presented for efficient implementation of multiple FIR filters in real-time applications. We introduce an analogy between the multiple FIR filters and linear feed-forward networks, and show how the FIR filters with any frequency characteristics may be designed by a learning algorithm of the network with proper choice of training patterns. Starting from a fully-connected feed-forward architecture, more efficient network architectures may be obtainable by pruning connection weights with minor contributions. For demonstration we design feed-forward networks for 16 bandpass cochlear filters with much less connection weights and moderate performance degradation.
Analysis of Integrated Healthcare Networks' Performance: A Contingency-Strategic Management Perspective
Authors: Blossom Y. J. Lin, Thomas T. H. Wan
Venue: Journal of Medical Systems (1999)

Few empirical analyses have been done in the organizational researches of integrated healthcare networks (IHNs) or integrated healthcare delivery systems. Using a contingency derived context-process-performance model, this study attempts to explore the relationships among an IHN's strategic direction, structural design, and performance. A cross-sectional analysis of 100 IHNs suggests that certain contextual factors such as market competition and network age and tax status have statistically significant effects on the implementation of an IHN's service differentiation strategy, which addresses coordination and control in the market. An IHN's service differentiation strategy is positively related to its integrated structural design, which is characterized as integration of administration, patient care, and information system across different settings. However, no evidence supports that the development of integrated structural design may benefit an IHN's performance in terms of clinical efficiency and financial viability.
Sympathetic interfaces: using a plush toy to direct synthetic characters
Authors: Michael Patrick Johnson, Andrew Wilson, Bruce Blumberg, Christopher Kline, Aaron Bobick
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

We introduce the concept of a sympathetic inter$ace for controlling an animated synthetic character in a 3D virtual environment. A plush doll embedded with wireless sensors is used to manipulate the virtual character in an iconic and intentional manner. The interface extends from the novel physical input device through interpretation of sensor data to the behavioral brain of the virtual character. We discuss the design of the interface and focus on its latest instantiation in the Swamped! exhibit at SIGGRAPH 98. We also present what we learned from hundreds of casual users, who ranged from young children to adults.
Direct combination
Authors: Simon Holland, Daniel Oppenheim
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

This paper reports on Direct Combination, a new user interaction technique. Direct Combination may be viewed variously as: a systematic extension to Direct Manipulation; a concise navigational framework to help users find the operations they need; and as a framework to make a greater range and variety of operations available to the user, without overburdening user or interface designer. While Direct Combination may be seen as an extension of Direct Manipulation, it may also be applied to a wide range of user interaction styles, including even command line interfaces. Examples from various hypothetical systems and from an implemented system are presented. This paper argues that Direct Combination is applicable not just to problem seeking or design oriented domains (where the technique originated) but is generally applicable. A variety of new interaction styles for Direct Combination are presented. The generalisation of Direct Combination to the n-dimensional case is presented.
Parallel Multiplication Using Fast Sorting Networks
Authors: Paul D. Fiore
Venue: IEEE Transactions on Computers (1999)

A recent paper describes the use of Svoboda's binary counter in the construction of fast parallel multipliers. The resulting approach was shown to be faster than the conventional Dadda multiplier when the wordlength $N$ was small. Unfortunately, the growth in the number of gates of that method was $O(N^3)$ and the speed was $O(N)$. In this paper, Batcher's bitonic sorting network and other efficient networks replace the Svoboda counter. The asymptotic growth rate in gates of these new methods is $O(N^2 \log^2 N )$, and the speed is $O(\log^2 N)$.
The Fractional Wave Packet Transform
Authors: Ying Huang, Bruce Suter
Venue: Multidimensional Systems and Signal Processing (1998)

We introduce the concept of the Fractional Wave Packet Transform(FRWPT), based on the idea of the Fractional Fourier Transform(FRFT) and Wave Packet Transform(WPT). We show a version of the resolution of the identity and some properties of FRWPT connected with those of FRFT and WPT.
Eye-hand co-ordination with force feedback
Authors: Roland Arsenault, Colin Ware
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

The term Eye-hand co-ordination refers to hand movements controlled with visual feedback and reinforced by hand contact with objects. A correct perspective view of a virtual environment enables normal eye-hand co-ordination skills to be applied. But is it necessary for rapid interaction with 3D objects? A study of rapid hand movements is reported using an apparatus designed so that the user can touch a virtual object in the same place where he or she sees it. A Fitts tapping task is used to assess the effect of both contact with virtual objects and real-time update of the centre of perspective based on the user's actual eye position. A Polhemus tracker is used to measure the user's head position and from this estimate their eye position. In half of the conditions, head tracked perspective is employed so that visual feedback is accurate while in the other half a fixed eye-position is assumed. A Phantom force feedback device is used to make it possible to touch the targets in selected conditions. Subjects were required to change their viewing position periodically to assess the importance of correct perspective and of touching the targets in maintaining eye-hand co-ordination, The results show that accurate perspective improves performance by an average of 9% and contact improves it a further 12%. A more detailed analysis shows the advantages of head tracking to be greater for whole arm movements in comparison with movements from the elbow.
A goal-driven auto-configuration tool for the distributed workflow management system mentorlite
Authors: Michael Gillmann, Jeanine Weissenfels, German Shegalov, Wolfgang Wonner, Gerhard Weikum
Venue: ACM SIGMOD Record (2000)

The Mentor-lite prototype has been developed within the research project &ldquo;Architecture, Configuration, and Administration of Large Workflow Management Systems&rdquo; funded by the German Science Foundation (DFG). It has evolved from its predecessor Mentor [1], but aims at a simpler architecture. The main goal of Mentor-lite has been to build a light-weight, extensible, and tailorable workflow management system (WFMS) with small footprint and easy-to-use administration capabilities. Our approach is to provide only kernel functionality inside the workflow engine, and consider system components like history management and worklist management as extensions on top of the kernel. The key point to retain the light-weight nature is that these extensions are implemented as workflows themselves.The workflow specifications are interpreted at runtime, which is a crucial prerequisite for flexible exception handling and dynamic modifications during runtime. The interpreter performs a stepwise execution of the workflow specification according to its formal semantics. For each step, the activities to be performed by the step are determined and started.Mentor-lite supports a protocol for distributed execution of workflows spread across multiple workflow engines. This support is crucial for workflows that span large, decentralized enterprises with largely autonomous organizational units or even cross multiple enterprises to form so-called &ldquo;virtual enterprises&rdquo;. A communication manager is responsible for sending and receiving synchronization messages between the engines. In order to guarantee a consistent global state even in the presence of site or network failures, we have built reliable message queues using the CORBA Object Transaction Services.For administration, Mentor-lite provides a Java-based workbench for workflow design, workflow partitioning across multiple workflow servers, and a Java-based runtime monitoring tool.