Sharif Digital Repository

To enhance performance, common processors feature relaxed memory models that reorder instructions. However, the correctness of concurrent programs is often dependent on the preservation of the program order of certain instructions. Thus, the instruction set architectures offer memory fences. Using fences is a subtle task with performance and correctness implications: using too few can compromise correctness and using too many can hinder performance. Thus, fence insertion algorithms that given the required program orders can automatically find the optimum fencing can enhance the ease of programming, reliability, and performance of concurrent programs. In this paper, we consider the class of... 

In the touring polygons problem (TPP), for a given sequence (s= P0, P1, ⋯, Pk, t = Pk+1) of polygons in the plane, where s and t are two points, the goal is to find a shortest path that starts from s, visits each of the polygons in order and ends at t. In the constrained version of TPP, there is another sequence (F0, ⋯, Fk) of polygons called fences, and the portion of the path from Pi to Pi+1 must lie inside the fence Fi. TPP is NP-hard for disjoint non-convex polygons, while TPP and constrained TPP are polynomially solvable when the polygons are convex and the fences are simple polygons. In this work, we present the first polynomial time algorithm for solving constrained TPP when the... 

In this paper, we introduce a new version of the shortest path problem appeared in many applications. In this problem, there is a start point s, an end point t, an ordered sequence =(S0 = s, S1,...,S k, Sk+1 = t) of sets of polygons, and an ordered sequence =(F0,...,Fk) of simple polygons named fences in such that each fence Fi contains polygons of Si and Si+1. The goal is to find a path of minimum possible length from s to t which orderly touches the sets of polygons of in at least one point supporting the fences constraints. This is the general version of the previously answered Touring Polygons Problem (TPP). We prove that this problem is NP-Hard and propose a precision sensitive FPTAS... 

An autonomous hedge trimmer robot was developed to reduce the harmful effects of traditional hedge trimming method (gasoline-powered hedge trimmer) on operators' bodies and increase the speed and quality of the operation. The robot had five degrees of freedom (PRRRR) structure and was geometrically optimized to simplify the control strategy, enabling it to trim simple, stepped, and circular forms. The control system, consisting of a host computer, servo motors and servo drivers, and controller, guided the robot platform, manipulator, and end-effector as it approached and trimmed the hedge. By using a recognition algorithm and vision-based navigation system, the robot was able to detect the... 

In this survey, a reliable and applicable Y–Y shaped micro–channel in a microfluidic device was designed and manufactured. A number of micro–scaled hedges were precisely fabricated inside the micro–channel to facilitate the immobilization of synthesized core–shell Fe3O4@SiO2 magnetic nanoparticles (MNPs), functionalized by triethoxyphenylsilane (TEPS) by sol-gel technique. Both sample and reagents were introduced into the microfluidic device by a syringe pump to perform the extraction and desorption steps. The functionalized MNPs were characterized by transmission electron microscopy, X-ray diffraction spectroscopy and Fourier transform infrared spectroscopy. By adopting the strategy of...