Microfluidic devices provide distinct benefits for developing effective drug assays and screening. The microfluidic platforms may provide a faster and less expensive alternative. Fluids are contained in devices with considerable micrometer-scale dimensions. Owing to this tight restriction, drug assay quantities are minute (milliliters to femtoliters). In this research, a microfluidic chip consisting of micro-channels carved on substrate materials built using an Acrylic (Polymethyl Methacrylate, PMMA) chip was designed using a Carbon Dioxide (CO2) laser machine. The CO2 parameters influence the chip’s width, depth, and roughness. To have a regular channel surface, and low roughness, the laser power (60 W), with scanning speed (250 m/s)

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

Abstract Rasha Hameid Jehad Baghdad University Background: The high reactivity of hydrogen peroxide used in bleaching agents have raised important questions on their potential adverse effects on physical properties of restorative materials. The purpose of this in vitro study was to evaluate the effect of in-office bleaching agents on the microhardness of a new Silorane-based restorative material in comparison to methacrylate-based restorative material. Materials and method: Forty specimens of Filtek™ P90 (3M ESPE,USA) and Filtek™ Supreme XT (3M ESPE, USA) of (8mm diameter and 3m height) were prepared. All specimens were polished with Sof-Lex disks (3M ESPE, USA). All samples were rinsed and stored in incubator 37˚C for 24 ho

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

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonic

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul