检索结果-南通市图书馆

Reusing Legacy Applications for Grid Computing

在线全文

学校读者我要写书评

暂无评论

Reusing Legacy Applications for Grid Computing

2004 International Symposium on Distributed Computing and Applications to Business, engineering and science

作者： Yu Huashan Xu Zhuoqun Ding Wenkui school of Electronic engineering and computer science peking university beijing 100871 P.R.china

＜正＞In scientific computation domains,there are a large number of legacy applications that run on MPPs,clusters and workstations for daily *** single application alone is generally restricted in computability and cannot meet the requirements of modern scientific *** paper presents a component model AOD for coordinating them to solve complex problems on the computational *** on the software component technologies,legacy applications and their target platforms are encapsulated to be grid-programming components on the computational *** grid-programming component provides a set of domain-termed operators that can be referred in grid applications to perform specific computation.A grid-programming component also encapsulates the domain-specific expertise for implementing its operators with the encapsulated *** AOD represents every grid application as an acyclic and directed graph that describes a workflow of references to operators provided by grid-programming *** referred grid-programming components are invoked and coordinated by the AOD at *** have developed a prototype of AOD,and an experimental result is presented to evaluate the implementation.

关键词： Computational Grid Software Component Legacy application Concurrency.

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

结合项约束的闭合模式挖掘研究

计算机科学 2004年第9期31卷 157-160页

作者：王新宇唐世渭北京大学信息科学中心北京100871

事务数据库中频繁模式的挖掘研究作为关联规则等许多数据挖掘问题的核心工作,已经研完了许多年。然而,频繁模式挖掘算法经常产生大量的模式和规则,不但降低了算法的执行效率,同时也使用户从频繁模式产生有用的规则变得很困难。针对这个... 详细信息

事务数据库中频繁模式的挖掘研究作为关联规则等许多数据挖掘问题的核心工作,已经研完了许多年。然而,频繁模式挖掘算法经常产生大量的模式和规则,不但降低了算法的执行效率,同时也使用户从频繁模式产生有用的规则变得很困难。针对这个问题,最近的研究主要集中于两点,一种方法是允许用户附加约束来引导挖掘的过程,通过把约束条件下推到挖掘的底层来缩小模式搜索的空间,提高性能;另一种方法是仅挖掘闭合模式,只产生大于其超集支持度的频繁模式。两种方式都可以大量缩小结果集合的大小,使结果集合更容易被用户理解和使用。那么,把这两种方式相结合,挖掘满足用户约束的闭合频繁模式,理论上来说应该更为高效,更方便理解和使用。基于以上的考虑,做了一些细致的研究,把用户约束分类,并主要讨论了结合项约束的闭合模式生成问题。

关键词：频繁模式约束模式挖掘挖掘算法事务数据库关联规则用户缩小问题方式

A new one-bit diFFerence collision attack on HAVAL-128

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2012年第11期55卷 2521-2529页

作者： ZHANG WenYing1,2,3,LI YanYan1 & WU Lei1 1school of Information science and engineering,Shandong Normal university,Jinan 250014,china 2State Key Lab of Information Security,Institute of Information engineering,Chinese Academy of sciences,beijing 100093,china 3Shandong Provincial Key Laboratory for Novel Distributed computer Software Technology,Jinan 250014,china school of Information science and engineering Shandong Normal University Jinan China State Key Lab of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing China Shandong Provincial Key Laboratory for Novel Distributed computer Software Technology Jinan China

In this paper,we give a new fast attack on *** attack includes many present methods of constructing hash ***,we present a neighborhood *** propose a new difference path different from the previous *** conclusion is that,when the output of each step satisfies our condition,the message m can collide with m'= m + Δm,where Δm =(0,0,0,0,231,0,...,0).There is only one bit difference between m and m'.Two pairs of collision examples for HAVAL-128 are *** order to improve the probability of collision,we use four tricks of message *** attack's running time is less than 225.83 2-pass HAVAL computations,which is the best result for one-bit collision of HAVAL so far.

关键词： cryptography hash function HAVAL-128 collision message modification

Implementing an Artificial Neural Network computer

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems engineering and electronics 1995年第3期6卷 19-24页

作者： Zhu Keqin Luo Siwei & Ding Jiazhong(Dept. of computer science & Technology, Northern Jiaotong university, beijing 100044, china) Dept. of computer science & Technology Northern Jiaotong University Beijing 100044 China

Based on the implementation of NNSPC (Neural NetWork Synchronous Parallel computer) developed by NJU, this paper discusses two schemes for implementing artificial neural network computer withdistributed memories: One is Switch Network Structure; the other is Ring Topology Structure. This papergives a comparison betWeen the two schemes and the principles of scheme selection.

关键词： Artificial neural network Parallel processing Switch network Ring topology

Accountable authority key policy attribute-based encryption

在线全文

学校读者我要写书评

暂无评论

science china(Information sciences) 2012年第7期55卷 1631-1638页

作者： WANG YongTao 1,2 ,CHEN KeFei 1,3 ,LONG Yu 1,4 & LIU ZhaoHui 2 1 Department of computer science and engineering,Shanghai Jiao Tong university,Shanghai 200240,china 2 china Information Technology Security Evaluation Center,beijing 100085,china 3 Shanghai Key Laboratory of Scalable Computing and Systems,Shanghai Jiao Tong university,Shanghai,200240,china 4 State Key Laboratory of Information Security,Graduate school of Chinese Academy of sciences,100039,china Department of computer science and engineering Shanghai Jiao Tong University Shanghai China china Information Technology Security Evaluation Center Beijing China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China State Key Laboratory of Information Security Graduate School of Chinese Academy of Sciences Beijing China

