关于药物对小鼠肝脏细胞色素P-450含量的影响实验结果的分析

肝药酶诱导剂苯巴比妥能诱导细胞色素P-450的合成,而肝药酶抑制剂放线菌素D能抑制细胞色素P-450的合成,本实验应用示差光谱法对P-450含量加以测定.本文改进了传统的计算药后诱导组和抑制组P-450含量增加或减少的百分比来评价药物的方法,在M athem atica数学软件环境下,对数据进行方差分析和t检验,提高了数据处理精度和可信度.并对原方法表示怀疑.     

The generalized hierarchical product of graphs

A generalization of both the hierarchical product and the Cartesian product of graphs is introduced and some of its properties are studied. We call it the generalized hierarchical product. In fact, the obtained graphs turn out to be subgraphs of the Cartesian product of the corresponding factors. Thus, some well-known properties of this product, such as a good connectivity, reduced mean distance, radius and diameter, simple routing algorithms and some optimal communication protocols, are inherited by the generalized hierarchical product. Besides some of these properties, in this paper we study the spectrum, the existence of Hamiltonian cycles, the chromatic number and index, and the connectivity of the generalized hierarchical product.     

On free products in varieties of associative algebras

Varieties of associative algebras over a field of characteristic zero are considered. Belov recently proved that, in any variety of this kind, the Hilbert series of a relatively free algebra of finite rank is rational. At the same time, for three important varieties, namely, those of algebras with zero multiplication, of commutative algebras, and of all associative algebras, a stronger assertion holds: for these varieties, formulas that rationally express the Hilbert series of the free product algebra via the Hilbert series of the factors are well known. In the paper, a system of counterexamples is presented which shows that there is no formula of this kind in any other variety, even in the case of two factors one of which is a free algebra. However, if we restrict ourselves to the class of graded PI-algebras generated by their components of degree one, then there exist infinitely many varieties for each of which a similar formula is valid. Translated fromMatematicheskie Zametki, Vol. 65, No. 5, pp. 693–702, May, 1999.     

泛系分析:数学·方法论·相对论·辩证思维

基于对广义系统、泛导、泛对称、泛箱原理、泛系相对性提出了新的分析模式与新的相对数学化的简化强化的定义 ,发展了泛系方法论与泛系相对论的框架与理法 ,具体内容涉及 :相对普适的数学化的泛系 ,2 0 0类对偶 ,对偶转化 ,泛对称转化 ,泛系辩证 ,八畴方法 ,泛系数学方法 ,广义量化 ,逼近转化原则 ,泛等价定理 ,供求分析 ,思维实验 ,广义灰色系统 ,等等·     

Transverse compression of PPTA fibers

Results of single transverse compression testing of PPTA and PIPD fibers, using a novel test device, are presented and discussed. In the tests, short lengths of single fibers are compressed between two parallel, stiff platens. The fiber elastic deformation is analyzed as a Hertzian contact problem. The inelastic deformation is analyzed by elastic-plastic FE simulation and by laser-scanning confocal microscopy of the compressed fibers ex post facto. The results obtained are compared to those in the literature and to the theoretical predictions of PPTA fiber transverse elasticity based on PPTA crystal elasticity.Presented at the 11th International Conference on Mechanics of Composite Materials (Riga, June 11–15, 2000).3TEX, Inc. 109, MacKenan Drive, Cary, North Carolina 27511, USA. Published in Mekhanika Kompozitnykh Materialov, Vol. 36, No. 4, pp. 533–544, March–April, 2000.     

众筹筑屋建设规划方案的优化

对某众筹筑屋建设规划项目方案根据国家房屋开发成本、收益、增值额、增值税、容积率、回报率等相关计算办法和要求进行了核算,对已知参筹者对各种房型的满意比例的情况下,以平均满意率最大为目标函数,建立整数线性规划模型,给出了各种房型的最优规划套数,且回报率达到建设规划执行要求.     

Mechanics of Delaminations in Laminate Composite Structures

A survey of the literature and state of the art of the mechanical aspects of delaminations in laminate composite structures is presented. Surface and internal delaminations of various origin, shape, and location are discussed. The origination, stability, and postcritical behavior of delaminations under quasi-static, cyclic, and dynamic loads are analyzed. Some problems for further investigations are discussed.     

Splitting up value: A critical review of residual income theories

