• List of Articles نگاشت

      • Open Access Article

        1 - Scheduling tasks in cloud environments using mapping framework - reduction and genetic algorithm
        nima khezr nima jafari novimipour
        Task scheduling is a vital component of any distributed system such as grids, clouds, and peer-to-peer networks that refer tasks to appropriate resources for execution. Common scheduling methods have disadvantages such as high time complexity, inconsistent execution of More
        Task scheduling is a vital component of any distributed system such as grids, clouds, and peer-to-peer networks that refer tasks to appropriate resources for execution. Common scheduling methods have disadvantages such as high time complexity, inconsistent execution of input tasks, and increased program execution time. Exploration-based scheduling algorithms to prioritize tasks from Manuscript profile
      • Open Access Article

        2 - Agility conceptual model of service provider enterprises supply chain By using fuzzy conceptual modeling
        Roxana Fekri مهدی  احمدی Marzieh Babaeianpoor
        Many enterprises Nowadays, face with big competing and risk in the market which is the result of innovation in technology and continuous changes of customer needs. In such circumstances, getting direction to agile structure is the fastest way to adapt.Absolutely service More
        Many enterprises Nowadays, face with big competing and risk in the market which is the result of innovation in technology and continuous changes of customer needs. In such circumstances, getting direction to agile structure is the fastest way to adapt.Absolutely service provider enterprises are not exception.To identify the model of agility in service provider enterprises, a literature review is done and the result is verified by the experts. Critical success factors of agility in service provider enterprises are identified using exploratory factor analysis in 11 main groups: integrating supply chain components, upgrading quality and flexible services, responsig and sensitiveness to market, customer based design and development of servives, human skills and customer satisfaction development, innovative strategy and solving strategic problems, developing services, dynamic and flexible planning, concerning market and organization financial situation, using IT infrastructure, updating competitors and suppliers data. Using thses factors, managers of these enterprises are able to increase responsibility and market share. Finally critical success factors of agility in service provider enterprises and the relation between them is derived by using fuzzy conceptual mapping. Manuscript profile
      • Open Access Article

        3 - Application of Neuro Space Mapping in Modeling Semiconductor Devices
        M. Gordi Armaki S. E. Hosseini Mohammad Kazem Anvarifard
        In this paper an efficient method for modeling semiconductor devices using the drift-diffusion (DD) model and neural network is presented. Unlike HD model which is complicated, time consuming with high processing cost, the proposed method has lower complexity and higher More
        In this paper an efficient method for modeling semiconductor devices using the drift-diffusion (DD) model and neural network is presented. Unlike HD model which is complicated, time consuming with high processing cost, the proposed method has lower complexity and higher simulate speed. In our method, a RBF neural network is used to modify DD parameters. The modified DD model can generate simulate results of accurate HD model. The proposed method is first applied to a silicon n-i-n diode in one dimension, and then to a silicon thin-film MOSFET in two dimensions, both for interpolation and extrapolation. The obtained results for basic variables, i.e., electron and potential distribution for different voltages, confirm the high efficiency of the proposed method. Manuscript profile
      • Open Access Article

        4 - Left Ventricular Segmentation in Echocardiography Images by Manifold Learning and Dynamic Directed Vector Field Convolution
        N.  Mashhadi H. Behnam Ahmad Shalbaf Z. Alizadeh Sani
        Cardiac diseases are the major causes of death throughout the world. The study of left ventricular (LV) function is very important in the diagnosis of heart diseases. Automatic tracking of the boundaries of the LV wall during a cardiac cycle is used for quantification o More
        Cardiac diseases are the major causes of death throughout the world. The study of left ventricular (LV) function is very important in the diagnosis of heart diseases. Automatic tracking of the boundaries of the LV wall during a cardiac cycle is used for quantification of LV myocardial function in order to diagnose various heart diseases including ischemic disease. In this paper, a new automatic method for segmentation of the LV in echocardiography images of one cardiac cycle by combination of manifold learning and active contour based dynamic directed vector field convolution (DDVFC) is proposed. In this method, first echocardiography images of one cardiac cycle have been embedded in a two dimensional (2-D) space using one of the most popular manifold learning algorithms named Locally Linear Embeddings. In this new space, relationship between these images is well represented. Then, segmentation of the LV wall during a cardiac cycle is done using active contour based DDVFC. In this method, final contour of each segmented frame is used as the initial contour of the next frame. In addition, in order to increase the accuracy of the LV segmentation and also prevent the boundary distortion, maximum range of the active contour motion is limited by Euclidean distances between consequent frames in resultant 2-D manifold. To quantitatively evaluate the proposed method, echoacardiography images of 5 healthy volunteers and 4 patients are used. The results obtained by our method are quantitatively compared to those obtained manually by the highly experienced echocardiographer (gold standard) which depicts the high accuracy of the presented method. Manuscript profile
      • Open Access Article

        5 - SDDNA: Sign-Digit Coding for Mapping Digital Data in DNA Data Storage
        میثم اللهی رودپشتی S. Alinezhad
        Due to the explosive increment of data in recent application, available data storage cannot respond to this volume of data, for this reason molecular memory have been suggested in recent research. DNA is molecular data storage that can store a large amount of data in a More
        Due to the explosive increment of data in recent application, available data storage cannot respond to this volume of data, for this reason molecular memory have been suggested in recent research. DNA is molecular data storage that can store a large amount of data in a limited space with high endurance. Storing data in low volumes can be provided using appropriate mapping. In this paper, a new method for mapping digital data to DNA have been proposed with the aim of simple coding, omitting the decoding faults, increasing the speed of coding and storing digital data and sign-digit with sufficient compression. Studies show that the proposed method can guarantee long-term retrieval of information from DNA compared to previous methods. It also uses less compression to store digital data as compared to the previous methods. Manuscript profile
      • Open Access Article

        6 - High Level Synthesis of Decimal Arithmetic on Coarse Grain Reconfigurable Architectures
        Samaneh Emami
        The increasing capabilities of integrated circuits and the complexity of applications have led hardware design methods and tools to higher levels of abstraction and high-level synthesis is one of the key steps in increasing the level of abstraction. In recent years, ext More
        The increasing capabilities of integrated circuits and the complexity of applications have led hardware design methods and tools to higher levels of abstraction and high-level synthesis is one of the key steps in increasing the level of abstraction. In recent years, extensive research has been conducted on the design of decimal arithmetic reconfigurable architectures. Since, on the one hand, the effective use of these architectures depends on the existence of appropriate algorithms and tools to implement the design on the hardware, and on the other hand, research on the development of these algorithms has been very limited, this paper will present methods for the automated synthesis of decimal arithmetic circuits on a coarse-grained reconfigurable architecture. The platform chosen to execute the proposed algorithms is the DARA coarse-grained reconfigurable architecture, which is optimized for decimal arithmetic. The algorithms proposed for resource allocation of synthesis include a heuristic method and an ILP algorithm. The results show that, as expected, for the limited architectural dimensions used, the ILP algorithm performs significantly (about 30%) better than the heuristic algorithm. Manuscript profile
      • Open Access Article

        7 - " Cognitive mapping of components for developing people-oriented cities and their importance in tourism development: A case study of Yazd province, Iran "
        Hamed Fallah Tafti saeede derakhsh vahideh hekmat
        "Contrary to automotive, commodity-based, and money-oriented cities, a people-oriented city is an organic and systematic city based on human virtues and commune where people are concerned about each others’ rights. In such a city, humans are the main focus of urban plan More
        "Contrary to automotive, commodity-based, and money-oriented cities, a people-oriented city is an organic and systematic city based on human virtues and commune where people are concerned about each others’ rights. In such a city, humans are the main focus of urban planners, urban developers, and, most importantly, municipal decision-makers and executives. Therefore, here the biological, spiritual, and psychological needs of humans are the fundamental elements taken into account by urban management. This city, then, could unite urban spaces and tourists. Considering its great potentials, Yazd could be a good case for tourism development, building people-oriented cities, and improving the desirability of urban life. This qualitative-quantitative study sought to explore the feasibility of building a people-oriented city in Yazd province based on urban planning and the causal factors involved in this regard, intending to attract more tourists to this region. To this end, 14 interviews were conducted with tourism and urban planning experts, out of which 19 factors involved in building such a city were identified. The causal relationship between the identified factors was examined through a mixed-method approach, using the fuzzy cognitive mapping technique. The study’s findings indicated that educating the citizens, developing a sense of familiarity with the environment, and reducing environmental pollutions (soil, water, air) were the three most important factors for developing people oriented-cities in Yazd province, Iran. " Manuscript profile
      • Open Access Article

        8 - شناخت، گونه ها و ویژگی های نگاشتۀ علمی ‌ـ اختصاصی ویژۀ دانش ها و آموزه های قرآن و حدیث
        محمد مهدی احسانی فر
      • Open Access Article

        9 - Ontology Matching Based on Maintaining Local Similarity of Information Using Propagation Technique
        NazarMohammad Parsa Asieh Ghanbarpour
        In recent years, ontologies, as one of the most important components of the semantic web, have expanded in various fields. The problem of ontology matching has been raised with the aim of creating a set of mappings between entities of ontologies. This problem is classif More
        In recent years, ontologies, as one of the most important components of the semantic web, have expanded in various fields. The problem of ontology matching has been raised with the aim of creating a set of mappings between entities of ontologies. This problem is classified as an NP-hard problem. Therefore, greedy methods have been proposed to solve it in different ways. Selecting the appropriate lexical, structural and semantic similarity criteria and using an effective combination method to obtain the final mapping is one of the most important challenges of these methods. In this paper, an automatic method of matching ontologies is proposed to provide a one-to-one mapping set. This method detects primary mappings based on a new lexical similarity criterion, which is accordance with the descriptive essence of entities and combining this similarity with semantic similarity obtained from external semantic sources. By locally propagating the score of initial mappings in the class hierarchy graph, structurally matching entities are identified. In this method, property matching is examined in a separate step. In the final step, the mapping filter is applied in order to maintain the consistency of the final mapping set. In the evaluation section, comparing the performance of the lexical similarity measure compared to other proposed textual similarity measures, indicates the efficiency of this measure in the problem of ontology matching. In addition, the results of the proposed matching system compared to the results of the set of participating systems in the OAEI competitions shows this system in the second place and higher than many complex matching systems. Manuscript profile
      • Open Access Article

        10 - Presenting a Network-on-Chip Mapping Approach Based on Harmony Search Algorithm
        Zahra Bagheri Fatemeh Vardi Alireza Mahjoub
        In network-on-chip implementation, mapping can be considered as an important step in application implementation. The tasks of an application are often represented in the form of a core graph. The cores establish a link between themselves using a communication platform a More
        In network-on-chip implementation, mapping can be considered as an important step in application implementation. The tasks of an application are often represented in the form of a core graph. The cores establish a link between themselves using a communication platform and often the network on the chip. For finding proper mapping for an application, developers have proposed various algorithms. In most cases, due to the complexity, exact search methods are used to find the mapping. However, these methods are suitable for networks with small dimensions. As the size of the network increases, the search time also increases exponentially. This article, from the perspective of a heuristic approach, uses the harmony search method to decide when to connect cores to routers. Our approach uses an improved version of the harmony search algorithm with a focus on reducing power consumption and delay. Algorithm complexity analysis reveals a more appropriate solution compared to similar algorithms with respect to application traffic pattern. Compared to similar methods, the algorithm achieves 39.98% less delay and 61.11% saving in power consumption. Manuscript profile
      • Open Access Article

        11 - Reduction of network load by mapping the application in the network on a chip using the discrete Harris hawk algorithm
        Elham Hajebi Vahid Sattari-Naeini
        Reducing load and power consumption in on-chip network systems is very important and one of the most important issues to increase the efficiency of on-chip network is the issue of mapping an application on the chip network. Solving the application mapping problem to fin More
        Reducing load and power consumption in on-chip network systems is very important and one of the most important issues to increase the efficiency of on-chip network is the issue of mapping an application on the chip network. Solving the application mapping problem to find the best mapping is a complex and time consuming issue and has a huge impact on network latency and power consumption. In this paper, using the Harris hawk algorithm, we have been able to provide a method for mapping processing cores to the network on chip to reduce the load on the network and thus congestion in the links and improve network performance. The simulation results show that this algorithm performs better than the basic algorithms. Manuscript profile
      • Open Access Article

        12 - Fuzzy Multicore Clustering of Big Data in the Hadoop Map Reduce Framework
        Seyed Omid Azarkasb Seyed Hossein Khasteh Mostafa  Amiri
        A logical solution to consider the overlap of clusters is assigning a set of membership degrees to each data point. Fuzzy clustering, due to its reduced partitions and decreased search space, generally incurs lower computational overhead and easily handles ambiguous, no More
        A logical solution to consider the overlap of clusters is assigning a set of membership degrees to each data point. Fuzzy clustering, due to its reduced partitions and decreased search space, generally incurs lower computational overhead and easily handles ambiguous, noisy, and outlier data. Thus, fuzzy clustering is considered an advanced clustering method. However, fuzzy clustering methods often struggle with non-linear data relationships. This paper proposes a method based on feasible ideas that utilizes multicore learning within the Hadoop map reduce framework to identify inseparable linear clusters in complex big data structures. The multicore learning model is capable of capturing complex relationships among data, while Hadoop enables us to interact with a logical cluster of processing and data storage nodes instead of interacting with individual operating systems and processors. In summary, the paper presents the modeling of non-linear data relationships using multicore learning, determination of appropriate values for fuzzy parameterization and feasibility, and the provision of an algorithm within the Hadoop map reduce model. The experiments were conducted on one of the commonly used datasets from the UCI Machine Learning Repository, as well as on the implemented CloudSim dataset simulator, and satisfactory results were obtained.According to published studies, the UCI Machine Learning Repository is suitable for regression and clustering purposes in analyzing large-scale datasets, while the CloudSim dataset is specifically designed for simulating cloud computing scenarios, calculating time delays, and task scheduling. Manuscript profile