Results 1 to 10 of about 711,917 (340)
Computer simulations of fragmentation [PDF]
Abstract A semiclassical model for describing nuclear reactions at intermediate energy is presented. The model is applied to the study of fragmentation in proton and heavy ion induced reactions. Computer simulations based on the model allow one to follow the evolution of the reactions in both coordinate and phase space.
James N. Glosli+2 more
openaire +2 more sources
Computations in fragments of intuitionistic propositional logic [PDF]
This article is a report on research in progress into the structure of finite diagrams of intuitionistic propositional logic with the aid of automated reasoning systems for larger calculations. A fragment of a propositional logic is the set of formulae built up from a finite number of propositional variables by means of a number of connectives of the ...
Jongh, D. de+2 more
openaire +4 more sources
Cooperative computing with fragmentable and mergeable groups [PDF]
AbstractThis work considers the problem of performing a set of N tasks on a set of P cooperating message-passing processors (P⩽N). The processors use a group communication service (GCS) to coordinate their activity in the setting where dynamic changes in the underlying network topology cause the processor groups to change over time.
Georgiou, Chryssis+3 more
openaire +2 more sources
Weighted automata computation of edit distances with consolidations and fragmentations [PDF]
We study edit distances between strings, based on operations of character substitutions, insertions, deletions and additionally consolidations and fragmentations. The two latter operations transform a sequence of characters into one character and vice-versa.
Giraud, Mathieu, Jacquemard, Florent
openaire +5 more sources
Computational Study of the Stability of Nanotube Fragments
AbstractExtremely short (<1 nm) fragments of zig‐zag carbon nanotubes are studied with ab‐initio techniques to determine their geometric and electronic structure as well as their magnetic susceptibility. It is found that for lengths of a few carbon–carbon bonds, each fragment can be viewed as composed of crowns, that is, zig‐zag rings of carbon ...
Beatrice Fantini, Francesco Faglioni
openaire +3 more sources
Computational Identification of Antigen-Binding Antibody Fragments [PDF]
AbstractDetermining which parts of the Ab are essential for Ag recognition and binding is crucial for understanding B cell–mediated immunity. Identification of fragments of Abs that maintain specificity to the Ag will also allow for the development of improved Ab-based therapy and diagnostics.
Inbal Sela-Culang+4 more
openaire +3 more sources
A computer tool to identify best matches for pottery fragments
Abstract Archaeologists working with pottery spend a considerable amount of time on a fundamental task – providing precise descriptions of pottery fragments. This study presents a survey of existing computational solutions to identify the best matches for a given fragment, based on its shape.
Carmela Chateau-Smith+4 more
openaire +5 more sources
Tool for group contribution methods – computational fragmentation [PDF]
Group contribution methods are presently one of the universal and the most frequently used approach to estimate many physico-chemical properties of compounds. One of the important steps in development of group contribution method is a correct division of chemical structures of compounds into defined structural fragments.
Kolská, Z., Petrus, P. (Pavel)
openaire +2 more sources
The fragmentation pathways of protonated glycine: A computational study
Numerous studies have demonstrated that protonated aliphatic amino acids, [H2NCHRCO2H + H]+, fragment in the gas phase to form iminium ions, H2N=CHR+. Unfortunately none of these studies have probed the structure of the neutral(s) lost as well as the mechanism of fragmentation.
Christopher M. Hadad+4 more
openaire +3 more sources
Computational complexity of one-variable fragments of products with T
We show that products of propositional modal logics containing the logic of reflexive frames T as a factor are embeddable into their single-variable fragments. The proof is a simplified version of the proof, to appear, of a similar result for products and expanding relativized products containing as a factor the logic KTB of reflexive and symmetric ...
Aleksandrov, K.+2 more
openaire +2 more sources