A semi-supervised graph-based algorithm for detecting outliers in online-social-networks

In this paper, we propose a semi-supervised approach of anomaly detection in Online Social Networks. The social network is modeled as a graph and its features are extracted to detect anomaly. A clustering algorithm is then used to group users based on these features and fuzzy logic is applied to assign degree of anomalous behavior to the users of these clusters. Empirical analysis shows effectiveness of this method.

A people-to-people matching system using graph mining techniques

A people-to-people matching system (or a match-making system) refers to a system in which users join with the objective of meeting other users with the common need. Some real-world examples of these systems are employer-employee (in job search networks), mentor-student (in university social networks), consume-to-consumer (in marketplaces) and male-female (in an online dating network). The network underlying in these systems consists of two groups of users, and the relationships between users need to be captured for developing an efficient match-making system. Most of the existing studies utilize information either about each of the users in isolation or their interaction separately, and develop recommender systems using the one form of information only. It is imperative to understand the linkages among the users in the network and use them in developing a match-making system. This study utilizes several social network analysis methods such as graph theory, small world phenomenon, centrality analysis, density analysis to gain insight into the entities and their relationships present in this network. This paper also proposes a new type of graph called “attributed bipartite graph”. By using these analyses and the proposed type of graph, an efficient hybrid recommender system is developed which generates recommendation for new users as well as shows improvement in accuracy over the baseline methods.

Comparison between electrically-evoked and voluntary wrist movements on sensorimotor and prefrontal cortical activation : A multi-channel time domain fNIRS study

Neuromuscular electrical stimulation (NMES) has been consistently demonstrated to improve skeletal muscle function in neurological populations with movement disorders, such as poststroke and incomplete spinal cord injury (Vanderthommen and Duchateau, 2007). Recent research has documented that rapid, supraspinal central nervous system reorganisation/neuroplastic mechanisms are also implicated during NMES (Chipchase et al., 2011). Functional neuroimaging studies have shown NMES to activate a network of sub-cortical and cortical brain regions, including the sensorimotor (SMC) and prefrontal (PFC) cortex (Blickenstorfer et al., 2009; Han et al., 2003; Muthalib et al., 2012). A relationship between increase in SMC activation with increasing NMES current intensity up to motor threshold has been previously reported using functional MRI (Smith et al., 2003). However, since clinical neurorehabilitation programmes commonly utilise NMES current intensities above the motor threshold and up to the maximum tolerated current intensity (MTI), limited research has determined the cortical correlates of increasing NMES current intensity at or above MTI (Muthalib et al., 2012). In our previous study (Muthalib et al., 2012), we assessed contralateral PFC activation using 1-channel functional near infrared spectroscopy (fNIRS) during NMES of the elbow flexors by increasing current intensity from motor threshold to greater than MTI and showed a linear relationship between NMES current intensity and the level of PFC activation. However, the relationship between NMES current intensity and activation of the motor cortical network, including SMC and PFC, has not been clarified. Moreover, it is of scientific and clinical relevance to know how NMES affects the central nervous system, especially in comparison to voluntary (VOL) muscle activation. Therefore, the aim of this study was to utilise multi-channel time domain fNIRS to compare SMC and PFC activation between VOL and NMESevoked wrist extension movements.

Sensorimotor and postural control factors associated with driving safety in a community-dwelling older driver population

Background. To establish whether sensorimotor function and balance are associated with on-road driving performance in older adults. Methods. The performance of 270 community-living adults aged 70–88 years recruited via the electoral roll was measured on a battery of peripheral sensation, strength, flexibility, reaction time, and balance tests and on a standardized measure of on-road driving performance. Results. Forty-seven participants (17.4%) were classified as unsafe based on their driving assessment. Unsafe driving was associated with reduced peripheral sensation, lower limb weakness, reduced neck range of motion, slow reaction time, and poor balance in univariate analyses. Multivariate logistic regression analysis identified poor vibration sensitivity, reduced quadriceps strength, and increased sway on a foam surface with eyes closed as significant and independent risk factors for unsafe driving. These variables classified participants into safe and unsafe drivers with a sensitivity of 74% and specificity of 70%. Conclusions. A number of sensorimotor and balance measures were associated with driver safety and the multivariate model comprising measures of sensation, strength, and balance was highly predictive of unsafe driving in this sample. These findings highlight important determinants of driver safety and may assist in developing efficacious driver safety strategies for older drivers.

Graph coloring applied to secure computation in non-Abelian groups

