First-priority relation graph-based malicious users detection in mobile social networks

Mobile social networks (MSNs) consist of many mobile users (individuals) with social characteristics, that provide a variety of data delivery services involving the social relationship among mobile individuals. Because mobile users move around based on their common interests and contact with each other more frequently if they have more social features in common in MSNs. In this paper, we first propose the first-priority relation graph, say FPRG, of MSNs. However, some users in MSNs may be malicious. Malicious users can break the data delivery through terminating the data delivery or tampering with the data. Therefore, malicious users will be detected in the process of looking for the data delivery routing to obtain efficient and reliable data delivery routing along the first-priority relation graph. Secondly, we propose one hamiltonian cycle decomposition of FPRG-based adaptive detection algorithm based on in MSNs under the PMC detection model (the system-level detection model).

algorithms for computing weak bisimulation equivalence

IEEE Comp Soc, IFIP, Tianjin Normal Univ

Mining mechanism of top-k influential nodes based on voting algorithm in mobile social networks

In recent years, evaluating the influence of nodes and finding top-k influential nodes in social networks, has drawn a wide attention and has become a hot-pot research issue. Considering the characteristics of social networks, we present a novel mechanism to mine the top-k influential nodes in mobile social networks. The proposed mechanism is based on the behaviors analysis of SMS/MMS (simple messaging service / multimedia messaging service) communication between mobile users. We introduce the complex network theory to build a social relation graph, which is used to reveal the relationship among people's social contacts and messages sending. Moreover, intimacy degree is also introduced to characterize social frequency among nodes. Election mechanism is hired to find the most influential node, and then a heap sorting algorithm is used to sort the voting results to find the k most influential nodes. The experimental results show that the mechanism can finds out the most influential top-k nodes efficiently and effectively. © 2013 IEEE.

Containing smartphone worm propagation with an influence maximization algorithm

In recent years, wide attention has been drawn to the problem of containing worm propagation in smartphones. Unlike existing containment models for worm propagation, we study how to prevent worm propagation through the immunization of key nodes (e.g.; the top k influential nodes). Thus, we propose a novel containment model based on an influence maximization algorithm. In this model, we introduce a social relation graph to evaluate the influence of nodes and an election mechanism to find the most influential nodes. Finally, this model provides a targeted immunization strategy to disable worm propagation by immunizing the top k influential nodes. The experimental results show that the model not only finds the most influential top k nodes quickly, but also effectively restrains and controls worm propagation.

Trustworthiness-hypercube-based reliable communication in mobile social networks

In mobile social networks (MSNs), the routing packet is forwarded from any user of in a group to any user of the other group until it reaches the destination group - the group where the destination is located. However, it is inevitable that malicious groups could compromise the quality and reliability of data. To alleviate such effect, analyzing the trustworthiness of a group has a positive influence on the confidence with which a group conducts transactions with that group. In our previous work, the feature-based first-priority relation graph (FPRG) of MSNs is proposed, in which two vertices (groups) are connected iff they have a first-priority relationship. In this paper, the trustworthiness computation of a group is firstly presented in the algorithm TC (Trustworthiness Computing) based on the FPRG. The trustworthiness of a group is evaluated based on the trustworthiness of neighbors and the number of malicious users in the group. We then establish the Trustworthiness-Hypercube-based Reliable Communication (THRC) algorithm in MSNs. The algorithm THRC can provide an effective and reliable data delivery routing. Finally, we also give two scenario simulations to elaborate the processes of the trustworthiness computation and reliable communication.

Current management of transitional feeding issues in preterm neonates born in Queensland, Australia

Background: Many preterm neonates display difficulty establishing suck-feeding competence in the weeks following birth. Ineffective management of transitional feeding issues may cause patient complications, and can contribute to increased length of stay. Aims: Given that many neonatal nurseries appear to vary in their neonatal feeding management practices, the aim of this study was to investigate and document the routine level of support and intervention currently provided for preterm neonates with transitional feeding issues across the various level II (special care) nurseries (SCNs) in Queensland, Australia. Methods: A questionnaire was mailed to all Queensland SCNs in 2005 (n = 36). The questionnaire contained a series of closed-choice and short-answer questions designed to obtain information from each SCN regarding their current practices for managing transitional feeding issues in preterm neonates. Results were confirmed during a follow-up phone call. Results: Responses were obtained from 29 SCNs (80.6%). None of these nurseries reported having any formal, written policies regarding the management of transitional feeding issues in preterm neonates. Wide variations were reported in relation to the suck-feeding assessments and interventions used by staff within the various SCNs. Of the 29 nurseries, 4 (13.8%) reported using checklists or assessments to judge readiness for suck-feeds, and 5 (17.2%) reported using pulse oximetry to judge tolerance of suck-feeding attempts. Eighteen SCNs (62.1%) reported offering some form of active intervention to assist neonates with transitional feeding issues, with the most common intervention techniques reported being non-nutritive sucking during tube feeds, pre-feeding oral stimulation, and actively pacing suck-feeds. Twenty-two SCNs (75.4%) reported having access to a lactation consultant to assist mothers with breastfeeding issues. Conclusions: Differences were reported in the routine management of transitional feeding issues in preterm neonates across the various SCNs in Queensland. It is suggested that evidence based guidelines need to be developed, and that, in order to do this, further research studies are required to determine current best practice, as well as to answer remaining questions. © 2008 Elsevier Ireland Ltd. All rights reserved.

