Hollow nanoparticles (NPs) are produced by void nucleation and growth during chemical reactions. However, there is no proper understanding of nucleation and growth mechanisms and their predictive modeling. Models based on the Kirkendall effect predict the process time, which is larger by orders of magnitude than in experiment. This is why some works propose that a large tensile pressure in the ...

Size-exclusion chromatography (SEC) and capillary zone electrophoresis (CZE) coupled with inductively coupled plasma mass spectrometry were applied to characterize low, medium, and high molecular weight cadmium complexes with glutathione and phytochelatins (PCs). The dominant stoichiometry of the complexes formed in vitro was established as 1:1 using electrospray ionization mass spectrometry. C...

They all describe events of an apple’s being on the tray and Tom’s eating it. But, there exist several intriguing differences between the two constructions. One crucial difference between the IHRC and EHRC comes from the fact that the semantic object of mekessta ‘ate’ in IHRC examples like (1)a is the NP sakwa ‘apple’ buried inside the embedded clause followed by kes. It is thus the subject of ...

In this paper, we study the evolution of a relativistic, superhorizon-sized void embedded in a Friedmann-Robertson-Walker universe. We numerically solve the spherically symmetric general relativistic equations in comoving, synchronous coordinates. Initially, the fluid inside the void is taken to be homogeneous and nonexpanding. In a radiation-dominated universe, we find that radiation diffuses ...

The purpose of this work is to extend logic programming beyond normal programs, as defined in [Lloy87], and thus beyond(positive) definite clause programming, by allowing also definite negative heads. Thus we admit program clauses with both positive and (classically) negated atoms conjoined in the body, and at most one literal as its head (clauses with disjunctions of literals in the head are t...

We present algorithms that learn certain classes of function-free recursive logic programs in polynomial time from equivalence queries. In particular, we show that a single k-ary recursive constant-depth determinate clause is learnable. Two-clause programs consisting of one learnable recursive clause and one constant-depth determinate non-recursive clause are also learnable, if an additional \b...

In the area of inductive learning, generalization is a main operation, and the usual deenition of induction is based on logical implication. Recently there has been a rising interest in clausal representation of knowledge in machine learning. Almost all inductive learning systems that perform generalization of clauses use the relation-subsumption instead of implication. The main reason is that ...

Feature Terms are a generalization of first-order terms that have been introduced in theoretical computer science in order to formalize object-oriented capabilities of declarative languages, and which have been recently received increased attention for their usefulness in structured machine learning applications. The main obstacle with feature terms (as well as other formal representation langu...