Topography of the flank wear surface

In many applications, topography represents the main external features of a surface. This paper describes the topography of the flank wear surface and also presents the relationship between the maximum flank wear and the topography parameters (roughness parameters) of the flank wear surface during the turning operation. A modern CNC lathe machine (Okuma LH35-N) was used for the machine turning operation. Three-dimensional surface roughness parameters of the flank wear surface were measured by a surface texture instrument (from Talysurf series) using surface topography software (Talymap). Based on the resulting experimental data, it is found that as the flank wear increases, the roughness parameters (sR_a, sR_q, and sR_t) on the flank surface increase significantly. The greater the roughness value of the flank wear surface, the higher the friction of the tool on the workpiece and the greater the heat generation that will occur, thus ultimately causing tool failure. On the other hand, positive skewness (sR_sk) indicates the presence of a small number of spikes on the flank surface of the cutting tool, which could quickly wear off during the machining process.     

A Review of Element-Based Galerkin Methods for Numerical Weather Prediction: Finite Elements,Spectral Elements,and Discontinuous Galerkin

Numerical weather prediction (NWP) is in a period of transition. As resolutions increase, global models are moving towards fully nonhydrostatic dynamical cores, with the local and global models using the same governing equations; therefore we have reached a point where it will be necessary to use a single model for both applications. The new dynamical cores at the heart of these unified models are designed to scale efficiently on clusters with hundreds of thousands or even millions of CPU cores and GPUs. Operational and research NWP codes currently use a wide range of numerical methods: finite differences, spectral transform, finite volumes and, increasingly, finite/spectral elements and discontinuous Galerkin, which constitute element-based Galerkin (EBG) methods. Due to their important role in this transition, will EBGs be the dominant power behind NWP in the next 10 years, or will they just be one of many methods to choose from? One decade after the review of numerical methods for atmospheric modeling by Steppeler et al. (Meteorol Atmos Phys 82:287–301, 2003), this review discusses EBG methods as a viable numerical approach for the next-generation NWP models. One well-known weakness of EBG methods is the generation of unphysical oscillations in advection-dominated flows; special attention is hence devoted to dissipation-based stabilization methods. Since EBGs are geometrically flexible and allow both conforming and non-conforming meshes, as well as grid adaptivity, this review is concluded with a short overview of how mesh generation and dynamic mesh refinement are becoming as important for atmospheric modeling as they have been for engineering applications for many years.     

Notes on spiking neural P systems and finite automata

Spiking neural P systems (in short, SN P systems) are membrane computing models inspired by the pulse coding of information in biological neurons. SN P systems with standard rules have neurons that emit at most one spike (the pulse) each step, and have either an input or output neuron connected to the environment. A variant known as SN P modules generalize SN P systems by using extended rules (more than one spike can be emitted each step) and a set of input and output neurons. In this work we continue relating SN P modules and finite automata. In particular, we amend and improve previous constructions for the simulatons of deterministic finite automata and state transducers. Our improvements reduce the number of neurons from three down to one, so our results are optimal. We also simulate finite automata with output, and we use these simulations to generate automatic sequences.     

Electromyographic evaluation of a bed assistive device for abdominal surgery patients in postoperative care

OBJECTIVE: Muscle activity with and without the use of commercially available patient assistive devices during bed rising and lowering was quantified. BACKGROUND: Limited research is available in understanding or evaluating the physical benefits of assistive devices for patient use following major abdominal surgery. METHODS: Twenty healthy participants (9 men, 11 women) took part in a laboratory study to test the effects of device configuration (five levels) and bed elevation angle (0 degree and 30 degrees) on mean and peak upper and lower rectus abdominis and external oblique concentric and eccentric muscle activity. RESULTS: Reduced muscle activity was associated with the use of an assistive device, as compared with manual bed rising (unassisted). Positioning the devices at a higher anchor height and/or increasing the bed elevation angle further reduced muscle activity. Objective and subjective differences between the two assistive devices evaluated in the study were found. CONCLUSION: These results suggest that self-assistive devices may speed recovery because of reduced loads on damaged tissues. APPLICATION: Potential applications of this research include the assessment of other commercially available lift aids or comparisons of self-assistive lift aids with hospital-housed lift aids used to speed recovery rates.     

A scalable constraint-based Q-hash indexing for moving objects

