Coincidence point theorems in quasi-metric spaces without assuming the mixed monotone property and consequences in G-metric spaces

In this paper, we present some coincidence point theorems in the setting of quasi-metric spaces that can be applied to operators which not necessarily have the mixed monotone property. As a consequence, we particularize our results to the field of metric spaces, partially ordered metric spaces and G-metric spaces, obtaining some very recent results. Finally, we show how to use our main theorems to obtain coupled, tripled, quadrupled and multidimensional coincidence point results.

Common Fixed Points of Generalized Rational Type Cocyclic Mappings in Multiplicative Metric Spaces

The aim of this paper is to present fixed point result of mappings satisfying a generalized rational contractive condition in the setup of multiplicative metric spaces. As an application, we obtain a common fixed point of a pair of weakly compatible mappings. Some common fixed point results of pair of rational contractive types mappings involved in cocyclic representation of a nonempty subset of a multiplicative metric space are also obtained. Some examples are presented to support the results proved herein. Our results generalize and extend various results in the existing literature.

Pata contractions and coupled type fixed points

A new coupled fixed point theorem related to the Pata contraction for mappings having the mixed monotone property in partially ordered complete metric spaces is established. It is shown that the coupled fixed point can be unique under some extra suitable conditions involving mid point lower or upper bound properties. Also the corresponding convergence rate is estimated when the iterates of our function converge to its coupled fixed point.

On contractive cyclic fuzzy maps in metric spaces and some related results on fuzzy best proximity points and fuzzy fixed points

This paper investigates some properties of cyclic fuzzy maps in metric spaces. The convergence of distances as well as that of sequences being generated as iterates defined by a class of contractive cyclic fuzzy mapping to fuzzy best proximity points of (non-necessarily intersecting adjacent subsets) of the cyclic disposal is studied. An extension is given for the case when the images of the points of a class of contractive cyclic fuzzy mappings restricted to a particular subset of the cyclic disposal are allowed to lie either in the same subset or in its next adjacent one.

Remodelação alveolar e perfil bacteriano em implantes instalados em diferentes níveis relacionados à crista óssea

A substituição clínica de dentes naturais perdidos por implantes osteointegrados tem representado uma das primeiras opções terapêuticas para a reabilitação de pacientes total ou parcialmente edêntulos. Apesar dos excelentes índices de sucesso demonstrados pelas restaurações implanto-suportadas, alguns fatores permanecem não esclarecidos, principalmente no que diz respeito à remodelação óssea ao redor dos implantes osteointegrados. Desta forma, o objetivo deste estudo foi avaliar a relação do nível de instalação dos implantes dentários com os parâmetros clínicos, com a remodelação óssea peri-implantar e com a colonização bacteriana, em implantes de plataforma regular, submetidos à carga imediata. Implantes de plataforma regular foram instalados em dois diferentes níveis em relação à crista óssea ao nível ósseo e supra ósseo (1 mm). No total, trinta e cinco implantes em 9 pacientes (idade média de 62,4 11,2 anos) foram avaliados radiograficamente no momento da instalação dos implantes (T1) e 6 meses após (T2), momento no qual também foram feitas análises clínicas e coleta de amostras para o teste microbiológico. Nos exames radiográficos foram analisadas a perda óssea, a partir de mensurações lineares da distância entre um ponto fixo do componente protético e o ponto mais coronário do contato osso-implante, e a densidade óptica alveolar obtida a partir de regiões ósseas de interesse (ROIs). As análises clínicas consistiram na avaliação da profundidade de sondagem e na mensuração do volume do fluido gengival peri-implantar. O perfil bacteriano dos sítios avaliados foi caracterizado por meio do método de análise de checkerboard DNA-DNA hybridization. Os testes estatísticos realizados mostraram não haver relação entre o nível de instalação dos implantes em relação à crista óssea e a remodelação óssea alveolar, tanto com relação à perda óssea (p = 0,725), como com relação à densidade óptica alveolar (p = 0,975). Também não foi possível estabelecer uma correlação entre a remodelação óssea e parâmetros clínicos como profundidade de sondagem e volume do fluido gengival peri-implantar. Com relação ao perfil bacteriano, não foram encontradas diferenças estatisticamente significativas entre os grupos avaliados para nenhuma das 40 bactérias analisadas.

