Background: This in vitro study compares a novel calcium-phosphate etchant paste to conventional 37% phosphoric acid gel for bonding metal and ceramic brackets by evaluating the shear bond strength, remnant adhesive and enamel damage following water storage, acid challenge and fatigue loading. Material and Methods: Metal and ceramic brackets were bonded to 240 extracted human premolars using two enamel conditioning protocols: conventional 37% phosphoric acid (PA) gel (control), and an acidic calcium-phosphate (CaP) paste. The CaP paste was prepared from β-tricalcium phosphate and monocalcium phosphate monohydrate powders mixed with 37% phosphoric acid solution, and the resulting phase was confirmed using FTIR. The bonded premolars were exp

BP algorithm is the most widely used supervised training algorithms for multi-layered feedforward neural net works. However, BP takes long time to converge and quite sensitive to the initial weights of a network. In this paper, a modified cuckoo search algorithm is used to get the optimal set of initial weights that will be used by BP algorithm. And changing the value of BP learning rate to improve the error convergence. The performance of the proposed hybrid algorithm is compared with the stan dard BP using simple data sets. The simulation result show that the proposed algorithm has improved the BP training in terms of quick convergence of the solution depending on the slope of the error graph.

The spectral response of the Si solar cell does not coincidence with the sun irradiance spectrum, so the efficiency of the Si solar cell is not high. To improve the Si solar cell one try to make use of most region of the sun spectrum by using dyes which absorb un useful wavelengths and radiate at useful region of spectrum (by stock shift). Fluorescence's dye is used as luminescent concentrator to increase the efficiency of the solar cell. The results show that the performance efficiency and out power for crystalline silicon solar cells are improved.

In this study, the dynamic modeling and step input tracking control of single flexible link is studied. The Lagrange-assumed modes approach is applied to get the dynamic model of a planner single link manipulator. A Step input tracking controller is suggested by utilizing the hybrid controller approach to overcome the problem of vibration of tip position through motion which is a characteristic of the flexible link system. The first controller is a modified version of the proportional-derivative (PD) rigid controller to track the hub position while sliding mode (SM) control is used for vibration damping. Also, a second controller (a fuzzy logic based proportional-integral plus derivative (PI+D) control scheme) is developed for both vibra

Machine learning models have recently provided great promise in diagnosis of several ophthalmic disorders, including keratoconus (KCN). Keratoconus, a noninflammatory ectatic corneal disorder characterized by progressive cornea thinning, is challenging to detect as signs may be subtle. Several machine learning models have been proposed to detect KCN, however most of the models are supervised and thus require large well-annotated data. This paper proposes a new unsupervised model to detect KCN, based on adapted flower pollination algorithm (FPA) and the k-means algorithm. We will evaluate the proposed models using corneal data collected from 5430 eyes at different stages of KCN severity (1520 healthy, 331 KCN1, 1319 KCN2, 1699 KCN3 a

Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. T

A simple straightforward mathematical method has been developed to cluster grid nodes on a boundary segment of an arbitrary geometry that can be fitted by a relevant polynomial. The method of solution is accomplished in two steps. At the first step, the length of the boundary segment is evaluated by using the mean value theorem, then grids are clustered as desired, using relevant linear clustering functions. At the second step, as the coordinates cell nodes have been computed and the incremental distance between each two nodes has been evaluated, the original coordinate of each node is then computed utilizing the same fitted polynomial with the mean value theorem but reversibly.

The method is utilized to predict