نتایج جستجو برای: max spectral space

تعداد نتایج: 687814  

In this paper, a numerical efficient method is proposed for the solution of time fractional mobile/immobile equation. The fractional derivative of equation is described in the Caputo sense. The proposed method is based on a finite difference scheme in time and Legendre spectral method in space. In this approach the time fractional derivative of mentioned equation is approximated by a scheme of ord...

2008
Jiancheng Jiang

The SiZer method is extended to nonparametric hazard estimation and also to censored density and hazard estimation. The new method allows quick, visual statistical inference about the important issue of statistically significant increases and decreases in the smooth curve estimate. This extension has required the opening of a new avenue of research on the interface between statistical inference...

1995
Bart De Schutter Bart De Moor

The topic of this paper is the (partial) minimal realization problem in the max algebra, which is one of the modeling frameworks that can be used to model discrete event systems. We use the fact that a system of multi-variate max-algebraic polynomial equalities can be transformed into an Extended Linear Complementarity Problem to nd all equivalent minimal state space realizations of a multiple ...

2006
Harold Bennett David Lutzer

In this paper we give an example of a countably-based algebraic domain D such that max(D) is Hausdorff but not regular in the relative Scott topology, and such that max(D) contains the usual space of rational numbers as a closed subspace. Our example shows that certain known results about max(D), where max(D) is regular and D is countably based, are the sharpest possible. MR Classifications: pr...

1995
B. De Schutter B. De Moor Bart De Schutter Bart De Moor

The topic of this paper is the (partial) minimal realization problem in the max algebra, which is one of the modeling frameworks that can be used to model discrete event systems. We use the fact that a system of multivariate max-algebraic polynomial equalities can be transformed into an Extended Linear Complementarity Problem to find all equivalent minimal state space realizations of a multiple...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 2007
Francesca D Frentiu Gary D Bernard Cristina I Cuevas Marilou P Sison-Mangus Kathleen L Prudic Adriana D Briscoe

Butterflies and primates are interesting for comparative color vision studies, because both have evolved middle- (M) and long-wavelength- (L) sensitive photopigments with overlapping absorbance spectrum maxima (lambda(max) values). Although positive selection is important for the maintenance of spectral variation within the primate pigments, it remains an open question whether it contributes si...

Collecting information on suspended sediments concentration (SSC) in coastal waters and estuaries is vital for proper management of coastal environments. Traditionally, SSC used to be measured by time consuming and costly point measurements. This method allows the accurate measurement of SSC only for a point in space and time. Remote sensing from air-borne and space-borne sensors have proved to...

Journal: :Discrete Optimization 2007
Alex D. Scott Gregory B. Sorkin

The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we present an O(nr)-time algorithm which is the fastest polynomialspace algorithm for many problems in the class, including Max Cut. The method also proves a treewidth bound tw(G) ≤ (13/75 + o(1))m, which...

Journal: :Discrete Event Dynamic Systems 1996
Bart De Schutter Bart De Moor

In this paper we show that finding solutions of a system of multivariate polynomial equalities and inequalities in the max algebra is equivalent to solving an Extended Linear Complementarity Problem. This allows us to find all solutions of such a system of multivariate polynomial equalities and inequalities and provides a geometrical insight in the structure of the solution set. We also demonst...

2011
Timothy Arthur Mann Yoonsuck Choe

Recent Reinforcement Learning (RL) algorithms, such as RMAX, make (with high probability) only a small number of poor decisions. In practice, these algorithms do not scale well as the number of states grows because the algorithms spend too much effort exploring. We introduce an RL algorithm State TArgeted R-MAX (STAR-MAX) that explores a subset of the state space, called the exploration envelop...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید