Estimation of number-area-frequency dimensions of surface water bodies

This paper proposes a technique that includes a set of mathematical morphological transformations to estimate the frequency dimension. The dimension computed through a power law relationship is tallied with the dimension computed through a correlational plot. This technique is demonstrated on a two-dimensional section embodying a large number of surface water bodies, extracted from remotely sensed data, situated randomly, and the frequency dimension (D) for surface water bodies yields straight-line dependence of lnC(r) (correlational integral) on ln(r) (radius of structuring template). The correlational integral is computed for two aspects by considering the number of water bodies and their corresponding occupied areas. The number-frequency dimension and the area frequency dimension computed through correlational plots yield straight-line dependencies with slopes that are greater than unity but less than 2.0 (1.3 and 1.7, respectively).     

Verification of evolving software via component substitutability analysis

This paper presents an automated and compositional procedure to solve the substitutability problem in the context of evolving software systems. Our solution contributes two techniques for checking correctness of software upgrades: (1) a technique based on simultaneous use of over-and under-approximations obtained via existential and universal abstractions; (2) a dynamic assume-guarantee reasoning algorithm—previously generated component assumptions are reused and altered on-the-fly to prove or disprove the global safety properties on the updated system. When upgrades are found to be non-substitutable, our solution generates constructive feedback to developers showing how to improve the components. The substitutability approach has been implemented and validated in the ComFoRT reasoning framework, and we report encouraging results on an industrial benchmark. This is an extended version of a paper, Dynamic Component Substitutability Analysis, published in the Proceedings of the Formal Methods 2005 Conference, Lecture Notes in Computer Science, vol. 3582, by the same authors. This research was sponsored by the National Science Foundation under grant nos. CNS-0411152, CCF-0429120, CCR-0121547, and CCR-0098072, the Semiconductor Research Corporation under grant no. TJ-1366, the US Army Research Office under grant no. DAAD19-01-1-0485, the Office of Naval Research under grant no. N00014-01-1-0796, the ICAST project and the Predictable Assembly from Certifiable Components (PACC) initiative at the Software Engineering Institute, Carnegie Mellon University. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of any sponsoring institution, the US government or any other entity.     

Parallel Assignments in Software Model Checking

In this paper we investigate how formal software verification systems can be improved by utilising parallel assignment in weakest precondition computations.We begin with an introduction to modern software verification systems. Specifically, we review the method in which software abstractions are built using counterexample-guided abstraction refinement (CEGAR). The classical NP-complete parallel assignment problem is first posed, and then an additional restriction is added to create a special case in which the problem is tractable with an O(n²) algorithm. The parallel assignment problem is then discussed in the context of weakest precondition computations. In this special situation where statements can be assumed to execute truly concurrently, we show that any sequence of simple assignment statements without function calls can be transformed into an equivalent parallel assignment block.Results of compressing assignment statements into a parallel form with this algorithm are presented for a wide variety of software applications. The proposed algorithms were implemented in the ComFoRT reasoning framework [J. Ivers and N. Sharygina. Overview of ComFoRT: A model checking reasoning framework. Technical Report CMU/SEI-2004-TN-018, Carnegie Mellon Software Engineering Institute, 2004] and used to measure the improvement in the verification of real software systems. This improvement in time proved to be significant for many classes of software.     

Pairwise testing for software product lines: comparison of two approaches

Software Product Lines (SPL) are difficult to validate due to combinatorics induced by variability, which in turn leads to combinatorial explosion of the number of derivable products. Exhaustive testing in such a large products space is hardly feasible. Hence, one possible option is to test SPLs by generating test configurations that cover all possible t feature interactions (t-wise). It dramatically reduces the number of test products while ensuring reasonable SPL coverage. In this paper, we report our experience on applying t-wise techniques for SPL with two independent toolsets developed by the authors. One focuses on generality and splits the generation problem according to strategies. The other emphasizes providing efficient generation. To evaluate the respective merits of the approaches, measures such as the number of generated test configurations and the similarity between them are provided. By applying these measures, we were able to derive useful insights for pairwise and t-wise testing of product lines.     

Automated Compositional Abstraction Refinement for Concurrent C Programs: A Two-Level Approach

The state space explosion problem in model checking remains the chief obstacle to the practical verification of real-world distributed systems. We attempt to address this problem in the context of verifying concurrent (message-passing) C programs against safety specifications. More specifically, we present a fully automated compositional framework which combines two orthogonal abstraction techniques (operating respectively on data and events) within a counterexample-guided abstraction refinement (CEGAR) scheme. In this way, our algorithm incrementally increases the granularity of the abstractions until the specification is either established or refuted. Our explicit use of compositionality delays the onset of state space explosion for as long as possible. To our knowledge, this is the first compositional use of CEGAR in the context of model checking concurrent C programs. We describe our approach in detail, and report on some very encouraging preliminary experimental results obtained with our tool MAGIC.     

Concurrent software verification with states, events, and deadlocks

