Using hybrid knowledge engineering and image processing in color virtual restoration of ancient murals

IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 5, pp. 1338-1343, 2003.

A critical examination of node-similarity based graph matching algorithms

In this paper, we shall critically examine a special class of graph matching algorithms that follow the approach of node-similarity measurement. A high-level algorithm framework, namely node-similarity graph matching framework (NSGM framework), is proposed, from which, many existing graph matching algorithms can be subsumed, including the eigen-decomposition method of Umeyama, the polynomial-transformation method of Almohamad, the hubs and authorities method of Kleinberg, and the kronecker product successive projection methods of Wyk, etc. In addition, improved algorithms can be developed from the NSGM framework with respects to the corresponding results in graph theory. As the observation, it is pointed out that, in general, any algorithm which can be subsumed from NSGM framework fails to work well for graphs with non-trivial auto-isomorphism structure.

Numerical solutions of certain nonlinear models in European options on a distributed computing environment

Financial modelling in the area of option pricing involves the understanding of the correlations between asset and movements of buy/sell in order to reduce risk in investment. Such activities depend on financial analysis tools being available to the trader with which he can make rapid and systematic evaluation of buy/sell contracts. In turn, analysis tools rely on fast numerical algorithms for the solution of financial mathematical models. There are many different financial activities apart from shares buy/sell activities. The main aim of this chapter is to discuss a distributed algorithm for the numerical solution of a European option. Both linear and non-linear cases are considered. The algorithm is based on the concept of the Laplace transform and its numerical inverse. The scalability of the algorithm is examined. Numerical tests are used to demonstrate the effectiveness of the algorithm for financial analysis. Time dependent functions for volatility and interest rates are also discussed. Applications of the algorithm to non-linear Black-Scholes equation where the volatility and the interest rate are functions of the option value are included. Some qualitative results of the convergence behaviour of the algorithm is examined. This chapter also examines the various computational issues of the Laplace transformation method in terms of distributed computing. The idea of using a two-level temporal mesh in order to achieve distributed computation along the temporal axis is introduced. Finally, the chapter ends with some conclusions.

Electron-impact excitation of Ar 2+

Context: Emission from Ar III is seen in planetary nebulae, in H II regions, and from laboratory plasmas. The analysis of such spectra requires accurate electron impact excitation data. Aims: The aim of this work is to improve the electron impact excitation data available for Ar2+, for application in studies of planetary nebulae and laboratory plasma spectra. The effects of the new data on diagnostic line ratios are also studied. Methods: Electron-impact excitation collision strengths have been calculated using the R-Matrix Intermediate-Coupling Frame-Transformation method and the R-Matrix Breit-Pauli method. Excitation cross sections are calculated between all levels of the configurations 3s^23p^4, 3s3p^5, 3p^6, 3p^53d, and 3s^23p^3nl (3d ≤ nl ≤ 5s). Maxwellian effective collision strengths are generated from the collision strength data. Results: Good agreement is found in the collision strengths calculated using the two R-Matrix methods. The collision strengths are compared with literature values for transitions within the 3s^23p4 configuration. The new data has a small effect on Te values obtained from the I(λ7135 Å+ λ7751 Å)/ I(λ5192 Å) line ratio, and a larger effect on the Ne values obtained from the I(λ7135 Å)/I(λ9 μm) line ratio. The final effective collision strength data is archived online.

Die aeroelastische Stabilitätsanalyse – ein praxisnaher Ansatz zur intervalltheoretischen Betrachtung von Modellierungsunsicherheiten am Flugzeug

Die Untersuchung des dynamischen aeroelastischen Stabilitätsverhaltens von Flugzeugen erfordert sehr komplexe Rechenmodelle, welche die wesentlichen elastomechanischen und instationären aerodynamischen Eigenschaften der Konstruktion wiedergeben sollen. Bei der Modellbildung müssen einerseits Vereinfachungen und Idealisierungen im Rahmen der Anwendung der Finite Elemente Methode und der aerodynamischen Theorie vorgenommen werden, deren Auswirkungen auf das Simulationsergebnis zu bewerten sind. Andererseits können die strukturdynamischen Kenngrößen durch den Standschwingungsversuch identifiziert werden, wobei die Ergebnisse Messungenauigkeiten enthalten. Für eine robuste Flatteruntersuchung müssen die identifizierten Unwägbarkeiten in allen Prozessschritten über die Festlegung von unteren und oberen Schranken konservativ ermittelt werden, um für alle Flugzustände eine ausreichende Flatterstabilität sicherzustellen. Zu diesem Zweck wird in der vorliegenden Arbeit ein Rechenverfahren entwickelt, welches die klassische Flatteranalyse mit den Methoden der Fuzzy- und Intervallarithmetik verbindet. Dabei werden die Flatterbewegungsgleichungen als parameterabhängiges nichtlineares Eigenwertproblem formuliert. Die Änderung der komplexen Eigenlösung infolge eines veränderlichen Einflussparameters wird mit der Methode der numerischen Fortsetzung ausgehend von der nominalen Startlösung verfolgt. Ein modifizierter Newton-Iterations-Algorithmus kommt zur Anwendung. Als Ergebnis liegen die berechneten aeroelastischen Dämpfungs- und Frequenzverläufe in Abhängigkeit von der Fluggeschwindigkeit mit Unschärfebändern vor.

