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

An architecture description language based on dynamic description logics 1

7th IFIP International Conference on Intelligent Information Processing, IIP 2012

作者： Wang, Zhuxiao Peng, Hui Guo, Jing Zhang, Ying Wu, Kehe Xu, Huan Wang, Xiaofeng School of Control and Computer Engineering State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources North China Electric Power University Beijing 102206 China Education Technology Center Beijing International Studies University Beijing 100024 China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing 100029 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (数字)9783642328916

ISBN: (纸本)9783642328909

ADML is an architectural description language based on Dynamic Description Logic for defining and simulating the behavior of system architecture. ADML is being developed as a new formal language and/or conceptual model for representing the architectures of concurrent and distributed systems, both hardware and software. ADML embraces dynamic change as a fundamental consideration, supports a broad class of adaptive changes at the architectural level, and offers a uniform way to represent and reason about both static and dynamic aspects of systems. Because the ADML is based on the Dynamic Description Logic DDL( (D)), which can represent both dynamic semantics and static semantics under a unified logical framework, architectural ontology entailment for the ADML languages can be reduced to knowledge base satisfiability in DDL( (D)), and dynamic description logic algorithms and implementations can be used to provide reasoning services for ADML. In this article, we present the syntax of ADML, explain its underlying semantics using the Dynamic Description Logic DDL( (D)), and describe the core architecture description features of ADML. © 2012 IFIP International Federation for Information Processing.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

A novel image compression encoding algorithm

引用

Guangdianzi Jiguang/Journal of Optoelectronics Laser 2012年第6期23卷 1173-1180页

作者： Zhang, De-Gan Kang, Xue-Jing Wang, Jing-Hui Key Laboratory of Computer Vision and System Ministry of Education Tianjin Key Laboratory of Intelligent Computing and Novel Software Technology Tianjin University of Technology Tianjin 300384 China

In this paper, the image compression encoding algorithm is improved. The first, the high-frequency coefficients are transformed to the spherical domain to reduce the correlation in the same scale. Then, based on two premises, the multi-scale model product is defined, which is used to control the shrinkage function. In this way, the small wavelet coefficients and some noise can be removed. This strategy ensures a higher compression ratio. The low-frequency part is coded by DPCM, the high-frequency parts in spherical domain are coded by the improved set partitioning in hierachical trees (SPIHT) algorithm. In the new algorithm, the matrix of maximum pixel (MMP) is introduced to overcome the disadvatage of the traditional SPIHT algorithm. Experimetal results indicate that the new algorithm is effective and improves the images signal to noise ratio.

关键词： Image compression

来源：评论

学校读者我要写书评

暂无评论

Software services protection security protocol based on software watermarking in cloud environment

引用

Tongxin Xuebao/Journal on Communications 2012年第SUPPL.2期33卷 176-181页

作者： Xu, Jin-Chao Zeng, Guo-Sun Wang, Wei Department of Computer Science and Technology Tongji University Shanghai 201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 201804 China

Aimed to resist the infringement of software services in cloud environment, a software services protection security protocol based on software watermarking in cloud environment was presented. On the consideration of actual needs in cloud computing, the protocol introduced the software watermarking as a service cloud which was responsible for software watermark embedding and extraction. The protocol not only met the basic requirements of software copyright protection, but also gived the detailed strategy to solve the infringement, and hardened the ability of the software watermarking to resist various attacks. The analysis shows that the proposed protocol has higher security.

关键词： Copyrights

来源：评论

学校读者我要写书评

暂无评论

Design for Testability Features of Godson-3 Multicore Microprocessor

引用

Journal of Computer Science & technology 2011年第2期26卷 302-313页

作者：齐子初刘慧李向库胡伟武 Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Institute of Computing Technology Chinese Academy of Sciences Loongson Technologies Corporation Limited

This paper describes the design for testability （DFT） challenges and techniques of Godson-3 microprocessor, which is a scalable multicore processor based on the scalable mesh of crossbar （SMOC） on-chip network and targets high-end applications. Advanced techniques are adopted to make the DFT design scalable and achieve low-power and low-cost test with limited IO resources. To achieve a scalable and flexible test access, a highly elaborate test access mechanism （TAM） is implemented to support multiple test instructions and test modes. Taking advantage of multiple identical cores embedding in the processor, scan partition and on-chip comparisons are employed to reduce test power and test time. Test compression technique is also utilized to decrease test time. To further reduce test power, clock controlling logics are designed with ability to turn off clocks of non-testing partitions. In addition, scan collars of CACHEs are designed to perform functional test with low-speed ATE for speed-binning purposes, which poses low complexity and has good correlation results.