We present an accountable authority key policy attribute-based encryption (A-KPABE) *** this paper,we extend Goyal's work to key policy attribute-based encryption *** first generalize the notion of accountable authority in key policy attribute-based encryption scenario,and then give a *** addition,our scheme is shown to be secure in the standard model under the modified Bilinear Decisional Diffie-Hellman (mBDDH) assumption.

关键词： accountable authority key policy attribute-based encryption standard model access structure

Design of a cross-dipole array acoustic logging tool

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Petroleum science 2008年第2期5卷 105-109页

作者： Lu Junqiang Ju Xiaodong Cheng Xiangyang school of Resources and Information Technology China University of Petroleum Beijing 102249 China school of Petroleum engineering China University of Petroleum Dongying Shandong 257061 China

When entering an anisotropic formation, a shear wave splits into a fast wave and a slow wave. Based on the principle of four-component cross-dipole acoustic wave measurement, the anisotropy of HTI （Horizontal Transverse Isotropy） formation can be determined. The method of calculating the fast and slow wave data when a shear wave propagates along the borehole axis in anisotropic formation was analyzed, and the implementation of a cross-dipole acoustic logging tool was demonstrated. The tool was composed of transmitter electronics, transmitter mandrel, acoustic isolator, receiver mandrel and main control electronics. Sonde, transmitter circuit, signal receiving and processing circuit, data acquisition system, system control circuit and telemetry interface circuit were presented and analyzed. The test model was used in production wells and standard wells in various areas and the four-component cross-dipole waves were acquired and processed. The waves had good signal-to-noise ratio and clear characteristics, and the fast and slow waveforms, processed slowness curves, anisotropy and fast shear wave azimuth well matched with each other.

关键词： Acoustic logging tool cross-dipole anisotropy electronics sonde

A multicast routing algorithm with multiple trees

在线全文

学校读者我要写书评

暂无评论

Journal of Systems engineering and electronics 2005年第2期16卷 426-432页

作者： Cui Xunxue 1,2 , Gao Wei3 & Fang Hongyu41. New Star Research Institute of Applied Technology, Hefei 230031, P. R. china 2. Jiangsu Key Laboratory of computer Information Processing Technology,Soochow university, Suzhou 215006, P. R. china 3. Department of Electronic engineering and Information science,university of science and Technology of china, Hefei 230027, P. R. china 4. school of Electronic science and Technology, Anhui university, Hefei 230039, P. R. china New Star Research Institute of Applied Technology Hefei 230031 P. R. China 2. Jiangsu Key Laboratory of computer Information Processing Technology Soochow University Suzhou 215006 P. R. China Department of Electronic engineering and Information science University of Science and Technology of China Hefei 230027 P. R. China school of Electronic science and Technology Anhui University Hefei 230039 P. R. China

Quality of service (QoS) multicast routing has continued to be a very important research topic in the Internet. A method of multicast routing is proposed to simultaneously optimize several parameters based on multiobjective genetic algorithm, after the related work is reviewed. The contribution lies on that the selection process of such routing is treated with multiobjective optimization. Different quality criterions in IP network are taken into account for multicast communications. A set of routing trees is generated to approximate the Pareto front of multicast problem. Multiple trees can be selected from the final set of nondominated solutions, and applied to obtain a good overall link cost and balance traffic distribution according to some simulation results.

关键词： multicast routing quality of service multiobjective optimization genetic algorithms.

Novel encryption model for multimedia data

在线全文

学校读者我要写书评

暂无评论

Journal of Systems engineering and electronics 2009年第5期20卷 1081-1085页

作者： Ye Dengpan~(1,2) & Lian Shiguo~3 1.The Key Laboratory of Aerospace Information Security and Trust Computing,Ministry of Education,Wuhan 430072,P.R.china 2.school of computer science,Wuhan Univ.,Wuhan 430072,P.R.china 3.France Telecom R&D beijing,beijing 100080,P.R.china The Key Laboratory of Aerospace Information Security and Trust Computing Ministry of Education Wuhan 430072 P. R. China School of Computer Science Wuhan Univ. Wuhan 430072 P. R. China France Telecom R&D beijing Beijing 100080 P. R. China

A novel encryption model is proposed. It combines encryption process with compression process, and realizes compression and encryption at the same time. The model＇s feasibility and security are analyzed in detail. An... 详细信息

关键词： multimedia encryption model compression feasibility security.

在线全文

学校读者我要写书评

暂无评论

计算机网络的长程相关特性

物理学报 2004年第2期53卷 373-378页

作者：刘锋山秀明任勇张军马正新北京航天航空大学电子信息工程学院北京100083 清华大学电子工程系北京100084

针对一种计算机网络模型 ,利用节点排队长度累计量的均方涨落函数 ,研究了网络节点在时间上的长程相关特性 .结果表明 ,随着负载的增加 ,网络节点数据包排队长度在时间上由自由流状态的不相关或短程相关逐渐演变为临界和拥塞时的长程相... 详细信息

针对一种计算机网络模型 ,利用节点排队长度累计量的均方涨落函数 ,研究了网络节点在时间上的长程相关特性 .结果表明 ,随着负载的增加 ,网络节点数据包排队长度在时间上由自由流状态的不相关或短程相关逐渐演变为临界和拥塞时的长程相关 ,关联范围逐渐增大 ,长程关联特性开始显现 .在自由流状态时 ,节点的不相关或短程相关 ,并且有一致的数值为 0 .5的幂指数这一典型特征 .而在临界状态时 ,节点数据包排队长度长程相关 ,有大于0 .5的幂指数为特征 .并且随网络规模的增大 ,节点间的群体作用逐渐显著。

关键词：计算机网络长程相关相变幂律均方涨落函数网络节点节点排队长度累计传输规则