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

IEEE/ACM international symposium on Cluster computing and the Grid (CCGRID)

作者： Richard O. Sinnott Jipu Jiang Anthony Stell John Watt National e-Science Centre University of Glasgow Glasgow UK

ISBN: (纸本)9780769540399

the technologies and ideas that underlie e-Science in providing seamless access to distributed resources is a compelling one and has been applied in many research domains. the clinical domain is one area in particular that, in principle has much to be gained from e-Science approaches. Until now however it has largely been the case that the practical realization, support and adoption of e-Science solutions in a clinical setting have been fraught by many hurdles. Not least is trust of technologies and their use in the field as opposed to demonstrator projects with non-real clinical data to prove the merit of e-Science ideas and solutions. the National e-Science Centre (NeSC– ***) at the University of Glasgow have had a large number of clinical projects that have moved from the proof of concept demonstrators through to real systems used by real clinical researchers in real clinical trials and studies. In this paper we focus on the software systems that have been developed to support two major international post-genomic clinical research projects in the area of rare diseases: the European Union 7th Framework (EuroDSD – ***) project and the European Science Foundation (ENSAT – ***) project. We outline the software platforms that have been rolled out and identify how the e-Science vision of secure access to clinical resources has been realized and subsequently used.

关键词： Diseases Tumors Software systems Middleware Clouds Grid computing Clinical trials Data security Pediatrics Endocrine system

来源：评论

学校读者我要写书评

暂无评论

Research on Apriori Improvement Algorithm Based on MapReduce

Research on Apriori Improvement Algorithm Based on MapReduce

引用

Advanced Algorithms and Control Engineering (ICAACE), international Conference on

作者： Shengshai Zhang Shaowei Mei Sanda University Shanghai China University of Shanghai for Science and Technology Shanghai China Faculty of Information Technology Shanghai Jianqiao University Shanghai China

ISBN: (数字)9798350361445

ISBN: (纸本)9798350361452

With the rapid development of e-commerce, how to discover useful association rules from large-scale shopping data has become a hot research topic. Apriori algorithm is a classical algorithm in the field of association rule mining, but it has the problem of low efficiency in large-scale data mining. In order to improve the execution efficiency of Apriori algorithm, this paper proposes an improved Apriori algorithm based on MapReduce by combining the distributed processing characteristics of MapReduce. the algorithm reduces the number of self-join comparisons of the algorithm by eliminating the self-join process of k-order candidate sets and instead using (k-1)-item candidate sets to join with frequent 1-item sets to generate new k-item candidate sets. Meanwhile, this paper implements the algorithm using Hadoop distributed computing framework for large-scale data experimental validation. the experimental results show that compared with the traditional Apriori algorithm, the improved MapReduce-based Apriori algorithm has higher execution efficiency and better scalability, and can be effectively applied to large-scale data mining scenarios.

关键词： distributed processing Control engineering Scalability distributed databases parallel processing Data mining Electronic commerce

来源：评论

学校读者我要写书评

暂无评论

Adaptive Utilization of Communication and Computational Resources in High-Performance distributed Systems: the EMOP Approach 98

Adaptive Utilization of Communication and Computational Reso...

引用

Proceedings of the 7th IEEE international symposium on High Performance distributed computing

作者： Shridhar Diwan Dennis Gannon

ISBN: (纸本)9780818685798

Development of high-performance distributed applications can be extremely challenging because of their complex runtime environment coupled with their requirement of high-performance. Such applications typically run on a set of heterogeneous machines with dynamically varying loads, connected by heterogeneous networks possibly supporting a wide variety of communication protocols. In spite of the size and complexity of such applications, they must provide the required high-performance mandated by their users. In order to achieve this goal, they need to adaptively utilize their computational and communication *** paper describes EMOP, a programming environment for building high-performance distributed systems. EMOP is designed on the lines of CORBA and uses an Object Request Broker (ORB) to support seamless communication between distributed application components. In order to provide adaptive utilization of communication resources, it uses the principle of Open Implementation to open up the communication mechanisms of its ORB. By virtue of its open architecture, the ORB supports multiple, possibly custom, communication protocols, along with automatic and user controlled protocol selection at run-time. In order to support adaptive utilization of computational resources, EMOP also provides a flexible and powerful set of load-balancing mechanisms that can be used to implement custom load-balancing strategies. this paper describes EMOP's Open ORB architecture and load balancing mechanisms, and uses a set of simple experiments to demonstrate their usefulness.

