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

An Efficient and Flexible Deterministic Framework for Multithreaded Programs

Journal of computer science & Technology 2015年第1期30卷 42-56页

作者：卢凯周旭王小平 Tom Bergan 陈沉 Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China College of Computer National University of Defense Technology Changsha 410073 China Department of Computer Science and Engineering University of Washington Seattle WA 98195-2350 U.S.A.

Determinism is very useful to multithreaded programs in debugging, testing, etc. Many deterministic ap- proaches have been proposed, such as deterministic multithreading （DMT） and deterministic replay. However, these sys- tems either are inefficient or target a single purpose, which is not flexible. In this paper, we propose an efficient and flexible deterministic framework for multithreaded programs. Our framework implements determinism in two steps： relaxed determinism and strong determinism. Relaxed determinism solves data races eificiently by using a proper weak memory consistency model. After that, we implement strong determinism by solving lock contentions deterministically. Since we can apply different approaches for these two steps independently, our framework provides a spectrum of deterministic choices, including nondeterministic system （fast）, weak deterministic system （fast and conditionally deterministic）, DMT system, and deternfinistic replay system. Our evaluation shows that the DMT configuration of this framework could even outperform a state-of-the-art DMT system.

关键词： determinism multithreading framework flexible

来源：评论

学校读者我要写书评

暂无评论

Semantic web service composition using answer set planning

引用

International Journal of Advancements in Computing Technology 2011年第5期3卷 20-31页

作者： Qian, Jun-Yan Huang, Guo-Wang Zhao, Ling-Zhong National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Department of Computer science and engineering Guilin University of Electronic Technology Guilin 541004 China

This paper presents a method that adapting planning description to bring the semantic information into play for service composition through action language C. It shows how service descriptions can be expressed by preconditions and effects and the action language C provides a richer syntax and semantic for complex service descriptions. We also presents the algorithm of Translating semantic Web service described by OWL-S to action language C. Thanks to the structured description and the powerful expression of C, we only consider the initial Situation and the desired goal ignoring details of transition and planning. At last we use satisfiability planning to solve the planning problem by translating the action language into disjunctive logic program.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Efficiently indexing sparse wide tablesin cloud computing

引用

Information Technology Journal 2013年第20期12卷 5415-5423页

作者： Huang, Bin Peng, Yuxing Department of Computer Huaihua University 418008 Huaihua China School of Computer Science Wuhan University 430072 Wuhan China National Laboratory of Parallel and Distributed Processing National University of Defense Technology 410073 Changsha China

For its perception of unlimited resources and infinite scalability, Cloud Computing has emerged as a pervasive paradigm for hosting? data-centric applications in large computing infrastructures. The data produced by these applications are essentially sparse and wide and may change schema frequently, traditional relational data model is inappropriate for their data management. A new data model, called Sparse Wide Table, was introduced for this task. Unfortunately, we have to face many challenges in building the secondary index for Sparse Wide Table in cloud, as the distributed and column-oriented storage which eliminates a number of NULLs. In this study, we present a three-level index scheme for efficient data processing in the Cloud. Our approach can be summarized as follows. First, we build an index for each column by which the records can be rebuilt easily. Second, we build a bitmap index for each storage node which only indexes the data residing on the node. Third, we organize the storage nodes as a structured overlay and each node maintains a portion of the global index for the all different data. The global index is a bitmap index to indicate the node each data resides in. Finally, based on the three-level index scheme, some query algorithms are implemented. We conduct extensive experiments on a LAN and the results demonstrate that our indexing scheme is dynamic, efficient and scalable. © 2013 Asian Network for Scientific Information.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

parallel pipeline implementation for moving objects detection in traffic video analysis on a heterogeneous platform 4th

Parallel pipeline implementation for moving objects detectio...

引用

4th International Conference on computer Engineering and Networks, CENet2014

作者： Li, Teng Dou, Yong Jiang, Jingfei Qiao, Peng Department of Computer Science National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

ISBN: (纸本)9783319111032

