检索结果-南通市图书馆

Reliability Growth Modeling and Optimal Release policy Under Fuzzy Environment of an N-version programming System Incorporating the Effect of Fault Removal Efficiency

引用

International Journal of Automation and computing 2007年第4期4卷 369-379页

作者： p.k.kapur Anshu Gupta p.C.Jha Department of Operational Research University of DelhiDelhi-110007India

Failure of a safety critical system can lead to big losses. Very high software reliability is required for automating the working of systems such as aircraft controller and nuclear reactor controller software systems. Fault-tolerant softwares are used to increase the overall reliability of software systems. Fault tolerance is achieved using the fault-tolerant schemes such as fault recovery （recovery block scheme）, fault masking （N-version programming （NVp）） or a combination of both （Hybrid scheme）. These softwares incorporate the ability of system survival even on a failure. Many researchers in the field of software engineering have done excellent work to study the reliability of fault-tolerant systems. Most of them consider the stable system reliability. Few attempts have been made in reliability modeling to study the reliability growth for an NVp system. Recently, a model was proposed to analyze the reliability growth of an NVp system incorporating the effect of fault removal efficiency. In this model, a proportion of the number of failures is assumed to be a measure of fault generation while an appropriate measure of fault generation should be the proportion of faults removed. In this paper, we first propose a testing efficiency model incorporating the effect of imperfect fault debugging and error generation. Using this model, a software reliability growth model （SRGM） is developed to model the reliability growth of an NVp system. The proposed model is useful for practical applications and can provide the measures of debugging effectiveness and additional workload or skilled professional required. It is very important for a developer to determine the optimal release time of the software to improve its performance in terms of competition and cost. In this paper, we also formulate the optimal software release time problem for a 3Vp system under fuzzy environment and discuss a the fuzzy optimization technique for solving the problem with a numerical illustration.

关键词： Fault tolerant software reliability growth model release time fuzzy optimization.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

An innovation diffusion model for consumer durables with three parameters

引用

Journal of Management Analytics 2016年第3期3卷 240-265页

作者： Nitin Sachdeva p.k.kapur Ompal Singh Department of Operational Research University of DelhiDelhi Center for Interdisciplinary Research Amity UniversityNoidaUttar PradeshIndia

Strategic innovation diffusion converts newly created knowledge into increasing a firm’s value primarily through innovative product *** this paper,we present a time-based adoption pattern with pricing and promotional expenditure as a three-dimensional innovation diffusion model(3D-IDM).In our proposed 3D-IDM,we assume that value of the product plays a crucial role of being the major driver of diffusion,and is classified into the following three main factors:(1)continuation time of the product in the market–representing goodwill of the product;(2)price of the product–indicating consumers’buying behaviour;and(3)marketing efforts of the firm.A special form of the Cobb–Douglas production function is used to design the three-dimensional *** empirical study is performed on number of consumer-durable sales data to validate and compare the proposed *** performance measures are treated uniquely using the Mahalanobis distance-based approach(DBA)to determine the relative strength of each model.

关键词： innovation diffusion model three-dimensional innovation diffusion model Cobb-Douglas production function

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Comprehensive G?bner Basis Theory for a parametric polynomial Ideal and the Associated Completion Algorithm

引用

Journal of Systems Science & Complexity 2017年第1期30卷 196-233页

作者： kapur Deepak Department of Computer Science University of New Mexico Albuquerque NM USA.

Groebner basis theory for parametric polynomial ideals is explored with the main objec- tive of nfinicking the Groebner basis theory for ideals. Given a parametric polynomial ideal, its basis is a comprehensive GrSbner basis if and only if for every specialization of its parameters in a given field, the specialization of the basis is a GrSbnerbasis of the associated specialized polynomial ideal. For various specializations of parameters, structure of specialized ideals becomes qualitatively different even though there are significant relationships as well because of finiteness properties. key concepts foundational to GrSbner basis theory are reexamined and/or further developed for the parametric case：（i） Definition of a comprehensive Groebner basis, （ii） test for a comprehensive GrSbner basis, （iii） parameterized rewriting, （iv） S-polynomials among parametric polynomials, （v） completion algorithm for directly computing a comprehensive Groebner basis from a given basis of a parametric ideal. Elegant properties of Groebner bases in the classical ideal theory, such as for a fixed admissible term ordering, a unique GrSbner basis can be associated with every polynomial ideal as well as that such a basis can be computed from any Groebner basis of an ideal, turn out to be a major challenge to generalize for parametric ideals; issues related to these investigations are explored. A prototype implementation of the algorithm has been successfully tried on many examples from the literature.

关键词： Comprehensive GrSbner basis minimal comprehensive GrSbner basis parametric polyno-mial system parametric S-polynomial redundancy.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Conditional Congruence Closure over Uninterpreted and Interpreted Symbols

引用

