检索结果-南通市图书馆

Bimatoprost引起眼部周围皮肤色素沉着组织病理学研究

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

美国医学会眼科杂志（中文版） 2006年第4期18卷 210-215页

作者： rashmi kapur Smajo Osmanovic Sami Toyran Deepak P. Edward 陆遥（译）赵光喜（校） Department of Ophthalmology and Visual Sciences University of Illinois Chicago Department of Ophthalmology and Visual Sciences Arlington Eye Physicians Arlington Heights Ⅲ 不详

目的：研究卢美根引起眼部周围皮肤色素沉着的光镜和超微结构的改变。方法：取使用卢美根后患者和对照患者的眼睑组织活检标本．进行光镜和透射电镜关。利用图形分析器。在Fontana-Masson-染色切片上计数黑色素颗粒。抗S100和CD3抗体进... 详细信息

目的：研究卢美根引起眼部周围皮肤色素沉着的光镜和超微结构的改变。方法：取使用卢美根后患者和对照患者的眼睑组织活检标本．进行光镜和透射电镜关。利用图形分析器。在Fontana-Masson-染色切片上计数黑色素颗粒。抗S100和CD3抗体进行免疫组化分析。计数阳性标记的细胞。结果：在光镜下。黑色素颗粒数量在使用卢美根后患者的眼睑标本中明显增加。电镜下显示皮肤的黑色素细胞具有明显的粗面内质网和丰富的正常大小的色素颗粒。与正常标本相比处于不同的成熟阶段。使用卢美根后眼睑标本的角化细胞与正常对照相比显示丰富的成熟色素颗粒。此外值得注意的是。两种标本中都没有非典型的色素细胞。S100-阳性的黑色素细胞在使用卢美根和对照组眼睑标本的数量相当。两组中几乎没有CD-3和CD-68阳性的细胞。结论：Bimatoprost引起的眼周色素沉着是由黑色素生成增加所致。在观察的标本上没有证据显示黑色素细胞增殖或前列腺素诱导的炎症反应发生。

关键词：皮肤色素沉着组织病理学周围眼部 Bi 黑色素颗粒黑色素细胞活检标本

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

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

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

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

作者： Deepak 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

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.

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.