Self-consistent non-linear physics based predictive model for the computation of THz-signal attenuation in fog with varying visibility in tropical climatic zone

Microsystem Technologies - Absorptive and dispersive properties of atmospheric hydrometeors, affect the propagation of millimetre-wave and submillimeter wave signals. In adverse weather condition,...     

HSWOA: An ensemble of hunger games search and whale optimization algorithm for global optimization

The search for food stimulated by hunger is a common phenomenon in the animal world. Mimicking the concept, recently, an optimization algorithm Hunger Games Search (HGS) has been proposed for global optimization. On the other side, the Whale Optimization Algorithm (WOA) is a commonly utilized nature-inspired algorithm portrayed by a straightforward construction with easy parameters imitating the hunting behavior of humpback whales. However, due to minimum exploration of the search space, WOA has a high chance of trapping into local solutions, and more exploitation leads it towards premature convergence. The concept of hunger from HGS is merged with the food searching techniques of the whale to lessen the inherent drawbacks of WOA. Two weights of HGS are adaptively designed for every whale using the respective hunger level for balancing search strategies. Performance verification of the proposed hunger search-based whale optimization algorithm (HSWOA) is done by comparing it with 10 state-of-the-art algorithms, including three very recently developed algorithms on 30 classical benchmark functions. Comparison with some basic algorithms, recently modified algorithms, and WOA variants is performed using IEEE CEC 2019 function set. Statistical performance of the proposed algorithm is verified with Friedman's test, boxplot analysis, and Nemenyi multiple comparison test. The operating speed of the algorithm is determined and tested with complexity analysis and convergence analysis. Finally, seven real-world engineering problems are solved and compared with a list of metaheuristic algorithms. Numerical and statistical performance comparison with state-of-the-art algorithms confirms the efficacy of the newly designed algorithm.     

Thin film evaporation in microchannels with interfacial slip

We investigate the role of interfacial slip on evaporation of a thin liquid film in a microfluidic channel. The effective slip mechanism is attributed to the formation of a depleted layer adhering to the substrate–fluid interface, either in a continuum or in a rarefied gas regime, as a consequence of intricate hydrophobic interactions in the narrow confinement. We appeal to the fundamental principles of conservation in relating the evaporation mechanisms with fluid flow and heat transfer over interfacial scales. We obtain semi-analytical solutions of the pertinent governing equations, with coupled heat and mass transfer boundary conditions at the liquid–vapor interface. We observe that a general consequence of interfacial slip is to elongate the liquid film, thereby leading to a film thickening effect. Thicker liquid films, in turn, result in lower heat transfer rates from the wall to liquid film, and consequently lower mass transfer rates from the liquid film to the vapor phase. Nevertheless, the total mass of evaporation (or equivalently, the net heat transfer) turns out to be higher in case of interfacial slip due to the longer film length. We also develop significant physical insights on the implications of the relative thickness of the depleted layer with reference to characteristic length scales of the microfluidic channel on the evaporation process, under combined influences of the capillary pressure, disjoining pressure, and the driving temperature differential for the interfacial transport.     

Selection of industrial robots using compromise ranking and outranking methods

Selection of a robot for a specific industrial application is one of the most challenging problems in real time manufacturing environment. It has become more and more complicated due to increase in complexity, advanced features and facilities that are continuously being incorporated into the robots by different manufacturers. At present, different types of industrial robots with diverse capabilities, features, facilities and specifications are available in the market. Manufacturing environment, product design, production system and cost involved are some of the most influencing factors that directly affect the robot selection decision. The decision maker needs to identify and select the best suited robot in order to achieve the desired output with minimum cost and specific application ability. This paper attempts to solve the robot selection problem using two most appropriate multi-criteria decision-making (MCDM) methods and compares their relative performance for a given industrial application. The first MCDM approach is ‘VIsekriterijumsko KOmpromisno Rangiranje’ (VIKOR), a compromise ranking method and the other one is ‘ELimination and Et Choice Translating REality’ (ELECTRE), an outranking method. Two real time examples are cited in order to demonstrate and validate the applicability and potentiality of both these MCDM methods. It is observed that the relative rankings of the alternative robots as obtained using these two MCDM methods match quite well with those as derived by the past researchers.     

GPU-based Acceleration of System-level Design Tasks

