检索结果-内蒙古大学图书馆

Multi-Server Approach for High-Throughput Molecular Descriptors Calculation based on Multi-Linear Algebraic Maps

MOLECULAR INFORMATICS 2015年第1期34卷 60-69页

作者： Garcia-Jacas, Cesar R. Aguilera-Mendoza, Longendri Gonzalez-Perez, Reisel Marrero-Ponce, Yovani Acevedo-Martinez, Liesner Barigye, Stephen J. Avdeenko, Tatiana Univ Ciencias Informat CEMC Grp Invest Bioinformat Havana Cuba Univ Cent Martha Abreu Las Villas Fac Chem Pharm Unit Comp Aided Mol Biosilico Discovery & Bioinfo Santa Clara 54830 Villa Clara Cuba Univ Valencia Inst Univ Ciencia Mol E-46071 Valencia Spain Univ Tecnol Bolivar Fac Ciencias Basicas Grp Invest Estudios Quim & Biol Bolivar Colombia Univ Fed Lavras Dept Quim BR-37200000 Lavras MG Brazil Novosibirsk State Tech Univ Dept Econ Informat Novosibirsk Russia

The present report introduces a novel module of the QuBiLS-MIDAS software for the distributed computation of the 3D Multi-Linear algebraic molecular indices. The main motivation for developing this module is to deal with the computational complexity experienced during the calculation of the descriptors over large datasets. To accomplish this task, a multi-server computing platform named Tarenal was developed, which is suited for institutions with many workstations interconnected through a local network and without resources particularly destined for computation tasks. This new system was deployed in 337 workstations and it was perfectly integrated with the QuBiLS-MIDAS software. To illustrate the usability of the T-arenal platform, performance tests over a dataset comprised of 15000 compounds are carried out, yielding a 52 and 60 fold reduction in the sequential processing time for the 2Linear and 3-Linear indices, respectively. Therefore, it can be stated that the T-arenal based distribution of computation tasks constitutes a suitable strategy for performing high-throughput calculations of 3D Multi-Linear descriptors over thousands of chemical structures for posterior QSAR and/or ADME-Tox studies.

关键词： TOMOCOMD-CARDD QuBiLS-MIDAS 3D N-linear algebraic descriptors T-arenal Platform of distributed tasks distributed computing system Multi-server architecture

来源：评论

学校读者我要写书评

暂无评论

Development and Prospects of the PARCS-WCF system

引用

CYBERNETICS AND systemS ANALYSIS 2020年第1期56卷 152-158页

作者： Anisimov, A., V Fedorus, O. M. Taras Shevchenko Natl Univ Kyiv Kiev Ukraine

The paper considers details of implementation of the PARCS-WCF system. The PARCS-WCF system provides creation and operation of asynchronous-recursive processes in solving parallel computing tasks both on a single PC and on a computer network. It allows different modules to exchange information providing data exchange in systems with distributed and non-distributed memory.

关键词： PARCS-WCF PARCS parallel computing distributed computing system

来源：评论

学校读者我要写书评

暂无评论

Reliability Analysis of Dynamic Reliability Blocks Through Conversion into Dynamic Bayesian Networks

Reliability Analysis of Dynamic Reliability Blocks Through C...

引用

IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

作者： Li, Kanjing Yi, Ren Ma, Zheng Beihang Univ BUAA Sch Reliabil & Syst Engn Beijing Peoples R China

ISBN: (纸本)9781509036653

Recently, the dynamic Reliability Block Diagram (DRBD) with the characteristics of intuitiveness and visibility has been extensively employed in industrial fields, such as aerospace, military facilities, nuclear energy and chemical industry, etc. However, there exists a limitation in the past research that the complexity of the reliability calculation considering the additional modelling constructs, such as state dependency (SDEP) block, spare part (SPARE) block, load sharing (LSH) block and so on. To address the issue, this paper proposes the dynamic Bayesian networks (DBN) based on converting the DRBD into a DBN. Based on these rules, the constructs of DRBD can be mapped into DBN and easily analyzed leveraging the mature algorithms and tools. A case study of a multiprocessor distributed computing system is adopted to illustrate the conversion algorithm. The results show that this approach can signally increase the analytic efficiency of DRBD for critical large-scale system.

关键词： Dynamic reliability block diagrams (DRBD) dynamic Bayesian networks (DBN) distributed computing system

来源：评论

学校读者我要写书评

暂无评论

Autotune: A Derivative-free Optimization Framework for Hyperparameter Tuning 18

Autotune: A Derivative-free Optimization Framework for Hyper...

引用

24th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD)

作者： Koch, Patrick Golovidov, Oleg Gardner, Steven Wujek, Brett Griffin, Joshua Xu, Yan SAS Inst Inc Cary NC 27513 USA

