ANT-colony based disjoint set assortment in wireless sensor networks

Wireless Networks - Wireless sensor network (WSN) consists of small sized devices containing different sensors to monitor physical, environmental and medical conditions during surveillance of...     

Synthesis and thermomechanical characterization of polyurethane elastomers extended with α,ω‐alkane diols

A series of polyurethane (PU) elastomers was prepared by the reaction of poly(?‐caprolactone) and 4,4′‐diphenylmethane diisocyanate, which was extended with a series of chain extenders (CEs) having 2–10 methylene units in their structure. The completion of the reaction was confirmed by Fourier transform infrared spectroscopy. The chemical structures of the synthesized PU samples were characterized with Fourier transform infrared, ¹H‐NMR, and ¹³C‐NMR spectroscopy, and the thermal properties were determined by thermogravimetric analysis, DSC, and dynamic mechanical thermal analysis techniques. The mechanical properties were also studied and are discussed. The thermogravimetric analysis and DSC analysis showed that CE length had a considerable effect on the thermal properties of the prepared samples. The dynamic mechanical thermal analysis and damping peaks were also affected by the number of methylene units in the CE length. The elastomer extended with 1,2‐ethane diol exhibited optimum thermal properties, whereas the elastomer based on 1,10‐decane diol displayed the worst thermal properties. Tensile strength and elongation at break decreased with increasing CE length, whereas hardness showed the opposite trend. The glass‐transition temperature moved toward lower temperatures with increasing CE length. The decrease in the glass‐transition temperature and tensile properties were interpreted in terms of decreasing hard segments and increasing chain flexibility. © 2008 Wiley Periodicals, Inc. J Appl Polym Sci, 2008     

Hero Wavelength Spectral Sampling

We present a spectral rendering technique that offers a compelling set of advantages over existing approaches. The key idea is to propagate energy along paths for a small, constant number of changing wavelengths. The first of these, the hero wavelength, is randomly sampled for each path, and all directional sampling is solely based on it. The additional wavelengths are placed at equal distances from the hero wavelength, so that all path wavelengths together always evenly cover the visible range. A related technique, spectral multiple importance sampling, was already introduced a few years ago. We propose a simplified and optimised version of this approach which is easier to implement, has good performance characteristics, and is actually more powerful than the original method. Our proposed method is also superior to techniques which use a static spectral representation, as it does not suffer from any inherent representation bias. We demonstrate the performance of our method in several application areas that are of critical importance for production work, such as fidelity of colour reproduction, sub‐surface scattering, dispersion and volumetric effects. We also discuss how to couple our proposed approach with several technologies that are important in current production systems, such as photon maps, bidirectional path tracing, environment maps, and participating media.     

Enhanced halftone-based secure and improved visual cryptography scheme for colour/binary Images

Visual Cryptography (VC) is gaining attraction during the past few years to secure the visual information in the transmission network. It enables the visual data i.e. handwritten notes, photos, printed text, etc. to encrypt in such a way that their decryption can be done through the human visual framework. Hence, no computational assistance is required for the decryption of the secret images they can be seen through naked eye. In this paper, a novel enhanced halftoning-based VC scheme is proposed that works for both binary and color images. Fake share is generated by the combination of random black and white pixels. The proposed algorithm consists of 3 stages i.e., detection, encryption, and decryption. Halftoning, Encryption, (2, 2) visual cryptography and the novel idea of fake share, make it even more secure and improved. As a result, it facilitates the original restored image to the authentic user, however, the one who enters the wrong password gets the combination of fake share with any real share. Both colored and black images can be processed with minimal capacity using the proposed scheme.

     

Robust face recognition against expressions and partial occlusions

