Search

This paper extends the observations presented in the previously published work on the afterhyperpolarization (AHP) duration changes in motoneurones (MNs) on the paretic (more affected) side of 11 post-stroke patients by the same analysis on the non-paretic (less-affected) side. The estimated AHP duration for patients’ MNs supplying more-affected muscles was significantly longer than control values and the elongation decreased with patient age and disorder duration. For MNs supplying less-affected muscles, dependency of AHP duration on age was closer to the control data, but the scatter was substantially bigger. However, the AHP duration estimate of less-affected MNs tended to be longer than that of controls in the short time elapsed since the stroke, and shorter than controls in the long time. Our results thus suggest that the spinal MNs on both sides respond to the cerebral stroke rapidly with prolongation of AHP duration, which tends to normalize with time, in line with functional recovery. This suggestion is in concert with the published research on post-stroke changes in brain hemispheres. To our knowledge, these dependencies have never been investigated before. Since the number of our data was limited, the observed trends should be verified in a larger sample of patients and such a verification could take into account the suggestions for data analysis that we provide in this paper. Our data are in line with the earlier published research on MN firing characteristics post-stroke and support the conclusion that the MUs of the muscles at the non-paretic side are also affected and cannot be considered a suitable control for the MUs on the paretic side. [ABSTRACT FROM AUTHOR]

