Gingival crevicular fluid (GCF) may reflect the events associated with orthodontic tooth movement. Attempts have been conducted to identify biomarkers reflecting optimum orthodontic force, unwanted sequallea (i.e. root resorption) and accelerated tooth movement. The aim of the present study is to find out a standardized GCF collection, storage and total protein extraction method from apparently healthy gingival sites with orthodontics that is compatible with further high-throughput proteomics. Eighteen patients who required extractions of both maxillary first premolars were recruited in this study. These teeth were randomly assigned to either heavy (225g) or light force (25g), and their site specific GCF was collected at baseline and after 1hr, 1day, 7days, 14days, 21days and 28days post force application. Periostrips were used for GCF collection and subsequent phosphate buffered saline (PBS) was used for immediate protein elution with centrifugal speed of 10000rpm for 5min and stored at -80°C. Protein concentration was estimated using Bradford colorimetric assay. Sodium dodecyl sulphate polyacrylamide gel electrophoresis (SDS-PAGE) was carried out to resolve the purity of proteins in the collected samples and the method of collection was validated by western immuno-blotting of alpha amylase salivary enzyme. The current collection, storage and protein extraction protocol showed the best protein recovery and purity with validated collection free of salivary contamination. In conclusion, tiny GCF volume from healthy sites and evaporation issues of such promising non-invasive fluid motivate us to investigate a standardized protocol enabling optimal preservation of GCF sample and the currently followed protocol may serve as a reference for future proteomic studies searching for GCF biomarkers in diagnosing and monitoring orthodontic tooth movement.
In this paper, the goal of proposed method is to protect data against different types of attacks by unauthorized parties. The basic idea of proposed method is generating a private key from a specific features of digital color image such as color (Red, Green and Blue); the generating process of private key from colors of digital color image performed via the computing process of color frequencies for blue color of an image then computing the maximum frequency of blue color, multiplying it by its number and adding process will performed to produce a generated key. After that the private key is generated, must be converting it into the binary representation form. The generated key is extracted from blue color of keyed image then we selects a c
... Show MoreMost of the medical datasets suffer from missing data, due to the expense of some tests or human faults while recording these tests. This issue affects the performance of the machine learning models because the values of some features will be missing. Therefore, there is a need for a specific type of methods for imputing these missing data. In this research, the salp swarm algorithm (SSA) is used for generating and imputing the missing values in the pain in my ass (also known Pima) Indian diabetes disease (PIDD) dataset, the proposed algorithm is called (ISSA). The obtained results showed that the classification performance of three different classifiers which are support vector machine (SVM), K-nearest neighbour (KNN), and Naïve B
... Show MoreThis paper presents a new algorithm in an important research field which is the semantic word similarity estimation. A new feature-based algorithm is proposed for measuring the word semantic similarity for the Arabic language. It is a highly systematic language where its words exhibit elegant and rigorous logic. The score of sematic similarity between two Arabic words is calculated as a function of their common and total taxonomical features. An Arabic knowledge source is employed for extracting the taxonomical features as a set of all concepts that subsumed the concepts containing the compared words. The previously developed Arabic word benchmark datasets are used for optimizing and evaluating the proposed algorithm. In this paper,
... Show More