Many system-level design tasks (e.g., high-level timing analysis, hardware/software partitioning and design space exploration) involve computational kernels that are intractable (usually NP-hard). As a result, they involve high running times even for mid-sized problems. In this paper we explore the possibility of using commodity graphics processing units (GPUs) to accelerate such tasks that commonly arise in the electronic design automation (EDA) domain. We demonstrate this idea via two detailed case studies. The first explores the possibility of using GPUs to speedup standard schedulability analysis problems. The second proposes a GPU-based engine for a general hardware/software design space exploration problem. Not only do these problems commonly arise in the embedded systems domain, their computational kernels turn out to be variants of a combinatorial optimization problem—viz., the knapsack problem—that lies at the heart of several EDA applications. Experimental results show that our GPU-based implementations offer very attractive speedups for the computational kernels (up to 100×), and speedups of up to 17× for the full problem. In contrast to ASIC/FPGA-based accelerators—given that even low-end desktop and notebook computers are now equipped with GPUs—our solution involves no extra hardware cost. Although recent research has shown the benefits of using GPUs for a variety of non-graphics applications (e.g., in databases and bioinformatics), harnessing the parallelism of GPUs to accelerate problems from the EDA domain has not been sufficiently explored so far. We believe that our results and the generality of the core problem that we address will motivate researchers from this community to explore the possibility of using GPUs for a wider variety of problems from the EDA domain.     

An experimental analysis of electrostatically vibrated array of polysilicon cantilevers

Micromechanical cantilevers are one of the most fundamental and widely studied structures in micro-electromechanical systems. Dynamic response of such cantilevers has long been an interesting subject to researchers and different analytical and experimental approaches have been reported to determine it. Theoretical estimation of different damping mechanisms have been reported over years which are relevant particularly in studying the dynamics of the micro-mechanical structures. Most properties and functionalities of the MEMS devices are invariably dependant on the dynamic response of the devices, which in turn depends on the quality factor of the devices or in other words the overall damping present in the system. This paper presents a thorough experimental analysis of vibration characteristics of micro-mechanical cantilevers of different dimensions. Arrays of polysilicon micro-cantilevers of different dimensions have been designed and fabricated using surface micromachining process. The beams are resonated by electrostatic actuation and their vibration characteristics have been observed using Laser Doppler Vibrometer. Also a thorough analysis of modal behaviour of the beams is presented using analytical approach and finite element method based simulation. Different damping mechanisms have been critically reviewed and a semi-analytical estimation of the overall damping is presented. The results are compared with experimental values.     

Bayesian binary kernel probit model for microarray based cancer classification and gene selection

With the arrival of gene expression microarrays a new challenge has opened up for identification or classification of cancer tissues. Due to the large number of genes providing valuable information simultaneously compared to very few available tissue samples the cancer staging or classification becomes very tricky.In this paper we introduce a hierarchical Bayesian probit model for two class cancer classification. Instead of assuming a linear structure for the function that relates the gene expressions with the cancer types we only assume that the relationship is explained by an unknown function which belongs to an abstract functional space like the reproducing kernel Hilbert space. Our formulation automatically reduces the dimension of the problem from the large number of covariates or genes to a small sample size. We incorporate a Bayesian gene selection scheme with the automatic dimension reduction to adaptively select important genes and classify cancer types under an unified model. Our model is highly flexible in terms of explaining the relationship between the cancer types and gene expression measurements and picking up the differentially expressed genes. The proposed model is successfully tested on three simulated data sets and three publicly available leukemia cancer, colon cancer, and prostate cancer real life data sets.     

A layered algorithm for quantifier elimination from linear modular constraints

Linear equalities, disequalities and inequalities on fixed-width bit-vectors, collectively called linear modular constraints, form an important fragment of the theory of fixed-width bit-vectors. We present a practically efficient and bit-precise algorithm for quantifier elimination from conjunctions of linear modular constraints. Our algorithm uses a layered approach, whereby sound but incomplete and cheaper layers are invoked first, and expensive but complete layers are called only when required. We then extend this algorithm to work with arbitrary Boolean combinations of linear modular constraints as well. Experiments on an extensive set of benchmarks demonstrate that our techniques significantly outperform alternative quantifier elimination techniques based on bit-blasting and linear integer arithmetic.     

Multi-Objective Approach for Reconfiguration of Distribution Systems with Distributed Generations

This paper presents a fuzzy multi-objective based heuristic algorithm for network reconfiguration of distribution systems considering distributed generations (DGs). The objectives of reduction of real power loss, branch current carrying capacity limit, maximum and minimum voltage constraints, and feeder load balancing are considered for performance enhancement of the distribution system. Since these objectives are non-commensurable and difficult to solve simultaneously using conventional approaches, they are converted into fuzzy domain and a fuzzy multi-objective function is formulated. A sensitivity analysis based on voltage profile improvement and real power loss reduction is used for obtaining optimal locations of DGs and genetic algorithm is used for optimal sizing of DGs. The proposed reconfiguration algorithm is implemented in two stages, initially in the first stage without incorporating DGs and in the second stage incorporating DGs for obtaining an optimal distribution system network reconfiguration. The advantage of the proposed method is demonstrated through a seventy node four feeders and a sixteen node three feeders distribution systems.