This paper deals with the notion of residual income, which may be defined as the surplus profit that residues after a capital charge (opportunity cost) has been covered. While the origins of the notion trace back to the 19th century, in-depth theoretical investigations and widespread real-life applications are relatively recent and concern an interdisciplinary field connecting management accounting, corporate finance and financial mathematics (Peasnell, 1981, 1982; Peccati, 1987, 1989, 1991; Stewart, 1991; Ohlson, 1995; Arnold and Davies, 2000; Young and O’Byrne, 2001; Martin, Petty and Rich, 2003). This paper presents both a historical outline of its birth and development and an overview of the main recent contributions regarding capital budgeting decisions, production and sales decisions, implementation of optimal portfolios, forecasts of asset prices and calculation of intrinsic values. A most recent theory, the systemic-value-added approach (also named lost-capital paradigm), provides a different definition of residual income, consistent with arbitrage theory. Enfolded in Keynes’s (1936) notion of user cost and forerun by Pressacco and Stucchi (1997), the theory has been formally introduced in Magni (2000a,b,c; 2001a,b; 2003), where its properties are thoroughly investigated as well as its relations with the standard theory; two different lost-capital metrics have been considered, for value-based management purposes, by Drukarczyk and Schueler (2000) and Young and O’Byrne (2001). This work illustrates the main properties of the two theories and their relations, and provides a minimal guide to construction of performance metrics in the two approaches.     

Rolling-ball method for estimating the boundary of the support of a point-process intensity

We suggest a generalisation of the convex-hull method, or ‘DEA’ approach, for estimating the boundary or frontier of the support of a point cloud. Figuratively, our method involves rolling a ball around the cloud, and using the equilibrium positions of the ball to define an estimator of the envelope of the point cloud. Constructively, we use these ideas to remove lines from a triangulation of the points, and thereby compute a generalised form of a convex hull. The radius of the ball acts as a smoothing parameter, with the convex-hull estimator being obtained by taking the radius to be infinite. Unlike the convex-hull approach, however, our method applies to quite general frontiers, which may be neither convex nor concave. It brings to these contexts the attractive features of the convex hull: simplicity of concept, rotation-invariance, and ready extension to higher dimensions. It admits bias corrections, which we describe and illustrate through implementation.     

环境治理政策的减排、增效与结构优化效果动态评价

为测度环境治理政策波动对产出、减排、要素配置、消费与产业结构的影响及其传导机制,将异质性消费偏好、产出差异性、环境效用和环境损失函数引入E-DSGE模型。政策强度分析发现,技术进步、排污税和消费税政策效果较强,环境控制和治污支出冲击效果较弱。政策效应分析发现,技术进步政策效应最优,能实现增产和减排双重目标,促进要素配置和居民消费、产出与消费结构改进;排污税和政府治污支出政策次优,能实现增产和减排的双赢目标,促进要素供给和产出结构清洁化,不利于消费提升和消费结构优化;环境控制与消费税政策效果最差,以牺牲产出实现减排,不利于要素配置,产出与消费结构改进效果较弱,消费税会抑制居民消费,但消费税政策效果随环境友好型家庭比例提升而加强。     

乡村绿色生态旅游适宜等级VIKOR评估方法

针对乡村绿色生态旅游特征,并考虑旅游者个体感受与群体效益,本文从乡村绿色生态旅游开发与适宜评级概念出发,提出乡村绿色生态旅游适宜等级VIKOR评估模型与方法。首先,从等级评估的概念与内涵出发,刻画乡村绿色生态旅游适宜评级问题,避免混淆旅游适宜评级和排序两个本质不同的问题。然后,构建乡村绿色生态旅游适宜等级评估指标及隶属函数,提出评估指标的熵权确定方法。其次,提出乡村绿色生态旅游适宜等级VIKOR评估模型与二元语义等级评估方法。最后,通过案例研究和比较分析,说明本文所提模型与方法的合理性、可行性与实用性。     

网络优化中一个组合问题的探讨

文[4]提出了网络优化中若干有待解决的组合问题，本文围绕其中之一“减小直径问题”进行了探讨．设P（n，t）表示长为n的路径增加t条边后所得图直径的最小值，C（n，t）表示长为n的圈增加t条边后所得回直径的最小值．本文取得如下进展：1）给出P（n，2），P（n，3）及C（n，2）的精确值，并得出P（n，4）的一更精细的上界及一种更好的加边方式．上述结果均满足小极大度原则．2）在有极大度限制的条件下，分别对t为偶数和奇数给出了P（n，t）的上界．     

Padé Approximation in Economics

In economics, the systematic treatment of data to obtain specific properties from long (or short) data series is a main objective. The use of rational models and related numerical methods can be useful to help to predict the behaviour of relevant economic variables with a certain degree of certainty. This paper is concerned with illustrating the application of several numerical methods, in particular, the corner method, epsilon-algorithm, rs-algorithm and qd-algorithm, to the problem of model identification in time series analysis. These methods, closely related to theoretical research in Padé Approximation, are proposed to identify some type of rational structure associated with economic data in different contexts (financial, marketing, farming). Moreover, they incorporate the expectations of exogenous economic variables to improve the fit and forecasting of classic time series models.     

