Labeling graphs with two distance constraints

Given a graph G and integers p,q,d₁ and d₂, with p>q, d₂>d₁?1, an L(d₁,d₂;p,q)-labeling of G is a function f:V(G)→{0,1,2,…,n} such that |f(u)−f(v)|?p if d_G(u,v)?d₁ and |f(u)−f(v)|?q if d_G(u,v)?d₂. A k-L(d₁,d₂;p,q)-labeling is an L(d₁,d₂;p,q)-labeling f such that max_v∈V(G)f(v)?k. The L(d₁,d₂;p,q)-labeling number ofG, denoted by , is the smallest number k such that G has a k-L(d₁,d₂;p,q)-labeling. In this paper, we give upper bounds and lower bounds of the L(d₁,d₂;p,q)-labeling number for general graphs and some special graphs. We also discuss the L(d₁,d₂;p,q)-labeling number of G, when G is a path, a power of a path, or Cartesian product of two paths.     

Nearness approximation space based on axiomatic fuzzy sets

The approximation space model was originally proposed by Pawlak (1982) [19]. It was Or?owska who first observed that approximation spaces serves as a formal counterpart of perception, or observation [16, §2, p. 8], in which approximations provide a means of approximating one set of objects with another set of objects using the indiscernibility relation. Topology has been used to enrich the original model of an approximation space as well as more recent models of generalized approximation spaces. In this paper, an extension of th e topology neighborhood based on AFS (Axiomatic Fuzzy Sets) theory is introduced, and some interesting properties are given. Furthermore, a new generalized approximation space model is established with two application examples, which can be used to deal with information tables with many category features and viewed as a multi-granulations form of nearness approximation space models.     

Isomorphisms between C-ternary algebras

In this paper, we prove the Hyers-Ulam-Rassias stability of homomorphisms in C^∗-ternary algebras and of derivations on C^∗-ternary algebras for the following Cauchy-Jensen additive mappings:

(0.1)     

Large Fredholm triples

We give several equivalent condition for Busby extensions of a given algebra to be absorbing, considerably improving our earlier results [G.A. Elliott, D. Kucerovsky, An abstract Brown-Douglas-Fillmore absorption theorem, Pacific J. Math. 198 (2001) 385-409], and establish sufficient conditions for Fredholm triples to be absorbing in a suitable sense. As an application of one of our criteria, we prove a multivariable Brown-Douglas-Fillmore type theorem.     

Isomorphisms between unital C-algebras

It is shown that every almost linear bijection of a unital C^∗-algebra A onto a unital C^∗-algebra B is a C^∗-algebra isomorphism when h(n²uy)=h(n²u)h(y) for all unitaries u∈A, all y∈A, and n=0,1,2,…, and that almost linear continuous bijection of a unital C^∗-algebra A of real rank zero onto a unital C^∗-algebra B is a C^∗-algebra isomorphism when h(n²uy)=h(n²u)h(y) for all , all y∈A, and n=0,1,2,…. Assume that X and Y are left normed modules over a unital C^∗-algebra A. It is shown that every surjective isometry , satisfying T(0)=0 and T(ux)=uT(x) for all x∈X and all unitaries u∈A, is an A-linear isomorphism. This is applied to investigate C^∗-algebra isomorphisms between unital C^∗-algebras.     

An inventory control system for products with optional components under service level and budget constraints

Modularization and customization have made enterprises face the multi-item inventory problems and the interactions among those items. A powerful, affordable information technology system can make the continuous review inventory policy more convenient, efficient, and effective. In this study, a (Q, r) model is developed to find the optimal lot size and reorder point for a multi-item inventory with interactions between necessary and optional components. In order to accurately approximate costs, the service cost is introduced and defined in proportion to the service level. In addition, the service cost and purchasing cost are taken simultaneously, and are treated as a budget constraint for executives to consider because the firm’s strategy could influence the choice of service level. The proposed model is formulated as a nonlinear optimization problem, as the service level is nonlinear. Thus, some known procedures are revised to solve this problem and the results are compared with other models. The results show that the revised procedure performs better than the N–R procedure, leading to important insights about inventory control policy.     

Asymptotic behavior of spectral functions for elliptic operators with non-smooth coefficients

We consider the asymptotic formula of spectral functions for elliptic operators with non-smooth coefficients of order 2m in . If the coefficients of top order are Hölder continuous of exponent τ∈(0,1], we can derive the remainder estimate of the form O(t^(n−θ)/2m) with any θ∈(0,τ). This result holds without the condition 2m>n, which was always assumed in many papers. We also show that the spectral function is differentiable up to order <m.     

Skew exactness and range-kernel orthogonality II

The Fuglede property extends to ^∗-hyponormal Banach algebra elements, and certain Banach algebra elements are approximated by self-commutators.     

带非卷积核的分数次振荡积分算子及其交换子的加权有界性质——献给陆善镇教授75华诞

振荡积分算子的有界性质是调和分析研究的中心内容之一.本文建立一类由Ricci和Stein定义的带非卷积核的分数次振荡积分算子在加权Lebesgue空间中的有界性质.特别地,结合复分析和数学归纳等方法得到该类算子和有界平均振幅（BMO）函数生成交换子的加权有界性质.     

