Building the capacity of family day care educators to promote children’s social and emotional wellbeing : an exploratory cluster randomised controlled trial

Background: Childhood mental health problems are highly prevalent, experienced by one in five children living in socioeconomically disadvantaged families. Although childcare settings, including family day care are ideal to promote children’s social and emotional wellbeing at a population level in a sustainable way, family day care educators receive limited training in promoting children’s mental health. This study is an exploratory wait-list control cluster randomised controlled trial to test the appropriateness, acceptability, cost, and effectiveness of “Thrive,” an intervention program to build the capacity of family day care educators to promote children’s social and emotional wellbeing. Thrive aims to increase educators’ knowledge, confidence and skills in promoting children’s social and emotional wellbeing.
Methods/Design: This study involves one family day care organisation based in a low socioeconomic area of Melbourne. All family day care educators (term used for registered carers who provide care for children for financial reimbursement in the carers own home) are eligible to participate in the study. The clusters for randomisation will be the fieldworkers (n = 5) who each supervise 10-15 educators. The intervention group (field workers and educators) will participate in a variety of intervention activities over 12 months, including workshops; activity exchanges with other educators; and focused discussion about children’s social and emotional wellbeing during field worker visits. The control group will continue with their normal work practice. The intervention will be delivered to the intervention group and then to the control group after a time delay of 15 months post intervention commencement. A baseline survey will be conducted with all consenting educators and field workers (n = ~70) assessing outcomes at the cluster and individual level. The survey will also be administered at one month, six months and 12 months post-intervention commencement. The survey consists of questions measuring perceived levels of knowledge, confidence and skills in promoting children’s social and emotional wellbeing. As much of this intervention will be delivered by field workers, field worker-family day care educator relationships are key to its success and thus supervisor support will also be measured. All educators will also have an in-home quality of care assessment at baseline, one month, six months and 12 months post-intervention commencement. Process evaluation will occur at one month, six months and 12 months post-intervention commencement. Information regarding intervention fidelity and economics will also be assessed in the survey.
Discussion: A capacity building intervention in child mental health promotion for family day care is an essential contribution to research, policy and practice. This initiative is the first internationally, and essential in building an evidence base of interventions in this extremely policy-timely setting.

Towards anomalous diffusion sources detection in a large network

Witnessing the wide spread of malicious information in large networks, we develop an efficient method to detect anomalous diffusion sources and thus protect networks from security and privacy attacks. To date, most existing work on diffusion sources detection are based on the assumption that network snapshots that reflect information diffusion can be obtained continuously. However, obtaining snapshots of an entire network needs to deploy detectors on all network nodes and thus is very expensive. Alternatively, in this article, we study the diffusion sources locating problem by learning from information diffusion data collected from only a small subset of network nodes. Specifically, we present a new regression learning model that can detect anomalous diffusion sources by jointly solving five challenges, that is, unknown number of source nodes, few activated detectors, unknown initial propagation time, uncertain propagation path and uncertain propagation time delay. We theoretically analyze the strength of the model and derive performance bounds. We empirically test and compare the model using both synthetic and real-world networks to demonstrate its performance.

Minimal-order functional observer-based residual generators for fault detection and isolation of dynamical systems

This paper examines the design of minimal-order residual generators for the purpose of detecting and isolating actuator and/or component faults in dynamical systems. We first derive existence conditions and design residual generators using only first-order observers to detect and identify the faults. When the first-order functional observers do not exist, then based on a parametric approach to the solution of a generalized Sylvester matrix equation, we develop systematic procedures for designing residual generators utilizing minimal-order functional observers. Our design approach gives lower-order residual generators than existing results in the literature. The advantages for having such lower-order residual generators are obvious from the economical and practical points of view as cost saving and simplicity in implementation can be achieved, particularly when dealing with high-order complex systems. Numerical examples are given to illustrate the proposed fault detection and isolation schemes. In all of the numerical examples, we design minimum-order residual generators to effectively detect and isolate actuator and/or component faults in the system.

A new semi-automated method for assessing avian acoustic networks reveals that juvenile and adult zebra finches have separate calling networks

Social networks are often inferred from spatial associations, but other parameters like acoustic communication are likely to play a central role in within group interactions. However, it is currently difficult to determine which individual initiates vocalizations, or who responds to whom. To this aim, we designed a method that allows analyzing group vocal network while controlling for spatial networks, by positioning each group member in equidistant individual cages and analyzing continuous vocal interactions semi-automatically. We applied this method to two types of zebra finch groups, composed of either two adult females and two juveniles, or four young adults (juveniles from the first groups). Young often co-occur in the same social group as adults but are likely to have a different social role, which may be reflected in their vocal interactions. Therefore, we tested the hypothesis that the social structure of the group influences the parameters of the group vocal network. We found that groups including juveniles presented periods with higher level of activity than groups composed of young adults. Using two types of analyses (Markov analysis and cross-correlation), we showed that juveniles as well as adults were more likely to respond to individuals of their own age-class (i.e. to call one after another, in terms of turn-taking, and within a short time-window, in terms of time delay). When juveniles turned into adulthood, they showed adult characteristics of vocal patterns. Together our results suggest that vocal behavior changes during ontogeny, and individuals are more strongly connected with individuals of the same age-class within acoustic networks.

