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

An extended transaction model based on THP protocol

International Review on Computers and software 2012年第5期7卷 2466-2471页

作者： Liu, Hai Chen, Jian Zhang, Jianwei Deng, Pan Ma, Shilong School of Computer Science and Technology Beihang University Beijing 100083 China Lab of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing 100190 China

In large scale collab.rative systems tremendous amount of various equipment run cooperatively in a certain relatively vast area. Involved with a large number of transaction activities and processing a quite different environment, these systems need appropriate transaction management different from its traditional counterparts in many different ways. First, more flexible working target makes higher availab.lity of alternative resources in the system. Second, resource providers are more intelligent and can judge for themselves whether to provide resources to the transaction initiator. Third, different from data manipulation, the impact of device operation is often irreversible. Due to these characteristics, we propose an extension model based on THP (Tentative Hold Protocol) protocol and add a phrase of coordination before transaction execution. What is more, we abandon FIFO booking algorithm of THP and introduce the concept of Transaction Success Probability and Compensation Cost to optimize the calculation. Experimental data indicate that extended THP transaction model can significantly improve the efficiency of resource allocation and reduce compensation consideration. © 2012 Praise Worthy Prize S.r.l. - All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

VISCERAL: Towards large data in medical imaging - Challenges and directions

VISCERAL: Towards large data in medical imaging - Challenges...

引用

3rd MICCAI International Workshop on Medical Content-Based Retrieval for Clinical Decision Support, MCBR-CDS 2012

作者： Langs, Georg Hanbury, Allan Menze, Bjoern Müller, Henning Computational Image Analysis and Radiology Lab. Department of Radiology Medical University of Vienna Austria Institute for Software Technology and Interactive Systems Faculty of Computer Science Vienna University of Technology Austria Computer Vision Lab. ETH Zurich Switzerland Switzerland

ISBN: (纸本)9783642366772

The increasing amount of medical imaging data acquired in clinical practice holds a tremendous body of diagnostically relevant information. Only a small portion of these data are accessible during clinical routine or research due to the complexity, richness, high dimensionality and size of the data. There is consensus in the community that leaps in this regard are hampered by the lack of large bodies of data shared across research groups and an associated definition of joint challenges on which development can focus. In this paper we describe the objectives of the project Visceral. It will provide the means to jump-start this process by providing access to unprecedented amounts of real world imaging data annotated through experts and by using a community effort to generate a large corpus of automatically generated standard annotations. To this end, Visceral will conduct two competitions that tackle large scale medical image data analysis in the fields of anatomy detection, and content-based image retrieval, in this case the retrieval of similar medical cases using visual data and textual radiology reports. © 2013 Springer-Verlag.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Research of register pressure aware loop unrolling optimizations for compiler 3

Research of register pressure aware loop unrolling optimizat...

引用

3rd International Conference on Circuits and Systems, CAS 2018

作者： Liu, Xuehua Ding, Liping Li, Yanfeng Chen, Guangxuan Du, Jin Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Digital Forensics Lab Institute of Software Application Technology Guangzhou and Chinese Academy of Sciences Guangzhou China Zhejiang Police College Hangzhou China Yunnan Police College Kunming China

Register pressure problem has been a known problem for compiler because of the mismatch between the infinite number of pseudo registers and the finite number of hard registers. Too heavy register pressure may results in register spilling and then leads to performance degradation. There are a lot of optimizations, especially loop optimizations suffer from register spilling in compiler. In order to fight register pressure and therefore improve the effectiveness of compiler, this research takes the register pressure into account to improve loop unrolling optimization during the transformation process. In addition, a register pressure aware transformation is able to reduce the performance overhead of some fine-grained randomization transformations which can be used to defend against ROP attacks. Experiments showed a peak improvement of about 3.6% and an average improvement of about 1% for SPEC CPU 2006 benchmarks and a peak improvement of about 3% and an average improvement of about 1% for the LINPACK benchmark. © 2018 The Authors, published by EDP sciences.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

The biometric menagerie-A fuzzy and inconsistent concept

The biometric menagerie-A fuzzy and inconsistent concept

引用

5th International Workshop on Soft Computing Applications, SOFA 2012

作者： Popescu-Bodorin, Nicolaie Balas, Valentina Emilia Motoc, Iulia Maria Artificial Intelligence and Computational Logic Lab. Mathematics and Computer Science Department Spiru Haret University Bucharest Romania Automatics and Applied Software Department Faculty of Engineering Aurel Vlaicu University Arad Romania

ISBN: (纸本)9783642339400

