Validation of a task demand measure for predicting mental workloads of physical therapists

The purpose of this study is to validate an analytical method in assessing demanded mental workloads for physical therapists, and to discuss its possible ergonomics implications on the design of healthcare working systems in which physical therapists are considered as the users. A task analysis was first used to understand the operation steps of three identified physical therapies. Then, the McCracken–Aldrich technique was applied to assign ratings of mental workload demanded for performing each step of the therapies. Finally, the assigned ratings were validated by the analysis of correlation with the answers of the NASA-TLX questionnaire collected from seventeen physical therapists in the rehabilitation center of a university-affiliated hospital. Results showed that the proposed McCracken–Aldrich technique was suitable as an analysis tool for predicting metal workloads of physical therapists. Some possible implications about the information provision and user interface design for reducing therapists' mental workloads on current therapy operations were discussed.Relevance to industryResults of this paper are expected to contribute the research and development in healthcare industry on its system design and workflow analysis.     

Consistent hierarchical economic NMPC for a class of hybrid systems using neighboring-extremal updates

A hierarchical two-layer control algorithm is developed for a class of hybrid (discrete-continuous dynamic) systems to support economically optimal operation of batch or continuous processes with a predefined production schedule. For this class of hybrid systems, the optimal control moves as well as the controlled switching times between two adjacent modes are determined online. In contrast to closely related schemes for integrated scheduling and control, the sequence of modes is not optimized. On the upper layer, the economic optimal control problem is solved rigorously by a slow hybrid economic model predictive controller at a low sampling rate. On the lower layer, a fast hybrid neighboring-extremal controller is based on the same economic optimal control problem as the slow controller to ensure consistency between both layers. The fast neighboring-extremal controller updates rather than tracks the optimal trajectories from the upper layer to account for disturbances. Consequently, the fast controller steers the process to its operational bounds under disturbances and the economic potential of the process is exploited anytime. The suggested two-layer control algorithm provides fully consistent control action on the fast and slow time-scale and thus avoids performance degradation and even infeasibilities which are commonly encountered if inconsistent optimal control problems are formulated and solved.     

Enhanced utilization bound of Rate-Monotonic scheduling in Controller Area Networks

When priorities to message streams are assigned using Rate Monotonic (RM) for a Controller Area Network (CAN), the utilization bound is known to be about 25% for CAN 2.0A and 29% for CAN 2.0B. In this letter, we present a higher utilization bound than the existing ones with a reasonable constraint. The new utilization bounds are approximately 34% for CAN 2.0A and 41% for CAN 2.0B if no single message stream's utilization exceeds 46% or 27% of the total utilization for CAN 2.0A or CAN 2.0B, respectively.     

Comparative analysis of two different middleware approaches for reconfiguration of distributed real-time systems

Software-based reconfiguration of distributed real-time systems is a complex problem with many sides to it ranging from system-wide concerns down to the intrinsic non-robust nature of the specific middleware layer and the used programming techniques. In a completely open distributed system, mixing reconfiguration and real-time is not possible; the set of possible target states can be very large threatening the temporal predictability of the reconfiguration process. Over the last years, middle ware solutions have appeared mainly for general purpose systems where efficient state transitions are sought for, but real-time properties are not considered. One of the few contributions to run-time software reconfiguration in distributed real-time environments has been the iLAND middleware, where the germ of a solution with high potential has been conceived and delivered in practice.¹ The key idea has been the fact that a set of bounds and limitations to the structure of systems and to their open nature needs to be imposed in order to come up with practical solutions. In this paper, the authors present the different sides of the problem of software reconfiguration from two complementary middleware perspectives comparing two strategies built inside distribution middleware. We highlight the lessons learned in the iLAND project aimed at service-based reconfiguration and compare it to our experience in the development of distributed real-time Java reconfiguration based on distributed tasks rescheduling. Authors also provide a language view of both solutions. Lastly, empirical results are shown that validate these solutions and compare them on the basis of different programming language realizations.     

PTC型BaTiO3陶瓷的孪晶和孪晶界

用透射电镜和高分辨电镜观察研究了PTC型BaTiO_3陶瓷的孪晶和孪晶界结构,并提出了可能的{111}孪晶及孪晶界的原子结构模型。结果表明,{111}孪晶形成氧八面体共面的共格倾斜孪晶界,在孪晶界处可能存在一定量的A空位且原子密度要低于孪晶体内。同时还发现两种其它特征的孪晶现象。