A single director switching mode for monodomain liquid crystal elastomer

We report rotation of a single director in a nematic monodomain, acrylate based side-chain elastomer which was subjected to mechanical fields applied at angles in the range to the director, , present at the time of network formation. Time and spatially resolving wide angle X-ray scattering, together with polarised light microscopy measurements revealed a pronounced, almost discontinuous switching mode at a critical extension as the strain was applied at angles approaching to , whereas a more continuous rotation was seen when the strain was applied at more acute angles. This director reorientation was more or less uniform across the complete sample and was accompanied by a modest decrease in orientation parameter . At strains sufficient to induce switching there was some continuous distribution of director orientations with fluctuations of 10 although there was no evidence for any localised director inhomogenities such as domain formation. The observed deformation behaviour of these acrylate-based nematic monodomains was in accord with the predictions of a theory developed by Bladon et al., in that the complete set of data could be accounted for through a single parameter describing the chain anisotropy. The experimentally deduced chain anisotropy parameter was in broad agreement with that obtained from small-angle neutron scattering procedures, but was somewhat greater than that obtained by spontaneous shape changes at the nematic-isotropic transition.

Extracting and validating force fields for disordered polymeric materials from neutron scattering data

We present a new approach that allows the determination and refinement of force field parameters for the description of disordered macromolecular systems from experimental neutron diffraction data obtained over a large Q range. The procedure is based on tight coupling between experimentally derived structure factors and computer modelling. By separating the potential into terms representing respectively bond stretching, angle bending and torsional rotation and by treating each of them separately, the various potential parameters are extracted directly from experiment. The procedure is illustrated on molten polytetrafluoroethylene.

Extracting force fields for disordered polymeric materials from neutron scattering data

We present a new approach that allows the determination of force-field parameters for the description of disordered macromolecular systems from experimental neutron diffraction data obtained over a large Q range. The procedure is based on a tight coupling between experimentally derived structure factors and computer modelling. We separate the molecular potential into non-interacting terms representing respectively bond stretching, angle bending and torsional rotation. The parameters for each of the potentials are extracted directly from experimental data through comparison of the experimental structure factor and those derived from atomistic level molecular models. The viability of these force fields is assessed by comparison of predicted large-scale features such as the characteristic ratio. The procedure is illustrated on molten poly(ethylene) and poly(tetrafluoroethylene).

Temperature-tuned vector phase conjugation in azobenzene dye impregnated polymer films

Near-perfect vector phase conjugation was achieved at 488 nm in a methyl red dye impregnated polymethylmethacrylate film by employing a temperature tuning technique. Using a degenerate four-wave mixing geometry with vertically polarized counterpropagating pump beams, intensity and polarization gratings were written in the dye/polymer system using a vertically or horizontally polarized weak probe beam. Over a limited temperature range, as the sample was heated, the probe reflectivity from the polarization grating dropped but the reflectivity from the intensity grating rose sharply. At a sample temperature of approximately 50°C, the reflectivities of the gratings were measured to be equal and we confirmed that, at this temperature, the measured vector phase conjugate fidelity was very close to unity. We discuss a possible explanation of this effect.

PDM 2006: Proceedings of the International Workshop on Data Mining

Recently major processor manufacturers have announced a dramatic shift in their paradigm to increase computing power over the coming years. Instead of focusing on faster clock speeds and more powerful single core CPUs, the trend clearly goes towards multi core systems. This will also result in a paradigm shift for the development of algorithms for computationally expensive tasks, such as data mining applications. Obviously, work on parallel algorithms is not new per se but concentrated efforts in the many application domains are still missing. Multi-core systems, but also clusters of workstations and even large-scale distributed computing infrastructures provide new opportunities and pose new challenges for the design of parallel and distributed algorithms. Since data mining and machine learning systems rely on high performance computing systems, research on the corresponding algorithms must be on the forefront of parallel algorithm research in order to keep pushing data mining and machine learning applications to be more powerful and, especially for the former, interactive. To bring together researchers and practitioners working in this exciting field, a workshop on parallel data mining was organized as part of PKDD/ECML 2006 (Berlin, Germany). The six contributions selected for the program describe various aspects of data mining and machine learning approaches featuring low to high degrees of parallelism: The first contribution focuses the classic problem of distributed association rule mining and focuses on communication efficiency to improve the state of the art. After this a parallelization technique for speeding up decision tree construction by means of thread-level parallelism for shared memory systems is presented. The next paper discusses the design of a parallel approach for dis- tributed memory systems of the frequent subgraphs mining problem. This approach is based on a hierarchical communication topology to solve issues related to multi-domain computational envi- ronments. The forth paper describes the combined use and the customization of software packages to facilitate a top down parallelism in the tuning of Support Vector Machines (SVM) and the next contribution presents an interesting idea concerning parallel training of Conditional Random Fields (CRFs) and motivates their use in labeling sequential data. The last contribution finally focuses on very efficient feature selection. It describes a parallel algorithm for feature selection from random subsets. Selecting the papers included in this volume would not have been possible without the help of an international Program Committee that has provided detailed reviews for each paper. We would like to also thank Matthew Otey who helped with publicity for the workshop.

Secondary structure prediction with support vector machines

