Flexible poly(styrene-ethylene-butadiene-styrene) hybrid nanofibers for bioengineering and water filtration applications

Among the thermoplastic elastomers that play important roles in the polymer industry due to their superior properties, styrene-based species and polyurethane block copolymers are of great interest. Poly(styrene-ethylene-butadiene-styrene) (SEBS) as a triblock copolymer seems to have the potential to meet many demands in different applications due to various industrial requirements where durability, biocompatibility, breaking elongation, and interfacial adhesion are important. In this study, the SEBS triblock copolymer was functionalized with natural (Satureja hortensis, SH) and synthetic (nanopowder, TiO₂) agents to obtain composite nanofibers by electrospinning and electrospraying methods for use in biomedical and water filtration applications. The results were compared with thermoplastic polyurethane (TPU) composite nanofibers, which are commonly used in these fields. Here, functionalized SEBS nanofibers exhibited antibacterial effect while at the same time improving cell viability. In addition, because of successful water filtration by using the SEBS composite nanofibers, the material may have a good potential to be used comparably to TPU for the application.     

Isometric Texture Mapping for Free-form Surfaces

Texture mapping is a frequently exploited technique in computer graphics aimed at the emulation of high-resolution details in surfaces. In this paper we present a distance-ratios preservation method for bivariate raster texture mapping to free-form surfaces in an arbitrarily precise manner. The proposed method reduces the original general problem of computing the inverse of a three-dimensional parametric surface mapping into a problem of two-dimensional image warping. Several examples that demonstrate the proposed approach are also provided.     

Adaptive,incentive and scalable dynamic tree overlay for P2P live video streaming

In this paper, we propose a new multicast tree framework to be used in peer-to-peer (P2P) live video streaming systems. The proposed system, adapts the tree links under high peer churn and runs in a totally distributed manner. In order to provide this dynamism and seamless streaming at the same time, we propose a cross layer design involving scalable video codec, backup parents and hierarchical clusters. The performance of the system is measured in real world environment PlanetLab that has nodes distributed all over the world. The experiments show that the proposed system provides high quality of experience (QoE) in terms of Peak Signal to Noise Ratio (PSNR), playback delay and duration of pauses. The proposed system also provides incentive mechanism to its users.     

Selective determination of urea using urease immobilized on ZnO nanowires

Well-aligned zinc oxide (ZnO) nanowire arrays were fabricated on gold-coated plastic substrates using a low-temperature aqueous chemical growth (ACG) method. The ZnO nanowire arrays with 50–130 nm diameters and ∼1 μm in lengths were used in an enzyme-based urea sensor through immobilization of the enzyme urease that was found to be sensitive to urea concentrations from 0.1 mM to 100 mM. Two linear sensitivity regions were observed when the electrochemical responses (EMF) of the sensors were plotted vs. the logarithmic concentration range of urea from 0.1 mM to 100 mM. The proposed sensor showed a sensitivity of 52.8 mV/decade for 0.1–40 mM urea and a fast response time less than 4 s was achieved with good selectivity, reproducibility and negligible response to common interferents such as ascorbic acid and uric acid, glucose, K⁺ and Na⁺ ions.     

Wire antennas optimized using genetic algorithm

In this work, wire antennas are designed to jam GSM frequencies using genetic algorithms. These antennas are designed to block communication at 3-band GSM frequencies. They are planned to be mounted on a vehicle and therefore are modeled on a ground plane. Jammer antennas designed in this work are composed of wires, placed on two square dielectric frames, perpendicular to each other. Genetic optimization routines are developed on MATLAB environment for the designs carried out in this work. Electromagnetic simulation program called SuperNEC, which analyses antennas by the method of moments, is used to determine the antenna performances and is called by the developed GA routines. The purpose of the antenna optimization is to obtain low VSWR values and omni-directional radiation pattern near ground at θ = [70° 80° 90°] planes at all GSM frequencies, since the targets will be near ground for this application. Original and interesting antenna designs are obtained as the result of genetic optimization, and are presented in the paper.     

GENOTOXICITY IN CHIRONOMUS KIIENSIS (CHIRONOMIDAE: DIPTERA) AFTER EXPOSURE TO POLLUTED SEDIMENTS FROM RIVERS OF NORTH PENINSULAR MALAYSIA: IMPLICATION FOR ECOTOXICOLOGICAL MONITORING

Rapid industrialization and urbanization has led to increasing input of chemical contaminants into the aquatic environment of Malaysia. Despite the threat civilization poses to the biota, there are still very few relevant studies on ecotoxicological testing of river ecosystems. To overcome this knowledge gap, we examined lethal and genotoxic effects of sediments from different rivers of the northern Malaysia against Chironomus kiiensis, a group well represented in the aquatic fauna of this region. We exposed the larvae to sediments from Selama River (SR), Permatang Rawa River (PRR) and Kilang Ubi River (KUR) at various durations (0, 6, 12, 24 and 48 h). The larval mortality was monitored, whereas DNA damage in survivors' cells was determined using the comet assay. Pollution level indexed by the amounts of heavy metals and other organic contaminants in the sediment showed progressive increases from SR to PRR to KUR. Highly polluted sediments (PRR to KUR) were detrimental to C. kiiensis larvae, most of which did not survive following exposure for long periods. DNA analyses revealed greater damages in nuclei derived from larvae maintained on polluted sediments, in particular, those from KUR. The effects on the genomic material of C. kiiensis larvae occurred in a time‐dependent manner, with damage level increasing as exposure time progressed. Our results highlight the genotoxic properties of polluted sediments. More importantly, this study showed that C. kiiensis larvae could respond to different levels of pollution with respect to exposure time. It is concluded that C. kiiensis larvae is a potential candidate for river ecotoxicological monitoring. Copyright © 2012 John Wiley & Sons, Ltd.     

Graph-based shape indexing

Graphs have become growingly important in representing shapes in computer vision. Given a query graph, it is essential to retrieve similar database graphs efficiently from a large database. In this paper, we present a graph-based indexing technique which overcomes significant drawbacks of the previous work (Demirci et al. in Comput Vis Image Underst 110(3):312–325, 2008) using a recently developed theorem from the domain of matrix analysis. Our technique starts by representing the topological structure of a graph in a vector space. As done in the previous work, the topological structure of a graph is constructed using its Laplacian spectra. However, unlike the previous approach, which represents all sugraphs of a database graph in the vector space to account for local similarity, a database graph in the proposed framework is represented as a single vector. By performing a range search around the query, the proposed indexing technique returns a set with both partial and global similarity. Empirical evaluation of the algorithm on an extensive set of retrieval trials including a comparison with the previous approach in both 2D and 3D demonstrates the effectiveness, efficiency, and robustness of the overall approach.     

A new external sorting algorithm with no additional disk space

This paper is concerned with an external sorting algorithm with no additional disk space. The proposed algorithm is a hybrid one that uses Quicksort and special merging process in two distinct phases. The algorithm excels in sorting a huge file, which is many times larger than the available memory of the computer. This algorithm creates no extra backup file for manipulating huge records. For this, the algorithm saves huge disk space, which is needed to hold the large file. Also our algorithm switches to special merging process after the first phase that uses Quicksort. This reduces the time complexity and makes the algorithm faster.