关键词： DFT （design for testability） TAM （test access mechanism） multicore processor low power test

来源：评论

学校读者我要写书评

暂无评论

Scaling Laws of Multicast Capacity for Power-Constrained Wireless Networks under Gaussian Channel Model

引用

IEEE Transactions on Computers 2012年第5期61卷 713-725页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Shaojie Tang Yuan He Xufei Mao Yunhao Liu Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering Building of Electronics and Information Engineering University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA Tsinghua National Laboratory for Information Science and Technology (TNLIST) Tsinghua University Beijing China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Hong Kong University of Science and Technology Kowloon Hong Kong China Tsinghua National Laboratory for Information Science and Technology (TNLIST) School of Software Tsinghua University Beijing China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing China

We study the asymptotic networking-theoretic multicast capacity bounds for random extended networks (REN) under Gaussian channel model, in which all wireless nodes are individually power-constrained. During the transmission, the power decays along path with attenuation exponent α >; 2. In REN, n nodes are randomly distributed in the square region of side length √n. There are n s randomly and independently chosen multicast sessions. Each multicast session has n d + 1 randomly chosen terminals, including one source and n d destinations. By effectively combining two types of routing and scheduling strategies, we analyze the asymptotic achievable throughput for all n s = ω(1) and nd. As a special case of our results, we show that for n s = Θ(n), the per-session multicast capacity for REN is of order Θ(1/√n d n) when nd = O(n/(log n) a+1 ) and is of order Θ(1/n d · (log n) -n/2 ) when n d = Ω(n/log n).

关键词： Lattices Throughput Upper bound Road transportation Receivers Interference Routing

来源：评论

学校读者我要写书评

暂无评论

Evolution of Cooperation in Public Goods Games

引用

Communications in Theoretical Physics 2011年第10期56卷 638-644页

作者：夏承遗张娟娟王祎玲王劲松 Key Laboratory of Computer Vision and System(Tianjin University of Technology) Ministry of Education Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology College of Life Science Shanxi Normal University

We investigate the evolution of cooperation with evolutionary public goods games based on finite populations, where four pure strategies： cooperators, defectors, punishers and loners who are unwilling to participate are considered. By adopting approximate best response dynamics, we show that the magnitude of rationality not only quantitatively explains the experiment results in [Nature （London） 425 （2003） 390], but also it will heavily influence the evolution of cooperation. Compared with previous results of infinite populations, which result in two equilibriums, we show that there merely exists a special equilibrium cooperation. In addition, we characterize that loner＇s and the relevant high value of bounded rationality will sustain payoff plays an active role in the maintenance of cooperation, which will only be warranted for the low and moderate values of loner＇s payoff. It thus indicates the effects of rationality and loner＇s payoff will influence the cooperation. Finally, we highlight the important result that the introduction of voluntary participation and punishment will facilitate cooperation greatly.

关键词： public goods games magnitude of rationality voluntary participation punishment

来源：评论

学校读者我要写书评

暂无评论

A WIND DIRECTION EXTENSION BASED ALGORITHM FOR SCATTEROMETER WIND VECTOR RETRIEVAL

A WIND DIRECTION EXTENSION BASED ALGORITHM FOR SCATTEROMETER...

引用

IEEE International Geoscience and Remote Sensing Symposium

作者： Xuetong Xie Mingsen Lin Kehai Chen Zhou Huang Lixia Liu Dongxuan Tian Xiaoning Wang Wenxin Chen Rongrong He Juhong Zou Earthquake Engineering Research Test Center Guangzhou University National Satellite Ocean Application Service Institute of Remote Sensing and Geographic Information System Peking University National Key Laboratory of Space Microwave Technology Institute of Space Radio Technology

ISBN: (纸本)9781467311601