This paper proves that in iris recognition, the concepts of sheep, goats, lambs and wolves-as proposed by Doddington and Yager in the so-called Biometric Menagerie, are at most fuzzy and at least not quite well defined. They depend not only on the users or on their biometric templates, but also on the parameters that calibrate the iris recognition system. This paper shows that, in the case of iris recognition, the extensions of these concepts have very unsharp and unstable (non-stationary) boundaries. The membership of a user to these categories is more often expressed as a degree (as a fuzzy value) rather than as a crisp value. Moreover, they are defined by fuzzy Sugeno rules instead of classical (crisp) definitions. For these reasons, we said that the Biometric Menagerie proposed by Doddington and Yager could be at most a fuzzy concept of biometry, but even this status is conditioned by improving its definition. All of these facts are confirmed experimentally in a series of 12 exhaustive iris recognition tests undertaken for University of Bath Iris Image Database while using three different iris code dimensions (256x16, 128x8 and 64x4), two different iris texture encoders (Log Gabor and Haar Hilbert) and two different types of safety models. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Biometrics

来源：评论

学校读者我要写书评

暂无评论

CLSIFT: An Optimization Study of the Scale Invariance Feature Transform on GPUs

CLSIFT: An Optimization Study of the Scale Invariance Featur...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Weiyan Wang Yunquan Zhang Long Guoping Shengen Yan Haipeng Jia School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China State Key Laboratory of Computing Science Institute of Software Chinese Academy of Sciences Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences

Scale Invariance Feature Transform (SIFT) is quite suitable for image matching because of its invariance to image scaling, rotation and slight changes in illumination or viewpoint. However, due to high computation complexity it's technically challenging to deploy SIFT in real time application situations. To address this problem, we propose CLSIFT, an OpenCL based highly speeded up and performance portable SIFT solution. Important optimization techniques employed in CLSIFT such as: (1) For less global memory traffic, independent logical functions are merged into the same kernel to reuse data. (2) loop buffers are introduced in for data and intermediate results reusing. (3)Task queue used to schedule threads in the same branch to remove branch divergences. (4) Data partition is based on the statics patterns for workload balance among workgroups. (5) Overlap of CPU time and better parallel strategies are used too. With all mentioned efforts, CLSIFT processes lena. jpg at 74.2 FPS and 43.4FPS respectively on NVidia and AMD GPUS, much higher than CPU's nearly 10 FPS and the known fastest SIFTGPU's 39.8 FPS and 13FPS. Moreover in a quantitative comparison approach we analyze those successful strategies beating SIFTGPU, a famous existing GPU implementation. Additionally, we observe and conclude that NVidia GPU achieves better occupancy and performance due to some factors. Finally, we summarize some techniques and empirical guiding principles that may be shared by other applications on GPU.

关键词： Graphics processing units Instruction sets Kernel Accuracy Histograms Optimization Memory management

来源：评论

学校读者我要写书评

暂无评论

GB-RC4: Effective brute force attacks on RC4 algorithm using GPU 7

GB-RC4: Effective brute force attacks on RC4 algorithm using...

引用

7th International Green and Sustainable Computing Conference, IGSC 2016

作者： Xue, Pei Li, Tao Dong, Han Liu, Chunbo Ma, Wenjing Pei, Songwen College of Computer and Control Engineering Nankai University Tianjin300071 China Information Security Evaluation Center Civil Aviation University of China Tianjin300300 China Laboratory of Parallel Software and Computational Science State Key Laboratory of Computing Science Institute of Software CAS Beijing China Shanghai Key Lab of Modern Optical Systems Department of Computer Science and Engineering University of Shanghai for Science and Technology Shanghai200093 China

ISBN: (纸本)9781509051175

Encryption algorithms are applied to a variety of fields and the security of encryption algorithms depends heavily on the computational infeasibility of exhaustive key-space search. RC4 algorithm has an extensive application for stream encryption, however, the disadvantages of traditional RC4 serial algorithm are large computational quantity and slow computation speed, which means a great challenge for throughput of computing system. Graphics processors recently have been widely used as accelerators for high throughput computing. In this paper, GPU is used to improve the efficiency and performance of attacking RC4 algorithm. First, we revised RC4 algorithm to make it easier to parallelize on a GPU. Then we take advantage of constant memory and shared memory in GPU to search the key space of RC4 algorithm efficiently. Besides, we solved the bank conflict problem in shared memory to further improve the performance. Our approach was evaluated in the whole key space of 40-bit, and the results show it can complete searching of the whole key space within 12.8 hours. © 2016 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A novel workflow engine method and metadata directory method to meet the mapping requirements between data and services

引用

International Review on Computers and software 2012年第7期7卷 3589-3593页

作者： Zhang, Jianwei Teng, Yuntian Deng, Pan Cai, Ming Ma, Shilong State Key Laboratory of Software Development Environment BeiHang University Beijing China Institute of Geophysics China Earthquake Administration Beijing China Lab of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China

National Earthquake Data Sharing and Exchanging Platform (i.e. National Earthquake Data Grid) is used to solve the demands of data sharing, interoperability and coordinately access in earthquake industry. However, the heterogeneous, distributed and variety data resources make it difficult to share and coordinately access. This paper first propose a novel workflow engine method, which uses Globus service to package heterogeneous resources to achieve the unified access, workflow technology to achieve the coordinately access in distributed environment, and metadata directory method to meet the mapping requirements between data and services. Then we implement this workflow engine in Earthquake Data Grid. Experiment results show that our system can be expanded and applied to other appropriate industries. © 2012 Praise Worthy Prize S.r.l.

