PANCYCLICITY IN LINE GRAPHS

1IntroductionWeuseBondyandMurtyl3]forterminologyand..ta'ti..notdefinedhereandconsidersimpleconnectedgraphsonly.AcircuitCofagraphGisanontrivialconnectedeuleriansubgraphofG.Aspanningcircuit,orbrieflyS-circuit,ofagraphGisacircuitthatcontainsallvenicesofG.AdominatingcircuitorD-circuitofGisacircuitsuchthateveryedgeofGisincidentwithatleastonevertexofthecircuit.AgraphofordernispancyclicifitcontainsallcyclesoflengthIfor3515n.IfCisacircuitofG,thenP(C)denotesthenumberOfedgesofGincidentwithatleas…     

等效法在伏安法测量中的应用

本文提出了在伏安法测量中，消除电表内阻对实验结果影响的一种新方法     

D→Klv～l衰变过程的研究

用光锥QCD求和规则研究D→Klv～_l衰变过程，首先计算D→K跃迁形状因子，通过构造新的关联函数，消除了twist-3波函数的不确定性给计算结果所带来的影响，从而使计算结果更加精确. 计算得到的分支比与最近的实验数据相一致. 关键词： QCD光锥求和规则 D介子半轻衰变 分支比 形状因子     

AN ESTIMATE ON THE DISTRIBUTION AND MOMENTS OF THE LAST EXIT TIME OF AN ELLIPTIC DIFFUSION PROCESS

Let LB be the last exit time from a compact set B of an elliptic diffusion process X. A moderate estimate for the distribution of LB is obtained, and the sufficient and necessary condition for Ex(LBk)<∞is proved.     

Equitable Total Coloring of Graphs with Maximum Degree 3

 The equitable total chromatic number χr d q u o; _e (G) of a graph G is the smallest integer k for which G has a total k-coloring such that the number of vertices and edges in any two color classes differ by at most one. We prove in this paper that χr d q u o; _e (G)≤5 if G is a multigraph with maximum degree at most 3. Received: February 24, 2000 Final version received: February 2, 2001 Acknowledgments. The author would like to thank the referee for valuable suggestions to improve this work.     

An optimal repeat inspection plan with several classifications

Multicharacteristic critical components exist in many systems. Such components could be a part of an aircraft, space shuttle or a gas ignition system. A component is critical if it causes disaster or a very high cost upon failure. In this paper, a new inspection plan for critical multicharacteristic components is presented. A mathematical model that depicts the plan is developed. An algorithm is proposed for finding the optimal number of repeat inspections and the sequence of characteristics for inspection that minimizes expected total cost per accepted component. The expected cost consists of the cost of inspection and the cost of misclassifications. The inspection plan and the model developed generalize existing models in the literature and provide a more realistic formulation. An example is given to demonstrate the plan and the model.     

Selection and Scheduling of Advanced Missions for NASA Using 0-1 Integer Linear Programming

A 0-1 integer linear programme for the selection and scheduling of US National Aeronautics and Space Administration (NASA) missions over a long planning horizon is presented. This model was formulated to allow a higher-level user-interaction with an advanced missions database currently being developed. The model implicitly considers the multi-objective nature of the problem, which results from the desire to maximize benefits in several categories as well as from the desire to minimize cost. In addition, the model allows the planner much flexibility in the selection process. This is accomplished by allowing the planner the ability to specify long- or short-term budget constraints, precursor/follow-on mission requirements, or any number of other idiosyncratic constraints which might be of importance in the decision process. Small example problems are solved in order to illustrate the approach, and areas for further research are discussed.     

An interactive approach for multiobjective decision making

We develop an interactive approach for multiobjective decision-making problems, where the solution space is defined by a set of constraints. We first reduce the solution space by eliminating some undesirable regions. We generate solutions (partition ideals) that dominate portions of the efficient frontier and the decision maker (DM) compares these with feasible solutions. Whenever the decision maker prefers a feasible solution, we eliminate the region dominated by the partition ideal. We then employ an interactive search method on the reduced solution space to help the DM further converge toward a highly preferred solution. We demonstrate our approach and discuss some variations.     

Synthesis for robust synchronization of chaotic systems under output feedback control with multiple random delays

Synchronization under output feedback control with multiple random time delays is studied, using the paradigm in nonlinear physics—Chua’s circuit. Compared with other synchronization control methods, output feedback control with multiple random delay is superior for a realistic synchronization application to secure communications. Sufficient condition for global stability of delay-dependent synchronization is established based on the LMI technique. Numerical simulations fully support the analytical approach, in spite of the random delays.