由算子定义的一类p叶解析函数性质

通过Hadarnard卷积定义算子I<,n+p-1>,并利用其引进了新的解析函数类H(p,n,δ,A,B),研究了函数f(z)(f(z)∈A<,p>)属于函数类H(p,n,δ,A,B)的充分条件和部分和性质,同时还考虑了类H(p,n,δ,A,B)的卷积性质.     

GENERALIZED Ⅰ-NONEXPANSIVE MAPS AND INVARIANT APPROXIMATION RESULTS IN p-NORMED SPACES

We extend the concept of R-subcommuting maps due to Shahzad[17,18] to the case of non-starshaped domain and obtain a common fixed point result for this class of maps on non-starshaped domain in the setup of p-normed spaces. As applications, we establish noncommutative versions of various best approximation results for generalized I-nonexpansive maps on non-starshaped domain. Our results unify and extend that of Al-Thagafi, Dotson, Habiniak, Jungck and Sessa, Latif, Sahab, Khan and Sessa and Shahzad.     

Formulation of linear problems and solution by a universal machine

Using the predicate language for ordered fields a class of problems referred to aslinear problems is defined. This class contains, for example, all systems of linear equations and inequalities, all linear programming problems, all integer programming problems with bounded variables, all linear complementarity problems, the testing of whether sets that are defined by linear inequalities are semilattices, all satisfiability problems in sentenial logic, the rank-computation of matrices, the computation of row-reduced echelon forms of matrices, and all quadratic programming problems with bounded variables. A single, one, algorithm, to which we refer as theUniversal Linear Machine, is described. It solves any instance of any linear problem. The Universal Linear Machine runs in two phases. Given a linear problem, in the first phase a Compiler running on a Turing Machine generates alinear algorithm for the problem. Then, given an instance of the linear problem, in the second phase the linear algorithm solves the particular instance of the linear problem. The linear algorithm is finite, deterministic, loopless and executes only the five ordered field operations — additions, multiplications, subtractions, divisions and comparisons. Conversely, we show that for each linear algorithm there is a linear problem which the linear algorithm solves uniquely. Finally, it is shown that with a linear algorithm for a linear problem, one can solve certain parametric instances of the linear problem.Research was supported in part by the National Science Foundation Grant DMS 92-07409, by the Department of Energy Grant DE-FG03-87-ER-25028, by the United States—Israel Binational Science Foundation Grant 90-00434 and by ONR Grant N00014-92-J1142.Corresponding author.     

Dynamic properties of composite laminates and panels with highly contrasting directions of anisotropy

An asymptotic analysis of the dynamic stress-strain state of a thin laminar packet of anisotropic layers is presented. The statement is nonclassical, since in layer materials the ratio of elastic moduli in the longitudinal and transverse directions can generate small parameters comparable to the relative half-thickness of the packet, as, for example, in high-strength unidirectional composites. Alternation of strong load-carrying layers and a relatively soft filler with a similar difference in the elastic moduli between the layers is also allowed. The averaged two-dimensional equations and the total stress tensor in the layers are determined. The results are classified with respect to the types of anisotropy and the indices of differences in the elastic moduli. It is shown that first-approximation models lead to kinematic relations similar to those of the theories of high-order shear strains. Institute of Problems of Mechanics, Russian Academy of Sciences, Moscow, Russia. Translated from Mekhanika Kompozitnykh Materialov, Vol. 35, No. 5, pp. 605–614, September–October, 1999.     

Short proofs of classical theorems

We give proofs of Ore's theorem on Hamilton circuits, Brooks' theorem on vertex coloring, and Vizing's theorem on edge coloring, as well as the Chvátal-Lovász theorem on semi-kernels, a theorem of Lu on spanning arborescences of tournaments, and a theorem of Gutin on diameters of orientations of graphs. These proofs, while not radically different from existing ones, are perhaps simpler and more natural. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 159–165, 2003     

若干联图的点可区别均匀边色数

k-正常边染色法f,若满足任两个不同点的关联边色集不同,则称f为G的k-点可区别边染色,简记为k-VDEC of G,并称最小的k为G的点可区别边色数;对k-VDEC若再满足任意两色的边数之差不超过1,则称f为G的点可区别均匀边染色,简记为k-VDEEC of G,并称最小的k为G的点可区别均匀边色数．本文得到了图等阶的路和路,路和圈,圈和圈的联图的点可区别均匀边色数．