Geometric construction of association schemes from non-degenerate quadrics

LetF _q be a finite field withq elements, whereq is a power of an odd prime. In this paper, we assume that δ=0,1 or 2 and consider a projective spacePG(2ν+δ,F _q ), partitioned into an affine spaceAG(2ν+δ,F _q ) of dimension 2ν+δ and a hyperplaneℋ=PG(2ν+δ−1,F _q ) of dimension 2ν+δ−1 at infinity. The points of the hyperplaneℋ are next partitioned into three subsets. A pair of pointsa andb of the affine space is defined to belong to classi if the line meets the subseti of ℋ. Finally, we derive a family of three-class association schemes, and compute their parameters. This project is supported by the National Natural Science Foundation of China (No. 19571024).     

Characterizations of wreath products of one-class association schemes

In this paper we show that the wreath product of one-class association schemes is characterized by the algebraic structure of its Bose-Mesner algebra.     

On higher indicators of regular association schemes

In the present paper, we will define the higher Frobenius–Schur indicators and the higher indicators of association schemes as a generalization of those of finite groups. The higher indicators of any association scheme are always positive rational numbers. Especially, for any positive integer $n$, the $n$th indicator of any regular association scheme is the number of relations such that its strong girth divides $n$. Thus, all higher indicators of any regular association scheme are natural numbers, and the sequence of the indicators is periodic. We will show that the converses of these facts are also true for finite exponent association schemes. Finally, we introduce a family of infinite exponent association schemes all higher indicators of which are natural numbers and the sequence of the indicators of which is periodic.     

On IP-graphs of association schemes and applications to group theory

Let G be a group acting transitively on a set X such that all subdegrees are finite. Isaacs and Praeger (1993) [5] studied the common divisor graph of (G,X). For a group G and its subgroup A, based on the results in Isaacs and Praeger (1993) [5], Kaplan (1997) [6] proved that if A is stable in G and the common divisor graph of (A,G) has two components, then G has a nice structure. Motivated by the notion of the common divisor graph of (G,X), Camina (2008) [3] introduced the concept of the IP-graph of a naturally valenced association scheme. The common divisor graph of (G,X) is the IP-graph of the association scheme arising from the action of G on X. Xu (2009) [8] studied the properties of the IP-graph of an arbitrary naturally valenced association scheme, and generalized the main results in Isaacs and Praeger (1993) [5] and Camina (2008) [3]. In this paper we first prove that if the IP-graph of a naturally valenced association scheme (X,S) is stable and has two components (not including the trivial component whose only vertex is 1), then S has a closed subset T such that the thin residue O?(T) and the quotient scheme (X/O?(T),S//O?(T)) have very nice properties. Then for an association scheme (X,S) and a closed subset T of S such that S//T is an association scheme on X/T, we study the relations between the closed subsets of S and those of S//T. Applying these results to schurian schemes and common divisor graphs of groups, we obtain the results of Kaplan [6] as direct consequences.     

Geometric construction of some families of two-class and three-class association schemes from nondegenerate quadrics in characteristic two

1.IntroductionThetheoryoflinearspacesintriteprojectivegeometryhasbeenusedbyseveralauthorsinconstructingBIBandPBIBdesigns.BoseI21firstusedthepropertiesofquadricsurfaCesinfiniteprojectivegeometryoftwoandthreedimensionsforconstr-netingexperimelltaldesigns.D.K.Ray-Chaudhurils]usedthegeometryofquadricstoconstructseveralseriesofPBIBdesignswithtwoassociateclasses.I.M.Chakravartila]usednondegenerateanddegenerateHebotianvarietiestoconstructsomefamiliesoftwo-classandthree-classassociationschemes…     

Optimality conditions for vector optimization problems with variable ordering structures

Our main concern in this article are concepts of nondominatedness w.r.t. a variable ordering structure introduced by Yu [P.L. Yu, Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives, J. Optim. Theory Appl. 14 (1974), pp. 319–377]. Our studies are motivated by some recent applications e.g. in medical image registration. Restricting ourselves to the case when the values of a cone-valued map defining the ordering structure are Bishop–Phelps cones, we obtain for the first time scalarizing functionals for nondominated elements, Fermat rule, Lagrange multiplier rule and duality results for a single- or set-valued vector optimization problem with a variable ordering structure.     

Characters of table algebras and applications to association schemes

