A combined approach for modeling particle behavior in granular impact damper using discrete element method and cellular automata

A particle impact damper is a vibration absorber type that consists of a container attached to a primary vibrating structure. It also contains many particles that are constrained to move inside the container, whereby the damping effect can be obtained by collision between particles and the container. The discrete element method (DEM) has been developed for modeling granular systems, where the kinematics of each particle are calculated numerically using the equations of motion. However, the computational time is significant since the algorithm checks for particle contacts for all possible particle combinations. The use of a cellular automata (CA) modeling technique may provide increased computational efficiency due to the local updating of variables, and the discrete treatment of time and space. In this study, we propose a new approach combining DEM with CA for modeling a granular damper under a forced excitation. We use DEM to describe the particle motion according to the equations of motion, while CA is introduced for the particle contact checks in discrete space. We also investigate the effect of simplification in the contact force model, which allows the unit time step of numerical integration to become larger than that used in the strict model. It is shown that the suggested particle contact scanning method and the force approximation model contribute to the reduction of the computational time, and neither degenerates the calculation accuracy nor causes the numerical instability.     

A chondroitin sulfate/keratan sulfate proteoglycan, PG-1000, forms complexes which are concentrated in the reticular laminae of electric organ basement membranes

Previously, we identified PG-1000 as part of a disulfide-linked complex of two large proteoglycans (PG-1000 and the beta component) and three smaller proteins purified from the extracellular matrix of elasmobranch electric organ (Iwata and Carlson, 1991, J. Biol. Chem. 266: 323-333). PG-1000 is a chondroitin sulfate/keratan sulfate proteoglycan with a molecular mass of about 1.2 x 16(6) daltons. When visualized in the electron microscope, PG-1000 has the typical "bottle-brush" appearance expected for a proteoglycan with an average total length of about 345 nm and about 20 chains of approximately 110 nm (Carlson and Wight, 1987, J. Cell Biol. 105: 3075-3086). Using immunocytochemical methods, we now demonstrate that PG-1000 is a component of the interstitial extracellular matrix of the electric organ. PG-1000 immunoreactivity is found throughout the interstitial matrix, but it is highly concentrated in that region of the matrix immediately adjacent to the basal lamina, the reticular lamina. The reticular and basal laminae together form the basement membrane. PG-1000 immunoreactivity is especially apparent on basal laminae that surround nerve fibers and nerve terminals. When the disulfide-linked PG-1000 complexes are purified and examined in the electron microscope following rotary shadowing, they appear as bottle-brush structures which are often attached at a central region and radiate like spokes of a wheel. These aggregates contain two to six proteoglycan monomers. We hypothesize that the PG-1000 complexes are disulfide-stabilized parts of an extended network of linked proteoglycans in the reticular lamina.     

Bacteriological, pharmacokinetic and clinical evaluation of azithromycin in the pediatric field]

Azithromycin (AZM), a new macrolide antibiotic, in fine granules and in capsules was studied for pharmacokinetic and clinical evaluation in the pediatric patients. Antibacterial activity of AZM against 43 clinical isolates: AZM exhibited slightly lower activity against Gram-positive bacteria and 2-8-fold higher activity against Gram-negative bacteria than erythromycin or clarithromycin. Plasma or urine samples were collected from eight patients receiving the drug in fine granular form, and two patients receiving it in capsules for the determination of drug levels. The elimination half-lives of AZM after administration at dose of 10 mg/kg/day for 3 days were 50.0 and 51.2 hours for fine granules, and 41.5 hours for capsules. AUC0-infinity was 11.7 and 24.3 micrograms.hr/ml for fine granules, and 8.3 micrograms.hr/ml for capsules. The cumulative excretion rates up to 120 hours after the start of treatment were 8.24 and 13.84% for fine granules, and 3.83% for capsules. AZM was administered to 123 patients once daily at 3.7-20.0 mg/kg body weight over 3 to 5 days with reference to the standard dose of 10 mg/kg. The drug was used to treat patients with pharyngitis, tonsillitis, scarlet fever, pneumonia, mycoplasmal pneumonia, chlamydial pneumonia, otitis media, pertussis, intestinal infection, and SSTI. The effectiveness of AZM was evaluated in 109 cases. The drug was rated "excellent" in 65.1% of the patients and "good" in 29.4%, resulting in an efficacy rate of 94.5%. Furthermore, AZM eradicated 43 of 46 (93.5%) bacteria that had been identified before the treatment. Three patients complained of side effects of urticaria (1 case) and diarrhea (2 cases). Abnormal laboratory changes were reported as follows: decreased leukocyte (3 cases), increased eosinophil (5), increased platelet (2), increased eosinophil and platelet, elevated GPT (1), and elevated GOT and GPT (1). The abnormalities, however, were mild enough to raise no clinically significant problems. In conclusion, AZM in once daily regimen was effective and safe in treatment of pediatric infections.     

An Algorithm for Minimum Cost Arc-Connectivity Orientations

Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientation problem is a special case of the submodular flow problem. Frank (1982) devised a combinatorial algorithm that solves the problem in O(k ² n ³ m) time, where n and m are the numbers of vertices and edges, respectively. Gabow (1995) improved Frank’s algorithm to run in O(kn ² m) time by introducing a new sophisticated data structure. We describe an algorithm that runs in O(k ³ n ³+kn ² m) time without using sophisticated data structures. In addition, we present an application of the algorithm to find a shortest dijoin in O(n ² m) time, which matches the current best bound.     

