Control of molecular weight distribution of isotactic polypropylene obtained by a MgCl2-supported TiCl4 catalyst

It is of great importance in propene polymerization to control molecular weight and molecular weight distribution as well as isotacticity. Propene polymerization was carried out with an isospecific MgCl₂/TiCl₄-Cp₂TiMe₂ catalyst in the presence of various kinds of external Lewis bases. It was found that the molecular weight distribution of the isotactic polymer could be controlled while retaining high activity, high isospecificity and high molecular weight only by changing the kind and/or amount of the Lewis bases. © 1997 Elsevier Science Ltd.     

Dehydrogenative Cracking of n-Butane over Modified HZSM-5 Catalysts

Dehydrogenative cracking reaction of n-butane was studied using HZSM-5 catalyst modified with various metal oxides. Alkaline earth (magnesium), transition metal (cobalt) and rare earth (lanthanum) elements are used for the modification. The selectivity of the products was studied at low conversion (20%). Methane, ethane, ethylene, propylene, butenes and butadiene were the main products. With the use of the cobalt- or magnesium-containing HZSM-5, dehydrogenative cracking was observed and the selectivity of ethylene was much larger than that of ethane. On the other hand, the selectivity of ethylene and ethane were almost the same in the reaction using the lanthanum-containing HZSM-5. It is considered that the cobalt- and magnesium-loaded sites on HZSM-5 played an important role in the dehydrogenative cracking.     

Adaptive interpolation scheme for NURBS curves with the integration of machining dynamics

This paper develops a comprehensive interpolation scheme for non-uniform rational B-spline (NURBS) curves, which does not only simultaneously meet the requirements of both constant feedrate and chord accuracy, but also real-time integrates machining dynamics in the interpolation stage. Although the existing work in this regard has realized the importance to simultaneously consider chord error and machining dynamics, none has really incorporated these in one complete interpolation scheme. In this paper, machining dynamics is considered for three aspects: sharp corners or feedrate sensitive corners on the curves, components with high frequencies or frequencies matching machine natural ones and high jerks. A look-ahead module was developed for detecting and adaptively adjusting the feedrate at the sharp corners. By Fast Fourier Transform (FFT) analysis with a moving window in the interpolation stage identified were some special frequency components such as those containing high frequencies or with frequencies matching machine natural ones. Then, the notch filtering or time spacing method was used to eliminate these components. To more completely reduce feedrate and acceleration fluctuations, the jerk-limited algorithm was also developed. Finally, the interpolated feedrate was further smoothened with B-spline fitting method and the NURBS curves were re-interpolated with the smoothened feedrate. During the interpolation, the chord error was repeatedly checked and confined in the prescribed tolerance. Two NURBS curves were used as examples to test the feasibility of the developed interpolation scheme.     

Quantitative structural analysis of twin boundary in alpha-Zn7Sb2O12 using HAADF STEM method

The structure and composition of the 1/4{110} twin boundary in alpha-Zn7Sb2O12 have been determined by using quantitative high-angle annular dark field scanning transmission electron microscopy (HAADF STEM) analysis. The noise in the experimental HAADF STEM images is reduced by using the maximum entropy method and average processing, and the parameters used in dynamical simulations are experimentally determined. From the analysis, it has been found that octahedral sites in the twin boundary slightly shift parallel to the [110] direction, and a reduction of the Sb concentration at the octahedral sites on the plane adjacent to the twin boundary was detected. The reduction was measured from three regions in the same twin boundary, and the Sb concentrations were 4 +/- 3, 8 +/- 3 and 19 +/-2 at% from 33 at%.     

Microstructure and properties of (Sr, Ca)CuO2/(Sr, Ca)RuO3 multilayers

Epitaxial multilayer thin films of infinite-layer (Sr, Ca)CuO₂ and perovskite (Sr, Ca)RuO₃ have been prepared on (100) SrTiO₃ substrates by multitarget rf magnetron sputtering. X-ray diffraction analyses revealed that the multilayer structure of (Sr, Ca)CuO₃/(Sr, Ca)RuO₃ was successfully fabricated with a minimum layer thickness of 20 Å. Transmission electron microscopy measurements of the multilayers indicated that there was no dislocation which normally exists in single-layer films with an infinite-layer structure. Resistivities of multilayer films at room temperature ranged from 1 to 10 m cm and showed semiconductor-like dependence against the temperature.     

A new scaling algorithm for the maximum mean cut problem

