辐射损伤的正电子湮没和扰动角关联研究(英文)

用正电子湮没和扰动角关联二种方法研究了Si和Nb的辐射损伤。采用正电子湮没方法得到的结果与扰动角关联的完全一致。     

On the magnification of two-dimensional contouring errors by using contour-parallel offsets

The cross grid encoder is a diffraction grating type encoder to measure two-dimensional position of a optical head by using a grid plate, and is widely used in the industry to evaluate the two-dimensional contouring performance of a machine tool. In the graphical display of measured contouring error profiles, the error is often magnified to some given scale with respect to the reference trajectory. The conventional algorithm to compute the magnified contouring error profile, adopted in a commercial software to analyze an error profile measured by the cross grid encoder, makes the magnified trajectory discontinuous when the given reference trajectory is unsmooth, which makes it difficult to understand the magnified trajectory especially at corners. This paper proposes a new algorithm to compute the magnified trajectory of two-dimensional contouring error profiles such that the magnified trajectory becomes continuous even when the reference trajectory is unsmooth. Application examples are presented with error profiles obtained by using a cross grid encoder applied to a commercial machining center.     

Prediction and compensation of machining geometric errors of five-axis machining centers with kinematic errors

Kinematic errors due to geometric inaccuracies in five-axis machining centers cause deviations in tool positions and orientation from commanded values, which consequently affect geometric accuracy of the machined surface. As is well known in the machine tool industry, machining of a cone frustum as specified in NAS979 standard is a widely accepted final performance test for five-axis machining centers. A critical issue with this machining test is, however, that the influence of the machine's error sources on the geometric accuracy of the machined cone frustum is not fully understood by machine tool builders and thus it is difficult to find causes of machining errors. To address this issue, this paper presents a simulator of machining geometric errors in five-axis machining by considering the effect of kinematic errors on the three-dimensional interference of the tool and the workpiece. Kinematic errors of a five-axis machining center with tilting rotary table type are first identified by a DBB method. Using an error model of the machining center with identified kinematic errors and considering location and geometry of the workpiece, machining geometric error with respect to the nominal geometry of the workpiece is predicted and evaluated. In an aim to improve geometric accuracy of the machined surface, an error compensation for tool position and orientation is also presented. Finally, as an example, the machining of a cone frustum by using a straight end mill, as described in the standard NAS979, is considered in case studies to experimentally verify the prediction and the compensation of machining geometric errors in five-axis machining.     

Optimal coteries for rings and related networks

Summary Let a distributed system be represented by a graphG=(V, E), whereV is the set of nodes andE is the set of communication links. A coterie is defined as a family,C, of subsets ofV such that any pair of subsets inC has at least one node in common and no subset inC contains any other subset inC. Assuming that each nodev _i V (resp. linke _j E) is operational with probabilityp _i (resp.r _j ), the availability of a coterie is defined as the probability that the operational nodes and links ofG connect all nodes in at least one subset in the coterie. Although it is computationally intractable to find an optimal coterie that maximizes availability for general graphG, we show in this paper that, ifG is a ring, either a singleton coterie or a 3-majority coterie is optimal. Therefore, for any ring, an optimal coterie can be computed in polynomial time. This result is extended to the more general graphs, in which each biconnected component is either an edge or a ring. Toshihide Ibaraki received the B.E., M.E., and Dr. E. degrees from Kyoto University, in 1963, 1965 and 1970, respectively. Since 1969, he has been with the Department of Applied Mathematics and Physics, Kyoto University, except for two and a half years from 1983 to 1985, during which time he was with Department of Computer and Information Sciences, Toyohashi University of Technology. Currently, he is a professor of Kyoto University. He has held a number of visiting appointments with University of Illinois, University of Waterloo, Simon Fraser University, Rutgers University, and others. He is the author of Enumerative Approaches to Combinatorial Optimization, Baltzer AG., a coauthor of Resource Allocation Problems: Algorithmic Approaches, MIT Press, and the author of several books in Japanese, including Algorithms and Data Structures, Shoukohdou. His interest includes algorithms, optimization, computational complexity and their applications. Hiroshi Nagamochi was born in Tokyo, on January 1, 1960. He received the B.A., M.E. and D.E. degrees from Kyoto University, in 1983, in 1985 and in 1988, respectively. From 1988 to 1990, he was with Department of Computer and Information Sciences, Toyohashi University of Technology. Currently, he is an Associate Professor in the Department of Applied Mathematics and Physics at Kyoto University. His research interests include network flow problems and graph connectivity problems. Dr. Nagamochi is a member of the Operations Research Society of Japan and the Information Processing Society. Tsunehiko Kameda received the B.E. and M.E. degrees from the University of Tokyo in 1961 and 1963, respectively, and the Ph.D. degree from Princeton University in 1968. From 1967 to 1980, he was with the Department of Electrical Engineering, University of Waterloo. Since 1981, he has been with Simon Fraser University, Burnaby, British Columbia, Canada, where he is a Professor of Computing Science and is the Director of Computer and Communications Research Laboratory. He has held a number of visiting appointments with Universities of Erlangen-Nürnberg, Bonn, Frankfurt, and Braunschweig, and Gesellschaft für Mathematik und Datenverarbeitung, all in Germany, and also with Kyoto University, Japan. Dr. Kameda is a member of the ACM. He has co-authored three books: Einführung in die Codierungstheorie, Bibliographisches Institut, Distributed Algorithms, Kindai Kagaku-Sha, and A Probabilistic Analysis of Test Response Compaction, IEEE Press. His current research interests include database systems, combinatorial algorithms, distributed computing, ATM networks, and random testing of VLSI circuits.This work was supported in part by Grant-in-Aid from the Ministry of Education, Science and Culture of Japan, and in part by grants from the Natural Sciences and Engineering Research Council of Canada, and the Advanced Systems Institute of British Columbia.     