Using a glow graph to represent data flow and dependency in event logs

The idea of extracting knowledge in process mining is a descendant of data mining. Both mining disciplines emphasise data flow and relations among elements in the data. Unfortunately, challenges have been encountered when working with the data flow and relations. One of the challenges is that the representation of the data flow between a pair of elements or tasks is insufficiently simplified and formulated, as it considers only a one-to-one data flow relation. In this paper, we discuss how the effectiveness of knowledge representation can be extended in both disciplines. To this end, we introduce a new representation of the data flow and dependency formulation using a flow graph. The flow graph solves the issue of the insufficiency of presenting other relation types, such as many-to-one and one-to-many relations. As an experiment, a new evaluation framework is applied to the Teleclaim process in order to show how this method can provide us with more precise results when compared with other representations.

Quantification de la relation séquence-activité de l’ARN par prédiction de structure tridimensionnelle

Dans un premier temps, nous avons modélisé la structure d’une famille d’ARN avec une grammaire de graphes afin d’identifier les séquences qui en font partie. Plusieurs autres méthodes de modélisation ont été développées, telles que des grammaires stochastiques hors-contexte, des modèles de covariance, des profils de structures secondaires et des réseaux de contraintes. Ces méthodes de modélisation se basent sur la structure secondaire classique comparativement à nos grammaires de graphes qui se basent sur les motifs cycliques de nucléotides. Pour exemplifier notre modèle, nous avons utilisé la boucle E du ribosome qui contient le motif Sarcin-Ricin qui a été largement étudié depuis sa découverte par cristallographie aux rayons X au début des années 90. Nous avons construit une grammaire de graphes pour la structure du motif Sarcin-Ricin et avons dérivé toutes les séquences qui peuvent s’y replier. La pertinence biologique de ces séquences a été confirmée par une comparaison des séquences d’un alignement de plus de 800 séquences ribosomiques bactériennes. Cette comparaison a soulevée des alignements alternatifs pour quelques unes des séquences que nous avons supportés par des prédictions de structures secondaires et tertiaires. Les motifs cycliques de nucléotides ont été observés par les membres de notre laboratoire dans l'ARN dont la structure tertiaire a été résolue expérimentalement. Une étude des séquences et des structures tertiaires de chaque cycle composant la structure du Sarcin-Ricin a révélé que l'espace des séquences dépend grandement des interactions entre tous les nucléotides à proximité dans l’espace tridimensionnel, c’est-à-dire pas uniquement entre deux paires de bases adjacentes. Le nombre de séquences générées par la grammaire de graphes est plus petit que ceux des méthodes basées sur la structure secondaire classique. Cela suggère l’importance du contexte pour la relation entre la séquence et la structure, d’où l’utilisation d’une grammaire de graphes contextuelle plus expressive que les grammaires hors-contexte. Les grammaires de graphes que nous avons développées ne tiennent compte que de la structure tertiaire et négligent les interactions de groupes chimiques spécifiques avec des éléments extra-moléculaires, comme d’autres macromolécules ou ligands. Dans un deuxième temps et pour tenir compte de ces interactions, nous avons développé un modèle qui tient compte de la position des groupes chimiques à la surface des structures tertiaires. L’hypothèse étant que les groupes chimiques à des positions conservées dans des séquences prédéterminées actives, qui sont déplacés dans des séquences inactives pour une fonction précise, ont de plus grandes chances d’être impliqués dans des interactions avec des facteurs. En poursuivant avec l’exemple de la boucle E, nous avons cherché les groupes de cette boucle qui pourraient être impliqués dans des interactions avec des facteurs d'élongation. Une fois les groupes identifiés, on peut prédire par modélisation tridimensionnelle les séquences qui positionnent correctement ces groupes dans leurs structures tertiaires. Il existe quelques modèles pour adresser ce problème, telles que des descripteurs de molécules, des matrices d’adjacences de nucléotides et ceux basé sur la thermodynamique. Cependant, tous ces modèles utilisent une représentation trop simplifiée de la structure d’ARN, ce qui limite leur applicabilité. Nous avons appliqué notre modèle sur les structures tertiaires d’un ensemble de variants d’une séquence d’une instance du Sarcin-Ricin d’un ribosome bactérien. L’équipe de Wool à l’université de Chicago a déjà étudié cette instance expérimentalement en testant la viabilité de 12 variants. Ils ont déterminé 4 variants viables et 8 létaux. Nous avons utilisé cet ensemble de 12 séquences pour l’entraînement de notre modèle et nous avons déterminé un ensemble de propriétés essentielles à leur fonction biologique. Pour chaque variant de l’ensemble d’entraînement nous avons construit des modèles de structures tertiaires. Nous avons ensuite mesuré les charges partielles des atomes exposés sur la surface et encodé cette information dans des vecteurs. Nous avons utilisé l’analyse des composantes principales pour transformer les vecteurs en un ensemble de variables non corrélées, qu’on appelle les composantes principales. En utilisant la distance Euclidienne pondérée et l’algorithme du plus proche voisin, nous avons appliqué la technique du « Leave-One-Out Cross-Validation » pour choisir les meilleurs paramètres pour prédire l’activité d’une nouvelle séquence en la faisant correspondre à ces composantes principales. Finalement, nous avons confirmé le pouvoir prédictif du modèle à l’aide d’un nouvel ensemble de 8 variants dont la viabilité à été vérifiée expérimentalement dans notre laboratoire. En conclusion, les grammaires de graphes permettent de modéliser la relation entre la séquence et la structure d’un élément structural d’ARN, comme la boucle E contenant le motif Sarcin-Ricin du ribosome. Les applications vont de la correction à l’aide à l'alignement de séquences jusqu’au design de séquences ayant une structure prédéterminée. Nous avons également développé un modèle pour tenir compte des interactions spécifiques liées à une fonction biologique donnée, soit avec des facteurs environnants. Notre modèle est basé sur la conservation de l'exposition des groupes chimiques qui sont impliqués dans ces interactions. Ce modèle nous a permis de prédire l’activité biologique d’un ensemble de variants de la boucle E du ribosome qui se lie à des facteurs d'élongation.

