334 research outputs found
Hemihelical local minimizers in prestrained elastic bi-strips
We consider a double layered prestrained elastic rod in the limit of
vanishing cross section. For the resulting limit Kirchoff-rod model with
intrinsic curvature we prove a supercritical bifurcation result, rigorously
showing the emergence of a branch of hemihelical local minimizers from the
straight configuration, at a critical force and under clamping at both ends. As
a consequence we obtain the existence of nontrivial local minimizers of the
-d system.Comment: 16 pages, 2 figure
Hardness of MSA with Selective Column Scoring
Multiple Sequence Alignment (MSA for short) is a well known problem in the field of computational biology. In order to evaluate the quality of a solution, many different scoring functions have been introduced, the most widely used being the Sum-of-pairs score (SP-score). It is known that computing the best MSA under the SP-score measure is NP-hard. In this paper, we introduce a variant of the Column score (defined in Thompson et al. 1999), which we refer to as Selective Column score: Given a symbol a â ÎŁ, the score of the i-th column is one if and only if all symbols of the same column are a, and otherwise zero. The acolumn score of an alignment is then the number of columns made of only character a. We show that finding the optimal MSA under the Selective Column Score is NP-hard for all alphabets of size |ÎŁ| â„ 2 by reducing from MIN-2-SAT
(Total) Vector Domination for Graphs with Bounded Branchwidth
Given a graph of order and an -dimensional non-negative
vector , called demand vector, the vector domination
(resp., total vector domination) is the problem of finding a minimum
such that every vertex in (resp., in ) has
at least neighbors in . The (total) vector domination is a
generalization of many dominating set type problems, e.g., the dominating set
problem, the -tuple dominating set problem (this is different from the
solution size), and so on, and its approximability and inapproximability have
been studied under this general framework. In this paper, we show that a
(total) vector domination of graphs with bounded branchwidth can be solved in
polynomial time. This implies that the problem is polynomially solvable also
for graphs with bounded treewidth. Consequently, the (total) vector domination
problem for a planar graph is subexponential fixed-parameter tractable with
respectto , where is the size of solution.Comment: 16 page
An integrated 2D/3D numerical methodology to predict the thermal field of electric motors
The present work aims at providing a predictive numerical methodology for the thermal characterization of electric motors. The methodology relies on a 2D -FE simulation for the estimation of the electromagnetic (iron and joule) losses. The latter are then exploited in a 3D-CFD Conjugate Heat Transfer analysis for the evaluation of the thermal field. The CFD model includes both the solid components and the fluid domains. The main novelty of the paper is represented by the copper coil modelling. In fact, copper, air, epoxy resin and enamel are synthetized in a single homogeneous body able to reproduce the thermal behaviour without including the single components, to reduce the computational cost. The methodology is validated against experimental data on a three-phase squirrel-cage induction motor. As for the experimental data (available at three different operating conditions), temperature distributions are measured by thermocouples at the test bench for the validation of the 3D-CFD CHT model. In addition, experimental estimations of the losses are available for the validation of the 2D electromagnetic simulations. The numerical results in terms of motor performance, electromagnetic losses and thermal field are discussed and are proved to be close to the experimental counterparts, for all the investigated conditions
Normal, Abby Normal, Prefix Normal
A prefix normal word is a binary word with the property that no substring has
more 1s than the prefix of the same length. This class of words is important in
the context of binary jumbled pattern matching. In this paper we present
results about the number of prefix normal words of length , showing
that for some and
. We introduce efficient
algorithms for testing the prefix normal property and a "mechanical algorithm"
for computing prefix normal forms. We also include games which can be played
with prefix normal words. In these games Alice wishes to stay normal but Bob
wants to drive her "abnormal" -- we discuss which parameter settings allow
Alice to succeed.Comment: Accepted at FUN '1
Parameterized Inapproximability of Target Set Selection and Generalizations
In this paper, we consider the Target Set Selection problem: given a graph
and a threshold value for any vertex of the graph, find a minimum
size vertex-subset to "activate" s.t. all the vertices of the graph are
activated at the end of the propagation process. A vertex is activated
during the propagation process if at least of its neighbors are
activated. This problem models several practical issues like faults in
distributed networks or word-to-mouth recommendations in social networks. We
show that for any functions and this problem cannot be approximated
within a factor of in time, unless FPT = W[P],
even for restricted thresholds (namely constant and majority thresholds). We
also study the cardinality constraint maximization and minimization versions of
the problem for which we prove similar hardness results
Negative-Pressure Ventilation in Neuromuscular Diseases in the Acute Setting
Mechanical ventilation started with negative-pressure ventilation (NPV) during the 1950s to assist patients with respiratory failure, secondary to poliomyelitis. Over the years, technological evolution has allowed for the development of more comfortable devices, leading to an increased interest in NPV. The patients affected by neuromuscular diseases (NMD) with chronic and acute respiratory failure (ARF) may benefit from NPV. The knowledge of the available respiratory-support techniques, indications, contraindications, and adverse effects is necessary to offer the patient a personalized treatment that considers the pathology's complexity
Algorithms for Jumbled Pattern Matching in Strings
The Parikh vector p(s) of a string s is defined as the vector of
multiplicities of the characters. Parikh vector q occurs in s if s has a
substring t with p(t)=q. We present two novel algorithms for searching for a
query q in a text s. One solves the decision problem over a binary text in
constant time, using a linear size index of the text. The second algorithm, for
a general finite alphabet, finds all occurrences of a given Parikh vector q and
has sub-linear expected time complexity; we present two variants, which both
use a linear size index of the text.Comment: 18 pages, 9 figures; article accepted for publication in the
International Journal of Foundations of Computer Scienc
Influence Diffusion in Social Networks under Time Window Constraints
We study a combinatorial model of the spread of influence in networks that
generalizes existing schemata recently proposed in the literature. In our
model, agents change behaviors/opinions on the basis of information collected
from their neighbors in a time interval of bounded size whereas agents are
assumed to have unbounded memory in previously studied scenarios. In our
mathematical framework, one is given a network , an integer value
for each node , and a time window size . The goal is to
determine a small set of nodes (target set) that influences the whole graph.
The spread of influence proceeds in rounds as follows: initially all nodes in
the target set are influenced; subsequently, in each round, any uninfluenced
node becomes influenced if the number of its neighbors that have been
influenced in the previous rounds is greater than or equal to .
We prove that the problem of finding a minimum cardinality target set that
influences the whole network is hard to approximate within a
polylogarithmic factor. On the positive side, we design exact polynomial time
algorithms for paths, rings, trees, and complete graphs.Comment: An extended abstract of a preliminary version of this paper appeared
in: Proceedings of 20th International Colloquium on Structural Information
and Communication Complexity (Sirocco 2013), Lectures Notes in Computer
Science vol. 8179, T. Moscibroda and A.A. Rescigno (Eds.), pp. 141-152, 201
Longest Common Abelian Factors and Large Alphabets
Two strings X and Y are considered Abelian equal if the letters of X can be permuted to obtain Y (and vice versa). Recently, Alatabbi et al. (2015) considered the longest common Abelian factor problem in which we are asked to find the length of the longest Abelian-equal factor present in a given pair of strings. They provided an algorithm that uses O(Ïn2) time and O(Ïn) space, where n is the length of the pair of strings and Ï is the alphabet size. In this paper we describe an algorithm that uses O(n2log2nlogân) time and O(nlog2n) space, significantly improving Alatabbi et al.âs result unless the alphabet is small. Our algorithm makes use of techniques for maintaining a dynamic set of strings under split, join, and equality testing (Melhorn et al., Algorithmica 17(2), 1997)
- âŠ