THE REGULAR COMPONENTS OF THE AUSLANDER-REITEN QUIVER OF A TILTED ALGEBRA

Let B be a connected finite-dimensional hereditary algebra of infinite representationtype.It is shown that there exists a regular tilting B-module if and only if B is wild andhas at least three simple modules.In this way,the author determines the possible form ofregular components which arise as a connecting component of the Auslander-Reitenquiver Γ(A)of a tilted algebra A.The second result asserts that for a tilted algebra A,any regular component of Γ(A)which is not a connecting component,is quasi-serial.     

Run up flow of an incompressible micropolar fluid between parallel plates – A state space approach

In this paper, we study the run up flow of an incompressible micropolar fluid between two horizontal infinitely long parallel plates. Initially a flow of the fluid is induced by a constant pressure gradient until steady state is reached. After the steady state is reached, the pressure gradient is suddenly withdrawn while the two plates are impulsively started with different velocities in their own plane. Using the Laplace transform technique and adopting the state space approach, we obtain the velocity and microrotation components in Laplace transform domain. A standard numerical inversion procedure is used to find the velocity and microrotation in space-time domain for various values of time, distance, material parameters and pressure gradient. The variation of velocity and microrotation components is studied and the results are illustrated through graphs. It is observed that the micropolarity parameter has a decreasing effect on velocity component. It is also found that as the gyration parameter increases there is a decrease in microrotation component and an increase in velocity component.     

Modelling and hierarchical diagnosis of timed discrete-event systems

A new diagnostic method for hierarchically structured discrete-event systems is presented. The efficiency of this method results from the fact that the complexity of the diagnostic task is reduced by first detecting a faulty component using a coarse process model on a high level of abstraction, and subsequently refining the result by investigating the faulty component with the help of a detailed component model in order to identify the fault with sufficient precision. On both abstraction levels, the method uses a timed discrete-event model of the appropriate part of the system. On the higher abstraction level a timed event graph is used that describes how the temporal distance of the events is changed by component faults. On the lower level of abstraction, timed automata are used to cope with the non-determinism of the event sequence generated by the faulty and faultless components. The approach is illustrated by the diagnosis of a batch process.     

Ky Fan点集的本质连通区

本文首先引入了Ｋｙ Ｆａｎ点集本质连能区的概念,证明了对任一满足一定凸性和连续性条件的函数,其Ｋｙ Ｆａｎ点集至少存在一个本质连能区．作为应用,我们推出地任何一般ｎ人非合伯对策（其支付函数满足一些凸性和连续性条件）,其Ｎａｓｈ平衡点集至少存在一个本质连通区．     

Combinatorial analysis of two basic forms of hidden periodicity in categorial sequences

Two kinds of mixing of periodical components according to the Spencer-Brown laws of form are considered. If the identical fragments of a periodic component remain unchanged, then the periodicity is of the penetrant (calling) form; if the identical fragments break up, then it is of the co-penetrant (crossing) form. The hidden periodicity of the penetrant form is studied using the symptom analysis; the co-penetrant form of periodicity is studied using the order asymmetry method. In the symptom analysis, the method of principal components and SSA are modified for finite geometries. The order asymmetry method is the cluster analysis where the distance between two gradations characterizes the deviation from the periodicity in a subsequence over these gradations.     

A DEA approach to derive individual lower and upper bounds for the technical and allocative components of the overall profit efficiency

In this paper, we propose a slack-based data envelopment analysis approach to be used in economic efficiency analyses when the objective is profit maximization. The focus is on the measurement of the technical component of the overall efficiency with the purpose of guaranteeing the achievement of the Pareto efficiency. As a result, we will be able to estimate correctly the allocative component in the sense that this latter only reflects the improvements that can be accomplished by reallocations along the Pareto-efficient frontier. Some new measures of technical and allocative efficiency in terms of both profit ratios and differences of profits are defined. We do not make any assumption on the way the technical efficiency is to be measured, that is, we do not use, for example, either a hyperbolic measure or a directional distance function, which allows us to extend this approach and derive individual lower and upper bounds for these efficiency components. To do it, we use novel models of minimum distance to the frontier. This broadens the range of possibilities for the explanation of the overall efficiency in terms of technical and allocative inefficiencies.     

Flux Theorems for Linear Multicomponent Diffusion

