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

Challenges and countermeasures of interaction in autonomous vehicles

science China(Information sciences) 2019年第5期62卷 5-7页

作者： Deyi LI Meng LIU Fei ZHAO Yu LIU State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang University Chinese Academy of Engineering School of Transportation Science and Engineering Beihang University

Autonomous vehicles can bring changes into ways of traveling, traffic, and even production modes [1].At present, the majority of researches [2] on autonomous vehicles are limited in perception, planning, decision-making and other calculation front,while interactive cognitive perspective is barely looked into. The interactive sector involved in self-driving is rather sophisticated [3]. However,

关键词： Challenges and countermeasures of interaction in autonomous vehicles

来源：评论

学校读者我要写书评

暂无评论

Reusing Service Process Fragments with a Consensus Between Service Providers and Users

引用

Chinese Journal of Electronics 2016年第4期25卷 648-657页

作者： YANG Rong LI Bing WANG Jian LI Zengyang HU Yan College of Computer Science and Technology Hubei University of Science and Technology International School of Software Wuhan University State Key Laboratory of Software Engineering & School of Computer Wuhan University Science and Technology on Integrated Information System Laboratory Institute of SoftwareUniversity of Chinese Academy of Sciences

Recent years have witnessed a rapid growth in using Web services for data publishing and sharing among *** improve the efficiency of software development and economize on human and material resources,service reuse is viewed as a powerful means which will not only reuse atomic services,but also reuse arbitrary granularities of Service process fragments(SPFs).However,effectively reusing arbitrary granularities of SPFs has not been solved yet,let alone taking diverse Qo S preferences of service providers and users into *** this paper,we propose a novel method of SPF reuse,named SCKY,based on the Cocke-Kasami-Younger(CKY) *** first present an extended CKY to do *** we address how to do SPF-query by a probability CKY,i.e.,return a SPF with maximum emergence ***,we explore the SPF-query with a consensus of Qo S preferences between service providers and *** a set of experiments,the effectiveness and robustness of our approach are evaluated.

关键词： Cocke-Kasami-Younger algorithm Service reuse Service process fragment Qo S preferences

来源：评论

学校读者我要写书评

暂无评论

Hybrid State-Space and GRU-based Graph Tokenization Mamba for Hyperspectral Image Classification

arXiv

引用

arXiv 2025年

作者： Ahmad, Muhammad Butt, Muhammad Hassaan Farooq Usama, Muhammad Mazzara, Manuel Distefano, Salvatore Khan, Adil Mehmood Hong, Danfeng Dipartimento di Matematica e Informatica—MIFT University of Messina Messina98121 Italy Institute of Artificial Intelligence School of Mechanical and Electrical Engineering Shaoxing University Shaoxing312000 China CFD Pakistan Institute of Software Development and Engineering Innopolis University Innopolis420500 Russia School of Computer Science University of Hull HullHU6 7RX United Kingdom Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Beijing100049 China

Hyperspectral image (HSI) classification plays a pivotal role in domains such as environmental monitoring, agriculture, and urban planning. However, it faces significant challenges due to the high-dimensional nature of the data and the complex spectral-spatial relationships inherent in HSI. Traditional methods, including conventional machine learning and convolutional neural networks (CNNs), often struggle to effectively capture these intricate spectral-spatial features and global contextual information. Transformer-based models, while powerful in capturing long-range dependencies, often demand substantial computational resources, posing challenges in scenarios where labeled datasets are limited, as is commonly seen in HSI applications. To overcome these challenges, this work proposes GraphMamba, a hybrid model that combines spectral-spatial token generation, graph-based token prioritization, and cross-attention mechanisms. The model introduces a novel hybridization of state-space modeling and Gated Recurrent Units (GRU), capturing both linear and nonlinear spatial-spectral dynamics. This approach enhances the ability to model complex spatial-spectral relationships while maintaining scalability and computational efficiency across diverse HSI datasets. Through comprehensive experiments, we demonstrate that GraphMamba outperforms existing state-of-the-art models, offering a scalable and robust solution for complex HSI classification tasks. © 2025, CC BY.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Analyses for specific defects in Android applications:a survey

引用

Frontiers of computer science 2019年第6期13卷 1210-1227页

作者： Tianyong WU Xi DENG Jun YAN Jian ZHANG State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China Technology Center of Software Engineering Institute of SoftwareChinese Academy of SciencesBeijing 100190China