Delay control and parallel admission algorithms for real-time anycast flow

An anycast flow is a flow that can be connected to any one of the members in a group of designated (replicated) servers (called anycast group). In this paper, we derive a set of formulas for calculating the end-to-end delay bound for the anycast flows and present novel admission control algorithms for anycast flows with real-time constraints. Given such an anycast group, our algorithms can effectively select the paths for anycast flows' admission and connection based on the least end-to-end delay bounds evaluated. We also present a parallel admission control algorithm that can effectively calculate the available paths with a short delay bound for different destinations in the anycast group so that a best path with the shortest delay bound can be chosen.

Improvement on delay dependent absolute stability of Lurie control systems with multiple time delays

Absolute stability of Lurie control systems with multiple time-delays is studied in this paper. By using extended Lyapunov functionals, we avoid the use of the stability assumption on the main operator and derive improved stability criteria, which are strictly less conservative than the criteria in [2,3].

Observer-based control for time-varying delay neural networks with nonlinear observation

This paper studies the problem of designing observer-based controllers for a class of delayed neural networks with nonlinear observation. The system under consideration is subject to nonlinear observation and an interval time-varying delay. The nonlinear observation output is any nonlinear Lipschitzian function and the time-varying delay is not required to be differentiable nor its lower bound be zero. By constructing a set of appropriate Lyapunov-Krasovskii functionals and utilizing the Newton-Leibniz formula, some delay-dependent stabilizability conditions which are expressed in terms of Linear Matrix Inequalities (LMIs) are derived. The derived conditions allow simultaneous computation of two bounds that characterize the exponential stability rate of the closed-loop system. The unknown observer gain and the state feedback observer-based controller are directly obtained upon the feasibility of the derived LMIs stabilizability conditions. A simulation example is presented to verify the effectiveness of the proposed result.

A delay-dependent functional observer for linear time-invariant systems with input delay

A delay-dependent functional observer is designed for linear time-invariant (LTI) systems with time-varying input delay. Compared to delay-free observers, delay-dependent functional observers are less conservative and cover more systems. The designed functional observer is with minimum possible order (minimal). Necessary and sufficient conditions of the existence of the observer and asymptomatic stability of it are illustrated. The proposed observer is extended to multiple input delayed systems with time-varying delays. An algorithm is developed for designing of the minimal order observer based on the methodology of this paper. Two numerical examples and simulations are used to support our proposed methodology.

Stochastic stability of nonlinear discrete-time Markovian jump systems with time-varying delay and partially unknown transition rates

This paper is concerned with stochastic stability of a class of nonlinear discrete-time Markovian jump systems with interval time-varying delay and partially unknown transition probabilities. A new weighted summation inequality is first derived. We then employ the newly derived inequality to establish delay-dependent conditions which guarantee the stochastic stability of the system. These conditions are derived in terms of tractable matrix inequalities which can be computationally solved by various convex optimized algorithms. Numerical examples are provided to illustrate the effectiveness of the obtained results.

Reachable sets bounding for switched systems with time-varying delay and bounded disturbances

In this paper, we address the problem of finding outer bound of forward reachable sets and inter-bound of backward reachable sets of switched systems with an interval time-varying delay and bounded disturbances. By constructing a flexible Lyapunov–Krasovskii functional combining with some recent refined integral-based inequalities, some sufficient conditions are derived for the existence of (1) the smallest possible outer bound of forwards reachable sets; and (2) the largest possible inter-bound of backward reachable sets. These conditions are delay dependent and in the form of linear matrix inequalities, which therefore can be efficiently solved by using existing convex algorithms. A constructive geometric design of switching laws is also presented. Two numerical examples with simulation results are provided to demonstrate the effectiveness of our results.

Reachable sets bounding for generalized neural networks with interval time-varying delay and bounded disturbances

This paper deals with the problem of finding outer bound of forwards reachable sets and interbound of backwards reachable sets of generalized neural network systems with interval nondifferentiable time-varying delay and bounded disturbances. Based on constructing a suitable Lyapunov–Krasovskii functional and utilizing some improved Jensen integral-based inequalities, two sufficient conditions are derived for the existence of: (1) the smallest possible outer bound of forwards reachable sets and (2) the largest possible interbound of backwards reachable sets. These conditions are delay dependent and in the form of matrix inequalities, which therefore can be efficiently solved by using existing convex algorithms. Three numerical examples with simulation results are provided to demonstrate the effectiveness of our results.