دانلود جزوات دانشگاهی و آموزشی

متن مرتبط با «parallel algorithm for matrix multiplication» در سایت دانلود جزوات دانشگاهی و آموزشی نوشته شده است

ترجمه مقاله انگلیسی : Making Transnational Corporations Accountable for Human Rights Violations

  • عنوان مقاله انگليسي Making Transnational Corporations Accountable for Human Rights Violations نویسنده/ناشر/نام مجله : NUJS L. Rev سال انتشار: 2009 کد محصول: 1011282 تعداد صفحات انگليسي: 18 تعداد صفحات فارسي: 18 قیمت بر حسب ریال: 160,انگلیسی ...ادامه مطلب

  • ترجمه مقاله Performance evaluation tools for QoS MAC protocol for wireless sensor networks

  • عنوان مقاله انگليسي Performance evaluation tools for QoS MAC protocol for wireless sensor networks نویسنده/ناشر/نام مجله : Ad Hoc Networks سال انتشار: 2014 کد محصول: 1011137 تعداد صفحات انگليسي: 14 تعداد صفحات فارسي: 32 قیمت بر حسب ریال: 150000 نوع فایل های ضمیمه: Pdf+Word حجم فایل: 2 مگا بایت رشته های مرتبط: مهندسی فناوری اطلاعات ، مهندسی كامپيوتر ، جزئیات بیشتر و د,ترجمه,مقاله ...ادامه مطلب

  • Parallel algorithm for finding modules of large-scale coherent fault trees

  • عنوان انگلیسی : Parallel algorithm for finding modules of large-scale coherent fault trees سال چاپ : 2015 تعداد صفحه : 4 چکیده : The computation of the probability of the top event or minimal cut sets of fault trees is known as intractableNP-hard problems.Modularization can be used to reduce the computational cost of basic operations on faulttrees efficiently. The idea of the linear time algorithm, as a very efficient and compact modules detectingalgorithm, is visiting the nodes one by one with top-down depth-first left-most traversal of the tree. Sothe efficiency of the linear time algorithm is limited by nodes visiting time successively and serially, especiallywhen confronting large-scale fault trees. Aiming at improving the efficiency of modularizing largescalefault trees, this paper proposes a new parallel method to find all possible modules. Firstly, we transformthe fault tree into a directed acyclic graph (DAG) and treat the terminal basic nodes as entries of thealgorithm. ,parallel algorithm for matrix multiplication ppt,parallel algorithm for matrix multiplication,parallel algorithm for shortest path ...ادامه مطلب

  • Parallel processing of large graphs

  • عنوان انگلیسی : Parallel Processing of large graphs Abstract More and more large data collections are gathered worldwide in various IT systems. Many of them possess a networked nature and need to be processed and analysed as graph structures. Due to their size they very often require the usage of a parallel paradigm for efficient computation. Three parallel techniques have been compared in the paper: MapReduce, its map-side join extension and Bulk Synchronous Parallel (BSP). They are implemented for two different graph problems: calculation of single source shortest paths (SSSP) and collective classification of graph nodes by means of relational influence propagation (RIP). The methods and algorithms are applied to several network datasets differing in size and structural profile, originating from three domains: telecommunication, multimedia and microblog. The results revealed that iterative graph processing with the BSP implementation always and significantly, even up to 10 times out,parallel processing of large graphs,parallel processing of large-scale graphs,hipg parallel processing of large-scale graphs ...ادامه مطلب

  • مقاله A high concurrency XPath-based locking protocol for XML databases

  • عنوان انگلیسی :A high concurrency XPath-based locking protocol for XML databases AbstractProviding efficient access to XML documents becomes crucial in XML database systems. More and more concurrency control protocolsfor XML database systems were proposed in the past few years. Being an important language for addressing data in XML documents, XPathexpressions are the basis of several query languages, such as XQurey and XSLT. In this paper, we propose a lock-based concurrency controlprotocol, called XLP, for transactions accessing XML data by the XPath model. XLP is based on the XPath model and has the features of richlock modes, low lock conflict and lock conversion. XLP is also proved to ensure conflict serializability. In sum, there are three majorcontributions in this paper. The proposed XLP supports most XPath axes, rather than simple path expressions only. Conflict conditions andrules in the XPath model are analyzed and derived. Moreover, a lightweighted lock mode, P-lock, is inve, ...ادامه مطلب

  • Intelligent Strategy of Task Scheduling in Cloud Computing for Load Balancing

  • عنوان انگلیسی :Intelligent Strategy of Task Scheduling in Cloud Computing for Load Balancing مشخصات مقاله :Inteational Joual of Emerging Trends amp; Technology in Computer Science (IJETTCS) - سال 2013 چکیده : Cloud computing is a type of parallel and distributed system consisting of a collection of interconnected and virtual computers. With the increasing demand and benefits of cloud computing infrastructure, different computing can be performed on cloud environment. One of the fundamental issues in this environment is related to task scheduling. Cloud task scheduling is an NP-hard optimization problem, and many meta-heuristic algorithms have been proposed to solve it. A good task scheduler should adapt its scheduling strategy to the changing environment and the types of tasks. In this paper a cloud task scheduling policy based on ant colony optimization algorithm for load balancing compared with different scheduling algorithms has been proposed. Ant Colony Optimization (ACO) is ra,intelligent strategy of task scheduling in cloud computing for load balancing ...ادامه مطلب

  • A Framework for Migrating Relational Datasets to NoSQL

  • عنوان مقاله :چارچوبی برای انتقال مجموعه داده های رابطه ای به NoSQL اطلاعات مقاله : ELSEVIER - سال 2015 تعداد صفحات ترجمه : 14 صفحه تعداد صفحات انگلیسی : 10 صفحه خرید ترجمه مقاله "چارچوبی برای انتقال مجموعه داده های رابطه ای به NoSQL" - به قیمت 10 هزار تومان چکیده انگلیسی : In software development, migration from a Data Base Management System (DBMS) to another, especially with distinct characteristics, is a challenge for programmers and database administrators. Changes in the application code in order to comply with new DBMS are usually vast, causing migrations infeasible. In order to tackle this problem, we present NoSQLayer, a framework capable to support conveniently migrating from relational (i.e., MySQL) to NoSQL DBMS (i.e., MongoDB). This framework is presented in two parts: (1) migration module; and, (2) mapping module. The first one is a set of methods enabling seamless migration between DBMSs (i.e. MySQL to MongoDB). The latter provides a persistence layer to process database,a framework for migrating relational datasets to nosql ...ادامه مطلب

  • Buckling of cracked plate reinforced

  • عنوان مقاله : کمانش صفحه ترک خورده تقویت شده تعداد صفحات ترجمه : 10 صفحه تعداد صفحات انگلیسی : 8 صفحه خرید ترجمه مقاله "کمانش صفحه ترک خورده تقویت شده" به قیمت 9 هزار تومات چکیده انگلیسی : The objective of this paper is to numerically analyze the buckling of reinforced structures (stiffened plate) cracked under compressive stress by considering the evolution of cracks and its orientation. Numerical modeling and calculation by the finite element method, estimated the critical load for compression panel. The work presented in the article was inspired by several publications that related to this field. Brighenti (2005) have studied the behavior of elastic buckling of rectangular cracked thin plate for different boundaries conditions. Following these calculations, a calibration function was derived to estimate the load ratio ɛ to the compression function of the crack length and its inclination. We found that the variation of the critical stress is proportional to the crack dimensions. In ,buckling of cracked plates,buckling of cracked members under tension ...ادامه مطلب

  • جدیدترین مطالب منتشر شده

    گزیده مطالب

    تبلیغات

    برچسب ها