ISBN: (纸本)9781450355520

Machine learning applications often require hyperparameter tuning. The hyperparameters usually drive both the efficiency of the model training process and the resulting model quality. For hyperparameter tuning, machine learning algorithms are complex black-boxes. This creates a class of challenging optimization problems, whose objective functions tend to be nonsmooth, discontinuous, unpredictably varying in computational expense, and include continuous, categorical, and/or integer variables. Further, function evaluations can fail for a variety of reasons including numerical difficulties or hardware failures. Additionally, not all hyperparameter value combinations are compatible, which creates so called hidden constraints. Robust and efficient optimization algorithms are needed for hyper-parameter tuning. In this paper we present an automated parallel derivative-free optimization framework called Autotune, which combines a number of specialized sampling and search methods that are very effective in tuning machine learning models despite these challenges. Autotune provides significantly improved models over using default hyperparameter settings with minimal user interaction on real-world applications. Given the inherent expense of training numerous candidate models, we demonstrate the effectiveness of Autotune's search methods and the efficient distributed and parallel paradigms for training and tuning models, and also discuss the resource trade-offs associated with the ability to both distribute the training process and parallelize the tuning process.

关键词： Derivative-free Optimization Stochastic Optimization Bayesian Optimization Hyperparameters distributed computing system

来源：评论

学校读者我要写书评

暂无评论

A contract-based approach for secure service discovery systems

A contract-based approach for secure service discovery syste...

引用

IEEE International Conference on Pervasive Services

作者： Nait-Sidi-Moh, A. Bakhouya, M. Wack, M. Univ Technol Belfort Montbeliart F-90010 Belfort France George Washington Univ High Performance Comp Lab Washington DC 20052 USA

ISBN: (纸本)9781424413256

Future distributed computing systems will be ubiquitous and provide accesses to a wide range of services at any time, every where, and from a variety of devices. The monitoring and controlling accesses to services are one of the fundamental challenges that must be faced in the context of ubiquitous and pervasive environments. To address services accesses issues, it is necessary to guaranty the user access to utilize the allowed and available services. More precisely, an access control must be granted to services in order to regulate their usage. In this paper, a contract-based approach for monitoring and controlling accesses to services in ubiquitous environments is presented. In this approach, client agents and server agents are bounded by contracts: the server agent expects that the client agent will not attempt to access other services than those it required, and the client agent expects that the server agent will provide the required service.

关键词： Legal Services Agents Servers Access access control distributed computing system Secure

来源：评论

学校读者我要写书评

暂无评论

Three-Way Joins on MapReduce: An Experimental Study

Three-Way Joins on MapReduce: An Experimental Study

引用

5th International Conference on Information, Intelligence, systems and Applications (IISA)

作者： Kimmett, Ben Thomo, Alex Venkatesh, S. Univ Victoria Victoria BC V8W 2Y2 Canada

ISBN: (纸本)9781479961726

We study three-way joins on MapReduce. Joins are very useful in a multitude of applications from data integration and traversing social networks, to mining graphs and automata-based constructions. However, joins are expensive, even for moderate data sets;we need efficient algorithms to perform distributed computation of joins using clusters of many machines. MapReduce has become an increasingly popular distributed computing system and programming paradigm. We consider a state-of-the-art MapReduce multi-way join algorithm by Afrati and Ullman and show when it is appropriate for use on very large data sets. By providing a detailed experimental study, we demonstrate that this algorithm scales much better than what is suggested by the original paper. However, if the join result needs to be summarized or aggregated, as opposed to being only enumerated, then the aggregation step can be integrated into a cascade of two-way joins, making it more efficient than the other algorithm, and thus becomes the preferred solution.

关键词： Automata Google Internet Automata Internets Google data integration distributed computing system cascades Representation of data Dataset algorithms

来源：评论

学校读者我要写书评

暂无评论

Robustness Prediction and Evaluation of Divisible Load Scheduling on computing systems with Unpredictable Variations 13

Robustness Prediction and Evaluation of Divisible Load Sched...

引用

13th IEEE International Symposium on Parallel and distributed computing (ISPDC)

作者： Balasubramaniam, Mahadevan Banicescu, Ioana Ciorba, Florina M. Mississippi State Univ Dept Comp Sci & Engn Mississippi State MS 39762 USA Tech Univ Dresden Ctr Informat Serv & High Performance Comp D-01062 Dresden Germany

ISBN: (纸本)9781479959198

