Information diffusion in distributed OSN: The impact of trusted relationships

Distributed Online Social Networks (DOSN) are a valid alternative to OSN based on peer-to-peer communications. Without centralised data management, DOSN must provide the users with higher level of control over their personal information and privacy. Thus, users may wish to restrict their personal network to a limited set of peers, depending on the level of trust with them. This means that the effective social network (used for information exchange) may be a subset of the complete social network, and may present different structural patterns, which could limit information diffusion. In this paper, we estimate the capability of DOSN to diffuse content based on trust between social peers. To have a realistic representation of a OSN friendship graph, we consider a large-scale Facebook network, from which we estimate the trust level between friends. Then, we consider only social links above a certain threshold of trust, and we analyse the potential capability of the resulting graph to spread information through several structural indices. We test four possible thresholds, coinciding with the definition of personal social circles derived from sociology and anthropology. The results show that limiting the network to “active social contacts” leads to a graph with high network connectivity, where the nodes are still well-connected to each other, thus information can potentially cover a large number of nodes with respect to the original graph. On the other hand, the coverage drops for more restrictive assumptions. Nevertheless the re-insertion of a single excluded friend for each user is sufficient to obtain good coverage (i.e., always higher than 40 %) even in the most restricted graphs. We also analyse the potential capability of the network to spread information (i.e., network spreadability), studying the properties of the social paths between any pairs of users in the graph, which represent the effective channels traversed by information. The value of contact frequency between pairs of users determines a decay of trust along the path (the higher the contact frequency the lower the decay), and a consequent decay in the level of trustworthiness of information traversing the path. We show that selecting the link to re-insert in the network with probability proportional to its level of trust is the best re-insertion strategy, as it leads to the best connectivity/spreadability combination.     

An EM approach to mineral analysis using natural gamma rays

We describe here a method for the analysis of materials on a conveyor belt using the natural gamma spectra collected with a BGO (Bismuth Germanate) gamma ray detector. This detector collects gamma ray emissions from the Potassium (K), Uranium (U), and Thorium (Th) atoms in the materials. Based on these data, and using a Poisson model for the data generation, a statistical model is proposed and an approximate maximum likelihood (ML) technique based on the expectation-maximization (EM) algorithm is then used to estimate the amount of each of the three elements in the material. The statistical model is further refined to incorporate parameters of drift in the detector and an estimation technique for this is developed and tested against real data. The Cramér–Rao lower bounds for the estimators are calculated.     

Shaping stable periodic motions of inertia wheel pendulum: theory and experiment

We consider an underactuated two‐link robot called the inertia wheel pendulum. The system consists of a free planar rotational pendulum and a symmetric disk attached to its end, which is directly controlled by a DC‐motor. The goal is to create stable oscillations of the pendulum, which is not directly actuated. We exploit a recently proposed feedback‐control design strategy based on motion planning via virtual holonomic constraints. This strategy is shown to be useful for design of regulators for achieving orbitally exponentially stable oscillatory motions. The main contribution is a step‐by‐step procedure on how to achieve oscillations with pre‐specified amplitude from a given range and an arbitrary independently chosen period. The theoretical results are verified via experiments with a real hardware setup. Copyright © 2009 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Questionnaire-based variability modeling for system configuration

Variability management is a recurrent issue in systems engineering. It arises for example in enterprise systems, where modules are configured and composed to meet the requirements of individual customers based on modifications to a reference model. It also manifests itself in the context of software product families, where variants of a system are built from a common code base. This paper proposes an approach to capture system variability based on questionnaire models that include order dependencies and domain constraints. The paper presents analysis techniques to detect circular dependencies and contradictory constraints in questionnaire models, as well as techniques to incrementally prevent invalid configurations by restricting the space of allowed answers to a question based on previous answers. The approach has been implemented as a toolset and has been used in practice to capture configurable process models for film post-production.

A comparison between wet and cryogenic drilling of CFRP/Ti stacks

This paper compares conventional and cryogenic cooling in the deep hole drilling of carbon fiber reinforced polymer (CFRP)/Ti stacks. Various parameters are taken into account to find if the use of cryogenic coolant is justified by the improvement of the final results. Both the thrust and the torque were acquired continuously during the machining operations and compared both in average and distribution. The use of a cryogenic coolant brings a reduction in thrust force and torque without any sensible drawback. Overall the results prove that cryogenic drilling is a suitable technology for CFRP/Ti stack drill.     