To what extent can online social networks predict who is at risk of an infection? Many infections are transmitted through physical encounter between humans, but collecting detailed information about it can be expensive, might invade privacy, or might not even be possible. In this paper, we ask whether online social networks help predict and contain epidemic risk. Using a dataset from a popular online review service which includes over 100 thousand users and spans 4 years of activity, we build a time-varying network that is a proxy of physical encounter between its users (the encounter network) and a static network based on their reported online friendship (the friendship With computer simulations, we compare stochastic infection processes on the two networks, considering infections on the encounter network as the benchmark. First, we show that the friendship network is useful to identify the individuals at risk of infection, despite providing lower accuracy than the ideal case in which the encounters are known. This limited prediction accuracy is not only due to the static nature of the friendship network because a static version of the encounter network provides more accurate prediction of risk than the friendship network. Then, we show that periodical monitoring of the infection spreading on the encounter network allows to correct the infection predicted by a process spreading on the friendly staff ndship network, and achieves high prediction accuracy. Finally, we show that the friendship network contains valuable information to effectively contain epidemic outbreaks even when a limited budget is available for immunization. In particular, a strategy that immunizes random friends of random individuals achieves the same performance as knowing individuals’ encounters at a small additional cost, even if the infection spreads on the encounter network. [ABSTRACT FROM AUTHOR]

Poor eating behavior has been identified as one of the core contributory factors of the childhood obesity epidemic. The consequences of obesity on numerous aspects of life are thoroughly explored in the existing literature. For instance, evidence shows that obesity is linked to incidences of diseases such as heart disease, type-2 diabetes, and some cancers, as well as psychosocial problems. To respond to the increasing trends in the UK, in 2008 the government set a target to reverse the prevalence of obesity (POB) back to 2000 levels by 2020. This paper will outline the application of system dynamics (SD) optimization to simulate the effect of changes in the eating behavior of British children (aged 2 to 15 years) on weight and obesity. This study also will identify how long it will take to achieve the government’s target. This paper proposed a simulation model called Intervention Childhood Obesity Dynamics (ICOD) by focusing the interrelations between various strands of knowledge in one complex human weight regulation system. The model offers distinct insights into the dynamics by capturing the complex interdependencies from the causal loop and feedback structure, with the intention to better understand how eating behaviors influence children’s weight, body mass index (BMI), and POB measurement. This study proposed a set of equations that are revised from the original (baseline) equations. The new functions are constructed using a RAMP function of linear decrement in portion size and number of meal variables from 2013 until 2020 in order to achieve the 2020 desired target. Findings from the optimization analysis revealed that the 2020 target won’t be achieved until 2026 at the earliest, six years late. Thus, the model suggested that a longer period may be needed to significantly reduce obesity in this population. [ABSTRACT FROM AUTHOR]

A bridge role metric model is put forward in this paper. Compared with previous metric models, our solution of a large-scale object-oriented software system as a complex network is inherently more realistic. To acquire nodes and links in an undirected network, a new model that presents the crucial connectivity of a module or the hub instead of only centrality as in previous metric models is presented. Two previous metric models are described for comparison. In addition, it is obvious that the fitting curve between the results and degrees can well be fitted by a power law. The model represents many realistic characteristics of actual software structures, and a hydropower simulation system is taken as an example. This paper makes additional contributions to an accurate understanding of module design of software systems and is expected to be beneficial to software engineering practices. [ABSTRACT FROM AUTHOR]

Homeostatic and adaptive control mechanisms are essential for keeping organisms structurally and functionally stable. Integral feedback is a control theoretic concept which has long been known to keep a controlled variable robustly (i.e. perturbation-independent) at a given set-point by feeding the integrated error back into the process that generates . The classical concept of homeostasis as robust regulation within narrow limits is often considered as unsatisfactory and even incompatible with many biological systems which show sustained oscillations, such as circadian rhythms and oscillatory calcium signaling. Nevertheless, there are many similarities between the biological processes which participate in oscillatory mechanisms and classical homeostatic (non-oscillatory) mechanisms. We have investigated whether biological oscillators can show robust homeostatic and adaptive behaviors, and this paper is an attempt to extend the homeostatic concept to include oscillatory conditions. Based on our previously published kinetic conditions on how to generate biochemical models with robust homeostasis we found two properties, which appear to be of general interest concerning oscillatory and homeostatic controlled biological systems. The first one is the ability of these oscillators (“oscillatory homeostats”) to keep the average level of a controlled variable at a defined set-point by involving compensatory changes in frequency and/or amplitude. The second property is the ability to keep the period/frequency of the oscillator tuned within a certain well-defined range. In this paper we highlight mechanisms that lead to these two properties. The biological applications of these findings are discussed using three examples, the homeostatic aspects during oscillatory calcium and p53 signaling, and the involvement of circadian rhythms in homeostatic regulation. [ABSTRACT FROM AUTHOR]

It is a classic topic of social network analysis to evaluate the importance of nodes and identify the node that takes on the role of core or bridge in a network. Because a single indicator is not sufficient to analyze multiple characteristics of a node, it is a natural solution to apply multiple indicators that should be selected carefully. An intuitive idea is to select some indicators with weak correlations to efficiently assess different characteristics of a node. However, this paper shows that it is much better to select the indicators with strong correlations. Because indicator correlation is based on the statistical analysis of a large number of nodes, the particularity of an important node will be outlined if its indicator relationship doesn't comply with the statistical correlation. Therefore, the paper selects the multiple indicators including degree, ego-betweenness centrality and eigenvector centrality to evaluate the importance and the role of a node. The importance of a node is equal to the normalized sum of its three indicators. A candidate for core or bridge is selected from the great degree nodes or the nodes with great ego-betweenness centrality respectively. Then, the role of a candidate is determined according to the difference between its indicators' relationship with the statistical correlation of the overall network. Based on 18 real networks and 3 kinds of model networks, the experimental results show that the proposed methods perform quite well in evaluating the importance of nodes and in identifying the node role. [ABSTRACT FROM AUTHOR]

Wind turbine noise is one of the major obstacles for the widespread use of wind energy. Noise tone can greatly increase the annoyance factor and the negative impact on human health. Noise annoyance caused by wind turbines has become an emerging problem in recent years, due to the rapid increase in number of wind turbines, triggered by sustainable energy goals set forward at the national and international level. Up to now, not all aspects of the generation, propagation and perception of wind turbine noise are well understood. For a modern large wind turbine, aerodynamic noise from the blades is generally considered to be the dominant noise source, provided that mechanical noise is adequately eliminated. The sources of aerodynamic noise can be divided into tonal noise, inflow turbulence noise, and airfoil self-noise. Many analytical and experimental acoustical studies performed the wind turbines. Since the wind turbine noise level analyzing by numerical methods or computational fluid dynamics (CFD) could be very challenging and time consuming, soft computing techniques are preferred. To estimate noise level of wind turbine, this paper constructed a process which simulates the wind turbine noise levels in regard to wind speed and sound frequency with adaptive neuro-fuzzy inference system (ANFIS). This intelligent estimator is implemented using Matlab/Simulink and the performances are investigated. The simulation results presented in this paper show the effectiveness of the developed method. [ABSTRACT FROM AUTHOR]

In today's technology-assisted society, social interactions may be expressed through a variety of techno-communication channels, including online social networks, email and mobile phones (calls, text messages). Consequently, a clear grasp of human behavior through the diverse communication media is considered a key factor in understanding the formation of the today's information society. So far, all previous research on user communication behavior has focused on a sole communication activity. In this paper we move forward another step on this research path by performing a multidimensional study of human sociality as an expression of the use of mobile phones. The paper focuses on user temporal communication behavior in the interplay between the two complementary communication media, text messages and phone calls, that represent the bi-dimensional scenario of analysis. Our study provides a theoretical framework for analyzing multidimensional bursts as the most general burst category, that includes one-dimensional bursts as the simplest case, and offers empirical evidence of their nature by following the combined phone call/text message communication patterns of approximately one million people over three-month period. This quantitative approach enables the design of a generative model rooted in the three most significant features of the multidimensional burst - the number of dimensions, prevalence and interleaving degree - able to reproduce the main media usage attitude. The other findings of the paper include a novel multidimensional burst detection algorithm and an insight analysis of the human media selection process. [ABSTRACT FROM AUTHOR]

DNA microarrays and cell cycle synchronization experiments have made possible the study of the mechanisms of cell cycle regulation of Saccharomyces cerevisiae by simultaneously monitoring the expression levels of thousands of genes at specific time points. On the other hand, pattern recognition techniques can contribute to the analysis of such massive measurements, providing a model of gene expression level evolution through the cell cycle process. In this paper, we propose the use of one of such techniques –an unsupervised artificial neural network called a Self-Organizing Map (SOM)–which has been successfully applied to processes involving very noisy signals, classifying and organizing them, and assisting in the discovery of behavior patterns without requiring prior knowledge about the process under analysis. As a test bed for the use of SOMs in finding possible relationships among genes and their possible contribution in some biological processes, we selected 282 S. cerevisiae genes that have been shown through biological experiments to have an activity during the cell cycle. The expression level of these genes was analyzed in five of the most cited time series DNA microarray databases used in the study of the cell cycle of this organism. With the use of SOM, it was possible to find clusters of genes with similar behavior in the five databases along two cell cycles. This result suggested that some of these genes might be biologically related or might have a regulatory relationship, as was corroborated by comparing some of the clusters obtained with SOMs against a previously reported regulatory network that was generated using biological knowledge, such as protein-protein interactions, gene expression levels, metabolism dynamics, promoter binding, and modification, regulation and transport of proteins. The methodology described in this paper could be applied to the study of gene relationships of other biological processes in different organisms. [ABSTRACT FROM AUTHOR]

This paper examines a biologically-inspired representation technique designed for the support of sensory-motor learning in developmental robotics. An interesting feature of the many topographic neural sheets in the brain is that closely packed receptive fields must overlap in order to fully cover a spatial region. This raises interesting scientific questions with engineering implications: e.g. is overlap detrimental? does it have any benefits? This paper examines the effects and properties of overlap between elements arranged in arrays or maps. In particular we investigate how overlap affects the representation and transmission of spatial location information on and between topographic maps. Through a series of experiments we determine the conditions under which overlap offers advantages and identify useful ranges of overlap for building mappings in cognitive robotic systems. Our motivation is to understand the phenomena of overlap in order to provide guidance for application in sensory-motor learning robots. [ABSTRACT FROM AUTHOR]

In 1979 Haralick famously introduced a method for analyzing the texture of an image: a set of statistics extracted from the co-occurrence matrix. In this paper we investigate novel sets of texture descriptors extracted from the co-occurrence matrix; in addition, we compare and combine different strategies for extending these descriptors. The following approaches are compared: the standard approach proposed by Haralick, two methods that consider the co-occurrence matrix as a three-dimensional shape, a gray-level run-length set of features and the direct use of the co-occurrence matrix projected onto a lower dimensional subspace by principal component analysis. Texture descriptors are extracted from the co-occurrence matrix evaluated at multiple scales. Moreover, the descriptors are extracted not only from the entire co-occurrence matrix but also from subwindows. The resulting texture descriptors are used to train a support vector machine and ensembles. Results show that our novel extraction methods improve the performance of standard methods. We validate our approach across six medical datasets representing different image classification problems using the Wilcoxon signed rank test. The source code used for the approaches tested in this paper will be available at: http://www.dei.unipd.it/wdyn/?IDsezione=3314&IDgruppo_pass=124&preview=. [ABSTRACT FROM AUTHOR]

This paper presents an adaption of the fractional order terminal sliding mode control (AFTSMC) strategy for DC-DC Buck converter. The following strategy aims to design a novel nonlinear sliding surface function, with a double closed-loop structure of voltage and current. This strategy is a fusion of two characteristics: terminal sliding mode control (TSMC) and fractional order calculation (FOC). In addition, the influence of “the controller parameters” on the “performance of double closed-loop system” is investigated. It is observed that the value of terminal power has to be chosen to make a compromise between start-up and transient response of the converter. Therefore the AFTSMC strategy chooses the value of the terminal power adaptively, and this strategy can lead to the appropriate number of fractional order as well. Furthermore, through the fractional order analysis, the system can reach the sliding mode surface in a finite time. And the theoretical considerations are verified by numerical simulation. The performance of the AFTSMC and TSMC strategies is tested by computer simulations. And the comparison simulation results show that the AFTSMC exhibits a considerable improvement in terms of a faster output voltage response during load changes. Moreover, AFTSMC obtains a faster dynamical response, smaller steady-state error rate and lower overshoot. [ABSTRACT FROM AUTHOR]

Flux balance analysis and constraint based modeling have been successfully used in the past to elucidate the metabolism of single cellular organisms. However, limited work has been done with multicellular organisms and even less with humans. The focus of this paper is to present a novel use of this technique by investigating human nutrition, a challenging field of study. Specifically, we present a steady state constraint based model of skeletal muscle tissue to investigate amino acid supplementation's effect on protein synthesis. We implement several in silico supplementation strategies to study whether amino acid supplementation might be beneficial for increasing muscle contractile protein synthesis. Concurrent with published data on amino acid supplementation's effect on protein synthesis in a post resistance exercise state, our results suggest that increasing bioavailability of methionine, arginine, and the branched-chain amino acids can increase the flux of contractile protein synthesis. The study also suggests that a common commercial supplement, glutamine, is not an effective supplement in the context of increasing protein synthesis and thus, muscle mass. Similar to any study in a model organism, the computational modeling of this research has some limitations. Thus, this paper introduces the prospect of using systems biology as a framework to formally investigate how supplementation and nutrition can affect human metabolism and physiology. [ABSTRACT FROM AUTHOR]

In some large-scale face recognition task, such as driver license identification and law enforcement, the training set only contains one image per person. This situation is referred to as one sample problem. Because many face recognition techniques implicitly assume that several (at least two) images per person are available for training, they cannot deal with the one sample problem. This paper investigates principal component analysis (PCA), Fisher linear discriminant analysis (LDA), and locality preserving projections (LPP) and shows why they cannot perform well in one sample problem. After that, this paper presents four reasons that make one sample problem itself difficult: the small sample size problem; the lack of representative samples; the underestimated intra-class variation; and the overestimated inter-class variation. Based on the analysis, this paper proposes to enlarge the training set based on the inter-class relationship. This paper also extends LDA and LPP to extract features from the enlarged training set. The experimental results show the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Background: The electronic laboratory notebook (ELN) has the potential to replace the paper notebook with a marked-up digital record that can be searched and shared. However, it is a challenge to achieve these benefits without losing the usability and flexibility of traditional paper notebooks. We investigate a blog-based platform that addresses the issues associated with the development of a flexible system for recording scientific research. Methodology/Principal Findings: We chose a blog-based approach with the journal characteristics of traditional notebooks in mind, recognizing the potential for linking together procedures, materials, samples, observations, data, and analysis reports. We implemented the LabTrove blog system as a server process written in PHP, using a MySQL database to persist posts and other research objects. We incorporated a metadata framework that is both extensible and flexible while promoting consistency and structure where appropriate. Our experience thus far is that LabTrove is capable of providing a successful electronic laboratory recording system. Conclusions/Significance: LabTrove implements a one-item one-post system, which enables us to uniquely identify each element of the research record, such as data, samples, and protocols. This unique association between a post and a research element affords advantages for monitoring the use of materials and samples and for inspecting research processes. The combination of the one-item one-post system, consistent metadata, and full-text search provides us with a much more effective record than a paper notebook. The LabTrove approach provides a route towards reconciling the tensions and challenges that lie ahead in working towards the long-term goals for ELNs. LabTrove, an electronic laboratory notebook (ELN) system from the Smart Research Framework, based on a blog-type framework with full access control, facilitates the scientific experimental recording requirements for reproducibility, reuse, repurposing, and redeployment. [ABSTRACT FROM AUTHOR]

Distributed hash tables (DHTs) are usually used in the open networking environment, where they are vulnerable to Sybil attacks. Pebble-Rotating Game (PRG) mixes the nodes of the honest and the adversarial randomly, and can resist the Sybil attack efficiently. However, the adversary may have some tricks to corrupt the rule of PRG. This paper proposes a set of mechanisms to make the rule of PRG be obliged to obey. A new joining node must ask the Certificate Authority (CA) for its signature and certificate, which records the complete process on how a node joins the network and obtains the legitimacy of the node. Then, to prevent the adversary from accumulating identifiers, any node can make use of the latest certificate to judge whether one identifier is expired with the help of the replacement property of RPG. This paper analyzes in details the number of expired certificates which are needed to store in every node, and gives asymptotic solution of this problem. The analysis and simulations show that the mean number of the certificates stored in each node are , where n is the size of the network. [ABSTRACT FROM AUTHOR]

Background: Nanoparticle-protein corona complex formation involves absorption of protein molecules onto nanoparticle surfaces in a physiological environment. Understanding the corona formation process is crucial in predicting nanoparticle behavior in biological systems, including applications of nanotoxicology and development of nano drug delivery platforms. Method: This paper extends the modeling work in to derive a mathematical model describing the dynamics of nanoparticle corona complex formation from population balance equations. We apply nonlinear dynamics techniques to derive analytical results for the composition of nanoparticle-protein corona complex, and validate our results through numerical simulations. Results: The model presented in this paper exhibits two phases of corona complex dynamics. In the first phase, proteins rapidly bind to the free surface of nanoparticles, leading to a metastable composition. During the second phase, continuous association and dissociation of protein molecules with nanoparticles slowly changes the composition of the corona complex. Given sufficient time, composition of the corona complex reaches an equilibrium state of stable composition. We find analytical approximate formulae for metastable and stable compositions of corona complex. Our formulae are very well-structured to clearly identify important parameters determining corona composition. Conclusion: The dynamics of biocorona formation constitute vital aspect of interactions between nanoparticles and living organisms. Our results further understanding of these dynamics through quantitation of experimental conditions, modeling results for in vitro systems to better predict behavior for in vivo systems. One potential application would involve a single cell culture medium related to a complex protein medium, such as blood or tissue fluid. [ABSTRACT FROM AUTHOR]

The objective of the paper is to show that electroosmotic flow might play an important role in the intracellular transport of biomolecules. The paper presents two mathematical models describing the role of electroosmosis in the transport of the negatively charged messenger proteins to the negatively charged nucleus and in the recovery of the fluorescence after photobleaching. The parameters of the models were derived from the extensive review of the literature data. Computer simulations were performed within the COMSOL 4.2a software environment. The first model demonstrated that the presence of electroosmosis might intensify the flux of messenger proteins to the nucleus and allow the efficient transport of the negatively charged phosphorylated messenger proteins against the electrostatic repulsion of the negatively charged nucleus. The second model revealed that the presence of the electroosmotic flow made the time of fluorescence recovery dependent on the position of the bleaching spot relative to cellular membrane. The magnitude of the electroosmotic flow effect was shown to be quite substantial, i.e. increasing the flux of the messengers onto the nucleus up to 4-fold relative to pure diffusion and resulting in the up to 3-fold change in the values of fluorescence recovery time, and therefore the apparent diffusion coefficient determined from the fluorescence recovery after photobleaching experiments. Based on the results of the modeling and on the universal nature of the electroosmotic flow, the potential wider implications of electroosmotic flow in the intracellular and extracellular biological processes are discussed. Both models are available for download at ModelDB. [ABSTRACT FROM AUTHOR]

One of the key aspects of computational systems biology is the investigation on the dynamic biological processes within cells. Computational models are often required to elucidate the mechanisms and principles driving the processes because of the nonlinearity and complexity. The models usually incorporate a set of parameters that signify the physical properties of the actual biological systems. In most cases, these parameters are estimated by fitting the model outputs with the corresponding experimental data. However, this is a challenging task because the available experimental data are frequently noisy and incomplete. In this paper, a new hybrid optimization method is proposed to estimate these parameters from the noisy and incomplete experimental data. The proposed method, called Swarm-based Chemical Reaction Optimization, integrates the evolutionary searching strategy employed by the Chemical Reaction Optimization, into the neighbouring searching strategy of the Firefly Algorithm method. The effectiveness of the method was evaluated using a simulated nonlinear model and two biological models: synthetic transcriptional oscillators, and extracellular protease production models. The results showed that the accuracy and computational speed of the proposed method were better than the existing Differential Evolution, Firefly Algorithm and Chemical Reaction Optimization methods. The reliability of the estimated parameters was statistically validated, which suggests that the model outputs produced by these parameters were valid even when noisy and incomplete experimental data were used. Additionally, Akaike Information Criterion was employed to evaluate the model selection, which highlighted the capability of the proposed method in choosing a plausible model based on the experimental data. In conclusion, this paper presents the effectiveness of the proposed method for parameter estimation and model selection problems using noisy and incomplete experimental data. This study is hoped to provide a new insight in developing more accurate and reliable biological models based on limited and low quality experimental data. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a biologically inspired model to generate complex networks. In contrast to many other construction procedures for growing networks introduced so far, our method generates networks from one-dimensional symbol sequences that are related to the so called Collatz problem from number theory. The major purpose of the present paper is, first, to derive a symbol sequence from the Collatz problem, we call the step sequence, and investigate its structural properties. Second, we introduce a construction procedure for growing networks that is based on these step sequences. Third, we investigate the structural properties of this new network class including their finite scaling and asymptotic behavior of their complexity, average shortest path lengths and clustering coefficients. Interestingly, in contrast to many other network models including the small-world network from Watts & Strogatz, we find that CS graphs become ‘smaller’ with an increasing size. [ABSTRACT FROM AUTHOR]

In this paper, we develop two automated authorship attribution schemes, one based on Multiple Discriminant Analysis (MDA) and the other based on a Support Vector Machine (SVM). The classification features we exploit are based on word frequencies in the text. We adopt an approach of preprocessing each text by stripping it of all characters except a-z and space. This is in order to increase the portability of the software to different types of texts. We test the methodology on a corpus of undisputed English texts, and use leave-one-out cross validation to demonstrate classification accuracies in excess of 90%. We further test our methods on the Federalist Papers, which have a partly disputed authorship and a fair degree of scholarly consensus. And finally, we apply our methodology to the question of the authorship of the Letter to the Hebrews by comparing it against a number of original Greek texts of known authorship. These tests identify where some of the limitations lie, motivating a number of open questions for future work. An open source implementation of our methodology is freely available for use at https://github.com/matthewberryman/author-detection. [ABSTRACT FROM AUTHOR]

This paper describes a new computer virus spreading model which takes into account the possibility of a virus outbreak on a network with limited anti-virus ability. Then, the model is investigated for the existence of equilibria and their stabilities are proved and illustrated. Moreover, it is found that these two factors are not only relative to the threshold value determining whether the virus becomes extinct or not, but that they are also relative to the virus epidemic levels. Theoretical and experimental results indicate that, in some ways, it would be practically possible to eradicate the virus or suppress its prevalence below a suitable level. Consequently, some suggestions are proposed that may help eradicate or suppress virus propagation over a real computer network. [ABSTRACT FROM AUTHOR]

This paper proposes a pseudo-haptic feedback method conveying simulated soft surface stiffness information through a visual interface. The method exploits a combination of two feedback techniques, namely visual feedback of soft surface deformation and control of the indenter avatar speed, to convey stiffness information of a simulated surface of a soft object in virtual environments. The proposed method was effective in distinguishing different sizes of virtual hard nodules integrated into the simulated soft bodies. To further improve the interactive experience, the approach was extended creating a multi-point pseudo-haptic feedback system. A comparison with regards to (a) nodule detection sensitivity and (b) elapsed time as performance indicators in hard nodule detection experiments to a tablet computer incorporating vibration feedback was conducted. The multi-point pseudo-haptic interaction is shown to be more time-efficient than the single-point pseudo-haptic interaction. It is noted that multi-point pseudo-haptic feedback performs similarly well when compared to a vibration-based feedback method based on both performance measures elapsed time and nodule detection sensitivity. This proves that the proposed method can be used to convey detailed haptic information for virtual environmental tasks, even subtle ones, using either a computer mouse or a pressure sensitive device as an input device. This pseudo-haptic feedback method provides an opportunity for low-cost simulation of objects with soft surfaces and hard inclusions, as, for example, occurring in ever more realistic video games with increasing emphasis on interaction with the physical environment and minimally invasive surgery in the form of soft tissue organs with embedded cancer nodules. Hence, the method can be used in many low-budget applications where haptic sensation is required, such as surgeon training or video games, either using desktop computers or portable devices, showing reasonably high fidelity in conveying stiffness perception to the user. [ABSTRACT FROM AUTHOR]

Joint improvisation is often observed among humans performing joint action tasks. Exploring the underlying cognitive and neural mechanisms behind the emergence of joint improvisation is an open research challenge. This paper investigates jointly improvised movements between two participants in the mirror game, a paradigmatic joint task example. First, experiments involving movement coordination of different dyads of human players are performed in order to build a human benchmark. No designation of leader and follower is given beforehand. We find that joint improvisation is characterized by the lack of a leader and high levels of movement synchronization. Then, a theoretical model is proposed to capture some features of their interaction, and a set of experiments is carried out to test and validate the model ability to reproduce the experimental observations. Furthermore, the model is used to drive a computer avatar able to successfully improvise joint motion with a human participant in real time. Finally, a convergence analysis of the proposed model is carried out to confirm its ability to reproduce joint movements between the participants. [ABSTRACT FROM AUTHOR]

Currently, studies connected with Computational Fluid Dynamic (CFD) techniques focus on assessing hemodynamic of blood flow in vessels in different conditions e.g. after stent-graft’s placement. The paper propose a novel method of standardization of results obtained from calculations of stent-grafts' “pushing forces” (cumulative WSS—Wall Shear Stress), and describes its usefulness in diagnostic process. AngioCT data from 27 patients were used to reconstruct 3D geometries of stent-grafts which next were used to create respective reference cylinders. We made an assumption that both the side surface and the height of a stent-graft and a reference cylinder were equal. The proposed algorithm in conjunction with a stent-graft “pushing forces” on an implant wall, allowed us to determine which spatial configuration of a stent-graft predispose to the higher risk of its migration. For stent-grafts close to cylindrical shape (shape factor φ close to 1) WSS value was about 267Pa, while for stent-grafts different from cylindrical shape (φ close to 2) WSS value was about 635Pa. It was also noticed that deformation in the stent-graft’s bifurcation part impaired blood flow hemodynamic. Concluding the proposed algorithm of standardization proved its usefulness in estimating the WSS values that may be useful in diagnostic process. Angular bends or tortuosity in bifurcations of an aortic implant should be considered in further studies of estimation of the risk of implantation failure. [ABSTRACT FROM AUTHOR]

Allelic richness (number of alleles) is a measure of genetic diversity indicative of a population's long-term potential for adaptability and persistence. It is used less commonly than heterozygosity as a genetic diversity measure, partially because it is more mathematically difficult to take into account the stochastic process of genetic drift for allelic richness. This paper presents a stochastic model for the allelic richness of a newly founded population experiencing genetic drift and gene flow. The model follows the dynamics of alleles lost during the founder event and simulates the effect of gene flow on maintenance and recovery of allelic richness. The probability of an allele's presence in the population was identified as the relevant statistical property for a meaningful interpretation of allelic richness. A method is discussed that combines the probability of allele presence with a population's allele frequency spectrum to provide predictions for allele recovery. The model's analysis provides insights into the dynamics of allelic richness following a founder event, taking into account gene flow and the allele frequency spectrum. Furthermore, the model indicates that the “One Migrant per Generation” rule, a commonly used conservation guideline related to heterozygosity, may be inadequate for addressing preservation of diversity at the allelic level. This highlights the importance of distinguishing between heterozygosity and allelic richness as measures of genetic diversity, since focusing merely on the preservation of heterozygosity might not be enough to adequately preserve allelic richness, which is crucial for species persistence and evolution. [ABSTRACT FROM AUTHOR]

Several variable selection algorithms in multivariate calibration can be accelerated using Graphics Processing Units (GPU). Among these algorithms, the Firefly Algorithm (FA) is a recent proposed metaheuristic that may be used for variable selection. This paper presents a GPU-based FA (FA-MLR) with multiobjective formulation for variable selection in multivariate calibration problems and compares it with some traditional sequential algorithms in the literature. The advantage of the proposed implementation is demonstrated in an example involving a relatively large number of variables. The results showed that the FA-MLR, in comparison with the traditional algorithms is a more suitable choice and a relevant contribution for the variable selection problem. Additionally, the results also demonstrated that the FA-MLR performed in a GPU can be five times faster than its sequential implementation. [ABSTRACT FROM AUTHOR]

Recently, Sparse Representation-based Classification (SRC) has attracted a lot of attention for its applications to various tasks, especially in biometric techniques such as face recognition. However, factors such as lighting, expression, pose and disguise variations in face images will decrease the performances of SRC and most other face recognition techniques. In order to overcome these limitations, we propose a robust face recognition method named Locality Constrained Joint Dynamic Sparse Representation-based Classification (LCJDSRC) in this paper. In our method, a face image is first partitioned into several smaller sub-images. Then, these sub-images are sparsely represented using the proposed locality constrained joint dynamic sparse representation algorithm. Finally, the representation results for all sub-images are aggregated to obtain the final recognition result. Compared with other algorithms which process each sub-image of a face image independently, the proposed algorithm regards the local matching-based face recognition as a multi-task learning problem. Thus, the latent relationships among the sub-images from the same face image are taken into account. Meanwhile, the locality information of the data is also considered in our algorithm. We evaluate our algorithm by comparing it with other state-of-the-art approaches. Extensive experiments on four benchmark face databases (ORL, Extended YaleB, AR and LFW) demonstrate the effectiveness of LCJDSRC. [ABSTRACT FROM AUTHOR]

The future of quick and efficient disease diagnosis lays in the development of reliable non-invasive methods. As for the cardiac diseases – one of the major causes of death around the globe – a concept of an electronic stethoscope equipped with an automatic heart tone identification system appears to be the best solution. Thanks to the advancement in technology, the quality of phonocardiography signals is no longer an issue. However, appropriate algorithms for auto-diagnosis systems of heart diseases that could be capable of distinguishing most of known pathological states have not been yet developed. The main issue is non-stationary character of phonocardiography signals as well as a wide range of distinguishable pathological heart sounds. In this paper a new heart sound classification technique, which might find use in medical diagnostic systems, is presented. It is shown that by combining Linear Predictive Coding coefficients, used for future extraction, with a classifier built upon combining Support Vector Machine and Modified Cuckoo Search algorithm, an improvement in performance of the diagnostic system, in terms of accuracy, complexity and range of distinguishable heart sounds, can be made. The developed system achieved accuracy above 93% for all considered cases including simultaneous identification of twelve different heart sound classes. The respective system is compared with four different major classification methods, proving its reliability. [ABSTRACT FROM AUTHOR]

Minimum driver node sets (MDSs) play an important role in studying the structural controllability of complex networks. Recent research has shown that MDSs tend to avoid high-degree nodes. However, this observation is based on the analysis of a small number of MDSs, because enumerating all of the MDSs of a network is a #P problem. Therefore, past research has not been sufficient to arrive at a convincing conclusion. In this paper, first, we propose a preferential matching algorithm to find MDSs that have a specific degree property. Then, we show that the MDSs obtained by preferential matching can be composed of high- and medium-degree nodes. Moreover, the experimental results also show that the average degree of the MDSs of some networks tends to be greater than that of the overall network, even when the MDSs are obtained using previous research method. Further analysis shows that whether the driver nodes tend to be high-degree nodes or not is closely related to the edge direction of the network. [ABSTRACT FROM AUTHOR]

Perspective texture synthesis has great significance in many fields like video editing, scene capturing etc., due to its ability to read and control global feature information. In this paper, we present a novel example-based, specifically energy optimization-based algorithm, to synthesize perspective textures. Energy optimization technique is a pixel-based approach, so it’s time-consuming. We improve it from two aspects with the purpose of achieving faster synthesis and high quality. Firstly, we change this pixel-based technique by replacing the pixel computation with a little patch. Secondly, we present a novel technique to accelerate searching nearest neighborhoods in energy optimization. Using k- means clustering technique to build a search tree to accelerate the search. Hence, we make use of principal component analysis (PCA) technique to reduce dimensions of input vectors. The high quality results prove that our approach is feasible. Besides, our proposed algorithm needs shorter time relative to other similar methods. [ABSTRACT FROM AUTHOR]

Interleukin-35 (IL-35), a cytokine from the Interleukin-12 cytokine family, has been considered as an anti-inflammatory cytokine which promotes tumor progression and tumor immune evasion. It has also been demonstrated that IL-35 is secreted by regulatory T cells. Recent mouse experiments have shown that IL-35 produced by cancer cells promotes tumor growth via enhancing myeloid cell accumulation and angiogenesis, and reducing the infiltration of activated CD8 T cells into tumor microenvironment. In the present paper we develop a mathematical model based on these experimental results. We include in the model an anti-IL-35 drug as treatment. The extended model (with drug) is used to design protocols of anti-IL-35 injections for treatment of cancer. We find that with a fixed total amount of drug, continuous injection has better efficacy than intermittent injections in reducing the tumor load while the treatment is ongoing. We also find that the percentage of tumor reduction under anti-IL-35 treatment improves when the production of IL-35 by cancer is increased. [ABSTRACT FROM AUTHOR]

A challenge for physiologists and neuroscientists is to map information transfer between components of the systems that they study at different scales, in order to derive important knowledge on structure and function from the analysis of the recorded dynamics. The components of physiological networks often interact in a nonlinear way and through mechanisms which are in general not completely known. It is then safer that the method of choice for analyzing these interactions does not rely on any model or assumption on the nature of the data and their interactions. Transfer entropy has emerged as a powerful tool to quantify directed dynamical interactions. In this paper we compare different approaches to evaluate transfer entropy, some of them already proposed, some novel, and present their implementation in a freeware MATLAB toolbox. Applications to simulated and real data are presented. [ABSTRACT FROM AUTHOR]

Interference resulting from Cognitive Radios (CRs) is the most important aspect of cognitive radio networks that leads to degradation in Quality of Service (QoS) in both primary and CR systems. Power control is one of the efficient techniques that can be used to reduce interference and satisfy the Signal-to-Interference Ratio (SIR) constraint among CRs. This paper proposes a new distributed power control algorithm based on game theory approach in cognitive radio networks. The proposal focuses on the channel status of cognitive radio users to improve system performance. A new cost function for SIR-based power control via a sigmoid weighting factor is introduced. The existence of Nash Equilibrium and convergence of the algorithm are also proved. The advantage of the proposed algorithm is the possibility to utilize and implement it in a distributed manner. Simulation results show considerable savings on Nash Equilibrium power compared to relevant algorithms while reduction in achieved SIR is insignificant. [ABSTRACT FROM AUTHOR]

Analysis of the failure of cell signaling networks is an important topic in systems biology and has applications in target discovery and drug development. In this paper, some advanced methods for fault diagnosis in signaling networks are developed and then applied to a caspase network and an SHP2 network. The goal is to understand how, and to what extent, the dysfunction of molecules in a network contributes to the failure of the entire network. Network dysfunction (failure) is defined as failure to produce the expected outputs in response to the input signals. Vulnerability level of a molecule is defined as the probability of the network failure, when the molecule is dysfunctional. In this study, a method to calculate the vulnerability level of single molecules for different combinations of input signals is developed. Furthermore, a more complex yet biologically meaningful method for calculating the multi-fault vulnerability levels is suggested, in which two or more molecules are simultaneously dysfunctional. Finally, a method is developed for fault diagnosis of networks based on a ternary logic model, which considers three activity levels for a molecule instead of the previously published binary logic model, and provides equations for the vulnerabilities of molecules in a ternary framework. Multi-fault analysis shows that the pairs of molecules with high vulnerability typically include a highly vulnerable molecule identified by the single fault analysis. The ternary fault analysis for the caspase network shows that predictions obtained using the more complex ternary model are about the same as the predictions of the simpler binary approach. This study suggests that by increasing the number of activity levels the complexity of the model grows; however, the predictive power of the ternary model does not appear to be increased proportionally. [ABSTRACT FROM AUTHOR]

Realistic rendering techniques of outdoor Augmented Reality (AR) has been an attractive topic since the last two decades considering the sizeable amount of publications in computer graphics. Realistic virtual objects in outdoor rendering AR systems require sophisticated effects such as: shadows, daylight and interactions between sky colours and virtual as well as real objects. A few realistic rendering techniques have been designed to overcome this obstacle, most of which are related to non real-time rendering. However, the problem still remains, especially in outdoor rendering. This paper proposed a much newer, unique technique to achieve realistic real-time outdoor rendering, while taking into account the interaction between sky colours and objects in AR systems with respect to shadows in any specific location, date and time. This approach involves three main phases, which cover different outdoor AR rendering requirements. Firstly, sky colour was generated with respect to the position of the sun. Second step involves the shadow generation algorithm, Z-Partitioning: Gaussian and Fog Shadow Maps (Z-GaF Shadow Maps). Lastly, a technique to integrate sky colours and shadows through its effects on virtual objects in the AR system, is introduced. The experimental results reveal that the proposed technique has significantly improved the realism of real-time outdoor AR rendering, thus solving the problem of realistic AR systems. [ABSTRACT FROM AUTHOR]

Background: Early and accurate identification of adverse drug reactions (ADRs) is critically important for drug development and clinical safety. Computer-aided prediction of ADRs has attracted increasing attention in recent years, and many computational models have been proposed. However, because of the lack of systematic analysis and comparison of the different computational models, there remain limitations in designing more effective algorithms and selecting more useful features. There is therefore an urgent need to review and analyze previous computation models to obtain general conclusions that can provide useful guidance to construct more effective computational models to predict ADRs. Principal Findings: In the current study, the main work is to compare and analyze the performance of existing computational methods to predict ADRs, by implementing and evaluating additional algorithms that have been earlier used for predicting drug targets. Our results indicated that topological and intrinsic features were complementary to an extent and the Jaccard coefficient had an important and general effect on the prediction of drug-ADR associations. By comparing the structure of each algorithm, final formulas of these algorithms were all converted to linear model in form, based on this finding we propose a new algorithm called the general weighted profile method and it yielded the best overall performance among the algorithms investigated in this paper. Conclusion: Several meaningful conclusions and useful findings regarding the prediction of ADRs are provided for selecting optimal features and algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes a statistical generalized species-area model (GSAM) to represent various patterns of species-area relationship (SAR), which is one of the fundamental patterns in ecology. The approach enables the generalization of many preliminary models, as power-curve model, which is commonly used to mathematically describe the SAR. The GSAM is applied to simulated data set of species diversity in areas of different sizes and a real-world data of insects of Hymenoptera order has been modeled. We show that the GSAM enables the identification of the best statistical model and estimates the number of species according to the area. [ABSTRACT FROM AUTHOR]

In this paper, a Semantic Web service matchmaker called UltiMatch-NL is presented. UltiMatch-NL applies two filters namely Signature-based and Description-based on different abstraction levels of a service profile to achieve more accurate results. More specifically, the proposed filters rely on semantic knowledge to extract the similarity between a given pair of service descriptions. Thus it is a further step towards fully automated Web service discovery via making this process more semantic-aware. In addition, a new technique is proposed to weight and combine the results of different filters of UltiMatch-NL, automatically. Moreover, an innovative approach is introduced to predict the relevance of requests and Web services and eliminate the need for setting a threshold value of similarity. In order to evaluate UltiMatch-NL, the repository of OWLS-TC is used. The performance evaluation based on standard measures from the information retrieval field shows that semantic matching of OWL-S services can be significantly improved by incorporating designed matching filters. [ABSTRACT FROM AUTHOR]

Background: The spread of Bluetongue virus (BTV) among ruminants is caused by movement of infected host animals or by movement of infected Culicoides midges, the vector of BTV. Biologically plausible models of Culicoides dispersal are necessary for predicting the spread of BTV and are important for planning control and eradication strategies. Methods: A spatially-explicit simulation model which captures the two underlying population mechanisms, population dynamics and movement, was developed using extensive data from a trapping program for C. brevitarsis on the east coast of Australia. A realistic midge flight sub-model was developed and the annual incursion and population establishment of C. brevitarsis was simulated. Data from the literature was used to parameterise the model. Results: The model was shown to reproduce the spread of C. brevitarsis southwards along the east Australian coastline in spring, from an endemic population to the north. Such incursions were shown to be reliant on wind-dispersal; Culicoides midge active flight on its own was not capable of achieving known rates of southern spread, nor was re-emergence of southern populations due to overwintering larvae. Data from midge trapping programmes were used to qualitatively validate the resulting simulation model. Conclusions: The model described in this paper is intended to form the vector component of an extended model that will also include BTV transmission. A model of midge movement and population dynamics has been developed in sufficient detail such that the extended model may be used to evaluate the timing and extent of BTV outbreaks. This extended model could then be used as a platform for addressing the effectiveness of spatially targeted vaccination strategies or animal movement bans as BTV spread mitigation measures, or the impact of climate change on the risk and extent of outbreaks. These questions involving incursive Culicoides spread cannot be simply addressed with non-spatial models. [ABSTRACT FROM AUTHOR]

Long-running applications are often subject to failures. Once failures occur, it will lead to unacceptable system overheads. The checkpoint technology is used to reduce the losses in the event of a failure. For the two-level checkpoint recovery scheme used in the long-running tasks, it is unavoidable for the system to periodically transfer huge memory context to a remote stable storage. Therefore, the overheads of setting checkpoints and the re-computing time become a critical issue which directly impacts the system total overheads. Motivated by these concerns, this paper presents a new model by introducing i-checkpoints into the existing two-level checkpoint recovery scheme to deal with the more probable failures with the smaller cost and the faster speed. The proposed scheme is independent of the specific failure distribution type and can be applied to different failure distribution types. We respectively make analyses between the two-level incremental and two-level checkpoint recovery schemes with the Weibull distribution and exponential distribution, both of which fit with the actual failure distribution best. The comparison results show that the total overheads of setting checkpoints, the total re-computing time and the system total overheads in the two-level incremental checkpoint recovery scheme are all significantly smaller than those in the two-level checkpoint recovery scheme. At last, limitations of our study are discussed, and at the same time, open questions and possible future work are given. [ABSTRACT FROM AUTHOR]

The automatic detection of bilateral symmetry is a challenging task in computer vision and pattern recognition. This paper presents an approach for the detection of bilateral symmetry in digital single object images. Our method relies on the extraction of Scale Invariant Feature Transform (SIFT) based feature points, which serves as the basis for the ascertainment of the centroid of the object; the latter being the origin under the Cartesian coordinate system to be converted to the polar coordinate system in order to facilitate the selection symmetric coordinate pairs. This is followed by comparing the gradient magnitude and orientation of the corresponding points to evaluate the amount of symmetry exhibited by each pair of points. The experimental results show that our approach draw the symmetry line accurately, provided that the observed centroid point is true. [ABSTRACT FROM AUTHOR]

By aggregating self-reported health statuses across millions of users, we seek to characterize the variety of health information discussed in Twitter. We describe a topic modeling framework for discovering health topics in Twitter, a social media website. This is an exploratory approach with the goal of understanding what health topics are commonly discussed in social media. This paper describes in detail a statistical topic model created for this purpose, the Ailment Topic Aspect Model (ATAM), as well as our system for filtering general Twitter data based on health keywords and supervised classification. We show how ATAM and other topic models can automatically infer health topics in 144 million Twitter messages from 2011 to 2013. ATAM discovered 13 coherent clusters of Twitter messages, some of which correlate with seasonal influenza (r = 0.689) and allergies (r = 0.810) temporal surveillance data, as well as exercise (r = .534) and obesity (r = −.631) related geographic survey data in the United States. These results demonstrate that it is possible to automatically discover topics that attain statistically significant correlations with ground truth data, despite using minimal human supervision and no historical data to train the model, in contrast to prior work. Additionally, these results demonstrate that a single general-purpose model can identify many different health topics in social media. [ABSTRACT FROM AUTHOR]

Complex networks describe a wide range of systems in nature and society. To understand complex networks, it is crucial to investigate their community structure. In this paper, we develop an online community detection algorithm with linear time complexity for large complex networks. Our algorithm processes a network edge by edge in the order that the network is fed to the algorithm. If a new edge is added, it just updates the existing community structure in constant time, and does not need to re-compute the whole network. Therefore, it can efficiently process large networks in real time. Our algorithm optimizes expected modularity instead of modularity at each step to avoid poor performance. The experiments are carried out using 11 public data sets, and are measured by two criteria, modularity and NMI (Normalized Mutual Information). The results show that our algorithm's running time is less than the commonly used Louvain algorithm while it gives competitive performance. [ABSTRACT FROM AUTHOR]

This paper presents a novel representational framework for the Temporal Difference (TD) model of learning, which allows the computation of configural stimuli – cumulative compounds of stimuli that generate perceptual emergents known as configural cues. This Simultaneous and Serial Configural-cue Compound Stimuli Temporal Difference model (SSCC TD) can model both simultaneous and serial stimulus compounds, as well as compounds including the experimental context. This modification significantly broadens the range of phenomena which the TD paradigm can explain, and allows it to predict phenomena which traditional TD solutions cannot, particularly effects that depend on compound stimuli functioning as a whole, such as pattern learning and serial structural discriminations, and context-related effects. [ABSTRACT FROM AUTHOR]

Objective: To model the potential interaction between previously identified biomarkers in children sarcomas using artificial neural network inference (ANNI). Method: To concisely demonstrate the biological interactions between correlated genes in an interaction network map, only 2 types of sarcomas in the children small round blue cell tumors (SRBCTs) dataset are discussed in this paper. A backpropagation neural network was used to model the potential interaction between genes. The prediction weights and signal directions were used to model the strengths of the interaction signals and the direction of the interaction link between genes. The ANN model was validated using Monte Carlo cross-validation to minimize the risk of over-fitting and to optimize generalization ability of the model. Results: Strong connection links on certain genes (TNNT1 and FNDC5 in rhabdomyosarcoma (RMS); FCGRT and OLFM1 in Ewing’s sarcoma (EWS)) suggested their potency as central hubs in the interconnection of genes with different functionalities. The results showed that the RMS patients in this dataset are likely to be congenital and at low risk of cardiomyopathy development. The EWS patients are likely to be complicated by EWS-FLI fusion and deficiency in various signaling pathways, including Wnt, Fas/Rho and intracellular oxygen. Conclusions: The ANN network inference approach and the examination of identified genes in the published literature within the context of the disease highlights the substantial influence of certain genes in sarcomas. [ABSTRACT FROM AUTHOR]

The automatic clustering of chemical compounds is an important branch of chemoinformatics. In this paper the Asymmetric Clustering Index (Aci) is proposed to assess how well an automatically created partition reflects the reference. The asymmetry allows for a distinction between the fixed reference and the numerically constructed partition. The introduced index is applied to evaluate the quality of hierarchical clustering procedures for 5-HT1A receptor ligands. We find that the most appropriate combination of parameters for the hierarchical clustering of compounds with a determined activity for this biological target is the Klekota Roth fingerprint combined with the complete linkage function and the Buser similarity metric. [ABSTRACT FROM AUTHOR]

Predicting the stock market has become an increasingly interesting research area for both researchers and investors, and many prediction models have been proposed. In these models, feature selection techniques are used to pre-process the raw data and remove noise. In this paper, a prediction model is constructed to forecast stock market behavior with the aid of independent component analysis, canonical correlation analysis, and a support vector machine. First, two types of features are extracted from the historical closing prices and 39 technical variables obtained by independent component analysis. Second, a canonical correlation analysis method is utilized to combine the two types of features and extract intrinsic features to improve the performance of the prediction model. Finally, a support vector machine is applied to forecast the next day's closing price. The proposed model is applied to the Shanghai stock market index and the Dow Jones index, and experimental results show that the proposed model performs better in the area of prediction than other two similar models. [ABSTRACT FROM AUTHOR]

Transient starch in leaves is synthesized by various biosynthetic enzymes in the chloroplasts during the light period. This paper presents the first mathematical model for the (bio)synthesis of the chain-length distribution (CLD) of transient starch to aid the understanding of this synthesis. The model expresses the rate of change of the CLD in terms of the actions of the enzymes involved. Using this to simulate the experimental CLD with different enzyme combinations is a new means to test for enzymes that are significant to the rate of change of the CLD during synthesis. Comparison between the simulated CLD from different enzyme combinations and the experimental CLD in the leaves of the model plant Arabidopsis thaliana indicate α-amylase, in addition to the core starch biosynthetic enzymes, is also involved in the modification of glucans for the synthesis of insoluble starch granules. The simulations suggest involvement of β-amylase, in the absence of α-amylase in mutants, slows the rate of attaining a crystalline-competent CLD for crystallization of glucans to form insoluble starch. This suggests a minor role of β-amylase in shaping normal starch synthesis. The model simulation predicts that debranching of glucans is an efficient mechanism for the attainment of crystalline-competent CLD; however, attaining this is still possible, albeit slower, through combinations of α- and β-amylase in the absence of isoamylase-type debranching enzyme. In Arabidopsis defective in one of the isoamylase-type debranching enzymes, the impact of α-amylase in starch synthesis is reduced, while β-amylase becomes significantly involved, slowing the rate of synthesis in this mutant. Modeling of transient starch CLD brings to light previously unrecognized but significant effects of α- and β-amylase on the rate of transient starch synthesis. [ABSTRACT FROM AUTHOR]

Background: Synthesizing and characterizing aptamers with high affinity and specificity have been extensively carried out for analytical and biomedical applications. Few publications can be found that describe structure–activity relationships (SARs) of candidate aptamer sequences. Methodology: This paper reports pattern recognition with support vector machine (SVM) classification techniques for the identification of streptavidin-binding aptamers as “low” or “high” affinity aptamers. The SVM parameters C and γ were optimized using genetic algorithms. Four descriptors, the topological descriptor PW4 (path/walk 4 - Randic shape index), the connectivity index X3A (average connectivity index chi-3), the topological charge index JGI2 (mean topological charge index of order 2), and the free energy E of the secondary structure, were used to describe the structures of candidate aptamer sequences from SELEX selection (Schütze et al. (2011) PLoS ONE (12):e29604). Conclusions: The predicted fractions of winning streptavidin-binding aptamers for ten rounds of SELEX conform to the aptamer evolutionary principles of SELEX-based screening. The feasibility of applying pattern recognition based on SVM and genetic algorithms for streptavidin-binding aptamers has been demonstrated. [ABSTRACT FROM AUTHOR]