Android applications(APPS)are in widespread use and have enriched our *** ensure the quality and security of the apps,many approaches have been proposed in recent years for detecting bugs and defects in the apps,of which program analysis is a major *** paper mainly makes an investigation of existing works on the analysis of Android *** summarize the purposes and proposed techniques of existing approaches,and make a taxonomy of these works,based on which we point out the trends and challenges of research in this *** our survey,we sum up four main findings:(1)program analysis in Android security field has gained particular attention in the past years,the fields of functionality and performance should also gain proper attention;the infrastructure that supports detection of various defects should be enriched to meet the industry’s need;(2)many kinds of defects result from developers’misunderstanding or misuse of the characteristics and mechanisms in Android system,thus the works that can systematically collect and formalize Android recommendations are in demand;(3)various program analysis approaches with techniques in other fields are applied in analyzing Android apps;however,they can be improved with more precise techniques to be more applicable;(4)The fragmentation and evolution of Android system blocks the usability of existing tools,which should be taken into consideration when developing new approaches.

关键词： Android apps program analysis security functionality performance

来源：评论

学校读者我要写书评

暂无评论

A Novel Hybrid Data Clustering Algorithm Based on Artificial Bee Colony Algorithm and K-Means

引用

Chinese Journal of Electronics 2015年第4期24卷 694-701页

作者： TRAN Dang Cong WU Zhijian WANG Zelin DENG Changshou State Key Laboratory of Software Engineering School of Computer Wuhan University Vietnam Academy of Science and Technology School of Information Science and Technology Jiujiang University

To improve the performance of K-means clustering algorithm, this paper presents a new hybrid approach of Enhanced artificial bee colony algorithm and Kmeans(EABCK). In EABCK, the original artificial bee colony algorithm(called ABC) is enhanced by a new mutation operation and guided by the global best solution(called EABC). Then, the best solution is updated by Kmeans in each iteration for data clustering. In the experiments, a set of benchmark functions was used to evaluate the performance of EABC with other comparative ABC variants. To evaluate the performance of EABCK on data clustering, eleven benchmark datasets were utilized. The experimental results show that EABC and EABCK outperform other comparative ABC variants and data clustering algorithms, respectively.

关键词： Data clustering K-means Artificial bee colony Mutation operation

来源：评论

学校读者我要写书评

暂无评论

An Efficient Approach for Solving Optimization over Linear Arithmetic Constraints

引用

Journal of computer science & Technology 2016年第5期31卷 987-1011页

作者： Li Chen State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 ChinaUniversity of Chinese Academy of Sciences Beijing 100190 China National Engineering Research Center of Fundamental Software Institute of Software Chinese Academy of Sciences Beijing 100190 China

Satisfiability Modulo Theories （SMT） have been widely investigated over the last decade. Recently researchers have extended SMT to the optimization problem over linear arithmetic constraints. To the best of our knowledge, SYMBA and OPT-MATHSAT are two most efficient solvers available for this problem. The key algorithms used by SVMBA and OPT-MATHSAT consist of the loop of two procedures： 1） critical finding for detecting a critical point, which is very likely to be globally optimal, and 2） global checking for confirming the critical point is reMly globally optimal. In this paper, we propose a new approach based on the Simplex method widely used in operation research. Our fundamental idea is to find several critical points by constructing and solving a series of linear problems with the Simplex method. Our approach replaces the Mgorithms of critical finding in SYMBA and OPT-MATHSAT, and reduces the runtime of critical finding and decreases the number of executions of global checking. The correctness of our approach is proved. The experiment evaluates our implementation against SYMBA and OPT-MATHSAT on a critical class of problems in real-time systems. Our approach outperforms SYMBA on 99.6% of benchmarks and is superior to OPT-MATHSAT in large-scale cases where the number of tasks is more than 24. The experimental results demonstrate that our approach has great potential and competitiveness for the optimization problem.

关键词： constrained optimization Satisfiability Modulo Theories linear programming

来源：评论

学校读者我要写书评

暂无评论

From model to implementation: a network algorithm programming language

引用

science China(Information sciences) 2020年第7期63卷 205-221页

作者： Jian WANG Jie AN Mingshuai CHEN Naijun ZHAN Lulin WANG Miaomiao ZHANG Ting GAN State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences School of Software Engineering Tongji University Network Integration Technology Research Department Huawei Technologies Co. Ltd. School of Computer Science Wuhan University

