3. System 14. Document Identifier DOE Spent Nuclear Fuel CAL-DSD-NU-000007 Rev OOA 5. Title Intact and Degraded Mode Criticality Calculations for the Codisposal of ATR Spent Nuclear Fuel in a Waste Package 6. Group Criticality 7. Document Status Designation I8J Preliminary 0 Final 0 Cancelled 8. NotesJComments This document does not impact any other organization outside Criticality, therefore a...

We propose a flexible and multi-scale method for organizing, visualizing, and understanding datasets sampled from or near stratified spaces. The first part of the algorithm produces a cover tree using adaptive thresholds based on a combination of multiscale local principal component analysis and topological data analysis. The resulting cover tree nodes consist of points within or near the same ...

Infeasible code has proved to be an interesting target for static analysis. It allows modular and scalable analysis, and at the same time, can be implemented with a close-to-zero rate of false warnings. The challenge for an infeasible code detection algorithm is to find executions that cover all statements with feasible executions as fast as possible. The remaining statements are infeasible cod...

The complexity of a CSMA algorithm has been translated to the norm properties of a dependencies matrix. The maximum throughput optimization is reformulated by including the dependencies matrix in the formulations. It has been shown that for the interference graphs G that have minimum vertex cover size C(G) = log n where n is the number of the links, the optimal strategy of the links is to trans...

In cooperative games, a key question is to find a division of payoffs to coalition members in a fair manner. Nucleolus is one of such solution concepts that provides a stable solution for the grand coalition. We study the computation of the nucleolus of a number of cooperative games, including fractional matching games and fractional edge cover games on general weighted graphs, as well as verte...

Motivated by the need for succinct representations of all “small” transversals (or hitting sets) of a hypergraph of fixed rank, we study the complexity of computing such a representation. Next, the existence of a minimal hitting set of at least a given size arises as a subproblem. We give one algorithm for hypergraphs of any fixed rank, and we largely improve an earlier algorithm (by H. Fernau,...

Article history: Received 21 October 2013 Received in revised form 30 September 2014 Accepted 21 October 2014 Available online 28 October 2014 Communicated by G. Ausiello

The chloride corrosion of reinforcing steel in reinforced concrete (RC) structures is a significant reason for premature deterioration and failure of RC structures in aggressive environments such as Persian Gulf region. This is one of the most important sources of engineering and economic problems in developed countries. So, the repair and maintenance of RC structures exposed to corrosive envir...

Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes Boolean matrix B, with the number of factors as small as possible. This paper is a continuation of our previous paper where we proved that formal concepts of I are optimal factors for Boolean factor analysis. In particula...