Template Classes Research Articles

Chiral Relay in Enantioselective Conjugate Radical Additions Using ­Pyrazolidinone Templates. How Does Metal Geometry Impact Selectivity?

A novel class of achiral templates containing fluxional groups has been evaluated in conjugate radical additions. Magnesium and copper Lewis acids provide high enantioselectivity (>90% ee) for radical additions. The impact of the metal geometry on enantioselectivity using relay templates has also been assessed.

A framework for applet animations with controls

A generic Java™ applet animation with controls is presented in this paper. This framework implementation promotes software reusability in terms of applying modularity and factorization using inheritance, delegation, and template classes with cohesive methods. It can be used either as an example or a project in a typical object-oriented design and analysis class.

Object-oriented classic data structures for CS2 in C#

For many years there has been substantial agreement that the content of the CS2 course should be a study of the classic data structures including, but not limited to, stacks, queues, trees, and tables. In recent years we have observed a move to the object-oriented programming paradigm for the CS2 course. At this point there is significant divergence as to the best programming language to use -- C++, Eiffel, Java, Oberon, Python, or Scheme, to name a few. Although many agree that to be truly object-oriented, a programming language must support (1) encapsulation of attributes and behavior in a user-defined class specification, (2) instantiation of objects of predefined and user-defined classes, (3) polymorphism, and (4) inheritance. From a survey of recent texts for the CS2 course, it appears that there is heavy emphasis on encapsulation and instantiation with some treatment of inheritance and little treatment of polymorphism. There is also significant treatment of generic container classes supported by template classes if the supporting language is C++. If the supporting language is Java, then the container typically manages objects of the type Object. This paper makes a case that the new Microsoft C# ((c)2001 Microsoft Corporation) language could be considered a viable candidate for the CS2 course since it supports user-defined class specifications with the encapsulation of attributes and behavior, instantiation of objects of predefined and user-defined classes, polymorphism and inheritance. Additionally, there is full support for exception handling using the now, well-known, try/catch/finally semantics. Further, there is support for dynamic memory allocation and deallocation. The language also makes the distinction between pass by reference and pass by value function/method parameters by obvious keywords in both the formal declarations and in the call. The language also supports namespaces for the organization of software components. And finally, the student or developer has full support for visual, event-driven, net-centric programming paradigm.This paper presents an implementation of a stack container ADT that is fully generic, that is, it may manage a collection of arbitrary objects that demonstrate polymorphic behavior.

New spatial-temporal patterns and the first programmable on-chip bifurcation test bed

In this paper, we introduce a new experimental tool, a real-time programmable, spatial-temporal bifurcation test bed. We present the experimental analysis of an antisymmetric template class. This class produces novel spatial-temporal patterns that exhibit complex dynamics. The character of these propagating patterns depends on the self-feedback and on the sign of the coupling below the self-feedback template element.

ON THE TEMPLATES CORRESPONDING TO CYCLE-SYMMETRIC CONNECTIVITY IN CELLULAR NEURAL NETWORKS

In the architecture of cellular neural networks (CNN), connections among cells are built on linear coupling laws. These laws are characterized by the so-called templates which express the local interaction weights among cells. Recently, the complete stability for CNN has been extended from symmetric connections to cycle-symmetric connections. In this presentation, we investigate a class of two-dimensional space-invariant templates. We find necessary and sufficient conditions for the class of templates to have cycle-symmetric connections. Complete stability for CNN with several interesting templates is thus concluded.

Object-oriented classic data structures for CS 2 in visual basic .net

