ppxscal/embedding_network huggingface dataset:
A Deformable Template Model, with Special Reference to Elliptical Templates
Authors: Asger Hobolth, Jan Pedersen, Eva B. Vedel Jensen
Venue: Journal of Mathematical Imaging and Vision (2002)

This paper suggests a high-level continuous image model for planar star-shaped objects. Under this model, a planar object is a stochastic deformation of a star-shaped template. The residual process, describing the difference between the radius-vector function of the template and the object, is allowed to be non-stationary. Stationarity is obtained by a time change. A parametric model for the residual process is suggested and straightforward parameter estimation techniques are developed. The deformable template model makes it possible to detect pathologies as demonstrated by an analysis of a data set of cell nuclei from a benign and a malignant tumour, using stochastic deformations of ellipses.
Functional Programming with Quadtrees
Authors: F. Warren Burton, John (Yannis) G. Kollias
Venue: IEEE Software (1989)

The authors consider the user of modern functional languages, which support user-defined data types, polymorphic types and functions, pattern matching, and several kinds of modularity, as well as two important features not found in most conventional languages: lazy evaluation and higher order functions. Coroutines, modularity, and parallelism are discussed. The authors describe how a functional language provides these modern features and how to exploit its advantages. The examples are written in Miranda, the most widely used modern functional language, but the techniques can be used in almost any modern functional language. They use quadtrees because they illustrate these features and techniques nicely.
Locating stations on rapid transit lines
Authors: Gilbert Laporte, Juan A. Mesa, Francisco A. Ortega
Venue: Computers and Operations Research (2002)

When the alignment of a new line or section of a line of a rapid transit system has already been designed, the problem of locating stations arises. One of the measures used to predict the future utilization of the line is the coverage provided by the stations. In this paper the problem of locating a prefixed number of stations so that the weighted coverage will be maximized is considered. To evaluate the coverage of each station an estimation of the street network metric and the triangulations of the census tracts are used. Finally, a longest path type algorithm over an acyclic graph is devised in order to maximize the objective function, in which it was necessary to approximately determine the catchment area for each station.
Transport properties of semiconducting Rhenium silicide
Authors: L. Ivanenko, V. L. Shaposhnikov, A. B. Filonov, D. B. Migas, G. Behr, J. Schumann, H. Vinzelberg, V. E. Borisenko
Venue: Microelectronic Engineering (2002)

Transport properties of semiconducting rhenium silicide ReSi1.75 were studied both experimentally and theoretically. For this high quality ReSi1.75 single crystals were grown by the zone melting technique with radiation heating and their resistivity and Hall coefficient were investigated. The room temperature carrier concentration in undoped material is appreciably high, about 1019 cm-3. The Hall mobility at room temperature is 30 cm2/V.s, that is considerably lower than previously reported values for single crystals. P-type conductivity persists across the entire interval investigated. Calculation of the charge carrier mobility involved the carrier effective masses, which were obtained from the ab initio electronic band structure and classical scattering mechanisms. A reasonable explanation of the hole mobility behavior is proposed and a strong anisotropy in hole effective masses and mobilities is predicted.
Model-Based Codesign
Authors: Stephan Schulz, Jerzy W. Rozenblit, Michael Mrva, Klaus Buchenrieder
Venue: Computer (1998)

Hardware-software codesign has been a research topic since the beginning of this decade, but only now are structured methods emerging that focus on automating design. Unfortunately, to date most codesign approaches simply leverage performance from individual hardware and software tools, rather than enforcing a structured integration of hardware and software systems simultaneously. A few frameworks have successfully done this integration and have the potential for significant benefits, including reduced time to market, .smaller scale design, better likelihood of component reuse, and maximum use of processing power. This article describes a codesign approach that lets developers create models of a formal system representation independently of the hardware and software implementation. The authors' framework, which targets embedded systems, lets developers use simulation-based modeling to explore the feasibility of virtual prototypes and then interactively map the specification onto a software-hardware architecture.
Linked-List Visualization for Debugging
Authors: Takao Shimomura, Sadahiro Isoda
Venue: IEEE Software (1991)

Recent extensions to the VIPS debugger are described. In the original version of VIPS, visualization of linked structures was limited to very small lists or to selected portions of larger structures. The newer version of VIPS extends the original work by adding multiple levels of browsers, letting users interactively identify sublists of interest. Animation facilities support the visualization of dynamic list operations simultaneously among the various views. A preliminary evaluation shows that VIPS helps users find bugs about 30% faster using about 25% fewer debugging commands than Dbxtool, and it can display even a large linked list within about one second.
Smooth surface reconstruction from noisy range data
Authors: J. C. Carr, R. K. Beatson, B. C. McCallum, W. R. Fright, T. J. McLennan, T. J. Mitchell
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

