Background: The present study was conducted to evaluate the effects of different bleaching methods on the shear bond strength of orthodontic Sapphire brackets bonded to human premolars teeth using light cured composite resin and to determine the predominant site of bond failure. Materials and Methods: Thirty freshly extracted human premolars were selected and randomly divided into three groups (10 per group). These groups are: control (unbleached) group, hydrogen peroxide group (HP) 37.5% ; which is the in- office bleaching method group, carbamide peroxide group (CP) 16%; which is the at- home bleaching method group. After bleaching process was performed, all the teeth stored in distilled water in a sealed container at room temperature for

background: human epidermal growth factor receptor-2 (her2/neu) is related to growth factor receptors with alkaline kinase activity and it is regarded as important prognostic and therapeutic factor that can depended on in breast cancer therapy. HER2/neu expression by immunohistochemistry (IHC) is submitted to a great in terob server inconsistency. Subsequently additional confirmatory tests for assessment of gene alterations and amplification status are needed for patients with early or metastatic breast cancer. In situ hybridization techniques and specifically Chromogenic in situ hybridization (CISH) was arise as a practical, cost-effective, and alternative to fluorescent in situ hybridization in testing for gene alterationAims of the study

 Data Driven Requirement Engineering (DDRE) represents a vision for a shift from the static traditional methods of doing requirements engineering to dynamic data-driven user-centered methods. Data available and the increasingly complex requirements of system software whose functions can adapt to changing needs to gain the trust of its users, an approach is needed in a continuous software engineering process. This need drives the emergence of new challenges in the discipline of requirements engineering to meet the required changes. The problem in this study was the method in data discrepancies which resulted in the needs elicitation process being hampered and in the end software development found discrepancies and could not meet the need

Recently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results

In this paper, the construction of Hermite wavelets functions and their operational matrix of integration is presented. The Hermite wavelets method is applied to solve nth order Volterra integro diferential equations (VIDE) by expanding the unknown functions, as series in terms of Hermite wavelets with unknown coefficients. Finally, two examples are given

Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to