Moving objects detection is important in traffic video analysis, and many algorithms are being increasingly applied to moving objects detection. Most of these algorithms are time-consuming and cannot satisfy real-time demand in traffic video analysis by using a conventional central processing unit (CPU) sequential method. The emergence of the graphics processing unit (GPU) and multi-core CPU provides a method to accelerate the aforementioned algorithms to meet demand. In this study, we provide a GPU-accelerated implementation of the background subtraction algorithm and the morphological operation algorithm. Then, the connected component labeling algorithm is parallelized on a multi-core CPU with Open Multi-processing (OpenMP). Furthermore, parallel pipeline implementation on a heterogeneous platform is proposed by integrating the aforementioned algorithms. Experimental results show that the proposed implementation achieves a significant speedup of up to 5×, compared with sequential implementation on a CPU. © Springer International Publishing Switzerland 2015.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for SI transactions serializability in cloud computing

引用

Information Technology Journal 2013年第24期12卷 8435-8445页

作者： Huang, Bin Peng, Yuxing Peng, Xiaoning School of Computer Science Wuhan University Wuhan 430072 China Department of Computer Huaihua University Huaihua 418008 China National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

There are well known anomalies permitted by snapshot isolation that can lead to violations of data consistency by interleaving transactions that individually maintain consistency. Until now, there are some ways to prevent these anomalies only in single computer and there are not the corresponding solving methods in cloud computing. This paper describes our PDCC algorithm to detect cycles in a snapshot isolation dependency graph and abort transactions to break the cycle in cloud computing. The algorithm ensures serializable executions for SI transactions in cloud computing. Based on the transaction concurrency control of Percolator, we have implemented our algorithm in an open source cloud database system (HBase) and our performance study shows that PDCC throughput and scalability are good. © 2013 Asian Network for Scientific Information.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Protocol for the fabrication of self-standing (nano)cellulose-based 3D scaffolds for tissue engineering

引用

STAR Protocols 2025年第1期6卷 103583页

作者： Mohan, Tamilselvan Bračič, Matej Bračič, Doris Lackner, Florian Nagaraj, Chandran Štiglic, Andreja Dobaj Kargl, Rupert Kleinschek, Karin Stana Graz University of Technology Institute for Chemistry and Technology of Biobased System (IBioSys) Stremayrgasse 9 Graz 8010 Austria University of Maribor Faculty of Mechanical Engineering Laboratory for Characterization and Processing of Polymers Smetanova Ulica 17 Maribor 2000 Slovenia Department of Internal Medicine Division of Pulmonology Medical University of Graz Graz Austria Institute of Automation Faculty of Electrical Engineering and Computer Science University of Maribor Maribor Slovenia Members of the European Polysaccharide Network of Excellence (EPNOE) Austria

Three-dimensional (3D) and porous scaffolds made from nanocellulosic materials hold significant potential in tissue engineering (TE). Here, we present a protocol for fabricating self-standing (nano)cellulose-based 3D scaffolds designed for in vitro testing of cells from skin and cartilage tissues. We describe steps for preparation of nanocellulose ink, scaffold formation using 3D printing, and freeze-drying. We then detail post-processing procedures to enhance mechanical properties, stability, and biocompatibility. This protocol offers researchers a framework for developing versatile and sustainable biomaterials for regenerative medicine. For complete details on the use and execution of this protocol, please refer to Mohan et al.¹ and Štiglic et al.² © 2025 The Authors

关键词： Biotechnology and bioengineering Chemistry Material sciences Tissue Engineering

来源：评论

学校读者我要写书评

暂无评论

An object-based parallel rendering system 4

An object-based parallel rendering system

引用

4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000

作者： Park, J. Choi, Moon-Hee Hong, Won-Kee Park, Woo-Chan Kim, Shin-Dug LG Information and Communications Ltd. China Parallel Processing Laboratory Department of Computer Science Yonsei University Korea Republic of

ISBN: (纸本)0769505902