Facial features under variant-expressions and partial occlusions could have degrading effect on overall face recognition performance. As a solution, we suggest that the contribution of these features on final classification should be determined. In order to represent facial features contribution according to their variations, we propose a feature selection process that describes facial features as local independent component analysis(ICA) features. These local features are acquired using locally lateral subspace(LLS) strategy.Then, through linear discriminant analysis(LDA) we investigate the intraclass and interclass representation of each local ICA feature and express each feature s contribution via a weighting process. Using these weights, we define the contribution of each feature at local classifier level. In order to recognize faces under single sample constraint, we implement LLS strategy on locally linear embedding(LLE) along with the proposed feature selection. Additionally, we highlight the efficiency of the implementation of LLS strategy. The overall accuracy achieved by our approach on datasets with different facial expressions and partial occlusions such as AR, JAFFE,FERET and CK+ is 90.70%. We present together in this paper survey results on face recognition performance and physiological feature selection performed by human subjects.     

Ferritin Protein Regulates the Degradation of Iron Oxide Nanoparticles

Proteins implicated in iron homeostasis are assumed to be also involved in the cellular processing of iron oxide nanoparticles. In this work, the role of an endogenous iron storage protein—namely the ferritin—is examined in the remediation and biodegradation of magnetic iron oxide nanoparticles. Previous in vivo studies suggest the intracellular transfer of the iron ions released during the degradation of nanoparticles to endogenous protein cages within lysosomal compartments. Here, the capacity of ferritin cages to accommodate and store the degradation products of nanoparticles is investigated in vitro in the physiological acidic environment of the lysosomes. Moreover, it is questioned whether ferritin proteins can play an active role in the degradation of the nanoparticles. The magnetic, colloidal, and structural follow‐up of iron oxide nanoparticles and proteins in lysosome‐like medium confirms the efficient remediation of potentially harmful iron ions generated by nanoparticles within ferritins. The presence of ferritins, however, delays the degradation of particles due to a complex colloidal behavior of the mixture in acidic medium. This study exemplifies the important implications of intracellular proteins in processes of degradation and metabolization of iron oxide nanoparticles.     

In situ trapped high-density single metal atoms within graphene: Iron-containing hybrids as representatives for efficient oxygen reduction

Nano Research - Atomically dispersed catalysts have attracted attention in energy conversion applications because their efficiency and chemoselectivity for special catalysis are superior to those...     

The Role of Deep Learning in Parking Space Identification andPredictionSystems

In today’s smart city transportation, traffic congestion is a vexing issue, and vehicles seeking parking spaces have been identified as one of the causes leading to approximately 40% of traffic congestion. Identifying parking spaces alone is insufficient because an identified available parking space may have been taken by another vehicle when it arrives, resulting in the driver’s frustration and aggravating traffic jams while searching for another parking space. This explains the need to predict the availability of parking spaces. Recently, deep learning (DL) has been shown to facilitate drivers to find parking spaces efficiently, leading to a promising performance enhancement in parking identification and prediction systems. However, no work reviews DL approaches applied to solve parking identification and prediction problems. Inspired by this gap, the purpose of this work is to investigate, highlight, and report on recent advances in DL approaches applied to predict and identify the availability of parking spaces. A taxonomy of DL-based parking identification and prediction systems is established as a methodology by classifying and categorizing existing literature, and by doing so, the salient and supportive features of different DL techniques for providing parking solutions are presented. Moreover, several open research challenges are outlined. This work identifies that there are various DL architectures, datasets, and performance measures used to address parking identification and prediction problems. Moreover, there are some open-source implementations available that can be used directly either to extend existing works or explore a new domain. This is the first short survey article that focuses on the use of DL-based techniques in parking identification and prediction systems for smart cities. This study concludes that although the deployment of DL in parking identification and prediction systems provides various benefits, the convergence of these two types of systems and DL brings about new issues that must be resolved in the near future.     

On a new class of analytic functions associated with conic domain

The aim of this paper is to generalize the conic domain defined by Kanas and Wisniowska, and define the class of functions which map the open unit disk E onto this generalized conic domain. A brief comparison between these conic domains is the main motivation of this paper. A correction is made in selecting the range interval of order of conic domain.