software-defined networking(SDN) is a revolutionary technology that facilitates network management and enables programmatically efficient network configuration, thereby improving network performance and flexibility. However, as the application programming interfaces(APIs) of SDN are low-level or functionality-restricted, SDN programmers cannot easily keep pace with the ever-changing devices, topologies, and demands of SDN. By deriving motivation from industry practice, we define a novel network algorithm programming language(NAPL) that enhances the SDN framework with a rapid programming flow from topology-based network models to C++ implementations, thus bridging the gap between the limited capability of existing SDN APIs and the reality of practical network management. In contrast to several state-of-the-art languages, NAPL provides a range of critical high-level network programming features:(1) topology-based network modeling and visualization;(2) fast abstraction and expansion of network devices and constraints;(3) a declarative paradigm for the fast design of forwarding policies;(4) a built-in library for complex algorithm implementation;(5) full compatibility with C++ programming; and(6) userfriendly debugging support when compiling NAPL into highly readable C++ codes. The expressiveness and performance of NAPL are demonstrated in various industrial scenarios originating from practical network management.

关键词： software-defined networking(SDN) network algorithm programming language(NAPL) network abstraction

来源：评论

学校读者我要写书评

暂无评论

The Cognition Is Not Enough:Another Look on Existing Interesting Points Chosen Methods

引用

Chinese Journal of Electronics 2017年第2期26卷 416-423页

作者： FAN Guangjun ZHOU Yongbin ZHANG Hailong FENG Dengguo State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of Sciences State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of Sciences

For classical template attacks,many papers suggested a guideline of choosing interesting points which is still not *** to now,many different methods of choosing interesting points were ***,it is still unclear that which approach will lead to the best classification performance for template *** comprehensively evaluate and compare the classification performance of template attacks when using different methods of choosing interesting *** results show that the Correlation power analysis based method and the Sum of squared pairwise t-differences based method will lead to the best classification *** find that some methods of choosing interesting points provide the same results in the same ***,we correctly prove the guideline of choosing interesting points is correct by presenting a new way of conducting template attacks.

关键词： Side-channel attacks Power analysis attacks Template attacks Interesting points

来源：评论

学校读者我要写书评

暂无评论

Eliciting dependability requirements:a control cases based approach

引用

science China(Information sciences) 2014年第1期57卷 96-110页

作者： LIU Chun WANG Yue ZHANG Wei JIN Zhi Academy of Mathematics and System Science Chinese Academy of Sciences Key Laboratory of High Confidence Software Technologies (Peking University) Ministry of Education Institute of Software School of Electronics Engineering and Computer Science Peking University

At present,great demands are posed on software *** how to elicit the dependability requirements is still a challenging *** paper proposes a novel approach to address this *** essential idea is to model a dependable software system as a feedforward-feedback control system,and presents the use cases+control cases model to express the requirements of the dependable software *** this model,while the use cases are adopted to model the functional requirements,two kinds of control cases(namely the feedforward control cases and the feedback control cases)are designed to model the dependability *** use cases+control cases model provides a unified framework to integrate the modeling of the functional requirements and the dependability requirements at a high abstract *** guide the elicitation of the dependability requirements,a HAZOP based process is also designed.A case study is conducted to illustrate the feasibility of the proposed approach.

关键词： dependability dependability requirements requirements elicitation control systems control cases

来源：评论

学校读者我要写书评

暂无评论

MemSC： A Scan-Resistant and Compact Cache Replacement Framework for Memory-Based Key-Value Cache Systems

引用

Journal of computer science & Technology 2017年第1期32卷 55-67页

作者： Mei Li Hong-Jun Zhang Yan-Jun Wu Chen Zhao National Engineering Research Center of Fundamental Software Institute of Software Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China

Memory-based key-value cache systems, such as Memcached and Redis, have become indispensable components of data center infrastructures and have been used to cache performance-critical data to avoid expensive back-end database accesses. As the memory is usually not large enough to hold all the items, cache replacement must be performed to evict some cached items to make room for the newly coming items when there is no free space. Many real-world workloads target small items and have frequent bursts of scans （a scan is a sequence of one-time access requests）. The commonly used LRU policy does not work well under such workloads since LRU needs a large amount of metadata and tends to discard hot items with scans. Small decreases in hit ratio can result in large end-to-end losses in these systems. This paper presents MemSC, which is a scan-resistant and compact cache replacement framework for Memcached. MemSC assigns a multi-granularity reference flag for each item, which requires only a few bits （two bits are enough for general use） per item to support scanresistant cache replacement policies. To evaluate MemSC, we implement three representative cache replacement policies （MemSC-HM, MemSC-LH, and MemSC-LF） on MemSC and test them using various workloads. The experimental results show that MemSC outperforms prior techniques. Compared with the optimized LRU policy in Memcached, MemSC-LH reduces the cache miss ratio and the memory usage of the resulting system by up to 23% and 14% respectively.

关键词： key-value cache system cache replacement scan resistance space efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：