Engineering egress data considering pedestrians with reduced mobility

To quantify the evacuation process, evacuation practitioners use engineering egress data describing the occupant movement characteristics. These data are typically based to young and fit populations. However, the movement abilities of occupants who might be involved in evacuations are becoming more variable—with the building populations of today typically including increasing numbers of individuals: with impairments or who are otherwise elderly or generally less mobile. Thus, there will be an increasing proportion of building occupants with reduced ability to egress. For safe evacuation, there is therefore a need to provide valid engineering egress data considering pedestrians with disabilities. Gwynne and Boyce recently compiled a series of data sets related to the evacuation process to support practitioner activities in the chapter Engineering Data in the SFPE Handbook of Fire Protection Engineering. This paper supplements these data sets by providing information on and presenting data obtained from additional research related to the premovement and horizontal movement of participants with physical‐, cognitive‐, or age‐related disabilities. The aim is to provide an overview of currently available data sets related to, and key factors affecting the egress performance of, mixed ability populations which could be used to guide fire safety engineering decisions in the context of building design.     

无失效数据机载多余度EWIS可靠性研究

针对高可靠度机载多余度EWIS各组成部分寿命服从指数分布但参数未知的情况，提出采用无失效数据可靠度分析方法评估EWIS的可靠度水平。通过Monte-Carlo仿真方法对连接形式为“先并联、后串联”EWIS各组成部分寿命进行抽样，利用“最小最大值”方法获得系统寿命的抽样值，用概率纸检验法初步判断EWIS寿命是否服从威布尔分布，再用Pearson拟合优度检验法判断EWIS寿命是否服从威布尔分布。结合无故障飞行时间的样本值与EWIS寿命服从威布尔分布的假设，采用无失效数据分析方法评估EWIS的可靠度水平。研究方法对机载多余度EWIS无失效数据可靠度分析有一定的贡献。     

OWL‐based acquisition and editing of computer‐interpretable guidelines with the CompGuide editor

Computer‐Interpretable Guidelines (CIGs) are the dominant medium for the delivery of clinical decision support, given the evidence‐based nature of their source material. Therefore, these machine‐readable versions have the ability to improve practitioner performance and conformance to standards, with availability at the point and time of care. The formalisation of Clinical Practice Guideline knowledge in a machine‐readable format is a crucial task to make it suitable for the integration in Clinical Decision Support Systems. However, the current tools for this purpose reveal shortcomings with respect to their ease of use and the support offered during CIG acquisition and editing. In this work, we characterise the current landscape of CIG acquisition tools based on the properties of guideline visualisation, organisation, simplicity, automation, manipulation of knowledge elements, and guideline storage and dissemination. Additionally, we describe the CompGuide Editor, a tool for the acquisition of CIGs in the CompGuide model for Clinical Practice Guidelines that also allows the editing of previously encoded guidelines. The Editor guides the users throughout the process of guideline encoding and does not require proficiency in any programming language. The features of the CIG encoding process are revealed through a comparison with already established tools for CIG acquisition.     

Stream-Based Data Sampling Mechanism for Process Object

Process object is the instance of process. Vertexes and edges are in the graph of process object. There are different types of the object itself and the associations between object. For the large-scale data, there are many changes reflected. Recently, how to find appropriate real-time data for process object becomes a hot research topic. Data sampling is a kind of finding c hanges o f p rocess o bjects. There i s r equirements f or s ampling to be adaptive to underlying distribution of data stream. In this paper, we have proposed a adaptive data sampling mechanism to find a ppropriate d ata t o m odeling. F irst o f all, we use concept drift to make the partition of the life cycle of process object. Then, entity community detection is proposed to find changes. Finally, we propose stream-based real-time optimization of data sampling. Contributions of this paper are concept drift, community detection, and stream-based real-time computing. Experiments show the effectiveness and feasibility of our proposed adaptive data sampling mechanism for process object.     

Prediction of risk factors of cyberbullying-related words in Korea: Application of data mining using social big data

