A Systematic Review on Privacy-Aware IoT Personal Data Stores.

Data from the Internet of Things (IoT) enables the design of new business models and services that improve user experience and satisfaction. These data serve as important information sources for many domains, including disaster management, biosurveillance, smart cities, and smart health, among others. However, this scenario involves the collection of personal data, raising new challenges related to data privacy protection. Therefore, we aim to provide state-of-the-art information regarding privacy issues in the context of IoT, with a particular focus on findings that utilize the Personal Data Store (PDS) as a viable solution for these concerns. To achieve this, we conduct a systematic mapping review to identify, evaluate, and interpret the relevant literature on privacy issues and PDS-based solutions in the IoT context. Our analysis is guided by three well-defined research questions, and we systematically selected 49 studies published until 2023 from an initial pool of 176 papers. We analyze and discuss the most common privacy issues highlighted by the authors and position the role of PDS technologies as a solution to privacy issues in the IoT context. As a result, our findings reveal that only a small number of works (approximately 20%) were dedicated to presenting solutions for privacy issues. Most works (almost 82%) were published between 2018 and 2023, demonstrating an increased interest in the theme in recent years. Additionally, only two works used PDS-based solutions to deal with privacy issues in the IoT context.

A new fault feature extraction method of rolling bearings based on the improved self-selection ICEEMDAN-permutation entropy.

The vibration signals of rolling bearings are complex and changeable, and extracting meaningful features is difficult. Currently, the commonly used empirical mode decomposition (EMD) algorithms have the problem of mode aliasing. In this paper, a new feature extraction method based on the improved complete ensemble empirical mode decomposition with adapted noise (ICEEMDAN) and permutation entropy is proposed. In this method, the ICEEMDAN algorithm is first improved and optimized to enable a self-selection function The vibration signal is then decomposed into several intrinsic modal functions using this algorithm, and the permutation entropy is extracted as the fault feature of rolling bearings, which improves the accuracy of fault classification and realizes the intelligent feature extraction of different fault states. Then, the Case Western Reserve University dataset is used for verification, and the results show that this scheme can effectively separate the vibration signal characteristics of bearings in different states, and can be used to characterize the characteristics of different bearing signals. Finally, based on the mechanical transmission system bearing experimental platform independently developed by our school, the experimental results show that compared with the unimproved ICEEMDAN algorithm, the diagnostic accuracy rate of the proposed method is 99.5%, which is increased by 6.4%, and it can be effectively used for feature extraction of rolling bearings.

Observer-based H∞ fuzzy fault-tolerant switching control for ship course tracking with steering machine fault detection.

To enhance the robustness of ship autopilot (SA) system with nonlinear dynamics, unmeasured states, and unknown steering machine fault, an observer-based H∞ fuzzy fault-tolerant switching control for ship course tracking is proposed. Firstly, a global Takagi-Sugeno (T-S) fuzzy nonlinear ship autopilot (NSA) is developed with full consideration of ship steering characteristics. And the actual navigation data collected from a real ship are used to verify the reasonableness and feasibility of NSA model. Then, virtual fuzzy observers (VFOs) for both fault-free and faulty systems are proposed to estimate the unmeasured states and unknown fault simultaneously, and compensate for the faulty system by using the fault estimates. Accordingly, the VFO-based H∞ robust controller (VFO-HRC) and fault-tolerant controller (VFO-HFTC) are designed. Subsequently, a smoothed Z-score-based fault detection and alarm (FDA) is developed to provide switching signals for which the controller and its corresponding observer should be invoked. Finally, simulation results on the "Yulong" ship demonstrate the effectiveness of the developed control method.

Visual Exploration of Financial Data with Incremental Domain Knowledge.

