The design of multiple feedback topology Chebyshev low-pass active filter with average differential evolution algorithm

Neural Computing and Applications - This study presents the design of a tenth-order multiple feedback Chebyshev low-pass filter (MF-C-LPF). Component selection and gain calculation of filters are...     

Tungsten(VI) oxide supported rhodium nanoparticles: Highly active catalysts in hydrogen generation from ammonia borane

Herein, we report the use of tungsten(VI) oxide (WO₃) as support for Rh⁰ nanoparticles. The resulting Rh⁰/WO₃ nanoparticles are highly active and stable catalysts in H₂ generation from the hydrolysis of ammonia borane (AB). We present the results of our investigation on the particle size distribution, catalytic activity and stability of Rh⁰/WO₃ catalysts with 0.5%, 1.0%, 2.0% wt. Rh loadings in the hydrolysis reaction. The results reveal that Rh⁰/WO₃ (0.5% wt. Rh) is very promising catalyst providing a turnover frequency of 749 min^?1 in releasing 3.0 equivalent H₂ per mole of AB from the hydrolysis at 25.0 °C. The high catalytic activity of Rh⁰/WO₃ catalyst is attributed to the reducible nature of support. The report covers the results of kinetics study as well as comparative investigation of activity, recyclability, and reusability of colloidal(0) nanoparticles and Rh⁰/WO₃ (0.5 % wt. Rh) catalyst in the hydrolysis reaction.     

Retrospective adaptive prefetching for interactive Web GIS applications

A major task of a Web GIS (Geographic Information Systems) system is to transfer map data to client applications over the Internet, which may be too costly. To improve this inefficient process, various solutions are available. Caching the responses of the requests on the client side is the most commonly implemented solution. However, this method may not be adequate by itself. Besides caching the responses, predicting the next possible requests from a client and updating the cache with responses for those requests together provide a remarkable performance improvement. This procedure is called “prefetching” and makes caching mechanisms more effective and efficient. This paper proposes an efficient prefetching algorithm called Retrospective Adaptive Prefetch (RAP), which is constructed over a heuristic method that considers the former actions of a given user. The algorithm reduces the user-perceived response time and improves user navigation efficiency. Additionally, it adjusts the cache size automatically, based on the memory size of the client’s machine. RAP is compared with four other prefetching algorithms. The experiments show that RAP provides better performance enhancements than the other methods.     

Optimum topology design of various geometrically nonlinear latticed domes using improved harmony search method

Domes are elegant and economical structures used in covering large areas. They are built in various forms. According to their form, they are given special names such as lamella, network, and geodesic domes. In this paper, optimum topological design algorithm is presented that determines the optimum number of rings, the optimum height of crown and tubular section designations for the member groups of these domes. The design algorithm developed has a routine that generates the data required for the geometry of these domes automatically. The minimum weight of each dome is taken as the objective function. The design constraints are implemented according to the provision of LRFD-AISC (Load and Resistance Factor Design–American Institute of Steel Constitution). The optimum topological design problem that considers these constraints turns out to be discrete programming problem. Improved harmony search algorithm is suggested to determine its optimum solution. The design algorithm also considers the geometric nonlinearity of these dome structures. Design examples are presented to demonstrate the effectiveness and robustness of the design optimization algorithm developed.     

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...     

Bicriteria robotic operation allocation in a flexible manufacturing cell

Consider a manufacturing cell of two identical CNC machines and a material handling robot. Identical parts requesting the completion of a number of operations are to be produced in a cyclic scheduling environment through a flow shop type setting. The existing studies in the literature overlook the flexibility of the CNC machines by assuming that both the allocation of the operations to the machines as well as their respective processing times are fixed. Consequently, the provided results may be either suboptimal or valid under unnecessarily limiting assumptions for a flexible manufacturing cell. The allocations of the operations to the two machines and the processing time of an operation on a machine can be changed by altering the machining conditions of that machine such as the speed and the feed rate in a CNC turning machine. Such flexibilities constitute the point of origin of the current study. The allocation of the operations to the machines and the machining conditions of the machines affect the processing times which, in turn, affect the cycle time. On the other hand, the machining conditions also affect the manufacturing cost. This study is the first to consider a bicriteria model which determines the allocation of the operations to the machines, the processing times of the operations on the machines, and the robot move sequence that jointly minimize the cycle time and the total manufacturing cost. We provide algorithms for the two 1-unit cycles and test their efficiency in terms of the solution quality and the computation time by a wide range of experiments on varying design parameters.     

Authentication and authorization infrastructure for Grids—issues,technologies, trends and experiences

Authentication and authorization for Grids is a challenging security issue. In this paper, key issues for the establishment of Grid authentication and authorization infrastructures are discussed, and an overview of major Grid authentication and authorization technologies is presented. Related to this, recent developments in Grid authentication and authorization infrastructures suggest adoption of the Shibboleth technology which offers advantages in terms of usability, confidentiality, scalability and manageability. When combined with advanced authorization technologies, Shibboleth-based authentication and authorization infrastructures provide role-based, fine-grained authorization. We share our experience in constructing a Shibboleth-based authentication and authorization infrastructure and believe that such infrastructure provides a promising solution for the security of many application domains.     

Grammar constraints

With the introduction of the Regular Membership Constraint, a new line of research has opened where constraints are based on formal languages. This paper is taking the next step, namely to investigate constraints based on grammars higher up in the Chomsky hierarchy. We devise a time- and space-efficient incremental arc-consistency algorithm for context-free grammars, investigate when logic combinations of grammar constraints are tractable, show how to exploit non-constant size grammars and reorderings of languages, and study where the boundaries run between regular, context-free, and context-sensitive grammar filtering.     

A tabu-search based heuristic for the hub covering problem over incomplete hub networks

Hub location problems deal with finding the location of hub facilities and with the allocation of demand nodes to these located hub facilities. In this paper, we study the single allocation hub covering problem over incomplete hub networks and propose an integer programming formulation to this end. The aim of our model is to find the location of hubs, the hub links to be established between the located hubs, and the allocation of non-hub nodes to the located hub nodes such that the travel time between any origin–destination pair is within a given time bound. We present an efficient heuristic based on tabu search and test the performance of our heuristic on the CAB data set and on the Turkish network.     

Pitch angle control in wind turbines above the rated wind speed by multi-layer perceptron and radial basis function neural networks

In wind energy conversion systems, one of the operational problems is the changeability and discontinuity of wind. In most cases, wind speed can fluctuate rapidly. Hence, quality of produced energy becomes an important problem in wind energy conversion plants. Several control techniques have been applied to improve the quality of power generated from wind turbines. Pitch control is the most efficient and popular power control method, especially for variable-speed wind turbines. It is a useful method for power regulation above the rated wind speed. This paper proposes an artificial neural network-based pitch angle controller for wind turbines. In the simulations, a variable-speed wind turbine is modeled, and its operation is observed by using two types of artificial neural network controllers. These are multi-layer perceptrons with back propagation learning algorithm and radial basis function network. It is shown that the power output was successfully regulated during high wind speed, and as a result overloading or outage of the wind turbine was prevented.