In this paper, we develop a Q-hash index structure to efficiently store the position of moving objects. An environment of moving objects contains continuously changing locations which are hard to index using traditional index structures such as R-trees, QuadTrees and their variants. In order to answer the queries accurately, one of the problems faced in storing these positions is the number of updates that have to be made to the database whenever locations change. The high maintenance overhead on updates leads to performance degradation of these index structures; additionally, it makes the database very bulky which results in very poor performance in terms of query execution time. One of the main objectives of the structure we propose is to minimize the number of updates to the database to an optimal number so that the accuracy and response time of the query result are not compromised and at the same time the number of wireless communications can be reduced. The indexing is done using a hashing technique where the hashing function makes use of a region based QuadTree structure. To improve the efficiency of the query processing our index structure helps us define constraints over speed, direction and location of the moving object at the device level which controls the number of updates. In addition, in order to answer different query types efficiently at all levels we propose a three-tier (moving object, regional server, central repository) architecture. Our extensive performance evaluation and comparison of the proposed technique concludes that our scheme outperforms existing Q + R-tree and QuadTree in terms of range query execution time by a high order of magnitude.     

Multi-rate model predictive control of particle size distribution in a semibatch emulsion copolymerization reactor

A multi-rate model predictive controller algorithm is presented for the in-batch closed-loop control of the full particle size distribution (PSD) in a semibatch emulsion copolymerization system. The lack of frequent measurements of the PSD and the measurement delay of these measurements are addressed through the use of frequent density measurements from which the current conditions of the system are estimated. The high dimensionality of the discretized full PSD is reduced by the use of model order reduction based on principal component analysis. This method effectively reduces the size of the problem while preserving the main characteristics of the population balance system. Disturbances that perturb the surfactant and monomer amounts inside the semibatch vinyl acetate–butyl acrylate reactor are considered to demonstrate the performance of the proposed control algorithm.     

Parallel evolution using multi-chromosome cartesian genetic programming

Parallel and distributed methods for evolutionary algorithms have concentrated on maintaining multiple populations of genotypes, where each genotype in a population encodes a potential solution to the problem. In this paper, we investigate the parallelisation of the genotype itself into a collection of independent chromosomes which can be evaluated in parallel. We call this multi-chromosomal evolution (MCE). We test this approach using Cartesian Genetic Programming and apply MCE to a series of digital circuit design problems to compare the efficacy of MCE with a conventional single chromosome approach (SCE). MCE can be readily used for many digital circuits because they have multiple outputs. In MCE, an independent chromosome is assigned to each output. When we compare MCE with SCE we find that MCE allows us to evolve solutions much faster. In addition, in some cases we were able to evolve solutions with MCE that we unable to with SCE. In a case-study, we investigate how MCE can be applied to to a single objective problem in the domain of image classification, namely, the classification of breast X-rays for cancer. To apply MCE to this problem, we identify regions of interest (RoI) from the mammograms, divide the RoI into a collection of sub-images and use a chromosome to classify each sub-image. This problem allows us to evaluate various evolutionary mutation operators which can pairwise swap chromosomes either randomly or topographically or reuse chromosomes in place of other chromosomes.     

Proteomic Helicobacter pylori biomarkers discriminative of low-grade gastric MALT lymphoma and duodenal ulcer

To date no reliable diagnostic method exists to predict, among the very large and clinically heterogeneous group of Helicobacter pylori‐infected patients, the extremely small group at risk for developing low‐grade gastric MALT lymphoma (LG‐MALT). Search of proteomic biomarkers holds promise for the classification of the H. pylori strains with regard to this severe clinical outcome. In the present study 69 H. pylori strains isolated from patients with two different H. pylori‐associated diseases, duodenal ulcer (DU, n=29) and LG‐MALT (n=40) were used. Protein expression patterns of the strains were analyzed by using the high‐throughput methodology SELDI. Selected proteins were purified by means of chromatographic and electrophoretic methods in view of further sequencing by LC‐MS/MS. Univariate analysis (Mann–Whitney test) of the protein expression patterns generated nine significant biomarkers that can discriminate between H. pylori strains from patients with DU and LG‐MALT. These biomarkers are of low molecular weight, ranging from 6 to 26.6 kDa. Among them, two are overexpressed in LG‐MALT strains and seven – in DU strains. Two biomarker proteins, one overexpressed in LG‐MALT strains (13.2 kDa) and another one – overexpressed in DU strains (26.6 kDa), were purified to homogeneity and identified by using LC‐MS/MS as a 50S ribosomal protein L7/L12 and a urease subunit, respectively. These biomarkers can be included in novel protein arrays for the differential diagnosis of H. pylori‐associated clinical outcomes.