The Category-Theoretic Solution of Recursive Domain Equations

Recursive specifications of domains plays a crucial role in denotational semantics as developed by Scott and Strachey and their followers. The purpose of the present paper is to set up a categorical framework in which the known techniques for solving these equations find a natural place. The idea is to follow the well-known analogy between partial orders and categories, generalizing from least fixed-points of continuous functions over cpos to initial ones of continuous functors over $\omega $-categories. To apply these general ideas we introduce Wand's ${\bf O}$-categories where the morphism-sets have a partial order structure and which include almost all the categories occurring in semantics. The idea is to find solutions in a derived category of embeddings and we give order-theoretic conditions which are easy to verify and which imply the needed categorical ones. The main tool is a very general form of the limit-colimit coincidence remarked by Scott. In the concluding section we outline how compatibility considerations are to be included in the framework. A future paper will show how Scott's universal domain method can be included too.

S／T曲线速度规划在定点DSP上的实现

本文将S／T曲线速度规划的思想引入全数字伺服驱动系统中,通过提高速度的平滑性,特别是高速启、制动状态,来提高伺服系统的整体控制性能。基于定点数字信号处理器DSP芯片对提出的算法进行了实现。由于定点运算的限制,算法在实现中需要进行特殊的处理,本文对此进行了研究,并提出了一种余码补偿方案。实验研究表明,使用本文提出的方法可以提高系统运行的平稳性和控制的精确度。

7000米载人潜水器推进器故障容错控制分配研究

介绍了7000米载人潜水器推进系统的组成和推进器布置,描述了潜水器控制分配问题,对推进器推力和期望控制量进行了归一化处理.根据载人潜水器的推进器布置,建立了系统的控制分配模型,设计了推进器故障容错处理策略,研究了基于推力最小二范数的载人潜水器控制分配求解方法.采用基于伪逆矩阵与定点分配的混合控制分配求解算法,在半物理仿真平台上实验验证了控制分配求解算法的正确性和有效性.

基于显式分形插值的高保真地震数据重建方法研究

