TCBR-HMM: An HMM-based text classifier with a CBR system

This paper presents an innovative solution to model distributed adaptive systems in biomedical environments. We present an original TCBR-HMM (Text Case Based Reasoning-Hidden Markov Model) for biomedical text classification based on document content. The main goal is to propose a more effective classifier than current methods in this environment where the model needs to be adapted to new documents in an iterative learning frame. To demonstrate its achievement, we include a set of experiments, which have been performed on OSHUMED corpus. Our classifier is compared with Naive Bayes and SVM techniques, commonly used in text classification tasks. The results suggest that the TCBR-HMM Model is indeed more suitable for document classification. The model is empirically and statistically comparable to the SVM classifier and outperforms it in terms of time efficiency.     

An integrated approach to analysing the cost efficiency of postal networks

An integrated approach to measure the cost efficiency of the postal network of Universal Service Provider is proposed. An integrated approach enables the measurement of cost efficiency for delivery and non-delivery postal network units. The proposed approach is verified and tested on the postal network of the selected provider and the results were derived by using Data Envelopment Analysis (DEA). The results show that the main sources of inefficiency are inadequate allocation of resources relative to the network units. In addition, the study indicates that economies of scale have a positive impact on the efficiency of postal network units.     

Model checking temporal knowledge and commitments in multi-agent systems using reduction

Though modeling and verifying Multi-Agent Systems (MASs) have long been under study, there are still challenges when many different aspects need to be considered simultaneously. In fact, various frameworks have been carried out for modeling and verifying MASs with respect to knowledge and social commitments independently. However, considering them under the same framework still needs further investigation, particularly from the verification perspective. In this article, we present a new technique for model checking the logic of knowledge and commitments (CTLKC⁺). The proposed technique is fully-automatic and reduction-based in which we transform the problem of model checking CTLKC⁺ into the problem of model checking an existing logic of action called ARCTL. Concretely, we construct a set of transformation rules to formally reduce the CTLKC⁺ model into an ARCTL model and CTLKC⁺ formulae into ARCTL formulae to get benefit from the extended version of NuSMV symbolic model checker of ARCTL. Compared to a recent approach that reduces the problem of model checking CTLKC⁺ to another logic of action called GCTL¹, our technique has better scalability and efficiency. We also analyze the complexity of the proposed model checking technique. The results of this analysis reveal that the complexity of our reduction-based procedure is PSPACE-complete for local concurrent programs with respect to the size of these programs and the length of the formula being checked. From the time perspective, we prove that the complexity of the proposed approach is P-complete with regard to the size of the model and length of the formula, which makes it efficient. Finally, we implement our model checking approach on top of extended NuSMV and report verification results for the verification of the NetBill protocol, taken from business domain, against some desirable properties. The obtained results show the effectiveness of our model checking approach when the system scales up.     

Automating data exchange in process choreographies

Communication between organizations is formalized as process choreographies in daily business. While the correct ordering of exchanged messages can be modeled and enacted with current choreography techniques, no approach exists to describe and automate the exchange of data between processes in a choreography using messages. This paper describes an entirely model-driven approach for BPMN introducing a few concepts that suffice to model data retrieval, data transformation, message exchange, and correlation – four aspects of data exchange. For automation, this work utilizes a recent concept to enact data dependencies in internal processes. We present a modeling guideline to derive local process models from a given choreography; their operational semantics allows to correctly enact the entire choreography from the derived models only including the exchange of data. Targeting on successful interactions, we discuss means to ensure correct process choreography modeling. Finally, we implemented our approach by extending the camunda BPM platform with our approach and show its feasibility by realizing all service interaction patterns using only model-based concepts.     

Model repair — aligning process models to reality

