ppxscal/embedding_network huggingface dataset:
3-D/4-D Registration of Artificial Knee Implants with Predicting Dynamic Knee Kinematics
Authors: Toshihiko Tomosada, Syoji Kobashi, Nao Shibanuma, Katsuya Kondo, Motoi Yamaguchi, Hirotugu Muratsu, Yutaka Hata, Shinichi Yoshiya, Masahiro Kurosaka
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

X-ray fluoroscopic images are widely used for evaluating the knee kinematics after the total knee Arthroplasty, TKA in short. There are some conventional methods for estimating the motion of the knee implant in vivo using single-plane fluoroscopic images and 3-D geometric models of the knee implant. However, these methods have a problem that estimation results are dependent on the initial pose and position given at the start frame of sequence for analysis because these methods analyze the motion of a series of the knee implant for every frame based on the pose and position estimated at the previous frame. This paper proposes a 3-D/4-D registration method that estimates the initial pose and position by predicting dynamic knee kinematics. To quantitatively evaluate our method, it was applied to computer-simulated images and phantom images that took the knee implant in vitro fixed with arbitrary pose and position by a jig. The experimental results showed that the proposed method could estimate the pose of within the error of 0.04 deg in the computer-simulated images and 0.82 deg in the phantom images, and the accuracy was improved in comparison with the conventional methods.
Time Compact High Order Difference Methods for Wave Propagation, 2D
Authors: Bertil Gustafsson, Per Wahlund
Venue: Journal of Scientific Computing (2005)

In earlier papers we have constructed difference methods that are fourth-order accurate both in space and time for wave propagation problems. The analysis and numerical experiments have been limited to one-dimensional problems. In this paper we extend the construction and the analysis to two space dimensions, and present numerical experiments for acoustic problems in discontinuous media.
Fuzzy filters of MTL-algebras
Authors: Young Bae Jun, Yang Xu, Xiao Hong Zhang
Venue: Information Sciences: an International Journal (2005)

Characterizations of fuzzy filters in MTL-algebras are given. The fuzzy filter generated by a fuzzy set is considered. The notion of Boolean fuzzy filters and MV-fuzzy filters are introduced and related properties are investigated. A condition for a fuzzy filter to be Boolean is provided. A characterization of a Boolean fuzzy filter is given. A congruence relation on a MTL-algebra induced by a fuzzy filter is established, and we show that the set of all congruence relations induced by a fuzzy filter is a completely distributive lattice.
Ada and the control of intrusion
Authors: Gertrude Levine
Venue: ACM SIGAda Ada Letters (2005)

One of the strengths of the Ada Programming Language is its support of software engineering principles. In particular, many Ada constructs assist in the control of various anomalies of computer systems. This paper discusses two classes of anomalies that are shown to have similar characteristics. The first of these classes involves the mutual exclusion problem, for which there exists considerable literature within the Ada community. We compare this category of anomalies to intrusion, a security anomaly, and suggest that mechanisms for the control of the first should be considered for the second.
Existence Results for Primal and Dual Generalized Vector Equilibrium Problems With Applications to Generalized Semi-Infinite Programming
Authors: Lai-Jiu Lin
Venue: Journal of Global Optimization (2005)

In this paper, we introduce several kinds of maximal pseudomonotonicity and establish existence theorems of maximal pseudomonotonicity. From these results we establish the existence theorems of generalized vector equilibrium problems. We establish existence theorems of generalized vector semi-infinite programming, as applications of generalized vector equilibrium problems.
Structural stability-based metrics of object-oriented design
Authors: Mahmoud Omar Elish
Venue:  (2005)