Based on the fractal theories, contractive mapping principles as well as the fixed point theory, by means of affine transform, this dissertation develops a novel Explicit Fractal Interpolation Function（EFIF）which can be used to reconstruct the seismic data with high fidelity and precision. Spatial trace interpolation is one of the important issues in seismic data processing. Under the ideal circumstances, seismic data should be sampled with a uniform spatial coverage. However, practical constraints such as the complex surface conditions indicate that the sampling density may be sparse or for other reasons some traces may be lost. The wide spacing between receivers can result in sparse sampling along traverse lines, thus result in a spatial aliasing of short-wavelength features. Hence, the method of interpolation is of very importance. It not only needs to make the amplitude information obvious but the phase information, especially that of the point that the phase changes acutely. Many people put forward several interpolation methods, yet this dissertation focuses attention on a special class of fractal interpolation function, referred to as explicit fractal interpolation function to improve the accuracy of the interpolation reconstruction and to make the local information obvious. The traditional fractal interpolation method mainly based on the randomly Fractional Brown Motion (FBM) model, furthermore, the vertical scaling factor which plays a critical role in the implementation of fractal interpolation is assigned the same value during the whole interpolating process, so it can not make the local information obvious. In addition, the maximal defect of the traditional fractal interpolation method is that it cannot obtain the function values on each interpolating nodes, thereby it cannot analyze the node error quantitatively and cannot evaluate the feasibility of this method. Detailed discussions about the applications of fractal interpolation in seismology have not been given by the pioneers, let alone the interpolating processing of the single trace seismogram. On the basis of the previous work and fractal theory this dissertation discusses the fractal interpolation thoroughly and the stability of this special kind of interpolating function is discussed, at the same time the explicit presentation of the vertical scaling factor which controls the precision of the interpolation has been proposed. This novel method develops the traditional fractal interpolation method and converts the fractal interpolation with random algorithms into the interpolation with determined algorithms. The data structure of binary tree method has been applied during the process of interpolation, and it avoids the process of iteration that is inevitable in traditional fractal interpolation and improves the computation efficiency. To illustrate the validity of the novel method, this dissertation develops several theoretical models and synthesizes the common shot gathers and seismograms and reconstructs the traces that were erased from the initial section using the explicit fractal interpolation method. In order to compare the differences between the theoretical traces that were erased in the initial section and the resulting traces after reconstruction on waveform and amplitudes quantitatively, each missing traces are reconstructed and the residuals are analyzed. The numerical experiments demonstrate that the novel fractal interpolation method is not only applicable to reconstruct the seismograms with small offset but to the seismograms with large offset. The seismograms reconstructed by explicit fractal interpolation method resemble the original ones well. The waveform of the missing traces could be estimated very well and also the amplitudes of the interpolated traces are a good approximation of the original ones. The high precision and computational efficiency of the explicit fractal interpolation make it a useful tool to reconstruct the seismic data; it can not only make the local information obvious but preserve the overall characteristics of the object investigated. To illustrate the influence of the explicit fractal interpolation method to the accuracy of the imaging of the structure in the earth’s interior, this dissertation applies the method mentioned above to the reverse-time migration. The imaging sections obtained by using the fractal interpolated reflected data resemble the original ones very well. The numerical experiments demonstrate that even with the sparse sampling we can still obtain the high accurate imaging of the earth’s interior’s structure by means of the explicit fractal interpolation method. So we can obtain the imaging results of the earth’s interior with fine quality by using relatively small number of seismic stations. With the fractal interpolation method we will improve the efficiency and the accuracy of the reverse-time migration under economic conditions. To verify the application effect to real data of the method presented in this paper, we tested the method by using the real data provided by the Broadband Seismic Array Laboratory, IGGCAS. The results demonstrate that the accuracy of explicit fractal interpolation is still very high even with the real data with large epicenter and large offset. The amplitudes and the phase of the reconstructed station data resemble the original ones that were erased in the initial section very well. Altogether, the novel fractal interpolation function provides a new and useful tool to reconstruct the seismic data with high precision and efficiency, and presents an alternative to image the deep structure of the earth accurately.

Inexact floating-point adder for dynamic image processing

Power has become a key constraint in current nanoscale integrated circuit design due to the increasing demands for mobile computing and a low carbon economy. As an emerging technology, an inexact circuit design offers a promising approach to significantly reduce both dynamic and static power dissipation for error tolerant applications. Although fixed-point arithmetic circuits have been studied in terms of inexact computing, floating-point arithmetic circuits have not been fully considered although require more power. In this paper, the first inexact floating-point adder is designed and applied to high dynamic range (HDR) image processing. Inexact floating-point adders are proposed by approximately designing an exponent subtractor and mantissa adder. Related logic operations including normalization and rounding modules are also considered in terms of inexact computing. Two HDR images are processed using the proposed inexact floating-point adders to show the validity of the inexact design. HDR-VDP is used as a metric to measure the subjective results of the image addition. Significant improvements have been achieved in terms of area, delay and power consumption. Comparison results show that the proposed inexact floating-point adders can improve power consumption and the power-delay product by 29.98% and 39.60%, respectively.

Rapid, simple method for determining the porosity of mesoporous TiO2 films using a quartz crystal microbalance (QCM)

