超重元素(新核素)合成研究进展情况分析和展望

本文在介绍和分析国际、国内在超重元素（新核素）合成实验研究与理论研究进展情况的基础上对我国今后如何从理论与实验的结合上开展超重元素（核）合成研究工作提出一些看法和建议，提供讨论。     

Gold ultra-microelectrode arrays: application to the steady-state voltammetry of hydroxide ion in aqueous solution.

Gold ultra-microelectrode arrays are used to explore the electrochemical oxidation of hydroxide ions and are shown to be analytical useful. Two types of ultra-microelectrode arrays are used; the first consist of 256 individual electrodes of 5 microm in radius, 170 of which are electrochemically active in a cubic arrangement which are separated from their nearest neighbour by a distance of 100 microm. The second array compromises 2597 electrodes of 2.5 microm in radius and of which 1550 of which are electrochemically active in a hexagonal arrangement separated by the nearest neighbour by 55 microm. Well defined voltammetric waves are found with peak currents proportional to the concentration of hydroxide ions in the range 50 microM to 1 mM. Detection limits of 20 microM using the 170 ultra-microelectrode and 10 microM with the 1550 ultra-microelectrode array are shown to be possible but with a higher sensitivity of 4 mA M(-1) observed using the 1550 ultra-microelectrode array compared to 1.2 mA M(-1) with the 170 ultra-microelectrode array.     

The measure of a translated ball in uniformly convex spaces

Let (E, ¦·¦) be a uniformly convex Banach space with the modulus of uniform convexity of power type. Let be the convolution of the distribution of a random series inE with independent one-dimensional components and an arbitrary probability measure onE. Under some assumptions about the components and the smoothness of the norm we show that there exists a constant such that |{·<t}–{·+r<t}|r ^q , whereq depends on the properties of the norm. We specify it in the case ofL spaces, >1.     

The complexity of many cells in arrangements of planes and related problems

We consider several problems involving points and planes in three dimensions. Our main results are: (i) The maximum number of faces boundingm distinct cells in an arrangement ofn planes isO(m ^2/3 n logn +n ²); we can calculatem such cells specified by a point in each, in worst-case timeO(m ^2/3 n log³ n+n ² logn). (ii) The maximum number of incidences betweenn planes andm vertices of their arrangement isO(m ^2/3 n logn+n ²), but this number is onlyO(m ^3/5– n ^4/5+2 +m+n logm), for any>0, for any collection of points no three of which are collinear. (iii) For an arbitrary collection ofm points, we can calculate the number of incidences between them andn planes by a randomized algorithm whose expected time complexity isO((m ^3/4– n ^3/4+3 +m) log² n+n logn logm) for any>0. (iv) Givenm points andn planes, we can find the plane lying immediately below each point in randomized expected timeO([m ^3/4– n ^3/4+3 +m] log² n+n logn logm) for any>0. (v) The maximum number of facets (i.e., (d–1)-dimensional faces) boundingm distinct cells in an arrangement ofn hyperplanes ind dimensions,d>3, isO(m ^2/3 n ^d/3 logn+n ^d–1). This is also an upper bound for the number of incidences betweenn hyperplanes ind dimensions andm vertices of their arrangement. The combinatorial bounds in (i) and (v) and the general bound in (ii) are almost tight.Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by NSF Grant CCR-8714565. Work by the third author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-82-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. An abstract of this paper has appeared in theProceedings of the 13th International Mathematical Programming Symposium, Tokyo, 1988, p. 147.     

Implicitly representing arrangements of lines or segments