This work addresses the problem of predicting and evaluating the robustness of divisible load scheduling of data parallel workloads (also called arbitrarily divisible workloads) onto high performance parallel and distributed computing systems with unpredictable variations. Divisible load scheduling is based on the divisible load theory (DLT) which offers a linear, deterministic, and tractable model for scheduling arbitrarily divisible workloads. High performance parallel and distributed computing systems operate in an environment characterized by unpredictable variations (or perturbations) such as system load or unexpected resource failures. In this work, we analytically evaluate and empirically determine the robustness of divisible load scheduling algorithms (called DLT algorithms) with respect to variations in processor availability via realistic simulation. The realism arises from modeling the characteristics of two applications from the NAS parallel benchmark suite, as well as from modeling the target system as a 3D torus topology, one of the most widely used interconnection networks. Extending prior related work, we conduct an analytical evaluation as well as a simulation-based study of the robustness of divisible load scheduling for scheduling the two NAS parallel benchmarks, namely, embarrassingly parallel (EP) which is computationally intensive and integer sort (IS) which is communication intensive. The simulation results indicate that the robustness observed via simulation of scheduling the EP benchmark is always within the analytically predicted range, and that the robustness observed via simulation of scheduling the IS benchmark is within the analytically predicted range in the best case, and within 6.56% on average in the worst case.

关键词： Benchmark testing Computational modeling Load modeling Processor scheduling Robustness Runtime Topology load dispatching Benchmark testing Divisible scheduling of multiprocessor Runtime Load modeling Robustness Computational modeling topology distributed computing system BENCHMARKS

来源：评论

学校读者我要写书评

暂无评论

A new approach for Byzantine Agreement 15

A new approach for Byzantine Agreement

引用

15th International Conference on Information Networking (ICON-15)

作者： Wang, SC Kao, SH Chaoyang Univ Technol Dept Informat Management Taichung Taiwan

ISBN: (纸本)0769509525

Due to the malicious attacks and software errors cause faulty nodes to exhibit arbitrary behavior Byzantine Agreement (BA) is increasingly important. In this paper a novel solution for BA problem is presented. We propose the use of an Artificial Neural Network (ANN), Back Propagation Network (BPN), to help reach a common value in a Fully Connected Network (FCN) and as a substitute for storing messages in each processor There are several significant advantages: (1) Using ANN to store messages, the memory space required in previous approaches is no longer needed. (2) The characteristic of learning ability can help other new applications of BA reach an agreement. (3) The parallel processing can be achieved in each processor.

关键词： Byzantine Agreement fault tolerance distributed computing system Artificial Neural Network back propagation network

来源：评论

学校读者我要写书评

暂无评论

The Development and Simulation Research of Load Balancing Algorithm in Network Infrastructures

The Development and Simulation Research of Load Balancing Al...

引用

International Conference on Mechanical Engineering, Automation and Control systems (MEACS)

作者： Botygin, I. A. Tartakovsky, V. A. Natl Res Tomsk Polytech Univ TPU Tomsk Russia RAS SB IMCES Tomsk Russia

ISBN: (纸本)9781479962211

An algorithm for balancing load between the components of the information-analytical distributed control system. The process of load balancing if based upon the dynamically formed ranking table of the control system's components. The creation of a ranking table, used to display the general load among the components, is a computational process based upon the processing of informational vectors (special standardized data cards for system components) generated by events in the system. A practical test of the following balancing algorithm is carried out in the model experiment simulating the operation of information-analytical control system which includes up to 600 interacting components.

关键词： load balancing distributed computing system application acceleration cloud network network functions simulation multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

Computation of Birnbaum's Importance Using Logic Differential Calculus 42

Computation of Birnbaum's Importance Using Logic Differentia...

引用

42nd International Conference on Telecommunications and Signal Processing (TSP)

作者： Kvassay, Miroslav Rusnak, Patrik Sedlacek, Peter Univ Zilina Fac Management Sci & Informat Zilina Slovakia

ISBN: (纸本)9781728118642

Reliability analysis of technical systems, such as telecommunication, computer, or distribution networks, is a complex problem, which includes a lot of steps. Very important step is evaluation of importance of the system components for operation of the system. For this task, special indices known as importance measures are used. These measures can be structure, time-independent or time-dependent. One of the most commonly used importance measures is Birnbaum's Importance (BI). The structure version of this measure is defined as a relative number of situations in which a failure of a specific system component causes that the system fails. The time-independent version of this measure agrees with the probability that a failure of a given component results in a failure of the system, while the time-dependent version expresses how this probability changes over time. BI is used in computation of many other importance measures. This indicates that development of a unified approach for its computation can be used to develop a comprehensive framework for evaluation of importance of system components. In this paper, we present how logic differential calculus can be used for development of such an approach, and how various BI measures can be used in reliability analysis of a distributed computing system.

关键词： distributed computing system importance analysis logic differential calculus reliability structure function

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：