An order-clique-based approach for mining maximal co-locations

Most algorithms for mining spatial co-locations adopt an Apriori-like approach to generate size-k prevalence co-locations after size-(k − 1) prevalence co-locations. However, generating and storing the co-locations and table instances is costly. A novel order-clique-based approach for mining maximal co-locations is proposed in this paper. The efficiency of the approach is achieved by two techniques: (1) the spatial neighbor relationships and the size-2 prevalence co-locations are compressed into extended prefix-tree structures, which allows the order-clique-based approach to mine candidate maximal co-locations and co-location instances; and (2) the co-location instances do not need to be stored after computing some characteristics of the corresponding co-location, which significantly reduces the execution time and space required for mining maximal co-locations. The performance study shows that the new method is efficient for mining both long and short co-location patterns, and is faster than some other methods (in particular the join-based method and the join-less method).     

Fixed-point DSP implementation of nonlinear controller for large gap electromagnetic suspension system

Electromagnetic suspension systems are inherently nonlinear and often face hardware limitation when digitally controlled. The main contributions of this paper are: the design of a nonlinear H_∞ controller, including dynamic weighting functions, applied to a large gap electromagnetic suspension system and the presentation of a procedure to implement this controller on a fixed-point DSP, through a methodology able to translate a floating-point algorithm into a fixed-point algorithm by using l_∞ norm minimization due to conversion error. Experimental results are also presented, in which the performance of the nonlinear controller is evaluated specifically in the initial suspension phase.     

A modified version of the three-compartment model to predict fatigue during submaximal tasks with complex force-time histories

The three-compartment model (3CM) was validated previously for prediction of endurance times by modifying its fatigue and recovery rates. However, endurance times do not typically represent work demands, and it is unknown if the current version of the 3CM is applicable for ergonomics analysis of all occupational tasks. The purpose of this study was to add biological fidelity to the 3CM, and validate the model against a series of submaximal force plateaus. The fatigue and recovery rates were modified to represent graded physiological motor unit characteristics (termed 3CM_GMU). In nine experiments of submaximal efforts, the 3CM_GMU produced a root-mean squared difference (RMSD) of 4.1 ± 0.5% MVC over experiments with an average strength loss (i.e. fatigue) of 31.0 ± 1.1% MVC. The 3CM_GMU model performed poorly for endurance tasks. The 3CM_GMU model is an improvement for evaluating submaximal force patterns consisting of intermittent muscle contractions of the hand and forearm.

Practitioner Summary: We modified an existing fatigue model using known physiological properties in order to predict fatigue during nine different submaximal force profiles; consistent with efforts seen in industrial work. We expect this model to be included in digital human modelling software, for the assessment of repetitive work and muscle fatigue in repetitive tasks.

Social Media Summary: The proposed model has applications for estimating task fatigue in proactive ergonomic analyses of complex force patterns using digital human models.     

Co-design of H∞ jump observers for event-based measurements over networks

This work presents a strategy to minimise the network usage and the energy consumption of wireless battery-powered sensors in the observer problem over networks. The sensor nodes implement a periodic send-on-delta approach, sending new measurements when a measure deviates considerably from the previous sent one. The estimator node implements a jump observer whose gains are computed offline and depend on the combination of available new measurements. We bound the estimator performance as a function of the sending policies and then state the design procedure of the observer under fixed sending thresholds as a semidefinite programming problem. We address this problem first in a deterministic way and, to reduce conservativeness, in a stochastic one after obtaining bounds on the probabilities of having new measurements and applying robust optimisation problem over the possible probabilities using sum of squares decomposition. We relate the network usage with the sending thresholds and propose an iterative procedure for the design of those thresholds, minimising the network usage while guaranteeing a prescribed estimation performance. Simulation results and experimental analysis show the validity of the proposal and the reduction of network resources that can be achieved with the stochastic approach.     

A semantic approach to remove incoherent items from a user profile and improve the accuracy of a recommender system