盐酸液中钇(Ⅲ)和铕(Ⅲ)的P_(507)溶剂萃取平衡分析(英文)

为了精确预测非理想条件下稀土金属溶剂萃取的平衡分配比,研究了溶于ShellsolD70中的P507溶剂对盐酸液中钇(Ⅲ)和铕(Ⅲ)的萃取平衡,建立化学基模型,并通过非线性最小二乘法确定萃取平衡常数。所建模型涉及了在低酸度区的离子交换反应和高酸度区的溶剂化萃取反应;模型还考虑了稀土金属与Cl-的配位反应,并用萃取剂的有效浓度代替[(HR)2],进而分别对水相和有机相(HR)2的非理想性加以修正。对稀土单元体系,在较宽的初始浓度范围内(稀土浓度最高至0.1mol/L,盐酸浓度0.07-3.00mol/L,萃取剂浓度0.25-1.00mol/L),由模型计算的稀土分配比与实验测得的数据吻合良好,验证了模型的有效性。对于稀土二元体系,该模型能以良好的精度对平衡分配比进行工程预测。     

牵引传动及其在机械传动中的应用

本文介绍了一种新型传动方式──牵引传动的传动机理和应用前景，并对牵引传动中油膜压力、油膜厚度及剪应力的计算方法进行了分析探讨。     

Creep and creep-fatigue behavior of high chromium steel weldment

Strength of welded joints of high chromium steels is one of the important concerns for fabricators and operators of ultra supercritical thermal power plants.A number of creep as well as creep-fatigue tests with tensile hold have been carried out on the welded joints of two types of high chromium steels widely used in Japan,i.e.Grade 91 and 122 steels.It was found that failure occurred in fine grain heat-affected zone in all the creep-fatigue tests,even at a relatively low temperature and fairly short time where failure occurred in plain base metal region in simple creep testing.Four procedures were used to predict failure lives and their results were compared with the test results.A newly proposed energy-based approach gave the best estimation of failure life,without respect of the material and temperature.     

Inferring Minimal Functional Dependencies in Horn and q-Horn Theories

In this paper, we study various problems related to the inference of minimal functional dependencies in Horn and q-Horn theories. We show that if a Horn theory is represented by a Horn CNF, then there exists an incrementally polynomial algorithm for inferring all minimal functional dependencies. On the other hand, if a Horn theory is represented as the Horn envelope of a given set of models, then there exists a polynomial total time algorithm for this inference problem if and only if there exists such an algorithm for dualizing a positive CNF. Finally, we generalize our results to the case of q-Horn theories, and show that all the considered problems can be reduced in polynomial time to the corresponding problems for Horn theories.     

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

We show that anyk-connected graphG = (V, E) has a sparsek-connected spanning subgraphG = (V, E) with ¦E¦ =O(k¦V¦) by presenting anO(¦E¦)-time algorithm to find one such subgraph, where connectivity stands for either edge-connectivity or node-connectivity. By using this algorithm as preprocessing, the time complexities of some graph problems related to connectivity can be improved. For example, the current best time boundO(max{k ²¦V¦^1/2,k¦V¦}¦E¦) to determine whether node-connectivityK(G) of a graphG = (V, E) is larger than a given integerk or not can be reduced toO(max{k ³¦V¦^3/2,k ²¦V¦²}).The first author was partially supported by the Grant-in-Aid for Encouragement of Young Scientists of the Ministry of Education, Science and Culture of Japan and by the subvention to young scientists by the Research Foundation of Electrotechnology of Chubu.