Image composition architecture for polygon rendering is the most promising candidate for high performance. It does not suffer from any disadvantage of screen subdivision architecture (i.e., load imbalance and increased clipping time). However, in this architecture, the image composition operation cannot be overlapped with the calculation operation for computing an image and the memory requirement for local frame buffer is very large. The object based parallel rendering system (OBPRS) that is based on the image composition architecture is proposed and the objective of the OBPRS is to remove the disadvantages of the image composition architecture. According to the simulation results with a 64-renderer system, the OBPRS takes only about 80% of the rendering time of the image composition architecture. Also, it requires only 85% of the memory requirement for local frame buffer of the screen subdivision architecture. Thus the OBPRS turns out to be an effective system model, providing high performance to cost ratio. © 2000 IEEE.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

Semantic Representation of Evidence-Based Medical Guidelines and Its Use Cases

引用

Wuhan University Journal of Natural sciences 2015年第5期20卷 397-404页

作者： HU Qing HUANG Zhisheng GU Jinguang College of Computer Science and Technology Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Department of Computer Science Vrije University Amsterdam

Semantic representation of evidence-based medical guidelines provides the support for the data inter-operability and has been found many applications in the medical domain. In this paper, we describe a semantic representation approach of evidence-based medical guidelines, which is based on the Semantic Web Technology standards. We discuss several use cases of that semantic representation of evidence-based medical guideline, and show that they are potentially useful for medical applications.

关键词： evidence-based medical guidelines semantic repre- sentation semantic technology use cases

来源：评论

学校读者我要写书评

暂无评论

Mem Brain: An Easy-to-Use Online Webserver for Transmembrane Protein Structure Prediction

引用

Nano-Micro Letters 2018年第1期10卷 12-19页

作者： Xi Yin Jing Yang Feng Xiao Yang Yang Hong-Bin Shen Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Department of Computer Science Shanghai Jiao Tong University Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering

Membrane proteins are an important kind of proteins embedded in the membranes of cells and play crucial roles in living organisms, such as ion channels,transporters, receptors. Because it is difficult to determinate the membrane protein's structure by wet-lab experiments,accurate and fast amino acid sequence-based computational methods are highly desired. In this paper, we report an online prediction tool called Mem Brain, whose input is the amino acid sequence. Mem Brain consists of specialized modules for predicting transmembrane helices, residue–residue contacts and relative accessible surface area of a-helical membrane proteins. Mem Brain achieves aprediction accuracy of 97.9% of ATMH, 87.1% of AP,3.2 ± 3.0 of N-score, 3.1 ± 2.8 of C-score. Mem BrainContact obtains 62%/64.1% prediction accuracy on training and independent dataset on top L/5 contact prediction,respectively. And Mem Brain-Rasa achieves Pearson correlation coefficient of 0.733 and its mean absolute error of13.593. These prediction results provide valuable hints for revealing the structure and function of membrane *** Brain web server is free for academic use and available at ***/bioinf/Mem Brain/.

关键词： Transmembrane a-helices Structure prediction Machine learning Contact map prediction Relative accessible surface area

来源：评论

学校读者我要写书评

暂无评论

Effective top-down active learning for hierarchical text classification

引用

17th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2013

作者： Li, Xiao Ling, Charles X. Wang, Huaimin Department of Computer Science University of Western Ontario Canada National Laboratory for Parallel and Distributed Processing National University of Defense Technology China

ISBN: (纸本)9783642374555

Hierarchical text classification is an important task in many real-world applications. To build an accurate hierarchical classification system with many categories, usually a very large number of documents must be labeled and provided. This can be very costly. Active learning has been shown to effectively reduce the labeling effort in traditional (flat) text classification, but few works have been done in hierarchical text classification due to several challenges. A major challenge is to reduce the so-called out-of-domain queries. Previous state-of-the-art approaches tackle this challenge by simultaneously forming the unlabeled pools on all the categories regardless of the inherited hierarchical dependence of classifiers. In this paper, we propose a novel top-down hierarchical active learning framework, and effective strategies to tackle this and other challenges. With extensive experiments on eight real-world hierarchical text datasets, we demonstrate that our strategies are highly effective, and they outperform the state-of-the-art hierarchical active learning methods by reducing 20% to 40% queries. © Springer-Verlag 2013.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：