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.     

3D Hair sketching for real-time dynamic & key frame animations

Physically based simulation of human hair is a well studied and well known problem. But the “pure” physically based representation of hair (and other animation elements) is not the only concern of the animators, who want to “control” the creation and animation phases of the content. This paper describes a sketch-based tool, with which a user can both create hair models with different styling parameters and produce animations of these created hair models using physically and key frame-based techniques. The model creation and animation production tasks are all performed with direct manipulation techniques in real-time.     

CFAR processing with switching exponential smoothers for nonhomogeneous environments

Conventional constant false alarm rate (CFAR) methods use a fixed number of cells to estimate the background variance. For homogeneous environments, it is desirable to increase the number of cells, at the cost of increased computation and memory requirements, in order to improve the estimation performance. For nonhomogeneous environments, it is desirable to use less number of cells in order to reduce the number of false alarms around the clutter edges. In this work, we present a solution with two exponential smoothers (first order IIR filters) having different time-constants to leverage the conflicting requirements of homogeneous and nonhomogeneous environments. The system is designed to use the filter having the large time-constant in homogeneous environments and to promptly switch to the filter having the small time constant once a clutter edge is encountered. The main advantages of proposed Switching IIR CFAR method are computational simplicity, small memory requirement (in comparison to windowing based methods) and its good performance in homogeneous environments (due to the large time-constant smoother) and rapid adaptation to clutter edges (due to the small time-constant smoother).     

Exploring brain connectivity with two-dimensional neural maps

We introduce two-dimensional neural maps for exploring connectivity in the brain. For this, we create standard streamtube models from diffusion-weighted brain imaging data sets along with neural paths hierarchically projected into the plane. These planar neural maps combine desirable properties of low-dimensional representations, such as visual clarity and ease of tract-of-interest selection, with the anatomical familiarity of 3D brain models and planar sectional views. We distribute this type of visualization both in a traditional stand-alone interactive application and as a novel, lightweight web-accessible system. The web interface integrates precomputed neural-path representations into a geographical digital-maps framework with associated labels, metrics, statistics, and linkouts. Anecdotal and quantitative comparisons of the present method with a recently proposed 2D point representation suggest that our representation is more intuitive and easier to use and learn. Similarly, users are faster and more accurate in selecting bundles using the 2D path representation than the 2D point representation. Finally, expert feedback on the web interface suggests that it can be useful for collaboration as well as quick exploration of data.     

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.