C-MOS array design techniques: SUMC multiprocessor system study

The current capabilities of LSI techniques for speed and reliability, plus the possibilities of assembling large configurations of LSI logic and storage elements, have demanded the study of multiprocessors and multiprocessing techniques, problems, and potentialities. Evaluated are three previous systems studies for a space ultrareliable modular computer multiprocessing system, and a new multiprocessing system is proposed that is flexibly configured with up to four central processors, four 1/0 processors, and 16 main memory units, plus auxiliary memory and peripheral devices. This multiprocessor system features a multilevel interrupt, qualified S/360 compatibility for ground-based generation of programs, virtual memory management of a storage hierarchy through 1/0 processors, and multiport access to multiple and shared memory units

Translating BIF into VHDL : algorithms and examples

This report describes an algorithm for automatically translating BIF system-level behavioral descriptions to behavioral VHDL. BIF is a new intermediate representation for behavioral synthesis, based on annotated state tables that supports user control of the synthesis process by allowing specification of partial design structures, unit bindings, and modification of the design at various levels of abstraction. This flexibility creates a need for behavioral verification of the design at each level of abstraction to provide feedback information to the user. Since VHDL is a well formalized, simulatable language it makes an ideal target for translation.We discuss the complexities inherent in representing BIF's hierarchical state specifications in VHDL and examine a general model for the combined representation of hierarchy, timing, concurrency, and arbitrary state transitions in VHDL.We conclude the report with several examples from a recently implemented translator

Specifications and programs for computer software validation

Three software products developed during the study are reported and include: (1) FORTRAN Automatic Code Evaluation System, (2) the Specification Language System, and (3) the Array Index Validation System

Bayesian Framework for Simultaneous Registration and Estimation of Noisy, Sparse and Fragmented Functional Data

Mathematical and Physical Sciences: 3rd Place (The Ohio State University Edward F. Hayes Graduate Research Forum)In many applications, smooth processes generate data that is recorded under a variety of observation regimes, such as dense sampling and sparse or fragmented observations that are often contaminated with error. The statistical goal of registering and estimating the individual underlying functions from discrete observations has thus far been mainly approached sequentially without formal uncertainty propagation, or in an application-specific manner by pooling information across subjects. We propose a unified Bayesian framework for simultaneous registration and estimation, which is flexible enough to accommodate inference on individual functions under general observation regimes. Our ability to do this relies on the specification of strongly informative prior models over the amplitude component of function variability. We provide two strategies for this critical choice: a data-driven approach that defines an empirical basis for the amplitude subspace based on available training data, and a shape-restricted approach when the relative location and number of local extrema is well-understood. The proposed methods build on the elastic functional data analysis framework to separately model amplitude and phase variability inherent in functional data. We emphasize the importance of uncertainty quantification and visualization of these two components as they provide complementary information about the estimated functions. We validate the proposed framework using simulation studies, and real applications to estimation of fractional anisotropy profiles based on diffusion tensor imaging measurements, growth velocity functions and bone mineral density curves.No embarg

Numerical Approach to Multi Dimensional Phase Transitions

We present an algorithm to analyze numerically the bounce solution of first-order phase transitions. Our approach is well suited to treat phase transitions with several fields. The algorithm consists of two parts. In the first part the bounce solution without damping is determined, in which case energy is conserved. In the second part the continuation to the physically relevant case with damping is performed. The presented approach is numerically stable and easily implemented.Comment: 18 pages, 8 figures; some comments, a reference and a table adde

Modelling and Refinement in CODA

This paper provides an overview of the CODA framework for modelling and refinement of component-based embedded systems. CODA is an extension of Event-B and UML-B and is supported by a plug-in for the Rodin toolset. CODA augments Event-B with constructs for component-based modelling including components, communications ports, port connectors, timed communications and timing triggers. Component behaviour is specified through a combination of UML-B state machines and Event-B. CODA communications and timing are given an Event-B semantics through translation rules. Refinement is based on Event-B refinement and allows layered construction of CODA models in a consistent way.Comment: In Proceedings Refine 2013, arXiv:1305.563

Preemption in Capacity and Price Determination - A Study of Endogenous Timing of Decisions for Homogeneous Markets

Endogenous timing can help to derive the time structure of decision making instead of assuming it as exogenously given. In our study we consider a homogeneous market where, like in the model of Kreps and Scheinkman (1983), sellers determine "sales capacities" before prices. Sellers must serve customers, but at higher costs when demand exceeds "capacitiy". Our model allows for preemption in "capacity" as well as in price determination. Since preemption means to decide before the random choice of cost parameters reflecting the stochastic nature of (excess) "capacity" costs, preemptive commitments are no obviously better timing dispositions.