关键词： load-balancing distributed communication adaptivity high-performance EMOP

来源：评论

学校读者我要写书评

暂无评论

Mapping from BOM Conceptual Model Definition to PDES Models for Enhancing Interoperability

Mapping from BOM Conceptual Model Definition to PDES Models ...

引用

Asia Simulation conference 2008/the 7th international Conference on System Simulation and Scientific computing（ICSC‘2008）

作者： Bonan Hou School of Computer,National University of Defense Technology,Changsha,Hunan,410073,China. Yiping Yao School of Computer,National University of Defense Technology,China. Bing Wang School of Computer,National University of Defense Technology,China.

parallel Discrete Event Simulation (PDES) and High Level Architecture (HLA) based distributed simulation need to collaborate to conquer the large-scale complex systems. PDES aims at making best use of supercomputing resources while HLA focus on the interoperability of geographically distributed independent simulations. this presents particular challenges on the interoperability between PDES and HLA based simulation. this paper proposes a model mapping framework for mapping the Base Object Model (BOM) conceptual model definition into parallel discrete event simulation models, providing the common semantic basis with Federation Object Models (FOMs) that transformed from the same BOM. With the guide of this framework, the Entity Types, Event Types, Pattern of Interplay and State Machines could be mapped into PDES simulation objects, events, event scheduling relationship, and state transition, respectively. A case study about social simulation indicates that this approach not only makes the development of PDES models easy, but also facilitates the conceptual interoperability between PDES and HLA based distributed simulations.

关键词： Model Mapping,parallel Discrete Event Simulation (PDES),conceptual model,interoperability

来源：评论

学校读者我要写书评

暂无评论

Formal Modeling and Analysis of Transaction Scheduling and Concurrency Control in Grid Databases

Formal Modeling and Analysis of Transaction Scheduling and C...

引用

Asia Simulation conference 2008/the 7th international Conference on System Simulation and Scientific computing（ICSC‘2008）

作者： Yaojun Han College of international Business,Shanghai international Studies University,Shanghai,200083 CHINA Changjun Jiang Department of Computer Science & Engineering,Tongji University,Shanghai,200092,CHINA Xumei Luo College of international Finance and Trade,Shanghai international Studies University,Shanghai,200083 CHINA

Transaction scheduling and concurrency control are two important problems in a distributed environment. A lot of research has been focused on the problems recently, and many models and measures have been proposed. However, some of them didn't fit for grid environment, as grid architecture is a new and distinguished from conventional distributed computing by its heterogeneous, dynamic and autonomous properties. In this paper, we propose a three-level transaction scheduling model for grid database, which not only shows the autonomy of grid but also lightens the pressure of communication and grid scheduler. We consider communication time of a transaction, user's priority and the number of DB sites accessed by the transaction as a priority of the transaction, and give scheduling algorithms for concurrency transaction, which not only supports correctness of the data, but also improves the effectiveness of the system. Petri nets are promising tools for modeling and analysis information processing systems that are characterized as being concurrent, parallel and distributed. We use a dynamic time colored Petri net (DTCPN) to model each level's transaction scheduling and get a DTCPN model for three-level transaction scheduling model of grid database using sharing composition. Finally, we get some important results such as miss rate of transactions by analyzing reachability of Petri nets.

关键词： net Petri Formal Modeling and Analysis of Transaction Scheduling and Concurrency Control in Grid Databases

来源：评论

学校读者我要写书评

暂无评论

Strengthening Healthcare Cybersecurity by Optimizing Adversarial Attack Defences in Deep Learning Models using GPU and parallel Processing Technologies

Strengthening Healthcare Cybersecurity by Optimizing Adversa...

引用

international Conference on Circuit, Power and computing Technologies (ICCPCT)

作者： Hridya Venugopal Mary Subaja Christo Department of Networking and Communications SRM Institute of Science and Technology Kattankulathur Campus Chengalpattu Tamilnadu India

ISBN: (数字)9798350372816

ISBN: (纸本)9798350372823