Hanaki [A. Hanaki, Representations of association schemes and their factor schemes, Graphs Combin. 19 (2003) 195-201; A. Hanaki, Characters of association schemes and normal closed subsets, Graphs Combin. 19 (2003) 363-369] generalized many properties of characters of finite groups to characters of association schemes. In this paper we show that many of these properties also hold for table algebras. Our approach is not to generalize the proofs in [A. Hanaki, Representations of association schemes and their factor schemes, Graphs Combin. 19 (2003) 195-201; A. Hanaki, Characters of association schemes and normal closed subsets, Graphs Combin. 19 (2003) 363-369] to table algebras, but to prove many stronger properties, and then obtain results in [A. Hanaki, Representations of association schemes and their factor schemes, Graphs Combin. 19 (2003) 195-201; A. Hanaki, Characters of association schemes and normal closed subsets, Graphs Combin. 19 (2003) 363-369] as direct consequences.     

A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures

This paper investigates some properties of approximate efficiency in variable ordering structures where the variable ordering structure is given by a special set valued map. We characterize $\epsilon$-minimal and $\epsilon$- nondominated elements as approximate solutions of a multiobjective optimization problem with a variable ordering structure and give necessary and sufficient conditions for these solutions, via scalarization.     

带有变量选择过程的分类模型误差分析

偏倚一方差分析方法是在模型选择过程中权衡模型对现有样本解释程度和未知样本估计准确度的分析方法,目的是使选定的模型检验误差尽量小.在分类或回归过程中进行有效的变量筛选可以获得更准确的模型表达,但也会因此带来一定误差.提出"选择误差"的概念,用于刻画带有变量选择的分类问题中由于变量的某种选择方法所引起的误差.将分类问题的误差分解为偏倚—方差—选择误差进行研究,考察偏倚、方差和选择误差对分类问题的总误差所产生的影响.     

The partial adjustment valuation approach with dynamic and variable speeds of adjustment to evaluating and measuring the business value of information technology

In this paper we develop the partial adjustment valuation approach in which the speeds of (partial) adjustment are assumed to be dynamic and variable, rather than fixed or constant, to assessing the value of information technology (IT). The speeds of adjustment are a function of a set of macroeconomic and/or microeconomic variables, observed and unobserved and, hence, become time-varying or dynamic and variable over time. The approach is illustrated by a practical application. The results imply that the constant speeds of adjustment may overestimate or underestimate the actual speeds of adjustment and, accordingly, may miscalculate the values of performance metrics. Thus, the partial adjustment valuation approach with dynamic and variable speeds of adjustment is more realistic and, more importantly, captures the changing patterns and trends of the adjustment speeds and the performance measures as well. As such, the partial adjustment valuation approach with constant speeds of adjustment fails to adequately explain the dynamic production process of a decision making unit. The empirical evidence also conflicts with the lopsided view that the productivity paradox does not exist in developed countries.     

Exact solutions of nonlinear evolution equations with variable coefficients using exp-function method

In this paper, we apply the exp-function method to construct generalized solitary and periodic solutions of nonlinear evolution equations with variable coefficients. The proposed technique is tested on the Zakharov-Kuznetsov and (2+1)-dimensional Broer-Kaup equations with variable coefficients. These equations play a very important role in mathematical physics and engineering sciences. The suggested algorithm is quite efficient and is practically well suited for use in these problems. Obtained results clearly indicate the reliability and efficiency of the proposed exp-function method.     

Uniform stabilization of the damped Cauchy-Ventcel problem with variable coefficients and dynamic boundary conditions

In this paper, the uniform stabilization of the Cauchy-Ventcel problem with variable coefficients is considered, and the uniform energy decay rate for the problem is established by Riemannian geometry methods.     

Modelling and optimization of reservoirs for long-term regulation with variable head using functional analysis

In this paper, functional analysis and minimum norm formulation are applied to maximize the total benefits from two hydro reservoirs. The hydroelectric power generation is treated as a nonlinear function; water head variation and stochasticity of the river flows are included. The resulting problem has a nonlinear objective function and linear constraints. The proposed method is computationally efficient, compared to previous techniques. Numerical results are presented for widely different water conditions for an actual system in operation.This work was supported by the National Research Council of Canada, Grant No. A4146. The authors wish to thank B. C. Hydro for providing the reservoir data.     

Control of linear processes with distributed lags using dynamic programming from first principles

A simple dynamic programming argument is presented for the quadratic-cost controller synthesis problem for discrete-time linear processes with delay. Distributed delays are allowed in both state and control. The solution obtained has a discrete-time Riccati difference structure closely analogous to the Riccati differential structure associated with delay problems in continuous time. Extensions are provided for the cases of varying lag-limits, performance criterion dependent on past variables, and the time-invariant regulator problem. A feedback solution is also obtained for a continuous-time problem with distributed delays in the control, by passage to limit from the discrete results.This work was supported by the Operations Research Center, University of California, Berkeley, California, under NSF Grant No. GP-30961X2. The author would like to thank Professor S. E. Dreyfus for guidance and helpful suggestions.