Generalized Dini theorems for nets of functions on arbitrary sets

We characterize the uniform convergence of pointwise monotonic nets of bounded real functions defined on arbitrary sets, without any particular structure. The resulting condition trivially holds for the classical Dini theorem. Our vector-valued Dini-type theorem characterizes the uniform convergence of pointwise monotonic nets of functions with relatively compact range in Hausdorff topological ordered vector spaces. As a consequence, for such nets of continuous functions on a compact space, we get the equivalence between the pointwise and the uniform convergence. When the codomain is locally convex, we also get the equivalence between the uniform convergence and the weak-pointwise convergence; this also merges the Dini-Weston theorem on the convergence of monotonic nets from Hausdorff locally convex ordered spaces. Most of our results are free of any structural requirements on the common domain and put compactness in the right place: the range of the functions.     

L-fuzzy拓扑空间中的相对良紧性

The concept of relative N-compactness is defined and characterized in terms of nets. It is shown that the relative N-compactness is hereditary with respect to L-fuzzy sets and the relative N-compactness is L-good extension. Some connections between the N- compactness and the relative N-compactness are investigated. It is also proved that induced relative N-compact spaces are productive, and the product of finite relative compact sets is relative compact.     

Extensions and new observations of Tychonoff,Stone-Weierstrass theorems,compactifications and the realcompactification

An extension of the Tychonoff theorem is obtained in characterizing a compact space by the nets and the images induced by any family of continuous functions on it. The idea of this extension is applied to get a new process and new observations of compactifications and the realcompactification. Finally, a sufficient and necessary condition of a vector sublattice or a subalgebra of C¹(X) to be dense in (C¹(X),∥·∥) is provided in terms of the nets in X induced by C¹(X), where C¹(X) is the space of all bounded real continuous functions on a topological space X with pointwise ordering, and ∥·∥ is the supremum norm.     

A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications

Coalitional games raise a number of important questions from the point of view of computer science, key among them being how to represent such games compactly, and how to efficiently compute solution concepts assuming such representations. Marginal contribution nets (MC‐nets), introduced by Ieong and Shoham, are one of the simplest and most influential representation schemes for coalitional games. MC‐nets are a rulebased formalism, in which rules take the form pattern → value, where “pattern ” is a Boolean condition over agents, and “value ” is a numeric value. Ieong and Shoham showed that, for a class of what we will call “basic” MC‐nets, where patterns are constrained to be a conjunction of literals, marginal contribution nets permit the easy computation of solution concepts such as the Shapley value. However, there are very natural classes of coalitional games that require an exponential number of such basic MC‐net rules. We present read‐once MC‐nets, a new class of MC‐nets that is provably more compact than basic MC‐nets, while retaining the attractive computational properties of basic MC‐nets. We show how the techniques we develop for read‐once MC‐nets can be applied to other domains, in particular, computing solution concepts in network flow games on series‐parallel networks (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Vitali's and Harnack's type results for vector-valued functions

In this brief note, we extend Vitali's theorem for holomorphic functions obtained by Arendt and Nikolski to nets of functions of sheaves of smooth vector-valued functions. As a consequence we also extend a Harnack's theorem for compact operator-valued harmonic functions recently obtained by Enflo and Smithies to bounded operator-valued harmonic functions, avoiding the assumption that the Hilbert space H where the operators are defined is separable.     

Visible acyclic differential nets, Part I: Semantics

We give a geometric condition that characterizes the differential nets having a finitary interpretation in finiteness spaces: visible acyclicity. This is based on visible paths, an extension to differential nets of a class of paths we introduced in the framework of linear logic nets. The characterization is then carried out as follows: the differential nets having no visible cycles are exactly those whose interpretation is a finitary relation. Visible acyclicity discloses a new kind of correctness for the promotion rule of linear logic, which goes beyond sequent calculus correctness.     

Fluid stochastic Petri nets: Theory,applications, and solution techniques

In this paper we introduce a new class of stochastic Petri nets in which one or more places can hold fluid rather than discrete tokens. We define a class of fluid stochastic Petri nets in such a way that the discrete and continuous portions may affect each other. Following this definition we provide equations for their transient and steady-state behavior. We present several examples showing the utility of the construct in communication network modeling and reliability analysis, and discuss important special cases. We then discuss numerical methods for computing the transient behavior of such nets. Finally, some numerical examples are presented and evidence of the accuracy of the fluid approximation is given.     

SimHPN: A MATLAB toolbox for simulation, analysis and design with hybrid Petri nets

This paper presents a MATLAB embedded package for hybrid Petri nets called SimHPN. It offers a collection of tools devoted to simulation, analysis and synthesis of dynamical systems modeled by hybrid Petri nets. The package supports several server semantics for the firing of both, discrete and continuous, types of transitions. Besides providing different simulation options, SimHPN offers the possibility of computing steady state throughput bounds for continuous nets. For such a class of nets, optimal control and observability algorithms are also implemented. The package is fully integrated in MATLAB which allows the creation of powerful algebraic, statistical and graphical instruments that exploit the routines available in MATLAB.     

On the Fell topology

Let 2 ^X denote the closed subsets of a Hausdorff topological space <X, {gt}>. The Fell topology τ_F on 2 ^X has as a subbase all sets of the form {A ∈ 2 ^X :A ∩V ≠ 0}, whereV is an open subset ofX, plus all sets of the form {A ∈ 2 ^X :A ?W}, whereW has compact complement. The purpose of this article is two-fold. First, we characterize first and second countability for τ_F in terms of topological properties for τ. Second, we show that convergence of nets of closed sets with respect to the Fell topology parallels Attouch-Wets convergence for nets of closed subsets in a metric space. This approach to set convergence is highly tractable and is well-suited for applications. In particular, we characterize Fell convergence of nets of lower semicontinuous functions as identified with their epigraphs in terms of the convergence of sublevel sets.     

Nets of Order p2 and Degree p+1 Admitting SL (2, p)

In this article we study nets of order p² and degree p+1 with p a prime that admit a collineation group G with a point-regular normal subgroup T such that G/T SL(2,p) and classify them. The nets are regulus nets, twisted cubic nets, and three exceptional nets R_p for p {2,3,5}.     

Duality theory and propagation rules for higher order nets

Higher order nets and sequences are used in quasi-Monte Carlo rules for the approximation of high dimensional integrals over the unit cube. Hence one wants to have higher order nets and sequences of high quality.In this paper we introduce a duality theory for higher order nets whose construction is not necessarily based on linear algebra over finite fields. We use this duality theory to prove propagation rules for such nets. This way we can obtain new higher order nets (sometimes with improved quality) from existing ones. We also extend our approach to the construction of higher order sequences.     

Asymptotically absorbing nets of positive operators

This paper is devoted to asymptotically absorbing operator nets. The study of such nets has attracted an attention in [19, 20] in connection with the notion of the Lotz ?? R?biger nets on a Banach space which had been studied recently in [4, 8, 9, 18?C20]. In the present paper, we focus mainly on the case of nets of positive linear operators.     

A combinatorial characterization of (t,m,s)-nets in base b

We consider (t,m,s)-nets in base b, which were introduced by Niederreiter in 1987. These nets are highly uniform point distributions in s-dimensional unit cubes and have applications in the theory of numerical integration and pseudorandom number generation. A central question in their study is the determination of the parameter values for which these nets exist. Niederreiter has given several methods for their construction, all of which are based on a general construction principle from his 1987 paper. We define a new family of combinatorial objects, the so-called “generalized orthogonal arrays,” and then discuss a combinatorial characterization of (t.m.s)-nets in base b in terms of these generalized orthogonal arrays. Using this characterization, we describe a new method for constructing (t.m.s)-nets in base b that is not based on the aforementioned construction principle. This method gives rise to some very general conditions on the parameters (involving a link with the theory of orthogonal arrays) that are sufficient to ensure the existence of a (t.m.s)-net in base b. In this way we construct many nets that are new. © 1996 John Wiley & Sons, Inc.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

The Conjugate Nets, Cartan Submanifolds, and Laplace Transformations in Space Forms

In this paper we establish the geometric theory of conjugate nets, Cartan submanifolds, and Laplace transformations in sphere and pseudo-sphere spaces. The corresponding theory in cases of projective and Euclidean spaces has been established by Chern, Kamran and Tenenblat.     

Numerical investigation of finite-source multiserver systems with different vacation policies

Systems with vacations are usually modeled and analyzed by queueing theory, and almost all works assume that the customer source is infinite and the arrival process is Poisson. This paper aims to present an approach for modeling and analyzing finite-source multiserver systems with single and multiple vacations of servers or all stations, using the Generalized Stochastic Petri nets model. We show how this high level formalism, allows a simple construction of detailed and compact models for such systems and to obtain easily the underlying Markov chains. However, for real vacation systems, the models may have a huge state space. To overcome this problem, we give the algorithms for automatically computing the infinitesimal generator, for the different vacation policies. In addition, we develop the formulas of the main exact stationary performance indices. Through numerical examples, we discuss the effect of server number, vacation rate and vacation policy on the system’s performances.     

Covering properties on X2⧹Δ, W-sets,and compact subsets of Σ-products

Let Δ ? X¹ be the diagonal. In the first part of this paper, we show that a compact space X is Corson compact (resp., Eberlein compact; compact metric) if and only if X²?Δ is metalindelöf (resp., σ-metacompact; paracompact). In the second part of the paper, we investigate the notion of a W-set in a space X, which is defined in terms of an infinite game. We show that a compact space X is Corson compact if and only if X has a W-set diagonal, and that a compact scattered space X is strong Eberlein compact if and only if each point of X is a W-set in X.     

Nets, lattices, and multicomponent KP hierarchies

We review some recent discoveries concerning the relation of geometric nets and lattices to the theory of the KP hierarchy. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 122, No. 2, pp. 272–283, February, 2000.     

Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration

In this paper we study quasi-Monte Carlo integration of smooth functions using digital nets. We fold digital nets over ${\mathbb{Z}}_b$ by means of the $b$-adic tent transformation, which has recently been introduced by the authors, and employ such folded digital nets as quadrature points. We first analyze the worst-case error of quasi-Monte Carlo rules using folded digital nets in reproducing kernel Hilbert spaces. Here we need to permit digital nets with “infinite digit expansions”, which are beyond the scope of the classical definition of digital nets. We overcome this issue by considering the infinite product of cyclic groups and the characters on it. We then give an explicit means of constructing good folded digital nets as follows: we use higher order polynomial lattice point sets for digital nets and show that the component-by-component construction can find good folded higher order polynomial lattice rules that achieve the optimal convergence rate of the worst-case error in certain Sobolev spaces of smoothness of arbitrarily high order.     

Fixed point theorems for discontinuous mapping

We prove a generalization of Brouwer's famous fixed point theorem to discontinuous maps. The main result shows that for discontinuous functions on a compact convex domainX one can always find a pointx X such that x–f(x) is less than a certain measure of discontinuity. Applications to artificial neural nets, economic equilibria and analysis are given.