Search results for "Graph theory"
showing 10 items of 784 documents
ORGANIZED LEARNING MODELS (PURSUER CONTROL OPTIMISATION)
1983
Abstract The concept of Organized Learning is defined, and some random models are presented. For Not Transferable Learning, it is necessary to start from an instantaneous learning; by a discrete way, we must form a stochastic model considering the probability of each path; with a continue aproximation, we can study the evolution of the internal state through to consider the relative and absolute probabilities, by means of differential equations systems. For Transferable Learning, the instantaneous learning give us directly the System evolution. So, the Algoritmes for the different models are compared.
Quantitative Analysis of Dynamic Association in Live Biological Fluorescent Samples
2014
Determining vesicle localization and association in live microscopy may be challenging due to non-simultaneous imaging of rapidly moving objects with two excitation channels. Besides errors due to movement of objects, imaging may also introduce shifting between the image channels, and traditional colocalization methods cannot handle such situations. Our approach to quantifying the association between tagged proteins is to use an object-based method where the exact match of object locations is not assumed. Point-pattern matching provides a measure of correspondence between two point-sets under various changes between the sets. Thus, it can be used for robust quantitative analysis of vesicle …
Topology of synaptic connectivity constrains neuronal stimulus representation, predicting two complementary coding strategies
2022
In motor-related brain regions, movement intention has been successfully decoded from in-vivo spike train by isolating a lower-dimension manifold that the high-dimensional spiking activity is constrained to. The mechanism enforcing this constraint remains unclear, although it has been hypothesized to be implemented by the connectivity of the sampled neurons. We test this idea and explore the interactions between local synaptic connectivity and its ability to encode information in a lower dimensional manifold through simulations of a detailed microcircuit model with realistic sources of noise. We confirm that even in isolation such a model can encode the identity of different stimuli in a lo…
Topology Inference and Signal Representation Using Dictionary Learning
2019
This paper presents a Joint Graph Learning and Signal Representation algorithm, called JGLSR, for simultaneous topology learning and graph signal representation via a learned over-complete dictionary. The proposed algorithm alternates between three main steps: sparse coding, dictionary learning, and graph topology inference. We introduce the “transformed graph” which can be considered as a projected graph in the transform domain spanned by the dictionary atoms. Simulation results via synthetic and real data show that the proposed approach has a higher performance when compared to the well-known algorithms for joint undirected graph topology inference and signal representation, when there is…
Path Planning for Perception-Driven Obstacle-Aided Snake Robot Locomotion
2020
Development of snake robots have been motivated by the ability of snakes to move efficiently in unstructured and cluttered environments. A snake robot has the potential to utilise obstacles for generating locomotion, in contrast to wheeled robots which are unable to move efficiently in rough terrain. In this paper, we propose a local path planning algorithm for snake robots based on obstacle-aided locomotion (OAL). An essential feature in OAL is to determine suitable push-points in the environment that the snake robot can use for locomotion. The proposed method is based on a set of criteria for evaluating a path, and is a novel contribution of this paper. We focus on local path planning and…
Asymmetries in path encoding in Sicilian: A diachronic overview
2017
This talk aims at describing the encoding of path within the system of spatial relations in Sicilian, an Italo-Romance language spoken in Sicily and its satellite islands. In general terms, spatial relations in Sicilian remain largely unexplored in the light of the current linguistic theories. As a consequence, the first point addressed in the proposed description is the comparison of Sicilian data with the cross-linguistic scenario. It is generally argued in the relevant literature that the encoding of path appears to be less autonomous compared to source, goal, and location at the cross-linguistic level, and its encoding is frequently based on location (see Stolz 1992). In Sicilian, the s…
A motion planning algorithm for the invalid initial state disassembly problem
2015
Sampling-based motion planners are able to plan disassembly paths at high performance. They are limited by the fact that the input triangle sets of the static and dynamic object need to be free of collision in the initial and all following states. In real world applications, like the disassembly planning in car industry, this often does not hold true. Beside data inaccuracy, this is mainly caused by the modeling of flexible parts as rigid bodies, especially fixture elements like clips. They cause the invalid initial state disassembly problem. In the literature there exists no algorithm that is able to calculate a reasonable disassembly path for an invalid initial state. Our novel algorithm …
Nonnegative Tensor Train Decompositions for Multi-domain Feature Extraction and Clustering
2016
Tensor train (TT) is one of the modern tensor decomposition models for low-rank approximation of high-order tensors. For nonnegative multiway array data analysis, we propose a nonnegative TT (NTT) decomposition algorithm for the NTT model and a hybrid model called the NTT-Tucker model. By employing the hierarchical alternating least squares approach, each fiber vector of core tensors is optimized efficiently at each iteration. We compared the performances of the proposed method with a standard nonnegative Tucker decomposition (NTD) algorithm by using benchmark data sets including event-related potential data and facial image data in multi-domain feature extraction and clustering tasks. It i…
A survey on geometrical reconstruction as a core technology to sketch-based modeling
2005
In this work, the background and evolution of three-dimensional reconstruction of line drawings during the last 30 years is discussed. A new general taxonomy is proposed to make apparent and discuss the historical evolution of geometrical reconstruction and their challenges. The evolution of geometrical reconstruction from recovering know-how stored in engineering drawings to sketch-based modeling for helping in the first steps of conceptual design purposes, and the current challenges of geometrical reconstruction are discussed too.
Optimised assembly mode reconfiguration of the 5-DOF Gantry-Tau using mixed-integer programming
2010
Pulished version of an article in the journal: Meccanica. Also available from the publisher at: http://dx.doi.org/10.1007/s11012-010-9404-y This paper presents a systematic approach based on Mixed Integer Linear Programming for finding an optimal singularity-free reconfiguration path of the 5-DOF Gantry-Tau parallel kinematic machine. The results in the paper demonstrate that singularity-free reconfiguration (change of assembly mode) of the machine is possible, which significantly increases the usable workspace. The method has been applied to a full-scale prototype and the singularity-free path has been verified both in simulations and with physical experiments using real-time control of th…