检索结果-南通市图书馆

A Cloud-Based Trust Model for Evaluating Quality of Web Services

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2010年第6期25卷 1130-1142页

作者：王守信张莉王帅邱翔 Institute of software Engineering School of Computer Science & EngineeringBeihang University

Because trust is regarded as an essential secured relationship within a distributed network environment,selecting services over the Internet from the viewpoint of trust has been a major *** research about trust model and evaluation in the context of Web services does not rationally and accurately reflect some essential characteristics of trust such as subjective uncertainty and *** this paper,we analyze some important characteristics of trust,and some key factors that affect the trust relation in the Web service ***,we propose a trust model based on Cloud Model theory to describe the subjective uncertainty of trust factors.A time-related backward cloud generation algorithm is given to express the dynamism of ***,according to the trust model and algorithm,a formalized calculation approach is provided to evaluate the trust degree of services requestors in *** experiment shows that the evaluation of trust degree can effectively support trust-decisions and provide a helpful exploitation for selecting services based on the viewpoint of trust.

关键词： Web service trust trust evaluation Cloud Model

Composite nonlinear feedback control for output regulation problem of linear discrete-time systems with input saturation

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2014年第6期25卷 1043-1055页

作者： Chongwen Wang Xing Chu Weiyao Lan school of software Beijing Institute of Technology Department of Automation Xiamen University

Transient performance for output regulation problems of linear discrete-time systems with input saturation is addressed by using the composite nonlinear feedback（CNF） control technique. The regulator is designed to be an additive combination of a linear regulator part and a nonlinear feedback part. The linear regulator part solves the regulation problem independently which produces a quick output response but large oscillations. The nonlinear feedback part with well-tuned parameters is introduced to improve the transient performance by smoothing the oscillatory convergence. It is shown that the introduction of the nonlinear feedback part does not change the solvability conditions of the linear discrete-time output regulation problem. The effectiveness of transient improvement is illustrated by a numeric example.

关键词： output regulation composite nonlinear feedback in-put saturation transient performance discrete-time system

Feature based problem hardness understanding for requirements engineering

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2017年第3期60卷 88-107页

作者： Zhilei REN He JIANG Jifeng XUAN Shuwei ZHANG Zhongxuan LUO Key Laboratory for Ubiquitous Network and Service software of Liaoning Province Dalian University of Technology school of software Dalian University of Technology State Key Laboratory of software Engineering Wuhan University

Heuristics and metaheuristics have achieved great accomplishments in various fields, and the investigation of the relationship between these algorithms and the problem hardness has been a hot topic in the research field. Related research work has contributed much to the understanding of the underlying mechanisms of the algorithms for problem solving. However, most existing studies consider traditional combinatorial problems as their case studies. In this study, taking the Next Release Problem(NRP) from the requirements engineering as a case study, we investigate the relationship between software engineering problem instances and heuristics. We employ an evolutionary algorithm to evolve NRP instances, which are uniquely hard or easy for the target heuristic(Greedy Randomized Adaptive Search Procedure and Randomized Hill Climbing in this paper). Then, we use a feature-based method to estimate the hardness of the evolved instances, with respect to the target heuristic. Experimental results demonstrate that, evolutionary algorithm can be used to evolve NRP instances that are uniquely hard or easy to solve. Moreover, the features enable the estimation of the target heuristics’ performance.

关键词： problem hardness next release problem computational intelligence requirements engineering evolution algorithm

SMINER:Detecting Unrestricted and Misimplemented Behaviors of software Systems Based on Unit Test Cases

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2023年第5期75卷 3257-3274页

作者： Kyungmin Sim Jeong Hyun Yi Haehyun Cho school of software Soongsil UniversitySeoul06978Korea

Despite the advances in automated vulnerability detection approaches,security vulnerabilities caused by design flaws in software systems are continuously appearing in real-world *** security design flaws can bring unrestricted and misimplemented behaviors of a system and can lead to fatal vulnerabilities such as remote code execution or sensitive data ***,it is an essential task to discover unrestricted and misimplemented behaviors of a ***,it is a daunting task for security experts to discover such vulnerabilities in advance because it is timeconsuming and error-prone to analyze the whole code in ***,most of the existing vulnerability detection approaches still focus on detecting memory corruption bugs because these bugs are the dominant root cause of software *** paper proposes SMINER,a novel approach that discovers vulnerabilities caused by unrestricted and misimplemented *** first collects unit test cases for the target system from the official ***,preprocess the collected code *** uses pre-processed data to show the security policies that can occur on the target system and creates a test case for security policy *** demonstrate the effectiveness of SMINER,this paper evaluates SMINER against Robot Operating System(ROS),a real-world system used for intelligent robots in Amazon and controlling satellites in national Aeronautics and Space Administration(NASA).From the evaluation,we discovered two real-world vulnerabilities in ROS.

关键词： Security vulnerability test case generation security policy test robot operating system vulnerability assessment

A Novel Sparse Penalty for Singular Value Decomposition

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2017年第2期26卷 306-312页

