Objectives: Maxillofacial silicone is used to restore abnormalities due to congenital or acquired causes. However, the quality of silicone is far from ideal. This study was aimed at assessing the influence of the addition of cellulose nanofibers (CNFs; several nanometers wide and 2-5 micro m long) on the physical and mechanical characteristics of maxillofacial silicone elastomers. Methods: Two CNF weight percentages (0.5% and 1%) were tested, and 180 specimens were divided into one control and two experimental groups. Each group was subdivided into six subgroups. In each subgroup, ten specimens subjected to each of the following tests: tearing strength, Shore-A hardness, tensile strength, elongation percentage, surface roughness, and color

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

Zernike Moments has been popularly used in many shape-based image retrieval studies due to its powerful shape representation. However its strength and weaknesses have not been clearly highlighted in the previous studies. Thus, its powerful shape representation could not be fully utilized. In this paper, a method to fully capture the shape representation properties of Zernike Moments is implemented and tested on a single object for binary and grey level images. The proposed method works by determining the boundary of the shape object and then resizing the object shape to the boundary of the image. Three case studies were made. Case 1 is the Zernike Moments implementation on the original shape object image. In Case 2, the centroid of the s

Find cares studying ways in the development of industrial products and designs: the way the progressive development (how typical) and root development (jump design), was the aim of the research: to determine the effectiveness of the pattern and the jump in the development of designs and industrial products. After a process of analysis of a sample of research and two models of contemporary household electrical appliances, it was reached a set of findings and conclusions including:1-leaping designs changed a lot of entrenched perceptions of the user on how the product works and its use and the size and shape of the product, revealing him about the possibilities of sophisticated relationships with the product, while keeping the typical desi

This work, deals with Kumaraswamy distribution. Kumaraswamy (1976, 1978) showed well known probability distribution functions such as the normal, beta and log-normal but in (1980) Kumaraswamy developed a more general probability density function for double bounded random processes, which is known as Kumaraswamy’s distribution. Classical maximum likelihood and Bayes methods estimator are used to estimate the unknown shape parameter (b). Reliability function are obtained using symmetric loss functions by using three types of informative priors two single priors and one double prior. In addition, a comparison is made for the performance of these estimators with respect to the numerical solution which are found using expansion method. The

Support vector machine (SVM) is a popular supervised learning algorithm based on margin maximization. It has a high training cost and does not scale well to a large number of data points. We propose a multiresolution algorithm MRH-SVM that trains SVM on a hierarchical data aggregation structure, which also serves as a common data input to other learning algorithms. The proposed algorithm learns SVM models using high-level data aggregates and only visits data aggregates at more detailed levels where support vectors reside. In addition to performance improvements, the algorithm has advantages such as the ability to handle data streams and datasets with imbalanced classes. Experimental results show significant performance improvements in compa