No abstract

Recently, the clinical usefulness of tablets that are rapidly disintegrated by saliva (rapidly disintegrating tablet), an attractive dosage form for patient-oriented pharmaceutical preparations, has been reported.2) Previously, we formulated rapidly disintegrating tablets containing meclizine hydrochloride, an antidinic agent, using microcrystalline cellulose (Avicel PH-102 ® : mean particle size, 100 mm), a conventional pharmaceutical excipient, and low-substituted hydroxypropylcellulose (L-HPC: mean particle size, 50 mm), a good disintegrant, by the direct compression method at a low compression force (1-6 kN).3) Bi et al. 4) also reported the preparation of compressed tablets that can rapidly disintegrate in the mouth, using Avicel PH-102 and L-HPC with ethenzamide and ascorbic acid as model drugs. However, patients often complain of a feeling of roughness in their mouths after taking these tablets, due to the surface texture and the large particle size. Generally, the rough texture of particles with size below 15 mm is not felt in the mouth. 5-7)Therefore, in this study we attempted to formulate a new type of rapidly disintegrating tablet with good texture using excipients with particle size smaller than that of PH-102 by the direct compression method. Although the most suitable disintegration time is not confirmed, we set the desirable disintegration time at 15 s based on information on the disintegration time of commercially available preparations with the characteristic of rapid disintegration.8) The microcrystalline cellulose PH-M series is a new type of pharmaceutical excipient that is spherical and has a very small particle size, and is used as an ingredient in cosmetics. To decrease the sensation of roughness in the mouth, we prepared rapidly disintegrating tablets using microcrystalline cellulose (Avicel PH-M-06 ® ) with a small particle size (mean particle size, 7 mm) instead of PH-102 in the formulation of tablets containing acetaminophen or ascorbic acid as the model drug for tableting study. Furthermore, to improve the fluidity of excipients in the tableting process, we investigated the usability of spherical sugar granules 9) instead of L-HPC in combination with PH-M-06. ExperimentalMaterials Acetaminophen (JP XIII) and ascorbic acid (JP XIII) were purchased from Maruishi Seiyaku Co. (Osaka, Japan). Microcrystalline cellulose (Avicel ® PH-102, PH-M-06, PH-M-15, PH-M-25, JP XIII) and L-HPC (LH-11 ® , JP XIII) were kindly supplied by Asahi Chemical Industry Co., Tokyo, Japan and Shin-Etsu Chemical Co., Tokyo, Japan, respectively. Spherical sugar granules (water-soluble sugar granule, Nonpareil ® , hereafter abbreviated as NP), sucrose starch spheres (NP-101), purified sucrose spheres (NP-103), purified lactose spheres (NP-107) and purified D-mannitol spheres (NP-108) were kindly supplied by Freund Industry Co., Tokyo, Japan. All other reagents were of analytical grade.Physical Characteristics of Crystalline Cellulose The particle size distribution of crystalline cellulose was measured using a ce...

This paper describes an information system SIGMA implemented on the computer at our University Computer Center. The system creates, for each user, a MEMO space for his private notebook and SIGMA spaces for sharing data with other users. The system ass umes, as data structure, only the strings of characters, and hence the main access method is a linear search. We developed a general purpose linear search method called one-way sequential search which extensively makes use of pattern matching machines. Communica tions between users and the system are automatically recorded in log files, which function as command procedures.

No abstract

This paper presents a pattern matching machine which detects all occurrences of the longest possible keywords in a text and replaces them with the corresponding keywords. The pattern matching machine of this type is a generalized sequential machine and is constructed in nearly the same way as AhoCorasick's pattern matching machine to locate all occurrences of keywords. We show algorithms to construct our pattern matching machine and to make the machine run on a given text string, and show the validities of them. We also consider the time complexity of the algorithms and evaluate the running time of the algorithms. Finally we discuss some applications of our pattern matching machines.