This paper shows that scattered range data can be smoothed at low cost by fitting a Radial Basis Function (RBF) to the data and convolving with a smoothing kernel (low pass filtering). The RBF exactly describes the range data and interpolates across holes and gaps. The data is smoothed during evaluation of the RBF by simply changing the basic function. The amount of smoothing can be varied as required without having to fit a new RBF to the data. The key feature of our approach is that it avoids resampling the RBF on a fine grid or performing a numerical convolution. Furthermore, the computation required is independent of the extent of the smoothing kernel, i.e., the amount of smoothing. We show that particular smoothing kernels result in the applicability of fast numerical methods. We also discuss an alternative approach in which a discrete approximation to the smoothing kernel achieves similar results by adding new centres to the original RBF during evaluation. This approach allows arbitrary filter kernels, including anisotropic and spatially varying filters, to be applied while also using established fast evaluation methods. We illustrate both techniques with LIDAR laser scan data and noisy synthetic data.
Backbone Networks Using Rotation Counters
Authors: Jian Song, Oliver Yang
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

In this paper, we use simulations to evaluate the performance of an RCP ring network for network interconnection. The RCP (Rotation Counter Protocol) is a token ring protocol that has in its token a special field for counting down of the number of packets transmitted in one cycle. By correlating the queuing performance of each station through the counter, the delay of the high-priority data can be made almost independent and the delay jitters made small. Thus, RCP can be utilized in real-time control environment or integrated services environment.The performance of the backbone networks is investigated, using voice and data integration; the performance measures are mean voice delay, delay jitters, and mean data delay. Various buffering schemes for voice packets are compared. The effect of asymmetric data load is examined, and RCP is found to be capable of minimizing the loading effect of one station to the other.
Quality Outcomes: Determining Business Value
Authors: Pamela Simmons
Venue: IEEE Software (1996)

Discussions of software quality typically focus on the development process or the characteristics of the software product. The third level of quality - the outcome of software development - is usually neglected, although this is perhaps of greatest interest to business management. Outcome depends on how the product is used and determines the business value obtained from the development project.I conducted a study that investigated how a number of Australian organizations make their IT investment decisions. My research focused on how organizations evaluated individual projects, both at the justification stage and after implementation. I also examined how "effectiveness" was interpreted (that is, what was considered to be good business), the extent to which nonfinancial benefits influenced investment decisions, and the type of measures that were considered useful.From this work I developed a comprehensive framework of benefits and measures, and I validated the framework using the actual justifications of 25 projects. Thus, the framework provides a useful model for the analysis and measurement of the multiple dimensions of value that IT can bring to a business.
Feature extraction of volume data based on multi-scale representation
Authors: Y. Wu, E. C. Chang, Z. Huang, M. S. Kankanhalli
Venue: Proceedings of the 1st international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2003)

In this paper, we present a novel algorithm that can detect and extract salient points as features in 3-D volume datasets. This algorithm extracts not only the locations of feature points, but also finds out the scales at which the features are most significant. It applies the scale-space theory by adaptively processing the input volume in a few discrete scales. The features points, as well as their scales, detected can be used for subsequent processing, such as content-based volume data authentication and content-based volume rendering.We have implemented the algorithm and tested its effectiveness on several volume datasets. Some optimization has also been done on time-consuming intermediate steps to speed up the feature detection process.
Generating Test Data with Enhanced Context-Free Grammars
Authors: Peter M. Maurer
Venue: IEEE Software (1990)

The use of context-free grammars to improve functional testing of very-large-scale integrated circuits is described. It is shown that enhanced context-free grammars are effective tools for generating test data. The discussion covers preliminary considerations, the first tests, generating systematic tests, and testing subroutines. The author's experience using context-free grammars to generate tests for VLSI circuit simulators indicates that they are remarkably effective tools that virtually anyone can use to debug virtually any program.
High-Dimensional Similarity Joins
Authors: K. Shim, R. Srikant, R. Agrawal
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, called the $\epsilon$ tree, for fast spatial similarity joins on high-dimensional points. This index structure reduces the number of neighboring leaf nodes that are considered for the join test, as well as the traversal cost of finding appropriate branches in the internal nodes. The storage cost for internal nodes is independent of the number of dimensions. Hence, the proposed index structure scales to high-dimensional data. We analyze the cost of the join for the $\epsilon$ tree and the R-tree family, and show that the $\epsilon$ tree will perform better for high-dimensional joins. Empirical evaluation, using synthetic and real-life data sets, shows that similarity join using the $\epsilon$ tree is twice to an order of magnitude faster than the $R^+$ tree, with the performance gap increasing with the number of dimensions. We also discuss how some of the ideas of the $\epsilon$ tree can be applied to the R-tree family. These biased R-trees perform better than the corresponding traditional R-trees for high-dimensional similarity joins, but do not match the performance of the $\epsilon$ tree.
Uniqueness of 3D Pose Under Weak Perspective: A Geometrical Proof
Authors: Thomas S. Huang, Alfred M. Bruckstein, Robert J. Holt, Arun N. Netravali
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

