Distributed control system utilizing a MAP-based LAN

We developed the ADMAP ADvanced MAP) system as a local area network for our Distributed Instrumentaion Control System (DCS) with a broadcast communications function. ADMAP is an open system based on the Manufacturing Automation Protocol (MAP), which is advancing as an international standard, but also providing real-time performance, which is weak in MAP.

The new MAP-based LAN can be used not only for electrical and computer control. This paper describes the new MAP-based LAN and discusses distributed control systems using this LAN to integrate instrumentation, electrical, and computer controls.     

Sustained Release Suppository of Sodium Diclofenac: use of Water Absorbable Polymer

The investigation on the usefulness of water absorbable polymer (Poys® SA-20) for the preparation of sustained release suppository was performed. To prepare the sustained release suppository, sodium diclofenac solution is absorbed into the sphere polymer, and the particles of the polymer after dryness are suspended in the melted triglyceride suppository base, followed by solidification. The sustained release of sodium diclofenac from the suppository was confirmed by the in vitro release study with slow release of sodium diclofenac and by the in vivo absorption study in dogs with an avoidance of transient high plasma diclofenac concentration and a prolong of plasma diclofenac concentration.     

The Crystal and Molecular Structure of Kinamycin C p-Bromobenzoate

The molecular structure of kinamycin C has been determined by means of an X-ray study of its p-bromobenzoate derivative, C₃₁H₂₃N₂O₁₁Br. The crystals are monoclinic, P2₁, with four molecules of the derivative and four molecules of benzene in a unit cell of dimensions: a = 18.404 ± 0.005, b = 21.299 ± 0.004, c = 9.049 ± 0.001 Å, and β = 90.07 ± 0.03°. Reflection intensities were measured visually from equi-inclination Weissenberg photographs taken with Cu Ka radiation. The structure was solved by the heavy-atom method, and was refined by the block-diagonal-matrix least-squares method using anisotropic temperature factors for all the atoms. The final R factor is 8.9%. The stereostructures of the two crystallographically independent molecules are almost identical. The skeleton of the molecule is made up of four fused rings: two of these form a 1,4-naphthoquinone system and the rest are a pyrrole and a cyclohexene ring. A cyano group is bonded to the nitrogen atom of the pyrrole ring, which is rather unusual in an antibiotic.     

The Discrete Weibull Distribution

The discrete Weibull distribution is defined to correspond with the Weibull distribution in continuous time. A few properties of the discrete Weibull distribution are discussed.     

Replacement policies for a cumulative damage model with minimalrepair at failure

The authors apply periodic replacement with minimal repair at failure to cumulative damage models: a unit is replaced at time T , at shock N, or at damage Z and undergoes minimal repair between replacements. The mean cost-rate is obtained, and each optimal T*, N*, and Z* to minimize the cost-rate is discussed. A numerical example is given for an exponential case     

Production of a highly charged uranium ion beam with RIKEN superconducting electron cyclotron resonance ion source

A highly charged uranium (U) ion beam is produced from the RIKEN superconducting electron cyclotron resonance ion source using 18 and 28 GHz microwaves. The sputtering method is used to produce this U ion beam. The beam intensity is strongly dependent on the rod position and sputtering voltage. We observe that the emittance of U(35+) for 28 GHz microwaves is almost the same as that for 18 GHz microwaves. It seems that the beam intensity of U ions produced using 28 GHz microwaves is higher than that produced using 18 GHz microwaves at the same Radio Frequency (RF) power.     

Computational method for the point cluster analysis on networks

We present a general framework of hierarchical methods for point cluster analysis on networks, and then consider individual clustering procedures and their time complexities defined by typical variants of distances between clusters. The distances considered here are the closest-pair distance, the farthest-pair distance, the average distance, the median-pair distance and the radius distance. This paper will offer a menu for users to choose hierarchical clustering algorithms on networks from a time complexity point of view.     

Real‐Time Sliding Mode Observer Scheme for Shear Force Estimation in a Transverse Dynamic Force Microscope

This paper describes a sliding mode observer scheme for estimation of the shear force affecting the cantilever in a Transverse Dynamic Force Microscope (TDFM). The vertically oriented cantilever is oscillated in the proximity to the specimen under investigation. The amplitude of oscillation of the cantilever tip is affected by these shear forces. They are created by the ordered‐water layer above the specimen. The oscillation amplitude is therefore a measure of distance between the tip and the surface of the specimen. Consequently, the estimation of the shear forces provides useful information about the specimen characteristics. For estimating the shear forces, an approximate finite dimensional model of the cantilever is created using the method of lines. This model is subsequently reduced in terms of its order. An unknown input sliding mode observer has been used to reconstruct the unknown shear forces using only tip position measurements and the cantilever excitation. This paper describes the development of the sliding mode scheme and presents experimental results from the TDFM set up at the Centre for Nanoscience and Quantum Information (NSQI) at Bristol University.     

Augmented incremental recognition of online handwritten mathematical expressions

This paper presents an augmented incremental recognition method for online handwritten mathematical expressions (MEs). If an ME is recognized after all strokes are written (batch recognition), the waiting time increases significantly when the ME becomes longer. On the other hand, the pure incremental recognition method recognizes an ME whenever a new single stroke is input. It shortens the waiting time but degrades the recognition rate due to the limited context. Thus, we propose an augmented incremental recognition method that not only maintains the advantage of the two methods but also reduces their weaknesses. The proposed method has two main features: one is to process the latest stroke, and the other is to find the erroneous segmentations and recognitions in the recent strokes and correct them. In the first process, the segmentation and the recognition by Cocke–Younger–Kasami (CYK) algorithm are only executed for the latest stroke. In the second process, all the previous segmentations are updated if they are significantly changed after the latest stroke is input, and then, all the symbols related to the updated segmentations are updated with their recognition scores. These changes are reflected in the CYK table. In addition, the waiting time is further reduced by employing multi-thread processes. Experiments on our dataset and the CROHME datasets show the effectiveness of this augmented incremental recognition method, which not only maintains recognition rate even compared with the batch recognition method but also reduces the waiting time to a very small level.