Sharif Digital Repository

Although Face detection is not a recent activity in the field of image processing, it is still an open area for research. The greatest step in this field is the work reported by Viola and the recent analogous one is proposed by Huang et al. Both of them use similar features and also similar training process. The former is just for detecting upright faces, but the latter can detect multi-view faces in still grayscale images using new features called 'sparse feature'. Finding these features is very time consuming and inefficient by proposed methods. Here, we propose a new approach for finding sparse features using a genetic algorithm system. This method requires less computational cost and... 

Network Coding (NC) is an emerging technique that helps wireless networks to have higher throughput and better energy efficiency. In this paper, a novel network coding-aware routing (S-NC) which uses NC to improve reliability and robustness in unreliable WSNs is proposed. It is based on a structure-free routing algorithm as the underlying routing engine which employs neighbor queue length to increase coding opportunity; while exploiting a spatial coding method to control the amount of redundancy. To the best of our knowledge, this is the first study on the topic of network codingaware routing in Wsns. Simulation results in Tossim demonstrate that S-NC significantly improves the performance... 

The interpretation of a vast number of cosmological observations in the framework of FRW models suggests that the major part of the energy density of the universe is in form of dark energy with still unknown physical nature. In some models for dark energy, which are motivated by particle physics theory, the equation of state and the contribution of dark energy to the energy density of the universe can be variable. Here we study structure formation in a parameterized dark energy model, and compare its predictions with recent observational data, from the Supernova Ia gold sample and the parameters of large scale structure determined by the 2-degree Field Galaxy Redshift Survey (2dFGRS), and... 

Graphene oxide (GO) has never been considered as a Magnetic Resonance Imaging (MRI) contrast agent since it was conceived as a diamagnetic material. There is a possibility that introduction of structural defects or manipulation of oxygen functionalities in GO change its magnetic response and provided a chance for GO to be a contrast agent for MRI. For this purpose, reduced graphene oxide (RGO) was treated by irradiation and annealing procedures. The study on the magnetic properties of the samples confirmed that the competition between the structural defects and oxygen functionalities to magnetic moments determines the magnetism in RGO. © 2018  

Recently, graphene oxide and its unconventional magnetism have attracted much interest due to their novel applications in spintronics, memory chips and theranostics. Owing to the excellent biocompatibility, cellular uptake, bio-conjugation possibilities, flexible chemical modification and characteristic broad-wavelength absorbance, graphene oxide and its derivatives have been utilized as contrast agents for various imaging modalities such as photoluminescence, photoacoustic or ultrasound. Despite their suitable applications in bioimaging and due to lack of magnetic moment, graphene oxide cannot confer magnetic resonance imaging contrast without incorporating the magnetic component. Such... 

In this paper we investigate a simple parametrization scheme of the quintessence model given by Wetterich [Phys. Lett. B 594, 17 (2004)]. The crucial parameter of this model is the bending parameter b, which is related to the amount of dark energy in the early universe. Using the linear perturbation and the spherical infall approximations, we investigate the evolution of matter density perturbations in the variable dark energy model, and obtain an analytical expression for the growth index f. We show that increasing b leads to less growth of the density contrast δ, and also decreases the growth index. Giving a fitting formula for the growth index at the present time, we verify that the... 

Purpose: The purpose of this research was to model the impact of customer knowledge on the performance of organization with a focus on information technology industry. Furthermore, it is intended to analyze the effect of customer knowledge investment on the performance measures, by reviewing investment policies. Design/methodology/approach: The relationship between customer knowledge and performance measures was specified using literature review and grounded theory method. The system dynamics approach was then applied to analyze the impact of the customer knowledge on the performance measures. Findings: This study provided a dynamic model on the causal relationship between customer knowledge... 

In this paper we introduce a new class of codes for over-loaded synchronous wireless CDMA systems which increases the number of users for a fixed number of chips without introducing any errors. In addition these codes support active user detection. We derive an upper bound on the number of users with a fixed spreading factor. Also we propose an ML decoder for a subclass of these codes that is computationally implementable. Although for our simulations we consider a scenario that is worse than what occurs in practice, simulation results indicate that this coding/decoding scheme is robust against additive noise. As an example, for 64 chips and 88 users we propose a coding/decoding scheme that... 

Due to the growing complexity of today's digital circuits, the speed of fault simulation has become increasingly important. Although critical path tracing (CPT) is faster than conventional methods, it is not fast enough for fault simulation of complex circuits with a large number of faults and tests. Exact stem analysis is the most important obstacle in accelerating the CPT method. The simplification of stem analysis eliminates time-consuming computations and makes the CPT method more parallelizable. An approximate and bit-parallel CPT algorithm is proposed for ultrafast fault simulation for both stuck-at-fault (SAF) and transition delay fault (TDF) models. Time linearity, speedup, and...