Quality care outcomes following transitional care interventions for older people from hospital to home: a systematic review

 Background
Provision of high quality transitional care is a challenge for health care providers in many western countries. This systematic review was conducted to (1) identify and synthesise research, using randomised control trial designs, on the quality of transitional care interventions compared with standard hospital discharge for older people with chronic illnesses, and (2) make recommendations for research and practice.

Methods
Eight databases were searched; CINAHL, Psychinfo, Medline, Proquest, Academic Search Complete, Masterfile Premier, SocIndex, Humanities and Social Sciences Collection, in addition to the Cochrane Collaboration, Joanna Briggs Institute and Google Scholar. Results were screened to identify peer reviewed journal articles reporting analysis of quality indicator outcomes in relation to a transitional care intervention involving discharge care in hospital and follow-up support in the home. Studies were limited to those published between January 1990 and May 2013. Study participants included people 60 years of age or older living in their own homes who were undergoing care transitions from hospital to home. Data relating to study characteristics and research findings were extracted from the included articles. Two reviewers independently assessed studies for risk of bias.

Results
Twelve articles met the inclusion criteria. Transitional care interventions reported in most studies reduced re-hospitalizations, with the exception of general practitioner and primary care nurse models. All 12 studies included outcome measures of re-hospitalization and length of stay indicating a quality focus on effectiveness, efficiency, and safety/risk. Patient satisfaction was assessed in six of the 12 studies and was mostly found to be high. Other outcomes reflecting person and family centred care were limited including those pertaining to the patient and carer experience, carer burden and support, and emotional support for older people and their carers. Limited outcome measures were reported reflecting timeliness, equity, efficiencies for community providers, and symptom management.

Conclusions
Gaps in the evidence base were apparent in the quality domains of timeliness, equity, efficiencies for community providers, effectiveness/symptom management, and domains of person and family centred care. Further research that involves the person and their family/caregiver in transitional care interventions is needed.

Quality of life (QoL) in relation to disease severity in Brazilian Parkinson's patients as measured using the WHOQOL-BREF