Software often undergoes necessary changes that lead to the distribution of software releases. Each software release will in general include changes of related end-user requirements, developer design and code level entities. In one scenario, end-user requirements only undergo extensions, and it is important that the design solution from earlier releases also undergoes only changes involving extensions so as to preserve the stability of the software. Preservation of such early design solutions may lead to return on investments in design for the earlier releases and less rework and maintenance on earlier design. This scenario is one of several assumed as context for the research reported. In general, each software design has three aspects: structural, behavioral, and creational, each of which may change from one software release to the next. However, this dissertation focuses on the stability of the structural aspect of object-oriented design, which refers to the extent to which the structure of the design is preserved throughout the incremental evolution of the software from one release to the next. The dissertation research contribution is a suite of structural stability-based metrics for object-oriented design. This metrics suite consists of size-based metrics and time-based metrics. Size-based metrics measure the size of the invariant and changed parts of design structure between any two successive software releases, whereas time-based metrics measure the time between these two successive releases. This metrics suite was empirically evaluated by exploring the relationships between these metrics and two important external quality attributes (outcomes) of interest to software developers that cannot be directly measured in advance: post-release defect density and release effort. The research results showed that it is possible to construct statistically significant regression models from subsets of the stability metrics as early indicators of post-release defect density and release effort. These results demonstrate the practical significance and usefulness of the metrics suite. In addition, this dissertation research investigated potential product-related and process-related indicators of object-oriented design structural stability. Product-related indicators are measures of design structural characteristics that are collected from the design at release i and then used to estimate design structural stability from release i to release i + 1 (following release). Process-related indicators are measures that are collected from maintenance activities performed on release i and then used to estimate design structural stability from release i to release i + 1. The research results showed that it is possible to construct statistically significant regression models from subsets of the investigated indicators to early estimate the value of each one of the stability metrics.
Optimal Superconvergent One Step Nodal Cubic Spline Collocation Methods
Authors: Bernard Bialecki, Graeme Fairweather, Andreas Karageorghis
Venue: SIAM Journal on Scientific Computing (2005)

We formulate new optimal (fourth) order one step nodal cubic spline collocation methods for the solution of various elliptic boundary value problems in the unit square. These methods are constructed so that the respective collocation equations can be solved using matrix decomposition algorithms (MDAs). MDAs are fast, direct methods which employ fast Fourier transforms and require O(N2 log N) operations on an $N \times N$ uniform partition of the unit square. The results of numerical experiments exhibit expected global optimal orders of convergence as well as desired superconvergence phenomena.
How to solve a Quadratic Equation
Authors: James F. Blinn
Venue: IEEE Computer Graphics and Applications (2005)

Jim Blinn discusses some problems with solving the quadratic equation and various solutions to them.
Genetic programming: parametric analysis of structure altering mutation techniques
Authors: Alan Piszcz, Terence Soule
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

We hypothesize that the relationship between parameter settings, specifically parameters controlling mutation, and performance is non-linear in genetic programs. Genetic programming environments have few means for a priori determination of appropriate parameters values. The hypothesized nonlinear behavior of genetic programming creates difficulty in selecting parameter values for many problems. In this paper we study three structure altering mutation techniques using parametric analysis on a problem with scalable complexity. We find through parameter analysis that two of the three mutation types tested exhibit nonlinear behavior. Higher mutation rates cause a larger degree of nonlinear behavior as measured by fitness and computational effort. Characterization of the mutation techniques using parametric analysis confirms the nonlinear behavior. In addition, we propose an extension to the existing parameter setting taxonomy to include commonly used structure altering mutation attributes. Finally we show that the proportion of mutations applied to internal nodes, instead of leaf nodes, has a significant effect on performance.
Towards Timbre-Driven Semantic Retrieval of Violins
Authors: Ewa Lukasik
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

The paper presents an attempt to match signal processing derived features to the higher-level (linguistic) description of timbre in order to support the timbre driven retrieval of violins. The experiments are performed on a set of 53 instruments recorded during the 10th Henryk Wieniawski International Violinmakers Competition held in Pozna.., Poland, in 2001. The results add to the recent research approach to apply computational intelligence to bridge the semantic and conceptual gap, which exists between the low level description and higher-level interpretation of multimedia. The taxonomy used for violin voices is correlated with objective attributes of entirely distinct character so that semantically disjoint categories are created, providing supportive cues for further analysis. The results should deliver new, enriching aspect to the design of methodology of inferring preference models from the objective characteristics of digital media.
Facilitating the Construction of Specification Pattern-based Properties
Authors: Sascha Konrad, Betty H. C. Cheng
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Formal specification languages are often perceived as difficult to use by practitioners, and are therefore rarely used in industrial software development practices. Numerous researchers have developed specification pattern systems to facilitate the construction of formal specifications of system properties. Feedback indicates that these patterns are considered helpful, but many practitioners prefer capturing properties using informal notations, such as natural language, instead of formal specification languages. This paper describes a project that addresses this technology gap. First, we introduce a stepwise process for deriving and instantiating system properties in terms of their natural language representations. The key components of this process are structured natural language grammars and specification pattern systems. Second, we describe SPIDER, a prototype implementation of a tool suite supporting this speci- fication process. We illustrate the use of our approach with a description of a stepwise construction process of property specifications of a real-world automotive embedded system using SPIDER.
Speaker Verification with Combined Threshold, Identification Front-End, and UBM
Authors: Ningping Fan, Justinian Rosca, Radu Balan
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