We study the natural problem of secure n-party computation (in the computationally unbounded attack model) of circuits over an arbitrary finite non-Abelian group (G,⋅), which we call G-circuits. Besides its intrinsic interest, this problem is also motivating by a completeness result of Barrington, stating that such protocols can be applied for general secure computation of arbitrary functions. For flexibility, we are interested in protocols which only require black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our investigations focus on the passive adversarial model, where up to t of the n participating parties are corrupted.

Decomposition construction for secret sharing schemes with graph access structures in polynomial time

The purpose of this paper is to describe a new decomposition construction for perfect secret sharing schemes with graph access structures. The previous decomposition construction proposed by Stinson is a recursive method that uses small secret sharing schemes as building blocks in the construction of larger schemes. When the Stinson method is applied to the graph access structures, the number of such “small” schemes is typically exponential in the number of the participants, resulting in an exponential algorithm. Our method has the same flavor as the Stinson decomposition construction; however, the linear programming problem involved in the construction is formulated in such a way that the number of “small” schemes is polynomial in the size of the participants, which in turn gives rise to a polynomial time construction. We also show that if we apply the Stinson construction to the “small” schemes arising from our new construction, both have the same information rate.

Flexible process graph : a prologue

Businesses document their operational processes as process models. The common practice is to represent process models as directed graphs. The nodes of a process graph represent activities and directed edges constitute activity ordering constraints. A flexible process graph modeling approach proposes to generalize process graph structure to a hypergraph. Obtained process structure aims at formalization of ad-hoc process control flow. In this paper we discuss aspects relevant to concurrent execution of process activities in a collaborative manner organized as a flexible process graph. We provide a real world flexible process scenario to illustrate the approach.

Developing grounded representations for robots through the principles of sensorimotor coordination

Robots currently recognise and use objects through algorithms that are hand-coded or specifically trained. Such robots can operate in known, structured environments but cannot learn to recognise or use novel objects as they appear. This thesis demonstrates that a robot can develop meaningful object representations by learning the fundamental relationship between action and change in sensory state; the robot learns sensorimotor coordination. Methods based on Markov Decision Processes are experimentally validated on a mobile robot capable of gripping objects, and it is found that object recognition and manipulation can be learnt as an emergent property of sensorimotor coordination.

Graph theory based representation of building information models for access control applications

Building information models are increasingly being utilised for facility management of large facilities such as critical infrastructures. In such environments, it is valuable to utilise the vast amount of data contained within the building information models to improve access control administration. The use of building information models in access control scenarios can provide 3D visualisation of buildings as well as many other advantages such as automation of essential tasks including path finding, consistency detection, and accessibility verification. However, there is no mathematical model for building information models that can be used to describe and compute these functions. In this paper, we show how graph theory can be utilised as a representation language of building information models and the proposed security related functions. This graph-theoretic representation allows for mathematically representing building information models and performing computations using these functions.

Primary and secondary neural networks of auditory prepulse inhibition: a functional magnetic resonance imaging study of sensorimotor gating of the human acoustic startle response

Feedforward inhibition deficits have been consistently demonstrated in a range of neuropsychiatric conditions using prepulse inhibition (PPI) of the acoustic startle eye-blink reflex when assessing sensorimotor gating. While PPI can be recorded in acutely decerebrated rats, behavioural, pharmacological and psychophysiological studies suggest the involvement of a complex neural network extending from brainstem nuclei to higher order cortical areas. The current functional magnetic resonance imaging study investigated the neural network underlying PPI and its association with electromyographically (EMG) recorded PPI of the acoustic startle eye-blink reflex in 16 healthy volunteers. A sparse imaging design was employed to model signal changes in blood oxygenation level-dependent (BOLD) responses to acoustic startle probes that were preceded by a prepulse at 120 ms or 480 ms stimulus onset asynchrony or without prepulse. Sensorimotor gating was EMG confirmed for the 120-ms prepulse condition, while startle responses in the 480-ms prepulse condition did not differ from startle alone. Multiple regression analysis of BOLD contrasts identified activation in pons, thalamus, caudate nuclei, left angular gyrus and bilaterally in anterior cingulate, associated with EMGrecorded sensorimotor gating. Planned contrasts confirmed increased pons activation for startle alone vs 120-ms prepulse condition, while increased anterior superior frontal gyrus activation was confirmed for the reverse contrast. Our findings are consistent with a primary pontine circuitry of sensorimotor gating that interconnects with inferior parietal, superior temporal, frontal and prefrontal cortices via thalamus and striatum. PPI processes in the prefrontal, frontal and superior temporal cortex were functionally distinct from sensorimotor gating.

A subexponential construction of graph coloring for multiparty computation