We present a purely geometrical proof that under the weak perspective model, the 3D pose of a 3-point configuration is determined uniquely up to a reflection by its 2D projection.
An Algebraic Approach to Automatic Construction of Structural Models
Authors: H. Nishida, S. Mori
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

We present algebraic approach to the inductive learning of structural models and automatic construction of shape prototypes for character recognition on the basis of the algebraic description of curve structure proposed by Nishida and Mori (1991, 1992). A class in the structural models is a set of shapes that can be transformed continuously to each other. We consider an algebraic representation of continuous transformation of components of the shape, and give specific properties satisfied by each component in the class. The generalization rules in the inductive learning are specified from the viewpoints of continuous transformation of components and relational structure among the components. The learning procedure generalizes a pair of classes into one class incrementally and hierarchically in terms of the generalization rules. We show experimental results on handwritten numerals.
A note on getting started with FLBC: towards a user guide for FLBC
Authors: Steven Orla Kimbrough
Venue: ACM SIGGROUP Bulletin (2001)

My aim in this note is to provide a series of examples that will serve to illustrate how to symbolize English sentences in a manner concording with the theory I have been developing for an FLBC (formal language for business communication, cf. [3, 6, 8, 7, 5, 9, 4]). In that theory, which can be called the lean event semantics with disquotation (LESD) theory, first-order logic is used for (nearly) all representations. The version of FLBC being illustrated here I shall call Elementary FLBC. The presentation is example-driven. Theory is used and alluded to, but must be accessed in other writings as cited above.
Get Ready for Agile Methods, with Care
Authors: Barry Boehm
Venue: Computer (2002)

A new generation of developers cites the crushing weight of corporate bureaucracy, the rapid pace of information technology change, and the dehumanizing effects of detailed plan-driven development as cause for revolution. In their rallying cry, the Manifesto for Agile Software Development, these developers call for a revitalized approach to development that dispenses with all but the essentials. Real-world examples argue for and against agile methods. Responding to change has been cited as the critical technical success factor in the Internet browser battle between Microsoft and Netscape. But overresponding to change has been cited as the source of many software disasters, such as the $3 billion overrun of the US Federal Aviation Administration's Advanced Automation System for national air traffic control. The author believes that both agile and plan-driven approaches have a responsible center and overinterpreting radical fringes. Agile and plan-driven methods both form part of the planning spectrum. Thus, while each approach has a home ground within which it performs very well, and much better than the other, a combined approach is feasible and preferable in some circumstances.
Fault Injection
Authors: Jeffrey A. Clark, Dhiraj K. Pradhan
Venue: Computer (1995)

Fault-injection involves the deliberate insertion of faults or errors into a computer system in order to determine its response. It has proven to be an effective method for measuring the parameters of analytical dependability models, validating existing fault-tolerant systems, synthesizing new fault-tolerant designs, and observing how systems behave in the presence of faults. Growing dependence on computers in life- and cost-critical applications makes it increasingly important to understand and utilize this technique. This paper motivates the use of fault- injection and develops a taxonomy for interpreting fault-injection experiments. Background on how faults affect computer systems is provided. Results from several recent fault-injection studies are reviewed. Tools that facilitate the use of fault-injection are examined, and areas for future research are discussed.
Distributed Reset
Authors: A. Arora, M. Gouda
Venue: IEEE Transactions on Computers (1994)

A reset subsystem is designed that can be embedded in an arbitrary distributed system in order to allow the system processes to reset the system when necessary. Our design is layered, and comprises three main components: a leader election, a spanning tree construction, and a diffusing computation. Each of these components is self-stabilizing in the following sense: if the coordination between the up-processes in the system is ever lost (due to failures or repairs of processes and channels), then each component eventually reaches a state where coordination is regained. This capability makes our reset subsystem very robust: it can tolerate fail-stop failures and repairs of processes and channels, even when a reset is in progress.
An Approximate Nonmyopic Computation for Value of Information
Authors: D. Heckerman, E. Horvitz, B. Middleton
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