For many years there has been substantial agreement that the content of the CS2 course should be a study of the classic data structures including, but not limited to, stacks, queues, trees, and tables. In recent years we have observed a move to the object-oriented programming paradigm for the CS2 course. At this point there is significant divergence as to the best programming language to use - C++, Eiffel, Java, Oberon, Python, or Scheme, to name a few. Although many agree that to be truly object-oriented, a programming language must support (1) encapsulation of attributes and behavior in a user-defined class specification, (2) instantiation of objects of pre-defined and user-defined classes, (3) polymorphism, and (4) inheritance. From a survey of recent texts for the CS2 course, it appears that there is heavy emphasis on encapsulation and instantiation with some treatment of inheritance and little treatment of polymorphism. There is also significant treatment of generic container classes supported by template classes if the supporting language is C++. If the supporting language is Java, then the container typically manages objects of the type Object. This paper makes a case that Visual Basic .NET could be considered a viable candidate for the CS2 course since it supports user-defined class specifications with the encapsulation of attributes and behavior, instantiation of objects of pre-defined and user-defined classes, polymorphism and inheritance. Additionally, there is full support for exception handling using the now, well-known, try/catch/finally semantics. Further, there is support for dynamic memory allocation and deallocation. And finally, the student or developer has full support for visual, event-driven, net-centric programming paradigm.This paper is a follow-up to a series of papers several years ago by the same author. These papers made a case for the use of Visual Basic in CS2 even though, at the time, Visual Basic was not yet fully object-oriented. This paper will present an implementation of a stack container ADT that is fully generic, that is, it may manage a collection of arbitrary objects that demonstrate polymorphic behavior.

Template design methods for binary stable cellular neural networks

AbstractStable cellular neural networks with binary outputs implement a non‐linear mapping between sets of input and output images. Such a mapping is studied in detail. We prove two theorems: the first one yields a sufficient condition in order that the non‐linear mapping be well‐defined; the second one yields a condition, that allows to describe the mapping through a simple algorithm based on the sign of the initial derivatives. Then we enunciate two additional theorems and two corollaries, that identify the class of templates satisfying the above condition: such a class is shown to be rather large and include, as particular cases, the monotonic templates, and several kinds of non‐monotonic templates. Finally,a rigorous design procedure is proposed. Copyright © 2002 John Wiley & Sons, Ltd.

LOCAL++: A C++ framework for local search algorithms

Local search is an emerging paradigm for combinatorial search which has recently been shown to be very effective for a large number of combinatorial problems. It is based on the idea of navigating the search space by iteratively stepping from one solution to one of its neighbors, which are obtained by applying a simple local change to it. In this paper we present LOCAL++, an object-oriented framework to be used as a general tool for the development and implementation of local search algorithms in C++. The framework comprises a hierarchy of abstract template classes, one for each local search technique taken into account (i.e. hill-climbing, simulated annealing and tabu search). Each class specifies and implements the invariant part of the algorithm built according to the technique, and is supposed to be specialized by a concrete class once a given search problem is considered, so as to implement the problem-dependent part of the algorithm. LOCAL++ comprises also a set of abstract classes for creating new techniques by combining different search techniques and different neighborhood relations. The architecture of LOCAL++ provides a principled modularization for the solution of combinatorial search problems, and helps the designer deriving a neat conceptual scheme of the application, thus facilitating the development and debugging phases. LOCAL++ proved to be flexible enough for the implementation of the algorithms solving various scheduling problems. Copyright © 2000 John Wiley & Sons, Ltd.

LOCAL++: A C++ framework for local search algorithms

Local search is an emerging paradigm for combinatorial search which has recently been shown to be very effective for a large number of combinatorial problems. It is based on the idea of navigating the search space by iteratively stepping from one solution to one of its neighbors, which are obtained by applying a simple local change to it. In this paper we present LOCAL++, an object-oriented framework to be used as a general tool for the development and implementation of local search algorithms in C++. The framework comprises a hierarchy of abstract template classes, one for each local search technique taken into account (i.e. hill-climbing, simulated annealing and tabu search). Each class specifies and implements the invariant part of the algorithm built according to the technique, and is supposed to be specialized by a concrete class once a given search problem is considered, so as to implement the problem-dependent part of the algorithm. LOCAL++ comprises also a set of abstract classes for creating new techniques by combining different search techniques and different neighborhood relations. The architecture of LOCAL++ provides a principled modularization for the solution of combinatorial search problems, and helps the designer deriving a neat conceptual scheme of the application, thus facilitating the development and debugging phases. LOCAL++ proved to be flexible enough for the implementation of the algorithms solving various scheduling problems. Copyright © 2000 John Wiley & Sons, Ltd.

Extraction of functional regularity in datapath circuits