Anarrangement ofn lines (or line segments) in the plane is the partition of the plane defined by these objects. Such an arrangement consists ofO(n ²) regions, calledfaces. In this paper we study the problem of calculating and storing arrangementsimplicitly, using subquadratic space and preprocessing, so that, given any query pointp, we can calculate efficiently the face containingp. First, we consider the case of lines and show that with (n) space¹ and (n ^3/2) preprocessing time, we can answer face queries in (n)+O(K) time, whereK is the output size. (The query time is achieved with high probability.) In the process, we solve three interesting subproblems: (1) given a set ofn points, find a straight-edge spanning tree of these points such that any line intersects only a few edges of the tree, (2) given a simple polygonal path , form a data structure from which we can find the convex hull of any subpath of quickly, and (3) given a set of points, organize them so that the convex hull of their subset lying above a query line can be found quickly. Second, using random sampling, we give a tradeoff between increasing space and decreasing query time. Third, we extend our structure to report faces in an arrangement of line segments in (n ^1/3)+O(K) time, given(n ^4/3) space and (n ^5/3) preprocessing time. Lastly, we note that our techniques allow us to computem faces in an arrangement ofn lines in time (m ^2/3 n ^2/3+n), which is nearly optimal.The first author is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565. Work on this paper by the fifth author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. The sixth author was supported in part by a National Science Foundation Graduate Fellowship. This work was begun while the non-DEC authors were visiting at the DEC Systems Research Center.     

Forward-backward multiplicity correlations in σ+ p,K + p andpp collisions at 250 GeV/c

Forward-backward multiplicity correlations in σ⁺,K ⁺ p andpp collisions at 250 GeV/c ( \(\sqrt s \) =22 GeV) are given for all charges and for the different charge combinations. The correlations are found to be caused predominantly by centrally produced particles. It is demonstrated that this result is an agreement with observations at the ISR and the CERNp \(\bar p\) -Collider. The results are compared to expectations from LUND, DPM and FRITIOF Monte Carlo models and a geometrical picture relating correlations in hadron-hadron collisions toe ⁺ e ^? data in terms of impact parameters is tested.     

Influence of ethanol oxidation rate on the lactate/pyruvate ratio and phosphorylation state of the liver in fed rats.

The effect of the ethanol oxidation rate on the interaction between the phosphorylation state (the [ATP]/[ADP] X [HPO4]2- ratio) and the redox state (the free [NAD+]/[NADH] ratio) of the liver cytosol was studied in intact fed rats. The rate of ethanol oxidation was inhibited to different degrees with pyrazole. The ethanol oxidation rate had no influence on the liver lactate level but correlated significantly with the pyruvate level. Accordingly, a significant correlation was also found between the ethanol oxidation rate and the lactate/pyruvate ratio. The rate of ethanol oxidation correlated significantly with the liver 3-phosphoglycerate level. No change in the glyceraldehyde-3-phosphate level was found. No correlation was found between the ethanol oxidation rate and the glyceraldehyde-3-phosphate/3-phosphoglycerate redox couple. Ethanol administration slightly increased the liver ATP level, but the simultaneous administration of pyrazole eliminated this effect. Other adenine nucleotides and HPO4 2- were not changed. The changes in the rate of ethanol oxidation had no effect on the phosphorylation state in the fed liver. It is assumed that in the fed liver the phosphorylation state is so well stabilized that the redox level has no influence.     

Characterization of N-terminal processing of group VIA phospholipase A<Subscript>2</Subscript> and of potential cleavage sites of amyloid precursor protein constructs by automated identification of signature peptides in LC/MS/MS analyses of proteolytic digests

Dysregulation of proteolytic processing of the amyloid precursor protein (APP) contributes to the pathogenesis of Alzheimer's Disease, and the Group VIA phospholipase A(2) (iPLA(2)beta) is the dominant PLA(2) enzyme in the central nervous system and is subject to regulatory proteolytic processing. We have identified novel N-terminal variants of iPLA(2)beta and previously unrecognized proteolysis sites in APP constructs with a C-terminal 6-myc tag by automated identification of signature peptides in LC/MS/MS analyses of proteolytic digests. We have developed a Signature-Discovery (SD) program to characterize protein isoforms by identifying signature peptides that arise from proteolytic processing in vivo. This program analyzes MS/MS data from LC analyses of proteolytic digests of protein mixtures that can include incompletely resolved components in biological samples. This reduces requirements for purification and thereby minimizes artifactual modifications during sample processing. A new algorithm to generate the theoretical signature peptide set and to calculate similarity scores between predicted and observed mass spectra has been tested and optimized with model proteins. The program has been applied to the identification of variants of proteins of biological interest, including APP cleavage products and iPLA(2)beta, and such applications demonstrate the utility of this approach.