In healthcare, safeguarding patient data integrity is paramount, necessitating robust deep learning models. this research focuses on bolstering the cyber security defenses of these models, particularly against adversarial attacks, through the application of the Localized Adversarial Feature Attack (LAFEAT) technique. Leveraging Graphics Processing Units (GPU) and the TensorFlow framework, the study explores algorithmic enhancements like the Fast Gradient Sign Method (FGSM) and Model-Agnostic Meta-Learning (MAML). these techniques perturb input data gradients or adapt model parameters, enhancing resilience against adversarial perturbations. Additionally, Particle Swarm Optimization (PSO), a metaheuristic optimization technique, is examined to fortify defense mechanisms further. parallel processing techniques, utilizing parallel GPU or distributed clusters, are implemented to expedite the optimization process, reducing computational burdens and enhancing scalability. Despite advancements, gaps remain in understanding how these models can be optimized for real-world healthcare applications, particularly in terms of balancing computational efficiency and robustness. the research demonstrates tangible benefits, with a significant 10% increase in success rates against adversarial attacks compared to baseline methods. Moreover, parallel processing implementation results in a 30% reduction in optimization time, improving the efficiency of cyber security defenses for deep learning models in healthcare. these numerical enhancements underscore the research’s value in fortifying healthcare systems against adversarial threats, ensuring the security and integrity of patient data while addressing existing gaps in the optimization of adversarial defenses in healthcare applications. the strengths of this research lie in its robust adversarial attack optimization techniques, integration of parallel processing for efficiency, and application to critical healthcare tasks. Comprehensive

关键词： Deep learning Adaptation models Computational modeling Graphics processing units Medical services parallel processing Data models

来源：评论

学校读者我要写书评

暂无评论

Statistical Analysis of Intrinsic High-Frequency Characteristic Fluctuation of Emerging Silicon Gate-All-Around Nanosheet (NS) MOSFETs at Sub-3-nm Nodes

Statistical Analysis of Intrinsic High-Frequency Characteris...

引用

IEEE Electron Devices Technology and Manufacturing Conference (EDTM)

作者： Sekhar Reddy Kola Yiming Li Min-Hui Chuang Kazuhiko Endo Seiji Samukawa Parallel and Scientific Computing Laboratory Electrical Engineering and Computer Science International Graduate Program Institute of Communications Engineering Department of Electronics and Electrical Engineering Institute of Biomedical Engineering Center for mm Wave Smart Radar System and Technologies National Yang Ming Chiao Tung University Hsinchu Taiwan Institute of Fluid Science Tohoku University 2-1-1 Katahira Aoba-ku Sendai Japan National Institute of Advanced Industrial Science and Technology Tsukuba Japan

In recent years, the GAA NS Si MOSFET has been explored as a leading technology. However, the intrinsic parameters of GAA NS Si MOSFETs are affected to varying degrees by various fluctuation sources, Statistically independent and identically distributed $(iid)$ assumptions on the aforementioned random variables overestimate the variability of high-frequency characteristics, compared with considering all fluctuation factors simultaneously. Notably, the random nanosized metal grains dominates the variations of voltage gain, cut-off frequency, and 3dB frequency because the random work functions strongly alter the channel surface potential.

关键词： MOSFET Fluctuations Statistical analysis Gallium arsenide Cutoff frequency Metals Logic gates

来源：评论

学校读者我要写书评

暂无评论

computing on many cores

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2017年第15期29卷

作者： Goossens, Bernard Parello, David Porada, Katarzyna Rahmoune, Djallal UPVD DALI 52 Ave Paul Alduy F-66860 Perpignan 9 France UM2 CNRS UMR 5506 LIRMM 161 Rue Ada F-34095 Montpellier 5 France

this paper presents an alternative method to parallelize programs, better suited to manycore processors than actual operating system-/API-based approaches like OpenMP and MPI. the method relies on a parallelizing hardware and an adapted programming style. It frees and captures the instruction-level parallelism (ILP). A many-core design is presented in which cores are multithreaded and able to fork new threads. the programming style is based on functions. the hardware creates a concurrent thread at each function call. the programming style and the hardware create the conditions to free the ILP, by eliminating the architectural dependences between a call and its continuation after return. We illustrate the method on a sum reduction, a matrix multiplication and a sort. We measure the ILP of the parallel runs and show that it is high enough to feed thousands of cores because it increases with data size. We compare our method to pthread parallelization, showing that (1) our parallel execution is deterministic, (2) our thread management is cheap, (3) our parallelism is implicit, and (4) our method parallelizes functions and loops. Implicit parallelism makes parallel code easy to write and read. Deterministic parallel execution makes parallel code easy to debug.

关键词： computing model deterministic parallelism instruction level parallelism many-core processor multithreading parallelizing core

