Ferromagnetic nano model study for the peristaltic flow in a plumb duct with permeable walls

Microsystem Technologies - The purpose of the present enquiry is to analyse the mechanics of an incompressible fluid, with water as base fluid, through a radially symmetric plumb duct with...     

A fog-based security framework for intelligent traffic light control system

Multimedia Tools and Applications - The world is facing many problems including that of traffic congestion. To highlight the issue of traffic congestion worldwide specially in urban areas and to...     

A Novel DUF569 Gene Is a Positive Regulator of the Drought Stress Response in Arabidopsis

In the last two decades, global environmental change has increased abiotic stress on plants and severely affected crops. For example, drought stress is a serious abiotic stress that rapidly and substantially alters the morphological, physiological, and molecular responses of plants. In Arabidopsis, several drought-responsive genes have been identified; however, the underlying molecular mechanism of drought tolerance in plants remains largely unclear. Here, we report that the “domain of unknown function” novel gene DUF569 (AT1G69890) positively regulates drought stress in Arabidopsis. The Arabidopsis loss-of-function mutant atduf569 showed significant sensitivity to drought stress, i.e., severe wilting at the rosette-leaf stage after water was withheld for 3 days. Importantly, the mutant plant did not recover after rewatering, unlike wild-type (WT) plants. In addition, atduf569 plants showed significantly lower abscisic acid accumulation under optimal and drought-stress conditions, as well as significantly higher electrolyte leakage when compared with WT Col-0 plants. Spectrophotometric analyses also indicated a significantly lower accumulation of polyphenols, flavonoids, carotenoids, and chlorophylls in atduf569 mutant plants. Overall, our results suggest that novel DUF569 is a positive regulator of the response to drought in Arabidopsis.     

Modeling and solving mixed-model assembly line balancing problem with setups. Part I: A mixed integer linear programming model

This paper is the first one of the two papers entitled “modeling and solving mixed-model assembly line balancing problem with setups”, which has the aim of developing the mathematical programming formulation of the problem and solving it with a hybrid meta-heuristic approach. In this current part, a mixed-integer linear mathematical programming (MILP) model for mixed-model assembly line balancing problem with setups is developed. The proposed MILP model considers some particular features of the real world problems such as parallel workstations, zoning constraints, and sequence dependent setup times between tasks, which is an actual framework in assembly line balancing problems. The main endeavor of Part-I is to formulate the sequence dependent setup times between tasks in type-I mixed-model assembly line balancing problem. The proposed model considers the setups between the tasks of the same model and the setups because of the model switches in any workstation. The capability of our MILP is tested through a set of computational experiments. Part-II tackles the problem with a multiple colony hybrid bees algorithm. A set of computational experiments is also carried out for the proposed approach in Part-II.     

Toward an efficient and scalable feature selection approach for internet traffic classification

There is significant interest in the network management and industrial security community about the need to identify the “best” and most relevant features for network traffic in order to properly characterize user behaviour and predict future traffic. The ability to eliminate redundant features is an important Machine Learning (ML) task because it helps to identify the best features in order to improve the classification accuracy as well as to reduce the computational complexity related to the construction of the classifier. In practice, feature selection (FS) techniques can be used as a preprocessing step to eliminate irrelevant features and as a knowledge discovery tool to reveal the “best” features in many soft computing applications. In this paper, we investigate the advantages and disadvantages of such FS techniques with new proposed metrics (namely goodness, stability and similarity). We continue our efforts toward developing an integrated FS technique that is built on the key strengths of existing FS techniques. A novel way is proposed to identify efficiently and accurately the “best” features by first combining the results of some well-known FS techniques to find consistent features, and then use the proposed concept of support to select a smallest set of features and cover data optimality. The empirical study over ten high-dimensional network traffic data sets demonstrates significant gain in accuracy and improved run-time performance of a classifier compared to individual results produced by some well-known FS techniques.     

Rule extraction from artificial neural networks to discover causes of quality defects in fabric production

In this paper, a novel classification rule extraction algorithm which has been recently proposed by authors is employed to determine the causes of quality defects in a fabric production facility in terms of predetermined parameters like machine type, warp type etc. The proposed rule extraction algorithm works on the trained artificial neural networks in order to discover the hidden information which is available in the form of connection weights in them. The proposed algorithm is mainly based on a swarm intelligence metaheuristic which is known as Touring Ant Colony Optimization (TACO). The algorithm has a hierarchical structure with two levels. In the first level, a multilayer perceptron type neural network is trained and its weights are extracted. After obtaining the weights, in the second level, the TACO-based algorithm is applied to extract classification rules. The main purpose of the present work is to determine and analyze the most effective parameters on the quality defects in fabric production. The parameters and their levels which give the best quality results are tried to be discovered and evaluated by making use of the proposed algorithm. It is also aimed to compare the accuracy of proposed algorithm with several other rule-based algorithms in order to present its competitiveness.     

An Analytical Approach to the Concept of Counter-UA Operations (CUAOPS)

Unmanned Aircraft (UA) have become an integral part of the present-day joint air operations. UA have potential to be employed across the full spectrum of Air Force functions. On the other hand, UA technology could be a subject of an asymmetric use by state actors in high or low density conflict, and/or by non-state actors in many ways including terrorism, drug smuggling, and limited attack with unconventional payloads i.e. biological or chemical agents. Therefore countering the threat associated with the hostile UA use could be necessary in the future. First part of the research revealed that UA can be a threat in the future. In the second part of the research, the SWOT (Strengths-Weaknesses-Opportunities-Threats) analysis supplemented with the Tree analysis (SWOT+Tree) provided a broader look for investigating the factors related to hostile UA use analytically. In literature, there is little information about the concepts for CUAOPS. The final goal of the paper is to find possible solutions and means for a better understanding of the nature of CUAOPS.     

A changing range genetic algorithm

During the last decade various methods have been proposed to handle linear and non‐linear constraints by using genetic algorithms to solve problems of numerical optimization. The key to success lies in focusing the search space towards a feasible region where a global optimum is located. This study investigates an approach that adaptively shifts and shrinks the size of the search space to the feasible region; it uses two strategies for estimating a point of attraction. Several test cases demonstrate the ability of this approach to reach effectively and accurately the global optimum with a low resolution of the binary representation scheme and without additional computational efforts. Copyright © 2004 John Wiley & Sons, Ltd.