Sten-Knudsen & Ussing (1981) and Bass et al. (1986) haveshown that the flux of matter through membranes is proportionalat all corresponding times to the flux in the opposite directionwhen appropriate boundary conditions are reversed, even if thediffusion-migration parameters and the trapping characteristicsof the material vary arbitrarily with distance normal to themembrane surface. In this paper, we extend this flux-ratio theoremto some cases where the diffusing component is interacting withother diffusing species in the membrane. When the equationsare assumed to be linear, as for tracer experiments, the amountof any component transmitted though any part of the boundaryover the duration of an experiment is determined by the timeintegral of the given boundary conditions and is independentof pulse shape. If the interaction matrix A coupling the transportequations of the components is quasi-symmetric in the sensethat it is the product of a symmetric and a diagonal matrix,the flux-ratio theorem remains valid. Interactions dominatedby a single chemical reaction give rise to quasi-symmetric matricesof this form. An example involving three components illustratesthe structure. It is shown that interaction parameters suchas absolute reaction rates can be deduced for experiments basedon these results.     

Time-optimal control of multivariable systems near the origin

This article deals with bang-bang solutions of linear time-optimal control problems. Linear multivariable systems are considered which have one or more control components. It is shown in which way the control components act together to make the system achieve the ultimate aim (namely, the origin in the state space) as quickly as possible. The theory only applies to initial positions sufficiently near the origin. Criteria are given which give the number of switches per control component.Asymptotic dependences of the switching times and the final time on the distance of the initial position from the origin are established. The theory provides a numerical procedure to calculate the time-optimal control. These calculations are very simple. Basic to the proof of these results is a generalized implicit function theorem due to Artin (Ref. 1).     

Farthest-polygon Voronoi diagrams

Given a family of k disjoint connected polygonal sites in general position and of total complexity n, we consider the farthest-site Voronoi diagram of these sites, where the distance to a site is the distance to a closest point on it. We show that the complexity of this diagram is O(n), and give an O(nlog³n) time algorithm to compute it. We also prove a number of structural properties of this diagram. In particular, a Voronoi region may consist of k−1 connected components, but if one component is bounded, then it is equal to the entire region.     

Strong convergence on weakly logarithmic combinatorial assemblies

We deal with the random combinatorial structures called assemblies. Instead of the traditional logarithmic condition which assures asymptotic regularity of the number of components of a given order, we assume only lower and upper bounds of this number. Using the author’s analytic approach, we generalize the independent process approximation in the total variation distance of the component structure of an assembly. To evaluate the influence of strongly dependent large components, we obtain estimates of the appropriate conditional probabilities by unconditioned ones. The estimates are applied to examine additive functions defined on a new class of structures, called weakly logarithmic. Some analogs of Major’s and Feller’s theorems which concern almost sure behavior of sums of independent random variables are proved.     

Algebraic analysis of offsets to hypersurfaces

In this paper, we present a complete algebraic analysis of degeneration and existence of simple and special components of generalized offsets to irreducible hypersurfaces over algebraically closed fields of characteristic zero. More precisely, we analyze the degeneration situations when offseting, and we state that there exist, at most, a finite set of distances for which the offset of a hypersurface may degenerate. As a consequence of this analysis, an algorithmic method to determine such distances is derived. Furthermore, as an application of these results, a complete degeneration analysis of the generalized offset to the sphere is developed. In addition, we study the existence of simple and special components of the offset. In this context we prove that, in the case of classical offsets, there always exists at least one simple component and, in the case of generalized offsets, we prove that for almost every distance and for almost every isometry, all components of the offset are simple. Received November 9, 1998; in final form March 5, 1999 / Published online May 8, 2000     

排序法计算指数寿命型元件串联系统可靠性经典精确最优置信下限

对于样本点是离散的情况,可用对样本点排序的方法确定可靠性置信下限,排序有很多种,有L-P排序、序贯排序、极大似然估计排序、修正L-P排序等。本文提出一种具有直观合理性的新的排序方法,计算指数寿命型元件串联系统可靠性经典精确最优置信下限。     

基于计算机试验的均匀设计

本文在计算机试验的基础上，提出了最小相关准则和最小距离离差准则，并将信息论中的Hamming距离和Lee距离引入到计算机试验中，证明了均匀设计在Hamming距离下的最优性和部分好格子点均匀设计在Lee距离下的最优性．基于偏差的考虑，给出了一类新的好格子点均匀设计和一个学习算法，利用这个学习算法，给出了基于Lee距离的最小距离离差准则的均匀设计表的构造方法．通过与已有的好格子点均匀设计和循环拉丁方均匀设计作比较，证明了文中的均匀设计在距离和偏差意义下有更好的均匀性．     

