首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
It is shown that the design of some inventory structures such as critical protective items for local emergency response elements, or selection of some types of sports team (e.g. baseball, cricket), is appropriately formulated as the selection of an optimal set of options over multiple criteria. This paper examines the problem of defining what might constitute optimum sets under such conditions. Noting that options may be characterised with data of various scale types, the paper introduces a number of different policies for optimality appropriate to the different scale types, and derives closed expressions that implement the various policies. It is shown that simply choosing the best individual options to construct a preferred team is likely to be sub-optimal particularly if the policy is hard to meet. This result is shown to be robust over data structures and data scale types. Managerial implications are briefly considered.  相似文献   

2.
In this paper we propose and evaluate an evolutionary-based hyper-heuristic approach, called EH-DVRP, for solving hard instances of the dynamic vehicle routing problem. A hyper-heuristic is a high-level algorithm, which generates or chooses a set of low-level heuristics in a common framework, to solve the problem at hand. In our collaborative framework, we have included three different types of low-level heuristics: constructive, perturbative, and noise heuristics. Basically, the hyper-heuristic manages and evolves a sophisticated sequence of combinations of these low-level heuristics, which are sequentially applied in order to construct and improve partial solutions, i.e., partial routes. In presenting some design considerations, we have taken into account the allowance of a proper cooperation and communication among low-level heuristics, and as a result, find the most promising sequence to tackle partial states of the (dynamic) problem. Our approach has been evaluated using the Kilby’s benchmarks, which comprise a large number of instances with different topologies and degrees of dynamism, and we have compared it with some well-known methods proposed in the literature. The experimental results have shown that, due to the dynamic nature of the hyper-heuristic, our proposed approach is able to adapt to dynamic scenarios more naturally than low-level heuristics. Furthermore, the hyper-heuristic can obtain high-quality solutions when compared with other (meta) heuristic-based methods. Therefore, the findings of this contribution justify the employment of hyper-heuristic techniques in such changing environments, and we believe that further contributions could be successfully proposed in related dynamic problems.  相似文献   

3.
We find a formula for the sum of the first n squares:Sn = 12 22 32 42 … n2.We haveS1 = 1, S2 = 12 22 = 5, S3 = l2 22 32 = 14,S4 = 30, S5 = 55, S6 = 91.and so on. To make things a little simpler, we will also use the sum of the squares of the first zero terms , S0 = 02 = 0. Arranging these values in a table,we find thatSince the third differenes △3Sn are constant,these data values must follow a cubic pattern;that is, the formula for the sum of the squares of the first n integers is a cubic function,  相似文献   

4.
5.
This paper investigates the problem of the growth of the components of meromorphic solutions of a class of a system of complex algebraic differential equations, and generalized some of N. Toda's results concerning the growth of differential equations to the case of systems of differential equations. The paper considers the existence of admissible solutions of the system of differential equations.  相似文献   

6.
James P. Cossey 《代数通讯》2013,41(11):3972-3979
If G is a group of odd order and χ ∈ Irr(G) lifts an irreducible Brauer character ?, then we associate to χ a canonical pair (Q, δ) up to G-conjugacy, where Q is a vertex of ? and δ ∈ Irr(Q) is a linear character of Q. We show that (Q, δ) is a Navarro vertex for χ. We also discuss examples.  相似文献   

7.
In this paper, using capacity theory and extension theorem of Lipschitz functions we first discuss the uniqueness of weak solution of nonhomogeneous quasilinear elliptic equationsin space W(θ,p)(Ω), which is bigger than W1,p(Ω). Next, using revise reverse Holder inequality we prove that if ωc is uniformly p-think, then there exists a neighborhood U of p, such that for all t ∈U, the weak solutions of equation corresponding t are bounded uniformly. Finally, we get the stability of weak solutions on exponent p.  相似文献   

8.
We establish upper bounds for a group of *-deviations of Faber sums on the classes of -integrals in a complex plane introduced by Stepanets.Translated from Ukrainskyi Matematychnyi Zhurnal, Vol. 56, No. 4, pp. 451–461, April, 2004.  相似文献   

9.
DynamicsofPolynomialAutomorphismsofC~N¥ZhangWenjun(HenanUniversity,Kaifeng,P.R.Chian,475001)Abstract:Thispaperisassignedtodis?..  相似文献   

