bluuebunny/crossref_metadata_2025 huggingface dataset:
Healing, post‐operative morbidity and patient perception of outcomes following regenerative therapy of deep intrabony defects
Authors: Tonetti Maurizio S. , Fourmousis Ioannis , Suvan Jeanie , Cortellini Pierpaolo , Brägger Urs , Lang Niklaus P. ,   on behalf of the European Research Group on Periodontology (ERGOPERIO)
Published: November 2004

Aim: This prospective multicenter randomized controlled clinical trial was designed to compare the clinical outcomes of papilla preservation flap surgery with or without the application of enamel matrix derivatives (EMD). This article reports on early healing events, post‐operative morbidity and patient perceptions of the surgical outcomes.

Material and Methods: One hundred and seventy‐two patients with advanced chronic periodontitis and at least one intrabony defect of 3 mm were recruited in 12 centres in seven countries (European Research Group on Periodontology (ERGOPERIO)). Papilla preservation flaps were used to obtain access and primary closure. After debridement, and root conditioning, EMD was applied in the test subjects, and omitted in the controls. Healing was monitored 1, 2, 3, 4, 6 and 12 weeks after surgery. During the first 12 weeks of healing, supracrestal soft‐tissue density was evaluated with a computer‐assisted densitometric image analysis system (CADIA) using underexposed radiographs taken on a subset of 34 patients. Patient perceptions were evaluated with a questionnaire immediately after the procedure, at suture removal 1 week later and at 1 year.

Results: Subjects reported little intraoperative or post‐operative pain or discomfort for both test and controls. Twenty‐four percent of controls and 30% of tests (p=0.64) reported a degree of interference with daily activities for an average of 3 and 3.5 days, respectively. Post‐surgical edema was noted in 25% of tests and 28% of controls. Wound dehiscence in the interdental portion of the flap was uncommon (14% of tests and 12% of controls at week 1) and of limited size. Root sensitivity was the most frequent post‐operative adverse event: it affected 45% of test and 35% of controls (p=0.55). Up to 6 weeks post‐operatively, soft‐tissue densities were significantly higher in subjects treated with EMD with respect to controls. One year after completion of the surgery, patients reported high levels of satisfaction with the outcomes. The most frequently reported benefits included the ability to preserve a tooth/dentition and to maintain/improve chewing ability. The cost and need for frequent follow‐ups were cited as significant drawbacks.

Conclusions: This study portrayed the early healing events, pain, discomfort and adverse events of papilla preservation flap surgery and the 1‐year patient perceptions of the benefits and disadvantages of periodontal surgery in intrabony defects. Earlier gains in soft‐tissue density were observed following application of EMD. In terms of patient‐centered outcomes, however, both procedures performed in a similar manner.
Quantitative real‐time polymerase chain reaction versus culture: a comparison between two methods for the detection and quantification of Actinobacillus actinomycetemcomitans, Porphyromonas gingivalis and Tannerella forsythensis in subgingival plaque samples
Authors: Lau Laura , Sanz Mariano , Herrera David , Morillo Juan Manuel , Martín Conchita , Silva Augusto
Published: November 2004

Objective: The purpose of this investigation was to validate a real‐time quantitative polymerase chain reaction (PCR) assay in identifying and quantifying Actinobacillus actinomycetemcomitans, Porphyromonas gingivalis and Tannerella forsythensis from subgingival plaque samples taken from subjects with different periodontal conditions, when compared with conventional cultural procedures.

Patients and Methods: Ninety‐two adult subjects participated in this study, 32 with periodontitis, 30 with gingivitis and 30 healthy. A pooled subgingival sample was obtained from every patient. Culturing procedures were carried out using standard techniques. For real‐time PCR analysis, primers were selected from sequences of the LktC (A. actinomycetemcomitans), Arg‐gingipain (P. gingivalis) and BspA antigen (T. forsythensis) genes. Contingency tables were constructed to compare the qualitative results, while quantitative data were evaluated by paired t‐test.

Results: A. actinomycetemcomitans was the least frequently recovered species with both techniques. Prevalence of P. gingivalis was low in healthy patients, increased in gingivitis and peaked in periodontitis patients. The frequency of detection of T. forsythensis showed marked differences between culture and PCR, although the same tendency of an increase in prevalence from health to gingivitis and to periodontitis was observed with both methods. Contingency tables demonstrated a good level of agreement between PCR and culture procedures for A. actinomycetemcomitans and P. gingivalis, especially in periodontitis patients. P. gingivalis culture counts were significantly higher than those obtained by PCR. The opposite was true for T. forsythensis, and statistically significant higher counts were obtained by PCR for gingivitis and periodontitis patients.

Conclusion: This study demonstrated a good agreement between the quantitative PCR technology and the culture procedure. The high sensitivity and specificity of the quantitative PCR technology justify its use in epidemiological studies and as an adjunct in clinical diagnosis of periodontal patients.
Comparative effects of different chlorhexidine mouth‐rinse formulations on volatile sulphur compounds and salivary bacterial counts
Authors: Roldán Silvia , Herrera David , Santa‐Cruz Isabel , O'Connor Ana , González Itziar , Sanz Mariano
Published: November 2004

Aim: To compare five different commercial mouth rinses with chlorhexidine (CHX) with respect to their anti‐halitosis effect and anti‐microbial activity on salivary bacterial counts, following a standardised research protocol. And secondly, to validate the study model proposed in the evaluation of patients suffering from halitosis.

Patients and Methods: Ten volunteers, with a healthy oral status, were enrolled in a double‐blind, cross‐over design, using sterile saline as negative control and five CHX‐containing mouth rinses: 0.12% CHX alone (CHX+NO), plus alcohol (CHX+ALC), plus 0.05% cetylpiridinium chloride (CHX+CPC), plus sodium fluoride (CHX+NaF), and 0.05% CHX plus 0.05% CPC, plus 0.14% zinc lactate (CHX+Zn). The levels of whole‐mouth volatile sulphur compounds (VSCs) were measured by means of a sulphide monitor at baseline, 1 and 5 h after rinsing with the assigned product. Baseline measurements also included an organoleptic assessment and the recording of the tongue‐coating index. Aerobic and anaerobic salivary bacterial counts were also obtained by collecting unstimulated saliva samples at the same evaluation times, and processed by culturing techniques. Analysis of variance was used to evaluate whether significant differences existed among groups, at each evaluation point, or in changes between evaluations.

Results: No significant differences were detected at baseline, with VSC levels ranging between 190 and 227 parts per billion (p.p.b.) After rinsing, VSC levels were reduced with all products (except saline), after 1 h. Significant differences at 1 h were detected (p=0.04), corresponding to a lower amount of p.p.b. (109) in (CHX+Zn) as compared with the other groups (except CHX+NO). At 5 h, VSC levels were lower for CHX+CPC and CHX+Zn (155 and 169, respectively), while the other groups showed levels higher than 220 p.p.b. With respect to aerobic salivary bacterial counts, CHX+CPC demonstrated the lowest percentage of survival (6% after 1 h and 18% after 5 h). For anaerobic bacterial counts, again CHX+CPC demonstrated the lowest percentage of survival (10% at 1 h and 23% at 5 h), together with CHX+ALC (18% of survival at 5 h). However, salivary counts and VSCs were only significantly correlated at baseline, but not after treatment.

Conclusion: Important differences can be expected from different CHX formulations, in relation to both their anti‐halitosis effect and anti‐microbial activity in saliva. Formulations that combine CHX and CPC achieved the best results, and a formulation combining CHX with NaF resulted in the poorest.
The clinical course of chronic periodontitis
Authors: Schätzle Marc , Löe Harald , Lang Niklaus P. , Bürgin Walter , Ånerud Åge , Boysen Hans
Published: November 2004

Aim: The purpose of this study was to assess the long‐term influence of gingival inflammation on tooth loss.

Material and Methods: The data originated from a 26‐year longitudinal study of Norwegian males, who practiced adequate daily oral home care and received “state‐of‐the‐art” dental care. The initial examination in 1969 included 565 individuals aged between 16 and 34 years. Subsequent examinations took place in 1971, 1973, 1975, 1981, 1988 and 1995. Thus, the study covers the age range of 16–59 years. The teeth were divided into three tooth groups (I–III) reflecting the history of inflammation of the surrounding gingiva (gingival index (GI) scores) over 26 years: (I) teeth with surrounding gingival units scoring a minimum of one site with GI=0 and a maximum of three sites with GI=1, (II) teeth with surrounding gingival units scoring a minimum of one site with GI=1 and a maximum of three sites with GI=2 over the observation periods and (III) teeth with surrounding gingival units always scoring a minimum of GI=2 (bleeding on probing) at all sites over the observation period.

Results: At baseline (1969), out of possible 15,820 teeth (565 × 28), 15,383 teeth were present. Four hundred and thirty‐seven teeth had already been missing for unknown reasons. By 1995, 13,159 teeth were reexamined, i.e. over the 26‐year observation period only 126 (0.95%) teeth were lost. Only 16 (0.28%) of 5793 teeth belonging to GI‐Severity Group I were lost. In the GI‐Severity Group II, however, 78 (2.28%) out of 3348 teeth were lost, and 13 (11.21%) of 103 teeth with GI‐Severity Group III were lost. Teeth with GI‐Severity Group III yielded an odds ratio for tooth loss that was 46 times higher than that of teeth with GI‐Severity Group I, and five times higher than that of teeth with GI‐Severity Group II over 26 years. Furthermore, teeth with the GI‐Severity Group II had a nine times higher risk for tooth loss than teeth with the GI‐Severity Group I.

The GI‐Severity Group I retained 99.5% of the teeth after a tooth age of 51 years. The GI‐Severity Group II retained 93.8% of the teeth after a tooth age of 50 years. However, in the GI‐Severity Group III, 63.4% of the teeth were retained for a tooth age of 47 years.

Conclusions: Teeth surrounded with inflammation‐free gingival tissues were maintained for a tooth age of 51 years, while teeth consistently surrounded with inflamed gingivae yielded a 46‐times higher risk to be lost. Only two‐thirds of such teeth were maintained throughout the 26‐year observation period. This documents the role of gingival inflammation as a risk factor for future tooth loss.
Regulation of pyruvate dehydrogenase activity and citric acid cycle intermediates during high cardiac power generation
Authors: Sharma Naveen , Okere Isidore C. , Brunengraber Daniel Z. , McElfresh Tracy A. , King Kristen L. , Sterk Joseph P. , Huang Hazel , Chandler Margaret P. , Stanley William C.
Published: November 2004

