Two-Pass Hexagonal algorithm with improved Hashtable structure for motion estimation

This paper presents an improved Two-Pass Hexagonal (TPA) algorithm constituted by Linear Hashtable Motion Estimation Algorithm (LHMEA) and Hexagonal Search (HEXBS) for motion estimation. In the TPA, Motion Vectors (MV) are generated from the first-pass LHMEA and are used as predictors for second-pass HEXBS motion estimation, which only searches a small number of Macroblocks (MBs). The hashtable structure of LHMEA is improved compared to the original TPA and LHMEA. The evaluation of the algorithm considers the three important metrics being processing time, compression rate and PSNR. The performance of the algorithm is evaluated by using standard video sequences and the results are compared to current algorithms.

A mixture of experts network structure construction algorithm for modelling and control

This paper introduces a new fast, effective and practical model structure construction algorithm for a mixture of experts network system utilising only process data. The algorithm is based on a novel forward constrained regression procedure. Given a full set of the experts as potential model bases, the structure construction algorithm, formed on the forward constrained regression procedure, selects the most significant model base one by one so as to minimise the overall system approximation error at each iteration, while the gate parameters in the mixture of experts network system are accordingly adjusted so as to satisfy the convex constraints required in the derivation of the forward constrained regression procedure. The procedure continues until a proper system model is constructed that utilises some or all of the experts. A pruning algorithm of the consequent mixture of experts network system is also derived to generate an overall parsimonious construction algorithm. Numerical examples are provided to demonstrate the effectiveness of the new algorithms. The mixture of experts network framework can be applied to a wide variety of applications ranging from multiple model controller synthesis to multi-sensor data fusion.

Genetic algorithm inversion of the average 1D crustal structure using local and regional earthquakes

Knowing the best 1D model of the crustal and upper mantle structure is useful not only for routine hypocenter determination, but also for linearized joint inversions of hypocenters and 3D crustal structure, where a good choice of the initial model can be very important. Here, we tested the combination of a simple GA inversion with the widely used HYPO71 program to find the best three-layer model (upper crust, lower crust, and upper mantle) by minimizing the overall P- and S-arrival residuals, using local and regional earthquakes in two areas of the Brazilian shield. Results from the Tocantins Province (Central Brazil) and the southern border of the Sao Francisco craton (SE Brazil) indicated an average crustal thickness of 38 and 43 km, respectively, consistent with previous estimates from receiver functions and seismic refraction lines. The GA + HYPO71 inversion produced correct Vp/Vs ratios (1.73 and 1.71, respectively), as expected from Wadati diagrams. Tests with synthetic data showed that the method is robust for the crustal thickness, Pn velocity, and Vp/Vs ratio when using events with distance up to about 400 km, despite the small number of events available (7 and 22, respectively). The velocities of the upper and lower crusts, however, are less well constrained. Interestingly, in the Tocantins Province, the GA + HYPO71 inversion showed a secondary solution (local minimum) for the average crustal thickness, besides the global minimum solution, which was caused by the existence of two distinct domains in the Central Brazil with very different crustal thicknesses. (C) 2010 Elsevier Ltd. All rights reserved.

Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Factors affecting nucleolytic efficiency of some ternary metal complexes with DNA binding and recognition domains. Crystal and molecular structure of Zn(phen)(edda)

The binding selectivity of the M(phen)(edda) (M = Cu, Co, Ni, Zn; phen = 1,10-phenanthroline, edda = ethylenediaminediacetic acid) complexes towards ds(CG)(6), ds(AT)(6) and ds(CGCGAATTCGCG) B-form oligonucleotide duplexes were studied by CD spectroscopy and molecular modeling. The binding mode is intercalation and there is selectivity towards AT-sequence and stacking preference for A/A parallel or diagonal adjacent base steps in their intercalation. The nucleolytic properties of these complexes were investigated and the factors affecting the extent of cleavage were determined to be: concentration of complex, the nature of metal(11) ion, type of buffer, pH of buffer, incubation time, incubation temperature, and the presence of hydrogen peroxide or ascorbic acid as exogenous reagents. The fluorescence property of these complexes and its origin were also investigated. The crystal structure of the Zn(phen)(edda) complex is reported in which the zinc atom displays a distorted trans-N4O2 octahedral geometry; the crystal packing features double layers of complex molecules held together by extensive hydrogen bonding that inter-digitate with adjacent double layers via pi...pi interactions between 1,10-phenanthroline residues. The structure is compared with that of the recently described copper(II) analogue and, with the latter, included in molecular modeling. (C) 2008 Elsevier B.V. All rights reserved.

Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning

A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.

Synthesis and biological evaluation of ternary silver compounds bearing N,N-chelating ligands and thiourea: X-ray structure of [{Ag(bpy) (mu-tu)}(2)](NO3)(2) (bpy=2,2 '-bipyridine; tu = thiourea)

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Structure and properties of intermetallic ternary rare earth compounds

The so called material science is an always growing field in modern research. For the development of new materials not only the experimental characterization but also theoretical calculation of the electronic structure plays an important role. A class of compounds that has attracted a great deal of attention in recent years is known as REME compounds. These compounds are often referred to with RE designating rare earth, actinide or an element from group 1 - 4, M representing a late transition metal from groups 8 - 12, and E belonging to groups 13 - 15. There are more than 2000 compounds with 1:1:1 stoichiometry belonging to this class of compounds and they offer a broad variety of different structure types. Although many REME compounds are know to exist, mainly only structure and magnetism has been determined for these compounds. In particular, in the field of electronic and transport properties relatively few efforts have been made. The main focus in this study is on compounds crystallizing in MgAgAs and LiGaGe structure. Both structures can only be found among 18 valence electron compounds. The f electrons are localized and therefor not count as valence electrons. A special focus here was also on the magnetoresistance effects and spintronic properties found among the REME compounds. An examination of the following compounds was made: GdAuE (E = In, Cd, Mg), GdPdSb, GdNiSb, REAuSn (RE = Gd, Er, Tm) and RENiBi (RE = Pr, Sm, Gd - Tm, Lu). The experimental results were compared with theoretic band structure calculations. The first half metallic ferromagnet with LiGaGe structure (GdPdSb) was found. All semiconducting REME compounds with MgAgAs structure show giant magnetoresistance (GMR) at low temperatures. The GMR is related to a metal-insulator transition, and the value of the GMR depends on the value of the spin-orbit coupling. Inhomogeneous DyNiBi samples show a small positive MR at low temperature that depends on the amount of metallic impurities. At higher fields the samples show a negative GMR. Inhomogeneous nonmagnetic LuNiBi samples show no negative GMR, but a large positive MR of 27.5% at room temperature, which is interesting for application.

An evolutionary algorithm for the surface structure problem

Many macroscopic properties: hardness, corrosion, catalytic activity, etc. are directly related to the surface structure, that is, to the position and chemical identity of the outermost atoms of the material. Current experimental techniques for its determination produce a “signature” from which the structure must be inferred by solving an inverse problem: a solution is proposed, its corresponding signature computed and then compared to the experiment. This is a challenging optimization problem where the search space and the number of local minima grows exponentially with the number of atoms, hence its solution cannot be achieved for arbitrarily large structures. Nowadays, it is solved by using a mixture of human knowledge and local search techniques: an expert proposes a solution that is refined using a local minimizer. If the outcome does not fit the experiment, a new solution must be proposed again. Solving a small surface can take from days to weeks of this trial and error method. Here we describe our ongoing work in its solution. We use an hybrid algorithm that mixes evolutionary techniques with trusted region methods and reuses knowledge gained during the execution to avoid repeated search of structures. Its parallelization produces good results even when not requiring the gathering of the full population, hence it can be used in loosely coupled environments such as grids. With this algorithm, the solution of test cases that previously took weeks of expert time can be automatically solved in a day or two of uniprocessor time.

Electronic properties of doped magnesium thioindate ternary spinel in the normal and in the inverse structure

We present a theoretical study of the structural and electronic properties of the M-doped MgIn2S4 ternary spinel semiconductor with M = V, Cr, and Mn. All substitutions, in the normal and in the inverse structure, are analyzed. Some of these possible substitutions present intermediate-band states in the band gap with a different occupation for a spin component. It increases the possibilities of inter-band transitions and could be interesting for applications in optoelectronic devices. The contribution to, and the electronic configuration of, these intermediate bands for the octahedral and tetrahedral sites is analyzed and discussed. The study of the substitutional energies indicates that these substitutions are favorable. Comparison between the pure and doped hosts absorption coefficients shows that this deeper band opens up more photon absorption channels and could therefore increase the solar-light absorption with respect to the host.

A database and tools for 3-D protein structure comparison and alignment using the Combinatorial Extension (CE) algorithm

The database reported here is derived using the Combinatorial Extension (CE) algorithm which compares pairs of protein polypeptide chains and provides a list of structurally similar proteins along with their structure alignments. Using CE, structure–structure alignments can provide insights into biological function. When a protein of known function is shown to be structurally similar to a protein of unknown function, a relationship might be inferred; a relationship not necessarily detectable from sequence comparison alone. Establishing structure–structure relationships in this way is of great importance as we enter an era of structural genomics where there is a likelihood of an increasing number of structures with unknown functions being determined. Thus the CE database is an example of a useful tool in the annotation of protein structures of unknown function. Comparisons can be performed on the complete PDB or on a structurally representative subset of proteins. The source protein(s) can be from the PDB (updated monthly) or uploaded by the user. CE provides sequence alignments resulting from structural alignments and Cartesian coordinates for the aligned structures, which may be analyzed using the supplied Compare3D Java applet, or downloaded for further local analysis. Searches can be run from the CE web site, http://cl.sdsc.edu/ce.html, or the database and software downloaded from the site for local use.

A proposal of algorithm for solving definite descriptions through dialogue structure

En este trabajo proponemos un algoritmo para la resolución de las descripciones definidas en español a través de la estructura del diálogo, mediante la definición de un espacio de accesibilidad anafórico. Este algoritmo está basado en la hipótesis de que la resolución de la anáfora está relacionada con la estructura del diálogo. Así, la resolución de la anáfora mejora si se especifica un espacio de accesibilidad para cada tipo descripción definida según la estructura del diálogo. La utilización de este espacio de accesibilidad anafóico reduce tanto el tiempo de procesamiento como la posibilidad de obtener un antecedente erróneo. Además, la definición de este espacio de accesibilidad depende únicamente de la propia estructura textual del diálogo.

Filtering duplicate items over distributed data streams

In recent years many real time applications need to handle data streams. We consider the distributed environments in which remote data sources keep on collecting data from real world or from other data sources, and continuously push the data to a central stream processor. In these kinds of environments, significant communication is induced by the transmitting of rapid, high-volume and time-varying data streams. At the same time, the computing overhead at the central processor is also incurred. In this paper, we develop a novel filter approach, called DTFilter approach, for evaluating the windowed distinct queries in such a distributed system. DTFilter approach is based on the searching algorithm using a data structure of two height-balanced trees, and it avoids transmitting duplicate items in data streams, thus lots of network resources are saved. In addition, theoretical analysis of the time spent in performing the search, and of the amount of memory needed is provided. Extensive experiments also show that DTFilter approach owns high performance.

Self-tuning algorithm for dsp-based motion control in cnc applications

This thesis describes the development of an adaptive control algorithm for Computerized Numerical Control (CNC) machines implemented in a multi-axis motion control board based on the TMS320C31 DSP chip. The adaptive process involves two stages: Plant Modeling and Inverse Control Application. The first stage builds a non-recursive model of the CNC system (plant) using the Least-Mean-Square (LMS) algorithm. The second stage consists of the definition of a recursive structure (the controller) that implements an inverse model of the plant by using the coefficients of the model in an algorithm called Forward-Time Calculation (FTC). In this way, when the inverse controller is implemented in series with the plant, it will pre-compensate for the modification that the original plant introduces in the input signal. The performance of this solution was verified at three different levels: Software simulation, implementation in a set of isolated motor-encoder pairs and implementation in a real CNC machine. The use of the adaptive inverse controller effectively improved the step response of the system in all three levels. In the simulation, an ideal response was obtained. In the motor-encoder test, the rise time was reduced by as much as 80%, without overshoot, in some cases. Even with the larger mass of the actual CNC machine, decrease of the rise time and elimination of the overshoot were obtained in most cases. These results lead to the conclusion that the adaptive inverse controller is a viable approach to position control in CNC machinery.