A mathematical model, implementation and study of a swarm system

The work reported in this paper is motivated towards the development of a mathematical model for swarm systems based on macroscopic primitives. A pattern formation and transformation model is proposed. The pattern transformation model comprises two general methods for pattern transformation, namely a macroscopic transformation method and a mathematical transformation method. The problem of transformation is formally expressed and four special cases of transformation are considered. Simulations to confirm the feasibility of the proposed models and transformation methods are presented. Comparison between the two transformation methods is also reported.

The sl(2) affine Toda model coupled to the matter: solitons and confinement

The so-called conformal affine Toda theory coupled to the matter fields (CATM), associated to the (s) over capl(2) affine Lie algebra, is studied. The conformal symmetry is fixed by setting a connection to zero, then one defines an off-critical model, the affine Toda model coupled to the matter (ATM). Using the dressing transformation method we construct the explicit forms of the two-soliton classical solutions, and show that a physical bound soliton-antisoliton pair (breather) does not exist. Moreover, we verify that these solutions share some features of the sine-Gordon (massive Thirring) solitons, and satisfy the classical equivalence of topological and Noether currents in the ATM model. We show, using bosonization techniques that the ATM theory decouples into a sine-Gordon model and a free scalar. Imposing the Noether and topological currents equivalence as a constraint, one can show that the ATM model leads to a bag model like mechanism for the confinement of the color charge inside the sine-Gordon solitons (baryons).

Tau-functions and dressing transformations for zero-curvature affine integrable equations

The solutions of a large class of hierarchies of zero-curvature equations that includes Toda- and KdV-type hierarchies are investigated. All these hierarchies are constructed from affine (twisted or untwisted) Kac-Moody algebras g. Their common feature is that they have some special vacuum solutions corresponding to Lax operators lying in some Abelian (up to the central term) subalgebra of g; in some interesting cases such subalgebras are of the Heisenberg type. Using the dressing transformation method, the solutions in the orbit of those vacuum solutions are constructed in a uniform way. Then, the generalized tau-functions for those hierarchies are defined as an alternative set of variables corresponding to certain matrix elements evaluated in the integrable highest-weight representations of g. Such definition of tau-functions applies for any level of the representation, and it is independent of its realization (vertex operator or not). The particular important cases of generalized mKdV and KdV hierarchies as well as the Abelian and non-Abelian affine Toda theories are discussed in detail. © 1997 American Institute of Physics.

Quantifying Reproducibility in Computational Biology: The Case of the Tuberculosis Drugome

How easy is it to reproduce the results found in a typical computational biology paper? Either through experience or intuition the reader will already know that the answer is with difficulty or not at all. In this paper we attempt to quantify this difficulty by reproducing a previously published paper for different classes of users (ranging from users with little expertise to domain experts) and suggest ways in which the situation might be improved. Quantification is achieved by estimating the time required to reproduce each of the steps in the method described in the original paper and make them part of an explicit workflow that reproduces the original results. Reproducing the method took several months of effort, and required using new versions and new software that posed challenges to reconstructing and validating the results. The quantification leads to “reproducibility maps” that reveal that novice researchers would only be able to reproduce a few of the steps in the method, and that only expert researchers with advance knowledge of the domain would be able to reproduce the method in its entirety. The workflow itself is published as an online resource together with supporting software and data. The paper concludes with a brief discussion of the complexities of requiring reproducibility in terms of cost versus benefit, and a desiderata with our observations and guidelines for improving reproducibility. This has implications not only in reproducing the work of others from published papers, but reproducing work from one’s own laboratory.

T-strand integration in maize protoplasts after codelivery of a T-DNA substrate and virulence genes

