Search results for "Graph theory"

How Idioms Are Recognized when Individuals Are “Thrown Off the Track”, “Off the Rack” or “Off the Path”: A Decision Time Experiment in Healthy Volunt…

2021

Figurative elements in language have their own particularities, including words that deviate from their generally accepted definition to amplify our language or to paraphrase an issue. It is still unclear how individuals process idioms that are figurative or ambiguous, especially when they additionally become distracted by modified idioms that are similar in appearance. In our study, 47 healthy adults (mean age of 27.3 years, SD = 2.9) participated in a decision time experiment to determine how participants recognize well-formed, genuine German idioms alongside certain idiom modifications. All participants were initially exposed to a prime on a screen. Then, they had to detect the target id…

Neighbourhood distribution interacts with orthographic priming in the lexical decision task

2004

Lexical decision tasks (LDTs) were used with a masked priming procedure to test whether neighbourhood distribution interacts with orthographic priming. Word targets had either ‘single’ neighbours when their two higher frequency orthographic neighbours were spread over letter positions (e.g., neighbours of LOBE: robe-loge) or ‘twin’ neighbours when they were concentrated on a single letter position (e.g., neighbours of FARD: lard-tard). All word targets were preceded by their highest frequency orthographic neighbour or by a control prime. An inhibitory priming effect was found for words with single neighbours, but not for words with twin neighbours, in both a yes/no LDT (Experiment 1a) and a…

Sparse Dynamic Programming for Longest Common Subsequence from Fragments

2002

Sparse Dynamic Programming has emerged as an essential tool for the design of efficient algorithms for optimization problems coming from such diverse areas as computer science, computational biology, and speech recognition. We provide a new sparse dynamic programming technique that extends the Hunt?Szymanski paradigm for the computation of the longest common subsequence (LCS) and apply it to solve the LCS from Fragments problem: given a pair of strings X and Y (of length n and m, respectively) and a set M of matching substrings of X and Y, find the longest common subsequence based only on the symbol correspondences induced by the substrings. This problem arises in an application to analysis…

A second-order differential equation for the two-loop sunrise graph with arbitrary masses

2011

We derive a second-order differential equation for the two-loop sunrise graph in two dimensions with arbitrary masses. The differential equation is obtained by viewing the Feynman integral as a period of a variation of a mixed Hodge structure, where the variation is with respect to the external momentum squared. The fibre is the complement of an elliptic curve. From the fact that the first cohomology group of this elliptic curve is two-dimensional we obtain a second-order differential equation. This is an improvement compared to the usual way of deriving differential equations: Integration-by-parts identities lead only to a coupled system of four first-order differential equations.

The shortest-path problem with resource constraints with -loop elimination and its application to the capacitated arc-routing problem

2014

Abstract In many branch-and-price algorithms, the column generation subproblem consists of computing feasible constrained paths. In the capacitated arc-routing problem (CARP), elementarity constraints concerning the edges to be serviced and additional constraints resulting from the branch-and-bound process together impose two types of loop-elimination constraints. To fulfill the former constraints, it is common practice to rely on a relaxation where loops are allowed. In a k-loop elimination approach all loops of length k and smaller are forbidden. Following Bode and Irnich (2012) for solving the CARP, branching on followers and non-followers is the only known approach to guarantee integer …

Generalized SCODEF Deformations on Subdivision Surfaces

2006

This paper proposes to define a generalized SCODEF deformation method on a subdivision surface. It combines an “easy-to-use” free-form deformation with a Loop subdivision algorithm. The deformation method processes only on vertices of an object and permits the satisfaction of geometrical constraints given by the user. The method controls the resulting shape, defining the range (i.e. the impact) of the deformation on an object before applying it. The deformation takes into account the Loop properties to follow the subdivision scheme, allowing the user to fix some constraints at the subdivision-level he works on and to render the final object at the level he wants to. We also propose an adapt…

2014

This paper is devoted to investigating stability in mean of partial variables for coupled stochastic reaction-diffusion systems on networks (CSRDSNs). By transforming the integral of the trajectory with respect to spatial variables as the solution of the stochastic ordinary differential equations (SODE) and using Itô formula, we establish some novel stability principles for uniform stability in mean, asymptotic stability in mean, uniformly asymptotic stability in mean, and exponential stability in mean of partial variables for CSRDSNs. These stability principles have a close relation with the topology property of the network. We also provide a systematic method for constructing global Lyapu…

Structure of equilibrium states on self-affine sets and strict monotonicity of affinity dimension

2017

A fundamental problem in the dimension theory of self-affine sets is the construction of high- dimensional measures which yield sharp lower bounds for the Hausdorff dimension of the set. A natural strategy for the construction of such high-dimensional measures is to investigate measures of maximal Lyapunov dimension; these measures can be alternatively interpreted as equilibrium states of the singular value function introduced by Falconer. Whilst the existence of these equilibrium states has been well-known for some years their structure has remained elusive, particularly in dimensions higher than two. In this article we give a complete description of the equilibrium states of the singular …

Global stability of coupled Markovian switching reaction–diffusion systems on networks

2014

Abstract In this paper, we investigate the stability problem for some Markovian switching reaction–diffusion coupled systems on networks (MSRDCSNs). By using the Lyapunov function, we establish some novel stability principles for stochastic stability, asymptotically stochastic stability, globally asymptotically stochastic stability and almost surely exponential stability of the MSRDCSNs. These stability principles have a close relation to the topology property of the network. We also provide a systematic method for constructing global Lyapunov function for these MSRDCSNs by using graph theory. The new method can help analyze the dynamics of complex networks.

Novel Stability Criteria for T--S Fuzzy Systems

2014

In this paper, novel stability conditions for Takagi-Sugeno (T-S) fuzzy systems are presented. The so-called nonquadratic membership-dependent Lyapunov function is first proposed, which is formulated in a higher order form of both the system states and the normalized membership functions than existing techniques in the literature. Then, new membership-dependent stability conditions are developed by the new Lyapunov function approach. It is shown that the conservativeness of the obtained criteria can be further reduced as the degree of the Lyapunov function increases. Two numerical examples are given to demonstrate the effectiveness and less conservativeness of the obtained theoretical resul…