We present a new scaling algorithm for the maximum mean cut problem. The mean of a cut is defined by the cut capacity divided by the number of arcs crossing the cut. The algorithm uses an approximate binary search and solves the circulation feasibility problem with relaxed capacity bounds. The maximum mean cut problem has recently been studied as a dual analogue of the minimum mean cycle problem in the framework of the minimum cost flow problem by Ervolina and McCormick. A networkN=(G, lower, upper) with lower and upper arc capacities is said to be -feasible ifN has a feasible circulation when we relax the capacity bounds by ; that is, we use (lower(a)- , upper(a)+) bounds instead of (lower(a), upper(a)) bounds for each arca A. During an approximate binary search we maintain two bounds,LB andUB, such thatN is LB-infeasible andUB-feasible, and we reduce the interval size (LB, UB) by at least one-third at each iteration. For a graph withn vertices, m arcs, and integer capacities bounded byU, the running time of this algorithm is O(mn log(nU). This time bound is better than the time achieved by McCormick and Ervolina under thesimilarity condition (that is,U=O(n^o(1))). Our algorithm can be naturally used for the circulation feasibility problem, and thus provides a new scaling algorithm for the minimum cut problem.Research supported by a grant-in-aid of the Ministry of Education, Science and Culture of Japan.     

Sudden death of adults in Japan

Epidemiological features, risk factors and preventive methods of sudden death (SD) derived from studies the authors have performed since 1987 together with colleagues in Niigata University School of Medicine were reviewed. When SD was defined as death occurring within 24 hours of the onset of symptoms, the annual incidence was 145/100,000 for people aged 15 years and older in Niigata Prefecture. The incidence increased sharply along with the advance of age, while the proportion of SD to natural death due to circulatory diseases was higher in younger people. Though diseases of the circulatory system made up approximately 90 percent of all causes of death, SD due to ischemic heart disease was less frequent in Japan than in western countries. SD showed various patterns in seasonal and "within-a-day" occurrences according to sex, age and cause of death. The months of the highest SD occurrence differed by occupation and matched the busiest work periods. A decrease in sleeping hours and mental stress experienced during the preceding week were related to the occurrence of both sudden death and non-fatal acute myocardial infarction. People having structural circulatory diseases were shown to be predisposed to SD when stress occurred, because fatal arrhythmia is easily induced by the above factors in such people. Health examinations were shown to have preventive effects, though limited, against SD. Differences in the resuscitated rates in cases where a witness was present and where one was not indicates that educating people about correct resuscitation methods is important to minimizing SD.     

A scalable interest-oriented peer-to-peer pub/sub network

There has been a big challenge in structured peer-to-peer overlay network research area. Generally, a structured overlay network involves nodes evenly or based on their resource availabilities, and gathers nodes?? resources to achieve some bigger tasks. The challenge here is to gather resources based on nodes?? interests, and only interested nodes are involved in a certain task. Toward this challenge, we propose a new scheme to a peer-to-peer publish/subscribe network. Publish/subscribe represents a new paradigm for distributed content delivery. It provides an alternative to address-based communication due to its ability to decouple communication between the source and the destination. We propose a Bloom filter based mapping scheme to map IDs to nodes?? interests in addition to new interest proximity metric to forward events and to build nodes?? routing tables. We also propose a new approach called ??shared interest approach?? for network discovery. To evaluate the algorithms proposed in this work, we conducted simulations in both static and dynamic settings, and found a low false positive rate. We also discuss about a well-known application called Twitter, and show how our scheme would work in a real environment.     

Unsupervised WSD by Finding the Predominant Sense Using Context as a Dynamic Thesaurus

We present and analyze an unsupervised method for Word Sense Disambiguation (WSD). Our work is based on the method presented by McCarthy et al. in 2004 for finding the predominant sense of each word in the entire corpus. Their maximization algorithm allows weighted terms (similar words) from a distributional thesaurus to accumulate a score for each ambiguous word sense, i.e., the sense with the highest score is chosen based on votes from a weighted list of terms related to the ambiguous word. This list is obtained using the distributional similarity method proposed by Lin Dekang to obtain a thesaurus. In the method of McCarthy et al., every occurrence of the ambiguous word uses the same thesaurus, regardless of the context where the ambiguous word occurs. Our method accounts for the context of a word when determining the sense of an ambiguous word by building the list of distributed similar words based on the syntactic context of the ambiguous word. We obtain a top precision of 77.54% of accuracy versus 67.10% of the original method tested on SemCor. We also analyze the effect of the number of weighted terms in the tasks of finding the Most Frecuent Sense (MFS) and WSD, and experiment with several corpora for building the Word Space Model.     

Automatic 3D model reconstruction of cutting tools from a single camera

Collision detection by machining simulation requires the 3D models of rotating cutters. However, the 3D models of a cutter and holder are not always available. In this paper, a new method is proposed to design an automatic vision-based 3D modeling system, which is able to quickly reconstruct the 3D model of a cutter and holder when they are installed onto the spindle. Only a single camera is mounted on the machine tool to capture the image of the rotating cutter and holder. By viewing the rotating cutter and holder as an object of surface of revolution, the contour of the imaged cutter and holder can be used to reconstruct the 3D model as a stack of circular cross-sections. Then the complete generating function of the cutter and holder can be recovered from the cross-sections. Finally, the 3D model of the cutter is built by rotating the generating function around the spindle axis. The effectiveness and accuracy of the proposed method are verified by experiments on-machine using 12 kinds of cutters and holders, which can satisfy the requirement of collision detection.