We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any tgraphs. More specifically, following the result of Desmedt et al. (2012) that the problem of MPC over non-Abelian groups can be reduced to finding a t-reliable n-coloring of planar graphs, we show the construction of such a graph which allows a path from the input nodes to the output nodes when any t-party subset is in the possession of the adversary. Unlike the deterministic constructions from Desmedt et al. (2012) our construction has subexponential complexity and is optimal at the same time, i.e., it is secure for any t

Test-retest reliability of graph theory measures of structural brain connectivity

The human connectome has recently become a popular research topic in neuroscience, and many new algorithms have been applied to analyze brain networks. In particular, network topology measures from graph theory have been adapted to analyze network efficiency and 'small-world' properties. While there has been a surge in the number of papers examining connectivity through graph theory, questions remain about its test-retest reliability (TRT). In particular, the reproducibility of structural connectivity measures has not been assessed. We examined the TRT of global connectivity measures generated from graph theory analyses of 17 young adults who underwent two high-angular resolution diffusion (HARDI) scans approximately 3 months apart. Of the measures assessed, modularity had the highest TRT, and it was stable across a range of sparsities (a thresholding parameter used to define which network edges are retained). These reliability measures underline the need to develop network descriptors that are robust to acquisition parameters.

New graph-based algorithms to efficiently solve large scale open pit mining optimisation problems

In the mining optimisation literature, most researchers focused on two strategic-level and tactical-level open-pit mine optimisation problems, which are respectively termed ultimate pit limit (UPIT) or constrained pit limit (CPIT). However, many researchers indicate that the substantial numbers of variables and constraints in real-world instances (e.g., with 50-1000 thousand blocks) make the CPIT’s mixed integer programming (MIP) model intractable for use. Thus, it becomes a considerable challenge to solve the large scale CPIT instances without relying on exact MIP optimiser as well as the complicated MIP relaxation/decomposition methods. To take this challenge, two new graph-based algorithms based on network flow graph and conjunctive graph theory are developed by taking advantage of problem properties. The performance of our proposed algorithms is validated by testing recent large scale benchmark UPIT and CPIT instances’ datasets of MineLib in 2013. In comparison to best known results from MineLib, it is shown that the proposed algorithms outperform other CPIT solution approaches existing in the literature. The proposed graph-based algorithms leads to a more competent mine scheduling optimisation expert system because the third-party MIP optimiser is no longer indispensable and random neighbourhood search is not necessary.

Automated topometric graph generation from floor plan analysis

The world is rich with information such as signage and maps to assist humans to navigate. We present a method to extract topological spatial information from a generic bitmap floor plan and build a topometric graph that can be used by a mobile robot for tasks such as path planning and guided exploration. The algorithm first detects and extracts text in an image of the floor plan. Using the locations of the extracted text, flood fill is used to find the rooms and hallways. Doors are found by matching SURF features and these form the connections between rooms, which are the edges of the topological graph. Our system is able to automatically detect doors and differentiate between hallways and rooms, which is important for effective navigation. We show that our method can extract a topometric graph from a floor plan and is robust against ambiguous cases most commonly seen in floor plans including elevators and stairwells.

Effects of the sensorimotor training volume on sensorimotor function in patients following lower limb arthroplasty

Background Sensorimotor function is degraded in patients after lower limb arthroplasty. Sensorimotor training is thought to improve sensorimotor skills, however, the optimal training stimulus with regard to volume, frequency, duration, and intensity is still unknown. The aim of this study, therefore, was to firstly quantify the progression of sensorimotor function after total hip (THA) or knee (TKA) arthroplasty and, as second step, to evaluate effects of different sensorimotor training volumes. Methods 58 in-patients during their rehabilitation after THA or TKA participated in this prospective cohort study. Sensorimotor function was assessed using a test battery including measures of stabilization capacity, static balance, proprioception, and gait, along with a self-reported pain and function. All participants were randomly assigned to one of three intervention groups performing sensorimotor training two, four, or six times per week. Outcome measures were taken at three instances, at baseline (pre), after 1.5 weeks (mid) and at the conclusion of the 3 week program (post). Results All measurements showed significant improvements over time, with the exception of proprioception and static balance during quiet bipedal stance which showed no significant main effects for time or intervention. There was no significant effect of sensorimotor training volume on any of the outcome measures. Conclusion We were able to quantify improvements in measures of dynamic, but not static, sensorimotor function during the initial three weeks of rehabilitation following TKA/THA. Although sensorimotor improvements were independent of the training volume applied in the current study, long-term effects of sensorimotor training volume need to be investigated to optimize training stimulus recommendations.