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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

LOPE: A Low-Overhead Payment Verification Method for Blockchains

引用

Chinese Journal of Electronics 2021年第2期30卷 349-358页

作者： ZHANG Ying HE Zhengyuan JIA Linpeng DING Donghui ZHANG Hanwen SUN Yi School of Software Engineering Tongji University Blockchain Lab Institute of Computing Technology Chinese Academy of Sciences School of Computer Science and Technology University of Chinese Academy of Sciences

With its characteristics of decentralization,security, data traceability, and tamper-resistance, the blockchain has been widely used in various *** the difference in the performance of the devices, the light client is proposed so that devices without the ability to store a full blockchain copy can also participate in the blockchain transactions. However,the light client has to communicate with full nodes and verify the authenticity of a transaction which brings in some extent of communication, computation, and storage overheads to the light client. These overheads cannot be ignored for some low-performance devices, such as embedded devices or Io T chips, and therefore the current light client scheme does not work in this situation. We propose LOPE(a Low-overhead payment v Erification method) for poor-capacity nodes in the blockchain *** LOPE, a grouping protocol is designed to partition full nodes into groups to serve the verification requests of the light client. In addition, Practical byzantine fault tolerance(PBFT) is used to ensure the light client to get a credible result in spite of a few dishonest nodes existing in the group. We conduct LOPE and evaluate it in a testbed. The experiment results show that LOPE reduces more than half of the communication overhead, degrades the computation overhead of the light client to a large extent, and avoids the storage overhead of the hash roots of block headers in the light client. We also conduct theoretical analysis to show the performance improvement and security issues of LOPE.

关键词： current light client scheme storage overhead blockchains Low-overhead payment vErification method peer-to-peer computing software fault tolerance electronic money data integrity LOPE low-performance devices cryptographic protocols fault tolerance blockchain transactions

来源：评论

学校读者我要写书评

暂无评论

A property-based testing framework for encryption programs

引用

Frontiers of computer science 2014年第3期8卷 478-489页

作者： Chang-ai SUN Zuoyi WANG Guan WANG School of Computer and Communication Engineering University of Science and Technology Beijing Beijing 100083 China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China

In recent years, a variety of encrypfion algorithms were proposed to enhance the security of software and systems. Validating whether encryption algorithms are correctly implemented is a challenging issue. software testing delivers an effective and practical solution, but it also faces the oracle problem （that is, under many practical situations, it is impossible or too computationally expensive to know whether the output for any given input is correct）. In this paper, we propose a property-based approach to testing encryption programs in the absence of oracles. Our approach makes use of the so-called metamorphic properties of encryption algorithms to generate test cases and verify test results. Two case studies were conducted to illustrate the proposed approach and validate its effectiveness. Experimental results show that even without oracles, the proposed approach can detect nearly 50% inserted faults with at most three metamorphic relations （MRs） and fifty test cases.

关键词： software testing encryption programs test oracles metamorphic testing (MT)

来源：评论

学校读者我要写书评

暂无评论

Efficient zonal diagnosis with maximum satisfiability

引用

science China(Information sciences) 2018年第11期61卷 17-30页

作者： Meng LIU Dantong OUYANG Shaowei CAI Liming ZHANG College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of EducationJilin University State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences

Model-based diagnosis(MBD) has been widely acknowledged as an effective diagnosis ***, for large scale circuits, it is difficult to find all cardinality-minimal diagnoses within a reasonable time. This paper proposes a novel method that takes a significant step in this direction. The idea is to divide a circuit into zones and compute the cardinality-minimal diagnoses by finding subset-minimal diagnoses with cardinality-minimal via a maximum satisfiability(MaxSAT) solver on an abstracted circuit that is composed of these zones instead of all components. We also propose a new propagate-extend method for extending the seed-TLDs to obtain all cardinality-minimal diagnoses efficiently. We implement our method with a state-of-the-art core-guided MaxSAT solver, and present evidence that it significantly improves the diagnosis efficiency on ISCAS-85 circuits. Our method outperforms SATbD, which was recently shown to outperform most complete MBD approaches using satisfiability(SAT).

关键词： model-based diagnosis MaxS AT subset-minimal diagnoses cardinality-minimal diagnoses zone propagate-extend

来源：评论

学校读者我要写书评

暂无评论

Lumiproxy:A Hybrid Representation of Image-Based Models

引用

Journal of computer science & Technology 2009年第3期24卷 578-587页

作者：盛斌朱鉴吴恩华张言辞 Department of Computer Science and Engineering The Chinese University of Hong Kong Faculty of Science and Technology University of Macao Institute of Software Chinese Academy of Sciences Department of Informatics University of Zurich

In this paper, we present a hybrid representation of image-based models combining the textured planes and the hierarchical points. Taking a set of depth images as input, our method starts from classifying input pixels into two categories, indicating the planar and non-planar surfaces respectively. For the planar surfaces, the geometric coefficients are reconstructed to form the uniformly sampled textures. For nearly planar surfaces, some textured planes, called lumiproxies, are constructed to represent the equivalent visual appearance. The Hough transform is used to find the positions of these textured planes, and optic flow measures are used to determine their textures. For remaining pixels corresponding to the non-planar geometries, the point primitive is applied, reorganized as the OBB-tree structure. Then, texture mapping and point splatting are employed together to render the novel views, with the hardware acceleration.

关键词： lumiproxy sampling surface fitting image-based rendering

来源：评论

学校读者我要写书评

暂无评论

Asymptotic behavior of least squares estimators for nonlinear autoregressive models

引用

science China(Information sciences) 2023年第6期66卷 299-300页

作者： Zhaobo LIU Chanying LI College of Computer Science and Software Engineering Shenzhen University Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences

Dear editor,Estimations of nonlinear autoregressive(AR) models in the literature typically involve ergodic series. Based on this assumption,the asymptotic theory has been established accordingly(see [1–3]). However,t...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Modelling and Verification of Real-Time Publish and Subscribe Protocol Using UPPAAL and Simulink/Stateflow

引用

Journal of computer science & Technology 2020年第6期35卷 1324-1342页

作者： Qian-Qian Lin Shu-Ling Wang Bo-Hua Zhan Bin Gu State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China Beijing Institute of Control Engineering Beijing 100081China

Real-Time Publish and Subscribe (RTPS) protocol is a protocol for implementing message exchange over an unreliable transport in data distribution service (DDS). Formal modelling and verification of the protocol provide stronger guarantees of its correctness and efficiency than testing alone. In this paper, we build formal models for the RTPS protocol using UPPAAL and Simulink/Stateflow. Modelling using Simulink/Stateflow allows analyzing the protocol through simula-tion, as well as generate executable code. Modelling using UPPAAL allows us to verify properties of the model stated in TCTL (Timed Computation Tree Logic), as well as estimate its performance using statistical model checking. We further describe a procedure for translation from Stateflow to timed automata, where a subset of major features in Stateflow is supported, and prove the soundness statement that the Stateflow model is a refinement of the translated timed automata model. As a consequence, any property in a certain fragment of TCTL that we have verified for the timed automata model in UPPAAL is preserved for the original Stateflow model.

关键词： Real-Time Publish and Subscribe(RTPS) modelling verification UPPAAL Simulink/Stateflow

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：