This paper presents a novel approach to improve accuracy performance of a speaker verification system through combination or cascading three different verification methods using an identification "frontend", a universal background model, and an individual matching score threshold. The performance of a speaker verification system can be determined in terms of false rejection rate and false acceptance rate using a standard benchmark speech corpus, which represents fixed common populations in testing voice and claimed identities. By further assuming uniform distributions, it can show analytically that the false acceptance rate of a standalone system either using the threshold or the universal background model can be significantly reduced when combined with the identification "front-end". Experiments have provided clear evidence, and even more gains to combine all three methods together. The results show 60% reduction in the false acceptance rate for combining with the identification "front-end" alone, and 80% reduction for combining all three methods without adding penalty in the false rejection rate.
Diagnosing Design Problems in Object Oriented Systems
Authors: Adrian Trifu, Radu Marinescu
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

Software decay is a phenomenon that plagues aging software systems. While in recent years, there has been significant progress in the area of automatic detection of "code smells" on one hand, and code refactorings on the other hand, we claim that existing restructuring practices are seriously hampered by their symptomatic and informal (non-repeatable) nature. This paper makes a clear distinction between structural problems and structural symptoms (also known as code smells), and presents a novel, causal approach to restructuring object oriented systems. Our approach is based on two innovations: the encapsulation of correlations of symptoms and additional contextual information into higher-level design problems, and the univocal, explicit mapping of problems to unique refactoring solutions. Due to its explicit, repeatable nature, the approach shows high potential for increased levels of automation in the restructuring process, and consequently a decrease in maintenance costs.
Virtual reality aided assembly with directional vibro-tactile feedback
Authors: Holger Regenbrecht, Joerg Hauber, Ralph Schoenfelder, Andreas Maegerlein
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

We introduce different approaches to user interface devices that provide directed tactile feedback to the user's hand. The basic idea is to enhance the user's six degrees of freedom of interaction within virtual or augmented environments by offering an additional three-dimensional tactile feedback as an immediate, directed response from the virtual world. We also describe the prototype systems TactilePointer and TACTool, which utilize vibro-motors, alarm buzzers, and piezo bend elements as actuators in combination with magnetic and optical tracking. The prototypes have been informally tested within collision sensitive virtual environments.
Data sharing between ada and C/C++
Authors: Matt Mark
Venue: ACM SIGAda Ada Letters (2005)

The En Route Automation Modernization (ERAM) program is a real-time Air Traffic Control (ATC) program being developed by Lockheed Martin Corporation. The ERAM program has high availability requirements, mission critical applications, and stringent response time requirements. The estimated size of the ERAM program is 1,300 KSLOC and includes primarily Ada, C, and C++ code. Legacy code being reused in ERAM is both Ada and C. This resulted in the need for several cross-language interfaces. Standard methods for passing binary data structures between the languages have been developed and will be discussed in this paper.
Structure characterization for system modelling in uncertain environments
Authors: J. Bens, G. C. Vansteenkiste
Venue: ACM SIGSIM Simulation Digest (1977)

Systems from uncertain environments are characterized by uncertainties as to their geometry, their field parameters and their internal characteristics; moreover, the system observations are of relatively low quality. It is shown how system modelling is not likely to be surpassed by any other method in handling such problem measurements in an adequate way and in deciding on their control.
Real-time shading
Authors: Marc Olano, Kurt Akeley, John C. Hart, Wolfgang Heidrich, Michael McCool, Jason L. Mitchell, Randi Rost
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

Real-time procedural shading was once seen as a distant dream. When the first version of this course was offered four years ago, real-time shading was possible, but only with one-of-a-kind hardware or by combining the effects of tens to hundreds of rendering passes. Today, almost every new computer comes with graphics hardware capable of interactively executing shaders of thousands to tens of thousands of instructions. This course has been redesigned to address today's real-time shading capabilities and to provide more practical information for practitioners. The morning sessions cover the more advanced technical aspects of creating a shading system. The afternoon sessions cover practical details of real-time shading use, including an overview of recently developed algorithms that run well on today's shading hardware and presentations on the latest hardware developments from several leading hardware vendors. The course concludes with the popular panel-style question and answer session, where participants can ask questions of any presenter or suggest topics of discussion.
Review of "Principles of Discrete Event Simulation, by George S. Fishman", John Wiley & Sons, 1978
Authors: Jack P. C. Kleijnen
Venue: ACM SIGSIM Simulation Digest (1983)