Recommender systems usually suggest items by exploiting all the previous interactions of the users with a system (e.g., in order to decide the movies to recommend to a user, all the movies she previously purchased are considered). This canonical approach sometimes could lead to wrong results due to several factors, such as a change in user preferences over time, or the use of her account by third parties. This kind of incoherence in the user profiles defines a lower bound on the error the recommender systems may achieve when they generate suggestions for a user, an aspect known in literature as magic barrier. This paper proposes a novel dynamic coherence-based approach to define the user profile used in the recommendation process. The main aim is to identify and remove, from the previously evaluated items, those not semantically adherent to the others, in order to make a user profile as close as possible to the user’s real preferences, solving the aforementioned problems. Moreover, reshaping the user profile in such a way leads to great advantages in terms of computational complexity, since the number of items considered during the recommendation process is highly reduced. The performed experiments show the effectiveness of our approach to remove the incoherent items from a user profile, increasing the recommendation accuracy.     

Making random permutations from physically unclonable constants

The recent availability of reliable schemes for physically unclonable constants (PUC) opens interesting possibilities in the field of security. In this paper, we explore the possibility of using PUCs to embed in a chip random permutations to be used, for example, as building blocks in cryptographic constructions such as sponge functions, substitution–permutation networks, and so on. We show that the most difficult part is the generation of random integers using as the only randomness source the bit-string produced by the PUC. In order to solve the integer generation problem, we propose a partial rejection method that allows the designer to trade-off between entropy and efficiency. The results show that the proposed schemes can be implemented with reasonable complexity.     

A quick tour on suffix arrays and compressed suffix arrays

Suffix arrays are a key data structure for solving a run of problems on texts and sequences, from data compression and information retrieval to biological sequence analysis and pattern discovery. In their simplest version, they can just be seen as a permutation of the elements in {1,2,…,n}, encoding the sorted sequence of suffixes from a given text of length n, under the lexicographic order. Yet, they are on a par with ubiquitous and sophisticated suffix trees. Over the years, many interesting combinatorial properties have been devised for this special class of permutations: for instance, they can implicitly encode extra information, and they are a well characterized subset of the n! permutations. This paper gives a short tutorial on suffix arrays and their compressed version to explore and review some of their algorithmic features, discussing the space issues related to their usage in text indexing, combinatorial pattern matching, and data compression.     

ADL: An Activity Description Language for Real-Time Networks

This paper introduces and motivates ADL, a new formal notation for the specification of the temporal and functional behaviour of concurrent processes. ADL is tailored to be directly compatible with the DORIS design method. It combines a graphical Activity State-Machine (ASM) notation and a model-based Activity Functional Behaviour (AFB) notation. The abstract syntax, and static and dynamic semantics for the ASM notation are given, the dynamic semantics being given proof-theoretically in many-sorted logic extended with the RTL ‘occurrence’ relation, Θ, and the ERTL ‘holding’ relation, Φ. ADL is used to specify a small network, and proofs are given of its timeliness and safety properties. Received November 1998 / Accepted in revised form May 2000     

Who Are You? The Trade-Off between Information Utility and Privacy

There's no doubt that personal information can be valuable to companies. People are willing to give up information about themselves not because they're stupid or because they're being tricked by evil corporations, but because it can sometimes be in their best interests to do so. From this perspective, the important questions are how users can provide or limit access to that information, what benefits they might receive in exchange for a bit of information, and how they perceive the value of those benefits.     

Service Science

This paper is a first exploration of the relationship between service science and Grid computing. Service science is the study of value co-creation interactions among entities, known as service systems. Within the emerging service science community, service is often defined as the application of competences (resources) for the benefit of another. Grid computing is the study of resource sharing among entities, known as virtual organizations, which solve complex business, societal, scientific, and engineering problems. Within the Grid computing community, service is sometimes defined as protocols plus behavior. Both Grid computing and service science are connecting academic, industry, government, and volunteer sector collaborators on a range of projects including eScience, healthcare, environmental sustainability, and more. This paper compares and contrasts the notions of resource, entity, service, interaction, and success criteria for the two areas of study. In conclusion, new areas for collaborative inquiry are proposed.