Extraction of voltage harmonics using multi-layer perceptron neural network

This paper presents a harmonic extraction algorithm using artificial neural networks for Dynamic Voltage Restorers (DVRs). The suggested algorithm employs a feed forward Multi Layer Perceptron (MLP) Neural Network with error back propagation learning to effectively track and extract the 3rd and 5th voltage harmonics. For this purpose, two different MLP neural network structures are constructed and their performances compared. The effects of hidden layer, supervisors and learning rate are also presented. The proposed MLP Neural Network algorithm is trained and tested in MATLAB program environment. The results show that MLP neural network enable to extract each harmonic effectively.     

Metamodeling live sequence charts for code generation

This article presents a metamodeling study for Live Sequence Charts (LSCs) and Message Sequence Charts (MSCs) with an emphasis on code generation. The article discusses specifically the following points: the approach to building a metamodel for MSCs and LSCs, a metamodel extension from MSC to LSC, support for model-based code generation, and finally action model and domain-specific data model integration. The metamodel is formulated in metaGME, the metamodel language for the Generic Modeling Environment.

Photosensitized free radical polymerization using pyridinium salts

Summary The polymerization of methyl methacrylate (MMA), ethyl acrylate (EA), styrene (St) and 2-vinyl pyridine (VP) is initiated upon irradiation at >350 nm of dichloromethane solutions containing N-ethoxy-2-methylpyridinium hexafluorophosphate (EMP⁺PF₆ ^-) and anthracene or thioxanthone. Initiation mechanisms involving the formation of ethoxyl radicals during the decomposition of EMP⁺ ions via electron transfer are proposed.     

Detection of COVID-19 and its pulmonary stage using Bayesian hyperparameter optimization and deep feature selection methods

Since the first case of COVID-19 was reported in December 2019, many studies have been carried out on artificial intelligence for the rapid diagnosis of the disease to support health services. Therefore, in this study, we present a powerful approach to detect COVID-19 and COVID-19 findings from computed tomography images using pre-trained models using two different datasets. COVID-19, influenza A (H1N1) pneumonia, bacterial pneumonia and healthy lung image classes were used in the first dataset. Consolidation, crazy-paving pattern, ground-glass opacity, ground-glass opacity and consolidation, ground-glass opacity and nodule classes were used in the second dataset. The study consists of four steps. In the first two steps, distinctive features were extracted from the final layers of the pre-trained ShuffleNet, GoogLeNet and MobileNetV2 models trained with the datasets. In the next steps, the most relevant features were selected from the models using the Sine–Cosine optimization algorithm. Then, the hyperparameters of the Support Vector Machines were optimized with the Bayesian optimization algorithm and used to reclassify the feature subset that achieved the highest accuracy in the third step. The overall accuracy obtained for the first and second datasets is 99.46% and 99.82%, respectively. Finally, the performance of the results visualized with Occlusion Sensitivity Maps was compared with Gradient-weighted class activation mapping. The approach proposed in this paper outperformed other methods in detecting COVID-19 from multiclass viral pneumonia. Moreover, detecting the stages of COVID-19 in the lungs was an innovative and successful approach.     

Revisiting Slotted ALOHA: Density Adaptation in FANETs

Unmanned aerial vehicles have been widely used in many areas of life. They communicate with each other or infrastructure to provide ubiquitous coverage or assist cellular and sensor networks. They construct flying ad hoc networks. One of the most significant problems in such networks is communication among them over a shared medium. Using random channel access techniques is a useful solution. Another important problem is that the variations in the density of these networks impact the quality of service and introduce many challenges. This paper presents a novel density-aware technique for flying ad hoc networks. We propose Density-aware Slotted ALOHA Protocol that utilizes slotted ALOHA with a dynamic random access probability determined using network density in a distributed fashion. Compared to the literature, this paper concentrates on proposing a three-dimensional, easily traceable model and stabilize the channel utilization performance of slotted ALOHA with an optimized channel access probability to its maximum theoretical level, 1/e, where e is the Euler’s number. Monte-Carlo simulation results validate the proposed approach leveraging aggregate interference density estimator under the simple path-loss model. We compare our protocol with two existing protocols, which are Slotted ALOHA and Stabilized Slotted ALOHA. Comparison results show that the proposed protocol has 36.78% channel utilization performance; on the other hand, the other protocols have 24.74% and 30.32% channel utilization performances, respectively. Considering the stable results and accuracy, this model is practicable in highly dynamic networks even if the network is sparse or dense under higher mobility and reasonable non-uniform deployments.

     

Genetic algorithm based approaches to solve the order batching problem and a case study in a distribution center

Journal of Intelligent Manufacturing - The order batching problem is a combinatorial optimization problem that arises in the warehouse order picking process. In the order batching problem, the aim...     

Investigation on replication of microfluidic channels by hot embossing

In this study, effects of embossing temperature, time, and force on production of a microfluidic device were investigated. Polymethyl methacrylate (PMMA) substrates were hot embossed by using a micromilled aluminum mold. The process parameters were altered to observe the variation of replication rate in width and depth as well as symmetry of the replicated microfluidic channels. Analysis of variance (ANOVA) on the experimental results indicated that embossing temperature was the most important process parameter, whereas embossing time and force have less impact. One distinguishing aspect of this study is that, the channels were observed to be skewed to either side of the channel depending on the location of the protrusions on the mold. The mechanism of the skewness was investigated by finite element analysis and discussed in detail. Results showed that the skewness depends on the flow characteristics of the material and could be reduced by increasing the embossing temperature. The best replication rates were obtained at parameter settings of 115°C, 10?kN, and 8?min for the molds with minimum 56?µm wide features of 120?µm depth. We also showed that the fabricated channels could be successfully sealed by solvent-assisted thermo-compressive bonding at 85°C under 5.5?kN force.     

Stochastic two-sided U-type assembly line balancing: a genetic algorithm approach

In this paper, a novel stochastic two-sided U-type assembly line balancing (STUALB) procedure, an algorithm based on the genetic algorithm and a heuristic priority rule-based procedure to solve STUALB problem are proposed. With this new proposed assembly line design, all advantages of both two-sided assembly lines and U-type assembly lines are combined. Due to the variability of the real-life conditions, stochastic task times are also considered in the study. The proposed approach aims to minimise the number of positions (i.e. the U-type assembly line length) as the primary objective and to minimise the number of stations (i.e. the number of operators) as a secondary objective for a given cycle time. An example problem is solved to illustrate the proposed approach. In order to evaluate the efficiency of the proposed algorithm, test problems taken from the literature are used. The experimental results show that the proposed approach performs well.     

Coping with production time variability via dynamic lead-time quotation

In this paper, we propose two dynamic lead-time quotation policies in an M/GI/1 type make-to-stock queueing system serving lead-time sensitive customers with a single type of product. Incorporating non-exponential service times in an exact method for make-to-stock queues is usually deemed difficult. Our analysis of the proposed policies is exact and requires the numerical inversion of the Laplace transform of the sojourn time of an order to be placed. The first policy assures that the long-run probability of delivering the product within the quoted lead-time is the same for all backlogged customers. The second policy is a refinement of the first which improves the profitability if customers are oversensitive to even short delays in delivery. Numerical results show that both policies perform close to the optimal policy that was characterized only for exponential service times. The new insight gained is that the worsening impact of the production time variability, which is felt significantly in systems accepting all customers by quoting zero lead times, decreases when dynamic lead-time quotation policies are employed.