The nanometre-scale physiology of bone: steric modelling and scanning transmission electron microscopy of collagen�Cmineral structure

The nanometre-scale structure of collagen and bioapatite within bone establishes bone''s physical properties, including strength and toughness. However, the nanostructural organization within bone is not well known and is debated. Widely accepted models hypothesize that apatite mineral (‘bioapatite’) is present predominantly inside collagen fibrils: in ‘gap channels’ between abutting collagen molecules, and in ‘intermolecular spaces’ between adjacent collagen molecules. However, recent studies report evidence of substantial extrafibrillar bioapatite, challenging this hypothesis. We studied the nanostructure of bioapatite and collagen in mouse bones by scanning transmission electron microscopy (STEM) using electron energy loss spectroscopy and high-angle annular dark-field imaging. Additionally, we developed a steric model to estimate the packing density of bioapatite within gap channels. Our steric model and STEM results constrain the fraction of total bioapatite in bone that is distributed within fibrils at less than or equal to 0.42 inside gap channels and less than or equal to 0.28 inside intermolecular overlap regions. Therefore, a significant fraction of bone''s bioapatite (greater than or equal to 0.3) must be external to the fibrils. Furthermore, we observe extrafibrillar bioapatite between non-mineralized collagen fibrils, suggesting that initial bioapatite nucleation and growth are not confined to the gap channels as hypothesized in some models. These results have important implications for the mechanics of partially mineralized and developing tissues.     

Tokens vs. Signals: On Conformance between Formal Models of Dataflow and Hardware

Designing hardware often involves several types of modeling and analysis, e.g., in order to check system correctness, to derive performance properties such as throughput, to optimize resource usages (e.g., buffer sizes), and to synthesize parts of a circuit (e.g., control logic). Working directly with low-level hardware models such as finite-state machines (FSMs) to answer such questions is often infeasible, e.g., due to state explosion. Instead, designers often use dataflow models such as SDF and CSDF, which are more abstract than FSMs, and less expensive to use since they come with more efficient analysis algorithms. However, dataflow models are only abstractions of the real hardware, and often omit critical information. This raises the question, when can one say that a certain dataflow model faithfully captures a given piece of hardware? The question is of more than simply academic interest. Indeed, as illustrated in this paper, dataflow-based analysis outcomes may sometimes be defensive (e.g., buffers that are too big) or even incorrect (e.g., buffers that are too small). To answer the question of faithfully capturing hardware using dataflow models, we develop a formal conformance relation between the heterogeneous formalisms of (1) finite-state machines with synchronous semantics, typically used to model synchronous hardware, and (2) asynchronous processes communicating via queues, used as a formal model for dataflow. The conformance relation preserves performance properties such as worst-case throughput and latency.     

Continuous authentication on relational streams

According to the database outsourcing model, a data owner delegates database functionality to a third-party service provider, which answers queries received from clients. Authenticated query processing enables the clients to verify the correctness of query results. Despite the abundance of methods for authenticated processing in conventional databases, there is limited work on outsourced data streams. Stream environments pose new challenges such as the need for fast structure updating, support for continuous query processing and authentication, and provision for temporal completeness. Specifically, in addition to the correctness of individual results, the client must be able to verify that there are no missing results in between data updates. This paper presents a comprehensive set of methods covering relational streams. We first describe REF, a technique that achieves correctness and temporal completeness but incurs false transmissions, i.e., the provider has to inform the clients whenever there is a data update, even if their results are not affected. Then, we propose CADS, which minimizes the processing and transmission overhead through an elaborate indexing scheme and a virtual caching mechanism. In addition, we present an analytical study to determine the optimal indexing granularity, and extend CADS for the case that the data distribution changes over time. Finally, we evaluate the effectiveness of our techniques through extensive experiments.     

P-Tree Structures and Event Horizon: Efficient Event-Set Implementations

This paper describes efficient data structures, namely the Indexed P-tree, Block P-tree, and Indexed-Block P-tree （or/P-tree, BP-tree, and IBP-tree, respectively, for short）, for maintaining future events in a general purpose discrete event simulation system, and studies the performance of their event set algorithms under the event horizon principle. For comparison reasons, some well-known event set algorithms have been selected and studied, that is, the Dynamic-heap and the P-tree algorithms. To gain insight into the performance of the proposed event set algorithms and allow comparisons with the other selected algorithms, they are tested under a wide variety of conditions in an experimental way. The time needed for the execution of the Hold operation is taken as the measure for estimating the average time complexity of the algorithms. The experimental results show that the BP-tree algorithm and the IBP-tree algorithm behave very well with the event set of all the sizes and their performance is almost independent of the stochastic distributions.     

Modified classification of sorption isotherms

A new equation is developed in this paper which is further used to divide sorption isotherms into classes which are connected to surface water effects and/or solution water effects and their combinations. It is shown that sorption isotherms can be successfully classified using the new equation into three basic classes I, II (most frequent) and III which roughly correspond to the original Brunauer’s classes. The equation is also used for further division of class II into three subclasses. Criteria for these classifications are presented.     

Comparison of expert-based and empirical evaluation methodologies in the case of a CBL environment: the “Orestis” experience

This paper compares several interface evaluation methods applied in the case of a computer based learning (CBL) environment, during a longitudinal study performed in three European countries, Greece, Germany, and Holland, and within the framework of an EC funded Leonardo da Vinci program. The paper firstly considers the particularities of the CBL environments presented in comparison to Distance Learning environments, as well as other educational pieces. Subsequently, the software under evaluation is described, as well as the underlying educational theories and the proposed instructional methodology regarding its effective application. In the case under study, a combination of expert-based and empirical (user-based) approaches are dealt with, and the “ideal” combination, for the consumption of the fewest possible resources in order to achieve the maximum outcome for the assessment of the software is investigated. A combinatory evaluation approach is argued for the provision of the best results in the case of complex environments such as educational ones. The results of this study show that both approaches, expert-based and empirical, have been found to perform adequately, although the empirical methodologies are always preferable. Therefore, this study concludes by proposing a combination of an expert-based approach during the early stages of the design cycle with an observational evaluation, performed by the instructors and/or the designers, which has to provide the best cost/performance factor.     

OPC-SMS: a wireless gateway to OPC-based data sources

This paper describes OPC-SMS gateway, a platform that integrates IP networks with the Short Message Service (SMS), in order to deliver an integrated service for access to data sources conforming to Object Linking and Embedding for Process Control (OPC) standard specifications, through SMS-enabled mobile devices. The gateway supports pull and push services in order to support both request-based and alarm/scheduled-based notifications, respectively. The proposed architecture is based entirely on the ubiquitous HyperText Transport Protocol (HTTP), Simple Object Access Protocol (SOAP), Extensible Markup Language (XML) protocols, and the Global System for Mobile communication (GSM) network and thus exploits the network infrastructure already in place. The capability of accessing different types of OPC data sources (real-time and historical) by any SMS-enabled device consists of a highly flexible service, supporting mobility and event-based notification. A pilot implementation of our approach has been tested in a large-scale installation for accessing OPC data sources of several automation subsystems in a hospital.     

Automated Composition of Module Chains

We introduce a problem of module composition. Modules are seen as “black boxes” with input and output ports. A compatibility relation models which input ports can connected to which output ports. We are given a set of available modules and a target module. We want to connect available modules into a chain that implements the target module. Constraints may be given on how many copies of each module can or should appear in the solution chain. Costs may be given on modules or ports or connections, so that an optimal solution with respect to these costs is found. We derive an algorithm to solve the above problem automatically. The algorithm transforms the problem into a shortest-path problem in a graph.