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

Minkowski sum modeling of polyhedra based on VRML

ICIC Express Letters 2013年第2期7卷 455-460页

作者： Zhang, Jianfei Guo, Xijuan Geng, Qingjia Information Science and Engineering College Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province No. 438 Hebei Ave. Qinhuangdao 066004 China Computer and Control Engineering College Qiqihar University No. 42 Wenhua Street Qiqihar 161006 China

On the basis of the introduction to basic methods of the geometry modeling based on virtual reality modeling language (VRML) and the concepts of Minkowski sum computation of polyhedra, we present a method of Minkowski sum computation and three dimensional modeling based on VRML. The method can simplify Minkowski sum computation of general polyhedra, and experimental results indicate that this method can calculate Minkowski sum of general polyhedra much faster and realize three-dimensional representation more accurately. This method can provide important technical references for Minkowski sum visualization of polyhedra. © 2013 ISSN 1881-803X.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

RNA secondary structure prediction based on density-based clustering

引用

ICIC Express Letters 2015年第7期9卷 1965-1970页

作者： Wang, Changwu Wang, Xiuqin Wang, Baowen Liu, Wenyuan Wei, Zhenzhen Li, Yongqiang School of Information Science and Engineering Yanshan University No. 438 Hebei Ave Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave Qinhuangdao China Department of Information The First Hospital of Qinhuangdao No. 258 Hebei Ave Qinhuangdao China

The ribonucleic acid (RNA) secondary structure prediction has designed to characterize the ensemble of structures, instead of only computing the minimum free energy structure. Clustering methods are brought to aid in the characterization of the structure ensemble. These methods group the structures into a small number of clusters. A representative structure for each cluster is computed to characterize the central tendency for the structures in each cluster and used to predict the true secondary structure. This paper introduces a density based clustering with extensible radius dubbed ER-DBSCAN for handling varying density clustering. The basic idea of ER-DBSCAN is to use different values of radius for different densities. It starts from the highest density object towards the lowest density object, and the radius of the cluster is automatically adjusted during cluster expansion according to the density distribution and density variation. Our results indicate that ER-DBSCAN can detect and handle clusters of varying density, and cluster RNA secondary structures effectively. © 2015, ISSN 1881-803X.

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

On the controller synthesis for probabilistic systems of conflict tolerant specification

引用

Journal of Computational Information systems 2011年第4期7卷 1286-1293页

作者： Zhang, Junhua Huang, Zhiqiu Cao, Zining College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing 210016 China Vocational Education Faculty Ningbo University Ningbo 315100 China National Key Laboratory of Science and Technology on Avionics System Integration Shanghai 200233 China

For an embedded control system, different requirements maybe need be satisfied at same time. Always some of them makes the system to act inconsistently, or even conflicted. Conflict tolerant specification is provided to denote this situation. In such a system, there often exist probabilistic and non-deterministic behaviors. We use Markov Decision Process (MDP) to denote these features. Based on this context, we study the controller synthesis for MDP over conflict tolerant specification. We extend PCTL star by adding past operator to denote the conflict tolerant specification succinctly. We use CT-PLTL to denote possibly conflicted actions and PCTL to denote the specification for probability demand. We first synthesize a controller on a base system over CT-PLTL and then use it to prune the corresponding MDP of the system model. We use the resulting sub-MDP as the model to further synthesis a controller over PCTL. The whole controller for MDP is a conjunction of the two controllers obtained. Copyright © 2011 Binary Information Press.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Point cloud coarse matching method for similar objects

引用

ICIC Express Letters 2016年第9期10卷 2283-2289页

作者： Zhao, Qiang Guo, Xijuan Zhang, Buying Bai, Xinyu Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao066004 China College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao066004 China Technical Center Shenyang Aircraft Corporation Shenyang110850 China

Point cloud matching is much more difficult when an initial estimate of the relative pose is not known. In order to reduce the effect of relative pose on matching operation and improve the computing speed, this article presents a method to fast match the pose of two similar objects through the covariance of their point cloud coordinates. This paper contains three parts. In the first part, a matrix is constructed through the values of point coordinates of one object and then a set of orthogonal vectors will be obtained through eigenvector of the matrix. Rotation matrix will be obtained by comparing the vectors of two similar objects. In the second part, a description of procedures is given and the complexity of the algorithm is analyzed. In the last part, the experiment shows the proposed method has high computing efficiency and the matching results are acceptable. © 2016 ICIC International.