作者： WANG Caihua LIU Juan MIN Wenwen QU Aiping The State Key Laboratory of software Engineering School of ComputerWuhan University

Singular value decomposition(SVD) is a tool widely used in data denoising,matrix approximation,recommendation system,text mining and computer vision.A ma jority of applications prefer sparse singular vectors to capture inherent structures and patterns of the input data so that the results are *** present a novel penalty for SVD to achieve *** with the traditional penalties,the proposed penalty is scale,dimensional insensitive and bounded between 0 and 1,which are in favor of controlling *** by the penalty,we provide an efficient algorithm to pro ject a vector onto a given sparse level in O(n) expected *** efficient pro jection algorithm serve as a drudge for sparse SVD(SSVD).In experiments,SSVD is efficient and could capture the latent structures and patterns of the input data.

关键词： Sparse controllable projection(SCP) Sparse singular value decomposition(SSVD) Sparse low rank matrix approximation(SLRMA)

Complex Networks from Chaotic Time Series on Riemannian Manifold

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Chinese Physics Letters 2016年第10期33卷 28-31页

作者：孙建成 school of software and Communication Engineering Jiangxi University of Finance and Economics

Complex networks are important paradigms for analyzing the complex systems as they allow understanding the structural properties of systems composed of different interacting entities. In this work we propose a reliable method for constructing complex networks from chaotic time series. We first estimate the covariance matrices, then a geodesic-based distance between the covariance matrices is introduced. Consequently the network can be constructed on a Riemannian manifold where the nodes and edges correspond to the covariance matrix and geodesic-based distance, respectively. The proposed method provides us with an intrinsic geometry viewpoint to understand the time series.

关键词： of is Complex Networks from Chaotic Time Series on Riemannian Manifold from into been on for that

Multiscale Isogeometric Topology Optimization with Unified Structural Skeleton

在线全文

学校读者我要写书评

暂无评论

Computer Modeling in Engineering & Sciences 2020年第3期122卷 779-803页

作者： Chen Yu Qifu Wang Chao Mei Zhaohui Xia national Enterprise Information software Engineering Research Center School of Mechanical Science and EngineeringHuazhong University of Science and TechnologyWuhanChina.

This paper proposes a multiscale isogeometric topology optimization(ITO)method where the configuration and layout of microstructures are optimized *** micro scale,a shape deformation method is presented to transform a prototype microstructure(PM)for obtaining a series of graded microstructures(GMs),where microstructural skeleton based on the level set framework is applied to retain more topology features and improve the *** the macro scale calculation,the effective mechanical properties can be estimated by means of the numerical homogenization *** adopting identical non-uniform rational basis splines(NURBS)as basis functions for both parameterized level set model and isogeometric calculation model,the isogeometric analysis(IGA)is integrated into the level set method,which contributes to improving the accuracy and *** examples demonstrate that,the proposed method is effective in improving the performance and manufacturability.

关键词： Isogeometric analysis topology optimization shape deformation method structural skeleton level set method.

Test-Data Generation Guided by Static Defect Detection

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2009年第2期24卷 284-293页

作者：郝丹张路刘明浩李合孙家骕 Key Laboratory of High Confidence software Technologies Ministry of Education Institute of software School of Electronics Engineering and Computer Science Peking University

software testing is an important technique to assure the quality of software systems, especially high-confidence systems. To automate the process of software testing, many automatic test-data generation techniques have been proposed. To generate effective test data, we propose a test-data generation technique guided by static defect detection in this paper. Using static defect detection analysis, our approach first identifies a set of suspicious statements which are likely to contain faults, then generates test data to cover these suspicious statements by converting the problem of test-data generation to the constraint satisfaction problem. We performed a case study to validate the effectiveness of our approach, and made a simple comparison with another test-data generation on-line tool, JUnit Factory. The results show that, compared with JUnit Factory, our approach generates fewer test data that are competitive on fault detection.

关键词： test-data generation suspicious statements software testing constraint satisfaction problem

Updatable timed automata with one updatable clock

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2018年第1期61卷 99-112页

作者： Guoqiang LI Yunqing WEN Shoji YUEN BASICS School of Software Shanghai Jiao Tong University Graduate school of Information Science Nagoya University

Updatable timed automata(UTAs) proposed by Bouyer ***., is an extension of timed automata(TAs) having the extra ability to update clocks in a more elaborate way than simply reset them to *** reachability of UTAs is generally undecidable, which can be easily gained by regarding a pair of clocks as updatable counters. This paper investigates a subclass of UTAs by restricting the number of updatable clocks to be one. We will show that(1) the reachability of general UTAs with one updatable clock(UTA1 s)is still undecidable, and(2) that of UTA1 s under diagonal-free constraints is decidable, and the complexity is Pspace-complete. The former is achieved by encoding Minsky machines to the general UTA1 s, where two counters are simulated by the updatable clock. The latter is gained by regarding a region of a UTA1 to be an unbounded digiword, and encoding sets of digiwords that are accepted by a one counter automaton where regions are generated as the value of the counter.

关键词： updatable timed automata one counter automata digiword reachability problem