无界抽样情形下不定核的系数正则化回归

本文讨论样本依赖空间中无界抽样情形下最小二乘损失函数的系数正则化问题. 这里的学习准则与之前再生核Hilbert空间的准则有着本质差异: 核除了满足连续性和有界性之外, 不需要再满足对称性和正定性; 正则化子是函数关于样本展开系数的l²-范数; 样本输出是无界的. 上述差异给误差分析增加了额外难度. 本文的目的是在样本输出不满足一致有界的情形下, 通过l²-经验覆盖数给出误差的集中估计(concentration estimates). 通过引入一个恰当的Hilbert空间以及l²-经验覆盖数的技巧, 得到了与假设空间的容量以及与回归函数的正则性有关的较满意的学习速率.     

带非光滑核的奇异积分算子生成的多线性交换子在齐型空间的有界性

主要讨论带非光滑核的奇异积分算子T与函数b(b∈Lip_β)生成的多线性交换子是从L~p(X)到F_(p,A)~(mβ,∞)(X)有界的.     

The capacitated p-hub median problem with integral constraints: An application to a Chinese air cargo network

Consolidation at hubs in a pure hub-and-spoke network eliminates partial center-to-center direct loads, resulting in savings in transportation costs. In this research, we propose a general capacitated p-hub median model, with economies of scale and integral constraints on the paths. This model requires the selection of a specific p among a set of candidate hubs so that the total cost on the resulting pure capacitated hub-and-spoke network is minimized while simultaneously meeting origin–destination demands, operational capacity and singular path constraints. We explored the problem structure and developed a genetic algorithm using the path for encoding. This algorithm is capable of determining local optimality within less than 0.1% of the Lagrangian relaxation lower bounds on our Chinese air cargo network testing case and has reasonable computational times. The study showed that designating airports with high pickups or deliveries as hubs resulted in a high percentage of origin–destination pairs (ODs) in direct deliveries. Furthermore, the more hubs there are, the higher the direct share and the less likely for double rehandles. Sensitivity analysis on the discount rate showed that the economies of scale on trunk lines of hub-and-spoke networks may have a substantial impact on both the operating costs and the route patterns.     

Calculation of minimal capacity vectors through k minimal paths under budget and time constraints

Reducing the transmission time is an important issue for a flow network to transmit a given amount of data from the source to the sink. The quickest path problem thus arises to find a single path with minimum transmission time. More specifically, the capacity of each arc is assumed to be deterministic. However, in many real-life networks such as computer networks and telecommunication networks, the capacity of each arc is stochastic due to failure, maintenance, etc. Hence, the minimum transmission time is not a fixed number. Such a network is named a stochastic-flow network. In order to reduce the transmission time, the network allows the data to be transmitted through k minimal paths simultaneously. Including the cost attribute, this paper evaluates the probability that d units of data can be transmitted under both time threshold T and budget B. Such a probability is called the system reliability. An efficient algorithm is proposed to generate all of lower boundary points for (d, T, B), the minimal capacity vectors satisfying the demand, time, and budget requirements. The system reliability can then be computed in terms of such points. Moreover, the optimal combination of k minimal paths with highest system reliability can be obtained.     

Graph convergence for the H(·, ·)-accretive operator in Banach spaces with an application

In this paper, a concept of graph convergence concerned with the H(·, ·)-accretive operator is introduced in Banach spaces and some equivalence theorems between of graph-convergence and resolvent operator convergence for the H(·, ·)-accretive operator sequence are proved. As an application, a perturbed algorithm for solving a class of variational inclusions involving the H(·, ·)-accretive operator is constructed. Under some suitable conditions, the existence of the solution for the variational inclusions and the convergence of iterative sequence generated by the perturbed algorithm are also given.     

Analysis of an M/G/∞ queue with batch arrivals and batch-dedicated servers

We analyze an M/G/∞ queue with batch arrivals, where jobs belonging to a batch have to be processed by the same server. The number of jobs in the system is characterized as a compound Poisson random variable through a scaling of the original arrival and batch size processes.     

Labeling trees with a condition at distance two

An L(h,k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have labels which differ by at least k. The span of an L(h,k)-labeling is the difference between the largest and the smallest label. We investigate L(h,k)-labelings of trees of maximum degree Δ, seeking those with small span. Given Δ, h and k, span λ is optimal for the class of trees of maximum degree Δ, if λ is the smallest integer such that every tree of maximum degree Δ has an L(h,k)-labeling with span at most λ. For all parameters Δ,h,k, such that h<k, we construct L(h,k)-labelings with optimal span. We also establish optimal span of L(h,k)-labelings for stars of arbitrary degree and all values of h and k.     

‖A −1‖∞ and equidiagonal-dominance

In this paper, the matrix of equidiagonal-dominance is defined and several theorems about ‖A ⁻¹‖_∞ and its evaluation are established. Many interesting numerical examples are given. This work is supported by the National Natural Science Foundation of China and the Science Foundation of Academy of Engineering Physics of China