Two different mesoporous films of TiO2 were coated onto a QCM disc and fired at 450o C for 30 min. The first film was derived from a sol-gel paste that was popular in the early days of dye-sensitised solar cell, i.e. dssc, research, a TiO2(sg) film. The other was a commercial colloidal paste used to make examples of the current dssc cell; a TiO2(ds) film. A QCM was used to determine the mass of the TiO2 film deposited on each disc and the increase in the mass of the film when immersed in water/glycerol solutions with wt% values spanning the range 0-70%. The results of this work reveal that with both TiO2 mesoporous films the solution fills the film's pores and acts as a rigid mass, thereby allowing the porosity of each film to be calculated as: 59.1% and 71.6% for the TiO2(sg) and TiO2(ds) films, respectively. These results, coupled with surface area data, allowed the pore radii of the two films to be calculated as: 9.6 and 17.8 nm, respectively. This method is then simplified further, to just a few frequency measurements in water and only air to reveal the same porosity values. The value of the latter ‘one point’ method for making porosity measurements is discussed briefly.

Implementação em hardware reconfigurável de método de separação de dados hiperespetrais

Relatório do Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia de Electrónica e Telecomunicações

Théorèmes de point fixe et principe variationnel d'Ekeland

Le principe de contraction de Banach, qui garantit l'existence d'un point fixe d'une contraction d'un espace métrique complet à valeur dans lui-même, est certainement le plus connu des théorèmes de point fixe. Dans plusieurs situations concrètes, nous sommes cependant amenés à considérer une contraction qui n'est définie que sur un sous-ensemble de cet espace. Afin de garantir l'existence d'un point fixe, nous verrons que d'autres hypothèses sont évidemment nécessaires. Le théorème de Caristi, qui garantit l'existence d'un point fixe d'une fonction d'un espace métrique complet à valeur dans lui-même et respectant une condition particulière sur d(x,f(x)), a plus tard été généralisé aux fonctions multivoques. Nous énoncerons des théorèmes de point fixe pour des fonctions multivoques définies sur un sous-ensemble d'un espace métrique grâce, entre autres, à l'introduction de notions de fonctions entrantes. Cette piste de recherche s'inscrit dans les travaux très récents de mathématiciens français et polonais. Nous avons obtenu des généralisations aux espaces de Fréchet et aux espaces de jauge de quelques théorèmes, dont les théorèmes de Caristi et le principe variationnel d'Ekeland. Nous avons également généralisé des théorèmes de point fixe pour des fonctions qui sont définies sur un sous-ensemble d'un espace de Fréchet ou de jauge. Pour ce faire, nous avons eu recours à de nouveaux types de contractions; les contractions sur les espaces de Fréchet introduites par Cain et Nashed [CaNa] en 1971 et les contractions généralisées sur les espaces de jauge introduites par Frigon [Fr] en 2000.

Bit-Width Analysis for General Applications

It has been widely known that a significant part of the bits are useless or even unused during the program execution. Bit-width analysis targets at finding the minimum bits needed for each variable in the program, which ensures the execution correctness and resources saving. In this paper, we proposed a static analysis method for bit-widths in general applications, which approximates conservatively at compile time and is independent of runtime conditions. While most related work focus on integer applications, our method is also tailored and applicable to floating point variables, which could be extended to transform floating point number into fixed point numbers together with precision analysis. We used more precise representations for data value ranges of both scalar and array variables. Element level analysis is carried out for arrays. We also suggested an alternative for the standard fixed-point iterations in bi-directional range analysis. These techniques are implemented on the Trimaran compiler structure and tested on a set of benchmarks to show the results.

Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming

We study the preconditioning of symmetric indefinite linear systems of equations that arise in interior point solution of linear optimization problems. The preconditioning method that we study exploits the block structure of the augmented matrix to design a similar block structure preconditioner to improve the spectral properties of the resulting preconditioned matrix so as to improve the convergence rate of the iterative solution of the system. We also propose a two-phase algorithm that takes advantage of the spectral properties of the transformed matrix to solve for the Newton directions in the interior-point method. Numerical experiments have been performed on some LP test problems in the NETLIB suite to demonstrate the potential of the preconditioning method discussed.