来源：评论

学校读者我要写书评

暂无评论

7th international Workshop on Performance Modeling, Evaluation, and Optimization of Ubiquitous computing and Networked Systems (PMEO-UCNS'08)

IPDPS Miami 2008 - Proceedings of the 22nd IEEE Internationa...

引用

IPDPS Miami 2008 - Proceedings of the 22nd IEEE international parallel and distributed Processing symposium, Program and CD-ROM 2008年

作者： Min, Geyong Ould-Khaoua, Mohamed Al-Dubai, Ahmed Y. Jin, Xiaolong Notare, Mirela Sechi Moretti Annoni Al-Begain, K. Al-Hashimi, B. Romdhani, I. Arabnia, H.R. Arvind, D.K. Awan, I. Boukerche, A. Bradley, J. Cockshott, P. Colajanni, M. Day, K. Djemame, K. El-Ghazawi, T. Fatoohi, R. Gueroui, M. Helal, S. Hassanein, H. Jarvis, S. Karatza, H. Katangur, A. Khonsari, A. Knottenbelt, W. Li, K. Liu, H. Loucif, S. Mackenzie, L.M. Pan, Y. Pradhan, D.K. Sarbazi-Azad, H. Shahrabi, A. Song, E. thomas, N. Touzene, A. Woodward, M. Wu, J. Xiao, L. Xie, T. Yang, L.T. Vanderbauwhede, W. Buchanan, W. Zhou, X. Zomaya, A. Department of Computing University of Bradford Bradford BD7 1DP United Kingdom Department of Computing Science University of Glasgow Glasgow G12 8RZ United Kingdom School of Computing Napier University Edinburgh EH10 5DT United Kingdom Univ. of Glamorgan United Kingdom Univ. of Southampton United Kingdom Napier University United Kingdom Univ. of Georgia United States Edinburgh University United Kingdom Univ. of Bradford United Kingdom Univ. of North Texas United States Imperial College London United Kingdom Univ. of Glasgow United Kingdom Univ. of Modena Italy Sultan Qaboos Univ. Oman Univ. of Leeds United Kingdom George Washington University United States San Jose State University United States University of Cergy-Pontoise France University of Florida United States Queen's University Canada Univ. of Warwick United Kingdom Univ. of Thessaloniki Greece Texas A and M Univ. United States IPM Iran State Univ. of New York New Paltz NY United States Huazhong Univ. of Science and Technology China Moncton University Canada Georgia State Univ. United States Univ. of Bristol United Kingdom Sharif Univ. and IPM Iran Glasgow Caledonian Univ. United Kingdom Univ. of Newcastle United Kingdom Florida Atlantic Univ. United States Michigan State Univ. United States San Diego State University United States St Francis Xavier Univ. Canada University of Glasgow United Kingdom University of Colorado Colorado Springs CO United States Univ. of Sydney Australia Barddal University Florianopolis SC Brazil

No abstract available

ISBN: (纸本)9781424416943

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

the Design and Implement of parallel Simulation Algorithm of Dynamic Route Solution for Traffic Network

The Design and Implement of Parallel Simulation Algorithm of...

引用

Asia Simulation conference 2008/the 7th international Conference on System Simulation and Scientific computing（ICSC‘2008）

作者： Linjie Gao Shanghai Jiao Tong University,Shanghai,200052 China Zhicai JuanShanghai Jiao Tong University,Shanghai,200052 China. Peng Jing Shanghai Jiao Tong University,Shanghai,200052 China.

In order to improve the speed and efficiency of dynamic route solution for traffic network, the paper constructs parallel simulation solution framework using distributed and parallel simulation technology and illuminates parallel simulation strategy which master process assigns sub-task to slave process. At the same time, the parallel simulation algorithm and implemented process of dynamic route solution are designed in microscopic simulation level. It puts forwards network-partition algorithm based on each intersection and communication mode of synchronization between processes to realize dynamic load balancing. It expatiates on the parallelism of simulation module and simulation control of solution algorithm. With designed parallel algorithm, traffic network that is made up of 12 intersections is modeled on different numbers of processors. Results from the simulation demonstrate that simulation speed increases about 2.5 times. Hence, the designed parallel simulation algorithm provides a foundation for larger scale dynamic route solution.

关键词： simulation the Design and Implement of parallel Simulation Algorithm of Dynamic Route Solution for Traffic Network

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：