The study examined a decision tree analysis using social big data to conduct the prediction model on types of risk factors related to cyberbullying in Korea. The study conducted an analysis of 103,212 buzzes that had noted causes of cyberbullying and data were collected from 227 online channels, such as news websites, blogs, online groups, social network services, and online bulletin boards. Using opinion-mining method and decision tree analysis, the types of cyberbullying were sorted using SPSS 25.0. The results indicated that the total rate of types of cyberbullying in Korea was 44%, which consisted of 32.3% victims, 6.4% perpetrators, and 5.3% bystanders. According to the results, the impulse factor was also the greatest influence on the prediction of the risk factors and the propensity for dominance factor was the second greatest factor predicting the types of risk factors. In particular, the impulse factor had the most significant effect on bystanders, and the propensity for dominance factor was also significant in influencing online perpetrators. It is necessary to develop a program to diminish the impulses that were initiated by bystanders as well as victims and perpetrators because many of those bystanders have tended to aggravate impulsive cyberbullying behaviors.     

Maximum Data Generation Rate Routing Protocol Based on Data Flow Controlling Technology for Rechargeable Wireless Sensor Networks

For rechargeable wireless sensor networks, limited energy storage capacity, dynamic energy supply, low and dynamic duty cycles cause that it is unpractical to maintain a fixed routing path for packets delivery permanently from a source to destination in a distributed scenario. Therefore, before data delivery, a sensor has to update its waking schedule continuously and share them to its neighbors, which lead to high energy expenditure for reestablishing path links frequently and low efficiency of energy utilization for collecting packets. In this work, we propose the maximum data generation rate routing protocol based on data flow controlling technology. For a sensor, it does not share its waking schedule to its neighbors and cache any waking schedules of other sensors. Hence, the energy consumption for time synchronization, location information and waking schedule shared will be reduced significantly. The saving energy can be used for improving data collection rate. Simulation shows our scheme is efficient to improve packets generation rate in rechargeable wireless sensor networks.     

Development of autonomous monitoring and performance evaluation system of grid-tied photovoltaic station

This work aims to improve the existing monitoring systems MS for two grid-connected PV stations GCPVS of URERMS ADRAR, to eliminate its limitations. This improvement consists of developing an MS which is used for two PV stations with different configurations. This MS contains new LabVIEW-based monitoring software for visualizing real-time measured data and evaluating GCPVS performance. In addition, it illustrates the 2D and 3D real-time relationships of PV system parameters, which allow us to understand the dynamic behavior of PV system components. This developed monitoring software synchronizes also the various data acquisition units DAU of GCPVS, allowing simultaneous data access.To perform a reliable performance analysis and a comparative study of different GCPVS based on accurate measurements, the sensor's calibration is performed with its DAU. The MS autonomy is ensured by integrating developed PV-UPS. A graphical user interface is provided for the evaluation of PV-UPS performance.     

Mixture ratio modeling of dynamic systems

Any knowledge extraction relies (possibly implicitly) on a hypothesis about the modelled-data dependence. The extracted knowledge ultimately serves to a decision-making (DM). DM always faces uncertainty and this makes probabilistic modelling adequate. The inspected black-box modeling deals with “universal” approximators of the relevant probabilistic model. Finite mixtures with components in the exponential family are often exploited. Their attractiveness stems from their flexibility, the cluster interpretability of components and the existence of algorithms for processing high-dimensional data streams. They are even used in dynamic cases with mutually dependent data records while regression and auto-regression mixture components serve to the dependence modeling. These dynamic models, however, mostly assume data-independent component weights, that is, memoryless transitions between dynamic mixture components. Such mixtures are not universal approximators of dynamic probabilistic models. Formally, this follows from the fact that the set of finite probabilistic mixtures is not closed with respect to the conditioning, which is the key estimation and predictive operation. The paper overcomes this drawback by using ratios of finite mixtures as universally approximating dynamic parametric models. The paper motivates them, elaborates their approximate Bayesian recursive estimation and reveals their application potential.     

A single-phase algorithm for mining high utility itemsets using compressed tree structures

Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+ algorithms.     

机载光电雷达它机试飞技术研究

机载光电雷达受平台及大气环境影响较大,而它机试飞能有效规避研制风险,是产品研制的必经阶段。本文介绍了机载光电雷达它机试飞试验系统组成、试验流程和数据处理等内容。经工程验证,实施过程满足任务需求,对其他光电系统的它机及本机试飞具有参考价值。