A mesh-based automatic in-betweening algorithm in computer-assisted animation

The automatic in-betweening technology is one of the most important technologies in computer-assisted animation. The preprocessing of inconsistency of the topological structure between the start and the end key frames is time-consuming in the traditional in-betweening algorithm. Therefore, in order to guarantee the consistency of the topology structure between the start and the end key frames, we present in this paper a new mesh-based automatic in-betweening algorithm for the key frame animation. By meshing a three-dimensional object, all the infinite and disorderly points on the surface of an object can be converted into finite and ordinal points according to some principles of each layer and between layers, and then a series of in-betweens can be automatically generated in terms of an interpolation function. The algorithm in this paper presents a solution to the corresponding principles of the vertices on each layer and between layers after meshing the start and the end key frames. The experimental results demonstrate that the animation generated based on this method is smooth, natural, and fluent. In application, our algorithm can improve the efficiency of animation production as well as greatly reducing the cost.     

Program tools for algorithm animation

This paper proposes graphics primitives for constructing programs for algorithm animation. Our experiments show that these primitives can reduce program development time. Future directions of the current research is also discussed.     

A method to evaluate quality of modelling languages based on the Zachman reference taxonomy

Software Quality Journal - The model-driven engineering (MDE) paradigm promotes the use of conceptual models in information systems (IS) engineering and research. As engineering products,...     

An algorithm for natural mode animation

This paper describes an IBM-compatible microcomputer-based algorithm, written in Turbo C, for the animation of three-dimensional wire-frame finite element structure models on a variety of graphics devices. Since the Disk Operating System's memory addressing limitation of 640 kilobytes (KB) for a given program exists, the algorithm is implemented with a two-image animation scheme with each image stored as a portion of the entire screen in four memory buffers. The user may observe animated natural modes in elevation, plan, cross-section, and isometric views with an adjustable time delay between frame switching. As an example, the resulting algorithm is utilized to display natural modes of the Luling cable-stayed bridge. Discussions are made on the effect of different graphics devices on the animation process with regards to resolution, color versus black and white, memory requirements, and runtime flicker. The algorithm has proved reliable and efficient in its use, and above all, a great tool for engineers to quickly ascertain modal characteristics of complex structure configurations.     

Color and sound in algorithm animation

The techniques developed by M. M. Brown and R. Sedgewick (1985) in using the Balsa algorithm-animation system are reviewed. Techniques that focus on color and sound, areas just opening up in workstation-based interactive algorithm-animation systems, are described. Color is used for encoding the state of data structures, highlighting activity, trying multiple views together, emphasizing patterns, and making an algorithm's history visible in a single static image. Sound is used for reinforcing visuals, conveying patterns, replacing visuals, and signaling exceptional conditions. The techniques are based on work done with the Zeus algorithm-animation system. Six screen dumps from six different algorithm animations that are representative of the was Zeus was used are presented     

Integrating algorithm animation into a learning environment

Algorithm animation would seem to be a useful tool for teaching algorithms. However, previous empirical studies of using algorithm animation have produced mixed results. This paper presents an empirical study in which the subjects programmed the algorithm which they had seen animated. The results of the experiment indicate that combining the animation with the implementation of the algorithm was an effective way to teach the animation, and also produced transfer effects for general recursion problems.     

An NC algorithm for recognizing tree adjoining languages

A parallel algorithm is presented for recognizing the class of languages generated by tree adjoining grammars, a tree rewriting system which has applications in natural language processing. This class of languages is known to properly include all context-free languages; for example, the noncontext-free sets {a ⁿ b ⁿ c ⁿ } and {ww} are in this class. It is shown that the recognition problem for tree adjoining languages can be solved by a concurrent read, concurrent write parallel random-access machine (CRCW PRAM) inO(logn) time using polynomially many processors. Thus, the class of tree adjoining languages is inAC ¹ and hence inNC. This extends a previous result for context-free languages.This research was supported in part by NSF Grants IRI 92-96249, MCS 82-19116-CER, MCS 82-07294, DCR 84-10413, MCS 83-05221, ARO Grant DAA29-84-9-0027, DARPA Grant N00014-85-K-0018, and by the New Jersey Institute of Technology under Grant Nos. 421690 and 211665.     

Tango: a framework and system for algorithm animation

The role of animation in understanding and evaluating programs and developing new programs is discussed. A framework for algorithm animation, called Tango, and a system based on that framework are introduced. Related work is reviewed, and the conceptual framework on which Tango is based is examined. The implementation of the Tango system is described. The first-fit bin-packing algorithm is animated to illustrate how the path-transition paradigm simplifies algorithm animation     

A comprehensive clustering algorithm for strategic analysis of supply chain networks

Inventory management in supply chain networks involves keeping track of hundreds of items spread across multiple locations with complex interrelationships between them. However, it is not computationally feasible to consider each item individually during the decision making process. The use of clusters of items is preferred for the evaluation of these decisions. In addition, the use of groups of items provides management with more effective methods for characterizing and controlling system performance and results in cost savings such as group discounts. In this research, we introduce a comprehensive clustering methodology for supporting inventory management in supply chain networks. All product characteristics which have a significant impact on the performance of the supply chain are taken into account. The nodes in the network are split into subnodes prior to clustering to reduce the complexity. The average linkage clustering algorithm and the Calinski and Harabasz index are used to identify clusters of similar items. In addition, a set of heuristics is used to capture the relationships between items as specified in the bill of materials for the products. Examples are presented to demonstrate the effectiveness of the clustering methodology as well as the performance of the heuristics, by comparing the results obtained with the optimal solution.     