Journal of Systems Science & Complexity 2019年第1期32卷 317-355页

作者： kapur Deepak Department of Computer Science University of New Mexico

A framework for generating congruence closure and conditional congruence closure of ground terms over uninterpreted as well as interpreted symbols satisfying various properties is proposed. It is based on some of the key concepts from kapur's congruence closure algorithm(RTA97)for ground equations based on introducing new symbols for all nonconstant subterms appearing in the equation set and using ground completion on uninterpreted constants and puri?ed equalities over interpreted symbols belonging to different theories. In the original signature, the resulting rewrite systems may be nonterminating but they still generate canonical forms. A byproduct of this framework is a constant Horn completion algorithm using which ground canonical Horn rewrite systems can be generated for conditional ground *** effcient algorithms for generating congruence closure of conditional and unconditional equations on ground terms over uninterpreted symbols are presented. The complexity of the conditional congruence closure is shown to be O(n*log(n)), which is the same as for unconditional ground *** proposed algorithm is motivated by our attempts to generate effcient and succinct interpolants for the quanti?er-free theory of equality over uninterpreted function symbols which are often a conjunction of conditional equations and need additional simpli?cation. A completion algorithm to generate a canonical conditional rewrite system from ground conditional equations is also presented. The framework is general and ?exible and is used later to develop congruence closure algorithms for cases when function symbols satisfy simple properties such as commutativity, nilpotency, idempotency and identity as well as their combinations. Interesting outcomes include algorithms for canonical rewrite systems for ground equational and conditional theories on uninterpreted and interpreted symbols leading to generation of canonical forms for ground terms, constrained terms and Horn equat

关键词： Completion congruence closure conditional congruence closure intepreted symbols rewrit-ing uninterpreted symbols

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

ON INVARIANT CHECkING

引用

Journal of Systems Science & Complexity 2013年第3期26卷 470-482页

作者： ZHANG Zhihai kapur Deepak School of Mathematical Sciences Peking University Department of Computer Science University of New Mexico

Checking whether a given formula is an invariant at a given program location(especially,inside a loop) can be quite nontrivial even for simple loop programs,given that it is in general an undecidable *** is especially the case if the given formula is not an inductive loop invariant,as most automated techniques can only check or generate inductive loop *** this paper,conditions are identified on simple loops and formulas when this check can be performed automatically.A general theorem is proved which gives a necessary and sufficient condition for a formula to be an invariant under certain restrictions on a *** a byproduct of this analysis,a new kind of loop invariant inside the loop body,called inside-loop invariant,is *** an invariant is more general than an inductive loop invariant typically used in the Floyd-Hoare axiomatic approach to program *** use of such invariants for program debugging is explored;it is shown that such invariants can be more useful than traditional inductive loop invariants especially when one is interested in checking extreme/side conditions such as underflow,accessing array/collection data structures outside the range,divide by zero,etc.

关键词： Assertion Floyd-Hoare logic invariant invariant generation.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Impaired glucocorticoid receptor expression and mitochondrial metabolism in MDSCs contribute to glucocorticoid resistance in immune thrombocytopenia

引用

Cellular & Molecular Immunology 2022年第7期19卷 858-860页

作者： Rick kapur Sanquin Research Department of Experimental ImmunohematologyAmsterdam and Landsteiner LaboratoryAmsterdam UMCUniversity of AmsterdamAmsterdamThe Netherlands

In this issue of Cellular&Molecular Immunology,Hou and coworkers provide novel insights into glucocorticoid(GC)treatment refractoriness in immune thrombocytopenia(ITp),reporting that myeloid-derived suppressor cells(MDSCs)contribute to GC resistance in ITp via impairments in their glucocorticoid receptor(GR)expression and mitochondrial metabolism[1].

关键词： metabolism glucocorticoid Immunology

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Discrete Software Reliability Growth Modeling for Errors of Different Severity Incorporating Change-point Concept

引用

International Journal of Automation and computing 2007年第4期4卷 396-405页

作者： D.N.Goswami Sunil k.khatri Reecha kapur School of Studies in Computer Science and Applications Jiwaji UniversityGwalior 474011India Mother Teresa Institute of Management Guru Gobind Singh Indraprastha UniversityDelhi110092India Department of Mathematics and Computer Applications Bundelkhand UniversityJhansi 284128India

Several software reliability growth models （SRGM） have been developed to monitor the reliability growth during the testing phase of software development. In most of the existing research available in the literatures, it is considered that a similar testing effort is required on each debugging effort. However, in practice, different types of faults may require different amounts of testing efforts for their detection and removal. Consequently, faults are classified into three categories on the basis of severity： simple, hard and complex. This categorization may be extended to r type of faults on the basis of severity. Although some existing research in the literatures has incorporated this concept that fault removal rate （FRR） is different for different types of faults, they assume that the FRR remains constant during the overall testing period. On the contrary, it has been observed that as testing progresses, FRR changes due to changing testing strategy, skill, environment and personnel resources. In this paper, a general discrete SRGM is proposed for errors of different severity in software systems using the change-point concept. Then, the models are formulated for two particular environments. The models were validated on two real-life data sets. The results show better fit and wider applicability of the proposed models as to different types of failure datasets.

