BOOK REVIEW

ABSTRACT

A previous paper reported the effect of increasing concentrations of hydrofluoric, oxalic, sulfuric and phosphoric acids at three fixed HCl or HNO₃ concentrations on the retention of Am(III), Th(IV) or Np(IV), and U(VI) by the new chelating ion-exchange resin Diphonix?. In this paper the metal uptake data have been analyzed by calculating the effect that complex formation in solution has on the overall metal uptake by the resin. The calculations performed have allowed us to conclude that in most cases the uptake of Am(III) and U(VI) by Diphonix can be explained by assuming that only the uncomplexed metal cation is sorbed. With tetravalent actinides, on the contrary, the uptake data can only be explained if the simultaneous sorption of the uncomplexed cation and of neutral metal complexes is assumed. Indirect evidence has also been obtained on the existence of anionic fluoride complexes of Np(IV). In all other cases, with minor exceptions, the complex formation data available in the literature seem to describe accurately the behavior of the investigated systems.     

ZnWO4 scintillators for cryogenic dark matter experiments

The scintillation properties of a zinc tungstate crystal, shaped as a hexagonal prism (height 40 mm, diagonal 40 mm) were determined. An energy resolution of 10.7% for the 662 keV γ-line of ¹³⁷Cs was measured with the scintillator placed in a light collection setup similar to that used by the CRESST dark matter search. The light output and decay kinetics of ZnWO₄ were examined over the temperature range 7–300 K and confirmed to be competitive with those of CaWO₄. The radioactive contaminations of the ZnWO₄ scintillator measured in the Solotvina Underground Laboratory do not exceed 0.1–10 mBq/kg (depending on radionuclide). Our study highlights the excellent feasibility of this ZnWO₄ scintillator for a cryogenic dark matter experiment.     

Nanocomposites consisting of titanium dioxide nanoparticles and oligonucleotides

The use of various nanoparticles is a promising way to solve the current problem of drug delivery in medicine and biology. Nanocomposites consisting of titanium dioxide and oligonucleotides noncovalently attached to nanoparticles through the polylysine linker (TiO2 x PL-DNA) have been designed to deliver of DNA fragments into cells. Three forms of TiO2 nanoparticles (amorphous, anatase, and brookite) were used for construction of nanocomposites. The size, morphology, and chemical composition of TiO2 nanoparticles and TiO2 x PL-DNA nanocomposites were characterized. DNA fragments in the proposed nanocomposites were shown to retain their ability to form complementary complexes. TiO2 x PL-DNA nanocomposites independently on the form of nanoparticles were shown by confocal microscopy to penetrate into HeLa cells without any transfection agents and physical impact. The presented type of nanocomposites can be applied in the thriving technology of drug delivery to achieve high therapeutic and biological efficacy.     

Reduction in database search space by utilization of amino acid composition information from electron transfer dissociation and higher-energy collisional dissociation mass spectra

With high-mass accuracy and consecutively obtained electron transfer dissociation (ETD) and higher-energy collisional dissociation (HCD) tandem mass spectrometry (MS/MS), reliable (≥97%) and sensitive fragment ions have been extracted for identification of specific amino acid residues in peptide sequences. The analytical benefit of these specific amino acid composition (AAC) ions is to restrict the database search space and provide identification of peptides with higher confidence and reduced false negative rates. The 6706 uniquely identified peptide sequences determined with a conservative Mascot score of >30 were used to characterize the AAC ions. The loss of amino acid side chains (small neutral losses, SNLs) from the charge reduced peptide radical cations was studied using ETD. Complementary AAC information from HCD spectra was provided by immonium ions. From the ETD/HCD mass spectra, 5162 and 6720 reliable SNLs and immonium ions were successfully extracted, respectively. Automated application of the AAC information during database searching resulted in an average 3.5-fold higher confidence level of peptide identification. In addition, 4% and 28% more peptides were identified above the significance level in a standard and extended search space, respectively.     

Supermartingales in prediction with expert advice

The paper applies the method of defensive forecasting, based on the use of game-theoretic supermartingales, to prediction with expert advice. In the traditional setting of a countable number of experts and a finite number of outcomes, the Defensive Forecasting Algorithm is very close to the well-known Aggregating Algorithm. Not only the performance guarantees but also the predictions are the same for these two methods of fundamentally different nature. The paper also discusses a new setting where the experts can give advice conditional on the learner’s future decision. Both the algorithms can be adapted to the new setting and give the same performance guarantees as in the traditional setting. Finally, an application of defensive forecasting to a setting with several loss functions is outlined.     

Kernels for feedback arc set in tournaments

A tournament T=(V,A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, the Feedback Arc Set problem asks whether the given digraph has a set of k arcs whose removal results in an acyclic digraph. The Feedback Arc Set problem restricted to tournaments is known as the k-Feedback Arc Set in Tournaments (k-FAST) problem. In this paper we obtain a linear vertex kernel for k-FAST. That is, we give a polynomial time algorithm which given an input instance T to k-FAST obtains an equivalent instance T^′ on O(k) vertices. In fact, given any fixed ?>0, the kernelized instance has at most (2+?)k vertices. Our result improves the previous known bound of O(k²) on the kernel size for k-FAST. Our kernelization algorithm solves the problem on a subclass of tournaments in polynomial time and uses a known polynomial time approximation scheme for k-FAST.     

How to Guard a Graph?

We initiate the study of the algorithmic foundations of games in which a set of cops has to guard a region in a graph (or digraph) against a robber. The robber and the cops are placed on vertices of the graph; they take turns in moving to adjacent vertices (or staying). The goal of the robber is to enter the guarded region at a vertex with no cop on it. The problem is to find the minimum number of cops needed to prevent the robber from entering the guarded region. The problem is highly non-trivial even if the robber’s or the cops’ regions are restricted to very simple graphs. The computational complexity of the problem depends heavily on the chosen restriction. In particular, if the robber’s region is only a path, then the problem can be solved in polynomial time. When the robber moves in a tree (or even in a star), then the decision version of the problem is NP-complete. Furthermore, if the robber is moving in a directed acyclic graph, the problem becomes PSPACE-complete.