This is George Fishman's <u>second</u> book on discrete simulation (his first book was published by Wiley in 1973). In a nutshell, this is an excellent book; it is a must for readers interested in the methodology of stochastic simulation; it is not ideal as a first introduction to simulation (for an introduction use, for example, T. H. Naylor et al., Computer simulation techniques, Wiley, 1966).
Linear Randomized Voting Algorithm for Fault Tolerant Sensor Fusion and the Corresponding Reliability Model
Authors: Dejan Desovski, Yan Liu, Bojan Cukic
Venue: Proceedings of the Ninth IEEE International Symposium on High-Assurance Systems Engineering (2005)

Sensor failures in process control programs can be tolerated through application of well known modular redundancy schemes. The reliability of a specific modular redundancy scheme depends on the predefined number of sensors thatmay fail, f, out of the total number of sensors available, n. Some recent sensor fusion algorithms offer the benefit of tolerating a more significant number of sensor failures than modular redundancy techniques at the expense of degrading the precision of sensor readings. In this paper, we present a novel sensor fusion algorithm based on randomized voting, having linear - O(n) expected execution time. The precision (the length) of the resulting interval is dependent on the number of faulty sensors - parameter f. A novel reliability model applicable to general sensor fusion schemes is proposed. Our modeling technique assumes the coexistence of two major types of sensor failures, permanent and transient. The model offers system designers the ability to analyze and define application specific balances between the expected system reliability and the desired interval estimate precision. Under the assumptions of failure independence and exponentially distributed failure occurrences, we use Markov models to compute system reliability. The model is then validated empirically and examples of reliability prediction are provided for networks with fairly large number of sensors (n > 100).
Proof of Convergence for a Global Optimization Algorithm for Problems with Ordinary Differential Equations
Authors: Ioannis Papamichail, Claire S. Adjiman
Venue: Journal of Global Optimization (2005)

A deterministic spatial branch and bound global optimization algorithm for problems with ordinary differential equations in the constraints has been developed by Papamichail and Adjiman [A rigorous global optimization algorithm for problems with ordinary differential equations. J. Glob. Optim. 24, 1---33]. In this work, it is shown that the algorithm is guaranteed to converge to the global solution. The proof is based on showing that the selection operation is bound improving and that the bounding operation is consistent. In particular, it is shown that the convex relaxation techniques used in the algorithm for the treatment of the dynamic information ensure bound improvement and consistency are achieved.
Centering: A Parametric Theory and Its Instantiations
Authors: Massimo Poesio, Rosemary Stevenson, Barbara Di Eugenio, Janet Hitzeman
Venue: Computational Linguistics (2004)

Centering theory is the best-known framework for theorizing about local coherence and salience; however, its claims are articulated in terms of notions which are only partially specified, such as "utterance," "realization," or "ranking." A great deal of research has attempted to arrive at more detailed specifications of these parameters of the theory; as a result, the claims of centering can be instantiated in many different ways. We investigated in a systematic fashion the effect on the theory's claims of these different ways of setting the parameters. Doing this required, first of all, clarifying what the theory's claims are (one of our conclusions being that what has become known as "Constraint 1" is actually a central claim of the theory). Secondly, we had to clearly identify these parametric aspects: For example, we argue that the notion of "pronoun" used in Rule 1 should be considered a parameter. Thirdly, we had to find appropriate methods for evaluating these claims. We found that while the theory's main claim about salience and pronominalization, Rule 1&mdash;a preference for pronominalizing the backward-looking center (CB)&mdash;is verified with most instantiations, Constraint 1&ndash;a claim about (entity) coherence and CB uniqueness&mdash;is much more instantiation-dependent: It is not verified if the parameters are instantiated according to very mainstream views ("vanilla instantiation"), it holds only if indirect realization is allowed, and is violated by between 20% and 25% of utterances in our corpus even with the most favorable instantiations. We also found a trade-off between Rule 1, on the one hand, and Constraint 1 and Rule 2, on the other: Setting the parameters to minimize the violations of local coherence leads to increased violations of salience, and vice versa. Our results suggest that "entity" coherence&mdash;continuous reference to the same entities&mdash;must be supplemented at least by an account of relational coherence.
Artifacts Caused by Simplicial Subdivision
Authors: Hamish Carr, Torsten Moller
Venue: IEEE Transactions on Visualization and Computer Graphics (2006)

We review schemes for dividing cubic cells into simplices (tetrahedra) for interpolating from sampled data to {\hbox{\rlap{I}\kern 2.0pt{\hbox{R}}}}^3, present visual and geometric artifacts generated in isosurfaces and volume renderings, and discuss how these artifacts relate to the filter kernels corresponding to the subdivision schemes.