Sharif Digital Repository

This paper concerns the design of a neural state observer for nonlinear dynamic systems with noisy measurement channels and in the presence of small model errors. The proposed observer consists of three feedforward neural parts, two of which are MLP universal approximators, which are being trained off-line and the last one being a Linearly Parameterized Neural Network (LPNN), which is being updated on-line. The off-line trained parts are able to generate state estimations instantly and almost accurately, if there are not catastrophic errors in the mathematical model used. The contribution of the on-line adapting part is to compensate the remainder estimation error due to uncertain parameters... 

This paper deals with the problem of optimal large-angle single-axis maneuvers of a flexible spacecraft with simultaneous vibration suppression of elastic modes. A spacecraft model with a cylindrical hub and one flexible appendage and tip mass is considered. Gravity gradient torque is considered as a disturbance torque. Multilayer perceptron neural networks are used to design a Neural Optimal Controller (NOC) for this multivariable non-linear maneuver. For NOC training, an off-line training procedure based on backpropagation through time algorithm is developed to minimize the general quadratic cost function in forward and backward pass stages. The proposed controller is also applicable to... 

The Smith-Waterman algorithm, which is founded on a dynamic programming approach, serves as a precise tool for aligning biological sequences. Despite its utility, the algorithm grapples with computational complexity and resource demands. Various implementations across multi-core, GPU, and FPGA platforms have sought to expedite the algorithm, yet frequently encounter issues such as suboptimal speedup, heightened reliance on external memory resources, and an exclusive focus on the forward step of the algorithm. To tackle these challenges, this study introduces an architecture aimed at accelerating the SmithWaterman algorithm on FPGA platforms. Our architecture capitalizes on a pipeline... 

Two tetranuclear Au2Cu2 cluster complexes [Au2Cu2(μ-(PPh2)2py)2(μ-OH)](PF6)3, 2, and [Au2Cu2Cl2(μ-(PPh2)2 py)2](OTf)2, 4, have been prepared by the reactions of precursor complexes [Au2(μ-(PPh2)2py)2](OTf)2, 1, and [Cu2(μ-(PPh2)2py)2(μ-SMe2)(OTf)2], 3, with [Cu(NCCH3)4]PF6 and AuCl(SMe2), respectively. The crystal structures of complexes 2 and 4 were determined by X-ray crystallography, indicating a butterfly-shaped Au2Cu2 metal core for 2 and a planar-shaped Au2Cu2 metal core for 4. In complex 2, the Cu atoms occupy the edge-sharing bond, while in complex 4, alternating Au and Cu atoms occupy the tetragon vertices. The optical properties of the complexes were investigated by experimental... 

A 2-hued coloring of a graph G is a coloring such that, for every vertex v∈V(G) of degree at least 2, the neighbors of v receive at least two colors. The smallest integer k such that G has a 2-hued coloring with k colors is called the 2-hued chromatic number of G, and is denoted by χ2(G). In this paper, we will show that, if G is a regular graph, then χ2(G)-χ(G)≤2log 2(α(G))+3, and, if G is a graph and δ(G)<2, then χ2(G)-χ(G)≤1+4 Δ2δ-1⌉(1+log 2Δ(G)2Δ(G)-δ(G)(α(G))), and in the general case, if G is a graph, then χ2(G)-χ(G)≤2+min α′(G),α(G)+ω(G)2