Sharif Digital Repository

A novel photoacoustic microscopy (PAM) structure, based on Haar wavelet patterns, is proposed in this paper. Its main goal is to mitigate the PAM imaging resolution and thus the time of its sampling process without compromising the image quality. Owing to the intrinsic nature of wavelet transform, this structure collects spatial and spectral components simultaneously, and this feature speeds up the sampling process by 33%. The selection of these patterns helps in better control of required conditions, such as multi-resolution imaging, to guarantee adequate image quality in comparison to previous microscopic structures. Simulation results prove the superior quality of the proposed approach... 

A novel photoacoustic microscopy (PAM) structure, based on Haar wavelet patterns, is proposed in this paper. Its main goal is to mitigate the PAM imaging resolution and thus the time of its sampling process without compromising the image quality. Owing to the intrinsic nature of wavelet transform, this structure collects spatial and spectral components simultaneously, and this feature speeds up the sampling process by 33%. The selection of these patterns helps in better control of required conditions, such as multi-resolution imaging, to guarantee adequate image quality in comparison to previous microscopic structures. Simulation results prove the superior quality of the proposed approach... 

Transportation Network Design Problem (TNDP) aims at selection of a subset of proposed urban projects in budget constraint to minimize the network users' total travel time. This is a well-known resource-intensive problem in transportation planning literature. Application of parallel computing, as a result, can be useful to address the exact solution of TNDP. This paper is going to investigate how the performance of a parallel Branch-and-Bound (B&B) algorithm with Depth-First-Search (DFS) strategy can be accelerated. The paper suggests assigning greedy solutions to idle processors at the start of the algorithm. A greedy solution, considered in this paper, is a budget-wise feasible selection... 

The k-means is the most popular clustering algorithm, but, as it needs too many distance computations, its speed is dramatically fall down against high-dimensional data. Although, there are some quite fast variants proposed in literature, but, there is still much room for improvement against high-dimensional large-scale datasets. What proposed here, k-means-g*, is based on a simple geometric concept. For four distinct points, if distance between all pairs except one pair are known, then, a lower bound can be determined for the unknown distance. Utilizing this technique in the assignment step of the k-means, many high-dimensional distance computations can be easily ignored, where small amount... 

A naked-eye (equipment-free), label-free (cost-effective), and RNA extraction-free (to speed up) method for SARS-CoV-2 (as a case study of RNA viruses) detection is developed. Here, the DNA is being used as a template for in situ formation of anisotropic gold nanoparticles (AuNPs) without any chemical modification or DNA labeling. In this study, synthesized AuNPs for the direct detection of N-gene (nucleocapsid phosphoprotein) of SARS-CoV-2 are exploited. To this aim, antisense oligonucleotides (ASOs) with an extra poly guanine tail (G12) were designed. Thus, in the presence of its viral target RNA gene and ASOs@AuNPs-RNA hybridization, there was a red shift in its localized surface plasmon... 

In Solid-State Drives (SSDs) with tens of ash chips and highly parallel architecture, we can speed up I/O operations by well-utilizing resources during page allocation. Propos- als already exist for using static page allocation which does not balance the IO load and its efficiency depends on access address patterns. To our best knowledge, there have been no research thus far to show what happens if one or more internal resources can be freely allocated regardless of the request address. This paper explores the possibility of using different degrees of dynamism in page allocation and iden- tifies key design opportunities that they present to improve SSD's characteristics  

In Solid-State Drives (SSDs) with tens of ash chips and highly parallel architecture, we can speed up I/O operations by well-utilizing resources during page allocation. Propos- als already exist for using static page allocation which does not balance the IO load and its efficiency depends on access address patterns. To our best knowledge, there have been no research thus far to show what happens if one or more internal resources can be freely allocated regardless of the request address. This paper explores the possibility of using different degrees of dynamism in page allocation and iden- tifies key design opportunities that they present to improve SSD's characteristics  

Split-field finite-difference time-domain (SF-FDTD) method can overcome the limitation of ordinary FDTD in analyzing periodic structures under oblique incidence. On the other hand, huge run times of 3D SF-FDTD, is practically a major burden in its usage for analysis and design of nanostructures, particularly when having dispersive media. Here, details of parallel implementation of 3D SF-FDTD method for dispersive media, combined with totalfield/ scattered-field (TF/SF) method for injecting oblique plane wave, are discussed. Graphics processing unit (GPU) has been used for this purpose, and very large speed up factors have been achieved. Also a previously reported formulation of SF-FDTD based... 

A simplified efficient finite element method called the inverse approach (IA) has been developed to estimate initial blank and strain distribution in sheet metal forming. This algorithm is an inverse method since the position of points in final shape is known and their corresponding position in the initial blank should be determined. This approach deals with the geometric compatibility of finite elements, plastic deformation theory, and virtual work principle. This method often based on implicit static algorithms, sometimes causes convergence problems because of strong nonlinearities. This paper introduces an initial guess to speed up the convergence of Newton- Raphson solution. The... 

The everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, we have proposed a Genetic Algorithm in search of optimum signature matrices for binary-input synchronous CDMA. The main measure of optimality considered in this paper, is the per-user channel capacity of the overall multiple access system. Our resulting matrices differ from the renowned Welch Bound Equality (WBE) codes, regarding the fact that our attention is specifically aimed at binary, rather than Gaussian, input distributions. Since design based on channel capacity is... 

Although e-mail is the most efficient and popular communication method, unwanted and mass unsolicited e-mails, also called spam mail, endanger the existence of the mail system. This paper proposes a new algorithm called Dynamic Weighted Majority Concept Drift Detection (DWM-CDD) for content-based filtering. The design purposes of DWM-CDD are first to accurate the performance of the previously proposed algorithms, and second to speed up the time to construct the model. The results show that DWM-CDD can detect both sudden and gradual changes quickly and accurately. Moreover, the time needed for model construction is less than previously proposed algorithms  

The problem of estimating pulse repetition interval (PRI) of an interleaved pulse train which consist of several independent radar signals, is the main issue of signal processing in electronic support systems. PRI Transform algorithm is one of the well known and effective methods of PRI detection which is capable of detecting several close jittered signals and surpassing subharmonics, but have some drawbacks especially because of small PRI dynamic range and heavy computations. In this paper a modified PRI transform is introduced which manage wide range of PRIs simultaneously, and speed up the algorithm by significantly reducing the computations. Moreover an efficient threshold is set for... 

In this paper, we present a very fast and accurate technique to estimate the soft error rate of digital circuits in the presence of Multiple Event Transients (METs). In the proposed technique, called Multiple Event Probability Propagation (MEPP), a four-value logic and probability set are used to accurately propagate the effects of multiple erroneous values (transients) due to METs to the outputs and obtain soft error rate. MEPP considers a unified treatment of all three masking mechanisms i.e., logical, electrical, and timing, while propagating the transient glitches. Experimental results through comparisons with statistical fault injection confirm accuracy (only 2.5% difference) and... 

the application of current sense amplifiers in scaled SRAM design is limited by two factors: the DC offset due to the device mismatch and limited voltage headroom. The presented scheme reduces the effect of offset by proposing an extra phase for offset cancellation before current sensing takes place. A twofold reduction of the cell access time is achieved compared to the conventional scheme under similar cell current and bitline capacitance. The offset cancellation phase takes place in parallel to the wordline decoding time in order to speed up the current sensing. The proposed scheme requires a small power budget due to a self shut off mechanism. In addition to presenting a comparison with... 

In today's competitive world, having an effective business intelligent (BI) system for monitoring and evaluation of industrial and product oriented organizations is vital. A perfect BI must help managers not only to speed up his decision making process; but also to increase quality of their decision. But how? One of the main specifications of an effective BI system is providing managers by correct format of information and at the correct time. Critical Success Factors (CSFs) are a kind of significant factors that must be considered in attaining an organization's goal; and key performance indicators (KPIs) are a type of quantitative and measurable CSF; and one character of an effective BI is... 

Using an FPGA as a hardware accelerator has been prevalent, to speed up compute intensive workloads. However, employing an accelerator in virtualized environment enhances complexity, because accessing the accelerator from virtual machines has significant overhead and sharing it needs some considerations. We have implemented adequate infrastructure to share an FPGA-based accelerator between multiple virtual machines with negligible access overhead which dynamically implements virtual machines' accelerators. In our architecture each user process from a virtual machine can directly access the FPGA over PCIe link and reconfigure its accelerator in the specified part of FPGA at run-time. The... 

In this paper, a new method for path planning is proposed using a genetic algorithm (GA). Our method has two key advantages over existing GA methods. The first is a novel environment representation which allows a more efficient method for obstacles dilation in comparison to current cell based approaches that have a tradeoff between speed and accuracy. The second is the strategy we use to generate the initial population in order to speed up the convergence rate which is completely novel. Simulation results show that our method can find a near optimal path faster than computational geometry approaches and with more accuracy in smaller number of generations than GA methods. © 2009 IEEE  

This paper presents a centralized fault detection algorithm for wireless sensor networks. Faulty sensor nodes are identified based on comparisons between neighboring nodes and own central node and dissemination of the decision made at each node. RNS system is used to tolerate transient faults in sensing and communication. In this system, arithmetic operations act on residues - reminder of dividing original number in several definite modules - in parallel. Consequently computations on these residues which are smaller than the original number are performed, so speed up arithmetic and decreased power consumption is achieved. ©2009 IEEE