Modelling the dynamics of a growing financial environment is a complex task that requires domain knowledge, expertise and access to heterogeneous information types. Such information can stem from several sources at different scales, complicating the task of forming a holistic impression of the financial landscape, especially in terms of the economical relationships between firms. Bringing this scattered information into a common context is, therefore, an essential step in the process of obtaining meaningful insights about the state of an economy. In this paper, we present Sabrina 2.0, a Visual Analytics (VA) approach for exploring financial data across different scales, from individual firms up to nation-wide aggregate data. Our solution is coupled with a pipeline for the generation of firm-to-firm financial transaction networks, fusing information about individual firms with sector-to-sector transaction data and domain knowledge on macroscopic aspects of the economy. Each network can be created to have multiple instances to compare different scenarios. We collaborated with experts from finance and economy during the development of our VA solution, and evaluated our approach with seven domain experts across industry and academia through a qualitative insight-based evaluation. The analysis shows how Sabrina 2.0 enables the generation of insights, and how the incorporation of transaction models assists users in their exploration of a national economy.

On modeling context-aware social collaboration processes.

Modeling collaboration processes is a challenging task. Existing modeling approaches are not capable of expressing the unpredictable, non-routine nature of human collaboration, which is influenced by the social context of involved collaborators. We propose a modeling approach which considers collaboration processes as the evolution of a network of collaborative documents along with a social network of collaborators. Our modeling approach, accompanied by a graphical notation and formalization, allows to capture the influence of complex social structures formed by collaborators, and therefore facilitates such activities as the discovery of socially coherent teams, social hubs, or unbiased experts. We demonstrate the applicability and expressiveness of our approach and notation, and discuss their strengths and weaknesses.

Enforcement of entailment constraints in distributed service-based business processes.

CONTEXT: A distributed business process is executed in a distributed computing environment. The service-oriented architecture (SOA) paradigm is a popular option for the integration of software services and execution of distributed business processes. Entailment constraints, such as mutual exclusion and binding constraints, are important means to control process execution. Mutually exclusive tasks result from the division of powerful rights and responsibilities to prevent fraud and abuse. In contrast, binding constraints define that a subject who performed one task must also perform the corresponding bound task(s). OBJECTIVE: We aim to provide a model-driven approach for the specification and enforcement of task-based entailment constraints in distributed service-based business processes. METHOD: Based on a generic metamodel, we define a domain-specific language (DSL) that maps the different modeling-level artifacts to the implementation-level. The DSL integrates elements from role-based access control (RBAC) with the tasks that are performed in a business process. Process definitions are annotated using the DSL, and our software platform uses automated model transformations to produce executable WS-BPEL specifications which enforce the entailment constraints. We evaluate the impact of constraint enforcement on runtime performance for five selected service-based processes from existing literature. RESULTS: Our evaluation demonstrates that the approach correctly enforces task-based entailment constraints at runtime. The performance experiments illustrate that the runtime enforcement operates with an overhead that scales well up to the order of several ten thousand logged invocations. Using our DSL annotations, the user-defined process definition remains declarative and clean of security enforcement code. CONCLUSION: Our approach decouples the concerns of (non-technical) domain experts from technical details of entailment constraint enforcement. The developed framework integrates seamlessly with WS-BPEL and the Web services technology stack. Our prototype implementation shows the feasibility of the approach, and the evaluation points to future work and further performance optimizations.

Interaction mining and skill-dependent recommendations for multi-objective team composition.

Web-based collaboration and virtual environments supported by various Web 2.0 concepts enable the application of numerous monitoring, mining and analysis tools to study human interactions and team formation processes. The composition of an effective team requires a balance between adequate skill fulfillment and sufficient team connectivity. The underlying interaction structure reflects social behavior and relations of individuals and determines to a large degree how well people can be expected to collaborate. In this paper we address an extended team formation problem that does not only require direct interactions to determine team connectivity but additionally uses implicit recommendations of collaboration partners to support even sparsely connected networks. We provide two heuristics based on Genetic Algorithms and Simulated Annealing for discovering efficient team configurations that yield the best trade-off between skill coverage and team connectivity. Our self-adjusting mechanism aims to discover the best combination of direct interactions and recommendations when deriving connectivity. We evaluate our approach based on multiple configurations of a simulated collaboration network that features close resemblance to real world expert networks. We demonstrate that our algorithm successfully identifies efficient team configurations even when removing up to 40% of experts from various social network configurations.