A taxonomy of standards

Objectivity, Inc., markets an engineering database management system that is an OODBMS. We are committed to the idea that standards are beneficial for all players in the industry. We have played active roles in several standardization efforts, including the CAD Framework Initiative (CFI). This proposal discusses the motivation for a standardization effort, suggests a direction for its development, discusses cooperation with other such efforts, and offers some concrete starting suggestions.     

An inclusive Conformal Geometric Algebra GPU animation interpolation and deformation algorithm

In the last years, Geometric Algebra with its Euclidean, Homogeneous and Conformal models attracts the research interest in many areas of Computer Science and Engineering and particularly in Computer Graphics as it is shown that they can produce more efficient and smooth results than other algebras. In this paper, we present an all-inclusive algorithm for real-time animation interpolation and GPU-based geometric skinning of animated, deformable virtual characters using the Conformal model of Geometric Algebra (CGA). We compare our method with standard quaternions, linear algebra matrices and dual-quaternions blending and skinning algorithms and we illustrate how our CGA-GPU inclusive skinning algorithm can provide as smooth and more efficient results as state-of-the-art previous methods. Furthermore, the elements of CGA that handle transformations (CGA motors) can support translation, rotation and dilation(uniform scaling) of joints under a single, GPU-supported mathematical framework and avoid conversion between different mathematical representations in contrast to quaternions and dual-quaternions that support only rotation and rotation–translation, respectively. Hence, our main novelty is the replacement of different types of algebras, and their in-between conversions between CPU and GPU, such as linear algebra matrices, quaternions, dual-quaternions and Euler angles for animation interpolation and skinning with a single mathematical representation, the CGA motors which can optimally handle the composition of translation, rotation and scaling joint transformations and interpolations. Employing latest CGA code generators, we provide a sample implementation of our algorithm running natively in a vertex shader program on modern GPUs for typical deformable virtual character simulations.     

A history of data-flow languages

Data-flow refers both to a language-level paradigm of computation and to a family of processor architectures based on this paradigm. This article elaborates data-flow language issues and the evolution of data-flow languages. In considering limits to the expressive power of these languages, underlying architectural issues are discussed. Although the article attempts to present a complete history of data-flow languages, it concentrates on those languages that specifically belong to this class and have been implemented for a data-flow machine. In many cases, the distinctions between issues of language semantics and machine architecture are unclear. Usually we have found that this reflects the evolution of data-flow, and the close association between language and architecture development. In some sections of the article, it may appear that there is an imbalance in the amount of detail presented when compared with other sections. This imbalance is proportional to the publications and the amount of information readily available for the topics     

综合优化神经网络算法

以多项式函数作为神经元的激活函数,结合矩阵伪逆的思想预先确定网络权值,并利用区间折半搜寻法自动优化隐层神经元数。通过对Hermit函数的仿真,充分显示了综合优化神经网络算法对函数具有较好的逼近。     

A model for BPEL-like languages

Web service is increasingly being applied in solving many universal interoperability problems. Business Process Execution Language (BPEL) is a de facto standard for specifying the behavior of business processes. It contains several interesting features, including scope-based compensation, fault handling and shared-labels for synchronization. In this paper we explore an observation-oriented model for BPEL-like languages, which can be used to study program equivalence. The execution states of a program are divided into five types: completed state, waiting state and divergent state, as well as error state and undo state. The last two states are especially for dealing with compensation and fault handling. Based on the formalized model, a set of algebraic laws is investigated, including traditional laws and BPEL featured laws. The concept of guarded choice is also introduced in this model, which can be used to support the transformation of a parallel program into the form of guarded choice. Two special scopes are introduced: canonical structure and compensation structure, which are used to eliminate undo and compensation construct from finite processes.     

A taxonomy of risk-based testing

Software testing has often to be done under severe pressure due to limited resources and a challenging time schedule facing the demand to assure the fulfillment of the software requirements. In addition, testing should unveil those software defects that harm the mission-critical functions of the software. Risk-based testing uses risk (re-)assessments to steer all phases of the test process to optimize testing efforts and limit risks of the software-based system. Due to its importance and high practical relevance, several risk-based testing approaches were proposed in academia and industry. This paper presents a taxonomy of risk-based testing providing a framework to understand, categorize, assess, and compare risk-based testing approaches to support their selection and tailoring for specific purposes. The taxonomy is aligned with the consideration of risks in all phases of the test process and consists of the top-level classes risk drivers, risk assessment, and risk-based test process. The taxonomy of risk-based testing has been developed by analyzing the work presented in available publications on risk-based testing. Afterwards, it has been applied to the work on risk-based testing presented in this special section of the International Journal on Software Tools for Technology Transfer.     

A non-learnable class of E-pattern languages

We investigate the inferrability of E-pattern languages (also known as extended or erasing pattern languages) from positive data in Gold's learning model. As the main result, our analysis yields a negative outcome for the full class of E-pattern languages—and even for the subclass of terminal-free E-pattern languages—if the corresponding terminal alphabet consists of exactly two distinct letters. Furthermore, we present a positive result for a manifest subclass of terminal-free E-pattern languages. We point out that the considered problems are closely related to fundamental questions concerning the nondeterminism of E-pattern languages.