Spectral distance on the circle

A building block of non-commutative geometry is the observation that most of the geometric information of a compact Riemannian spin manifold M is encoded within its Dirac operator D. Especially via Connes' distance formula one is able to extract from the spectral properties of D the geodesic distance on M. In this paper we investigate the distance d encoded within a covariant Dirac operator on a trivial U(n)-fiber bundle over the circle with arbitrary connection. It turns out that the connected components of d are tori whose dimension is given by the holonomy of the connection. For n=2 we explicitly compute d on all the connected components. For n?2 we restrict to a given fiber and find that the distance is given by the trace of the module of a matrix. The latest is defined by the holonomy and the coordinate of the points under consideration. This paper extends to arbitrary n and arbitrary connection the results obtained in a previous work for U(2)-bundle with constant connection. It confirms interesting properties of the spectral distance with respect to another distance naturally associated to connection, namely the horizontal or Carnot-Carathéodory distance dH. Especially in case the connection has irrational components, the connected components for d are the closure of the connected components of dH within the Euclidean topology on the torus.     

Locating and counting bifurcation points of satellite components from the main component in the degree-n bifurcation set

The bifurcation point where a satellite component buds from another component is characterized by the existence of the common tangent line between the two osculating components appearing in the degree-n bifurcation set. We investigate the existence, location and number of bifurcation points for satellite components budding from the main component in the degree-n bifurcation set as well as a parametric boundary equation of the main component of the degree-n bifurcation set. Cusp points are also located on the boundary of the main component. Typical degree-n bifurcation sets and their components are illustrated with some computational results.     

Developing a decomposable measure of profit efficiency using DEA

In for-profit organizations efficiency measurement with reference to the potential for profit augmentation is particularly important as is its decomposition into technical, and allocative components. Different profit efficiency approaches can be found in the literature to measure and decompose overall profit efficiency. In this paper, we highlight some problems within existing approaches and propose a new measure of profit efficiency based on a geometric mean of input/output adjustments needed for maximizing profits. Overall profit efficiency is calculated through this efficiency measure and is decomposed into its technical and allocative components. Technical efficiency is calculated based on a non-oriented geometric distance function (GDF) that is able to incorporate all the sources of inefficiency, while allocative efficiency is retrieved residually. We also define a measure of profitability efficiency which complements profit efficiency in that it makes it possible to retrieve the scale efficiency of a unit as a component of its profitability efficiency. In addition, the measure of profitability efficiency allows for a dual profitability interpretation of the GDF measure of technical efficiency. The concepts introduced in the paper are illustrated using a numerical example.     

Outlier Mining Based on Principal Component Estimation

Outlier mining is an important aspect in data mining and the outlier mining based on Cook distance is most commonly used. But we know that when the data have multicoUinearity, the traditional Cook method is no longer effective. Considering the excellence of the principal component estimation, we use it to substitute the least squares estimation, and then give the Cook distance measurement based on principal component estimation, which can be used in outlier mining. At the same time, we have done some research on related theories and application problems.     

两类供应风险下装配商的最优订购策略

针对两类供应风险(不确定产能与随机产出率)下装配制造商的零部件订购决策这一难题,运用随机非线性规划方法,以装配商期望利润最大化为目标,建立零部件订购决策的多维优化模型,刻画了确定需求下的最优订购量,并对其进行了灵敏性分析。最后,通过数值算例验证了模型结论并进一步探讨不同类供应风险的影响,为装配商的零部件订购决策和风险管理提供有益的管理启示。     

Analysis of filling distance in cylindrical microfeatures for microinjection molding

In the injection molding of plastic components with cylindrical microfeatures, the ability for the polymer melt to flow into the microchannels is a crucial factor for successful molding. Penetration distance of the polymer melt into the microstructure depends on several factors as the melt flow rate and the cooling rate in the microfeatures, which depends on the materials and geometric dimensions. In this study, a simplified analytical model was constructed to estimate the filling distance into the cylindrical microchannels. The effects of the mold temperature, injection rate, heat transfer coefficient, and microchannel dimension on the filling distance were investigated. The filling distance decreases dramatically with respect to the decrease of the channel radius. In molding of plastic components with cylindrical microfeatures as those analyzed in this study, decrease of the part thickness could also increase the filling distance in the microfeatures.