A high rate of cardiac work increases citric acid cycle (CAC) turnover and flux through pyruvate dehydrogenase (PDH); however, the mechanisms for these effects are poorly understood. We tested the hypotheses that an increase in cardiac energy expenditure: (1) activates PDH and reduces the product/substrate ratios ([NADH]/[NAD+] and [acetyl‐CoA]/[CoA‐SH]); and (2) increases the content of CAC intermediates. Measurements were made in anaesthetized pigs under control conditions and during 15 min of a high cardiac workload induced by dobutamine (Dob). A third group was made hyperglycaemic (14 mm) to stimulate flux through PDH during the high work state (Dob + Glu). Glucose and fatty acid oxidation were measured with 14C‐glucose and 3H‐oleate. Compared with control, the high workload groups had a similar increase in myocardial oxygen consumption ( and cardiac power. Dob increased PDH activity and glucose oxidation above control, but did not reduce the [NADH]/[NAD+] and [acetyl‐CoA]/[CoA‐SH] ratios, and there were no differences between the Dob and Dob + Glu groups. An additional group was treated with Dob + Glu and oxfenicine (Oxf) to inhibit fatty acid oxidation: this increased [CoA‐SH] and glucose oxidation compared with Dob; however, there was no further activation of PDH or decrease in the [NADH]/[NAD+] ratio. Content of the 4‐carbon CAC intermediates succinate, fumarate and malate increased 3‐fold with Dob, but there was no change in citrate content, and the Dob + Glu and Dob + Glu + Oxf groups were not different from Dob. In conclusion, compared with normal conditions, at high myocardial energy expenditure (1) the increase in flux through PDH is regulated by activation of the enzyme complex and continues to be partially controlled through inhibition by fatty acid oxidation, and (2) there is expansion of the CAC pool size at the level of 4‐carbon intermediates that is largely independent of myocardial fatty acid oxidation.
Increased ratio of rapsyn to ACh receptor stabilizes postsynaptic receptors at the mouse neuromuscular synapse
Authors: Gervásio Othon L. , Phillips William D.
Published: November 2004

The metabolic turnover of nicotinic ACh receptors (AChR) at the neuromuscular synapse is regulated over a tenfold range by innervation status, muscle electrical activity and neural agrin, but the downstream effector of such changes has not been defined. The AChR‐associated protein rapsyn is essential for forming AChR clusters during development. Here, rapsyn was tagged with enhanced green fluorescent protein (EGFP) to begin to probe its influence at the adult synapse. In C2 myotubes, rapsyn–EGFP participated with AChR in agrin‐induced AChR cluster formation. When electroporated into the tibialis anterior muscle of young adult mice, rapsyn–EGFP accumulated in discrete subcellular structures, many of which colocalized with Golgi markers, consistent with the idea that rapsyn assembles with AChR in the exocytic pathway. Rapsyn–EGFP also targeted directly to the postsynaptic membrane where it occupied previously vacant rapsyn binding sites, thereby increasing the rapsyn to AChR ratio. At endplates displaying rapsyn–EGFP, the metabolic turnover of AChR (labelled with rhodamine‐α‐bungarotoxin) was slowed. Thus, the metabolic half‐life of receptors at the synapse may be modulated by local changes in the subsynaptic ratio of rapsyn to AChR.
No Transcription-Translation Feedback in Circadian Rhythm of KaiC Phosphorylation
Authors: Tomita Jun , Nakajima Masato , Kondo Takao , Iwasaki Hideo
Published: November 2004

An autoregulatory transcription-translation feedback loop is thought to be essential in generating circadian rhythms in any model organism. In the cyanobacterium
Synechococcus elongatus
, the essential clock protein KaiC is proposed to form this type of transcriptional negative feedback. Nevertheless, we demonstrate here temperature-compensated, robust circadian cycling of KaiC phosphorylation even without
kaiBC
messenger RNA accumulation under continuous dark conditions. This rhythm persisted in the presence of a transcription or translation inhibitor. Moreover, kinetic profiles in the ratio of KaiC autophosphorylation-dephosphorylation were also temperature compensated in vitro. Thus, the cyanobacterial clock can keep time independent of de novo transcription and translation processes.
COX-2-Derived Prostacyclin Confers Atheroprotection on Female Mice
Authors: Egan Karine M. , Lawson John A. , Fries Susanne , Koller Beverley , Rader Daniel J. , Smyth Emer M. , FitzGerald Garret A.
Published: November 2004

Female gender affords relative protection from cardiovascular disease until the menopause. We report that estrogen acts on estrogen receptor subtype alpha to up-regulate the production of atheroprotective prostacyclin, PGI
2
, by activation of cyclooxygenase 2 (COX-2). This mechanism restrained both oxidant stress and platelet activation that contribute to atherogenesis in female mice. Deletion of the PGI
2
receptor removed the atheroprotective effect of estrogen in ovariectomized female mice. This suggests that chronic treatment of patients with selective inhibitors of COX-2 could undermine protection from cardiovascular disease in premenopausal females.
Semaphorin 3E and Plexin-D1 Control Vascular Pattern Independently of Neuropilins
Authors: Gu Chenghua , Yoshida Yutaka , Livet Jean , Reimert Dorothy V. , Mann Fanny , Merte Janna , Henderson Christopher E. , Jessell Thomas M. , Kolodkin Alex L. , Ginty David D.
Published: November 2004

The development of a patterned vasculature is essential for normal organogenesis. We found that signaling by semaphorin 3E (Sema3E) and its receptor plexin-D1 controls endothelial cell positioning and the patterning of the developing vasculature in the mouse. Sema3E is highly expressed in developing somites, where it acts as a repulsive cue for plexin-D1–expressing endothelial cells of adjacent intersomitic vessels. Sema3E–plexin-D1 signaling did not require neuropilins, which were previously presumed to be obligate Sema3 coreceptors. Moreover, genetic ablation of Sema3E or plexin-D1 but not neuropilin-mediated Sema3 signaling disrupted vascular patterning. These findings reveal an unexpected semaphorin signaling pathway and define a mechanism for controlling vascular patterning.
ON THE AVERAGE ALTITUDE OF HEAP-ORDERED TREES
Authors: CHEN WEN-CHIN , NI WEN-CHUN
Published: November 2004

We consider heap-ordered trees in this paper. The main theorems in this paper show that the average and the variance of the altitude (or level) of the nodes in a random n-node heap-ordered tree are [Formula: see text] and [Formula: see text], respectively where γ=0.5772156649… is the Euler’s constant.
RELAXED INORDER HEAPS
Authors: KHOONG C.M. , LEONG H.W.
Published: November 2004

In this paper, we introduce a new variant of implicit heaps, called relaxed inorder heaps. The structure is semi-implicit due to the use of 1 extra bit per node to maintain heap order and the allowance of some systematically controlled extra space. We show that relaxed inorder heaps are asymptotically more efficient than other known variants of implicit heaps. In particular, relaxed inorder heaps are especially efficient for heap merging and splitting operations, which are known to be problematic operations for implicit heaps.

Using amortized analysis, we derive several improved time bounds. Heap creation can be done in O(n) comparisons and node movements. Finding the minimum node and node insertion can each be done in O(1) comparisons and node movements. Key updating and node deletion can each be done in O(log n) comparisons and node movements. As for merging, we show that O(1) comparisons and 2k+O(1) node movements are sufficient for merging two heaps of sizes n and k. For splitting, we show that O(log n) comparisons and 1.5k+O(log n) node movements are sufficient for splitting an n-node implicit heap into two heaps of sizes k and n−k. The amount of extra space in a relaxed inorder heap is O(log n) if splitting does not occur, and O(n) otherwise.

The significance of our results is that small sophistication in the structure of implicit heaps can produce large improvements in efficiency. We have implemented the algorithms for operations on relaxed inorder heaps. The simulation results strongly indicate that relaxed inorder heaps are practical, since the constant factors recorded for the heap operations are all very small.
OPTIMAL INTER-FRAME ALIGNMENT FOR VIDEO COMPRESSION
Authors: CARPENTIERI BRUNO , STORER JAMES A.
Published: November 2004

Quite often a camera that is shooting a video sequence swings or rocks (for example the camera is hand held). For compression of digitized video it can be important to compensate for the motion of the camera by realigning the frames, shifting them one respect to the other, absorbing the movement of the camera. We show that for the general version of optimal frame alignment, the Vector Alignment problem is NP-complete. Moreover we prove that the Run Length Coding Alignment problem, a restricted subcase of the Vector Alignment problem that has direct application in video compression, can be solved in linear time by a dynamic programming algorithm.
DYNAMIC TREE REBALANCING USING RECURRENT ROTATIONS: DYNAMIC TREE REBALANCING
Authors: MAELBRÁNCKE RUDI , OLIVIÉ HENK
Published: November 2004

A simple algorithm is given to rebalance a binary search tree of optimal height after a single update. The algorithm uses time which is linear in the number of nodes. In comparison to previous algorithms it is short and very easy to implement. Moreover, this algorithm can be used to implement other classes of balanced trees and it is suitable for each update. When applied to perfectly balanced trees it has a lower average cost than previous algorithms.
COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
Authors: CAI JIN-YI
Published: November 2004

Given a rational matrix A, and a set of rational matrices B, C,… which commute with A, we give polynomial time algorithms to compute exactly the Jordan Normal Form of A, as well as the transformed matrices of B, C,…. We also obtain the transformation matrix and its inverse exactly in polynomial time.
CONJUNCTIVE AND DISJUNCTIVE REDUCIBILITIES TO SPARSE AND TALLY SETS REVISITED
Authors: ĎURIŠ PAVOL , ROLIM JOSÉ D.P.
Published: November 2004

We continue the investigation of polynomial-time reducibilities along the directions of [8]. We show that there is a set which is f(n)-conjunctive (similarly f(n)-disjunctive) deterministic polynomial time reducible to a tally set but is not g(n)-conjunctive (respectively g(n)-disjunctive) deterministic polynomial time reducible to any sparse set. We also show that there is a set which is f(n)-conjunctive deterministic polynomial time reducible to a tally set but is not g(n)-turing non-deterministic polynomial time reducible to any tally set. Several interesting corollaries about the closure of sparse and tally sets under such reducibilities follow from these results.
SELECTION OF THE GROUND STATE FOR NONLINEAR SCHRÖDINGER EQUATIONS
Authors: SOFFER A. , WEINSTEIN M. I.
Published: November 2004

We prove for a class of nonlinear Schrödinger systems (NLS) having two nonlinear bound states that the (generic) large time behavior is characterized by decay of the excited state, asymptotic approach to the nonlinear ground state and dispersive radiation. Our analysis elucidates the mechanism through which initial conditions which are very near the excited state branch evolve into a (nonlinear) ground state, a phenomenon known as ground state selection. Key steps in the analysis are the introduction of a particular linearization and the derivation of a normal form which reflects the dynamics on all time scales and yields, in particular, nonlinear master equations. Then, a novel multiple time scale dynamic stability theory is developed. Consequently, we give a detailed description of the asymptotic behavior of the two bound state NLS for all small initial data. The methods are general and can be extended to treat NLS with more than two bound states and more general nonlinearities including those of Hartree–Fock type.
NONLINEAR SURFACE SUPERCONDUCTIVITY IN THE LARGE κ LIMIT
Authors: ALMOG Y.
Published: November 2004

The Ginzburg–Landau model for superconductivity is considered in two dimensions. We show, for smooth bounded domains, that the superconductivity order parameter decays exponentially fast away from the boundary as the Ginzburg–Landau parameter κ tends to infinity. We prove this result for applied magnetic fields satisfying hex-κ≫ log κ/κ, and therefore, improve a recent result of Pan [16].
RESPONSE PROPERTIES OF A POPULATION OF NEURONS
Authors: EKEBERG ÖRJAN
Published: November 2004

This work is concerned with the question of how a population of neurons responds to tonic and transient synaptic input from other similar populations. Because of the methodological problems involved in measuring and manipulating the firing properties of a large set of real neurons simultaneously, another strategy is used here: the experiments are made as a series of simulations using a population of realistic model neurons. The steady state response of this particular model neuron is found to be similar to that used in abstract nonspiking models. The transient response, however, reveals that even though each individual neuron simply changes its frequency moderately, the population can respond quickly and with damped oscillations. These oscillations are due to spike synchronization caused by systematic phase shifts induced by synchronous changes in the input.
A GRADIENT SYSTEM SOLUTION TO POTTS MEAN FIELD EQUATIONS AND ITS ELECTRONIC IMPLEMENTATION
Authors: URAHAMA KIICHI , UENO SHIN-ICHIRO
Published: November 2004

A gradient system solution method is presented for solving Potts mean field equations for combinatorial optimization problems subject to winner-take-all constraints. In the proposed solution method the optimum solution is searched by using gradient descent differential equations whose trajectory is confined within the feasible solution space of optimization problems. This gradient system is proven theoretically to always produce a legal local optimum solution of combinatorial optimization problems. An elementary analog electronic circuit implementing the presented method is designed on the basis of current-mode subthreshold MOS technologies. The core constituent of the circuit is the winner-take-all circuit developed by Lazzaro et al. Correct functioning of the presented circuit is exemplified with simulations of the circuits implementing the scheme for solving the shortest path problems.
A NEURAL NETWORK CLASSIFIER IN EXPERIMENTAL PARTICLE PHYSICS
Authors: HANDZEL AMIR A. , GROSSMAN T. , DOMANY E. , TAREM S. , DUCHOVNI E.
Published: November 2004

A classification problem in high energy physics has been solved on simulated data using a simple multilayer perceptron comprising binary units which was trained with the CHIR algorithm. The unstable training of such a network on a nonseparable set has been overcome by selecting those weight vectors with good performance while providing a flexible choice of the two types of classification errors. Specific features of the problem have been exploited in order to simplify and optimize the solution which has been compared to the popular backpropagation algorithm and found to perform on a similar level. Additional aspects of this work are the use of the CHIR algorithm on continuous input and incorporating the classic idea of a Φ-machine in a multilayer perceptron.
MULTIPROCESSOR AND MEMORY ARCHITECTURE OF THE NEUROCOMPUTER SYNAPSE-1
Authors: RAMACHER U. , RAAB W. , ANLAUF J. , HACHMANN U. , BEICHTER J. , BRÜLS N. , WEßELING M. , SICHENEDER E. , MÄNNER R. , GLÄß J. , WURZ A.
Published: November 2004

A general purpose neurocomputer, SYNAPSE-1, which exhibits a multiprocessor and memory architecture is presented. It offers wide flexibility with respect to neural algorithms and a speed-up factor of several orders of magnitude — including learning. The computational power is provided by a 2-dimensional systolic array of neural signal processors. Since the weights are stored outside these NSPs, memory size and processing power can be adapted individually to the application needs. A neural algorithms programming language, embedded in C ++ has been defined for the user to cope with the neurocomputer. In a benchmark test, the prototype of SYNAPSE-1 was 8000 times as fast as a standard workstation.
USING COHERENT PULSE WIDTH AND EDGE MODULATIONS IN ARTIFICIAL NEURAL SYSTEMS
Authors: REYNERI L. M. , CHIABERGE M. , DEL CORSO D.
Published: November 2004

This paper describes an existing silicon implementation of an artificial neural system based on coherent pulse width and edge modulation techniques. A chip set with different neural functions has been conceived, manufactured and tested. Neural circuits have been optimized for lowest computation energy and highest reconfigurability. The main device is a 32 × 32 synaptic array consuming 10 mW of power at 140 MCPS. Synapsis size is about 7.200 μ m 2 using a standard 1.5 μm CMOS technology.

The problem of interfacing robotic sensors and actuators is addressed: voltage, current and resistance-based sensors are considered for the measurement of physical quantities such as temperature, pressure, strain, etc. Low resolution imaging sensors for robotic vision are also considered.
ON-CHIP LEARNING WITH ANALOGUE VLSI NEURAL NETWORKS
Authors: TARASSENKO LIONEL , TOMBS JON , CAIRNS GRAHAM
Published: November 2004

Results from simulations of weight perturbation as an on-chip learning scheme for analogue VLSI neural networks are presented. The limitations of analogue hardware are modelled as realistically as possible. Thus synaptic weight precision is defined according to the smallest change in the weight setting voltage which gives a measurable change at the output of the corresponding neuron. Tests are carried out on a hard classification problem constructed from mobile robot navigation data. The simulations show that the degradation in classification performance on a 500-pattern test set caused by the introduction of realistic hardware constraints is acceptable: with 8-bit weights, updated probabilistically and with a simplified output error criterion, the error rate increases by no more than 7% when compared with weight perturbation implemented with full 32-bit precision.
OPTOELECTRONIC IMPLEMENTATION OF NEURAL NETWORKS
Authors: WEBB R. P.
Published: November 2004

The performance of electronic neural networks will eventually be limited by the capacity of their interconnections as operating speeds are increased. The use of optical connections to link electronic elements offers a way to overcome this problem. In particular, spatial optic techniques are especially suited to neural systems because of their parallel structure. Three experimental optoelectronic networks are described that employ holographic components and arrays of high-speed optical modulators. These networks have been used to demonstrate operation at 50 MHz, novel training algorithms and the expansion of a network to 64 × 8 connections with optical fan-out. A hybrid technique for integrating optoelectronic systems is also being developed.
MICRO-PIXE STUDIES OF MINERALIZED TISSUES – A QUANTITATIVE APPROACH
Authors: ROKITA E. , WROBEL A. , MUNNIK F. , MUSTSAERS P.H.A. , de VOIGT M.J.A.
Published: November 2004

A method of quantitative analysis of bone samples by simultaneous measurements of proton induced X-ray emission (PIXE) and Rutherford backscattered (RBS) spectra is described. The method is used for the evaluation of the data collected during proton microprobe irradiation. The RBS spectra are used for the determination of the sample thickness. The sample matrix is regarded as a mixture of collagen and hydroxyapatite. The unknown proportion of both compounds at each irradiated point is adjusted until the Ca concentration determined by PIXE is in accordance with the value calculated on the basis of the assumed matrix composition. For quantitative analysis, the calculation of the absolute yield using the thick target PIXE formula was applied. The sources and ranges of systematic errors are discussed.
EFFECT OF Ca-DTPA ON ESSENTIAL TRACE METALS IN RATS
Authors: SATO I. , MATSUSAKA N. , KOBAYASHI H. , SERA K. , FUTATSUGAWA S. , NISHIMURA Y.
Published: November 2004

Effects of one human-dose (30 µmol/kg) of calcium salt of diethylenetriaminepentaacetic acid (Ca-DTPA) on the urinary excretion of essential metals and on their concentration in several tissues were studied in rats by particle induced X-ray emission (PIXE). Ca-DTPA enhanced the urinary excretion of manganese, iron, copper and zinc, while their concentration in the liver, kidneys, brain and thigh bone remained unchanged. These results suggest that urinary loss of these metals caused by Ca-DTPA can be compensated by homeostatic mechanisms in the body under the treatment schedule of one human-dose per day.
DEVELOPMENT OF THE HIROSHIMA PROTON MICROBEAM SYSTEM
Authors: IWATANI K. , MIZUOKA T. , NISHIYAMA F. , TANAKA S. , FUKAMI K. , SHIZUMA K. , HASAI H.
Published: November 2004

A proton microbeam system is under construction for a 2.5 MV Van de Graaff in Hiroshima University. We have prepared and tested a proto-type target chamber, a beam scanning system, a secondary electron detection system and software for scanner control and data acquisition. The minimum beam spot size obtained so far is 3.0 µm×2.7 µm (FWHM) for 2 MeV protons.
NUCLEAR MICROSCOPY AT LIVERMORE
Authors: BENCH GRAHAM S.
Published: November 2004

The construction of a new Nuclear Microprobe at the Livermore multi-user 10 MV FN tandem Laboratory has recently been completed. The facility is primarily used for PIXE, PIGE and Proton energy loss tomography (PELT) in a broad range of multi-disciplinary sciences. Details of the new facility and current applications/programs are discussed.
POSSIBLE CHARACTERIZATION OF MOUSE STRAINS BY PLASMA ANALYSIS WITH PIXE
Authors: HOSHIKAWA KIYOFUSA , TAMANOI ITSURO , NAKAMURA AKEMI , KACHI MUTSUMI , OOHASHI KUNIO , MATSUMOTO SHINJI
Published: November 2004

We investigated the elemental composition of mouse blood plasma with PIXE method. We measured quantitative X-ray yields of S, Cl, K and Ca by changing sample volume from 1.25 to 15.0 µl to find the most profitable volume of plasma for elemental analysis. Linear relationships were confirmed between the applied volume (1.25~5.0 µl) and the counts of X-ray from each element. Some elements showed, however, saturated curves over 5.0 µl. Five μl was enough to analyze some important elements of blood plasma and used in the present analysis. We propose 5.0 µl as a standard amount of sample in plasma analysis. We found differences in the elemental ratio of X-ray counts in plasma among five mouse strains used in the present experiment. This result suggests that the strain differences in the elemental constitution of mouse blood plasma are related to those of physiological states such as the number of blood cells and the radio sensitivity.
PIXE ANALYSIS OF MINERAL WATER (EFFECT OF SAMPLE PRESERVATION)
Authors: FUTATSUGAWA S. , HATAKEYAMA S. , SAITOU Y. , SERA K.
Published: November 2004

Typical elements in PET bottled mineral water and in running water of public waterworks near by our cyclotron center was investigated by PIXE. We can detect typical elements in water sample using only a pipette. After water sample was preserved in a brown-glass vessel or a clear-glass vessel, Ba and Ti consisting in the vessels were detected in water samples. Concentration of typical elements in running water is found to be equal to that in PET bottled mineral water.
PULSED LOW POWER CMOS
Authors: GABARA THAD
Published: November 2004

A simple CMOS circuit technique called PPS (Pulsed Power Supply) CMOS is used to reduce the power dissipation of Conventional 0.9 μm CMOS by 10X when operated at 32 MHz. Combinational and sequential logic can utilize this technique including the I/O (input/output) buffers. Thus, PPS CMOS offers a full chip solution for low power dissipation CMOS.

In addition, several advantages occur in this new circuit technique: (1) low power signal propagation through several gates in series can occur during each evaluation cycle; (2) crowbar current does not occur; (3) additional placed devices, i.e. bipolar, diodes, JFETs are not required to generate this low power capability; (4) the Conventional CMOS process is used to fabricate the circuit; (5) the same physical layout can be used either as a PPS CMOS circuit or as a Conventional CMOS circuit; (6) the device count is the same as that of Conventional CMOS; (7) PPS CMOS uses quasistatic logic levels; (8) capacitive coupling is used to store and restore the contents of a memory cell; (9) the parasitic diodes of the MOS devices are used to improve the noise margin of the circuit; (10) PPS CMOS can easily hold a static state and have the same low power dissipation properties of data inactive Conventional CMOS.
FUTURE DIRECTIONS FOR HBT DEVELOPMENT
Authors: ASBECK P.M. , CHANG M.F. , PEDROTTI K.
Published: November 2004

This paper discusses several themes for the future improvement of HBTs and HBT-based integrated circuits, including the reduction of device dimensions, the integration of HBTs with additional devices, and the use of different materials. The motivation for these developments, and recent experimental work towards the realization of these improvements are described.
SIMPLE DETERMINISTIC AND RANDOMIZED ALGORITHMS FOR LINKED LIST RANKING ON THE EREW PRAM MODEL
Authors: DAS SAJAL K. , HALVERSON RANETTE H.
Published: November 2004

An asynchronous, CRCW PRAM (or APRAM) algorithm for linked list ranking, proposed by Martel and Subramonian, performs EO (n log log n) expected work employing [Formula: see text] processors. Motivated by their unique approach, this paper proposes two EREW list ranking algorithms – one deterministic and the other randomized. The deterministic algorithm performs in [Formula: see text] time using p processors, where n≥p log p. Thus, for p= O (n/ log n), it requires O ( log n log log n) time and O (n log log n) work. Although not work-optimal, this algorithm is very simple compared to the known work-optimal (deterministic) EREW algorithms for list ranking and has the added advantage of small constant factors in the time and space requirements. The randomized algorithm follows the same line of approach, but uses randomization in one step to decrease the time complexity, thus improving on the time complexity of the original algorithm. It requires [Formula: see text] expected time, and hence it is an EO ( log n) expected time, work-optimal algorithm employing p= O (n/ log n) processors. Furthermore, the randomized algorithm uses less space than the deterministic algorithm.
A SELF-STABILIZING ALGORITHM FOR THE SHORTEST PATHS PROBLEM WITH A FULLY DISTRIBUTED DEMON
Authors: TSAI MING-SHIN , HUANG SHING-TSAAN
Published: November 2004

A self-stabilizing algorithm for the shortest paths problem in distributed systems is proposed. The proposed algorithm runs on systems with a fully distributed demon.
A FAST RECONFIGURABLE NETWORK FOR GRAPH CONNECTIVITY AND TRANSITIVE CLOSURE
Authors: ALNUWEIRI HUSSEIN M.
Published: November 2004

This paper presents a VLSI array for labeling the connected components of a graph on N nodes in O(r) steps using a reconfigurable bus of width m bits, such that [Formula: see text] and 1≤r≤m. The network architecture consists of an array of simple logic nodes which are connected by a reconfigurable bus. To solve a problem on N nodes, the array uses N processors and N(N−1)/2 switches. The proposed connectivity and transitive closure algorithms are based on a processor indexing scheme which employs constant-weight codes. It is shown that when r is a constant, then the algorithm takes O(1) time using a bus of width O(N1/r), and when r=[ log N/ loglog N], the algorithm takes O( log N/ loglog N) time using a bus of width O( log N) bits.
PARALLEL RANDOM ACCESS MACHINES WITHOUT BOOLEAN OPERATIONS
Authors: TRAHAN JERRY L. , BHANUKUMAR HOSANGADI
Published: November 2004

The class of problems solved within given time and processor bounds on a Parallel Random Access Machine (PRAM) varies with the instruction set. Previous research has classified the contributions of various instructions, such as multiplication, shifts, and string manipulation operations, to the PRAM. This paper examines the significant contribution of Boolean operations, which play essential roles in many PRAM algorithms and in simulations by the PRAM of other models of computation.
AN OPTIMAL ALGORITHM FOR THE DINING PHILOSOPHERS PROBLEM
Authors: PERSIANO GIUSEPPE
Published: November 2004

We present a very simple new distributed algorithm for the classical Dining Philosophers problem.

Our algorithm is the first algorithm with the following important properties:

(1) It is fully distributed; i.e., there is no central memory or central process to which every other process may have access.

(2) It is symmetric; i.e., all processes behave identically, and do not use any process identifiers.

(3) It has a response time ≤ 3ℓ, independent of the size of the ring, where ℓ is an upper bound on the time a resource may be used by a process. Moreover, we establish the optimality of our algorithm with respect to this last measure by proving that no distributed algorithm can guarantee a response time less than 3ℓ.
COMPILING DISTRIBUTED LOOPS ONTO SPMD CODE
Authors: DONGEN VINCENT VAN
Published: November 2004

Given a loop written in a sequential language and a block-cyclic distribution, we present some techniques for generating SPMD code to run on distributed-memory machines. This is illustrated on three types of loops: parallel loops without internal dependence, parallel loops with internal dependences, and loops with hidden parallelism. Two models of distributions are considered: the data distribution and the computation distribution. We argue here that the data distribution model together with the owner-computes rule is only well adapted for the first class of loops. For the other loops, we present the idea of using a computation distribution instead, and we show how this can be compiled for distributed-memory machines.
A CORRECTNESS PROOF OF PARALLEL SCAN
Authors: O’DONNELL JOHN T.
Published: November 2004

The parallel scan algorithm plays an important role in parallel programming, but previous explanations of it generally rely on informal methods that fail to establish its correctness. Equational reasoning in a pure functional language provides a formal vehicle for stating the parallel scan algorithm and proving that a parallel architecture executes it correctly. The two key ideas in the proof are (1) a collection of lemmas that show how folds and scans can be decomposed into smaller problems, supporting a divide-and-conquer strategy, and (2) a formal specification of the abstract parallel architecture in the same language used to specify the problem, making it possible to reason formally about how the architecture executes the algorithm.
A STATIC EXECUTION MODEL FOR DATA PARALLELISM
Authors: GERMAIN C. , DELAPLACE F. , CARLIER R.
Published: November 2004

The performance of parallel architectures are limited at least as much by data transfer ability as by computing power. The main limit concerns the transfers on the interconnection network. But it becomes apparent that a majority of these communications can be known at compile time. The static model intends to exploit this a priori knowledge in order to drastically reduce the overhead of message passing, the ultimate goal being to confine the oommunication delays to the hardware propagation delays. In the paper, we present an abstract machine which is the target of a static-oriented compilation. We show how to recognize and sequence the static communication patterns, and we discuss the application scope of the model.
GENERATING CLOSE TO OPTIMUM LOOP SCHEDULES ON PARALLEL PROCESSORS
Authors: GASPERONI FRANCO , SCHWIEGELSHOHN UWE
Published: November 2004

This paper addresses the NP-hard problem of scheduling a cyclic set of interdependent operations, representing a program loop, when a finite number of identical pipelined or unpipelined processors are available. We give a simple and efficient algorithm which provably produces close to optimum results. When sufficient processors are available our algorithm guarantees optimality.
A SIMPLE PARALLEL ALGORITHM FOR THE SINGLE FUNCTION COARSEST PARTITION PROBLEM
Authors: GALLEY CLIVE N. , ILIOPOULOS COSTAS S.
Published: November 2004

This paper shows a simple algorithm for solving the single function coarsest partition problem on the CRCW PRAM model of parallel computation using O(n) processors in O( log n) time with O(n1+ε) space.
IMPLEMENTING FAST FOURIER TRANSFORMS ON DISTRIBUTED-MEMORY MULTIPROCESSSORS USING DATA REDISTRIBUTIONS
Authors: GUPTA S.K.S. , HUANG C.-H. , SADAYAPPAN P. , JOHNSON R.W.
Published: November 2004

Implementations of various fast Fourier transform (FFT) algorithms are presented for distributed-memory multiprocessors. These algorithms use data redistribution to localize the computation. The goal is to optimize communication cost by using a minimum number of redistribution steps. Both analytical and experimental performance results on the Intel iPSC/860 system are presented.
STUDY OF ANGULAR DISTRIBUTION OF HELIUM PROJECTILE FRAGMENTS IN INTERACTIONS OF 200 A GeV 32S IONS WITH EMULSION NUCLEI
Authors:   EMU01 collaboration, ADAMOVICH M.I. , AGGARWAL M.M. , ALEXANDROV Y.A. , ANDREEVA N.P. , ANZON Z.V. , ARORA R. , AVETYAN F.A. , BADYAL S.K. , BASOVA E. , BHALLA K.B. , BHASIN A. , BHATIA V.S. , BOGDANOV V.G. , BUBNOV V.I. , BURNETT T.H. , CAI X. , CHASNIKOV I.Y. , CHERNOVA L.P. , CHERNYAVSKY M.M. , ELIGBAEVA G.Z. , EREMENKO L.E. , GAITINOV A.S. , GANSSAUGE E.R. , GARPMAN S. , GERASSIMOV S.G. , GROTE J. , GULAMOV K.G. , GUPTA S.K. , GUPTA V.K. , HECKMAN H.H. , HUANG H. , JAKOBSSON B. , JUDEK B. , JUST L. , KACHROO S. , KALYACHKINA G.S. , KANYGINA E.K. , KARABOVA M. , KAUL G.L. , KITROO S. , KHARLAMOV S.P. , KRASNOV S.A. , KULIKOVA S. , KUMAR V. , LAL P. , LARIONOVA V.G. , LEPETAN V.N. , LIU L.S. , LOKANATHAN S. , LORD J. , LUKICHEVA L.S. , LUO S.B. , MAKSIMKINA T.N. , MANGOTRA L.K. , MARUTYAN N.A. , MASLENNIKOVA N.V. , MITTRA I.S. , MOOKERJEE S. , NASRULAEVA H. , NASYROV S.H. , NAVOTNY V.S. , NYSTRAND J. , ORLOVA G.I. , OTTERLUND I. , PALSANIA H.S. , PERESADKO N.G. , PETROV N.V. , PLYUSHCHEV V.A. , QARSHIEV D.A. , QIAN W.Y. , QIN Y.M. , RANIWALA R. , RANIWALA S. , RAO N.K. , RAPPOPORT V.M. , RHEE J.T. , SAIDKHANOV N. , SALMANOVA N.A. , SARKISOVA L.G. , SARKISYAN V.R. , SHABRATOVA G.S. , SHAKHOVA T.I. , SHPILEV S.N. , SKELDING D. , SÖDERSTRÖM K. , SOLOVJEVA Z.I. , STENLUND E. , SURIN E.L. , SVECHNIKOVA L.N. , TOLSTOV K.D. , TOTHOVA M. , TRETYAKOVA M.I. , TROFIMOVA T.P. , TULEEVA U. , VOKAL S. , WANG H.Q. , WENG Z.Q. , WILKES R.J. , XIA Y.L. , XU G.F. , ZHANG D.H. , ZHENG P.Y. , ZHOKHOVA S.I. , ZHOU D.C.
Published: November 2004

This paper presents data on the emission of helium fragments due to break up of 200 A GeV 32S ions in collision with emulsion nuclei. A total of 499 minimum bias events have been studied in an emulsion stack and 97 events in emulsion chambers. Emission angles of He fragments have been measured with high precision. This data has been compared with data of breakup of heavier as well as lighter projectiles and we observe that the value of the momentum spread, σ(p), increases with increasing projectile mass. The bulk part of the helium emission is consistent with a single source for helium fragments with an average excitation energy of (9.1±0.9) MeV. A tail of a few (<1%) He fragments with higher momenta is observed.
DILATONIC SUPERGRAVITY IN TWO DIMENSIONS AND THE DISAPPEARANCE OF QUANTUM BLACK HOLE
Authors: NOJIRI SHIN’ICHI , ODA ICHIRO
Published: November 2004

We analyze a supergravity theory coupled to a dilaton and superconformal matters in two dimensions. This theory is classically soluble and we find all the solutions appeared in Callan, Giddings, Harvey and Strominger’s dilatonic gravity also satisfy the constraints and the equations of motion in this supersymmetric theory. We quantize this theory by following the procedure of Distler, Hlousek and Kawai. In the quantum action, the cosmological term is renormalized to vanish. As a result, any solution corresponding to classical black hole does not appear in the quantum theory, which should be compared with the non-supersymmetric case.