نتایج جستجو برای: global forcing set

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

2003
Sy D. Friedman

In this article we study the strength of Σ 1 3 absoluteness (with real parameters) in various types of generic extensions, correcting and improving some results from [2]. We shall also make some comments relating this work to the bounded forcing axioms BMM, BPFA and BSPFA. The statement " Σ 1 3 absoluteness holds for ccc forcing " means that if a Σ 1 3 formula with real parameters has a solutio...

Journal: :CoRR 2017
Boris Brimkov Caleb C. Fast Illya V. Hicks

Zero forcing is an iterative graph coloring process where at each discrete time step, a colored vertex with a single uncolored neighbor forces that neighbor to become colored. The zero forcing number of a graph is the cardinality of the smallest set of initially colored vertices which forces the entire graph to eventually become colored. Connected forcing is a variant of zero forcing in which t...

2006
EITAN TADMOR DONGMING WEI

We prove that the one-dimensional Euler-Poisson system driven by the Poisson forcing together with the usual γ-law pressure, γ ≥ 1, admits global solutions for a large class of initial data. Thus, the Poisson forcing regularizes the generic finite-time breakdown in the 2× 2 p-system. Global regularity is shown to depend on whether or not the initial configuration of the Riemann invariants and d...

1993
Jean-Jacques Lesage Jean-Marc Roussel

In 1987, the function chart "GRAFCET" was endowed with two new concepts intended to supplement the IEC 848 Standard : the macro-step and the forcing order. In this paper, our field of interest is the forcing order and more particularly the hierarchy between partial grafcets which is engendered. Initially, we describe the basic principles of the forcing order and of the hierarchical structure of...

2008
Clara Deser

We examine the relative roles of direct atmospheric radiative forcing (due to observed changes in well-mixed greenhouse gases, tropospheric and stratospheric ozone, sulfate and volcanic aerosols, and solar output) and observed sea surface temperature (SST) forcing of global atmospheric circulation trends during the second half of the 20 century using atmospheric general circulation modeling exp...

2007
X. Ma

A size-dependent sea salt aerosol parameterization was developed based on the piecewise log-normal approximation (PLA) for aerosol size distributions. Results of this parameterization from simulations with a global climate model produce good agreement with observations at the surface and for vertically-integrated volume size distributions. The global and annual mean of the sea salt burden is 10...

Journal: :MATEC web of conferences 2022

The controllability for complex network system is to find the minimum number of leaders achieve effective control global networks. In this paper, problem directed a family matrices carrying structure under hypercube considered. relationship between and signed zero forcing set established. networks obtained by computing graph.

2008
Antonio Di Nola George Georgescu Luca Spada

In this paper we study the notion of forcing for Lukasiewicz predicate logic ( L∀, for short), along the lines of Robinson’s forcing in classical model theory. We deal with both finite and infinite forcing. As regard to the former we prove a Generic Model Theorem for L∀, while for the latter, we study the generic and existentially complete standard models of L∀.

Journal: :shiraz journal of system management 0
somayeh molaei department of industrial engineering, amirkabir university of technology, iran, tehran mir mahdi seyed esfahani department of industrial engineering, amirkabir university of technology, iran, tehran akbar esfahanipour department of industrial engineering, amirkabir university of technology, iran, tehran

efficient and on-time maintenance plays a crucial role inreducing cost and increasing the market share of an industrial unit. preventivemaintenance is a broad term that encompasses a set of activitiesaimed at improving the overall reliability and availability of a systembefore machinery breakdown. the previous studies have addressed thescheduling of preventive maintenance. these studies have co...

2017
A. P. Santhakumaran P. Titus K. Ganesamoorthy K. GANESAMOORTHY

For a connected graph G = (V,E) of order at least two, a total detour monophonic set of a graph G is a detour monophonic set S such that the subgraph induced by S has no isolated vertices. The minimum cardinality of a total detour monophonic set of G is the total detour monophonic number of G and is denoted by dmt(G). A subset T of a minimum total detour monophonic set S of G is a forcing total...

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

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