Browsing by Subject "Polynomials"
Now showing items 21-40 of 42
-
Article
Network game with attacker and protector entities
(2005)Consider an information network with harmful procedures called attackers (e.g., viruses)
-
Article
A network game with attackers and a defender
(2008)Consider an information network with threats called attackers
-
Conference Object
Neural Networks in Comparing USN and Wageningen B-Series Marine Propellers
(2003)The USN-series of experimental data on marine propeller performance (Denny et al, 1989) were compared with fitted Wageningen B-Series data. A Kohonen network has been used to attempt finding non-obvious similarities between ...
-
Article
A new linear adaptive controller: Design, analysis and performance
(2000)The certainty equivalence and polynomial approach, widely used for designing adaptive controllers, leads to "simple" adaptive control designs that guarantee stability, asymptotic error convergence, and robustness, but not ...
-
Article
A nonoverlapping domain decomposition method for Legendre spectral collocation problems
(2007)We consider the Dirichlet boundary value problem for Poisson's equation in an L-shaped region or a rectangle with a cross-point. In both cases, we approximate the Dirichlet problem using Legendre spectral collocation, that ...
-
Article
A note on p/hp finite element methods for reaction-diffusion problems in polygonal domains
(2000)We present guidelines on how to choose the mesh and polynomial degree distribution for the approximation of reaction-diffusion problems in polygonal domains, in the context of the hp finite element method. These guidelines ...
-
Article
Observation of the narrow state X(3872) → J/ψπ+π- in p̄p collisions at √s = 1.96 TeV
(2004)The observation of a state consistent with X(3872) decaying into J/ψπ+π- was reported. The X(3872) mass was measured to be 3871.3±0.7(stat)±0.4(syst)MeV/c2 from a sample of 730±90 candidates. The observed width was consistent ...
-
Article
On the computational complexity of assumption-based argumentation for default reasoning
(2002)Bondarenko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, the framework extends these formalisms ...
-
Article
Open problems in constructive function theory
(2006)A number of open problems on constructive function theory are presented. These were submitted by participants of Constructive Function Theory Tech-04. Copyright © 2006, Kent State University.
-
Article
Optimal, distributed decision-making: The case of no communication
(1999)We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in the presence of incomplete information
-
Article
Orthogonal polynomials for area-type measures and image recovery
(2015)Let G be a finite union of disjoint and bounded Jordan domains in the complex plane, let K be a compact subset of G, and consider the set G∗ obtained from G by removing K
-
Article
A Parameter Robust Finite Element Method for Fourth Order Singularly Perturbed Problems
(2017)We consider fourth order singularly perturbed problems in one-dimension and the approximation of their solution by the h version of the finite element method. In particular, we use piecewise Hermite polynomials of degree ...
-
Conference Object
Performance analysis of sum-product algorithms for multiple fault diagnosis applications
(2010)In this paper, we study the application of sum-product algorithms (SPAs) to multiple fault diagnosis (MFD) problems in order to diagnose the most likely state of each component given the status of alarms. SPAs are heuristic ...
-
Article
Performance and stability bounds for dynamic networks
(2007)In this work, we study the impact of dynamically changing link capacities on the delay bounds of LIS (Longest-In-System) and SIS (Shortest-In-System) protocols on specific networks (that can be modelled as Directed Acyclic ...
-
Article
Piecewise linear emulation of propagating fronts as a method for determining their speeds
(2003)The selected speed of pushed fronts was found through analytic calculations. The resulting analytic solution constitutes an excellent approximation to the exact propagating front, yielding also the correct value for the ...
-
Conference Object
The power of the defender
(2006)We consider a security problem on a distributed network. We assume a network whose nodes are vulnerable to infection by threats (e.g. viruses), the attackers. A system security software, the defender, is available in the ...
-
Article
The price of anarchy for polynomial social cost
(2006)In this work, we consider an interesting variant of the well studied KP model for selfish routing on parallel links, which reflects some influence from the much older Wardrop model [J.G. Wardrop, Some theoretical aspects ...
-
Article
The price of anarchy for polynomial social cost
(2004)In this work, we consider an interesting variant of the well-studied KP model [18] for selfish routing that reflects some influence from the much older Wardrop model [31]. In the new model, user traffics are still unsplittable, ...
-
Article
The price of defense
(2006)We consider a strategic game with two classes of confronting randomized players on a graph G(V, E): v attackers, each choosing vertices and wishing to minimize the probability of being caught, and a defender, who chooses ...
-
Article
Search for Bs 0 → μ+μ - and Bd 0 → μ+μ - decays in pp̄ collisions at √s = 1.96 TeV
(2004)The decay mechanisms of Bs 0 → μ +μ- and Bd 0 → μ +μ- in pp̄ collisions were investigated. For discrimination of the decays from background events, four variables were used such as invariant mass of muon pair, B-candidate ...