关键词： Discrete software reliability growth model non-homogeneous poisson process fault severity change point probability generating function.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A QUANTIFIER-ELIMINATION BASED HEURISTIC FOR AUTOMATICALLY GENERATING INDUCTIVE ASSERTIONS FOR pROGRAMS

引用

Journal of Systems Science & Complexity 2006年第3期19卷 307-330页

作者： Deep.k.kapur Department of Computer Science University of New MexicoAlbuquerqueUSA

A method using quantifier-elimination is proposed for automatically generating program invariants/inductive assertions. Given a program, inductive assertions, hypothesized as parameterized formulas in a theory, are associated with program locations. parameters in inductive assertions are discovered by generating constraints on parameters by ensuring that an inductive assertion is indeed preserved by all execution paths leading to the associated location of the program. The method can be used to discover loop invariants-properties of variables that remain invariant at the entry of a loop. The parameterized formula can be successively refined by considering execution paths one by one; heuristics can be developed for determining the order in which the paths are considered. Initialization of program variables as well as the precondition and postcondition, if available, can also be used to further refine the hypothesized invariant. The method does not depend on the availability of the precondition and postcondition of a program. Constraints on parameters generated in this way are solved for possible values of parameters. If no solution is possible, this means that an invariant of the hypothesized form is not likely to exist for the loop under the assumptions/approximations made to generate the associated verification condition. Otherwise, if the parametric constraints are solvable, then under certain conditions on methods for generating these constraints, the strongest possible invariant of the hypothesized form can be generated from most general solutions of the parametric constraints. The approach is illustrated using the logical languages of conjunction of polynomial equations as well as presburger arithmetic for expressing assertions.

关键词： Automated software analysis and verification inductive assertion loop invariant quantifier elimination.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

The physical, chemical, and microscopic properties of masonry mortars from Alhambra palace （Spain） in reference to their earthquake resistance

引用

Frontiers of Architectural Research 2016年第1期5卷 101-110页

作者： Hanifi Binici Selim kapur Department of Civil Engineering Kahramanmaras Sutcu lmam University Kahramanmaras 46100 Turkey Departments of Soil Science and Archaeometry Cukurova University Adana 01330 Turkey

Al-Andalus mortar is an ancient binding material （lime mortar） that was used for centuries in numerous historical buildings in Al-Andalus, Granada （Spain）. The physico-chemical and microscopic properties of Al-Andalus mortars in Granada were studied as part of an investigation into the mineral raw materials present in the territory of Spain. Scanning electron microscope and X-ray diffraction analyses of eight main types of mortars were performed to show the presence of calcite, gypsum, quartz, and muscovite minerals with organic fibers. Chemical analyses of the specimens showed that high SiO2＋Al2O3 ＋ Fe2O3 contents yielded high values of hydraulicity and cementation indices. A significant result of this study was that mortars with high hydraulicity and cementation indices have high mechanical strengths. This characteristic may be the main reason for the earthquake resistance of the historical Alhambra palace.

关键词： Al-Andalus mortars Alhambra palace Microscopic properties

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

parastomal hernia repair

引用

plastic and Aesthetic Research 2022年第1期9卷 402-412页

作者： Jeffrey Michael Smith Sahil k.kapur Alexander F.Mericli Donald p.Baumann Charles E.Butler Department of plastic Surgery The University of Texas MD Anderson Cancer CenterHoustonTX 77030USA Department of Surgery Division of Plastic SurgeryThe University of Texas Medical BranchGalvestonTX 77555USA

Despite significant advances in abdominal wall reconstruction,parastomal hernias remain a complex problem,with a high risk of recurrence following *** a number of surgical hernia repair techniques have been proposed,there is no consensus on optimal *** clinical variables must be considered when developing a comprehensive repair plan that minimizes the likelihood of hernia recurrence and surgical site *** this review,we describe the incidence of parastomal hernias and discuss pertinent risk factors,medical history findings,physical examination findings,supplementary diagnostic modalities,parastomal hernia classification systems,surgical indications,and repair *** consideration is given to the discussion of mesh reinforcement,including available biomaterials,anatomic plane selection,and the extent of mesh *** open repairs are the primary focus of this article,minimally invasive laparoscopic and robotic approaches are also briefly *** is our hope that the provided surgical outcome data will help guide surgical management and optimize outcomes for affected patients.

关键词： Abdominal wall reconstruction parastomal hernia stoma biologic mesh synthetic mesh polypropylene acellular dermal matrix

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：