关键词： Earthquakes

来源：评论

学校读者我要写书评

暂无评论

Continuations for parallel logic programming 00

Continuations for parallel logic programming

引用

Proceedings of the 2nd International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming (PPDP'00)

作者： Todoran, Eneia Papaspyrou, Nikolaos S. Technical University of Cluj-Napoca Dept. of Computer Science Parallel/Distributed Syst. Lab. Baritiu Str. 28 3400 Cluj-Napoca Romania Natl. Technical University of Athens Dept. of Elec./Computer Engineering Software Engineering Laboratory 15780 Zografou Greece

ISBN: (纸本)1581132654

This paper gives denotational models for three logic programming languages of progressive complexity, adopting the "logic programming without logic" approach. The first language is the control flow kernel of sequential Prolog, featuring sequential composition and backtracking. A committed-choice concurrent logic language with parallel composition (parallel AND) and don't care nondeterminism is studied next. The third language is the core of Warren's basic Andorra model, combining parallel composition and don't care nondeterminism with two forms of don't know nondeterminism (interpreted as sequential and parallel OR) and favoring deterministic over nondeterministic computation. We show that continuations are a valuable tool in the analysis and design of semantic models for both sequential and parallel logic programming. Instead of using mathematical notation, we use the functional programming language Haskell as a metalanguage for our denotational semantics, and employ monads in order to facilitate the transition from one language under study to another.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Optimal evolutionary computational parameters for habitat structures optimization

Optimal evolutionary computational parameters for habitat st...

引用

Earth and Space 2006 - 10th Biennial International Conference on Engineering, Construction, and Operations in Challenging Environments

作者： Hull, Patrick V. Sansoucie, Michael Dozier, Gerry Tinker, Mike NASA Marshall Space Flight Center Spacecraft and Vehicle Systems Dept./EV11 Huntsville AL 35812 United States Applied Computational Intelligence Lab. Department of Computer Science Amd Software Engineering Auburn University Auburn AL 36849-5347

ISBN: (纸本)0784408300

Long-duration surface missions to the Moon and Mars will require bases to accommodate habitats for the astronauts, as well as indoor lab.ratory facilities, in-situ resource plants, power plants, and scientific/surface mobility equipment. Transporting the materials and equipment required to build the necessary habitats would be costly and difficult. However, the use of planetary resources to produce construction materials, or even as naturally found (such as lunar regolith utilized as an outer layer for radiation shielding, or regolith in bags as wall structure), could drastically reduce the upmass for habitats. The materials chosen for the habitat walls play a direct role in protection against each of the mentioned hazards. Choosing the best materials, their configuration, and the amount required is extremely difficult due to the immense size of the design region. For example a 3-layer habitat wall created from 20 possible materials all with varying thicknesses would have #number of layers(possible material types)∧(possible thicknesses) = 320∧inf possible solutions. Clearly, an optimization method is warranted for habitat wall design. Standard optimization techniques are not suitable for problems with such large search spaces. To overcome the large search regions, a habitat wall design tool using genetic algorithms has been developed. GAs use a "survival of the fittest" philosophy, where the most fit individuals are more likely to survive and reproduce, therefore transmitting their genes to the next generation. This paper focuses on finding optimal GA parameters for the habitat optimization tool. This tool is a multiobjective formulation of structural analysis, heat loss, radiation, and meteoroid protection. Some of the constraint calculations (i.e. safety factor, deflection, and heat loss) require long computation times. Even though each material has a designated thickness range, the number of different values within that range is near infinite;therefore, the searc

关键词： Lunar missions

来源：评论

学校读者我要写书评

暂无评论

Learning beyond predefined lab.l space via Bayesian nonparametric topic modelling

arXiv

引用

arXiv 2019年

作者： Du, Changying Fuzhen Zhuang, B. He, Jia He, Qing Long, Guoping Institute of Computing Technology CAS Beijing100190 China Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing100190 China Huawei Noah's Ark Lab Beijing100085 China

In real world machine learning applications, testing data may contain some meaningful new categories that have not been seen in lab.led training data. To simultaneously recognize new data categories and assign most appropriate category lab.ls to the data actually from known categories, existing models assume the number of unknown new categories is pre-specified, though it is difficult to determine in advance. In this paper, we propose a Bayesian nonparametric topic model to automatically infer this number, based on the hierarchical Dirichlet process and the notion of latent Dirichlet allocation. Exact inference in our model is intractable, so we provide an efficient collapsed Gibbs sampling algorithm for approximate posterior inference. Extensive experiments on various text data sets show that: (a) compared with parametric approaches that use pre-specified true number of new categories, the proposed nonparametric approach can yield comparable performance;and (b) when the exact number of new categories is unavailab.e, i.e. the parametric approaches only have a rough idea about the new categories, our approach has evident performance advantages. Copyright © 2019, The Authors. All rights reserved.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：