关键词： Covariance matrix

来源：评论

学校读者我要写书评

暂无评论

Learning the continuous-time optimal decision law from discrete-time rewards

引用

National Science Open 2024年第5期3卷 130-147页

作者： Ci Chen Lihua Xie Kan Xie Frank Leroy Lewis Yilu Liu Shengli Xie School of Automation Guangdong University of TechnologyGuangdong Key Laboratory of IoT Information TechnologyGuangzhou 510006China Key Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of EducationGuangzhou 510006China School of Electrical and Electronic Engineering Nanyang Technological UniversitySingapore 639798Singapore 111 Center for Intelligent Batch Manufacturing Based on IoT Technology Guangzhou 510006China UTA Research Institute the University of Texas at ArlingtonFort Worth 76118USA Department of Electrical Engineering and Computer Science University of TennesseeKnoxville 37996USA Oak Ridge National Laboratory Oak Ridge 37830USA Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou 510006China

The concept of reward is fundamental in reinforcement learning with a wide range of applications in natural and social *** an interpretable reward for decision-making that largely shapes the system's behavior has always been a challenge in reinforcement *** this work,we explore a discrete-time reward for reinforcement learning in continuous time and action spaces that represent many phenomena captured by applying physical *** find that the discrete-time reward leads to the extraction of the unique continuous-time decision law and improved computational efficiency by dropping the integrator operator that appears in classical results with integral *** apply this finding to solve output-feedback design problems in power *** results reveal that our approach removes an intermediate stage of identifying dynamical *** work suggests that the discrete-time reward is efficient in search of the desired decision law,which provides a computational tool to understand and modify the behavior of large-scale engineering systems using the optimal learned decision.

关键词： continuous-time state and action decision law learning discrete-time reward dynamical systems reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Rain scenes rendering algorithm combining metaball with mass-spring surface

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and technology Edition) 2013年第SUPPL.1期43卷 230-234页

作者： Lyu, Meng-Ya Zheng, Xuan Tang, Yong College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Qinhuangdao 066004 China

To solve the problems such as unreal effects, incomplete details in the rain scene, an algorithm to simulate water surface after rain hitting by combining Meatball with mass-spring water surface was presented. First, the raindrops model was estabished with particle system combining textures, and the water surface model was established with the mass-spring model. Secondly, the algorithm animated half globular bubbles after rain hitting with Meatball. Thirdly, water splash was simulated by means of the particle system and a gradual thinning and syncretizing technique. Finally, with the help of Cg language, the reflection and the refraction effect on the water surface, globular bubbles and water splash were simulated. The experiment shows that this approach can be used to simulate rain scenes efficiently and realistically.

关键词： Rain

来源：评论

学校读者我要写书评

暂无评论

Scalable and Identifier/Locator-Splitting Routing Protocol for Mobile Ad Hoc Networks

引用

China Communications 2012年第1期9卷 102-110页

作者： Wang Haiquan Chen Meng Hu Junshun Xia Chunhe Beijing Key Laboratory of Network Technology Beihang University Beijing 100191 P. R. China School of Computer Science and Engineering Beihang University Beijing 100191 P. R. China State Key Laboratory of Virtual Reality Technology and System Beihang University Beijing 100191 P. R. China School of So ware Beihang University Beijing 100191 P. R. China

In the traditional Intemet Protocol （IP） architecture, there is an overload of IP sermntic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for Mobile Ad Hoc Networks （MANETs）. To improve scalability, a routing protocol for MANETs is presented based on a locator named Tree-structure Locator Distance Vector （TLDV）. The hard core of this routing method is the identifier/locator split by the Distributed Hash Table （DHT） method, which provides a scalable routing service. The node locator indicates its relative location in the network and should be updated whenever topology changes, kocator space ks organized as a tree-structure, and the basic routing operation of the TLDV protocol is presented. TLDV protocol is compared to some classical routing protocols for MANETs on the NS2 platform Results show that TLDV has better scalability. key words：

关键词： MANETs multi-hop routing identifi- er/locator split distributed hash tables

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of synchronization buffering mechanism in peer-to-peer live streaming systems

引用

ICIC Express Letters, Part B: Applications 2012年第6期3卷 1665-1672页

作者： Jin, Shunfu Liu, Na Ma, Zhanyou College of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Avenue Qinhuangdao 066004 China College of Science Yanshan University No. 438 Hebei Avenue Qinhuangdao 066004 China

In the peer-to-peer (P2P) live streaming systems, a single stream is decomposed into multiple sub-streams. For the participating nodes, data blocks of different sub-streams are stored in different sub-buffers for synchronization, then forwarded and assembled to the original video stream in chronological order. In this paper, regarding the sub-buffers as multiple queues with homogeneous Poisson arrival processes, the data block forwarding procedure as a polling service, the forwarding suspension in an empty sub-buffer as a service delay state, a symmetric polling model is constructed. By using the method of embedded Markov chain, the mean queueing length and the probability for one queue to be empty when it is visited are derived in steady-state. Moreover, the performance measures in terms of average synchronization buffering length and video continuity level are obtained accordingly. Finally, numerical results are given to demonstrate that an appropriate number of sub-streams and a reasonable time limit for forwarding suspension can enhance the system performance.© 2012 ISSN 2185-2766.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

The study of a hierarchical hadoop architecture in multiple data centers environment

引用

Open Cybernetics and systemics Journal 2015年第1期9卷 131-137页

作者： Shengtao, Sun Aizhi, Wu Xiaoyang, Liu School of Information Science and Engineering Yanshan University QinhuangdaoHebei066004 China College of Vehicles and Energy Yanshan University QinhuangdaoHebei066004 China Data Industry Research Institute Limited Company QinhuangdaoHebei066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province QinhuangdaoHebei066004 China

Hadoop is a reasonable tool for cloud computing in big data era and MapReduce paradigm may be a highly successful programming model for large-scale data-intensive computing application, but the conventional MapReduce model and Hadoop framework limit themselves to implement jobs within single cluster. Traditional single-cluster Hadoop may not suitable for situations when data and compute resources are widely distributed this paper focuses on the application of Hadoop across multiple data centers and clusters. A hierarchical distributed computing architecture of Hadoop is designed and the virtual Hadoop file system is proposed to provide global data view across multiple data centers. The job submitted by user can be decomposed automatically into several sub-jobs which are then allocated and executed on corresponding clusters by location-aware manner. The prototype based on this architecture shows encouraging results. © Shengtao et al.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

An improved community discovery algorithm in weighted social networks

引用

ICIC Express Letters 2016年第1期10卷 35-41页

作者： Guo, Jingfeng Liu, Miaomiao Liu, Linlin Chen, Xiao College of Information Science and Engineering Yanshan University No. 438 West Hebei Ave Qinhuangdao China College of Information Science and Engineering Northeast Petroleum University No. 199 Fazhan Road Daqing China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province No. 438 West Hebei Ave Qinhuangdao China

The algorithm AGMA (Automatic Graph Mining Algorithm) is improved and a novel community discovery algorithm, namely CRMA (Clustering Re-clustering Merging Algorithm) is proposed which can realize more reasonable community division for weighted social networks. Firstly, in the re-clustering stage, AGMA neglected the clustering situation of neighbors of current node and it did not take the weights of edges connecting the current node and its unclustered neighbors into account, which led to that some nodes cannot be clustered or their clustering was unreasonable. Aiming to this, the concept of the connection compactness between the node and the community is introduced, and then through clustering and re-clustering each node would be divided into the community that has the largest connection compactness with the node according to the node weight, the edge weight and the friend coecient between the node and the community. Secondly, for community division in some unweighted networks and signed networks, if there are many nodes whose clustered neighbors are less than its unclustered neighbors, the division results of AGMA tend to result in the lower modularity. In view of this problem, the concepts of positive edge weight density, the cluster density and the connection coecient between clusters are proposed. Lastly, communities are merged based on the above three concepts after re-clustering and the modularity is eectively enhanced. The higher correctness and better generality of the improved algorithm are veried through experiments. © 2016 ICIC International.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：