Halitosis and Helicobacter pylori: a possible relationship

With the aim of investigating a possible relationship between "objective" halitosis (established by sulfide levels in the breath) and Helicobacter pylori, we performed a study in 58 dyspeptic patients reported to suffer from "bad breath." Furthermore, we evaluated the effects on halitosis of eradication therapy (only for H. pylori-positive patients) and chlorhexidine antiseptic mouth rinses (in all patients). Sulfide compound assay indicated objective halitosis in 52/58 patients, 30 of whom were positive and 22 negative for H. pylori. In 19/30 eradication by double therapy provoked a decrease to below the cutoff value of sulfide levels in 15. In the other 11 of the 30 subjects, in whom H. pylori positivity persisted, halitosis parameters did not change. Chlorexidine reduced sulfides to below the cutoff value in 16/22 H. pylori-negative patients, but did not provoke any change in the 11 unsuccessfully treated H. pylori-positive subjects. In these, objective halitosis disappeared only after a successful eradication by triple therapy (9/11). Our results show a possible association between halitosis and H. pylori since bacterial eradication may resolve the symptom. Antiseptic mouthwashes may be effective only in absence of H. pylori, when halitosis may be due to oral putrefactive microbial activity. In a small number of subjects the cause and treatment of halitosis need to be clarified.     

Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis

This paper presents a heuristic algorithm for solving a job-shop scheduling problem with sequence dependent setup times and min/max separation constraints among the activities (SDST-JSSP/max). The algorithm relies on a core constraint-based search procedure, which generates consistent orderings of activities that require the same resource by incrementally imposing precedence constraints on a temporally feasible solution. Key to the effectiveness of the search procedure is a conflict sampling method biased toward selection of most critical conflicts and coupled with a non-deterministic choice heuristic to guide the base conflict resolution process. This constraint-based search is then embedded within a larger iterative-sampling search framework to broaden search space coverage and promote solution optimization. The efficacy of the overall heuristic algorithm is demonstrated empirically both on a set of previously studied job-shop scheduling benchmark problems with sequence dependent setup times and by introducing a new benchmark with setups and generalized precedence constraints.     

Preserving correctness during business process model configuration

A configurable process model captures a family of related process models in a single artifact. Such models are intended to be configured to fit the requirements of specific organizations or projects, leading to individualized process models that are subsequently used for domain analysis or solution design. This article proposes a formal foundation for individualizing configurable process models incrementally, while preserving correctness, both with respect to syntax and behavioral semantics. Specifically, assuming the configurable process model is behaviorally sound, the individualized process models are guaranteed to be sound. The theory is first developed in the context of Petri nets and then extended to a process modeling notation widely used in practice, namely Event-driven Process Chains.     

APROMORE: An advanced process model repository

Business process models are becoming available in large numbers due to their widespread use in many industrial applications such as enterprise and quality engineering projects. On the one hand, this raises a challenge as to their proper management: how can it be ensured that the proper process model is always available to the interested stakeholder? On the other hand, the richness of a large set of process models also offers opportunities, for example with respect to the re-use of existing model parts for new models. This paper describes the functionality and architecture of an advanced process model repository, named APROMORE. This tool brings together a rich set of features for the analysis, management and usage of large sets of process models, drawing from state-of-the art research in the field of process modeling. A prototype of the platform is presented in this paper, demonstrating its feasibility, as well as an outlook on the further development of APROMORE.     

Configurable multi-perspective business process models

A configurable process model provides a consolidated view of a family of business processes. It promotes the reuse of proven practices by providing analysts with a generic modeling artifact from which to derive individual process models. Unfortunately, the scope of existing notations for configurable process modeling is restricted, thus hindering their applicability. Specifically, these notations focus on capturing tasks and control-flow dependencies, neglecting equally important ingredients of business processes such as data and resources. This research fills this gap by proposing a configurable process modeling notation incorporating features for capturing resources, data and physical objects involved in the performance of tasks. The proposal has been implemented in a toolset that assists analysts during the configuration phase and guarantees the correctness of the resulting process models. The approach has been validated by means of a case study from the film industry.