We describe a plant protoplast transformation method that provides transformants with a simple pattern of integration of a foreign gene. The approach is to deliver into plant protoplasts by direct gene transfer the Agrobacterium virulence genes virD1 and virD2 with or without virE2, together with a target plasmid containing a gene of interest flanked by Agrobacterium T-DNA border repeat sequences of 25 bp. We present evidence of T-DNA formation in maize protoplasts and its integration into the maize genome. The frequency of VirD1-VirD2-mediated integration events was about 20–35% of the total number of transformants. The addition of virE2 doubled the transformation efficiency. The method described here is of sufficient efficiency and simplicity to be useful for the production of transgenic plants with single-copy well-defined transgenic inserts.

Present and future potential of pineapple biotechnology

Pineapple is an important crop for many countries in Central and South America as well as the Asia-Pacific region. Even though the history of the crop dates to pre-Colombian times there is a remarkable lack of commercial varieties with a single cultivar ‘Smooth Cayenne’ dominating the whole industry. Variety improvement is a very difficult task for pineapple breeders and very little progress has been made in this respect when compared to other crops more suitable to classical breeding approaches. This special characteristic makes pineapple specially suited for genetic engineering approaches that can transfer specific traits from other species into pineapple. In this presentation past and present efforts to use biotechnological methods for the improvement of pineapple will be reviewed. On-going biotechnology projects include control of flowering and control of ‘blackheart’ disease. The development of pineapple biotechnology, as with any other crop, is dependent on the availability of a number of molecular tools, which will also be discussed. For pineapple, these tools can be roughly classified into three different categories: (1) availability of useful genes (2) availability of suitable promoters and (3) availability of an efficient transformation method.

Development of real-time process control systems using formal techniques

A major application of computers has been to control physical processes in which the computer is embedded within some large physical process and is required to control concurrent physical processes. The main difficulty with these systems is their event-driven characteristics, which complicate their modelling and analysis. Although a number of researchers in the process system community have approached the problems of modelling and analysis of such systems, there is still a lack of standardised software development formalisms for the system (controller) development, particular at early stage of the system design cycle. This research forms part of a larger research programme which is concerned with the development of real-time process-control systems in which software is used to control concurrent physical processes. The general objective of the research in this thesis is to investigate the use of formal techniques in the analysis of such systems at their early stages of development, with a particular bias towards an application to high speed machinery. Specifically, the research aims to generate a standardised software development formalism for real-time process-control systems, particularly for software controller synthesis. In this research, a graphical modelling formalism called Sequential Function Chart (SFC), a variant of Grafcet, is examined. SFC, which is defined in the international standard IEC1131 as a graphical description language, has been used widely in industry and has achieved an acceptable level of maturity and acceptance. A comparative study between SFC and Petri nets is presented in this thesis. To overcome identified inaccuracies in the SFC, a formal definition of the firing rules for SFC is given. To provide a framework in which SFC models can be analysed formally, an extended time-related Petri net model for SFC is proposed and the transformation method is defined. The SFC notation lacks a systematic way of synthesising system models from the real world systems. Thus a standardised approach to the development of real-time process control systems is required such that the system (software) functional requirements can be identified, captured, analysed. A rule-based approach and a method called system behaviour driven method (SBDM) are proposed as a development formalism for real-time process-control systems.

Electric field strengths and ion trajectories in sharp-edge field ionization sources

On the presumption that a sharp edge may be represented by a hyperbola, a conformal transformation method is used to derive electric field equations for a sharp edge suspended above a flat plate. A further transformation is then introduced to give electric field components for a sharp edge suspended above a thin slit. Expressions are deduced for the field strength at the vertex of the edge in both arrangements. The calculated electric field components are used to compute ion trajectories in the simple edge/flat-plate case. The results are considered in relation to future study of ion focusing and unimolecular decomposition of ions in field ionization mass spectrometers.

Process capability estimation for leukocyte filtering process in blood service: a comparison study

This article considers a comparison study between different non-normal process capability estimation methods and utilizing themin the leukocyte filtering process in blood service sectors. Since the amount of leukocyte in a unit of the blood is a critical issue inthe blood transfusion process and patient safety, estimating and monitoring the capability of the leukocyte filtering process to meetthe target window is very important for blood service sectors. However, observed data from the leukocyte filtering process showthat the leukocyte levels after filtering demonstrate a right skewed distribution and applying conventional methods with a normalityassumption fails to provide trustful results. Hence, we first conduct a simulation study to compare different methods in estimating theprocess capability index of non-normal processes and then we apply these techniques to obtain the process capability of the leukocytefiltering process. The study reveals that the Box-Cox transformation method provides reliable estimation of the process capability ofthe leukocyte filtering process.