Datapath circuits exhibit a very high degree of regularity, which is exploited by designers to generate layouts with a high density and performance as well as to reduce the overall design effort. Regularity in a datapath circuit manifests itself at functional, structural, and topological levels. Functional regularity of a circuit implies the existence of logically equivalent subcircuits-a common feature of datapath circuits. We present a new and comprehensive approach to extract functional regularity for datapath circuits from their high-level or gate-level descriptions. The key step is the generation of a large set of templates, where a template is a subcircuit with multiple instances in the circuit. Two novel template generation algorithms are presented-one for templates with a tree structure, and the other for a special class of multioutput templates, called single-principal-output-graph (SPOG) templates, where all outputs of a template are in the transitive fanin of a particular output. The set of templates generated is shown to be complete under a few simplifying, yet practical, assumptions, which is key in obtaining a desirable cover of the circuit using templates. We present a few extensions to our regularity extraction approach to demonstrate its generality; these extensions include hierarchical representation of regularity and generation of instances of user-specified templates. We show that the generation of the above two classes of templates results in good covers for datapath circuits with a regular bus structure, including several International Conference on Computer-Aided Design benchmark circuits. The regularity extracted from these circuits can be used to easily understand their structure. We have successfully used our approach to identify bit slices of very large datapath circuits from general-purpose microprocessors.

The art of CNN template design

A practical survey of the design rules of uncoupled and coupled linear CNN templates with binary inputs and outputs is given. The usage and the properties of the different classes of CNN templates are analysed. CNN chip specific robustness considerations are also given. Copyright © 1999 John Wiley & Sons, Ltd.

Computing with Front Propagation: Active Contour And Skeleton Models In Continuous-Time CNN

In this paper, a linear CNN template class is studied with a symmetric feedback matrix capable of generating trigger-waves, a special type of binary traveling-wave. The qualitative properties of these waves are examined and some simple control strategies are derived based on modifying the bias and feedback terms in a CNN template. It is shown that a properly controlled wave-front can be efficiently used in segmentation, shape and structure detection/recovery tasks. Shape is represented by the contour of an evolving front. An algorithmic framework is discussed that incorporates bias controlled trigger-waves in tracking the active contour of the objects during rigid and non-rigid motion. The object skeleton (structure) is obtained as a composition of stable annihilation lines formed during the collision of trigger wave-fronts. The shortest path problem in a binary labyrinth is also formulated as a special type of skeletonization task and solved by combined trigger-wave based techniques.

Phosphate liquid crystals: novel supramolecular template for the synthesis of lamellar aluminophosphates with natural form

The thermal properties ofn-alkylammonium dihydrogenphosphates, [CnH2n+1NH3+ ][H2PO4– ], where 6≤n≤18, have been investigated for the first time. It was discovered that for decylammonium (n=10), the material undergoes several polymorphic phase transitions before ultimately transforming to a smectic liquid crystal mesophase. The crystal to liquid crystal transformation of this phase was studied by in situ variable temperature polarizing optical microscopy and revealed intriguing micron dimension surface patterns. Similar thermal behaviour was observed when the material was dispersed in a polyethylene glycol non-aqueous solvent. The results have direct implications for the growth and form of surface patterned lamellar aluminophosphate morphologies prepared organo-thermally from aluminium oxide, phosphoric acid and n-alkylamines in polyethylene glycol-based solvents. Topological defects present in the precursor alkylammonium phosphate mesophase appear to be responsible for the emergence of surface textured lamellar aluminophosphate replica materials with biomimetic form. Phosphate liquid crystals represent a new class of supramolecular templates for the synthesis of a wide variety of mesostructured metal phosphates.

Deoxyribonucleotide-containing RNAs: a novel class of templates for HIV-1 reverse transcriptase.