Motivation: A new method that uses support vector machines (SVMs) to predict protein secondary structure is described and evaluated. The study is designed to develop a reliable prediction method using an alternative technique and to investigate the applicability of SVMs to this type of bioinformatics problem. Methods: Binary SVMs are trained to discriminate between two structural classes. The binary classifiers are combined in several ways to predict multi-class secondary structure. Results: The average three-state prediction accuracy per protein (Q3) is estimated by cross-validation to be 77.07 ± 0.26% with a segment overlap (Sov) score of 73.32 ± 0.39%. The SVM performs similarly to the 'state-of-the-art' PSIPRED prediction method on a non-homologous test set of 121 proteins despite being trained on substantially fewer examples. A simple consensus of the SVM, PSIPRED and PROFsec achieves significantly higher prediction accuracy than the individual methods. Availability: The SVM classifier is available from the authors. Work is in progress to make the method available on-line and to integrate the SVM predictions into the PSIPRED server.

Not all sigmodontine rodents in the sugarcane fields in costal Veracruz, Mexico, are pests

Rats and mice have traditionally been considered one of the most important pests of sugarcane. However, "control" campaigns are rarely specific to the target species, and can have an effect on local wildlife, in particular non-pest rodent species. The objective of this study was to distinguish between rodent species that are pests and those that are not, and to identify patterns of food utilization by the rodents in the sugarcane crop complex. Within the crop complex, subsistence crops like maize, sorghum, rice, and bananas, which are grown alongside the sugarcane, are also subject to rodent damage. Six native rodent species were trapped in the Papaloapan River Basin of the State of Veracruz; the cotton rat (Sigmodon hispidus), the rice rat (Oryzomys couesi), the small rice rat (O. chapmani), the white footed mouse (Peromyscus leucopus), the golden mouse (Reithrodontomys sumichrasti), and the pigmy mouse (Baiomys musculus). In a stomach content analysis, the major food components for the cotton rat, the rice rat and the small rice rat were sugarcane (4.9 to 30.1 %), seed (2.7 to 22.9%), and vegetation (0.9 to 29.8%); while for the golden mouse and the pigmy mouse the stomach content was almost exclusively seed (98 to 100%). The authors consider the first three species to be pests of the sugarcane crop complex, while the last two species are not.

Parkinson’s Disease tremor classification – a comparison between Support Vector Machines and neural networks

Deep Brain Stimulation has been used in the study of and for treating Parkinson’s Disease (PD) tremor symptoms since the 1980s. In the research reported here we have carried out a comparative analysis to classify tremor onset based on intraoperative microelectrode recordings of a PD patient’s brain Local Field Potential (LFP) signals. In particular, we compared the performance of a Support Vector Machine (SVM) with two well known artificial neural network classifiers, namely a Multiple Layer Perceptron (MLP) and a Radial Basis Function Network (RBN). The results show that in this study, using specifically PD data, the SVM provided an overall better classification rate achieving an accuracy of 81% recognition.

Plane wave discontinuous Galerkin methods for the 2D Helmholtz equation: analysis of the $p$-version

Plane wave discontinuous Galerkin (PWDG) methods are a class of Trefftz-type methods for the spatial discretization of boundary value problems for the Helmholtz operator $-\Delta-\omega^2$, $\omega>0$. They include the so-called ultra weak variational formulation from [O. Cessenat and B. Després, SIAM J. Numer. Anal., 35 (1998), pp. 255–299]. This paper is concerned with the a priori convergence analysis of PWDG in the case of $p$-refinement, that is, the study of the asymptotic behavior of relevant error norms as the number of plane wave directions in the local trial spaces is increased. For convex domains in two space dimensions, we derive convergence rates, employing mesh skeleton-based norms, duality techniques from [P. Monk and D. Wang, Comput. Methods Appl. Mech. Engrg., 175 (1999), pp. 121–136], and plane wave approximation theory.

Nonlinear set-membership estimation: a support vector machine approach

In this paper a support vector machine (SVM) approach for characterizing the feasible parameter set (FPS) in non-linear set-membership estimation problems is presented. It iteratively solves a regression problem from which an approximation of the boundary of the FPS can be determined. To guarantee convergence to the boundary the procedure includes a no-derivative line search and for an appropriate coverage of points on the FPS boundary it is suggested to start with a sequential box pavement procedure. The SVM approach is illustrated on a simple sine and exponential model with two parameters and an agro-forestry simulation model.

Bayesian parameter estimation for latent Markov random fields and social networks

Undirected graphical models are widely used in statistics, physics and machine vision. However Bayesian parameter estimation for undirected models is extremely challenging, since evaluation of the posterior typically involves the calculation of an intractable normalising constant. This problem has received much attention, but very little of this has focussed on the important practical case where the data consists of noisy or incomplete observations of the underlying hidden structure. This paper specifically addresses this problem, comparing two alternative methodologies. In the first of these approaches particle Markov chain Monte Carlo (Andrieu et al., 2010) is used to efficiently explore the parameter space, combined with the exchange algorithm (Murray et al., 2006) for avoiding the calculation of the intractable normalising constant (a proof showing that this combination targets the correct distribution in found in a supplementary appendix online). This approach is compared with approximate Bayesian computation (Pritchard et al., 1999). Applications to estimating the parameters of Ising models and exponential random graphs from noisy data are presented. Each algorithm used in the paper targets an approximation to the true posterior due to the use of MCMC to simulate from the latent graphical model, in lieu of being able to do this exactly in general. The supplementary appendix also describes the nature of the resulting approximation.