893 resultados para Minimal Set
Resumo:
The 3-Hitting Set problem involves a family of subsets F of size at most three over an universe U. The goal is to find a subset of U of the smallest possible size that intersects every set in F. The version of the problem with parity constraints asks for a subset S of size at most k that, in addition to being a hitting set, also satisfies certain parity constraints on the sizes of the intersections of S with each set in the family F. In particular, an odd (even) set is a hitting set that hits every set at either one or three (two) elements, and a perfect code is a hitting set that intersects every set at exactly one element. These questions are of fundamental interest in many contexts for general set systems. Just as for Hitting Set, we find these questions to be interesting for the case of families consisting of sets of size at most three. In this work, we initiate an algorithmic study of these problems in this special case, focusing on a parameterized analysis. We show, for each problem, efficient fixed-parameter tractable algorithms using search trees that are tailor-made to the constraints in question, and also polynomial kernels using sunflower-like arguments in a manner that accounts for equivalence under the additional parity constraints.
Resumo:
The ATLAS and CMS collaborations at the LHC have performed analyses on the existing data sets, studying the case of one vector-like fermion or multiplet coupling to the standard model Yukawa sector. In the near future, with more data available, these experimental collaborations will start to investigate more realistic cases. The presence of more than one extra vector-like multiplet is indeed a common situation in many extensions of the standard model. The interplay of these vector-like multiplet between precision electroweak bounds, flavour and collider phenomenology is a important question in view of establishing bounds or for the discovery of physics beyond the standard model. In this work we study the phenomenological consequences of the presence of two vector-like multiplets. We analyse the constraints on such scenarios from tree-level data and oblique corrections for the case of mixing to each of the SM generations. In the present work, we limit to scenarios with two top-like partners and no mixing in the down-sector.
Resumo:
We propose a distributed sequential algorithm for quick detection of spectral holes in a Cognitive Radio set up. Two or more local nodes make decisions and inform the fusion centre (FC) over a reporting Multiple Access Channel (MAC), which then makes the final decision. The local nodes use energy detection and the FC uses mean detection in the presence of fading, heavy-tailed electromagnetic interference (EMI) and outliers. The statistics of the primary signal, channel gain and the EMI is not known. Different nonparametric sequential algorithms are compared to choose appropriate algorithms to be used at the local nodes and the Fe. Modification of a recently developed random walk test is selected for the local nodes for energy detection as well as at the fusion centre for mean detection. We show via simulations and analysis that the nonparametric distributed algorithm developed performs well in the presence of fading, EMI and outliers. The algorithm is iterative in nature making the computation and storage requirements minimal.
Resumo:
A finite flexible perforated panel set in a differently perforated rigid baffle is considered. The radiation efficiency from such a panel is derived using a 2-D wavenumber domain formulation. This generalization is later used to represent a more practical case of a perforated panel fixed in an unperforated baffle. The perforations are in the form of an array of uniformly distributed circular holes. A complex impedance model for the holes available in the literature is used. An averaged fluid particle velocity is derived using the continuity equation and the surface pressure is derived using an appropriate momentum equation. The discontinuity in the perforate impedance (due to different hole dimensions or perforation ratio) at the panel-baffle interface is carefully taken into account. It is found that there exists a `coupling' of different wavenumbers of the spatially mean fluid particle velocity field. The change in the resonance frequencies and the modeshapes of the panel due to the perforations is taken into account using the Receptance method. Analytical expressions for the radiated power and radiation efficiency are derived in an integral form and numerical results are presented. Several comparisons are made to understand the radiation efficiency curves. Since both the resistive and reactive components of the hole impedance are taken into account, the model is directly applicable to micro-perforated panels also. (C) 2016 Elsevier Ltd. All rights reserved.
Resumo:
Consider the domain E in defined by This is called the tetrablock. This paper constructs explicit boundary normal dilation for a triple (A, B, P) of commuting bounded operators which has as a spectral set. We show that the dilation is minimal and unique under a certain natural condition. As is well-known, uniqueness of minimal dilation usually does not hold good in several variables, e.g., Ando's dilation is known to be not unique, see Li and Timotin (J Funct Anal 154:1-16, 1998). However, in the case of the tetrablock, the third component of the dilation can be chosen in such a way as to ensure uniqueness.
Resumo:
Gravity mediated supersymmetry breaking becomes comparable to gauge mediated supersymmetry breaking contributions when messenger masses are close to the GUT scale. By suitably arranging the gravity contributions, one can modify the soft supersymmetry breaking sector to generate a large stop mixing parameter and a light Higgs mass of 125 GeV. In this kind of hybrid models, however, the nice features of gauge mediation like flavor conservation, etc. are lost. To preserve the nice features, gravitational contributions should become important for lighter messenger masses and should be important only for certain fields. This is possible when the hidden sector contains multiple (at least two) spurions with hierarchical vacuum expectation values. In this case, the gravitational contributions can be organized to be ``just right.'' We present a complete model with two spurion hidden sector where the gravitational contribution is from a warped flavor model in a Randall-Sundrum setting. Along the way, we present simple expressions to handle renormalization group equations when supersymmetry is broken by two different sectors at two different scales.
Resumo:
用数值模拟方法来研究气-液两相流动与传热现象是当今多相流领域的一个热门课题.由于两相流固有的复杂性,气-液两相流界面迁移现象的数值模拟一直是两相流研究中的一大难点.本文介绍了捕捉气-液两相流相界面运动的水平集方法(Level Set)及其研究进展,介绍了求解Level Set输运方程的3种方法,即一般差分格式、Superbee-TVD格式和Runge-Kutta法-5阶WENO组合格式.结合主流场的求解,分别用这3种方法对4种典型相界面在5种流场中的迁移特性进行了模拟计算,并对计算结果进行了比较和分析.结果表明,Runge-Kutta法-5阶WENO组合格式求解Level Set输运方程的效果最好,在以后的计算中将主要采用这种组合格式来进行气-液相界面输运方程的求解.
Resumo:
Sensor networks can be naturally represented as graphical models, where the edge set encodes the presence of sparsity in the correlation structure between sensors. Such graphical representations can be valuable for information mining purposes as well as for optimizing bandwidth and battery usage with minimal loss of estimation accuracy. We use a computationally efficient technique for estimating sparse graphical models which fits a sparse linear regression locally at each node of the graph via the Lasso estimator. Using a recently suggested online, temporally adaptive implementation of the Lasso, we propose an algorithm for streaming graphical model selection over sensor networks. With battery consumption minimization applications in mind, we use this algorithm as the basis of an adaptive querying scheme. We discuss implementation issues in the context of environmental monitoring using sensor networks, where the objective is short-term forecasting of local wind direction. The algorithm is tested against real UK weather data and conclusions are drawn about certain tradeoffs inherent in decentralized sensor networks data analysis. © 2010 The Author. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.