We present a framework for model checking concurrent software systems which incorporates both states and events. Contrary to other state/event approaches, our work also integrates two powerful verification techniques, counterexample-guided abstraction refinement and compositional reasoning. Our specification language is a state/event extension of linear temporal logic, and allows us to express many properties of software in a concise and intuitive manner. We show how standard automata-theoretic LTL model checking algorithms can be ported to our framework at no extra cost, enabling us to directly benefit from the large body of research on efficient LTL verification. We also present an algorithm to detect deadlocks in concurrent message-passing programs. Deadlock- freedom is not only an important and desirable property in its own right, but is also a prerequisite for the soundness of our model checking algorithm. Even though deadlock is inherently non-compositional and is not preserved by classical abstractions, our iterative algorithm employs both (non-standard) abstractions and compositional reasoning to alleviate the state-space explosion problem. The resulting framework differs in key respects from other instances of the counterexample-guided abstraction refinement paradigm found in the literature. We have implemented this work in the magic verification tool for concurrent C programs and performed tests on a broad set of benchmarks. Our experiments show that this new approach not only eases the writing of specifications, but also yields important gains both in space and in time during verification. In certain cases, we even encountered specifications that could not be verified using traditional pure event-based or state-based approaches, but became tractable within our state/event framework. We also recorded substantial reductions in time and memory consumption when performing deadlock-freedom checks with our new abstractions. Finally, we report two bugs (including a deadlock) in the source code of Micro-C/OS versions 2.0 and 2.7, which we discovered during our experiments. This research was sponsored by the National Science Foundation (NSF) under grants no. CCR-9803774 and CCR-0121547, the Office of Naval Research (ONR) and the Naval Research Laboratory (NRL) under contract no. N00014-01-1-0796, the Army Research Office (ARO) under contract no. DAAD19-01-1-0485, and was conducted as part of the Predictable Assembly from Certifiable Components (PACC) project at the Software Engineering Institute (SEI). This article combines and builds upon the papers (CCO⁺04) and (CCOS04). Received December 2004 Revised July 2005 Accepted July 2005 by Eerke A. Boiten, John Derrick, Graeme Smith and Ian Hayes     

Comparison of osteoconductivity and absorbability of beta-tricalcium phosphate and hydroxyapatite in clinical scenario of opening wedge high tibial osteotomy

The purpose of this study was to compare the osteoconductivity, and absorbability of hydroxyapatite or beta-tricalcium phosphate in clinical scenario of opening wedge high tibial osteotomy Total 41 knees of 40 patients with follow up period of more than 1 year were enrolled. These patients were divided into two groups, Group I (22 knees, 21 patients) used hydroxyapatite and Group II (19 knees, 19 patients) used beta-tricalcium phosphate as a substitute in the opening gap. According to proven method, the osteoconductivity was assessed radiographically by the extent of new bone formation at osteotomy space and absorbability was evaluated by measuring the area occupied by substitute at immediate postoperative, postoperative 6 months and 1 year. Regarding preoperative demographic data, no significant differences were found between two groups. No statistically significant differences were found between two groups regarding lower limb alignment (mechanical femorotibial angle, weight-bearing line%) and posterior tibial slope at postoperative and final follow up radiographs. Concerning the osteoconductivity, there were no significant differences between two groups in any zone. However, the absorption rate was significantly greater in the Group II than in Group I at 6 months (Group I: 13.7?±?6.8, group II: 35.3?±?15.8, P?=?0.001) and 1 year (Group I: 24.2?±?6.3, Group II: 49.6?±?14.3, P?<?0.0001). The complications related to bone substitutes were not observed. Both hydroxyapatite and beta-tricalcium phosphate showed satisfactory gap healing without complications and can be successfully used as alternative healing materials in opening wedge high tibial osteotomy. Our study showed that beta-tricalcium phosphate has superior absorbability than hydroxyapatite. But osteoconductivity showed no significant difference.     

Instrumental characterization of clay by XRF,XRD and FTIR

Instrumental characterizations of the clay were performed by different techniques such as XRF, XRD and FTIR. XRF shows the chemical compositions of the clay where Al-oxide and silica oxide are present in major quantity whereas XRD confirms the presence of these minerals in clay. FTIR studies show the presence of quartz, alumina, haematite and different mineral matters.     

Provision of Ramp-rate Limitation as Ancillary Service from Distribution to Transmission System: Definitions and Methodologies for Control and Sizing of Central Battery Energy Storage System

The variability of the output power of distributed renewable energy sources（DRESs） that originate from the fastchanging climatic conditions can negatively affect the grid stability. Therefore, grid operators have incorporated ramp-rate limitations（RRLs） for the injected DRES power in the grid codes. As the DRES penetration levels increase, the mitigation of high-power ramps is no longer considered as a system support function but rather an ancillary service（AS）. Energy storage systems（ESSs） coordinated by RR control algorithms are often applied to mitigate these power fluctuations. However, no unified definition of active power ramps, which is essential to treat the RRL as AS, currently exists. This paper assesses the various definitions for ramp-rate RR and proposes RRL method control for a central battery ESS（BESS） in distribution systems（DSs）. The ultimate objective is to restrain high-power ramps at the distribution transformer level so that RRL can be traded as AS to the upstream transmission system（TS）. The proposed control is based on the direct control of the ΔP/Δt, which means that the control parameters are directly correlated with the RR requirements included in the grid codes. In addition, a novel method for restoring the state of charge（So C） within a specific range following a high ramp-up/down event is proposed. Finally, a parametric method for estimating the sizing of central BESSs（BESS sizing for short） is developed. The BESS sizing is determined by considering the RR requirements, the DRES units, and the load mix of the examined DS. The BESS sizing is directly related to the constant RR achieved using the proposed control. Finally, the proposed methodologies are validated through simulations in MATLAB/Simulink and laboratory tests in a commercially available BESS.