Process mining techniques relate observed behavior (i.e., event logs) to modeled behavior (e.g., a BPMN model or a Petri net). Process models can be discovered from event logs and conformance checking techniques can be used to detect and diagnose differences between observed and modeled behavior. Existing process mining techniques can only uncover these differences, but the actual repair of the model is left to the user and is not supported. In this paper we investigate the problem of repairing a process model w.r.t. a log such that the resulting model can replay the log (i.e., conforms to it) and is as similar as possible to the original model. To solve the problem, we use an existing conformance checker that aligns the runs of the given process model to the traces in the log. Based on this information, we decompose the log into several sublogs of non-fitting subtraces. For each sublog, either a loop is discovered that can replay the sublog or a subprocess is derived that is then added to the original model at the appropriate location. The approach is implemented in the process mining toolkit ProM and has been validated on logs and models from several Dutch municipalities.     

青年医学工作者科普能力培养新模式

为了培养青年医师运用医学科普语言传播医学知识的能力，向社会提供更优质、可及的健康知识，改善医患关系，促进社会和谐；同时出于向社区、媒体推送一批优秀青年医学科普人才的考虑，本文在总结北京协和医院培养青年医务人员医学科普能力经验的基础上，尝试构建一套适合大型公立医院（尤其是教学医院）培养青年医务人员医学科普能力的新模式——“科普训练营”。本文旨在系统介绍该模式的产生背景、实践经验及初期效果，阐释实施后的重要意义，及实施过程中的挑战与应对策略。     

An overview on fault diagnosis and nature-inspired optimal control of industrial process applications

Fault detection, isolation and optimal control have long been applied to industry. These techniques have proven various successful theoretical results and industrial applications. Fault diagnosis is considered as the merge of fault detection (that indicates if there is a fault) and fault isolation (that determines where the fault is), and it has important effects on the operation of complex dynamical systems specific to modern industry applications such as industrial electronics, business management systems, energy, and public sectors. Since the resources are always limited in real-world industrial applications, the solutions to optimally use them under various constraints are of high actuality. In this context, the optimal tuning of linear and nonlinear controllers is a systematic way to meet the performance specifications expressed as optimization problems that target the minimization of integral- or sum-type objective functions, where the tuning parameters of the controllers are the vector variables of the objective functions. The nature-inspired optimization algorithms give efficient solutions to such optimization problems. This paper presents an overview on recent developments in machine learning, data mining and evolving soft computing techniques for fault diagnosis and on nature-inspired optimal control. The generic theory is discussed along with illustrative industrial process applications that include a real liquid level control application, wind turbines and a nonlinear servo system. New research challenges with strong industrial impact are highlighted.     

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.     

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.     

Design and synthesis of side-chain optimized poly(2,6-dimethyl-1,4-phenylene oxide)-g-poly(styrene sulfonic acid) as proton exchange membrane for fuel cell applications: Balancing the water-resistance and the sulfonation degree

Side-chain optimized poly (2,6-dimethyl-1,4-phenylene oxide)-g-poly (styrene sulfonic acid) (PPO-g-PSSA) is designed with balanced water-resistance and sulfonation degree. The PPO-g-PSSA is synthesized by controlled atom-transfer radical polymerization (ATRP) from brominated poly (2,6-dimethyl-1,4-phenylene oxide) (PPO-xBr) and ethyl styrene-4-sulfonate and followed by hydrolysis. A series of PPO-g-PSSA are prepared possessing different bromination degree (x) of PPO-xBr and polymerization degree (m) of the side-chains and the water-resistances of the fabricated membranes are investigated. The results show that a PPO-g-PSSA at relatively low x (x < 0.2) and high m (m > 4) exhibits good balance between the water-resistance and the sulfonation degree. Namely, it displays suitable proton conductivity with compromised water-resistance. Moreover, a maximum ion exchange capacity (IEC) of 3.24 mmol g^?1 is reached without the sacrifice of water-resistance. In addition, PPO-g-0.08PSSA-13 and PPO-g-0.14PSSA-4 are chosen characterized by thermogravimetric analysis, proton conductivities and mechanical properties. At 90% RH, the optimized PPO-g-0.08PPSA-13 possesses a proton conductivity of 37.9 mS cm^?1 at 40 °C and 45.5 mS cm^?1 at 95 °C, respectively.