Pattern-based software architecture for service-oriented software systems

Service-oriented architecture is a recent conceptual framework for service-oriented software platforms. Architectures are of great importance for the evolution of software systems. We present a modelling and transformation technique for service-centric distributed software systems. Architectural configurations, expressed through hierarchical architectural patterns, form the core of a specification and transformation technique. Patterns on different levels of abstraction form transformation invariants that structure and constrain the transformation process. We explore the role that patterns can play in architecture transformations in terms of functional properties, but also non-functional quality aspects

Embedding calculus knot invariants are of finite type

We show that the map on components from the space of classical long knots to the n-th stage of its Goodwillie-Weiss embedding calculus tower is a map of monoids whose target is an abelian group and which is invariant under clasper surgery. We deduce that this map on components is a finite type-(n-1) knot invariant. We also compute the second page in total degree zero for the spectral sequence converging to the components of this tower as Z-modules of primitive chord diagrams, providing evidence for the conjecture that the tower is a universal finite-type invariant over the integers. Key to these results is the development of a group structure on the tower compatible with connect-sum of knots, which in contrast with the corresponding results for the (weaker) homology tower requires novel techniques involving operad actions, evaluation maps, and cosimplicial and subcubical diagrams.Comment: Revised maps to the infinitesimal mapping space model in Sections 3 and 4 and analysis of cubical diagrams in Section 5. Minor expository and organizational changes throughout. Now 28 pages, 4 figure

Unlocking Blocked Communicating Processes

We study the problem of disentangling locked processes via code refactoring. We identify and characterise a class of processes that is not lock-free; then we formalise an algorithm that statically detects potential locks and propose refactoring procedures that disentangle detected locks. Our development is cast within a simple setting of a finite linear CCS variant \^a although it suffices to illustrate the main concepts, we also discuss how our work extends to other language extensions.Comment: In Proceedings WWV 2015, arXiv:1508.0338

Aerospace engineering educational program

The principle goal of the educational component of NASA CORE is the creation of aerospace engineering options in the mechanical engineering program at both the undergraduate and graduate levels. To accomplish this goal, a concerted effort during the past year has resulted in detailed plans for the initiation of aerospace options in both the BSME and MSME programs in the fall of 1993. All proposed new courses and the BSME aerospace option curriculum must undergo a lengthy approval process involving two cirriculum oversight committees (School of Engineering and University level) and three levels of general faculty approval. Assuming approval is obtained from all levels, the options will officially take effect in Fall '93. In anticipation of this, certain courses in the proposed curriculum are being offered during the current academic year under special topics headings so that current junior level students may graduate in May '94 under the BSME aerospace option. The proposed undergraduate aerospace option curriculum (along with the regular mechanical engineering curriculum for reference) is attached at the end of this report, and course outlines for the new courses are included in the appendix

A conceptual architecture for semantic web services development and deployment

Several extensions of the Web Services Framework (WSF) have been proposed. The combination with Semantic Web technologies introduces a notion of semantics, which can enhance scalability through automation. Service composition to processes is an equally important issue. Ontology technology – the core of the Semantic Web – can be the central building block of an extension endeavour. We present a conceptual architecture for ontology-based Web service development and deployment. The development of service-based software systems within the WSF is gaining increasing importance. We show how ontologies can integrate models, languages, infrastructure, and activities within this architecture to support reuse and composition of semantic Web services

Comparison of Staggered Grid Finite Difference Schemes for Ultrasound Simulation in Curving Composites

The optimization of ultrasonic nondestructive evaluation (NDE) simulation tools for composites has the potential to reduce both individual part inspection time and overall certification time for composite parts and structures. Inspection guidance based on simulation provides increased confidence in the veracity of inspection results in addition to time reductions. This paper outlines ongoing work targeted to advance this objective through the use of finite difference (FD) simulation techniques formulated for composite structures with realistic geometries. Two staggered grid explicit FD schemes which show promise for this purpose are assessed: the Lebedev FD scheme and the rotated staggered grid (RSG) FD scheme. Algorithmic points which provide challenges for complex geometries are addressed, in particular handling of traction free surfaces and bi-material interfaces present at lamina boundaries. Code execution time estimates are performed as well to guide feasible domain sizes relative to algorithm choice and available hardware. Three test cases are simulated: a delaminated plate, a cylinder, and a triclinic lamina. These tests demonstrate that the Lebedev FD scheme needs additional work to handle inter-laminar interfaces and traction free boundaries in the presence of stair-stepping approximations. In contrast, the simple structure of the RSG unit cell makes it more straightforward to construct a 3D simulation technique for curved composite laminates

Multilevel Contracts for Trusted Components

This article contributes to the design and the verification of trusted components and services. The contracts are declined at several levels to cover then different facets, such as component consistency, compatibility or correctness. The article introduces multilevel contracts and a design+verification process for handling and analysing these contracts in component models. The approach is implemented with the COSTO platform that supports the Kmelia component model. A case study illustrates the overall approach.Comment: In Proceedings WCSI 2010, arXiv:1010.233