Deoxyribonucleotide-containing RNA-like polynucleotides (dcRNAs) were synthesized by mutant T7 RNA polymerase and their structures confirmed by sequencing. dcRNAs annealed with a 20mer oligodeoxyribonucleotide primer were tested as templates/primers in the reverse transcription reaction catalyzed by HIV-1 reverse transcriptase (RT). All dcRNAs were shown to be efficient templates for both wild-type RT and RT mutants, containing 'AZT-resistant' mutations. Differences in the patterns of the DNA products of RNA- and dcRNA-driven reverse transcription were demonstrated. The kinetic characteristics for dcRNAs utilization were compared with the corresponding parameters for RNA/DNA and DNA/DNA templates/primers. The respective K m values for dcRNAs appear to be intermediate between those for RNA and DNA templates. A correlation equation connecting apparent K m value for template/primer and the number of deoxyribonucleotide substitutions in RNA template is proposed.

Stability of cellular neural networks and delayed cellular neural networks with nonpositive templates and nonmonotonic output functions

In this paper the problem of the stability of Cellular Neural Networks (CNN's) and Delayed Cellular Neural Networks (DCNN's) is addressed by means of Lyapunov functions (functionals in the delayed case); new classes of nonpositive templates, describing CNN's and DCNN's, are shown to be stable and some conditions are found ensuring the complete stability of dominant template DCNN's and CNN's with nonmonotonic output functions.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Multiple layer discrete-time cellular neural networks using time-variant templates

A generalized architecture for discrete-time cellular neural networks (DTCNNs) is provided. It allows multiple layers of different architecture, which can be combined in several interconnection modes. Three elementary building blocks are introduced. Another important extension is the use of time-variant templates. They allow the definition of cyclic templates, where the coefficients are changed every iteration step and a set of templates is applied periodically. The definition of convergence has been adopted for this network structure, and important classes of templates are proved to be convergent. Examples are given for the following image processing tasks: rectangular hull extraction, skeletonization, and halftoning.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Discrete‐time cellular neural networks

AbstractA network structure called a discrete‐time cellular neural network is introduced. It is derived from cellular neural networks and feedback threshold networks. the architecture is discussed and its advantages are presented. Convergence is proved for a large class of templates and applications are given for the following image‐processing tasks: linear thresholding, connected component detection, hole filling, concentric contouring, increasing and decreasing objects step by step, searching for objects with minimal distance, and oscillation.

The design of the C++ Booch Components

This paper describes design issues encountered developing a reusable component library. The design applied encapsulation, inheritance, composition and type parameterization. The implementation uses various C++ mechanisms, including: virtual and static member functions, templates, and exceptions. The resulting library contains about 500 components (mostly template classes and functions) and an optional utility for instantiating templates. The components provide variations of basic collection/container abstractions with various time and space complexities. A key insight gained from this project: the design process centered on developing a “template for the templates” — designing a component framework and orderly process for generating the template classes.

Stability of a class of nonreciprocal cellular neural networks

Cellular neural networks with an appropriate choice of templates can solve, among other things, local and global pattern recognition problems. The complete stability of these networks has been proved earlier for the symmetric (reciprocal) cases where the feedback values between the different cells within a neighborhood are the same in both directions. It is shown that at least for some interesting classes of templates, this symmetry (reciprocity) condition is in general not necessary for complete stability. Moreover, the conditions discussed are robust in the sense that they require neither precise template-value relations nor a closeness to some prescribed values. On the other hand, examples are shown of cases where violating some basic conditions would give rise to oscillations. >

A Multilevel Approach to Sequential Detection of Pictorial Features

This paper considers the problem of detecting the local similarity between templates in a given class and a given image using a hierarchically ordered sequential decision rule. When the given set consists of a large number of templates and the number of locations in the image matching any of the templates is small, it is wasteful to examine each of the templates at every location in the image for a match. Instead, it is proposed that the set of templates be partitioned and a ``representative template'' be defined for each of the partitions. Several levels of partitioning are defined. Elimination of mismatching locations and termination of computation can take place at each, level of detection. Each level of testing is over a more restrictive subset of the template class than the previous level. The paper presents a general formulation of this approach and gives criteria for selecting representative templates, the ordering of components of a template vector for error evaluation, and the threshold sequences to be used in deciding about a ``match.'' Suboptimal solutions are given satisfying these criteria. Illustrative examples are provided showing recognition of linear features in test patterns and photographs obtained by aerial and spaceborne sensors.