10.
We consider the wave equation defined on Ω?R2 and ω?Ω. We designate by vω the distributed control of minimal L2(ω×(0,T)) norm obtained with the Hilbert Uniqueness Method which stabilizes the system at time T>0. This Note addresses the question of the optimal position of ω in order to minimize J:ω6vω6L2(ω×(0,T)). Assuming ωC1,1(Ω), we express the shape derivative of J as a curvilinear integral on ?ω (independently of any adjoint solution) leading to a descent algorithm. A numerical application is given. To cite this article: A. Münch, C. R. Acad. Sci. Paris, Ser. I 343 (2006).  相似文献   

11.
12.
We compute the n-level correlation of normalized nontrivial zeros of a product of L-functions:L(s,π1)···L(s,πk), where πj, j=1,...,k, are automorphic cuspidal representations of GLmj(QA). Here the sizes of the groups GLmj(QA) are not necessarily the same. When these L(s,πj) are distinct, we prove that their nontrivial zeros are uncorrelated, as predicted by random matrix theory and verified numerically. When L(s,πj) are not necessarily distinct, our results will lead to a proof that the n-level correlation of normalized nontrivial zeros of the product L-function follows the superposition of Gaussian Unitary Ensemble (GUE) models of individual L-functions and products of lower rank GUEs. The results are unconditional when m1,...,mk 4,but are under Hypothesis H in other cases.  相似文献   

13.
1. Introduction A theorem of Carleson,as generalized by Duren characterizes those positive measure μ on the unit disc U={z∈C:|z|<1} for which the H~p norm domiates the L~q(μ) norm of elements of H~p. Later on, Hasting proved an analogous results with H~p replaced by A~p, the Bergman space of fuctions f  相似文献   

14.
The purpose of this paper is to describe the complexity of models by theirdegrees of unsolvability,J.Richter defined the degree of a structure to be deg ()=sup{deg(),deg(R_i),i=1,…,n},Where is a model for afinite language L={R_i,i=1,…,n}and the universe of is a subset of ω. Shepointed out that, according to her definition, there can be models which areisomorphic but their degrees are different.Also,her discussions are restricted tofinite languages and models whose universes are subsets of ω.  相似文献   

15.
16.
Two new kinds of direct product of matrices are defined. Their properties are investigated. Direct products of matrix and set of continuous functions are also defined. Many complete sets of orthogonal functions, such as those sets given by Walsh [2], Paley [3], Chrestenson[4], and Watari [5], may be generated by these newkinds of direct product. Direct products are also applicable to the generation of sets of piecewise orthogonal functions.  相似文献   

17.
In this paper, we study the orthogonality graphs (see Definition 1.2) of ortholattices. We provide a graph theoretic condition for an ortholattice to be orthomodular. We prove that, the orthogonality graphs of two orthomodular lattices are isomorphic if and only if the lattices are isomorphic. As an application, it is proved that the zero-divisor graph of a Rickart ?-ring is obtained by successively duplicating the vertices of the orthogonality graph of the lattice of projections in the ring. We characterize the finite Rickart ?-rings for which the orthogonality graph of projections is connected.  相似文献   

18.
We consider the problem of efficient estimation of tail probabilities of sums of correlated lognormals via simulation. This problem is motivated by the tail analysis of portfolios of assets driven by correlated Black-Scholes models. We propose two estimators that can be rigorously shown to be efficient as the tail probability of interest decreases to zero. The first estimator, based on importance sampling, involves a scaling of the whole covariance matrix and can be shown to be asymptotically optimal. A further study, based on the Cross-Entropy algorithm, is also performed in order to adaptively optimize the scaling parameter of the covariance. The second estimator decomposes the probability of interest in two contributions and takes advantage of the fact that large deviations for a sum of correlated lognormals are (asymptotically) caused by the largest increment. Importance sampling is then applied to each of these contributions to obtain a combined estimator with asymptotically vanishing relative error.  相似文献   

19.
The subalgebra of the tautological ring of the moduli of curves of compact type generated by the κ classes is studied in all genera. Relations, constructed via the virtual geometry of the moduli of stable quotients, are used to obtain minimal sets of generators. Bases and Betti numbers of the κ rings are computed. A universality property relating the higher genus κ rings to the genus 0 rings is proven using the virtual geometry of the moduli space of stable maps. The λg-formula for Hodge integrals arises as the simplest consequence.  相似文献   

20.
In general category, the group of self-equivalences of sum object can decompose as the product of its two subgroups under certain conditions and also several split short exact sequences are obtained. Subsequently, we apply the above results to the category of space under a space and get some results which are dual to those in fibrewise category.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号