It is argued that decision analysts and expert-system designers have avoided the intractability of exact computation of the value of information by relying on a myopic assumption that only one additional test will be performed, even when there is an opportunity to make large number of observations. An alternative to the myopic analysis is presented. In particular, an approximate method for computing the value of information of a set of tests, which exploits the statistical properties of large samples, is given. The approximation is linear in the number of tests, in contrast with the exact computation, which is exponential in the number of tests. The approach is not as general as in a complete nonmyopic analysis, in which all possible sequences of observations are considered. In addition, the approximation is limited to specific classes of dependencies among evidence and to binary hypothesis and decision variables. Nonetheless, as demonstrated with a simple application, the approach can offer an improvement over the myopic analysis.
Parallel data intensive computing in scientific and commercial applications
Authors: Mario Cannataro, Domenico Talia, Pradip K. Srimani
Venue: Parallel Computing (2002)

Applications that explore, query, analyze, visualize, and, in general, process very large scale data sets are known as Data Intensive Applications. Large scale data intensive computing plays an increasingly important role in many scientific activities and commercial applications, whether it involves data mining of commercial transactions, experimental data analysis and visualization, or intensive simulation such as climate modeling. By combining high performance computation, very large data storage, high bandwidth access, and high-speed local and wide area networking, data intensive computing enhances the technical capabilities and usefulness of most systems. The integration of parallel and distributed computational environments will produce major improvements in performance for both computing intensive and data intensive applications in the future. The purpose of this introductory article is to provide an overview of the main issues in parallel data intensive computing in scientific and commercial applications and to encourage the reader to go into the more in-depth articles later in this special issue.
A 4-bit, 250-MIPS Processor Using Josephson Technology
Authors: Yuji Hatano, Shinichiro Yano, Hiroyuki Mori, Hiroji Yamada, Mikio Hirano, Ushio Kawabe
Venue: IEEE Micro (1990)

An experimental 4-bit Josephson processor that demonstrates the possibility of a Josephson computer system with a gigahertz clock is presented. Constructed from 2066 gates on a 5-mm*5-mm die, it implements an eight-instruction set to enable the basic operations of digital signal processing. The basic structure and operating principles of the Josephson device are reviewed, and the design of and operating results for the processor are presented. The focus is mainly on the circuit techniques required to realize a gigahertz clock in a Josephson processor. Circuit techniques to suppress the crosstalk from the AC power to the I/O lines and ways to improve the clock frequency are introduced. The problems remaining in the effort to enhance performance are discussed.
A Study of Preconditioners for Network Interior Point Methods
Authors: Joaquim J. Júdice, João Patricio, Luis F. Portugal, Mauricio G. C. Resende, Geraldo Veiga
Venue: Computational Optimization and Applications (2003)

We study and compare preconditioners available for network interior point methods. We derive upper bounds for the condition number of the preconditioned matrices used in the solution of systems of linear equations defining the algorithm search directions. The preconditioners are tested using PDNET, a state-of-the-art interior point code for the minimum cost network flow problem. A computational comparison using a set of standard problems improves the understanding of the effectiveness of preconditioners in network interior point methods.
Incorporating Illumination Constraints in Deformable Models for Shape from Shading and Light Direction Estimation
Authors: Dimitris Samaras, Dimitris Metaxas
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

>In this paper, we present a method for the integration of nonlinear holonomic constraints in deformable models and its application to the problems of shape and illuminant direction estimation from shading. Experimental results demonstrate that our method performs better than previous Shape from Shading algorithms applied to images of Lambertian objects under known illumination. It is also more general as it can be applied to non-Lambertian surfaces and it does not require knowledge of the illuminant direction. In this paper, 1) we first develop a theory for the numerically robust integration of nonlinear holonomic constraints within a deformable model framework. In this formulation, we use Lagrange multipliers and a Baumgarte stabilization approach. We also describe a fast new method for the computation of constraint based forces, in the case of high numbers of local parameters. 3) We demonstrate how any type of illumination constraint, from the simple Lambertian model to more complex highly nonlinear models can be incorporated in a deformable model framework. 4) We extend our method to work when the direction of the light source is not known. We couple our shape estimation method with a method for light estimation, in an iterative process, where improved shape estimation results in improved light estimation and vice versa. 5) We perform a series of experiments on both synthetic and real data. The synthetic data come from a standardized set of images. Our results compare favorably with results of previous SfS algorithms on the same data and our light direction estimation to a previous method by Zheng and Chellapa.