This study aimed at evaluating and describing the QoL and its association with the severity of disease among Brazilian Parkinson's disease (PD) patients. In this cross-sectional study 68 PD patients were interviewed using the World Health Organization Quality of Life instrument Short Form (WHOQOL-BREF) and the Hoehn-Yahr (HY) scale. Analysis of variance, chi(2), Kruskal-Wallis and Mann-Whitney U-tests, Spearman and Cronbach reliability coefficients were used to analyze the data. The results indicate: (1) physical capacity was the domain that showed the most deterioration; (2) severity of PD is associated with QoL measured by WHOQOL-BREF; (3) overall QoL, working capacity, activities of daily living (ADL) and self-esteem are affected in both transitional periods in the progression of PD (mild to moderate and moderate to advanced). Satisfaction with general health, pain, energy, positive feelings, personal relationship and satisfaction with home are affected in the first period of transition while mobility, body image, sexual activity and access to information are affected in the second. This study mainly shows specific facets that are affected depending on the specific periods of PD progression, which can help to understand the impact of the disease, the effectiveness of care, and the demand for health care resources. (C) 2007 Elsevier B.V. All rights reserved.

Complex sochastic boolean systems : new properties of the intrinsic order graph

[EN]A complex stochastic Boolean system (CSBS) is a system depending on an arbitrary number n of stochastic Boolean variables. The analysis of CSBSs is mainly based on the intrinsic order: a partial order relation defined on the set f0; 1gn of binary n-tuples. The usual graphical representation for a CSBS is the intrinsic order graph: the Hasse diagram of the intrinsic order. In this paper, some new properties of the intrinsic order graph are studied. Particularly, the set and the number of its edges, the degree and neighbors of each vertex, as well as typical properties, such as the symmetry and fractal structure of this graph, are analyzed…

Cyclic automorphic graph decompositions

Chapter 1 introduces the tools and mechanics necessary for this report. Basic definitions and topics of graph theory which pertain to the report and discussion of automorphic decompositions will be covered in brief detail. An automorphic decomposition D of a graph H by a graph G is a G-decomposition of H such that the intersection of graph (D) @H. H is called the automorhpic host, and G is the automorphic divisor. We seek to find classes of graphs that are automorphic divisors, specifically ones generated cyclically. Chapter 2 discusses the previous work done mainly by Beeler. It also discusses and gives in more detail examples of automorphic decompositions of graphs. Chapter 2 also discusses labelings and their direct relation to cyclic automorphic decompositions. We show basic classes of graphs, such as cycles, that are known to have certain labelings, and show that they also are automorphic divisors. In Chapter 3, we are concerned with 2-regular graphs, in particular rCm, r copies of the m-cycle. We seek to show that rCm has a ρ-labeling, and thus is an automorphic divisor for all r and m. we discuss methods including Skolem type difference sets to create cycle systems and their correlation to automorphic decompositions. In the Appendix, we give classes of graphs known to be graceful and our java code to generate ρ-labelings on rCm.

Architecture of a Bench-Type Carbonate Lake Margin and Its Relation to Fluvially Dominated Deltas, Las Minas Basin, Upper Miocene, Spain

The Upper Miocene stratigraphic succession of the Las Minas Basin, located at the external zone of the Betic Chain in SE Spain, preserves several examples of lake carbonate bench deposits. Excellent exposures of the carbonate benches allow detailed observation of the architecture of these sediments and provide new insights for the ‘‘steep-gradient bench margin–low energy’’ model proposed by Platt and Wright (1991). The lake carbonate benches developed in close association with fluvially dominated shallow deltas that exhibit typical Gilbert-type profiles. The delta sequences comprise bottomset prodelta marl facies, distal to proximal foreset facies, deposited mainly in a delta-front environment, and topset facies, the latter reflecting both subaqueous delta-front and subaerial delta-plain environments. The development of the carbonate benches was constrained by the convexupward morphology of the deltaic deposits, which led to the available accommodation space for the growth of the steep-gradient platforms. The benches display a progradational pattern characterized by sigmoid-oblique internal geometries and offlap upper boundary relationships, which suggests that the carbonate benches developed under slow though continuous lake-level rise. Both the dimensions of the benches and the dominant carbonate components (i.e., encrusted charophyte stems and calcified cyanobaterial remains), allow comparisons with the progradational marl benches recognized in modern temperate hardwater lakes. Accordingly, the case study presented here provides a good ancient sedimentary analog for low-energy lake carbonate benches. Moreover, the evolutionary trend inferred from the fossil example offers new insights into the depositional conditions of this type of sediment and allows recognition of the transitional pattern from bench to ramp carbonate lake margins.

The Firefighters' Pension Scheme (Transitional and Consequential Provisions) Regulations (Northern Ireland) 2016 (PDF 115KB)

Consultation Response Report From 24 November 2015 until 14 December 2015 the Department ran a targeted consultation in relation to the HMT requirement to introduce modifications to primary legislation as a result of the introduction of the Firefighters’ Pension Scheme (2015) from 1 April 2015.