According to the lower efficiency and larger wind direction errors in the nadir region of the swath, a new combined wind retrieval algorithm is proposed for conically scanning scatterometer in this paper. The presented algorithm has the dual advantages of both higher efficiency and higher wind direction retrieval accuracy by combining the wind speed standard deviation algorithm and the wind direction interval retrieval (DIR) algorithm. It adopts wind speed standard deviation as criterion for searching possible wind vector solutions and retrieves potential wind direction interval for the first and second ambiguities based on the change rate of the wind speed standard deviation. Some SeaWinds L2A data and collocated buoy data were used to validate the algorithm. Retrieval experiments indicated that the algorithm can significantly reduce the wind direction retrieval errors in the nadir region.

关键词： Conically scanning scatterometer Wind vector retrieval Wind speed standard deviation Wind direction extension algorithms wind direction retrieval Wind change rate Scatterometers Adopted wind speed

来源：评论

学校读者我要写书评

暂无评论

Maximally permissive control of flexible manufacturing systems with fewest disjunctive constraints

Maximally permissive control of flexible manufacturing syste...

引用

International Conference on Advanced Mechatronic systems (ICAMechS)

作者： YuFeng Chen MengChu Zhou XiaoOu Li School of Electro-Mechanical Engineering Xidian University Xi'an China Key Laboratory of Embedded System and Service Computing Ministry of Education University of Tongji Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA Departamento de Computacion CINVESTAVIPN Mexico Distrito Federal Mexico

For Petri net models whose legal reachability spaces are non-convex, one cannot optimally control them by the conjunctions of linear constraints. This work proposes a method to find a set of linear constraints such that each constraint can forbid all first-met bad markings and every legal marking satisfies at least one constraint. Then, the disjunctions of the obtained constraints can make all legal markings reachable and forbid all first-met bad markings, i.e., the controlled net is live and maximally permissive. The work also develops an integer linear programming model to minimize the number of the constraints. Finally, an example is provided to illustrate the proposed method.

关键词： Law Optimal control Vectors Aerospace electronics Petri nets system recovery

来源：评论

学校读者我要写书评

暂无评论

Infrared human image segmentation using two-dimensional fuzzy tsallis entropy

引用

ICIC Express Letters 2012年第7期6卷 1733-1739页

作者： Yang, Shuhong Liu, Weining Sun, Dihua Zhao, Min Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing University No. 174 Shazhengjie Shapingba Chongqing 400030 China Department of Computer Engineering Guangxi University of Technology No. 268 Donghuan Road Liuzhou 545006 China

Infrared images are by nature fuzzy and thus the segmentation of human targets from them is a challenging task. To handle this ambiguity, a new kind of thresholding method using both the spatial information and fuzziness of image is presented in this paper. We first calculate the 2-D (two-dimensional) histogram of image to make full use of spatial information, and then transform the 2-D histogram into fuzzy domain employing fuzzy membership function. For its excellent capacity in describing nonexten-sive information which widely existed in images, Tsallis entropy is adopted to define a novel 2-D fuzzy entropy, namely 2-D fuzzy Tsallis entropy. And then, the newly defined entropy is applied in the field of image segmentation following maximum entropy principle. The experiments on benchmark images demonstrate the advantages of the proposed method. © 2012 ICIC International.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A cross-layers service discovery protocol for MANET

引用

Journal of Computational Information systems 2012年第12期8卷 5085-5092页

作者： Zhong, Jiang Geng, Shenghua Weng, Luosheng Li, Xue College of Computer Science Chongqing University Chongqing 400044 China School of Information Technology and Electrical Engineering Queensland University Queensland QLD 4072 Australia Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education Chongqing 400044 China

With the rapid development of Internet, MANET is becoming a popular network organization. Automatic service discovery plays an important role in the appliance of auto-finding and using the resource in the dynamic network environment, and it also can reduce the complexity of system configuration and maintenance. This paper proposes a new service discovery protocol called SCAODV which integrates route protocol and the process of service discovery. SCAODV protocol is based on CAODV protocol. The NS2 Simulation experiments prove that SCAODV protocol not only achieve route discovery and service discovery, but also decrease control packets efficiently and keep lower delay of service discovery. SCAODV protocol also achieve security certificate based on the symmetric encryption technology between service requester and service replier in the process of service. © 2012 Binary Information Press.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：