Re-evaluation of Radiation-Energy Transfer to an Extraction Solvent in a Minor-Actinide-Separation Process Based on Consideration of Radiation Permeability

ABSTRACT

Absorbed-dose estimation is essential for evaluation of the radiation tolerance of minor-actinide-separation processes. We propose a dose-evaluation method based on radiation permeability, with comparisons of heterogeneous structures seen in the solvent-extraction process, such as emulsions forming in the mixture of the organic and aqueous phases. A demonstration of radiation-energy-transfer simulation is performed with a focus on the minor-actinide-recovery process from high-level liquid waste with the aid of the Monte Carlo radiation-transport code PHITS. The simulation results indicate that the dose absorbed by the extraction solvent from alpha radiation depends upon the emulsion structure, and that from beta and gamma radiation depends upon the mixer-settler-apparatus size. Non-negligible contributions of well-permeable gamma rays were indicated in terms of the plant operation of the minor-actinide-separation process.     

Graph-based video fingerprinting using double optimal projection

A double optimal projection method that involves projections for intra-cluster and inter-cluster dimensionality reduction are proposed for video fingerprinting. The video is initially set as a graph with frames as its vertices in a high-dimensional space. A similarity measure that can compute the weights of the edges is then proposed. Subsequently, the video frames are partitioned into different clusters based on the graph model. Double optimal projection is used to explore the optimal mapping points in a low-dimensional space to reduce the video dimensions. The statistics and geometrical fingerprints are generated to determine whether a query video is copied from one of the videos in the database. During matching, the video can be roughly matched by utilizing the statistics fingerprint. Further matching is thereafter performed in the corresponding group using geometrical fingerprints. Experimental results show the good performance of the proposed video fingerprinting method in robustness and discrimination.     

Shallow Linear Action Graphs and their Embeddings

Action calculi, which generalise process calculi such as Petri nets, π-calculusand ambient calculus, have been presented in terms of action graphs. We here offer linear action graphs as a primitive basis for action calculi. This paper presents the category of embeddings of undirected linear action graphs without nesting, using a novel form of graphical reasoning which simplifies some otherwise complex manipulations in regular algebra. The results are adapted in a few lines to directed graphs. This work is part of a long-term search for a uniform behavioural theory for process calculi. Received October 2000 / Accepted in revised form April 2001     

Breaking the search space symmetry in partitioning problems: An application to the graph coloring problem

Many problems consist in splitting a set of objects into different groups so that each group verifies some properties. In practice, a partitioning is often encoded by an array mapping each object to its group numbering. In fact, the group number of an object does not really matter, and one can simply rename each group to obtain a new encoding. That is what we call the symmetry of the search space in a partitioning problem. This property may be prejudicial for optimization methods such as evolutionary algorithms (EA) which require some diversity during the search.     

A simple approximation algorithm for the weighted matching problem

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [STACS'99, Lecture Notes in Comput. Sci., Vol. 1563, 1999, pp. 259-269]. Our algorithm uses a new approach which is much simpler than the one given by Preis and needs no amortized analysis for its running time.     

Sub-optimal solutions to track detection problem using graph theoretic concepts

This paper demonstrates how the problem of tracking targets, which appear as either straight or curved lines in two-dimensional display images (or data images) can be formulated in terms of a directed weighted graph model and how dynamic programming techniques can be efficiently applied to reach an optimal or sub-optimal solution. In general, track detection algorithms providing optimal solutions have good detective ability, but most of them suffer from the inability to detect discontinuous lines or to resolve efficiently pairs of crossing lines. A sub-optimal solution is provided that efficiently overcomes these weaknesses. We focus on modeling the track detection problem in terms of a graph, formulating fast sequential/parallel sub-optimal track detection algorithms and testing them on simulated data in order to show their detective ability. Moreover, we specify the conditions under which sub-optimal algorithms can perform at least as well as their corresponding optimal algorithms. This is significant for the track detection problem where fast, accurate and real-time detection is considered a necessity.     

β－C_2S固溶体稳定的热力学研究

从热力学理论出发，利用Ｘ射线衍射定性和定量的方法，对β－Ｃ＿２Ｓ固溶体的稳定性进行了分析和研究。经热力学理论推导得出β－Ｃ＿２Ｓ稳定的热力学条件，即掺入的微量元素的化学位μ＿ｉ须小于β－Ｃ＿２Ｓ的反应自由焓△Ｇ＿β，μ＿ｉ＜△Ｇ＿β．并定量地计算出一种微量元素稳定β－Ｃ＿２Ｓ的临界掺加量为；多种微量元素对β－Ｃ＿２Ｓ的稳定性判断条件为：