Search results for "abstract"
showing 10 items of 1959 documents
Optimal power flow for technically feasible energy management systems in islanded microgrids
2016
This paper presents a combined optimal energy and power flow management for islanded microgrids. The highest control level in this case will provide a feasible and optimized operating point around the economic optimum. In order to account for both unbalanced and balanced loads, the optimal power flow is carried out using a Glow-worm Swarm Optimizer. The control level is organized into two different sub-levels, the highest of which accounts for minimum cost operation and the lowest one solving the optimal power flow and devising the set points of inverter interfaced generation units and rotating machines with a minimum power loss. A test has been carried out for 6 bus islanded microgrids to …
T110. FIRST EPISODE PSYCHOTIC PATIENTS WITH A HISTORY OF FREQUENT CANNABIS USE EXPRESS MORE POSITIVE SYMPTOMS AT ILLNESS ONSET THAN THOSE WHO NEVER U…
2018
Abstract Background Robust evidence has demonstrated that cannabis use increases the risk to develop psychotic disorders. However, a limited number of studies have investigated if and how cannabis use influences psychopathology profiles at first episode psychosis (FEP). Based on the evidence that dopamine dysfunction contributes to explain positive symptoms in psychosis, and that the main cannabis’ psychoactive component, Δ9-Tetrahydrocannabinol (THC), modulates the dopamine system, we hypothesise that: 1) positive symptoms at FEP are more common among psychotic patients who used cannabis compared with never users; 2) this association is a dose-response relationship. Methods We analyzed a s…
Stability Analysis of Routing Strategies for the Maximum Lifetime Problem in One-Dimensional Ad-Hoc Wireless Networks
2017
In the paper we discuss solutions of the maximum network lifetime problem in one-dimensional, regular ad-hoc wireless networks. For the problem, nodes of the network generate given amount of data and send it possibly via other nodes to the data collector. To extend the network lifetime the data should be transmitted in such a way, that the energy utilized by the most overloaded node is minimized. We assume, that the nodes use the point-to-point data transmission scheme and the cost of transmission of one unit of data is arbitrary superadditive function of a distance between transmitter and receiver. We show that for the one-dimensional network in which the nodes are evenly distributed on th…
Longest Common Subsequence from Fragments via Sparse Dynamic Programming
1998
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 [7,11,15]. We provide a new Sparse Dynamic Programming technique that extends the Hunt-Szymanski [2,9,8] 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, resp.) 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 t…
In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem
2015
Recently, Bode and Irnich [Bode C, Irnich S (2012) Cut-first branch-and-price-second for the capacitated arc-routing problem. Oper. Res. 60(5):1167–1182] presented a cut-first branch-and-price-second algorithm for solving the capacitated arc-routing problem (CARP). The fundamental difference to other approaches for exactly solving the CARP is that the entire algorithm works directly on the typically sparse underlying graph representing the street network. This enables the use of highly efficient dynamic programming-based pricing algorithms to solve the column-generation subproblem also known as the pricing problem. The contribution of this paper is the in-depth analysis of the CARP pricing…
On the use of a metric-space search algorithm (AESA) for fast DTW-based recognition of isolated words
1988
The approximating and eliminating search algorithm (AESA) presented was recently introduced for finding nearest neighbors in metric spaces. Although the AESA was originally developed for reducing the time complexity of dynamic time-warping isolated word recognition (DTW-IWR), only rather limited experiments had been previously carried out to check its performance in this task. A set of experiments aimed at filling this gap is reported. The main results show that the important features reflected in previous simulation experiments are also true for real speech samples. With single-speaker dictionaries of up to 200 words, and for most of the different speech parameterizations, local metrics, a…
Massive evaluation and analysis of Poincar�� recurrences on grids of initial data: a tool to map chaotic diffusion
2020
We present a novel numerical method aimed to characterize global behaviour, in particular chaotic diffusion, in dynamical systems. It is based on an analysis of the Poincar\'e recurrence statistics on massive grids of initial data or values of parameters. We concentrate on Hamiltonian systems, featuring the method separately for the cases of bounded and non-bounded phase spaces. The embodiments of the method in each of the cases are specific. We compare the performances of the proposed Poincar\'e recurrence method (PRM) and the custom Lyapunov exponent (LE) methods and show that they expose the global dynamics almost identically. However, a major advantage of the new method over the known g…
Split decomposition A technique to analyze viral evolution
1993
A clustering technique allowing a restricted amount of overlapping and based on an abstract theory of coherent decompositions of finite metrics is used to analyze the evolution of foot-and-mouth disease viruses. The emerging picture is compatible with the existence of viral populations with a quasispecies structure and illustrates various forms of evolution of this virus family. In addition, it allows the correlation of these forms with geographic occurrence.
Isoëtes sabatina (Isoëtaceae, Lycopodiopsida). Taxonomic distinctness and preliminary ecological insights
2021
1) Isoëtes sabatina is the rarest aquatic quillwort in Europe. Although recently found (2013) in Lake Bracciano (central Italy), the species is just one step away from extinction with an estimated population not exceeding 400 individuals and a spatial range of a few hundred square metres. 2) Lake Bracciano is a deep, oligo-mesotrophic Mediterranean volcanic lake that has been subjected to human activities. From January to October 2017, the lake experienced a dramatic water level decrease (up to −1.50 m), which significantly affected the littoral zone and the habitat of I. sabatina. 3) To improve the chances of survival of I. sabatina, the first eco-taxonomic investigation on this species wa…
Belief elicitation with multiple point predictions
2021
Abstract We propose a simple, incentive compatible procedure based on binarized linear scoring rules to elicit beliefs about real-valued outcomes - multiple point predictions. Simultaneously eliciting multiple point predictions with linear incentives reveals the subjective probability distribution without pre-defined intervals or probabilistic statements. We show that the approach is theoretically as robust as existing methods, while adapting flexibly to different beliefs. In a laboratory experiment, we compare our procedure to the standard approach of eliciting discrete probabilities on pre-defined intervals. We find that elicitation with multiple point predictions is faster, perceived as …