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)

Street networks are crucial in shaping the quality of urban life. Through their impact on mobility and social interaction, they play a critical role in shaping how people move around the city and determine the connectivity, accessibility, safety, and convenience of different areas. Thus, it is essential to develop a systematic understanding of street networks to create livable, sustainable, accessible, and equitable cities. The aim of this study is to analyze and develop the role of street networks in shaping urban mobility, connectivity, and accessibility, and thereby enhance sustainable urban living by creating people-centric cities. Quantitative techniques and measures are employed to examine urban structure metrics to understand

The aim of this work is to develop an axi-symmetric two dimensional model based on a coupled simplified computational fluid dynamics (CFD) and Lagrangian method to predict the air flow patterns and drying of particles.  Then using this predictive tool to design more efficient spray dryers. The approach to this is to model what particles experience in the drying chamber with respect to air temperature and humidity. These histories can be obtained by combining the particles trajectories with the air temperature/humidity pattern in the spray dryer. Results are presented and discussed in terms of the air velocity, temperature, and humidity profiles within the chambers and compared for drying of a 42.5% solids solution in a spray chamber

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

High vehicular mobility causes frequent changes in the density of vehicles, discontinuity in inter-vehicle communication, and constraints for routing protocols in vehicular ad hoc networks (VANETs). The routing must avoid forwarding packets through segments with low network density and high scale of network disconnections that may result in packet loss, delays, and increased communication overhead in route recovery. Therefore, both traffic and segment status must be considered. This paper presents real-time intersection-based segment aware routing (RTISAR), an intersection-based segment aware algorithm for geographic routing in VANETs. This routing algorithm provides an optimal route for forwarding the data packets toward their destination