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

2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

作者： Xu, Jin Qiang, XiaoIi Zhang, Kai Zhang, Cheng Yang, Jing Zhang, Rongkui Wang, Hanpin Fan, Yueke Wang, Shudong Dong, Yafei Wang, Zhezhi He, Xingui Key laboratory of High Confidence Software Technologies School of Electronics Engineering and Computer Science Peking University Beijing China College of Computer Science South-Central University for Nationalities Wuhan 430074 China Institute of Biomolecular Computer Huazhong University of Science and Technology Wuhan 430074 China Key Lab. of Ministry of Education for Medicinal Plant Resource and Natural Pharmaceutical Chemistry College of Life Sciences Shaanxi Normal University Xi'an Shaanxi 710062 China

ISBN: (纸本)9781424464388

A DNA computing model for solving graph vertex coloring problem is proposed in this article. To illustrate the capability of the DNA computing model, a 3-colorable graph with 61 vertices was constructed as an example. Using this model, more than 99% of false solutions were deleted when the initial solution space was established and finally all solutions of the graph were found. Because these operations can be used for any graph with 61 vertices, the searching capability of this model could be up to 0(359). This searching capability is the largest among both electronic and non-electronic computers after the DNA computing model (with searching capability of 0(220) proposed by Adleman's research group in 2002. © 2010 IEEE.

关键词： DNA

来源：评论

学校读者我要写书评

暂无评论

Computing reachable sets of linear vector fields revisited

Computing reachable sets of linear vector fields revisited

引用

European Control Conference (ECC)

作者： Ting Gan Mingshuai Chen Yangjia Li Bican Xia Naijun Zhan LMAM & School of Mathematical Sciences Peking University State Key Lab. of Computer Science Chinese Academy of Sciences

The reachability problem is one of the most important issues in the verification of hybrid systems. But unfortunately the reachable sets for most of hybrid systems are not computable except for some special families. In our previous work, we identified a family of vector fields, whose state parts are linear with real eigenvalues, while input parts are exponential functions, and proved its reachability problem is decidable. In this paper, we investigate another family of vector fields, whose state parts are linear, but with pure imagine eigenvalues, while input parts are trigonometric functions, and prove its reachability problem is decidable also. To the best of our knowledge, the two families are the largest families of linear vector fields with a decidable reachability problem. In addition, we present an approach on how to abstract general linear dynamical systems to the first family. Comparing with existing abstractions for linear dynamical systems, experimental results indicate that our abstraction is more precise.

关键词： Eigenvalues and eigenfunctions Algebra Automata Manganese Europe computer science software

来源：评论

学校读者我要写书评

暂无评论

A kind of SND-based algorithm for self-adapting network congestion control

引用

Journal of Information and Computational science 2011年第11期8卷 2033-2044页

作者： Zhang, Degan Hu, Yuxia Liang, Yanpin Liu, Zhaojing Tianjin Key Lab. of Intelligent Computing and Novel software Technology Tianjin University of Technology Tianjin 300191 China Key Laboratory of Computer Vision and System Ministry of Education Tianjin University of Technology Tianjin 300191 China

A kind of SND-based algorithm for self-adapting network congestion control has been presented in this paper, which is for the complicated and integrated network environment that the Internet of Things (IOT) to face in the future. As we know, the control of network congestion has become a hot spot in the study of Internet of Things transmission service. The network control algorithm of self-adapting congestion based on semi-normal distribution has improved the original packet loss rate function, and changed congestion situation in Internet of Things. By our many experiments, the validity and correctness of this algorithm has been tested. © 2011 Binary Information Press.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

SP-VSLAM:Monocular Visual-SLAM Algorithm Based on SuperPoint Network 15

SP-VSLAM:Monocular Visual-SLAM Algorithm Based on SuperPoint...

引用

15th International Conference on Communication software and Networks, ICCSN 2023

作者： Yin, Zhenyu Feng, Dan Fan, Chao Ju, Chengen Zhang, Feiqing Shenyang Institute of Computing Technology Chinese Academy of Sciences Shenyang110168 China School of Computer Science and Technology University of Chinese Academy of Sciences Shenyang110168 China Liaoning Key Lab. of Domestic Industrial Control Platform Technology on Basic Hardware Software Shenyang110168 China

ISBN: (纸本)9798350329360

For scenes with significant changes in light intensity or perspective, the traditional ORB feature extraction method is prone to the problems of local homogenization of feature points and errors arising from the accumulated drift. A monocular visual Simultaneous Localization and Mapping algorithm (SLAM) based on SuperPoint network (SP-VSLAM) is proposed. The SuperPoint network is used to extract feature points and calculate binary descriptors simultaneously, combined with Non-Maximal Suppression methods to achieve uniform detection and description of image feature points. Then construct robust and accurate feature association information. It is fused with the back-end local mapping, loop & map merging modules of the ORB-SLAM3 system to construct a complete monocular vision SLAM system. Using the public measurement datasets TUM, the localization accuracy is calculated for five sequences in monocular mode, and the experimental results show that the proposed method has smaller trajectory error and higher pose estimation accuracy in static, partial low dynamic and high dynamic environments, which can effectively enhance the robustness of tracking. © 2023 IEEE.

关键词： Conformal mapping

来源：评论

学校读者我要写书评

暂无评论

P-DOT: A model of computation for big data

P-DOT: A model of computation for big data

引用

IEEE International Conference on Big Data

作者： Tao Luo Yin Liao Guoliang Chen Yunquan Zhang School of Computer Science and Technology University of Science and Technology of China Hefei China Key Lab. of Computer System and Architecture Chinese Academy of Sciences Beijing China

In response to the high demand of big data analytics, several programming models on large and distributed cluster systems have been proposed and implemented, such as MapRe-duce, Dryad and Pregel. However, compared with high performance computing areas, the basis and principles of computation and communication behavior of big data analytics is not well studied. In this paper, we review the current big data computational model DOT and DOTA, and propose a more general and practical model p-DOT (p-phases DOT). p-DOT is not a simple extension, but with profound significance: for general aspects, any big data analytics job execution expressed in DOT model or BSP model can be represented by it; for practical aspects, it considers I/O behavior to evaluate performance overhead. Moreover, we provide a cost function implying that the optimal number of machines is near-linear to the square root of input size for a fixed algorithm and workload, and demonstrate the effectiveness of the function through several experiments.

关键词： Computational modeling Information management Data handling Data storage systems Data models Analytical models US Department of Transportation

来源：评论

学校读者我要写书评

暂无评论

YOLOv5s-SLAM: A Monocular Visual SLAM method in Dynamic Environments 9

YOLOv5s-SLAM: A Monocular Visual SLAM method in Dynamic Envi...

引用

9th International Conference on computer and Communications, ICCC 2023

作者： Yin, Zhenyu Feng, Dan Fan, Chao Wang, Xiaohui Shenyang Institute of Computing Technology Chinese Academy of Sciences Shenyang110168 China University of Chinese Academy of Sciences School of Computer Science and Technology Shenyang110168 China Liaoning Key Lab. of Domestic Industrial Control Platform Technology on Basic Hardware Software Shenyang110168 China

ISBN: (纸本)9798350317251

To deal with the problem that traditional visual SLAM methods in dynamic environments are susceptible to the influence of moving targets, which leads to a decrease in the system's localization accuracy. This paper presents a dynamic visual SLAM system named YOLOv5s-SLAM. YOLOv5s is embedded in the ORB-SLAM3 system to recognize dynamic targets in the surrounding environment by deep learning methods and simultaneously extract ORB feature points with the SLAM system at the front end as a way to improve real-time performance. Combined with the constructed dynamic object detection rules, the dynamic feature points are divided and removed, which effectively reduces the mismatching in the feature extraction process and the impact on the system performance, and achieves the optimization of the visual SLAM localization performance. Tests on the TUM dataset show that the proposed method has smaller trajectory errors and higher position estimation accuracy, which can effectively enhance the robustness of localization. © 2023 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Bilinear grid search strategy based support vector machines learning method

引用

Informatica (Slovenia) 2014年第1期38卷 51-58页

作者： Li, Lin Zhang, Xiaolong Zhang, Kai Liu, Jun School of Computer Science and Technology Wuhan University of Science and Technology China Hubei Prov. Key Lab. of Intelligent Information Processing and Real-time Industrial System China

Support Vector Machines (SVM) learning can be used to construct classification models of high accuracy. However, the performance of SVM learning should be improved. This paper proposes a bilinear grid search method to achieve higher computation efficiency in choosing kernel parameters (C, γ) of SVM with RBF kernel. Experiments show that the proposed method retains the advantages of a small number of training SVMs of bilinear search and the high prediction accuracy of grid search. It has been proved that bilinear grid search method (BGSM) is an effective way to train SVM with RBF kernel. With the application of BGSM, the protein secondary structure prediction can obtain a better learning accuracy compared with other related algorithms.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

A Novel Meta-Hierarchical Active Inference Reinforcement Learning Approach for QoS-Driven Resource Allocation in Dynamic Clouds

A Novel Meta-Hierarchical Active Inference Reinforcement Lea...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Xian, Peijie He, Ying Yu, F. Richard Du, Jianbo Shenzhen Univ. College of Computer Science and Software Engineering Shenzhen China Xi'an Univ. of Posts & Telecomm. Shaanxi Key Lab. of Information Comm. Network and Security Shaanxi Xi'an China Carleton Univ. School of Information Technology OttawaON Canada

ISBN: (纸本)9798350351255

The cloud computing environment is highly dynamic due to a variety of external factors such as seasonal changes, market trends, and social events. In this case, tenant behavior patterns exhibit significant variability. Therefore, the cloud computing resource allocation model must continuously adapt to these changes. To this end, we propose an adaptive algorithm for dynamic cloud resource allocation based on meta-hierarchical active inference reinforcement learning (MHAIRL). The algorithm combines active inference with meta-hierarchical reinforcement learning. It improves the overall performance of the algorithm, as well as quickly adapts to environmental changes, and improves the generalization performance. In addition, we design a novel polling scheduling framework combined with long short-term memory (LSTM) network. The framework ensures scheduling fairness and flexibility while greatly reducing the state and action space dimensions of the agent. Extensive simulation results show that our method outperforms baseline algorithms in quality of service (QoS) metrics and significantly improves system performance in highly dynamic cloud resource allocation. © 2024 IEEE.

关键词： Active learning

来源：评论

学校读者我要写书评

暂无评论

Recommendations Based on LDA Topic Model in Android Applications

Recommendations Based on LDA Topic Model in Android Applicat...

引用

IEEE International Conference on software Quality, Reliability and Security Companion (QRS-C)

作者： Tianhao Pan Weifeng Zhang Ziyuan Wang Lei Xu School of Computer Science and Technology Nanjing University of Posts and Telecommunications Nanjing China State Key Lab. for Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9781509037148

With the popularity of smart phones, mobile applications have become an essential element in people's lives. Wherever you are, the Android market can allow people to download these applications. When you open Android mobile phone market in a mobile application program interface, we can see not only the application content presentation but also other information. The user can also see the scoring for this application, comments and so on. The text describes the application content information and user reviews, no more than 200 words, the contents of which are closely related to mobile applications. How to use these text data to obtain valuable information for the users has been an important research field of data mining, it is also the focus of this study. The topics of different mobile applications are the summary of their contents. This generalization to some extent reflects the different mobile application content core idea. Therefore mobile applications relating to mining user interest analysis has important significance, the results relating to mining can provide data support for topic-based personalized recommendation applications. This article extracts the contents and users' descriptions from a real Android Market dataset, and builds a new topic model called combineLDA to analyze different topics of each mobile application. By combineLDA model we can analyze the topic probability distribution of each mobile application, and then we can calculate the similarity and recommend to users with high similarity applications.

关键词： Conferences software quality software reliability Security

来源：评论

学校读者我要写书评

暂无评论

Reach-avoid Analysis for Sampled-data systems with Measurement Uncertainties

arXiv

引用

arXiv 2023年

作者： Wu, Taoran Ren, Dejin Zhang, Shuyuan Wang, Lei Xue, Bai State Key Lab. of Computer Science Institute of Software CAS Beijing China University of Chinese Academy of Sciences Beijing China Beihang University Beijing China

Digital control has become increasingly prevalent in modern systems, making continuous-time plants controlled by discrete-time (digital) controllers ubiquitous and crucial across industries, including aerospace, automotive, and manufacturing. This paper focuses on investigating the reach-avoid problem in such systems, where the objective is to reach a goal set while avoiding unsafe states, especially in the presence of state measurement uncertainties. We propose an approach that builds upon the concept of exponential control guidance-barrier functions, originally used for synthesizing continuous-time feedback controllers. We introduce a sufficient condition that, if met by a given continuous-time feedback controller, ensures the safe guidance of the system into the goal set in its sampled-data implementation, despite state measurement uncertainties. The event of reaching the goal set is determined based on state measurements obtained at the sampling time instants. Numerical examples are provided to demonstrate the validity of our theoretical developments, showcasing successful implementation in solving the reach-avoid problem in sampled-data systems with state measurement uncertainties. Copyright © 2023, The Authors. All rights reserved.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：