New dissimilarity measure for recognizing noisy subsequence trees

Tree is a data structure used to express various objects such as semistructured data and genes. When objects are represented as trees, computing tree similarity is essential for pattern recognition and retrieval. This paper considers the noisy subsequence tree recognition problem whose purpose is to recognize the original tree, given its noisy subsequence tree. Previous research on this problem relied on constrained tree edit distance to measure the dissimilarity. However, the number of relabelings must be predetermined to compute it. This paper proposes a new dissimilarity measure for this problem. Our dissimilarity measure is obtained by counting the node edit operations included in the unit‐cost tree edit distance that contribute to the matching of node labels. The number of relabelings need not be specified to compute our dissimilarity measure. Moreover, our measure achieves more accurate recognition performance and faster execution speed than the constrained tree edit distance. Our measure is also useful to solve the tree inclusion problem which is the problem of deciding whether a tree includes another tree and shows the extent of approximate tree inclusion when a tree incompletely includes another tree. © 2011 Wiley Periodicals, Inc.     

An SNS-based model for finding collaborative partners

This paper proposes a model, Recommendation of Appropriate Partners (RAP), used on a Social Networking Service (SNS) for locating appropriate “helpers” for users based on individual users’ Chain of Friends (CoF) relationships. Using the RAP model, individual users can participate in a collaborative online community in remote locations, whereby helpers are willing to help other users solve their tasks/problems, and it is intended that both the users and helpers gain knowledge from these interactive online sessions. An example of the RAP-based system was implemented to invite Program Committee members to an international conference. The system was evaluated and the experimental results show that our model is very effective for discovering collaboration partners and finding users with similar interests in order to create communities for providing future and longer-term helping exchange.

     

Performance of SOR methods on modern vector and scalar processors

The building-cube method (BCM) is a new generation algorithm for CFD simulations. The basic idea of BCM is to simplify the algorithm in all stages of flow computation to achieve large-scale simulations. Calculation of a pressure field using the Successive Over Relaxation (SOR) method consumes most of the total execution time required for BCM. In this paper, effective implementations on modern vector and scalar processors are investigated. NEC SX-9 and Intel Nehalem-EX are the latest vector and scalar processors. Those processors have much higher peak performances than their previous-generation processors. However, their memory bandwidth improvement cannot catch up with the performance improvement of processors. This is the so-called memory wall problem. In our paper, we discuss optimization techniques for implementation of the SOR method based on architectural characteristics of these modern processors, and evaluate their effects on the sustained performances of these processors for BCM.     

Inchworm robot grippers for clothes manipulation

Manipulating deformable objects like clothes, plastic, and paper by a robot is very challenging. This paper focuses on clothes manipulation as an example. A tracing manipulation method is used here to find a corner of the clothes. In this paper, tracing refers to tracing the clothes’ edge, with the robot’s movement based on feedback from sensors. One difficulty during this edge tracing is to make the robot trace smoothly and speedily without dropping the clothes in the process. This is due to the fact that deformable objects are sensitive to contact forces. A solution to this problem is to design a special robot gripper that can trace the clothes without having to worry about the clothes slipping away. In this paper, the development of inchworm-type grippers is proposed. Two sets of grippers inside a robot hand will allow the robot to trace the clothes more freely because there will always be a gripper firmly holding the clothes at any time. A unique tracing method for towel spreading using the inchworm grippers is also discussed. Experimental results have demonstrated the effectiveness of both the proposed grippers and also the algorithm. This work was presented in part at the 12th International Symposium on Artificial Life and Robotics, Oita, Japan, January 25–27, 2007     

A distributed control scheme for multiple robotic vehicles to make group formations

This paper presents a novel distributed control scheme of multiple robotic vehicles. Each robotic vehicle in this scheme has its own coordinate system, and it senses its relative position and orientation to others, in order to make group formations. Although there exists no supervisor and each robotic vehicle has only relative position feedback from the others in the local area around itself, all the robotic vehicles are stabilized, which we have succeeded in proving mathematically only in the cases where the attractions between the robots are symmetrical. Each robotic vehicle especially has a two-dimensional control input referred to as a “formation vector” and the formation is controllable by the vectors. The validity of this scheme is supported by computer simulations.     

Parametric embedding for class visualization

We propose a new method, parametric embedding (PE), that embeds objects with the class structure into a low-dimensional visualization space. PE takes as input a set of class conditional probabilities for given data points and tries to preserve the structure in an embedding space by minimizing a sum of Kullback-Leibler divergences, under the assumption that samples are generated by a gaussian mixture with equal covariances in the embedding space. PE has many potential uses depending on the source of the input data, providing insight into the classifier's behavior in supervised, semisupervised, and unsupervised settings. The PE algorithm has a computational advantage over conventional embedding methods based on pairwise object relations since its complexity scales with the product of the number of objects and the number of classes. We demonstrate PE by visualizing supervised categorization of Web pages, semisupervised categorization of digits, and the relations of words and latent topics found by an unsupervised algorithm, latent Dirichlet allocation.