Extremal Problems in the Class of Delta-Subharmonic Functions of Finite Order in a Half-Plane

We obtain exact lower bounds of the upper limits of ratios of the Nevanlinna characteristics of a delta-subharmonic function in the upper half-plane.     

基于CA的流量查询和预警系统

针对CERNET的计费策略 ,设计并实现了一个地区中心级的用户国际流量查询和预警系统 .该系统采用CA证书支持交互以保证信息和系统的安全 ,并采用柔性模型支持用户个性化的流量自动报警 ,在最大程度上保证了用户的利益以及网络的安全     

柱形波导中波型的正交性研究

由二维格林恒等式推证了柱形波导中本征函数及其导数及场分量的正交性.无论是本征函数之间或是场分量之间,都存在着一定的正交关系.     

Nonconvex separation theorems and some applications in vector optimization

Separation theorems for an arbitrary set and a not necessarily convex set in a linear topological space are proved and applied to vector optimization. Scalarization results for weakly efficient points and properly efficient points are deduced.     

向量优化中广义E-Benson真有效解的代数性质

利用代数内部和代数闭包等工具,在适当的广义凸性条件下研究了集值向量优化问题广义E-Benson真有效解的一些代数性质,建立了广义E-Benson真有效解的线性标量化结果、拉格朗日乘子定理和鞍点定理.     

Simulation of the interaction of light with 3-D metallic nanostructures using a proper orthogonal decomposition-Galerkin reduced-order discontinuous Galerkin time-domain method

In this artice, we report on a reduced-order model (ROM) based on the proper orthogonal decomposition (POD) technique for the system of 3-D time-domain Maxwell's equations coupled to a Drude dispersion model, which is employed to describe the interaction of light with nanometer scale metallic structures. By using the singular value decomposition (SVD) method, the POD basis vectors are extracted offline from the snapshots produced by a high order discontinuous Galerkin time-domain (DGTD) solver. With a Galerkin projection and a second order leap-frog (LF₂) time discretization, a discrete ROM is constructed. The stability condition of the ROM is then analyzed. In particular, when the boundary is a perfect electric conductor condition, the global energy of the ROM is bounded, which is consistent with the characteristics of global energy in the DGTD method. It is shown that the ROM based on Galerkin projection can maintain the stability characteristics of the original high dimensional model. Numerical experiments are presented to verify the accuracy, demonstrate the capabilities of the POD-based ROM and assess its efficiency for 3-D nanophotonic problems.     

A REGULAR VALUE OF COMPACT DEFORMATION

Sufficient conditions were given to assert that between any two Banach spaces over K, Fredholm mappings share at least one value in a specific open ball. The proof of the result is constructive and based upon continuation methods.     

�������ֲ������¶�Ԫ����ģ���к����������

In Bayesian analysis, the Markov Chain Monte Carlo (MCMC) algorithm is an efficient and simple method to compute posteriors. However, the chain may appear to converge while the posterior is improper, which will leads to incorrect statistical inferences. In this paper, we focus on the necessary and sufficient conditions for which improper hierarchical priors can yield proper posteriors in a multivariate linear model. In addition, we carry out a simulation study to illustrate the theoretical results, in which the Gibbs sampling and Metropolis-Hasting sampling are employed to generate the posteriors.     

Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree

For graphs G and H , an H‐coloring of G is a map from the vertices of G to the vertices of H that preserves edge adjacency. We consider the following extremal enumerative question: for a given H , which connected n‐vertex graph with minimum degree δ maximizes the number of H‐colorings? We show that for nonregular H and sufficiently large n , the complete bipartite graph is the unique maximizer. As a corollary, for nonregular H and sufficiently large n the graph is the unique k‐connected graph that maximizes the number of H‐colorings among all k‐connected graphs. Finally, we show that this conclusion does not hold for all regular H by exhibiting a connected n‐vertex graph with minimum degree δ that has more ‐colorings (for sufficiently large q and n ) than .     

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Consider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v. Let us then consider a stronger requirement and suppose we wish to distinguishing adjacent vertices by sums of their incident colors. In both problems the challenging conjectures presume that such colorings exist for any graph G containing no isolated edges if only . We prove that in both problems is sufficient. The proof is based on the Combinatorial Nullstellensatz, applied in the “sum environment.” In fact the identical bound also holds if we use any set of k real numbers instead of as edge colors, and the same is true in list versions of the both concepts. In particular, we therefore obtain that lists of length ( in fact) are sufficient for planar graphs.