Simplified Neutrosophic Sets Based on Interval Dependent Degree for Multi-Criteria Group Decision-Making Problems

In this paper, a new approach and framework based on the interval dependent degree for multi-criteria group decision-making (MCGDM) problems with simplified neutrosophic sets (SNSs) is proposed. Firstly, the simplified dependent function and distribution function are defined. Then, they are integrated into the interval dependent function which contains interval computing and distribution information of the intervals

Acute Ischaemic Stroke Prediction from Physiological Time Series Patterns

BackgroundStroke is one of the major diseases with human mortality. Recent clinical research has indicated that early changes in common physiological variables represent a potential therapeutic target, thus the manipulation of these variables may eventually yield an effective way to optimise stroke recovery.AimsWe examined correlations between physiological parameters of patients during the first 48 hours after a stroke, and their stroke outcomes after 3 months. We wanted to discover physiological determinants that could be used to improve health outcomes by supporting the medical decisions that need to be made early on a patient’s stroke experience.Method  We applied regression-based machine learning techniques to build a prediction algorithm that can forecast 3-month outcomes from initial physiological time series data during the first 48 hours after stroke. In our method, not only did we use statistical characteristics as traditional prediction features, but also we adopted trend patterns of time series data as new key features.ResultsWe tested our prediction method on a real physiological data set of stroke patients. The experiment results revealed an average high precision rate: 90%. We also tested prediction methods only considering statistical characteristics of physiological data, and concluded an average precision rate: 71%.ConclusionWe demonstrated that using trend pattern features in prediction methods improved the accuracy of stroke outcome prediction. Therefore, trend patterns of physiological time series data have an important role in the early treatment of patients with acute ischaemic stroke

Maintaining Transitive Closure in First Order After Node-Set and Edge-Set Deletions

We consider the problem of maintaining, using first-order formulas but without auxiliary relations, the transitive closure of directed graphs after the deletion of sets of edges and nodes; earlier results focused on edge-set insertions and single edge deletions. We give a generic result which asserts maintainability after deleting any “antichain” of edges. Many maintainability results follow, including after deleting any edge from acyclic graphs, after deleting any subset of all incoming (outgoing) edges to (from) any antichain family of strongly connected components (SCC), and after deleting any antichain of nodes. We then show maintainability after deleting all edges (or nodes) in any antichain family of SCCs. Finally, we show that maintainability after node deletions is at least as hard as after edge deletions

ABSTRACT Improved record linkage for encrypted identifying data

The health data integration project at the E-Health Research Centre is researching ways of improving the integration of health and health related data while maintaining the privacy and security of the data. One such method is to improve the mechanisms of matching patients across databases when the identifying information must not be revealed, even during the linkage step. Background: With health related data spread between many administrative and clinical databases the ability to bring the data together dynamically is important. This could be to support clinical based decision making, administrative reporting or for clinical research based access to data. Objectives: There are already mechanisms published for blind folded record linkage. A mechanism for further strengthening the security and privacy of these algorithms is to encrypt the identifying data, such as name, data of birth, before performing the linkage step. However, due to the nature of encryption algorithms, encrypted data can only be matched exactly, limiting the ability to allow for errors in the data. This work presents a mechanism to allow matching of encrypted data when there may be errors in the data. Methods: A public reference table which is common to both data custodians is used. Each value in the original data is compared to data in the public reference table using an edit distance function. Names from the reference table which are within a given distance of the original data are sent to the linker. The data from the two data custodians are then compared to decide the likelihood of two records being a match. Results: The method described in this paper performs better than other methods which support matching of encrypted data, such as exact matching or matching using soundex. Discussion and Conclusion: The method described in this paper can be used to improve the level of record matching in tools where access to identifying data is prohibited. This method is currently being added to the HDI software tool as another mechanism of matching records between databases. Keywords

Uncertain Multiattribute Decision-Making Based on Interval Number with Extension-Dependent Degree and Regret Aversion

In view of the uncertainty multiattribute decision-making problem with attribute values and weights both being interval number, a new solution based on regret theory and extension-dependent degree is proposed. It can define pass value of each attribute, which means decision-maker’s acceptance for the scheme under the pass value will decline quickly. Then according to traditional regret theory, the method defines an extension-dependent function based on pass value which can improve the flexibility of the traditional utility function and the ability to describe the risk aversion actions from decision-makers. Then the extension-dependent function for interval number is built, and the perceived utility value of each scheme is obtained based on the interval’s optimal value. The method can also reflect the decision-maker’s reference to high or low evaluation score by setting attitude coefficients. At last, an example is presented to examine the feasibility, effectiveness, and stability of our method

Incremental FO(+,\u3c) Maintenance of All-Pairs Shortest Paths for Undirected Graphs After Insertions and Deletions

We give incremental algorithms, which support both edge insertions and deletions, for the all-pairs shortest-distance problem (APSD) in weighted undirected graphs. Our algorithms use first-order queries, + (addition) and \u3c (less than); they store O (n2) number of tuples, where n is the number of vertices, and have AC0 data complexity for integer weights. Since FO (+,\u3c) is supported by almost all current database systems, our maintenance algorithms are more appropriate for database applications than non-database query type maintenance algorithms. Our algorithms can also be extended to duplicate semantics

Cyberbullying validation

Cyberbullying is widely recognised as a serious social menace which affects millions of people around the world, especially teenagers and adolescents. In this Chapter, we present the results of an online survey, which is conducted to understand and differentiate between real cyberbullying and cyberbullying-like instances in user generated content. We study the subtle differences between the motives of the sender of messages similar to cyberbullying, and how messages are perceived by the recipient. In particular, we investigate forms, prevalence, and key indicators of cyberbullying within written contents. Firstly three variants of cyberbullying are introduced, namely: 'direct', 'indirect'and 'misinterpreted'forms of cyberbullying, based on the involvement of the recipient in these types of cyberbullying. Then we validate the key indicators which make written contents becomes cyberbullying, based on users'online experiences and the frequency with which they received and/or sent cyberbullying messages