Search results for "Crete"
showing 10 items of 2495 documents
Special factors and the combinatorics of suffix and factor automata
2011
AbstractThe suffix automaton (resp. factor automaton) of a finite word w is the minimal deterministic automaton recognizing the set of suffixes (resp. factors) of w. We study the relationships between the structure of the suffix and factor automata and classical combinatorial parameters related to the special factors of w. We derive formulae for the number of states of these automata. We also characterize the languages LSA and LFA of words having respectively suffix automaton and factor automaton with the minimal possible number of states.
Do Patients With Depression Prefer Literal or Metaphorical Expressions for Internal States? Evidence From Sentence Completion and Elicited Production
2018
In everyday communication metaphoric expressions are frequently used to refer to abstract concepts, such as feelings or mental states. Patients with depression are said to prefer literal over figurative language, i.e. they may show a concreteness bias. Given that both emotional functioning and the processing of figurative language may be altered in this clinical population, our study aims at investigating whether and how these dysfunctions are reflected in the understanding and production of metaphorical expressions for internal states. We used two behavioral approaches: a sentence completion task and elicited speech production. In the first experiment, patients with ICD 10 depression (n = …
A comparative empirical assessment of roundabouts operations in rural areas: impacts on congestion-specific vehicle speed profiles, pollutant and noi…
2020
Increasing concern about global warming and air quality has meant an increasing use of energetic and environmental indicators in roundabout design. The main objective of this paper is to compare different rural roundabouts in terms of traffic performance, pollutant and noise emissions through an integrated empirical assessment. Field measurements were carried out with a light duty vehicle in single-lane (SL), compact two-lane (CTL) and multi-lane (ML) roundabouts using Portable Emission Measurements Systems, OBD scan tool and Sound Level Meter, to measure real-world exhaust emissions, engine activity and acoustic data, respectively. Road traffic scene at roundabouts were obtained from video…
Circuits and excitations to enable Brownian token-based computing with skyrmions
2021
Brownian computing exploits thermal motion of discrete signal carriers (tokens) for computations. In this paper we address two major challenges that hinder competitive realizations of circuits and application of Brownian token-based computing in actual devices for instance based on magnetic skyrmions. To overcome the problem that crossings generate for the fabrication of circuits, we design a crossing-free layout for a composite half-adder module. This layout greatly simplifies experimental implementations as wire crossings are effectively avoided. Additionally, our design is shorter to speed up computations compared to conventional designs. To address the key issue of slow computation base…
Periodic Discrete and Discrete-Time Splines
2018
Periodic discrete splines with different periods and spans are introduced in Sect. 3.4 of Volume I (Averbuch, Neittaanmaki and Zheludev, Spline and Spline Wavelet Methods with Applications to Signal and Image Processing, Springer, Berlin, 2014) [2]. In this chapter, we regard periodic discrete splines as a base for the design of periodic discrete-time wavelets, wavelet packets and wavelet frames. Therefore, only the discrete splines whose spans are 2 are outlined. These discrete splines are linear combinations of the discrete B-splines. So also, the so-called discrete-time splines are discussed in the chapter that are linear combinations of the discrete-time B-splines. The discrete-time B-s…
Discrete-Time Periodic Wavelet Packets
2014
Direct and inverse wavelet and wavelet packet transforms of a spline are implemented by filtering the spline’s coordinates by two-channel critically sampled p-filter banks. In this chapter, those p-filter banks are utilized for processing discrete-time signals. The p-filter banks generate discrete-time wavelets and wavelet packets in the spaces of 1D and 2D periodic signals.
Radio k-Labelings for Cartesian Products of Graphs
2005
International audience; Frequency planning consists in allocating frequencies to the transmitters of a cellular network so as to ensure that no pair of transmitters interfere. We study the problem of reducing interference by modeling this by a radio k-labeling problem on graphs: For a graph G and an integer k ≥ 1, a radio k-labeling of G is an assignment f of non negative integers to the vertices of G such that |f(x)−f(y)| ≥ k+1−dG(x,y), for any two vertices x and y, where dG(x,y) is the distance between x and y in G. The radio k-chromatic number is the minimum of max{f(x)−f(y):x,y ∈ V(G)} over all radio k-labelings f of G. In this paper we present the radio k-labeling for the Cartesian pro…
A branch-and-cut algorithm for the soft-clustered vehicle-routing problem
2021
Abstract The soft-clustered vehicle-routing problem is a variant of the classical capacitated vehicle-routing problem (CVRP) in which customers are partitioned into clusters and all customers of the same cluster must be served by the same vehicle. We introduce a novel symmetric formulation of the problem in which the clustering part is modeled with an asymmetric sub-model. We solve the new model with a branch-and-cut algorithm exploiting some known valid inequalities for the CVRP that can be adapted. In addition, we derive problem-specific cutting planes and new heuristic and exact separation procedures. For square grid instances in the Euclidean plane, we provide lower-bounding techniques …
Finite-time stability analysis and stabilization for linear discrete-time system with time-varying delay
2014
Abstract The problem of finite-time stability for linear discrete-time systems with time-varying delay is studied in this paper. In order to deal with the time delay, the original system is firstly transformed into two interconnected subsystems. By constructing a delay-dependent Lyapunov–Krasovskii functional and using a two-term approximation of the time-varying delay, sufficient conditions of finite-time stability are derived and expressed in terms of linear matrix inequalities (LMIs). The derived stability conditions can be applied into analyzing the finite-time stability and deriving the maximally tolerable delay. Compared with the existing results on finite-time stability, the derived …
D-stability for discrete-time t-s fuzzy descriptor systems with multiple delays
2014
In this work, the D-stability problem is considered for a class of discrete-time Takagi-Sugeno (T-S) fuzzy descriptor systems with multiple state delays. In terms of linear matrix inequality, sufficient conditions are proposed to ensure that all poles of the descriptor T-S fuzzy system are located within a disk contained in the unit circle. Moreover, a sufficient condition is presented such that the singular system is regular, causal and D-stable in spite of multiple state delays. Finally, an example is given to show the effectiveness and advantages of the proposed techniques Refereed/Peer-reviewed