Development of a Fall Detection System Based on Neural Network Featuring IoT-Technology

Accidental falls are considered a major cause of accidents that could lead to serious injuries, paralysis, psychological damage, and even deaths, especially for the elderly. Therefore in this project, a neural network-based fall detection system that could automatically detect a fall event is proposed. The system is enhanced with Internet-of-Things (IoT) features that could reduce the response time and efficiently improve the prognosis of fall victims. A 10 Degree of Freedom (DOF) Inertial Measurement Unit (IMU) module is connected to an Intel Edison with Mini Breakout board and mounted on a wearable waist-worn device to continuously record body movements. A backpropagation neural network algorithm has been developed to accurately distinguish falls from different postural transitions during activities of daily living (ADL). A body temperature and heart-pulse monitoring device were developed for this system to provide the medical personnel additional information on the body condition of the fall victim. Using the latest IoT-technology, the system can be connected to the internet and provides a continuous and real-time monitoring capability. Once a fall accident happens, the system will be automatically triggered. This will activate an Android App through the Wi-Fi network that will then send an emergency SMS with the actual location and body conditions of the victim to a recipient. A series of falls and ADL simulations were performed by a group of subjects to test and validate the performance of the system. The experiment results showed that the proposed system could obtain a sensitivity of 95.5%, specificity of 96.4%, and accuracy of 96.3%

Adaptive particle swarm optimization

An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perform a global search over the entire search space with faster convergence speed. The APSO consists of two main steps. First, by evaluating the population distribution and particle fitness, a real-time evolutionary state estimation procedure is performed to identify one of the following four defined evolutionary states, including exploration, exploitation, convergence, and jumping out in each generation. It enables the automatic control of inertia weight, acceleration coefficients, and other algorithmic parameters at run time to improve the search efficiency and convergence speed. Then, an elitist learning strategy is performed when the evolutionary state is classified as convergence state. The strategy will act on the globally best particle to jump out of the likely local optima. The APSO has comprehensively been evaluated on 12 unimodal and multimodal benchmark functions. The effects of parameter adaptation and elitist learning will be studied. Results show that APSO substantially enhances the performance of the PSO paradigm in terms of convergence speed, global optimality, solution accuracy, and algorithm reliability. As APSO introduces two new parameters to the PSO paradigm only, it does not introduce an additional design or implementation complexity

A study of event traffic during the shared manipulation of objects within a collaborative virtual environment

Event management must balance consistency and responsiveness above the requirements of shared object interaction within a Collaborative Virtual Environment (CVE) system. An understanding of the event traffic during collaborative tasks helps in the design of all aspects of a CVE system. The application, user activity, the display interface, and the network resources, all play a part in determining the characteristics of event management. Linked cubic displays lend themselves well to supporting natural social human communication between remote users. To allow users to communicate naturally and subconsciously, continuous and detailed tracking is necessary. This, however, is hard to balance with the real-time consistency constraints of general shared object interaction. This paper aims to explain these issues through a detailed examination of event traffic produced by a typical CVE, using both immersive and desktop displays, while supporting a variety of collaborative activities. We analyze event traffic during a highly collaborative task requiring various forms of shared object manipulation, including the concurrent manipulation of a shared object. Event sources are categorized and the influence of the form of object sharing as well as the display device interface are detailed. With the presented findings the paper wishes to aid the design of future systems

Creating Complex Network Services with eBPF: Experience and Lessons Learned

The extended Berkeley Packet Filter (eBPF) is a recent technology available in the Linux kernel that enables flexible data processing. However, so far the eBPF was mainly used for monitoring tasks such as memory, CPU, page faults, traffic, and more, with a few examples of traditional network services, e.g., that modify the data in transit. In fact, the creation of complex network functions that go beyond simple proof-of-concept data plane applications has proven to be challenging due to the several limitations of this technology, but at the same time very promising due to some characteristics (e.g., dynamic recompilation of the source code) that are not available elsewhere. Based on our experience, this paper presents the most promising characteristics of this technology and the main encountered limitations, and we envision some solutions that can mitigate the latter. We also summarize the most important lessons learned while exploiting eBPF to create complex network functions and, finally, we provide a quantitative characterization of the most significant aspects of this technology

Design of Event-Triggered Fault-Tolerant Control for Stochastic Systems with Time-Delays

This paper proposes two novel, event-triggered fault-tolerant control strategies for a class of stochastic systems with state delays. The plant is disturbed by a Gaussian process, actuator faults, and unknown disturbances. First, a special case about fault signals that are coupled to the unknown disturbances is discussed, and then a fault-tolerant strategy is designed based on an event condition on system states. Subsequently, a send-on-delta transmission framework is established to deal with the problem of fault-tolerant control strategy against fault signals separated from the external disturbances. Two criteria are provided to design feedback controllers in order to guarantee that the systems are exponentially mean-square stable, and the corresponding H∞-norm disturbance attenuation levels are achieved. Two theorems were obtained by synthesizing the feedback control gains and the desired event conditions in terms of linear matrix inequalities (LMIs). Finally, two numerical examples are provided to illustrate the effectiveness of the proposed theoretical results

NetServ: Reviving Active Networks

In 1996, Tennenhouse and Wetherall proposed active networks, where users can inject code modules into network nodes. The proposal sparked intense debate and follow-on research, but ultimately failed to win over the networking community. Fifteen years later, the problems that motivated the active networks proposal persist. We call for a revival of active networks. We present NetServ, a fully integrated active network system that provides all the necessary functionality to be deployable, addressing the core problems that prevented the practical success of earlier approaches. We make the following contributions. We present a hybrid approach to active networking, which combines the best qualities from the two extreme approaches — integrated and discrete. We built a working system that strikes the right balance between security and performance by leveraging current technologies. We suggest an economic model based on NetServ between content providers and ISPs. We built four applications to illustrate the model

Distributed H

This paper considers a distributed H∞ sampled-data filtering problem in sensor networks with stochastically switching topologies. It is assumed that the topology switching is triggered by a Markov chain. The output measurement at each sensor is first sampled and then transmitted to the corresponding filters via a communication network. Considering the effect of a transmission delay, a distributed filter structure for each sensor is given based on the sampled data from itself and its neighbor sensor nodes. As a consequence, the distributed H∞ sampled-data filtering in sensor networks under Markovian switching topologies is transformed into H∞ mean-square stability problem of a Markovian jump error system with an interval time-varying delay. By using Lyapunov Krasovskii functional and reciprocally convex approach, a new bounded real lemma (BRL) is derived, which guarantees the mean-square stability of the error system with a desired H∞ performance. Based on this BRL, the topology-dependent H∞ sampled-data filters are obtained. An illustrative example is given to demonstrate the effectiveness of the proposed method