Sample records for modified simplex algorithm

  1. A Partitioning and Bounded Variable Algorithm for Linear Programming

    ERIC Educational Resources Information Center

    Sheskin, Theodore J.

    2006-01-01

    An interesting new partitioning and bounded variable algorithm (PBVA) is proposed for solving linear programming problems. The PBVA is a variant of the simplex algorithm which uses a modified form of the simplex method followed by the dual simplex method for bounded variables. In contrast to the two-phase method and the big M method, the PBVA does…

  2. Strong Tracking Spherical Simplex-Radial Cubature Kalman Filter for Maneuvering Target Tracking.

    PubMed

    Liu, Hua; Wu, Wen

    2017-03-31

    Conventional spherical simplex-radial cubature Kalman filter (SSRCKF) for maneuvering target tracking may decline in accuracy and even diverge when a target makes abrupt state changes. To overcome this problem, a novel algorithm named strong tracking spherical simplex-radial cubature Kalman filter (STSSRCKF) is proposed in this paper. The proposed algorithm uses the spherical simplex-radial (SSR) rule to obtain a higher accuracy than cubature Kalman filter (CKF) algorithm. Meanwhile, by introducing strong tracking filter (STF) into SSRCKF and modifying the predicted states' error covariance with a time-varying fading factor, the gain matrix is adjusted on line so that the robustness of the filter and the capability of dealing with uncertainty factors is improved. In this way, the proposed algorithm has the advantages of both STF's strong robustness and SSRCKF's high accuracy. Finally, a maneuvering target tracking problem with abrupt state changes is used to test the performance of the proposed filter. Simulation results show that the STSSRCKF algorithm can get better estimation accuracy and greater robustness for maneuvering target tracking.

  3. Strong Tracking Spherical Simplex-Radial Cubature Kalman Filter for Maneuvering Target Tracking

    PubMed Central

    Liu, Hua; Wu, Wen

    2017-01-01

    Conventional spherical simplex-radial cubature Kalman filter (SSRCKF) for maneuvering target tracking may decline in accuracy and even diverge when a target makes abrupt state changes. To overcome this problem, a novel algorithm named strong tracking spherical simplex-radial cubature Kalman filter (STSSRCKF) is proposed in this paper. The proposed algorithm uses the spherical simplex-radial (SSR) rule to obtain a higher accuracy than cubature Kalman filter (CKF) algorithm. Meanwhile, by introducing strong tracking filter (STF) into SSRCKF and modifying the predicted states’ error covariance with a time-varying fading factor, the gain matrix is adjusted on line so that the robustness of the filter and the capability of dealing with uncertainty factors is improved. In this way, the proposed algorithm has the advantages of both STF’s strong robustness and SSRCKF’s high accuracy. Finally, a maneuvering target tracking problem with abrupt state changes is used to test the performance of the proposed filter. Simulation results show that the STSSRCKF algorithm can get better estimation accuracy and greater robustness for maneuvering target tracking. PMID:28362347

  4. The artificial-free technique along the objective direction for the simplex algorithm

    NASA Astrophysics Data System (ADS)

    Boonperm, Aua-aree; Sinapiromsaran, Krung

    2014-03-01

    The simplex algorithm is a popular algorithm for solving linear programming problems. If the origin point satisfies all constraints then the simplex can be started. Otherwise, artificial variables will be introduced to start the simplex algorithm. If we can start the simplex algorithm without using artificial variables then the simplex iterate will require less time. In this paper, we present the artificial-free technique for the simplex algorithm by mapping the problem into the objective plane and splitting constraints into three groups. In the objective plane, one of variables which has a nonzero coefficient of the objective function is fixed in terms of another variable. Then it can split constraints into three groups: the positive coefficient group, the negative coefficient group and the zero coefficient group. Along the objective direction, some constraints from the positive coefficient group will form the optimal solution. If the positive coefficient group is nonempty, the algorithm starts with relaxing constraints from the negative coefficient group and the zero coefficient group. We guarantee the feasible region obtained from the positive coefficient group to be nonempty. The transformed problem is solved using the simplex algorithm. Additional constraints from the negative coefficient group and the zero coefficient group will be added to the solved problem and use the dual simplex method to determine the new optimal solution. An example shows the effectiveness of our algorithm.

  5. Data association approaches in bearings-only multi-target tracking

    NASA Astrophysics Data System (ADS)

    Xu, Benlian; Wang, Zhiquan

    2008-03-01

    According to requirements of time computation complexity and correctness of data association of the multi-target tracking, two algorithms are suggested in this paper. The proposed Algorithm 1 is developed from the modified version of dual Simplex method, and it has the advantage of direct and explicit form of the optimal solution. The Algorithm 2 is based on the idea of Algorithm 1 and rotational sort method, it combines not only advantages of Algorithm 1, but also reduces the computational burden, whose complexity is only 1/ N times that of Algorithm 1. Finally, numerical analyses are carried out to evaluate the performance of the two data association algorithms.

  6. Accommodation of practical constraints by a linear programming jet select. [for Space Shuttle

    NASA Technical Reports Server (NTRS)

    Bergmann, E.; Weiler, P.

    1983-01-01

    An experimental spacecraft control system will be incorporated into the Space Shuttle flight software and exercised during a forthcoming mission to evaluate its performance and handling qualities. The control system incorporates a 'phase space' control law to generate rate change requests and a linear programming jet select to compute jet firings. Posed as a linear programming problem, jet selection must represent the rate change request as a linear combination of jet acceleration vectors where the coefficients are the jet firing times, while minimizing the fuel expended in satisfying that request. This problem is solved in real time using a revised Simplex algorithm. In order to implement the jet selection algorithm in the Shuttle flight control computer, it was modified to accommodate certain practical features of the Shuttle such as limited computer throughput, lengthy firing times, and a large number of control jets. To the authors' knowledge, this is the first such application of linear programming. It was made possible by careful consideration of the jet selection problem in terms of the properties of linear programming and the Simplex algorithm. These modifications to the jet select algorithm may by useful for the design of reaction controlled spacecraft.

  7. The Shortlist Method for fast computation of the Earth Mover's Distance and finding optimal solutions to transportation problems.

    PubMed

    Gottschlich, Carsten; Schuhmacher, Dominic

    2014-01-01

    Finding solutions to the classical transportation problem is of great importance, since this optimization problem arises in many engineering and computer science applications. Especially the Earth Mover's Distance is used in a plethora of applications ranging from content-based image retrieval, shape matching, fingerprint recognition, object tracking and phishing web page detection to computing color differences in linguistics and biology. Our starting point is the well-known revised simplex algorithm, which iteratively improves a feasible solution to optimality. The Shortlist Method that we propose substantially reduces the number of candidates inspected for improving the solution, while at the same time balancing the number of pivots required. Tests on simulated benchmarks demonstrate a considerable reduction in computation time for the new method as compared to the usual revised simplex algorithm implemented with state-of-the-art initialization and pivot strategies. As a consequence, the Shortlist Method facilitates the computation of large scale transportation problems in viable time. In addition we describe a novel method for finding an initial feasible solution which we coin Modified Russell's Method.

  8. The Shortlist Method for Fast Computation of the Earth Mover's Distance and Finding Optimal Solutions to Transportation Problems

    PubMed Central

    Gottschlich, Carsten; Schuhmacher, Dominic

    2014-01-01

    Finding solutions to the classical transportation problem is of great importance, since this optimization problem arises in many engineering and computer science applications. Especially the Earth Mover's Distance is used in a plethora of applications ranging from content-based image retrieval, shape matching, fingerprint recognition, object tracking and phishing web page detection to computing color differences in linguistics and biology. Our starting point is the well-known revised simplex algorithm, which iteratively improves a feasible solution to optimality. The Shortlist Method that we propose substantially reduces the number of candidates inspected for improving the solution, while at the same time balancing the number of pivots required. Tests on simulated benchmarks demonstrate a considerable reduction in computation time for the new method as compared to the usual revised simplex algorithm implemented with state-of-the-art initialization and pivot strategies. As a consequence, the Shortlist Method facilitates the computation of large scale transportation problems in viable time. In addition we describe a novel method for finding an initial feasible solution which we coin Modified Russell's Method. PMID:25310106

  9. Interacting Multiple Model (IMM) Fifth-Degree Spherical Simplex-Radial Cubature Kalman Filter for Maneuvering Target Tracking

    PubMed Central

    Liu, Hua; Wu, Wen

    2017-01-01

    For improving the tracking accuracy and model switching speed of maneuvering target tracking in nonlinear systems, a new algorithm named the interacting multiple model fifth-degree spherical simplex-radial cubature Kalman filter (IMM5thSSRCKF) is proposed in this paper. The new algorithm is a combination of the interacting multiple model (IMM) filter and the fifth-degree spherical simplex-radial cubature Kalman filter (5thSSRCKF). The proposed algorithm makes use of Markov process to describe the switching probability among the models, and uses 5thSSRCKF to deal with the state estimation of each model. The 5thSSRCKF is an improved filter algorithm, which utilizes the fifth-degree spherical simplex-radial rule to improve the filtering accuracy. Finally, the tracking performance of the IMM5thSSRCKF is evaluated by simulation in a typical maneuvering target tracking scenario. Simulation results show that the proposed algorithm has better tracking performance and quicker model switching speed when disposing maneuver models compared with the interacting multiple model unscented Kalman filter (IMMUKF), the interacting multiple model cubature Kalman filter (IMMCKF) and the interacting multiple model fifth-degree cubature Kalman filter (IMM5thCKF). PMID:28608843

  10. Interacting Multiple Model (IMM) Fifth-Degree Spherical Simplex-Radial Cubature Kalman Filter for Maneuvering Target Tracking.

    PubMed

    Liu, Hua; Wu, Wen

    2017-06-13

    For improving the tracking accuracy and model switching speed of maneuvering target tracking in nonlinear systems, a new algorithm named the interacting multiple model fifth-degree spherical simplex-radial cubature Kalman filter (IMM5thSSRCKF) is proposed in this paper. The new algorithm is a combination of the interacting multiple model (IMM) filter and the fifth-degree spherical simplex-radial cubature Kalman filter (5thSSRCKF). The proposed algorithm makes use of Markov process to describe the switching probability among the models, and uses 5thSSRCKF to deal with the state estimation of each model. The 5thSSRCKF is an improved filter algorithm, which utilizes the fifth-degree spherical simplex-radial rule to improve the filtering accuracy. Finally, the tracking performance of the IMM5thSSRCKF is evaluated by simulation in a typical maneuvering target tracking scenario. Simulation results show that the proposed algorithm has better tracking performance and quicker model switching speed when disposing maneuver models compared with the interacting multiple model unscented Kalman filter (IMMUKF), the interacting multiple model cubature Kalman filter (IMMCKF) and the interacting multiple model fifth-degree cubature Kalman filter (IMM5thCKF).

  11. Hybridisations of Variable Neighbourhood Search and Modified Simplex Elements to Harmony Search and Shuffled Frog Leaping Algorithms for Process Optimisations

    NASA Astrophysics Data System (ADS)

    Aungkulanon, P.; Luangpaiboon, P.

    2010-10-01

    Nowadays, the engineering problem systems are large and complicated. An effective finite sequence of instructions for solving these problems can be categorised into optimisation and meta-heuristic algorithms. Though the best decision variable levels from some sets of available alternatives cannot be done, meta-heuristics is an alternative for experience-based techniques that rapidly help in problem solving, learning and discovery in the hope of obtaining a more efficient or more robust procedure. All meta-heuristics provide auxiliary procedures in terms of their own tooled box functions. It has been shown that the effectiveness of all meta-heuristics depends almost exclusively on these auxiliary functions. In fact, the auxiliary procedure from one can be implemented into other meta-heuristics. Well-known meta-heuristics of harmony search (HSA) and shuffled frog-leaping algorithms (SFLA) are compared with their hybridisations. HSA is used to produce a near optimal solution under a consideration of the perfect state of harmony of the improvisation process of musicians. A meta-heuristic of the SFLA, based on a population, is a cooperative search metaphor inspired by natural memetics. It includes elements of local search and global information exchange. This study presents solution procedures via constrained and unconstrained problems with different natures of single and multi peak surfaces including a curved ridge surface. Both meta-heuristics are modified via variable neighbourhood search method (VNSM) philosophy including a modified simplex method (MSM). The basic idea is the change of neighbourhoods during searching for a better solution. The hybridisations proceed by a descent method to a local minimum exploring then, systematically or at random, increasingly distant neighbourhoods of this local solution. The results show that the variant of HSA with VNSM and MSM seems to be better in terms of the mean and variance of design points and yields.

  12. Finding all solutions of nonlinear equations using the dual simplex method

    NASA Astrophysics Data System (ADS)

    Yamamura, Kiyotaka; Fujioka, Tsuyoshi

    2003-03-01

    Recently, an efficient algorithm has been proposed for finding all solutions of systems of nonlinear equations using linear programming. This algorithm is based on a simple test (termed the LP test) for nonexistence of a solution to a system of nonlinear equations using the dual simplex method. In this letter, an improved version of the LP test algorithm is proposed. By numerical examples, it is shown that the proposed algorithm could find all solutions of a system of 300 nonlinear equations in practical computation time.

  13. On global optimization using an estimate of Lipschitz constant and simplicial partition

    NASA Astrophysics Data System (ADS)

    Gimbutas, Albertas; Žilinskas, Antanas

    2016-10-01

    A new algorithm is proposed for finding the global minimum of a multi-variate black-box Lipschitz function with an unknown Lipschitz constant. The feasible region is initially partitioned into simplices; in the subsequent iteration, the most suitable simplices are selected and bisected via the middle point of the longest edge. The suitability of a simplex for bisection is evaluated by minimizing of a surrogate function which mimics the lower bound for the considered objective function over that simplex. The surrogate function is defined using an estimate of the Lipschitz constant and the objective function values at the vertices of a simplex. The novelty of the algorithm is the sophisticated method of estimating the Lipschitz constant, and the appropriate method to minimize the surrogate function. The proposed algorithm was tested using 600 random test problems of different complexity, showing competitive results with two popular advanced algorithms which are based on similar assumptions.

  14. An Improved Strong Tracking Cubature Kalman Filter for GPS/INS Integrated Navigation Systems.

    PubMed

    Feng, Kaiqiang; Li, Jie; Zhang, Xi; Zhang, Xiaoming; Shen, Chong; Cao, Huiliang; Yang, Yanyu; Liu, Jun

    2018-06-12

    The cubature Kalman filter (CKF) is widely used in the application of GPS/INS integrated navigation systems. However, its performance may decline in accuracy and even diverge in the presence of process uncertainties. To solve the problem, a new algorithm named improved strong tracking seventh-degree spherical simplex-radial cubature Kalman filter (IST-7thSSRCKF) is proposed in this paper. In the proposed algorithm, the effect of process uncertainty is mitigated by using the improved strong tracking Kalman filter technique, in which the hypothesis testing method is adopted to identify the process uncertainty and the prior state estimate covariance in the CKF is further modified online according to the change in vehicle dynamics. In addition, a new seventh-degree spherical simplex-radial rule is employed to further improve the estimation accuracy of the strong tracking cubature Kalman filter. In this way, the proposed comprehensive algorithm integrates the advantage of 7thSSRCKF’s high accuracy and strong tracking filter’s strong robustness against process uncertainties. The GPS/INS integrated navigation problem with significant dynamic model errors is utilized to validate the performance of proposed IST-7thSSRCKF. Results demonstrate that the improved strong tracking cubature Kalman filter can achieve higher accuracy than the existing CKF and ST-CKF, and is more robust for the GPS/INS integrated navigation system.

  15. Study on Temperature and Synthetic Compensation of Piezo-Resistive Differential Pressure Sensors by Coupled Simulated Annealing and Simplex Optimized Kernel Extreme Learning Machine

    PubMed Central

    Li, Ji; Hu, Guoqing; Zhou, Yonghong; Zou, Chong; Peng, Wei; Alam SM, Jahangir

    2017-01-01

    As a high performance-cost ratio solution for differential pressure measurement, piezo-resistive differential pressure sensors are widely used in engineering processes. However, their performance is severely affected by the environmental temperature and the static pressure applied to them. In order to modify the non-linear measuring characteristics of the piezo-resistive differential pressure sensor, compensation actions should synthetically consider these two aspects. Advantages such as nonlinear approximation capability, highly desirable generalization ability and computational efficiency make the kernel extreme learning machine (KELM) a practical approach for this critical task. Since the KELM model is intrinsically sensitive to the regularization parameter and the kernel parameter, a searching scheme combining the coupled simulated annealing (CSA) algorithm and the Nelder-Mead simplex algorithm is adopted to find an optimal KLEM parameter set. A calibration experiment at different working pressure levels was conducted within the temperature range to assess the proposed method. In comparison with other compensation models such as the back-propagation neural network (BP), radius basis neural network (RBF), particle swarm optimization optimized support vector machine (PSO-SVM), particle swarm optimization optimized least squares support vector machine (PSO-LSSVM) and extreme learning machine (ELM), the compensation results show that the presented compensation algorithm exhibits a more satisfactory performance with respect to temperature compensation and synthetic compensation problems. PMID:28422080

  16. Study on Temperature and Synthetic Compensation of Piezo-Resistive Differential Pressure Sensors by Coupled Simulated Annealing and Simplex Optimized Kernel Extreme Learning Machine.

    PubMed

    Li, Ji; Hu, Guoqing; Zhou, Yonghong; Zou, Chong; Peng, Wei; Alam Sm, Jahangir

    2017-04-19

    As a high performance-cost ratio solution for differential pressure measurement, piezo-resistive differential pressure sensors are widely used in engineering processes. However, their performance is severely affected by the environmental temperature and the static pressure applied to them. In order to modify the non-linear measuring characteristics of the piezo-resistive differential pressure sensor, compensation actions should synthetically consider these two aspects. Advantages such as nonlinear approximation capability, highly desirable generalization ability and computational efficiency make the kernel extreme learning machine (KELM) a practical approach for this critical task. Since the KELM model is intrinsically sensitive to the regularization parameter and the kernel parameter, a searching scheme combining the coupled simulated annealing (CSA) algorithm and the Nelder-Mead simplex algorithm is adopted to find an optimal KLEM parameter set. A calibration experiment at different working pressure levels was conducted within the temperature range to assess the proposed method. In comparison with other compensation models such as the back-propagation neural network (BP), radius basis neural network (RBF), particle swarm optimization optimized support vector machine (PSO-SVM), particle swarm optimization optimized least squares support vector machine (PSO-LSSVM) and extreme learning machine (ELM), the compensation results show that the presented compensation algorithm exhibits a more satisfactory performance with respect to temperature compensation and synthetic compensation problems.

  17. JPLEX: Java Simplex Implementation with Branch-and-Bound Search for Automated Test Assembly

    ERIC Educational Resources Information Center

    Park, Ryoungsun; Kim, Jiseon; Dodd, Barbara G.; Chung, Hyewon

    2011-01-01

    JPLEX, short for Java simPLEX, is an automated test assembly (ATA) program. It is a mixed integer linear programming (MILP) solver written in Java. It reads in a configuration file, solves the minimization problem, and produces an output file for postprocessing. It implements the simplex algorithm to create a fully relaxed solution and…

  18. MONSS: A multi-objective nonlinear simplex search approach

    NASA Astrophysics Data System (ADS)

    Zapotecas-Martínez, Saúl; Coello Coello, Carlos A.

    2016-01-01

    This article presents a novel methodology for dealing with continuous box-constrained multi-objective optimization problems (MOPs). The proposed algorithm adopts a nonlinear simplex search scheme in order to obtain multiple elements of the Pareto optimal set. The search is directed by a well-distributed set of weight vectors, each of which defines a scalarization problem that is solved by deforming a simplex according to the movements described by Nelder and Mead's method. Considering an MOP with n decision variables, the simplex is constructed using n+1 solutions which minimize different scalarization problems defined by n+1 neighbor weight vectors. All solutions found in the search are used to update a set of solutions considered to be the minima for each separate problem. In this way, the proposed algorithm collectively obtains multiple trade-offs among the different conflicting objectives, while maintaining a proper representation of the Pareto optimal front. In this article, it is shown that a well-designed strategy using just mathematical programming techniques can be competitive with respect to the state-of-the-art multi-objective evolutionary algorithms against which it was compared.

  19. One-Shot Learning of Human Activity With an MAP Adapted GMM and Simplex-HMM.

    PubMed

    Rodriguez, Mario; Orrite, Carlos; Medrano, Carlos; Makris, Dimitrios

    2016-05-10

    This paper presents a novel activity class representation using a single sequence for training. The contribution of this representation lays on the ability to train an one-shot learning recognition system, useful in new scenarios where capturing and labeling sequences is expensive or impractical. The method uses a universal background model of local descriptors obtained from source databases available on-line and adapts it to a new sequence in the target scenario through a maximum a posteriori adaptation. Each activity sample is encoded in a sequence of normalized bag of features and modeled by a new hidden Markov model formulation, where the expectation-maximization algorithm for training is modified to deal with observations consisting in vectors in a unit simplex. Extensive experiments in recognition have been performed using one-shot learning over the public datasets Weizmann, KTH, and IXMAS. These experiments demonstrate the discriminative properties of the representation and the validity of application in recognition systems, achieving state-of-the-art results.

  20. Multivariate Spline Algorithms for CAGD

    NASA Technical Reports Server (NTRS)

    Boehm, W.

    1985-01-01

    Two special polyhedra present themselves for the definition of B-splines: a simplex S and a box or parallelepiped B, where the edges of S project into an irregular grid, while the edges of B project into the edges of a regular grid. More general splines may be found by forming linear combinations of these B-splines, where the three-dimensional coefficients are called the spline control points. Univariate splines are simplex splines, where s = 1, whereas splines over a regular triangular grid are box splines, where s = 2. Two simple facts render the development of the construction of B-splines: (1) any face of a simplex or a box is again a simplex or box but of lower dimension; and (2) any simplex or box can be easily subdivided into smaller simplices or boxes. The first fact gives a geometric approach to Mansfield-like recursion formulas that express a B-spline in B-splines of lower order, where the coefficients depend on x. By repeated recursion, the B-spline will be expressed as B-splines of order 1; i.e., piecewise constants. In the case of a simplex spline, the second fact gives a so-called insertion algorithm that constructs the new control points if an additional knot is inserted.

  1. On efficient randomized algorithms for finding the PageRank vector

    NASA Astrophysics Data System (ADS)

    Gasnikov, A. V.; Dmitriev, D. Yu.

    2015-03-01

    Two randomized methods are considered for finding the PageRank vector; in other words, the solution of the system p T = p T P with a stochastic n × n matrix P, where n ˜ 107-109, is sought (in the class of probability distributions) with accuracy ɛ: ɛ ≫ n -1. Thus, the possibility of brute-force multiplication of P by the column is ruled out in the case of dense objects. The first method is based on the idea of Markov chain Monte Carlo algorithms. This approach is efficient when the iterative process p {/t+1 T} = p {/t T} P quickly reaches a steady state. Additionally, it takes into account another specific feature of P, namely, the nonzero off-diagonal elements of P are equal in rows (this property is used to organize a random walk over the graph with the matrix P). Based on modern concentration-of-measure inequalities, new bounds for the running time of this method are presented that take into account the specific features of P. In the second method, the search for a ranking vector is reduced to finding the equilibrium in the antagonistic matrix game where S n (1) is a unit simplex in ℝ n and I is the identity matrix. The arising problem is solved by applying a slightly modified Grigoriadis-Khachiyan algorithm (1995). This technique, like the Nazin-Polyak method (2009), is a randomized version of Nemirovski's mirror descent method. The difference is that randomization in the Grigoriadis-Khachiyan algorithm is used when the gradient is projected onto the simplex rather than when the stochastic gradient is computed. For sparse matrices P, the method proposed yields noticeably better results.

  2. Expression of Herpes Simplex Virus 1 Glycoprotein B by a Recombinant Vaccinia Virus and Protection of Mice against Lethal Herpes Simplex Virus 1 Infection

    NASA Astrophysics Data System (ADS)

    Cantin, Edouard M.; Eberle, Richard; Baldick, Joseph L.; Moss, Bernard; Willey, Dru E.; Notkins, Abner L.; Openshaw, Harry

    1987-08-01

    The herpes simplex virus 1 (HSV-1) strain F gene encoding glycoprotein gB was isolated and modified at the 5' end by in vitro oligonucleotide-directed mutagenesis. The modified gB gene was inserted into the vaccinia virus genome and expressed under the control of a vaccinia virus promoter. The mature gB glycoprotein produced by the vaccinia virus recombinant was glycosylated, was expressed at the cell surface, and was indistinguishable from authentic HSV-1 gB in terms of electrophoretic mobility. Mice immunized intradermally with the recombinant vaccinia virus produced gB-specific neutralizing antibodies and were resistant to a lethal HSV-1 challenge.

  3. Statistical simplex approach to primary and secondary color correction in thick lens assemblies

    NASA Astrophysics Data System (ADS)

    Ament, Shelby D. V.; Pfisterer, Richard

    2017-11-01

    A glass selection optimization algorithm is developed for primary and secondary color correction in thick lens systems. The approach is based on the downhill simplex method, and requires manipulation of the surface color equations to obtain a single glass-dependent parameter for each lens element. Linear correlation is used to relate this parameter to all other glass-dependent variables. The algorithm provides a statistical distribution of Abbe numbers for each element in the system. Examples of several lenses, from 2-element to 6-element systems, are performed to verify this approach. The optimization algorithm proposed is capable of finding glass solutions with high color correction without requiring an exhaustive search of the glass catalog.

  4. Parallel optimization algorithms and their implementation in VLSI design

    NASA Technical Reports Server (NTRS)

    Lee, G.; Feeley, J. J.

    1991-01-01

    Two new parallel optimization algorithms based on the simplex method are described. They may be executed by a SIMD parallel processor architecture and be implemented in VLSI design. Several VLSI design implementations are introduced. An application example is reported to demonstrate that the algorithms are effective.

  5. Automated optimization of water-water interaction parameters for a coarse-grained model.

    PubMed

    Fogarty, Joseph C; Chiu, See-Wing; Kirby, Peter; Jakobsson, Eric; Pandit, Sagar A

    2014-02-13

    We have developed an automated parameter optimization software framework (ParOpt) that implements the Nelder-Mead simplex algorithm and applied it to a coarse-grained polarizable water model. The model employs a tabulated, modified Morse potential with decoupled short- and long-range interactions incorporating four water molecules per interaction site. Polarizability is introduced by the addition of a harmonic angle term defined among three charged points within each bead. The target function for parameter optimization was based on the experimental density, surface tension, electric field permittivity, and diffusion coefficient. The model was validated by comparison of statistical quantities with experimental observation. We found very good performance of the optimization procedure and good agreement of the model with experiment.

  6. Hybrid real-code ant colony optimisation for constrained mechanical design

    NASA Astrophysics Data System (ADS)

    Pholdee, Nantiwat; Bureerat, Sujin

    2016-01-01

    This paper proposes a hybrid meta-heuristic based on integrating a local search simplex downhill (SDH) method into the search procedure of real-code ant colony optimisation (ACOR). This hybridisation leads to five hybrid algorithms where a Monte Carlo technique, a Latin hypercube sampling technique (LHS) and a translational propagation Latin hypercube design (TPLHD) algorithm are used to generate an initial population. Also, two numerical schemes for selecting an initial simplex are investigated. The original ACOR and its hybrid versions along with a variety of established meta-heuristics are implemented to solve 17 constrained test problems where a fuzzy set theory penalty function technique is used to handle design constraints. The comparative results show that the hybrid algorithms are the top performers. Using the TPLHD technique gives better results than the other sampling techniques. The hybrid optimisers are a powerful design tool for constrained mechanical design problems.

  7. A fast optimization algorithm for multicriteria intensity modulated proton therapy planning.

    PubMed

    Chen, Wei; Craft, David; Madden, Thomas M; Zhang, Kewu; Kooy, Hanne M; Herman, Gabor T

    2010-09-01

    To describe a fast projection algorithm for optimizing intensity modulated proton therapy (IMPT) plans and to describe and demonstrate the use of this algorithm in multicriteria IMPT planning. The authors develop a projection-based solver for a class of convex optimization problems and apply it to IMPT treatment planning. The speed of the solver permits its use in multicriteria optimization, where several optimizations are performed which span the space of possible treatment plans. The authors describe a plan database generation procedure which is customized to the requirements of the solver. The optimality precision of the solver can be specified by the user. The authors apply the algorithm to three clinical cases: A pancreas case, an esophagus case, and a tumor along the rib cage case. Detailed analysis of the pancreas case shows that the algorithm is orders of magnitude faster than industry-standard general purpose algorithms (MOSEK'S interior point optimizer, primal simplex optimizer, and dual simplex optimizer). Additionally, the projection solver has almost no memory overhead. The speed and guaranteed accuracy of the algorithm make it suitable for use in multicriteria treatment planning, which requires the computation of several diverse treatment plans. Additionally, given the low memory overhead of the algorithm, the method can be extended to include multiple geometric instances and proton range possibilities, for robust optimization.

  8. Design and optimization of color lookup tables on a simplex topology.

    PubMed

    Monga, Vishal; Bala, Raja; Mo, Xuan

    2012-04-01

    An important computational problem in color imaging is the design of color transforms that map color between devices or from a device-dependent space (e.g., RGB/CMYK) to a device-independent space (e.g., CIELAB) and vice versa. Real-time processing constraints entail that such nonlinear color transforms be implemented using multidimensional lookup tables (LUTs). Furthermore, relatively sparse LUTs (with efficient interpolation) are employed in practice because of storage and memory constraints. This paper presents a principled design methodology rooted in constrained convex optimization to design color LUTs on a simplex topology. The use of n simplexes, i.e., simplexes in n dimensions, as opposed to traditional lattices, recently has been of great interest in color LUT design for simplex topologies that allow both more analytically tractable formulations and greater efficiency in the LUT. In this framework of n-simplex interpolation, our central contribution is to develop an elegant iterative algorithm that jointly optimizes the placement of nodes of the color LUT and the output values at those nodes to minimize interpolation error in an expected sense. This is in contrast to existing work, which exclusively designs either node locations or the output values. We also develop new analytical results for the problem of node location optimization, which reduces to constrained optimization of a large but sparse interpolation matrix in our framework. We evaluate our n -simplex color LUTs against the state-of-the-art lattice (e.g., International Color Consortium profiles) and simplex-based techniques for approximating two representative multidimensional color transforms that characterize a CMYK xerographic printer and an RGB scanner, respectively. The results show that color LUTs designed on simplexes offer very significant benefits over traditional lattice-based alternatives in improving color transform accuracy even with a much smaller number of nodes.

  9. A Composite Algorithm for Mixed Integer Constrained Nonlinear Optimization.

    DTIC Science & Technology

    1980-01-01

    de Silva [141, and Weisman and Wood [76). A particular direct search algorithm, the simplex method, has been cited for having the potential for...spaced discrete points on a line which makes the direction suitable for an efficient integer search technique based on Fibonacci numbers. Two...defined by a subset of variables. The complex algorithm is particularly well suited for this subspace search for two reasons. First, the complex method

  10. Physically Based Modeling and Simulation with Dynamic Spherical Volumetric Simplex Splines

    PubMed Central

    Tan, Yunhao; Hua, Jing; Qin, Hong

    2009-01-01

    In this paper, we present a novel computational modeling and simulation framework based on dynamic spherical volumetric simplex splines. The framework can handle the modeling and simulation of genus-zero objects with real physical properties. In this framework, we first develop an accurate and efficient algorithm to reconstruct the high-fidelity digital model of a real-world object with spherical volumetric simplex splines which can represent with accuracy geometric, material, and other properties of the object simultaneously. With the tight coupling of Lagrangian mechanics, the dynamic volumetric simplex splines representing the object can accurately simulate its physical behavior because it can unify the geometric and material properties in the simulation. The visualization can be directly computed from the object’s geometric or physical representation based on the dynamic spherical volumetric simplex splines during simulation without interpolation or resampling. We have applied the framework for biomechanic simulation of brain deformations, such as brain shifting during the surgery and brain injury under blunt impact. We have compared our simulation results with the ground truth obtained through intra-operative magnetic resonance imaging and the real biomechanic experiments. The evaluations demonstrate the excellent performance of our new technique. PMID:20161636

  11. Development of a Compound Optimization Approach Based on Imperialist Competitive Algorithm

    NASA Astrophysics Data System (ADS)

    Wang, Qimei; Yang, Zhihong; Wang, Yong

    In this paper, an improved novel approach is developed for the imperialist competitive algorithm to achieve a greater performance. The Nelder-Meand simplex method is applied to execute alternately with the original procedures of the algorithm. The approach is tested on twelve widely-used benchmark functions and is also compared with other relative studies. It is shown that the proposed approach has a faster convergence rate, better search ability, and higher stability than the original algorithm and other relative methods.

  12. A fast fully constrained geometric unmixing of hyperspectral images

    NASA Astrophysics Data System (ADS)

    Zhou, Xin; Li, Xiao-run; Cui, Jian-tao; Zhao, Liao-ying; Zheng, Jun-peng

    2014-11-01

    A great challenge in hyperspectral image analysis is decomposing a mixed pixel into a collection of endmembers and their corresponding abundance fractions. This paper presents an improved implementation of Barycentric Coordinate approach to unmix hyperspectral images, integrating with the Most-Negative Remove Projection method to meet the abundance sum-to-one constraint (ASC) and abundance non-negativity constraint (ANC). The original barycentric coordinate approach interprets the endmember unmixing problem as a simplex volume ratio problem, which is solved by calculate the determinants of two augmented matrix. One consists of all the members and the other consist of the to-be-unmixed pixel and all the endmembers except for the one corresponding to the specific abundance that is to be estimated. In this paper, we first modified the algorithm of Barycentric Coordinate approach by bringing in the Matrix Determinant Lemma to simplify the unmixing process, which makes the calculation only contains linear matrix and vector operations. So, the matrix determinant calculation of every pixel, as the original algorithm did, is avoided. By the end of this step, the estimated abundance meet the ASC constraint. Then, the Most-Negative Remove Projection method is used to make the abundance fractions meet the full constraints. This algorithm is demonstrated both on synthetic and real images. The resulting algorithm yields the abundance maps that are similar to those obtained by FCLS, while the runtime is outperformed as its computational simplicity.

  13. A method of minimum volume simplex analysis constrained unmixing for hyperspectral image

    NASA Astrophysics Data System (ADS)

    Zou, Jinlin; Lan, Jinhui; Zeng, Yiliang; Wu, Hongtao

    2017-07-01

    The signal recorded by a low resolution hyperspectral remote sensor from a given pixel, letting alone the effects of the complex terrain, is a mixture of substances. To improve the accuracy of classification and sub-pixel object detection, hyperspectral unmixing(HU) is a frontier-line in remote sensing area. Unmixing algorithm based on geometric has become popular since the hyperspectral image possesses abundant spectral information and the mixed model is easy to understand. However, most of the algorithms are based on pure pixel assumption, and since the non-linear mixed model is complex, it is hard to obtain the optimal endmembers especially under a highly mixed spectral data. To provide a simple but accurate method, we propose a minimum volume simplex analysis constrained (MVSAC) unmixing algorithm. The proposed approach combines the algebraic constraints that are inherent to the convex minimum volume with abundance soft constraint. While considering abundance fraction, we can obtain the pure endmember set and abundance fraction correspondingly, and the final unmixing result is closer to reality and has better accuracy. We illustrate the performance of the proposed algorithm in unmixing simulated data and real hyperspectral data, and the result indicates that the proposed method can obtain the distinct signatures correctly without redundant endmember and yields much better performance than the pure pixel based algorithm.

  14. Optimization Methods in Sherpa

    NASA Astrophysics Data System (ADS)

    Siemiginowska, Aneta; Nguyen, Dan T.; Doe, Stephen M.; Refsdal, Brian L.

    2009-09-01

    Forward fitting is a standard technique used to model X-ray data. A statistic, usually assumed weighted chi^2 or Poisson likelihood (e.g. Cash), is minimized in the fitting process to obtain a set of the best model parameters. Astronomical models often have complex forms with many parameters that can be correlated (e.g. an absorbed power law). Minimization is not trivial in such setting, as the statistical parameter space becomes multimodal and finding the global minimum is hard. Standard minimization algorithms can be found in many libraries of scientific functions, but they are usually focused on specific functions. However, Sherpa designed as general fitting and modeling application requires very robust optimization methods that can be applied to variety of astronomical data (X-ray spectra, images, timing, optical data etc.). We developed several optimization algorithms in Sherpa targeting a wide range of minimization problems. Two local minimization methods were built: Levenberg-Marquardt algorithm was obtained from MINPACK subroutine LMDIF and modified to achieve the required robustness; and Nelder-Mead simplex method has been implemented in-house based on variations of the algorithm described in the literature. A global search Monte-Carlo method has been implemented following a differential evolution algorithm presented by Storn and Price (1997). We will present the methods in Sherpa and discuss their usage cases. We will focus on the application to Chandra data showing both 1D and 2D examples. This work is supported by NASA contract NAS8-03060 (CXC).

  15. A tutorial description of an interior point method and its applications to security-constrained economic dispatch

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Vargas, L.S.; Quintana, V.H.; Vannelli, A.

    This paper deals with the use of Successive Linear Programming (SLP) for the solution of the Security-Constrained Economic Dispatch (SCED) problem. The authors tutorially describe an Interior Point Method (IPM) for the solution of Linear Programming (LP) problems, discussing important implementation issues that really make this method far superior to the simplex method. A study of the convergence of the SLP technique and a practical criterion to avoid oscillatory behavior in the iteration process are also proposed. A comparison of the proposed method with an efficient simplex code (MINOS) is carried out by solving SCED problems on two standard IEEEmore » systems. The results show that the interior point technique is reliable, accurate and more than two times faster than the simplex algorithm.« less

  16. Fractal Landscape Algorithms for Environmental Simulations

    NASA Astrophysics Data System (ADS)

    Mao, H.; Moran, S.

    2014-12-01

    Natural science and geographical research are now able to take advantage of environmental simulations that more accurately test experimental hypotheses, resulting in deeper understanding. Experiments affected by the natural environment can benefit from 3D landscape simulations capable of simulating a variety of terrains and environmental phenomena. Such simulations can employ random terrain generation algorithms that dynamically simulate environments to test specific models against a variety of factors. Through the use of noise functions such as Perlin noise, Simplex noise, and diamond square algorithms, computers can generate simulations that model a variety of landscapes and ecosystems. This study shows how these algorithms work together to create realistic landscapes. By seeding values into the diamond square algorithm, one can control the shape of landscape. Perlin noise and Simplex noise are also used to simulate moisture and temperature. The smooth gradient created by coherent noise allows more realistic landscapes to be simulated. Terrain generation algorithms can be used in environmental studies and physics simulations. Potential studies that would benefit from simulations include the geophysical impact of flash floods or drought on a particular region and regional impacts on low lying area due to global warming and rising sea levels. Furthermore, terrain generation algorithms also serve as aesthetic tools to display landscapes (Google Earth), and simulate planetary landscapes. Hence, it can be used as a tool to assist science education. Algorithms used to generate these natural phenomena provide scientists a different approach in analyzing our world. The random algorithms used in terrain generation not only contribute to the generating the terrains themselves, but are also capable of simulating weather patterns.

  17. [Conversion of 17 alpha-methyltestosterone to methandrostenolone by the bacterium Pimelobacter simplex VKPM Ac-1632 with the presence of cyclodextrins].

    PubMed

    Druzhinina, A V; Andriushina, V A; Stytsenko, T S; Voĭshvillo, N E

    2008-01-01

    Conditions of conversion of 17 alpha-methyltestosterone to methandrostenolone with the presence of modified beta-cyclodextrins (methylcyclodextrin, hydroxypropylcyclodextrin, and hydroxyethylcyclodextrin) in the steroid:cyclodextrin ratio 1:1 were studied. The experimental solutions of modified beta-cyclodextrins were prepared in deionized water with 5-7% methanol. Under the conditions found to be optimal, 1,2-dehydrogenation of 17 alpha-methyltestosterone was carried out with 2-4 g/l Pimelobacter simplex VKPM Ac-1632 biomass. At the substrate concentration 5-20 g/l, the reaction occurred for 1-15 h without any by-products. The maximum rate of methandrostenolone accumulation was observed with hydroxypropylcyclodextrin. The methylcyclodextrin solution can be reused for complete 17 alpha-methyltestosterone conversion at the concentration 5 g/l.

  18. SMV⊥: Simplex of maximal volume based upon the Gram-Schmidt process

    NASA Astrophysics Data System (ADS)

    Salazar-Vazquez, Jairo; Mendez-Vazquez, Andres

    2015-10-01

    In recent years, different algorithms for Hyperspectral Image (HI) analysis have been introduced. The high spectral resolution of these images allows to develop different algorithms for target detection, material mapping, and material identification for applications in Agriculture, Security and Defense, Industry, etc. Therefore, from the computer science's point of view, there is fertile field of research for improving and developing algorithms in HI analysis. In some applications, the spectral pixels of a HI can be classified using laboratory spectral signatures. Nevertheless, for many others, there is no enough available prior information or spectral signatures, making any analysis a difficult task. One of the most popular algorithms for the HI analysis is the N-FINDR because it is easy to understand and provides a way to unmix the original HI in the respective material compositions. The N-FINDR is computationally expensive and its performance depends on a random initialization process. This paper proposes a novel idea to reduce the complexity of the N-FINDR by implementing a bottom-up approach based in an observation from linear algebra and the use of the Gram-Schmidt process. Therefore, the Simplex of Maximal Volume Perpendicular (SMV⊥) algorithm is proposed for fast endmember extraction in hyperspectral imagery. This novel algorithm has complexity O(n) with respect to the number of pixels. In addition, the evidence shows that SMV⊥ calculates a bigger volume, and has lower computational time complexity than other poular algorithms on synthetic and real scenarios.

  19. Interpolation Hermite Polynomials For Finite Element Method

    NASA Astrophysics Data System (ADS)

    Gusev, Alexander; Vinitsky, Sergue; Chuluunbaatar, Ochbadrakh; Chuluunbaatar, Galmandakh; Gerdt, Vladimir; Derbov, Vladimir; Góźdź, Andrzej; Krassovitskiy, Pavel

    2018-02-01

    We describe a new algorithm for analytic calculation of high-order Hermite interpolation polynomials of the simplex and give their classification. A typical example of triangle element, to be built in high accuracy finite element schemes, is given.

  20. Simplex optimization of the variables influencing the determination of pefloxacin by time-resolved chemiluminescence

    NASA Astrophysics Data System (ADS)

    Murillo Pulgarín, José A.; Alañón Molina, Aurelia; Jiménez García, Elisa

    2018-03-01

    A new chemiluminescence (CL) detection system combined with flow injection analysis (FIA) for the determination of Pefloxacin is proposed. The determination is based on an energy transfer from Pefloxacin to terbium (III). The metal ion enhances the weak CL signal produced by the KMnO4/H2SO3/Pefloxacin system. A modified simplex method was used to optimize chemical and instrumental variables. The influence of the interaction of the permanganate, Tb (III), sodium sulphite and sulphuric acid concentrations, flow rate and injected sample volume was thoroughly investigated by using a modified simplex optimization procedure. The results revealed a strong direct relationship between flow rate and CL intensity throughout the studied range that was confirmed by a gamma test. The response factor for the CL emission intensity was used to assess performance in order to identify the optimum conditions for maximization of the response. Under such conditions, the CL response was proportional to the Pefloxacin concentration over a wide range. The detection limit as calculated according to Clayton's criterion 13.7 μg L- 1. The analyte was successfully determined in milk samples with an average recovery of 100.6 ± 9.8%.

  1. Utilization of a modified special-cubic design and an electronic tongue for bitterness masking formulation optimization.

    PubMed

    Li, Lianli; Naini, Venkatesh; Ahmed, Salah U

    2007-10-01

    A unique modification of simplex design was applied to an electronic tongue (E-Tongue) analysis in bitterness masking formulation optimization. Three formulation variables were evaluated in the simplex design, i.e. concentrations of two taste masking polymers, Amberlite and Carbopol, and pH of the granulating fluid. Response of the design was a bitterness distance measured using an E-Tongue by applying a principle component analysis, which represents taste masking efficiency of the formulation. The smaller the distance, the better the bitterness masking effect. Contour plots and polynomial equations of the bitterness distance response were generated as a function of formulation composition and pH. It was found that interactions between polymer and pH reduced the bitterness of the formulation, attributed to pH-dependent ionization and complexation properties of the ionic polymers, thus keeping the drug out of solution and unavailable to bitterness perception. At pH 4.9 and an Amberlite/Carbopol ratio of 1.4:1 (w/w), the optimal taste masking formulation was achieved and in agreement with human gustatory sensation study results. Therefore, adopting a modified simplex experimental design on response measured using an E-Tongue provided an efficient approach to taste masking formulation optimization using ionic binding polymers. (c) 2007 Wiley-Liss, Inc.

  2. Simplex and duplex event-specific analytical methods for functional biotech maize.

    PubMed

    Lee, Seong-Hun; Kim, Su-Jeong; Yi, Bu-Young

    2009-08-26

    Analytical methods are very important in the control of genetically modified organism (GMO) labeling systems or living modified organism (LMO) management for biotech crops. Event-specific primers and probes were developed for qualitative and quantitative analysis for biotech maize event 3272 and LY 038 on the basis of the 3' flanking regions, respectively. The qualitative primers confirmed the specificity by a single PCR product and sensitivity to 0.05% as a limit of detection (LOD). Simplex and duplex quantitative methods were also developed using TaqMan real-time PCR. One synthetic plasmid was constructed from two taxon-specific DNA sequences of maize and two event-specific 3' flanking DNA sequences of event 3272 and LY 038 as reference molecules. In-house validation of the quantitative methods was performed using six levels of mixing samples, from 0.1 to 10.0%. As a result, the biases from the true value and the relative deviations were all within the range of +/-30%. Limits of quantitation (LOQs) of the quantitative methods were all 0.1% for simplex real-time PCRs of event 3272 and LY 038 and 0.5% for duplex real-time PCR of LY 038. This study reports that event-specific analytical methods were applicable for qualitative and quantitative analysis for biotech maize event 3272 and LY 038.

  3. Geometric convex cone volume analysis

    NASA Astrophysics Data System (ADS)

    Li, Hsiao-Chi; Chang, Chein-I.

    2016-05-01

    Convexity is a major concept used to design and develop endmember finding algorithms (EFAs). For abundance unconstrained techniques, Pixel Purity Index (PPI) and Automatic Target Generation Process (ATGP) which use Orthogonal Projection (OP) as a criterion, are commonly used method. For abundance partially constrained techniques, Convex Cone Analysis is generally preferred which makes use of convex cones to impose Abundance Non-negativity Constraint (ANC). For abundance fully constrained N-FINDR and Simplex Growing Algorithm (SGA) are most popular methods which use simplex volume as a criterion to impose ANC and Abundance Sum-to-one Constraint (ASC). This paper analyze an issue encountered in volume calculation with a hyperplane introduced to illustrate an idea of bounded convex cone. Geometric Convex Cone Volume Analysis (GCCVA) projects the boundary vectors of a convex cone orthogonally on a hyperplane to reduce the effect of background signatures and a geometric volume approach is applied to address the issue arose from calculating volume and further improve the performance of convex cone-based EFAs.

  4. LP and NLP decomposition without a master problem

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Fuller, D.; Lan, B.

    We describe a new algorithm for decomposition of linear programs and a class of convex nonlinear programs, together with theoretical properties and some test results. Its most striking feature is the absence of a master problem; the subproblems pass primal and dual proposals directly to one another. The algorithm is defined for multi-stage LPs or NLPs, in which the constraints link the current stage`s variables to earlier stages` variables. This problem class is general enough to include many problem structures that do not immediately suggest stages, such as block diagonal problems. The basic algorithmis derived for two-stage problems and extendedmore » to more than two stages through nested decomposition. The main theoretical result assures convergence, to within any preset tolerance of the optimal value, in a finite number of iterations. This asymptotic convergence result contrasts with the results of limited tests on LPs, in which the optimal solution is apparently found exactly, i.e., to machine accuracy, in a small number of iterations. The tests further suggest that for LPs, the new algorithm is faster than the simplex method applied to the whole problem, as long as the stages are linked loosely; that the speedup over the simpex method improves as the number of stages increases; and that the algorithm is more reliable than nested Dantzig-Wolfe or Benders` methods in its improvement over the simplex method.« less

  5. Antigenicity and viability of Anisakis larvae infesting hake heated at different time-temperature conditions.

    PubMed

    Vidacek, Sanja; de las Heras, Cristina; Solas, Maria Teresa; Mendizábal, Angel; Rodriguez-Mahillo, Ana I; Tejada, Margarita

    2010-01-01

    Heat treatments (40 to 94 degrees Celsius, 30 s to 60 min) were applied to different batches of Anisakis simplex L3 larvae isolated from hake ovaries and viscera to study the effect of heat on the viability of the larvae measured as mobility, emission of fluorescence under UV light, and changes in color after staining with specific dyes, and on A. simplex antigenic proteins. The aim was to determine the lowest time-temperature conditions needed to kill the larvae to avoid anisakiasis in consumers, and to evaluate whether high temperature modifies the antigenicity of A. simplex extracts. Heating at 60 degrees Celsius for 10 min (recommended by some authors) was considered unsafe, as differences in viability between batches were found, with some larvae presenting spontaneous movements in one batch. At higher temperatures (> or = 70 degrees Celsius for > or = 1 min), no movement of the larvae was observed. Antigenic protein Ani s 4 and A. simplex crude antigens were detected in the larvae heated at 94 + or - 1 degrees Celsius for 3 min. This indicates that allergic symptoms could be provoked in previously sensitized consumers, even if the larvae were killed by heat treatment.

  6. Proposal of Evolutionary Simplex Method for Global Optimization Problem

    NASA Astrophysics Data System (ADS)

    Shimizu, Yoshiaki

    To make an agile decision in a rational manner, role of optimization engineering has been notified increasingly under diversified customer demand. With this point of view, in this paper, we have proposed a new evolutionary method serving as an optimization technique in the paradigm of optimization engineering. The developed method has prospects to solve globally various complicated problem appearing in real world applications. It is evolved from the conventional method known as Nelder and Mead’s Simplex method by virtue of idea borrowed from recent meta-heuristic method such as PSO. Mentioning an algorithm to handle linear inequality constraints effectively, we have validated effectiveness of the proposed method through comparison with other methods using several benchmark problems.

  7. Context Dependent Spectral Unmixing

    DTIC Science & Technology

    2014-08-01

    the tar- get sizes). The targets were made of 100% cotton fabric and were emplaced so that there would be representatives of each color type completely...method for simplex-based endmember extraction algorithm,” IEEE Transactions on Geoscience and Re- mote Sensing, vol. 44, no. 10, pp. 2804–2819, 2006. [68

  8. The CORSAIR Turbomachinery Code: Status and Plans

    NASA Technical Reports Server (NTRS)

    Dorney, Daniel J.; Sondak, Douglas L.; Turner, James (Technical Monitor)

    2002-01-01

    This viewgraph presentation gives an overview of the CORSAIR turbomachinery code's status and plans. Details are provided on the CORSAIR algorithms, full- and partial-admission turbine simulations, the Simplex turbine, instantaneous Mach number, unsteady pressure admission graphs, variable fluid property RLV-133 simulations, instantaneous entropy function, pumps and inducers, and future plans.

  9. 3D Radiative Transfer in Eta Carinae: Application of the SimpleX Algorithm to 3D SPH Simulations of Binary Colliding Winds

    NASA Technical Reports Server (NTRS)

    Clementel, N.; Madura, T. I.; Kruip, C. J. H.; Icke, V.; Gull, T. R.

    2014-01-01

    Eta Carinae is an ideal astrophysical laboratory for studying massive binary interactions and evolution, and stellar wind-wind collisions. Recent three-dimensional (3D) simulations set the stage for understanding the highly complex 3D flows in Eta Car. Observations of different broad high- and low-ionization forbidden emission lines provide an excellent tool to constrain the orientation of the system, the primary's mass-loss rate, and the ionizing flux of the hot secondary. In this work we present the first steps towards generating synthetic observations to compare with available and future HST/STIS data. We present initial results from full 3D radiative transfer simulations of the interacting winds in Eta Car. We use the SimpleX algorithm to post-process the output from 3D SPH simulations and obtain the ionization fractions of hydrogen and helium assuming three different mass-loss rates for the primary star. The resultant ionization maps of both species constrain the regions where the observed forbidden emission lines can form. Including collisional ionization is necessary to achieve a better description of the ionization states, especially in the areas shielded from the secondary's radiation. We find that reducing the primary's mass-loss rate increases the volume of ionized gas, creating larger areas where the forbidden emission lines can form. We conclude that post processing 3D SPH data with SimpleX is a viable tool to create ionization maps for Eta Car.

  10. 3D Radiative Transfer in Eta Carinae: Application of the SimpleX Algorithm to 3D SPH Simulations of Binary Colliding Winds

    NASA Technical Reports Server (NTRS)

    Clementel, N.; Madura, T. I.; Kruip, C.J.H.; Icke, V.; Gull, T. R.

    2014-01-01

    Eta Carinae is an ideal astrophysical laboratory for studying massive binary interactions and evolution, and stellar wind-wind collisions. Recent three-dimensional (3D) simulations set the stage for understanding the highly complex 3D flows in eta Car. Observations of different broad high- and low-ionization forbidden emission lines provide an excellent tool to constrain the orientation of the system, the primary's mass-loss rate, and the ionizing flux of the hot secondary. In this work we present the first steps towards generating synthetic observations to compare with available and future HST/STIS data. We present initial results from full 3D radiative transfer simulations of the interacting winds in eta Car.We use the SimpleX algorithm to post-process the output from 3D SPH simulations and obtain the ionization fractions of hydrogen and helium assuming three different mass-loss rates for the primary star. The resultant ionization maps of both species constrain the regions where the observed forbidden emission lines can form. Including collisional ionization is necessary to achieve a better description of the ionization states, especially in the areas shielded from the secondary's radiation. We find that reducing the primary's mass-loss rate increases the volume of ionized gas, creating larger areas where the forbidden emission lines can form.We conclude that post processing 3D SPH data with SimpleX is a viable tool to create ionization maps for eta Car.

  11. Optimization of cutting parameters for machining time in turning process

    NASA Astrophysics Data System (ADS)

    Mavliutov, A. R.; Zlotnikov, E. G.

    2018-03-01

    This paper describes the most effective methods for nonlinear constraint optimization of cutting parameters in the turning process. Among them are Linearization Programming Method with Dual-Simplex algorithm, Interior Point method, and Augmented Lagrangian Genetic Algorithm (ALGA). Every each of them is tested on an actual example – the minimization of production rate in turning process. The computation was conducted in the MATLAB environment. The comparative results obtained from the application of these methods show: The optimal value of the linearized objective and the original function are the same. ALGA gives sufficiently accurate values, however, when the algorithm uses the Hybrid function with Interior Point algorithm, the resulted values have the maximal accuracy.

  12. Multi-dimensional Fokker-Planck equation analysis using the modified finite element method

    NASA Astrophysics Data System (ADS)

    Náprstek, J.; Král, R.

    2016-09-01

    The Fokker-Planck equation (FPE) is a frequently used tool for the solution of cross probability density function (PDF) of a dynamic system response excited by a vector of random processes. FEM represents a very effective solution possibility, particularly when transition processes are investigated or a more detailed solution is needed. Actual papers deal with single degree of freedom (SDOF) systems only. So the respective FPE includes two independent space variables only. Stepping over this limit into MDOF systems a number of specific problems related to a true multi-dimensionality must be overcome. Unlike earlier studies, multi-dimensional simplex elements in any arbitrary dimension should be deployed and rectangular (multi-brick) elements abandoned. Simple closed formulae of integration in multi-dimension domain have been derived. Another specific problem represents the generation of multi-dimensional finite element mesh. Assembling of system global matrices should be subjected to newly composed algorithms due to multi-dimensionality. The system matrices are quite full and no advantages following from their sparse character can be profited from, as is commonly used in conventional FEM applications in 2D/3D problems. After verification of partial algorithms, an illustrative example dealing with a 2DOF non-linear aeroelastic system in combination with random and deterministic excitations is discussed.

  13. Guided particle swarm optimization method to solve general nonlinear optimization problems

    NASA Astrophysics Data System (ADS)

    Abdelhalim, Alyaa; Nakata, Kazuhide; El-Alem, Mahmoud; Eltawil, Amr

    2018-04-01

    The development of hybrid algorithms is becoming an important topic in the global optimization research area. This article proposes a new technique in hybridizing the particle swarm optimization (PSO) algorithm and the Nelder-Mead (NM) simplex search algorithm to solve general nonlinear unconstrained optimization problems. Unlike traditional hybrid methods, the proposed method hybridizes the NM algorithm inside the PSO to improve the velocities and positions of the particles iteratively. The new hybridization considers the PSO algorithm and NM algorithm as one heuristic, not in a sequential or hierarchical manner. The NM algorithm is applied to improve the initial random solution of the PSO algorithm and iteratively in every step to improve the overall performance of the method. The performance of the proposed method was tested over 20 optimization test functions with varying dimensions. Comprehensive comparisons with other methods in the literature indicate that the proposed solution method is promising and competitive.

  14. Design Optimization of Space Launch Vehicles Using a Genetic Algorithm

    DTIC Science & Technology

    2007-06-01

    function until no improvement in the objective function could be made. The search space is modeled in a geometric form such as a polyhedron . The simplex... database . AeroDesign assumes that there are no boundary layers and that no separation occurs. AeroDesign can analyze either a cone or ogive shape

  15. Modified Gaussian influence function of deformable mirror actuators.

    PubMed

    Huang, Linhai; Rao, Changhui; Jiang, Wenhan

    2008-01-07

    A new deformable mirror influence function based on a Gaussian function is introduced to analyze the fitting capability of a deformable mirror. The modified expressions for both azimuthal and radial directions are presented based on the analysis of the residual error between a measured influence function and a Gaussian influence function. With a simplex search method, we further compare the fitting capability of our proposed influence function to fit the data produced by a Zygo interferometer with that of a Gaussian influence function. The result indicates that the modified Gaussian influence function provides much better performance in data fitting.

  16. An exact algorithm for optimal MAE stack filter design.

    PubMed

    Dellamonica, Domingos; Silva, Paulo J S; Humes, Carlos; Hirata, Nina S T; Barrera, Junior

    2007-02-01

    We propose a new algorithm for optimal MAE stack filter design. It is based on three main ingredients. First, we show that the dual of the integer programming formulation of the filter design problem is a minimum cost network flow problem. Next, we present a decomposition principle that can be used to break this dual problem into smaller subproblems. Finally, we propose a specialization of the network Simplex algorithm based on column generation to solve these smaller subproblems. Using our method, we were able to efficiently solve instances of the filter problem with window size up to 25 pixels. To the best of our knowledge, this is the largest dimension for which this problem was ever solved exactly.

  17. Kinetic and dynamic Delaunay tetrahedralizations in three dimensions

    NASA Astrophysics Data System (ADS)

    Schaller, Gernot; Meyer-Hermann, Michael

    2004-09-01

    We describe algorithms to implement fully dynamic and kinetic three-dimensional unconstrained Delaunay triangulations, where the time evolution of the triangulation is not only governed by moving vertices but also by a changing number of vertices. We use three-dimensional simplex flip algorithms, a stochastic visibility walk algorithm for point location and in addition, we propose a new simple method of deleting vertices from an existing three-dimensional Delaunay triangulation while maintaining the Delaunay property. As an example, we analyse the performance in various cases of practical relevance. The dual Dirichlet tessellation can be used to solve differential equations on an irregular grid, to define partitions in cell tissue simulations, for collision detection etc.

  18. A fast rigid-registration method of inferior limb X-ray image and 3D CT images for TKA surgery

    NASA Astrophysics Data System (ADS)

    Ito, Fumihito; O. D. A, Prima; Uwano, Ikuko; Ito, Kenzo

    2010-03-01

    In this paper, we propose a fast rigid-registration method of inferior limb X-ray films (two-dimensional Computed Radiography (CR) images) and three-dimensional Computed Tomography (CT) images for Total Knee Arthroplasty (TKA) surgery planning. The position of the each bone, such as femur and tibia (shin bone), in X-ray film and 3D CT images is slightly different, and we must pay attention how to use the two different images, since X-ray film image is captured in the standing position, and 3D CT is captured in decubitus (face up) position, respectively. Though the conventional registration mainly uses cross-correlation function between two images,and utilizes optimization techniques, it takes enormous calculation time and it is difficult to use it in interactive operations. In order to solve these problems, we calculate the center line (bone axis) of femur and tibia (shin bone) automatically, and we use them as initial positions for the registration. We evaluate our registration method by using three patient's image data, and we compare our proposed method and a conventional registration, which uses down-hill simplex algorithm. The down-hill simplex method is an optimization algorithm that requires only function evaluations, and doesn't need the calculation of derivatives. Our registration method is more effective than the downhill simplex method in computational time and the stable convergence. We have developed the implant simulation system on a personal computer, in order to support the surgeon in a preoperative planning of TKA. Our registration method is implemented in the simulation system, and user can manipulate 2D/3D translucent templates of implant components on X-ray film and 3D CT images.

  19. Automated real-time search and analysis algorithms for a non-contact 3D profiling system

    NASA Astrophysics Data System (ADS)

    Haynes, Mark; Wu, Chih-Hang John; Beck, B. Terry; Peterman, Robert J.

    2013-04-01

    The purpose of this research is to develop a new means of identifying and extracting geometrical feature statistics from a non-contact precision-measurement 3D profilometer. Autonomous algorithms have been developed to search through large-scale Cartesian point clouds to identify and extract geometrical features. These algorithms are developed with the intent of providing real-time production quality control of cold-rolled steel wires. The steel wires in question are prestressing steel reinforcement wires for concrete members. The geometry of the wire is critical in the performance of the overall concrete structure. For this research a custom 3D non-contact profilometry system has been developed that utilizes laser displacement sensors for submicron resolution surface profiling. Optimizations in the control and sensory system allow for data points to be collected at up to an approximate 400,000 points per second. In order to achieve geometrical feature extraction and tolerancing with this large volume of data, the algorithms employed are optimized for parsing large data quantities. The methods used provide a unique means of maintaining high resolution data of the surface profiles while keeping algorithm running times within practical bounds for industrial application. By a combination of regional sampling, iterative search, spatial filtering, frequency filtering, spatial clustering, and template matching a robust feature identification method has been developed. These algorithms provide an autonomous means of verifying tolerances in geometrical features. The key method of identifying the features is through a combination of downhill simplex and geometrical feature templates. By performing downhill simplex through several procedural programming layers of different search and filtering techniques, very specific geometrical features can be identified within the point cloud and analyzed for proper tolerancing. Being able to perform this quality control in real time provides significant opportunities in cost savings in both equipment protection and waste minimization.

  20. Using the Gilbert-Johnson-Keerthi Algorithm for Collision Detection in System Effectiveness Modeling

    DTIC Science & Technology

    2015-09-01

    product is vector whose i-th component is defined as (A×B)i = εi jkA jBk, (2) 2 where εi jk is the Levi - Civita symbol whose value is 1 if i jk is an...of GJK 9 3.1.1 Overview of GJK 9 3.1.2 Two Examples of GJK Operating 9 3.1.3 Termination Conditions 11 3.1.4 GJK Algorithm 13 3.2 Simplex Processing...band will snap around the outermost points, forming the convex hull. ...........5 Fig. 3 Two example triangles and their Minkowski Difference

  1. Advanced control concepts. [for shuttle ascent vehicles

    NASA Technical Reports Server (NTRS)

    Sharp, J. B.; Coppey, J. M.

    1973-01-01

    The problems of excess control devices and insufficient trim control capability on shuttle ascent vehicles were investigated. The trim problem is solved at all time points of interest using Lagrangian multipliers and a Simplex based iterative algorithm developed as a result of the study. This algorithm has the capability to solve any bounded linear problem with physically realizable constraints, and to minimize any piecewise differentiable cost function. Both solution methods also automatically distribute the command torques to the control devices. It is shown that trim requirements are unrealizable if only the orbiter engines and the aerodynamic surfaces are used.

  2. Modeling of the WSTF frictional heating apparatus in high pressure systems

    NASA Technical Reports Server (NTRS)

    Skowlund, Christopher T.

    1992-01-01

    In order to develop a computer program able to model the frictional heating of metals in high pressure oxygen or nitrogen a number of additions have been made to the frictional heating model originally developed for tests in low pressure helium. These additions include: (1) a physical property package for the gases to account for departures from the ideal gas state; (2) two methods for spatial discretization (finite differences with quadratic interpolation or orthogonal collocation on finite elements) which substantially reduce the computer time required to solve the transient heat balance; (3) more efficient programs for the integration of the ordinary differential equations resulting from the discretization of the partial differential equations; and (4) two methods for determining the best-fit parameters via minimization of the mean square error (either a direct search multivariable simplex method or a modified Levenburg-Marquardt algorithm). The resulting computer program has been shown to be accurate, efficient and robust for determining the heat flux or friction coefficient vs. time at the interface of the stationary and rotating samples.

  3. Biomechanics and Biotensegrity: Study Method and Frequency Response of the Simplex and 3-bar-SVD Tensegrity Configurations

    NASA Astrophysics Data System (ADS)

    Castro Arenas, C.; Ghersi, I.; Miralles, M. T.

    2016-04-01

    The purpose of this work is to study the frequency response of 3D tensegrity structures. These are structures that have been used, since the 80’s, to model biological systems of different scales. This fact led to the origin of the field of biotensegrity, which includes biomechanics as a natural field of application. In this work: a) A simple method for the analysis of frequency response of different nodes in 3D tensegrity structures was set up and tuned. This method is based on a video-analysis algorithm, which was applied to the structures, as they were vibrated along their axis of symmetry, at frequencies from 1 Hz to 60 Hz. b) Frequency-response analyses were performed, for the simplest 3D structure, the Simplex module, as well as for two towers, formed by stacking two and three Simplex modules, respectively. Resonant frequencies were detected for the Simplex module at (19.2±0.1) Hz and (50.2±0.1) Hz (the latter being an average of frequencies between homologous nodes). For the towers with two and three modules, each selected node presented a characteristic frequency response, modulated by their spatial placement in each model. Resonances for the two-stage tower were found at: (12±0.1) Hz; (16.2±0.1) Hz; (29.4±0.1) Hz and (37.2±0.1) Hz. For the tower with three Simplex modules, the main resonant frequencies were found at (12.0±0.1) Hz and (21.0±0.1) Hz. Results show that the proposed method is adequate for the study (2D) of any 3D tensegrity structure, with the potential of being generalized to the study of oscillations in three dimensions. A growing complexity and variability in the frequency response of the nodes was observed, as modules were added to the structures. These findings were compared to those found in the available literature.

  4. A new robust algorithm for computation of a triangle circumscribed sphere in E3 and a hypersphere simplex

    NASA Astrophysics Data System (ADS)

    Skala, Vaclav

    2016-06-01

    There are many applications in which a bounding sphere containing the given triangle E3 is needed, e.g. fast collision detection, ray-triangle intersecting in raytracing etc. This is a typical geometrical problem in E3 and it has also applications in computational problems in general. In this paper a new fast and robust algorithm of circumscribed sphere computation in the n-dimensional space is presented and specification for the E3 space is given, too. The presented method is convenient for use on GPU or with SSE or Intel's AVX instructions on a standard CPU.

  5. Water Quality Monitoring for Lake Constance with a Physically Based Algorithm for MERIS Data.

    PubMed

    Odermatt, Daniel; Heege, Thomas; Nieke, Jens; Kneubühler, Mathias; Itten, Klaus

    2008-08-05

    A physically based algorithm is used for automatic processing of MERIS level 1B full resolution data. The algorithm is originally used with input variables for optimization with different sensors (i.e. channel recalibration and weighting), aquatic regions (i.e. specific inherent optical properties) or atmospheric conditions (i.e. aerosol models). For operational use, however, a lake-specific parameterization is required, representing an approximation of the spatio-temporal variation in atmospheric and hydrooptic conditions, and accounting for sensor properties. The algorithm performs atmospheric correction with a LUT for at-sensor radiance, and a downhill simplex inversion of chl-a, sm and y from subsurface irradiance reflectance. These outputs are enhanced by a selective filter, which makes use of the retrieval residuals. Regular chl-a sampling measurements by the Lake's protection authority coinciding with MERIS acquisitions were used for parameterization, training and validation.

  6. Registration of interferometric SAR images

    NASA Technical Reports Server (NTRS)

    Lin, Qian; Vesecky, John F.; Zebker, Howard A.

    1992-01-01

    Interferometric synthetic aperture radar (INSAR) is a new way of performing topography mapping. Among the factors critical to mapping accuracy is the registration of the complex SAR images from repeated orbits. A new algorithm for registering interferometric SAR images is presented. A new figure of merit, the average fluctuation function of the phase difference image, is proposed to evaluate the fringe pattern quality. The process of adjusting the registration parameters according to the fringe pattern quality is optimized through a downhill simplex minimization algorithm. The results of applying the proposed algorithm to register two pairs of Seasat SAR images with a short baseline (75 m) and a long baseline (500 m) are shown. It is found that the average fluctuation function is a very stable measure of fringe pattern quality allowing very accurate registration.

  7. Mode of genetic inheritance modifies the association of head circumference and autism-related symptoms: a cross-sectional study.

    PubMed

    Davis, Jonathan M; Keeney, Jonathon G; Sikela, James M; Hepburn, Susan

    2013-01-01

    Frequently individuals with autism spectrum disorder (ASD) have been noted with a larger head circumference (HC) than their typical developing peers. Biologic hypotheses suggest that an overly rapid brain growth leads to the core symptoms of ASD by impairing connectivity. Literature is divided however where deleterious, protective and null associations of HC with ASD symptoms in individuals with ASD have been found. Individuals (n = 1,416) from the Autism Genetic Resource Exchange with ASD were examined for associations of HC with ASD like symptoms. Mixed models controlling for sex, age, race/ethnicity, simplex/multiplex status and accounting for correlations between siblings were used. Interactions by simplex/multiplex were explored. Adjustments for height in a sub-population with available data were explored as well. A Significant interaction term (p = 0.03) suggested that the effect of HC was dependent on whether the individual was simplex or multiplex. In simplex individuals at mean age (8.9 years) 1 cm increase in head circumference was associated with a 24% increase in the odds of a high social diagnostic score from the Autism Diagnostic Interview-Revised (odds ratio  = 1.24, p = 0.01). There was no association in multiplex individuals. Additionally, individuals classified with a non-verbal IQ <70 were 90% simplex and had a significantly increased head circumference (0.7 cm p = 0.03) relative to a mid-range non-verbal IQ group. Interestingly, children classified with a >110 non-verbal IQ also had an increased HC (0.4 cm p = 0.04), relative to a mid-range non-verbal IQ group, and were 90% multiplex. HC effects do not appear to be confounded by height, however, larger samples with height information are needed. The potential link between brain growth and autism like symptoms is complex and could depend on specific etiologies. Further investigations accounting for a likely mode of inheritance will help identify an ASD subtype related to HC.

  8. Fast intersection detection algorithm for PC-based robot off-line programming

    NASA Astrophysics Data System (ADS)

    Fedrowitz, Christian H.

    1994-11-01

    This paper presents a method for fast and reliable collision detection in complex production cells. The algorithm is part of the PC-based robot off-line programming system of the University of Siegen (Ropsus). The method is based on a solid model which is managed by a simplified constructive solid geometry model (CSG-model). The collision detection problem is divided in two steps. In the first step the complexity of the problem is reduced in linear time. In the second step the remaining solids are tested for intersection. For this the Simplex algorithm, which is known from linear optimization, is used. It computes a point which is common to two convex polyhedra. The polyhedra intersect, if such a point exists. Regarding the simplified geometrical model of Ropsus the algorithm runs also in linear time. In conjunction with the first step a resultant collision detection algorithm is found which requires linear time in all. Moreover it computes the resultant intersection polyhedron using the dual transformation.

  9. Improving Robot Locomotion Through Learning Methods for Expensive Black-Box Systems

    DTIC Science & Technology

    2013-11-01

    development of a class of “gradient free” optimization techniques; these include local approaches, such as a Nelder- Mead simplex search (c.f. [73]), and global...1Note that this simple method differs from the Nelder Mead constrained nonlinear optimization method [73]. 39 the Non-dominated Sorting Genetic Algorithm...Kober, and Jan Peters. Model-free inverse reinforcement learning. In International Conference on Artificial Intelligence and Statistics, 2011. [12] George

  10. An Advanced N -body Model for Interacting Multiple Stellar Systems

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Brož, Miroslav

    We construct an advanced model for interacting multiple stellar systems in which we compute all trajectories with a numerical N -body integrator, namely the Bulirsch–Stoer from the SWIFT package. We can then derive various observables: astrometric positions, radial velocities, minima timings (TTVs), eclipse durations, interferometric visibilities, closure phases, synthetic spectra, spectral energy distribution, and even complete light curves. We use a modified version of the Wilson–Devinney code for the latter, in which the instantaneous true phase and inclination of the eclipsing binary are governed by the N -body integration. If all of these types of observations are at one’s disposal,more » a joint χ {sup 2} metric and an optimization algorithm (a simplex or simulated annealing) allow one to search for a global minimum and construct very robust models of stellar systems. At the same time, our N -body model is free from artifacts that may arise if mutual gravitational interactions among all components are not self-consistently accounted for. Finally, we present a number of examples showing dynamical effects that can be studied with our code and we discuss how systematic errors may affect the results (and how to prevent this from happening).« less

  11. Can Linear Superiorization Be Useful for Linear Optimization Problems?

    PubMed Central

    Censor, Yair

    2017-01-01

    Linear superiorization considers linear programming problems but instead of attempting to solve them with linear optimization methods it employs perturbation resilient feasibility-seeking algorithms and steers them toward reduced (not necessarily minimal) target function values. The two questions that we set out to explore experimentally are (i) Does linear superiorization provide a feasible point whose linear target function value is lower than that obtained by running the same feasibility-seeking algorithm without superiorization under identical conditions? and (ii) How does linear superiorization fare in comparison with the Simplex method for solving linear programming problems? Based on our computational experiments presented here, the answers to these two questions are: “yes” and “very well”, respectively. PMID:29335660

  12. Can linear superiorization be useful for linear optimization problems?

    NASA Astrophysics Data System (ADS)

    Censor, Yair

    2017-04-01

    Linear superiorization (LinSup) considers linear programming problems but instead of attempting to solve them with linear optimization methods it employs perturbation resilient feasibility-seeking algorithms and steers them toward reduced (not necessarily minimal) target function values. The two questions that we set out to explore experimentally are: (i) does LinSup provide a feasible point whose linear target function value is lower than that obtained by running the same feasibility-seeking algorithm without superiorization under identical conditions? (ii) How does LinSup fare in comparison with the Simplex method for solving linear programming problems? Based on our computational experiments presented here, the answers to these two questions are: ‘yes’ and ‘very well’, respectively.

  13. [The lysate and recombinant antigens in ELISA-test-systems for diagnostic of herpes simplex].

    PubMed

    Ganova, L A; Kovtoniuk, G V; Korshun, L N; Kiseleva, E K; Tereshchenko, M I; Vudmaska, M I; Moĭsa, L N; Shevchuk, V A; Spivak, N Ia

    2014-08-01

    The lysate and recombinant antigens of various production included informula of ELISA-test-systems were analyzed. The ELISA-test-systems are used for detection of IgG to Herpes simplex virus type I and II. For testing the panel of serums PTH 201 (BBI Inc.) were used. The samples of this panel contain antibodies to Herpes simplex virus type I and II in mixed titers. The 69 serums of donors were used too (17 samples had IgG to Herpes simplex virus type I, 23 samples to Herpes simplex virus type II and 29 samples had no antibodies to Herpes simplex virus). The diagnostic capacity of mixture of recombinant antigens gG1 Herpes simplex virus type I and gG2 Herpes simplex virus type II (The research-and-production complex "DiaprofMed") was comparable with mixture of lysate antigen Herpes simplex virus type I and II (Membrane) EIE Antigen ("Virion Ltd."). In the test-systems for differentiation of IgG to Herpes simplex virus type I the recombinant antigen gG1 Herpes simplex virus type I proved to be comparable with commercial analogue Herpes simplex virus-1 gG1M ("Viral Therapeutics Inc."'). At the same time, capacity to detect IgG to Herpes simplex virus type II in recombinant protein gG2 Herpes simplex virus type II is significantly higher than in its analogue Herpes simplex virus-2 gG2c ("Viral Therapeutics Inc.").

  14. The Significance of Herpes Simplex for School Nurses

    ERIC Educational Resources Information Center

    Ensor, Deirdre

    2005-01-01

    Herpes simplex is a common recurrent viral infection caused by the herpes simplex virus. The two closely related but distinct viruses that cause herpes simplex infections are herpes simplex 1 (HSV-1) and herpes simplex 2 (HSV-2). HSV-1 is commonly associated with infections around the oral mucosa and is the cause of herpes labialis, often referred…

  15. Coherent Operations, Entanglement, and Progress Toward Quantum Search in a Large 2D Array of Neutral Atom Qubits

    DTIC Science & Technology

    2015-08-18

    by Benjamin Bederson and Herbert Walther, pp. 95 –170. issn: 1049-250X. doi: 10.1016/S1049-250X(08)60186-X. [49] Nicolas Schlosser, Georges Reymond...144 9.5.1.2 Genetic Algorithm . . . . . . . . . . . . . . . . . . . . . . . . 145 9.5.1.3 Nelder- Mead Simplex...from 2013-11-14-15-18-54. 90 Nelder- Mead optimizing readout frequency, power and time Readout frequency Iterations Python Controller Arroyo TEC and

  16. Determination of elastic moduli from measured acoustic velocities.

    PubMed

    Brown, J Michael

    2018-06-01

    Methods are evaluated in solution of the inverse problem associated with determination of elastic moduli for crystals of arbitrary symmetry from elastic wave velocities measured in many crystallographic directions. A package of MATLAB functions provides a robust and flexible environment for analysis of ultrasonic, Brillouin, or Impulsive Stimulated Light Scattering datasets. Three inverse algorithms are considered: the gradient-based methods of Levenberg-Marquardt and Backus-Gilbert, and a non-gradient-based (Nelder-Mead) simplex approach. Several data types are considered: body wave velocities alone, surface wave velocities plus a side constraint on X-ray-diffraction-based axes compressibilities, or joint body and surface wave velocities. The numerical algorithms are validated through comparisons with prior published results and through analysis of synthetic datasets. Although all approaches succeed in finding low-misfit solutions, the Levenberg-Marquardt method consistently demonstrates effectiveness and computational efficiency. However, linearized gradient-based methods, when applied to a strongly non-linear problem, may not adequately converge to the global minimum. The simplex method, while slower, is less susceptible to being trapped in local misfit minima. A "multi-start" strategy (initiate searches from more than one initial guess) provides better assurance that global minima have been located. Numerical estimates of parameter uncertainties based on Monte Carlo simulations are compared to formal uncertainties based on covariance calculations. Copyright © 2018 Elsevier B.V. All rights reserved.

  17. Can mutational GC-pressure create new linear B-cell epitopes in herpes simplex virus type 1 glycoprotein B?

    PubMed

    Khrustalev, Vladislav Victorovich

    2009-01-01

    We showed that GC-content of nucleotide sequences coding for linear B-cell epitopes of herpes simplex virus type 1 (HSV1) glycoprotein B (gB) is higher than GC-content of sequences coding for epitope-free regions of this glycoprotein (G + C = 73 and 64%, respectively). Linear B-cell epitopes have been predicted in HSV1 gB by BepiPred algorithm ( www.cbs.dtu.dk/services/BepiPred ). Proline is an acrophilic amino acid residue (it is usually situated on the surface of protein globules, and so included in linear B-cell epitopes). Indeed, the level of proline is much higher in predicted epitopes of gB than in epitope-free regions (17.8% versus 1.8%). This amino acid is coded by GC-rich codons (CCX) that can be produced due to nucleotide substitutions caused by mutational GC-pressure. GC-pressure will also lead to disappearance of acrophobic phenylalanine, isoleucine, methionine and tyrosine coded by GC-poor codons. Results of our "in-silico directed mutagenesis" showed that single nonsynonymous substitutions in AT to GC direction in two long epitope-free regions of gB will cause formation of new linear epitopes or elongation of previously existing epitopes flanking these regions in 25% of 539 possible cases. The calculations of GC-content and amino acid content have been performed by CodonChanges algorithm ( www.barkovsky.hotmail.ru ).

  18. Non-nucleosidic inhibition of Herpes simplex virus DNA polymerase: mechanistic insights into the anti-herpetic mode of action of herbal drug withaferin A.

    PubMed

    Grover, Abhinav; Agrawal, Vibhuti; Shandilya, Ashutosh; Bisaria, Virendra S; Sundar, Durai

    2011-01-01

    Herpes Simplex Virus 1 and 2 causes several infections in humans including cold sores and encephalitis. Previous antiviral studies on herpes viruses have focussed on developing nucleoside analogues that can inhibit viral polymerase and terminate the replicating viral DNA. However, these drugs bear an intrinsic non-specificity as they can also inhibit cellular polymerase apart from the viral one. The present study is an attempt to elucidate the action mechanism of naturally occurring withaferin A in inhibiting viral DNA polymerase, thus providing an evidence for its development as a novel anti-herpetic drug. Withaferin A was found to bind very similarly to that of the previously reported 4-oxo-DHQ inhibitor. Withaferin A was observed binding to the residues Gln 617, Gln 618, Asn 815 and Tyr 818, all of which are crucial to the proper functioning of the polymerase. A comparison of the conformation obtained from docking and the molecular dynamics simulations shows that substantial changes in the binding conformations have occurred. These results indicate that the initial receptor-ligand interaction observed after docking can be limited due to the receptor rigid docking algorithm and that the conformations and interactions observed after simulation runs are more energetically favoured. We have performed docking and molecular dynamics simulation studies to elucidate the binding mechanism of prospective herbal drug withaferin A onto the structure of DNA polymerase of Herpes simplex virus. Our docking simulations results give high binding affinity of the ligand to the receptor. Long de novo MD simulations for 10 ns performed allowed us to evaluate the dynamic behaviour of the system studied and corroborate the docking results, as well as identify key residues in the enzyme-inhibitor interactions. The present MD simulations support the hypothesis that withaferin A is a potential ligand to target/inhibit DNA polymerase of the Herpes simplex virus. Results of these studies will also guide the design of selective inhibitors of DNA POL with high specificity and potent activity in order to strengthen the therapeutic arsenal available today against the dangerous biological warfare agent represented by Herpes Simplex Virus.

  19. Non-nucleosidic inhibition of Herpes simplex virus DNA polymerase: mechanistic insights into the anti-herpetic mode of action of herbal drug withaferin A

    PubMed Central

    2011-01-01

    Background Herpes Simplex Virus 1 and 2 causes several infections in humans including cold sores and encephalitis. Previous antiviral studies on herpes viruses have focussed on developing nucleoside analogues that can inhibit viral polymerase and terminate the replicating viral DNA. However, these drugs bear an intrinsic non-specificity as they can also inhibit cellular polymerase apart from the viral one. The present study is an attempt to elucidate the action mechanism of naturally occurring withaferin A in inhibiting viral DNA polymerase, thus providing an evidence for its development as a novel anti-herpetic drug. Results Withaferin A was found to bind very similarly to that of the previously reported 4-oxo-DHQ inhibitor. Withaferin A was observed binding to the residues Gln 617, Gln 618, Asn 815 and Tyr 818, all of which are crucial to the proper functioning of the polymerase. A comparison of the conformation obtained from docking and the molecular dynamics simulations shows that substantial changes in the binding conformations have occurred. These results indicate that the initial receptor-ligand interaction observed after docking can be limited due to the receptor rigid docking algorithm and that the conformations and interactions observed after simulation runs are more energetically favoured. Conclusions We have performed docking and molecular dynamics simulation studies to elucidate the binding mechanism of prospective herbal drug withaferin A onto the structure of DNA polymerase of Herpes simplex virus. Our docking simulations results give high binding affinity of the ligand to the receptor. Long de novo MD simulations for 10 ns performed allowed us to evaluate the dynamic behaviour of the system studied and corroborate the docking results, as well as identify key residues in the enzyme-inhibitor interactions. The present MD simulations support the hypothesis that withaferin A is a potential ligand to target/inhibit DNA polymerase of the Herpes simplex virus. Results of these studies will also guide the design of selective inhibitors of DNA POL with high specificity and potent activity in order to strengthen the therapeutic arsenal available today against the dangerous biological warfare agent represented by Herpes Simplex Virus. PMID:22373101

  20. p53 Is a Host Cell Regulator during Herpes Simplex Encephalitis.

    PubMed

    Maruzuru, Yuhei; Koyanagi, Naoto; Takemura, Naoki; Uematsu, Satoshi; Matsubara, Daisuke; Suzuki, Yutaka; Arii, Jun; Kato, Akihisa; Kawaguchi, Yasushi

    2016-08-01

    p53 is a critical host cell factor in the cellular response to a broad range of stress factors. We recently reported that p53 is required for efficient herpes simplex virus 1 (HSV-1) replication in cell culture. However, a defined role for p53 in HSV-1 replication and pathogenesis in vivo remains elusive. In this study, we examined the effects of p53 on HSV-1 infection in vivo using p53-deficient mice. Following intracranial inoculation, p53 knockout reduced viral replication in the brains of mice and led to significantly reduced rates of mortality due to herpes simplex encephalitis. These results suggest that p53 is an important host cell regulator of HSV-1 replication and pathogenesis in the central nervous system (CNS). HSV-1 causes sporadic cases of encephalitis, which, even with antiviral therapy, can result in severe neurological defects and even death. Many host cell factors involved in the regulation of CNS HSV-1 infection have been investigated using genetically modified mice. However, most of these factors are immunological regulators and act via immunological pathways in order to restrict CNS HSV-1 infection. They therefore provide limited information on intrinsic host cell regulators that may be involved in the facilitation of CNS HSV-1 infection. Here we demonstrate that a host cell protein, p53, which has generally been considered a host cell restriction factor for various viral infections, is required for efficient HSV-1 replication and pathogenesis in the CNS of mice. This is the first report showing that p53 positively regulates viral replication and pathogenesis in vivo and provides insights into its molecular mechanism, which may suggest novel clinical treatment options for herpes simplex encephalitis. Copyright © 2016, American Society for Microbiology. All Rights Reserved.

  1. Information diffusion, Facebook clusters, and the simplicial model of social aggregation: a computational simulation of simplicial diffusers for community health interventions.

    PubMed

    Kee, Kerk F; Sparks, Lisa; Struppa, Daniele C; Mannucci, Mirco A; Damiano, Alberto

    2016-01-01

    By integrating the simplicial model of social aggregation with existing research on opinion leadership and diffusion networks, this article introduces the constructs of simplicial diffusers (mathematically defined as nodes embedded in simplexes; a simplex is a socially bonded cluster) and simplicial diffusing sets (mathematically defined as minimal covers of a simplicial complex; a simplicial complex is a social aggregation in which socially bonded clusters are embedded) to propose a strategic approach for information diffusion of cancer screenings as a health intervention on Facebook for community cancer prevention and control. This approach is novel in its incorporation of interpersonally bonded clusters, culturally distinct subgroups, and different united social entities that coexist within a larger community into a computational simulation to select sets of simplicial diffusers with the highest degree of information diffusion for health intervention dissemination. The unique contributions of the article also include seven propositions and five algorithmic steps for computationally modeling the simplicial model with Facebook data.

  2. Control Allocation with Load Balancing

    NASA Technical Reports Server (NTRS)

    Bodson, Marc; Frost, Susan A.

    2009-01-01

    Next generation aircraft with a large number of actuators will require advanced control allocation methods to compute the actuator commands needed to follow desired trajectories while respecting system constraints. Previously, algorithms were proposed to minimize the l1 or l2 norms of the tracking error and of the actuator deflections. The paper discusses the alternative choice of the l(infinity) norm, or sup norm. Minimization of the control effort translates into the minimization of the maximum actuator deflection (min-max optimization). The paper shows how the problem can be solved effectively by converting it into a linear program and solving it using a simplex algorithm. Properties of the algorithm are also investigated through examples. In particular, the min-max criterion results in a type of load balancing, where the load is th desired command and the algorithm balances this load among various actuators. The solution using the l(infinity) norm also results in better robustness to failures and to lower sensitivity to nonlinearities in illustrative examples.

  3. Model based LV-reconstruction in bi-plane x-ray angiography

    NASA Astrophysics Data System (ADS)

    Backfrieder, Werner; Carpella, Martin; Swoboda, Roland; Steinwender, Clemens; Gabriel, Christian; Leisch, Franz

    2005-04-01

    Interventional x-ray angiography is state of the art in diagnosis and therapy of severe diseases of the cardiovascular system. Diagnosis is based on contrast enhanced dynamic projection images of the left ventricle. A new model based algorithm for three dimensional reconstruction of the left ventricle from bi-planar angiograms was developed. Parametric super ellipses are deformed until their projection profiles optimally fit measured ventricular projections. Deformation is controlled by a simplex optimization procedure. A resulting optimized parameter set builds the initial guess for neighboring slices. A three dimensional surface model of the ventricle is built from stacked contours. The accuracy of the algorithm has been tested with mathematical phantom data and clinical data. Results show conformance with provided projection data and high convergence speed makes the algorithm useful for clinical application. Fully three dimensional reconstruction of the left ventricle has a high potential for improvements of clinical findings in interventional cardiology.

  4. A modified MOD16 algorithm to estimate evapotranspiration over alpine meadow on the Tibetan Plateau, China

    NASA Astrophysics Data System (ADS)

    Chang, Yaping; Qin, Dahe; Ding, Yongjian; Zhao, Qiudong; Zhang, Shiqiang

    2018-06-01

    The long-term change of evapotranspiration (ET) is crucial for managing water resources in areas with extreme climates, such as the Tibetan Plateau (TP). This study proposed a modified algorithm for estimating ET based on the MOD16 algorithm on a global scale over alpine meadow on the TP in China. Wind speed and vegetation height were integrated to estimate aerodynamic resistance, while the temperature and moisture constraints for stomatal conductance were revised based on the technique proposed by Fisher et al. (2008). Moreover, Fisher's method for soil evaporation was adopted to reduce the uncertainty in soil evaporation estimation. Five representative alpine meadow sites on the TP were selected to investigate the performance of the modified algorithm. Comparisons were made between the ET observed using the Eddy Covariance (EC) and estimated using both the original and modified algorithms. The results revealed that the modified algorithm performed better than the original MOD16 algorithm with the coefficient of determination (R2) increasing from 0.26 to 0.68, and root mean square error (RMSE) decreasing from 1.56 to 0.78 mm d-1. The modified algorithm performed slightly better with a higher R2 (0.70) and lower RMSE (0.61 mm d-1) for after-precipitation days than for non-precipitation days at Suli site. Contrarily, better results were obtained for non-precipitation days than for after-precipitation days at Arou, Tanggula, and Hulugou sites, indicating that the modified algorithm may be more suitable for estimating ET for non-precipitation days with higher accuracy than for after-precipitation days, which had large observation errors. The comparisons between the modified algorithm and two mainstream methods suggested that the modified algorithm could produce high accuracy ET over the alpine meadow sites on the TP.

  5. Lichen simplex chronicus

    MedlinePlus

    ... lichen simplex chronicus; Atopic dermatitis - lichen simplex chronicus; Psoriasis - lichen simplex chronicus ... people who have: Skin allergies Eczema (atopic dermatitis) Psoriasis Nervousness, anxiety, depression, and other emotional problems The ...

  6. The solution of the optimization problem of small energy complexes using linear programming methods

    NASA Astrophysics Data System (ADS)

    Ivanin, O. A.; Director, L. B.

    2016-11-01

    Linear programming methods were used for solving the optimization problem of schemes and operation modes of distributed generation energy complexes. Applicability conditions of simplex method, applied to energy complexes, including installations of renewable energy (solar, wind), diesel-generators and energy storage, considered. The analysis of decomposition algorithms for various schemes of energy complexes was made. The results of optimization calculations for energy complexes, operated autonomously and as a part of distribution grid, are presented.

  7. Space mapping method for the design of passive shields

    NASA Astrophysics Data System (ADS)

    Sergeant, Peter; Dupré, Luc; Melkebeek, Jan

    2006-04-01

    The aim of the paper is to find the optimal geometry of a passive shield for the reduction of the magnetic stray field of an axisymmetric induction heater. For the optimization, a space mapping algorithm is used that requires two models. The first is an accurate model with a high computational effort as it contains finite element models. The second is less accurate, but it has a low computational effort as it uses an analytical model: the shield is replaced by a number of mutually coupled coils. The currents in the shield are found by solving an electrical circuit. Space mapping combines both models to obtain the optimal passive shield fast and accurately. The presented optimization technique is compared with gradient, simplex, and genetic algorithms.

  8. Mode of Genetic Inheritance Modifies the Association of Head Circumference and Autism-Related Symptoms: A Cross-Sectional Study

    PubMed Central

    Davis, Jonathan M.; Keeney, Jonathon G.; Sikela, James M.; Hepburn, Susan

    2013-01-01

    Background Frequently individuals with autism spectrum disorder (ASD) have been noted with a larger head circumference (HC) than their typical developing peers. Biologic hypotheses suggest that an overly rapid brain growth leads to the core symptoms of ASD by impairing connectivity. Literature is divided however where deleterious, protective and null associations of HC with ASD symptoms in individuals with ASD have been found. Method Individuals (n = 1,416) from the Autism Genetic Resource Exchange with ASD were examined for associations of HC with ASD like symptoms. Mixed models controlling for sex, age, race/ethnicity, simplex/multiplex status and accounting for correlations between siblings were used. Interactions by simplex/multiplex were explored. Adjustments for height in a sub-population with available data were explored as well. Results A Significant interaction term (p = 0.03) suggested that the effect of HC was dependent on whether the individual was simplex or multiplex. In simplex individuals at mean age (8.9 years) 1 cm increase in head circumference was associated with a 24% increase in the odds of a high social diagnostic score from the Autism Diagnostic Interview – Revised (odds ratio  = 1.24, p = 0.01). There was no association in multiplex individuals. Additionally, individuals classified with a non-verbal IQ <70 were 90% simplex and had a significantly increased head circumference (0.7 cm p = 0.03) relative to a mid-range non-verbal IQ group. Interestingly, children classified with a >110 non-verbal IQ also had an increased HC (0.4 cm p = 0.04), relative to a mid-range non-verbal IQ group, and were 90% multiplex. HC effects do not appear to be confounded by height, however, larger samples with height information are needed. Conclusion The potential link between brain growth and autism like symptoms is complex and could depend on specific etiologies. Further investigations accounting for a likely mode of inheritance will help identify an ASD subtype related to HC. PMID:24058641

  9. Simplex volume analysis for finding endmembers in hyperspectral imagery

    NASA Astrophysics Data System (ADS)

    Li, Hsiao-Chi; Song, Meiping; Chang, Chein-I.

    2015-05-01

    Using maximal simplex volume as an optimal criterion for finding endmembers is a common approach and has been widely studied in the literature. Interestingly, very little work has been reported on how simplex volume is calculated. It turns out that the issue of calculating simplex volume is much more complicated and involved than what we may think. This paper investigates this issue from two different aspects, geometric structure and eigen-analysis. The geometric structure is derived from its simplex structure whose volume can be calculated by multiplying its base with its height. On the other hand, eigen-analysis takes advantage of the Cayley-Menger determinant to calculate the simplex volume. The major issue of this approach is that when the matrix is ill-rank where determinant is desired. To deal with this problem two methods are generally considered. One is to perform data dimensionality reduction to make the matrix to be of full rank. The drawback of this method is that the original volume has been shrunk and the found volume of a dimensionality-reduced simplex is not the real original simplex volume. Another is to use singular value decomposition (SVD) to find singular values for calculating simplex volume. The dilemma of this method is its instability in numerical calculations. This paper explores all of these three methods in simplex volume calculation. Experimental results show that geometric structure-based method yields the most reliable simplex volume.

  10. Resource Balancing Control Allocation

    NASA Technical Reports Server (NTRS)

    Frost, Susan A.; Bodson, Marc

    2010-01-01

    Next generation aircraft with a large number of actuators will require advanced control allocation methods to compute the actuator commands needed to follow desired trajectories while respecting system constraints. Previously, algorithms were proposed to minimize the l1 or l2 norms of the tracking error and of the control effort. The paper discusses the alternative choice of using the l1 norm for minimization of the tracking error and a normalized l(infinity) norm, or sup norm, for minimization of the control effort. The algorithm computes the norm of the actuator deflections scaled by the actuator limits. Minimization of the control effort then translates into the minimization of the maximum actuator deflection as a percentage of its range of motion. The paper shows how the problem can be solved effectively by converting it into a linear program and solving it using a simplex algorithm. Properties of the algorithm are investigated through examples. In particular, the min-max criterion results in a type of resource balancing, where the resources are the control surfaces and the algorithm balances these resources to achieve the desired command. A study of the sensitivity of the algorithms to the data is presented, which shows that the normalized l(infinity) algorithm has the lowest sensitivity, although high sensitivities are observed whenever the limits of performance are reached.

  11. High prevalence of Anisakis simplex hypersensitivity and allergy in Sicily, Italy.

    PubMed

    Heffler, Enrico; Sberna, Maria Eva; Sichili, Stefania; Intravaia, Rossella; Nicolosi, Giuliana; Porto, Morena; Liuzzo, Maria Teresa; Picardi, Giuseppe; Fichera, Silvia; Crimi, Nunzio

    2016-02-01

    Anisakis simplex can elicit allergic reactions when ingested in raw or marinated fish. The prevalence of A simplex hypersensitivity and allergy in Sicily (Italy), an area where the consumption of raw or marinated fish is very common, has not been investigated thus far. To investigate the prevalence of A simplex sensitization and its clinical relevance in a large group of unselected patients. All consecutive patients referred to the authors' allergy clinic during a 22 month-period were included in the study, evaluated for sensitization to A simplex and other allergens depending on their clinical history, and investigated for allergic symptoms after the ingestion of raw or marinated fish. Of 3,419 patients screened, 527 (15.4%) were sensitized to A simplex and 29 of these (5.5% of sensitized patients) had a history of A simplex allergy. Approximately 30% of patients had mono-sensitization to A simplex. Co-sensitization to house dust mites or molds yielded an odds ratio of 1.98 or 3.18, respectively, for allergy to A simplex. A high prevalence of A simplex sensitization in a large proportion of patients with mono-sensitization was found, confirming that eating habits influence sensitization to this nematode. Allergic symptoms from A simplex ingestion in raw or marinated fish were quite frequent, with symptoms ranging from oral allergy syndrome to anaphylaxis. Patients sensitized to A simplex were more prone to have allergic symptoms when they had co-sensitization to house dust mites or molds, suggesting possible cross-reactive but clinically relevant allergens between these allergenic sources. Copyright © 2016. Published by Elsevier Inc.

  12. [Post-herpes simplex encephalitis chorea: Viral replication or immunological mechanism?].

    PubMed

    Benrhouma, H; Nasri, A; Kraoua, I; Klaa, H; Turki, I; Gouider-Khouja, N

    2015-09-01

    Herpes simplex encephalitis is a severe neurological condition, whose outcome is improved if treated early with acyclovir. Post-herpes simplex encephalitis with acute chorea has rarely been reported. We report on two observations of children presenting with post-herpes simplex encephalitis with acute chorea, related to two different pathophysiological mechanisms. The first one is an 11-month-old girl developing relapsing herpes simplex encephalitis with chorea due to resumption of viral replication. The second one is a 2-year-old boy with relapsing post-herpes simplex encephalitis acute chorea caused by an immunoinflammatory mechanism. We discuss the different neurological presentations of herpetic relapses, notably those presenting with movement disorders, as well as their clinical, paraclinical, physiopathological, and therapeutic aspects. Post-herpes simplex encephalitis with acute chorea may involve two mechanisms: resumption of viral replication or an immunoinflammatory mechanism. Treatment of post-herpes simplex encephalitis with acute chorea depends on the underlying mechanism, while prevention is based on antiviral treatment of herpes simplex encephalitis with acyclovir at the dose of 20mg/kg/8h for 21 days. Copyright © 2015 Elsevier Masson SAS. All rights reserved.

  13. Modifying landing mat material properties may decrease peak contact forces but increase forefoot forces in gymnastics landings.

    PubMed

    Mills, Chris; Yeadon, Maurice R; Pain, Matthew T G

    2010-09-01

    This study investigated how changes in the material properties of a landing mat could minimise ground reaction forces (GRF) and internal loading on a gymnast during landing. A multi-layer model of a gymnastics competition landing mat and a subject-specific seven-link wobbling mass model of a gymnast were developed to address this aim. Landing mat properties (stiffness and damping) were optimised using a Simplex algorithm to minimise GRF and internal loading. The optimisation of the landing mat parameters was characterised by minimal changes to the mat's stiffness (<0.5%) but increased damping (272%) compared to the competition landing mat. Changes to the landing mat resulted in reduced peak vertical and horizontal GRF and reduced bone bending moments in the shank and thigh compared to a matching simulation. Peak bone bending moments within the thigh and shank were reduced by 6% from 321.5 Nm to 302.5Nm and GRF by 12% from 8626 N to 7552 N when compared to a matching simulation. The reduction in these forces may help to reduce the risk of bone fracture injury associated with a single landing and reduce the risk of a chronic injury such as a stress fracture.

  14. [Clinical, epidemiological, and etiological studies of adult aseptic meningitis: a report of 12 cases of herpes simplex meningitis, and a comparison with cases of herpes simplex encephalitis].

    PubMed

    Himeno, Takahiro; Shiga, Yuji; Takeshima, Shinichi; Tachiyama, Keisuke; Kamimura, Teppei; Kono, Ryuhei; Takemaru, Makoto; Takeshita, Jun; Shimoe, Yutaka; Kuriyama, Masaru

    2018-01-26

    We treated 437 cases of adult aseptic meningitis and 12 cases (including 2 recurrent patients; age, 31.8 ± 8.9 years; 7 females) of herpes simplex meningitis from 2004 to 2016. The incidence rate of adult herpes simplex meningitis in the cases with aseptic meningitis was 2.7%. One patient was admitted during treatment of genital herpes, but no association was observed between genital herpes and herpes simplex meningitis in the other cases. The diagnoses were confirmed in all cases as the cerebrospinal fluid (CSF) was positive for herpes simplex virus (HSV)-DNA. For diagnosis confirmation, the DNA test was useful after 2-7 days following initial disease onset. Among other types of aseptic meningitis, the patients with herpes simplex meningitis showed relatively high white blood cell counts and relatively high CSF protein and high CSF cell counts. CSF cells showed mononuclear cell dominance from the initial stage of the disease. During same period, we also experienced 12 cases of herpes simplex encephalitis and 21 cases of non-hepatic acute limbic encephalitis. Notably, the patients with herpes simplex meningitis were younger and their CSF protein and cells counts were higher than those of the patients with herpes simplex encephalitis.

  15. A modified approach combining FNEA and watershed algorithms for segmenting remotely-sensed optical images

    NASA Astrophysics Data System (ADS)

    Liu, Likun

    2018-01-01

    In the field of remote sensing image processing, remote sensing image segmentation is a preliminary step for later analysis of remote sensing image processing and semi-auto human interpretation, fully-automatic machine recognition and learning. Since 2000, a technique of object-oriented remote sensing image processing method and its basic thought prevails. The core of the approach is Fractal Net Evolution Approach (FNEA) multi-scale segmentation algorithm. The paper is intent on the research and improvement of the algorithm, which analyzes present segmentation algorithms and selects optimum watershed algorithm as an initialization. Meanwhile, the algorithm is modified by modifying an area parameter, and then combining area parameter with a heterogeneous parameter further. After that, several experiments is carried on to prove the modified FNEA algorithm, compared with traditional pixel-based method (FCM algorithm based on neighborhood information) and combination of FNEA and watershed, has a better segmentation result.

  16. Anisakis simplex allergy: a murine model of anaphylaxis induced by parasitic proteins displays a mixed Th1/Th2 pattern

    PubMed Central

    Baeza, M L; Conejero, L; Higaki, Y; Martín, E; Pérez, C; Infante, S; Rubio, M; Zubeldia, J M

    2005-01-01

    The study of the singular hypersensitivity reactions to Anisakis simplex (A.s) proteins, may help us to undestand many of the unknown immune interactions between helmiths infections and allergy. We have developed a murine model of allergy to A. simplex, that mimics human A. simplex allergy to study the specific aspects of anaphylaxis induced by parasites. Male C3H/HeJ mice were intraperitoneally sensitized to A. simplex. Mice were then intravenous or orally challenged with A. simplex. Antigen-specific immunoglobulins, polyclonal IgE, anaphylactic symptoms, plasma histamine levels and cytokine profiles were determined. Comparative IgE immunoblot analyses were also performed. Specific IgE, IgG1 and IgG2a were detected in sensitized mice since week 3. Polyclonal IgE raised and peaked with different kinetics. Intravenous A. simplex challenge produced anaphylaxis in mice, accompanied by plasma histamine release. Oral A. simplex challenge in similarly sensitized mice did not caused symptoms nor histamine release. Numerous A. simplex allergens were recognized by sensitized mouse sera, some of them similar to human serum. The A. simplex stimulated splenocytes released IL-10, IFN-γ, IL-4, IL-13 and IL-5. We describe a new animal model of anaphylaxis. It exhibits characteristics of type I hypersensitivity reactions to Anisakis simplex similar to those observed in allergic humans. Different responses to i.v. or oral A. simplex challenges emerged, which did not reflect a window tolerization period. The cytokine profile developed (mixed Th1/Th2 pattern) differed from the observed in classical models of anaphylaxis or allergy to food antigens. This model may permit to investigate the peculiar allergic reactions to parasitic proteins. PMID:16297154

  17. Incorporation of a lambda phage recombination system and EGFP detection to simplify mutagenesis of Herpes simplex virus bacterial artificial chromosomes

    PubMed Central

    Schmeisser, Falko; Weir, Jerry P

    2007-01-01

    Background Targeted mutagenesis of the herpesvirus genomes has been facilitated by the use of bacterial artificial chromosome (BAC) technology. Such modified genomes have potential uses in understanding viral pathogenesis, gene identification and characterization, and the development of new viral vectors and vaccines. We have previously described the construction of a herpes simplex virus 2 (HSV-2) BAC and the use of an allele replacement strategy to construct HSV-2 recombinants. While the BAC mutagenesis procedure is a powerful method to generate HSV-2 recombinants, particularly in the absence of selective marker in eukaryotic culture, the mutagenesis procedure is still difficult and cumbersome. Results Here we describe the incorporation of a phage lambda recombination system into an allele replacement vector. This strategy enables any DNA fragment containing the phage attL recombination sites to be efficiently inserted into the attR sites of the allele replacement vector using phage lambda clonase. We also describe how the incorporation of EGFP into the allele replacement vector can facilitate the selection of the desired cross-over recombinant BACs when the allele replacement reaction is a viral gene deletion. Finally, we incorporate the lambda phage recombination sites directly into an HSV-2 BAC vector for direct recombination of gene cassettes using the phage lambda clonase-driven recombination reaction. Conclusion Together, these improvements to the techniques of HSV BAC mutagenesis will facilitate the construction of recombinant herpes simplex viruses and viral vectors. PMID:17501993

  18. RNA interference inhibits herpes simplex virus type 1 isolated from saliva samples and mucocutaneous lesions.

    PubMed

    Silva, Amanda Perse da; Lopes, Juliana Freitas; Paula, Vanessa Salete de

    2014-01-01

    The aim of this study was to evaluate the use of RNA interference to inhibit herpes simplex virus type-1 replication in vitro. For herpes simplex virus type-1 gene silencing, three different small interfering RNAs (siRNAs) targeting the herpes simplex virus type-1 UL39 gene (sequence si-UL 39-1, si-UL 39-2, and si-UL 39-3) were used, which encode the large subunit of ribonucleotide reductase, an essential enzyme for DNA synthesis. Herpes simplex virus type-1 was isolated from saliva samples and mucocutaneous lesions from infected patients. All mucocutaneous lesions' samples were positive for herpes simplex virus type-1 by real-time PCR and by virus isolation; all herpes simplex virus type-1 from saliva samples were positive by real-time PCR and 50% were positive by virus isolation. The levels of herpes simplex virus type-1 DNA remaining after siRNA treatment were assessed by real-time PCR, whose results demonstrated that the effect of siRNAs on gene expression depends on siRNA concentration. The three siRNA sequences used were able to inhibit viral replication, assessed by real-time PCR and plaque assays and among them, the sequence si-UL 39-1 was the most effective. This sequence inhibited 99% of herpes simplex virus type-1 replication. The results demonstrate that silencing herpes simplex virus type-1 UL39 expression by siRNAs effectively inhibits herpes simplex virus type-1 replication, suggesting that siRNA based antiviral strategy may be a potential therapeutic alternative. Copyright © 2014. Published by Elsevier Editora Ltda.

  19. Development of one novel multiple-target plasmid for duplex quantitative PCR analysis of roundup ready soybean.

    PubMed

    Zhang, Haibo; Yang, Litao; Guo, Jinchao; Li, Xiang; Jiang, Lingxi; Zhang, Dabing

    2008-07-23

    To enforce the labeling regulations of genetically modified organisms (GMOs), the application of reference molecules as calibrators is becoming essential for practical quantification of GMOs. However, the reported reference molecules with tandem marker multiple targets have been proved not suitable for duplex PCR analysis. In this study, we developed one unique plasmid molecule based on one pMD-18T vector with three exogenous target DNA fragments of Roundup Ready soybean GTS 40-3-2 (RRS), that is, CaMV35S, NOS, and RRS event fragments, plus one fragment of soybean endogenous Lectin gene. This Lectin gene fragment was separated from the three exogenous target DNA fragments of RRS by inserting one 2.6 kb DNA fragment with no relatedness to RRS detection targets in this resultant plasmid. Then, we proved that this design allows the quantification of RRS using the three duplex real-time PCR assays targeting CaMV35S, NOS, and RRS events employing this reference molecule as the calibrator. In these duplex PCR assays, the limits of detection (LOD) and quantification (LOQ) were 10 and 50 copies, respectively. For the quantitative analysis of practical RRS samples, the results of accuracy and precision were similar to those of simplex PCR assays, for instance, the quantitative results were at the 1% level, the mean bias of the simplex and duplex PCR were 4.0% and 4.6%, respectively, and the statistic analysis ( t-test) showed that the quantitative data from duplex and simplex PCR had no significant discrepancy for each soybean sample. Obviously, duplex PCR analysis has the advantages of saving the costs of PCR reaction and reducing the experimental errors in simplex PCR testing. The strategy reported in the present study will be helpful for the development of new reference molecules suitable for duplex PCR quantitative assays of GMOs.

  20. Enabling IP Header Compression in COTS Routers via Frame Relay on a Simplex Link

    NASA Technical Reports Server (NTRS)

    Nguyen, Sam P.; Pang, Jackson; Clare, Loren P.; Cheng, Michael K.

    2010-01-01

    NASA is moving toward a networkcentric communications architecture and, in particular, is building toward use of Internet Protocol (IP) in space. The use of IP is motivated by its ubiquitous application in many communications networks and in available commercial off-the-shelf (COTS) technology. The Constellation Program intends to fit two or more voice (over IP) channels on both the forward link to, and the return link from, the Orion Crew Exploration Vehicle (CEV) during all mission phases. Efficient bandwidth utilization of the links is key for voice applications. In Voice over IP (VoIP), the IP packets are limited to small sizes to keep voice latency at a minimum. The common voice codec used in VoIP is G.729. This new algorithm produces voice audio at 8 kbps and in packets of 10-milliseconds duration. Constellation has designed the VoIP communications stack to use the combination of IP/UDP/RTP protocols where IP carries a 20-byte header, UDP (User Datagram Protocol) carries an 8-byte header, and RTP (Real Time Transport Protocol) carries a 12-byte header. The protocol headers total 40 bytes and are equal in length to a 40-byte G.729 payload, doubling the VoIP latency. Since much of the IP/UDP/RTP header information does not change from IP packet to IP packet, IP/UDP/RTP header compression can avoid transmission of much redundant data as well as reduce VoIP latency. The benefits of IP header compression are more pronounced at low data rate links such as the forward and return links during CEV launch. IP/UDP/RTP header compression codecs are well supported by many COTS routers. A common interface to the COTS routers is through frame relay. However, enabling IP header compression over frame relay, according to industry standard (Frame Relay IP Header Compression Agreement FRF.20), requires a duplex link and negotiations between the compressor router and the decompressor router. In Constellation, each forward to and return link from the CEV in space is treated independently as a simplex link. Without negotiation, the COTS routers are prevented from entering into the IP header compression mode, and no IP header compression would be performed. An algorithm is proposed to enable IP header compression in COTS routers on a simplex link with no negotiation or with a one-way messaging. In doing so, COTS routers can enter IP header compression mode without the need to handshake through a bidirectional link as required by FRF.20. This technique would spoof the routers locally and thereby allow the routers to enter into IP header compression mode without having the negotiations between routers actually occur. The spoofing function is conducted by a frame relay adapter (also COTS) with the capability to generate control messages according to the FRF.20 descriptions. Therefore, negotiation is actually performed between the FRF.20 adapter and the connecting COTS router locally and never occurs over the space link. Through understanding of the handshaking protocol described by FRF.20, the necessary FRF.20 negotiations messages can be generated to control the connecting router, not only to turn on IP header compression but also to adjust the compression parameters. The FRF.20 negotiation (or control) message is composed in the FRF.20 adapter by interpreting the incoming router request message. Many of the fields are simply transcribed from request to response while the control field indicating response and type are modified.

  1. Prefixation of Simplex Pairs in Czech: An Analysis of Spatial Semantics, Distributive Verbs, and Procedural Meanings

    ERIC Educational Resources Information Center

    Hilchey, Christian Thomas

    2014-01-01

    This dissertation examines prefixation of simplex pairs. A simplex pair consists of an iterative imperfective and a semelfactive perfective verb. When prefixed, both of these verbs are perfective. The prefixed forms derived from semelfactives are labeled single act verbs, while the prefixed forms derived from iterative imperfective simplex verbs…

  2. Transient neuropathic bladder following herpes simplex genitalis.

    PubMed

    Riehle, R A; Williams, J J

    1979-08-01

    A case of transient bladder dysfunction and urinary retention concomitant with herpes genitalis is presented. The protean manifestations of the herpes simplex virus, the similar neurotropic behavior of simplex and zoster, and the neurologic sequelae of the cutaneous simplex eruption are discussed. The possibility of sacral radiculopathy after herpes genitalis must be considered when evaluating acute or episodic neurogenic bladders.

  3. Herpes simplex virus following stab phlebectomy.

    PubMed

    Hicks, Caitlin W; Lum, Ying Wei; Heller, Jennifer A

    2017-03-01

    Herpes simplex virus infection following surgery is an unusual postoperative phenomenon. Many mechanisms have been suggested, with the most likely explanation related to latent virus reactivation due to a proinflammatory response in the setting of local trauma. Here, we present a case of herpes simplex virus reactivation in an immunocompetent female following a conventional right lower extremity stab phlebectomy. Salient clinical and physical examination findings are described, and management strategies for herpes simplex virus reactivation are outlined. This is the first known case report of herpes simplex virus reactivation following lower extremity phlebectomy.

  4. Inactivation of Herpes Simplex Viruses by Nonionic Surfactants

    PubMed Central

    Asculai, Samuel S.; Weis, Margaret T.; Rancourt, Martha W.; Kupferberg, A. B.

    1978-01-01

    Nonionic surface-active agents possessing ether or amide linkages between the hydrophillic and hydrophobic portions of the molecule rapidly inactivated the infectivity of herpes simplex viruses. The activity stemmed from the ability of nonionic surfactants to dissolve lipid-containing membranes. This was confirmed by observing surfactant destruction of mammalian cell plasma membranes and herpes simplex virus envelopes. Proprietary vaginal contraceptive formulations containing nonionic surfactants also inactivated herpes simplex virus infectivity. This observation suggests that nonionic surfactants in appropriate formulation could effectively prevent herpes simplex virus transmission. Images PMID:208460

  5. Triggered instabilities in rocket motors and active combustion control for an incinerator afterburner

    NASA Astrophysics Data System (ADS)

    Wicker, Josef M.

    1999-11-01

    Two branches of research are conducted in this thesis. The first deals with nonlinear combustion response as a mechanism for triggering combustion instabilities in solid rocket motors. A nonlinear wave equation is developed to study a wide class of combustion response functions to second-order in fluctuation amplitude. Conditions for triggering are derived from analysis of limit cycles, and regions of triggering are found in parametric space. Introduction of linear cross-coupling and quadratic self-coupling among the acoustic modes appears to be how the nonlinear combustion response produces triggering to a stable limit cycle. Regions of initial conditions corresponding to stable pulses were found, suggesting that stability depends on initial phase angle and harmonic content, as well as the composite amplitude, of the pulse. Also, dependence of nonlinear stability upon system parameters is considered. The second part of this thesis presents research for a controller to improve the emissions of an incinerator afterburner. The developed controller was experimentally tested at the Naval Air Warfare Center (NAWC), on a 50kW-scale model of an afterburner for Naval shipboard incinerator applications. Acoustic forcing of the combustor's reacting shear layer is used to control the formation of coherent vortical structures, within which favorable fuel-air mixing and efficient combustion can occur. Laser-based measurements of CO emissions are used as the performance indicator for the combustor. The controller algorithm is based on the downhill simplex method and adjusts the shear layer forcing parameters in order to minimize the CO emissions. The downhill simplex method was analyzed with respect to its behavior in the face of time-variation of the plant and noise in the sensor signal, and was modified to account for these difficulties. The control system has experimentally demonstrated the ability (1) to find optimal control action for single- and multi-variable control, (2) to maintain optimal control for time-varying operating states, and (3) to automatically adjust auxiliary fuel in response to changing stoichiometry of the incoming waste pyrolysis gas. Also presented but not tested in the experiments are an expert-type model-guidance feature to aid convergence of the controller to optimum control, and methodology for maintaining flammability.

  6. An efficient algorithm for generating diverse microstructure sets and delineating properties closures

    DOE PAGES

    Johnson, Oliver K.; Kurniawan, Christian

    2018-02-03

    Properties closures delineate the theoretical objective space for materials design problems, allowing designers to make informed trade-offs between competing constraints and target properties. In this paper, we present a new algorithm called hierarchical simplex sampling (HSS) that approximates properties closures more efficiently and faithfully than traditional optimization based approaches. By construction, HSS generates samples of microstructure statistics that span the corresponding microstructure hull. As a result, we also find that HSS can be coupled with synthetic polycrystal generation software to generate diverse sets of microstructures for subsequent mesoscale simulations. Finally, by more broadly sampling the space of possible microstructures, itmore » is anticipated that such diverse microstructure sets will expand our understanding of the influence of microstructure on macroscale effective properties and inform the construction of higher-fidelity mesoscale structure-property models.« less

  7. An efficient algorithm for generating diverse microstructure sets and delineating properties closures

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Johnson, Oliver K.; Kurniawan, Christian

    Properties closures delineate the theoretical objective space for materials design problems, allowing designers to make informed trade-offs between competing constraints and target properties. In this paper, we present a new algorithm called hierarchical simplex sampling (HSS) that approximates properties closures more efficiently and faithfully than traditional optimization based approaches. By construction, HSS generates samples of microstructure statistics that span the corresponding microstructure hull. As a result, we also find that HSS can be coupled with synthetic polycrystal generation software to generate diverse sets of microstructures for subsequent mesoscale simulations. Finally, by more broadly sampling the space of possible microstructures, itmore » is anticipated that such diverse microstructure sets will expand our understanding of the influence of microstructure on macroscale effective properties and inform the construction of higher-fidelity mesoscale structure-property models.« less

  8. DD3MAT - a code for yield criteria anisotropy parameters identification.

    NASA Astrophysics Data System (ADS)

    Barros, P. D.; Carvalho, P. D.; Alves, J. L.; Oliveira, M. C.; Menezes, L. F.

    2016-08-01

    This work presents the main strategies and algorithms adopted in the DD3MAT inhouse code, specifically developed for identifying the anisotropy parameters. The algorithm adopted is based on the minimization of an error function, using a downhill simplex method. The set of experimental values can consider yield stresses and r -values obtained from in-plane tension, for different angles with the rolling direction (RD), yield stress and r -value obtained for biaxial stress state, and yield stresses from shear tests performed also for different angles to RD. All these values can be defined for a specific value of plastic work. Moreover, it can also include the yield stresses obtained from in-plane compression tests. The anisotropy parameters are identified for an AA2090-T3 aluminium alloy, highlighting the importance of the user intervention to improve the numerical fit.

  9. Tranylcypromine Reduces Herpes Simplex Virus 1 Infection in Mice

    PubMed Central

    Yao, Hui-Wen; Lin, Pin-Hung; Shen, Fang-Hsiu; Perng, Guey-Chuen; Tung, Yuk-Ying

    2014-01-01

    Herpes simplex virus 1 (HSV-1) infects the majority of the human population and establishes latency by maintaining viral genomes in neurons of sensory ganglia. Latent virus can undergo reactivation to cause recurrent infection. Both primary and recurrent infections can cause devastating diseases, including encephalitis and corneal blindness. Acyclovir is used to treat patients, but virus resistance to acyclovir is frequently reported. Recent in vitro findings reveal that pretreatment of cells with tranylcypromine (TCP), a drug widely used in the clinic to treat neurological disorders, restrains HSV-1 gene transcription by inhibiting the histone-modifying enzyme lysine-specific demethylase 1. The present study was designed to examine the anti-HSV-1 efficacy of TCP in vivo because of the paucity of reports on this issue. Using the murine model, we found that TCP decreased the severity of wild-type-virus-induced encephalitis and corneal blindness, infection with the acyclovir-resistant (thymidine kinase-negative) HSV-1 mutant, and tissue viral loads. Additionally, TCP blocked in vivo viral reactivation in trigeminal ganglia. These results support the therapeutic potential of TCP for controlling HSV-1 infection. PMID:24590478

  10. The contribution of de novo coding mutations to autism spectrum disorder

    PubMed Central

    Iossifov, Ivan; O’Roak, Brian J.; Sanders, Stephan J.; Ronemus, Michael; Krumm, Niklas; Levy, Dan; Stessman, Holly A.; Witherspoon, Kali; Vives, Laura; Patterson, Karynne E.; Smith, Joshua D.; Paeper, Bryan; Nickerson, Deborah A.; Dea, Jeanselle; Dong, Shan; Gonzalez, Luis E.; Mandell, Jefferey D.; Mane, Shrikant M.; Murtha, Michael T.; Sullivan, Catherine A.; Walker, Michael F.; Waqar, Zainulabedin; Wei, Liping; Willsey, A. Jeremy; Yamrom, Boris; Lee, Yoon-ha; Grabowska, Ewa; Dalkic, Ertugrul; Wang, Zihua; Marks, Steven; Andrews, Peter; Leotta, Anthony; Kendall, Jude; Hakker, Inessa; Rosenbaum, Julie; Ma, Beicong; Rodgers, Linda; Troge, Jennifer; Narzisi, Giuseppe; Yoon, Seungtai; Schatz, Michael C.; Ye, Kenny; McCombie, W. Richard; Shendure, Jay; Eichler, Evan E.; State, Matthew W.; Wigler, Michael

    2015-01-01

    We sequenced exomes from more than 2,500 simplex families each having a child with an autistic spectrum disorder (ASD). By comparing affected to unaffected siblings, we estimate that 13% of de novo (DN) missense mutations and 42% of DN likely gene-disrupting (LGD) mutations contribute to 12% and 9% of diagnoses, respectively. Including copy number variants, coding DN mutations contribute to about 30% of all simplex and 45% of female diagnoses. Virtually all LGD mutations occur opposite wild-type alleles. LGD targets in affected females significantly overlap the targets in males of lower IQ, but neither overlaps significantly with targets in males of higher IQ. We estimate that LGD mutation in about 400 genes can contribute to the joint class of affected females and males of lower IQ, with an overlapping and similar number of genes vulnerable to causative missense mutation. LGD targets in the joint class overlap with published targets for intellectual disability and schizophrenia, and are enriched for chromatin modifiers, FMRP-associated genes and embryonically expressed genes. Virtually all significance for the latter comes from affected females. PMID:25363768

  11. Modified multiblock partial least squares path modeling algorithm with backpropagation neural networks approach

    NASA Astrophysics Data System (ADS)

    Yuniarto, Budi; Kurniawan, Robert

    2017-03-01

    PLS Path Modeling (PLS-PM) is different from covariance based SEM, where PLS-PM use an approach based on variance or component, therefore, PLS-PM is also known as a component based SEM. Multiblock Partial Least Squares (MBPLS) is a method in PLS regression which can be used in PLS Path Modeling which known as Multiblock PLS Path Modeling (MBPLS-PM). This method uses an iterative procedure in its algorithm. This research aims to modify MBPLS-PM with Back Propagation Neural Network approach. The result is MBPLS-PM algorithm can be modified using the Back Propagation Neural Network approach to replace the iterative process in backward and forward step to get the matrix t and the matrix u in the algorithm. By modifying the MBPLS-PM algorithm using Back Propagation Neural Network approach, the model parameters obtained are relatively not significantly different compared to model parameters obtained by original MBPLS-PM algorithm.

  12. Unusual Clinical Presentation and Role of Decompressive Craniectomy in Herpes Simplex Encephalitis.

    PubMed

    Singhi, Pratibha; Saini, Arushi Gahlot; Sahu, Jitendra Kumar; Kumar, Nuthan; Vyas, Sameer; Vasishta, Rakesh Kumar; Aggarwal, Ashish

    2015-08-01

    Decompressive craniectomy in pediatric central nervous infections with refractory intracranial hypertension is less commonly practiced. We describe improved outcome of decompressive craniectomy in a 7-year-old boy with severe herpes simplex encephalitis and medically refractory intracranial hypertension, along with a brief review of the literature. Timely recognition of refractory intracranial hypertension and surgical decompression in children with herpes simplex encephalitis can be life-saving. Additionally, strokelike atypical presentations are being increasingly recognized in children with herpes simplex encephalitis and should not take one away from the underlying herpes simplex encephalitis. © The Author(s) 2014.

  13. Genetics Home Reference: epidermolysis bullosa simplex

    MedlinePlus

    ... of epidermolysis bullosa simplex . Mutations in another gene, PLEC , have been associated with the rare Ogna type of epidermolysis bullosa simplex . The PLEC gene provides instructions for making a protein called ...

  14. A Modified Mean Gray Wolf Optimization Approach for Benchmark and Biomedical Problems.

    PubMed

    Singh, Narinder; Singh, S B

    2017-01-01

    A modified variant of gray wolf optimization algorithm, namely, mean gray wolf optimization algorithm has been developed by modifying the position update (encircling behavior) equations of gray wolf optimization algorithm. The proposed variant has been tested on 23 standard benchmark well-known test functions (unimodal, multimodal, and fixed-dimension multimodal), and the performance of modified variant has been compared with particle swarm optimization and gray wolf optimization. Proposed algorithm has also been applied to the classification of 5 data sets to check feasibility of the modified variant. The results obtained are compared with many other meta-heuristic approaches, ie, gray wolf optimization, particle swarm optimization, population-based incremental learning, ant colony optimization, etc. The results show that the performance of modified variant is able to find best solutions in terms of high level of accuracy in classification and improved local optima avoidance.

  15. The "Knife-Cut Sign" Revisited: A Distinctive Presentation of Linear Erosive Herpes Simplex Virus Infection in Immunocompromised Patients.

    PubMed

    Cohen, Philip R

    2015-10-01

    The "knife-cut sign" is a distinctive presentation of linear erosive herpes simplex virus infection in immunocompromised patients. To describe a man whose herpes simplex virus infection-related skin lesions demonstrated the "knife-cut sign" and to review the characteristics of reported immunosuppressed individuals with "knife-cut" cutaneous herpes simplex virus lesions. A man with multiple myeloma and post-stem cell transplant cutaneous graft-versus-host disease managed with systemic prednisone and sirolimus developed disseminated cutaneous herpes simplex virus infection with virus-associated linear ulcers of the inguinal folds and the area between his ear and scalp; the lesions at both sites had a distinctive "knife-cut" appearance. Using the PubMed database, an extensive literature search was performed on herpes simplex virus, immunocompromised patient, and "knife-cut sign". Herpes simplex virus infection-associated skin lesions that demonstrate the "knife-cut sign" present in patients who are immunosuppressed secondary to either an underlying medical condition or a systemic therapy or both. The distinctive virus-related cutaneous lesions appear as linear ulcers and fissures in intertriginous areas, such as the folds in the inguinal area, the vulva, and the abdomen; in addition, other sites include beneath the breast, within the gluteal cleft, and the area between the ear and the scalp. Not only herpes simplex virus-2, but also herpes simplex virus-1 has been observed as the causative viral serotype; indeed, herpes simplex virus-1 has been associated with genital and inframammary lesions in addition to those above the neck. Direct fluorescent antibody testing is a rapid method for confirming the clinically suspected viral infection; however, since false-negative direct fluorescent antibody testing occurred in some of the patients, it may be prudent to also perform viral cultures and possibly lesional skin biopsies to establish the diagnosis. The herpes simplex virus infection-related skin lesions clinically improve once systemic antiviral therapy is initiated. In immunosuppressed individuals, the "knife-cut sign" is a distinctive presentation of cutaneous linear erosive herpes simplex virus infection. Recognition of the linear ulcers in intertriginous areas and body folds should prompt the clinician to consider herpes simplex virus infection-associated skin lesions in an immunocompromised patient and to initiate systemic antiviral treatment while awaiting the results of laboratory evaluation to confirm the suspected diagnosis.

  16. Concomitant herpes simplex virus colitis and hepatitis in a man with ulcerative colitis: Case report and review of the literature.

    PubMed

    Phadke, Varun K; Friedman-Moraco, Rachel J; Quigley, Brian C; Farris, Alton B; Norvell, J P

    2016-10-01

    Herpesvirus infections often complicate the clinical course of patients with inflammatory bowel disease; however, invasive disease due to herpes simplex virus is distinctly uncommon. We present a case of herpes simplex virus colitis and hepatitis, review all the previously published cases of herpes simplex virus colitis, and discuss common clinical features and outcomes. We also discuss the epidemiology, clinical manifestations, diagnosis, and management of herpes simplex virus infections, focusing specifically on patients with inflammatory bowel disease. A 43-year-old man with ulcerative colitis, previously controlled with an oral 5-aminosalicylic agent, developed symptoms of a colitis flare that did not respond to treatment with systemic corticosteroid therapy. One week later he developed orolabial ulcers and progressive hepatic dysfunction, with markedly elevated transaminases and coagulopathy. He underwent emergent total colectomy when imaging suggested bowel micro-perforation. Pathology from both the colon and liver was consistent with herpes simplex virus infection, and a viral culture of his orolabial lesions and a serum polymerase chain reaction assay also identified herpes simplex virus. He was treated with systemic antiviral therapy and made a complete recovery. Disseminated herpes simplex virus infection with concomitant involvement of the colon and liver has been reported only 3 times in the published literature, and to our knowledge this is the first such case in a patient with inflammatory bowel disease. The risk of invasive herpes simplex virus infections increases with some, but not all immunomodulatory therapies. Optimal management of herpes simplex virus in patients with inflammatory bowel disease includes targeted prophylactic therapy for patients with evidence of latent infection, and timely initiation of antiviral therapy for those patients suspected to have invasive disease.

  17. Concomitant herpes simplex virus colitis and hepatitis in a man with ulcerative colitis

    PubMed Central

    Phadke, Varun K.; Friedman-Moraco, Rachel J.; Quigley, Brian C.; Farris, Alton B.; Norvell, J. P.

    2016-01-01

    Abstract Background: Herpesvirus infections often complicate the clinical course of patients with inflammatory bowel disease; however, invasive disease due to herpes simplex virus is distinctly uncommon. Methods: We present a case of herpes simplex virus colitis and hepatitis, review all the previously published cases of herpes simplex virus colitis, and discuss common clinical features and outcomes. We also discuss the epidemiology, clinical manifestations, diagnosis, and management of herpes simplex virus infections, focusing specifically on patients with inflammatory bowel disease. Results: A 43-year-old man with ulcerative colitis, previously controlled with an oral 5-aminosalicylic agent, developed symptoms of a colitis flare that did not respond to treatment with systemic corticosteroid therapy. One week later he developed orolabial ulcers and progressive hepatic dysfunction, with markedly elevated transaminases and coagulopathy. He underwent emergent total colectomy when imaging suggested bowel micro-perforation. Pathology from both the colon and liver was consistent with herpes simplex virus infection, and a viral culture of his orolabial lesions and a serum polymerase chain reaction assay also identified herpes simplex virus. He was treated with systemic antiviral therapy and made a complete recovery. Conclusions: Disseminated herpes simplex virus infection with concomitant involvement of the colon and liver has been reported only 3 times in the published literature, and to our knowledge this is the first such case in a patient with inflammatory bowel disease. The risk of invasive herpes simplex virus infections increases with some, but not all immunomodulatory therapies. Optimal management of herpes simplex virus in patients with inflammatory bowel disease includes targeted prophylactic therapy for patients with evidence of latent infection, and timely initiation of antiviral therapy for those patients suspected to have invasive disease. PMID:27759636

  18. Numerical modeling of the transmission dynamics of drug-sensitive and drug-resistant HSV-2

    NASA Astrophysics Data System (ADS)

    Gumel, A. B.

    2001-03-01

    A competitive finite-difference method will be constructed and used to solve a modified deterministic model for the spread of herpes simplex virus type-2 (HSV-2) within a given population. The model monitors the transmission dynamics and control of drug-sensitive and drug-resistant HSV-2. Unlike the fourth-order Runge-Kutta method (RK4), which fails when the discretization parameters exceed certain values, the novel numerical method to be developed in this paper gives convergent results for all parameter values.

  19. Dye-sensitized solar cell with energy storage function through PVDF/ZnO nanocomposite counter electrode.

    PubMed

    Zhang, Xi; Huang, Xuezhen; Li, Chensha; Jiang, Hongrui

    2013-08-14

    Dye-sensitized solar cells with an energy storage function are demonstrated by modifying its counter electrode with a poly (vinylidene fluoride)/ZnO nanowire array composite. This simplex device could still function as an ordinary solar cell with a steady photocurrent output even after being fully charged. An energy storage density of 2.14 C g(-1) is achieved, while simultaneously a 3.70% photo-to-electric conversion efficiency is maintained. Copyright © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  20. Antiviral Activities of Honey, Royal Jelly, and Acyclovir Against HSV-1.

    PubMed

    Hashemipour, Maryam Alsadat; Tavakolineghad, Zahra; Arabzadeh, Sayed Ali Mohammad; Iranmanesh, Zahra; Nassab, Sayed Amir Hossein Gandjalikhan

    2014-02-01

    Herpes simplex virus type 1 (HSV-1) belongs to the Herpesviridae family and genus simplex virus. This virus is usually acquired during childhood and is transmitted through direct mucocutaneous contact or droplet infection from infected secretions. The aim of the present study was to compare antiviral effects of honey, royal jelly, and acyclovir on herpes simplex virus-1 in an extra-somatic environment. Vero cells were cultured in the Dulbecco's Modified Eagle's Medium (DMEM) along with 10% fetal bovine serum (FBS) in 12-welled microplates. Various dilutions of honey, royal jelly, and acyclovir (5, 10, 50, 100, 2500, 500, and 800 μg/mL) were added to the Vero cells along with a 100-virus concentration of TCID50. The plaque assay technique was used to evaluate the antiviral activities. The results showed that honey, royal jelly, and acyclovir have the highest inhibitory effects on HSV-1 at concentrations of 500, 250, and 100 μg/mL, respectively. In addition, honey, royal jelly, and acyclovir decreased the viral load from 70 795 to 43.3, 30, and 0 PFU/mL at a concentration of 100 μg/mL, respectively. The results of the present study showed that honey and royal jelly, which are natural products with no reports about their deleterious effect at least in laboratory conditions, can be considered alternatives to acyclovir in the treatment of herpetic lesions. However, it should be pointed out that further studies are necessary to substantiate their efficacy because hard evidence on their effectiveness is not available at present.

  1. Granulomatous herpes simplex encephalitis in an infant with multicystic encephalopathy: a distinct clinicopathologic entity?

    PubMed

    Schutz, Peter W; Fauth, Clarissa T; Al-Rawahi, Ghada N; Pugash, Denise; White, Valerie A; Stockler, Sylvia; Dunham, Christopher P

    2014-04-01

    Herpes simplex virus encephalitis can manifest as a range of clinical presentations including classic adult, neonatal, and biphasic chronic-granulomatous herpes encephalitis. We report an infant with granulomatous herpes simplex virus type 2 encephalitis with a subacute course and multicystic encephalopathy. A 2-month-old girl presented with lethargy and hypothermia. Computed tomography scan of the head showed multicystic encephalopathy and calcifications. Cerebrospinal fluid analysis by polymerase chain reaction testing for herpes simplex virus 1 and 2, enterovirus, and cytomegalovirus was negative. Normal cerebrospinal fluid interferon-α levels argued against Aicardi-Goutières syndrome. The patient died 2 weeks after presentation. At autopsy, multicystic encephalopathy was confirmed with bilateral gliosis, granulomatous inflammation with multinucleated giant cells, and calcifications. Bilateral healing necrotizing retinitis suggested a viral etiology, but retina and brain were free of viral inclusions and immunohistochemically negative for herpes simplex virus-2 and cytomegalovirus. However, polymerase chain reaction analysis showed herpes simplex virus-2 DNA in four cerebral paraffin blocks. Subsequent repeat testing of the initial cerebrospinal fluid sample using a different polymerase chain reaction assay was weakly positive for herpes simplex virus-2 DNA. Granulomatous herpes simplex virus encephalitis in infants can present with subacute course and result in multicystic encephalopathy with mineralization and minimal cerebrospinal fluid herpes simplex virus DNA load. Infectious etiologies should be carefully investigated in the differential diagnosis of multicystic encephalopathy with mineralization, in particular if multinucleated giant cells are present. Copyright © 2014 Elsevier Inc. All rights reserved.

  2. A Fusogenic Oncolytic Herpes Simplex Virus for Therapy of Advanced Ovarian Cancer

    DTIC Science & Technology

    2006-06-01

    killer and NKT cells play a critical role in innate protection against genital herpes simplex virus type 2 infection. J Virol 2003;77:10168-71. 8...AD_________________ Award Number: DAMD17-03-1-0434 TITLE: A Fusogenic Oncolytic Herpes Simplex...CONTRACT NUMBER A Fusogenic Oncolytic Herpes Simplex Virus for Therapy of Advanced Ovarian Cancer 5b. GRANT NUMBER DAMD17-03-1-0434 5c

  3. Asteroid mass estimation using Markov-chain Monte Carlo

    NASA Astrophysics Data System (ADS)

    Siltala, Lauri; Granvik, Mikael

    2017-11-01

    Estimates for asteroid masses are based on their gravitational perturbations on the orbits of other objects such as Mars, spacecraft, or other asteroids and/or their satellites. In the case of asteroid-asteroid perturbations, this leads to an inverse problem in at least 13 dimensions where the aim is to derive the mass of the perturbing asteroid(s) and six orbital elements for both the perturbing asteroid(s) and the test asteroid(s) based on astrometric observations. We have developed and implemented three different mass estimation algorithms utilizing asteroid-asteroid perturbations: the very rough 'marching' approximation, in which the asteroids' orbital elements are not fitted, thereby reducing the problem to a one-dimensional estimation of the mass, an implementation of the Nelder-Mead simplex method, and most significantly, a Markov-chain Monte Carlo (MCMC) approach. We describe each of these algorithms with particular focus on the MCMC algorithm, and present example results using both synthetic and real data. Our results agree with the published mass estimates, but suggest that the published uncertainties may be misleading as a consequence of using linearized mass-estimation methods. Finally, we discuss remaining challenges with the algorithms as well as future plans.

  4. Method of modifying a volume mesh using sheet insertion

    DOEpatents

    Borden, Michael J [Albuquerque, NM; Shepherd, Jason F [Albuquerque, NM

    2006-08-29

    A method and machine-readable medium provide a technique to modify a hexahedral finite element volume mesh using dual generation and sheet insertion. After generating a dual of a volume stack (mesh), a predetermined algorithm may be followed to modify (refine) the volume mesh of hexahedral elements. The predetermined algorithm may include the steps of locating a sheet of hexahedral mesh elements, determining a plurality of hexahedral elements within the sheet to refine, shrinking the plurality of elements, and inserting a new sheet of hexahedral elements adjacently to modify the volume mesh. Additionally, another predetermined algorithm using mesh cutting may be followed to modify a volume mesh.

  5. Identification of inelastic parameters based on deep drawing forming operations using a global-local hybrid Particle Swarm approach

    NASA Astrophysics Data System (ADS)

    Vaz, Miguel; Luersen, Marco A.; Muñoz-Rojas, Pablo A.; Trentin, Robson G.

    2016-04-01

    Application of optimization techniques to the identification of inelastic material parameters has substantially increased in recent years. The complex stress-strain paths and high nonlinearity, typical of this class of problems, require the development of robust and efficient techniques for inverse problems able to account for an irregular topography of the fitness surface. Within this framework, this work investigates the application of the gradient-based Sequential Quadratic Programming method, of the Nelder-Mead downhill simplex algorithm, of Particle Swarm Optimization (PSO), and of a global-local PSO-Nelder-Mead hybrid scheme to the identification of inelastic parameters based on a deep drawing operation. The hybrid technique has shown to be the best strategy by combining the good PSO performance to approach the global minimum basin of attraction with the efficiency demonstrated by the Nelder-Mead algorithm to obtain the minimum itself.

  6. Rapid optimization of tension distribution for cable-driven parallel manipulators with redundant cables

    NASA Astrophysics Data System (ADS)

    Ouyang, Bo; Shang, Weiwei

    2016-03-01

    The solution of tension distributions is infinite for cable-driven parallel manipulators(CDPMs) with redundant cables. A rapid optimization method for determining the optimal tension distribution is presented. The new optimization method is primarily based on the geometry properties of a polyhedron and convex analysis. The computational efficiency of the optimization method is improved by the designed projection algorithm, and a fast algorithm is proposed to determine which two of the lines are intersected at the optimal point. Moreover, a method for avoiding the operating point on the lower tension limit is developed. Simulation experiments are implemented on a six degree-of-freedom(6-DOF) CDPM with eight cables, and the results indicate that the new method is one order of magnitude faster than the standard simplex method. The optimal distribution of tension distribution is thus rapidly established on real-time by the proposed method.

  7. Hexagonal-shaped chondroitin sulfate self-assemblies have exalted anti-HSV-2 activity.

    PubMed

    Galus, Aurélia; Mallet, Jean-Maurice; Lembo, David; Cagno, Valeria; Djabourov, Madeleine; Lortat-Jacob, Hugues; Bouchemal, Kawthar

    2016-01-20

    The initial step in mucosal infection by the herpes simplex virus type 2 (HSV-2) requires its binding to certain glycosaminoglycans naturally present on host cell membranes. We took advantage of this interaction to design biomimetic supramolecular hexagonal-shaped nanoassemblies composed of chondroitin sulfate having exalted anti-HSV-2 activity in comparison with native chondroitin sulfate. Nanoassemblies were formed by mixing hydrophobically-modified chondroitin sulfate with α-cyclodextrin in water. Optimization of alkyl chain length grafted on chondroitin sulfate and the ratio between hydrophobically-modified chondroitin sulfate and α-cyclodextrin showed that more cohesive and well-structured nanoassemblies were obtained using higher α-cyclodextrin concentration and longer alkyl chain lengths. A structure-activity relationship was found between anti-HSV-2 activity and the amphiphilic nature of hydrophobically-modified chondroitin sulfate. Also, antiviral activity of hexagonal nanoassemblies against HSV-2 was further improved in comparison with hydrophobically-modified chondroitin sulfate. This work suggests a new biomimetic formulation approach that can be extended to other heparan-sulfate-dependent viruses. Copyright © 2015 Elsevier Ltd. All rights reserved.

  8. Evaluating nodes importance in complex network based on PageRank algorithm

    NASA Astrophysics Data System (ADS)

    Li, Kai; He, Yongfeng

    2018-04-01

    To evaluate the important nodes in the complex network, and aim at the problems existing in the traditional PageRank algorithm, we propose a modified PageRank algorithm. The algorithm has convergence for the evaluation of the importance of the suspended nodes and the nodes with a directed loop network. The simulation example shows the effectiveness of the modified algorithm for the evaluation of the complexity of the complex network nodes.

  9. SMI adaptive antenna arrays for weak interfering signals

    NASA Technical Reports Server (NTRS)

    Gupta, I. J.

    1987-01-01

    The performance of adaptive antenna arrays is studied when a sample matrix inversion (SMI) algorithm is used to control array weights. It is shown that conventional SMI adaptive antennas, like other adaptive antennas, are unable to suppress weak interfering signals (below thermal noise) encountered in broadcasting satellite communication systems. To overcome this problem, the SMI algorithm is modified. In the modified algorithm, the covariance matrix is modified such that the effect of thermal noise on the weights of the adaptive array is reduced. Thus, the weights are dictated by relatively weak coherent signals. It is shown that the modified algorithm provides the desired interference protection. The use of defocused feeds as auxiliary elements of an SMI adaptive array is also discussed.

  10. Expression of varicella-zoster virus and herpes simplex virus in normal human trigeminal ganglia

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Vafai, A.; Wellish, M.; Devlin, M.

    1988-04-01

    Lysates of radiolabeled explants from four human trigeminal ganglia were immunoprecipitated with antibodies to varicella-zoster virus (VZV) and to herpes simplex virus. Both herpes simplex virus- and VZV-specific proteins were detected in lysates of all four ganglia. Absence of reactivity in ganglion explants with monoclonal antibodies suggested that herpes simplex virus and VZV were not reactivated during the culture period. In situ hybridization studies demonstrated the presence of RNA transcripts from the VZV immediate early gene 63. This approach to the detection of herpes simplex virus and VZV expression in human ganglia should facilitate analysis of viral RNA and proteinsmore » in human sensory ganglia.« less

  11. SMI adaptive antenna arrays for weak interfering signals. [Sample Matrix Inversion

    NASA Technical Reports Server (NTRS)

    Gupta, Inder J.

    1986-01-01

    The performance of adaptive antenna arrays in the presence of weak interfering signals (below thermal noise) is studied. It is shown that a conventional adaptive antenna array sample matrix inversion (SMI) algorithm is unable to suppress such interfering signals. To overcome this problem, the SMI algorithm is modified. In the modified algorithm, the covariance matrix is redefined such that the effect of thermal noise on the weights of adaptive arrays is reduced. Thus, the weights are dictated by relatively weak signals. It is shown that the modified algorithm provides the desired interference protection.

  12. High-speed parallel implementation of a modified PBR algorithm on DSP-based EH topology

    NASA Astrophysics Data System (ADS)

    Rajan, K.; Patnaik, L. M.; Ramakrishna, J.

    1997-08-01

    Algebraic Reconstruction Technique (ART) is an age-old method used for solving the problem of three-dimensional (3-D) reconstruction from projections in electron microscopy and radiology. In medical applications, direct 3-D reconstruction is at the forefront of investigation. The simultaneous iterative reconstruction technique (SIRT) is an ART-type algorithm with the potential of generating in a few iterations tomographic images of a quality comparable to that of convolution backprojection (CBP) methods. Pixel-based reconstruction (PBR) is similar to SIRT reconstruction, and it has been shown that PBR algorithms give better quality pictures compared to those produced by SIRT algorithms. In this work, we propose a few modifications to the PBR algorithms. The modified algorithms are shown to give better quality pictures compared to PBR algorithms. The PBR algorithm and the modified PBR algorithms are highly compute intensive, Not many attempts have been made to reconstruct objects in the true 3-D sense because of the high computational overhead. In this study, we have developed parallel two-dimensional (2-D) and 3-D reconstruction algorithms based on modified PBR. We attempt to solve the two problems encountered by the PBR and modified PBR algorithms, i.e., the long computational time and the large memory requirements, by parallelizing the algorithm on a multiprocessor system. We investigate the possible task and data partitioning schemes by exploiting the potential parallelism in the PBR algorithm subject to minimizing the memory requirement. We have implemented an extended hypercube (EH) architecture for the high-speed execution of the 3-D reconstruction algorithm using the commercially available fast floating point digital signal processor (DSP) chips as the processing elements (PEs) and dual-port random access memories (DPR) as channels between the PEs. We discuss and compare the performances of the PBR algorithm on an IBM 6000 RISC workstation, on a Silicon Graphics Indigo 2 workstation, and on an EH system. The results show that an EH(3,1) using DSP chips as PEs executes the modified PBR algorithm about 100 times faster than an LBM 6000 RISC workstation. We have executed the algorithms on a 4-node IBM SP2 parallel computer. The results show that execution time of the algorithm on an EH(3,1) is better than that of a 4-node IBM SP2 system. The speed-up of an EH(3,1) system with eight PEs and one network controller is approximately 7.85.

  13. A double-blind, placebo-controlled oral challenge study with lyophilized larvae and antigen of the fish parasite, Anisakis simplex.

    PubMed

    Sastre, J; Lluch-Bernal, M; Quirce, S; Arrieta, I; Lahoz, C; Del Amo, A; Fernández-Caldas, E; Marañón, F

    2000-06-01

    The third-stage larvae of Anisakis simplex may be a hidden source of allergens in fish. The objective was to determine whether the ingestion of lyophilized A. simplex larvae, or antigen, induces clinical symptoms in a group of A. simplex-sensitized patients. Double-blind, placebo-controlled oral challenges were conducted in 11 individuals who had experienced allergic reactions after eating fish. Another patient had chronic urticaria unrelated to the ingestion of fish. All patients had positive skin tests and specific IgE determinations for A. simplex and negative skin tests to a battery of fish species. Conjunctival tests with A. simplex extracts were conducted in all patients and in five controls. The 12 patients received capsules containing either lactose or one, five, or 25 lyophilized larvae of A. simplex at 2-h intervals in a double-blind fashion. The highest single dose was 100 larvae. ECP and tryptase levels in serum were measured before and after the last oral challenge. Lyophilized antigen was also given to five patients. None of the 12 patients experienced a positive reaction after the ingestion of the placebo, the lyophilized larvae, or the antigen. Tryptase and ECP levels before and after challenges did not change significantly. Conjunctival provocation tests were positive in 11 out of the 12 patients and in none of the controls. The ingestion of 100 lyophilized A. simplex larvae, or its equivalent in antigen, does not induce clinical symptoms in individuals with a clinical history and laboratory findings of hypersensitivity to A. simplex. The data suggest that only the ingestion of live larvae may be capable of inducing allergic manifestations.

  14. The roles of the Q (q) wave in lead I and QRS frontal axis for diagnosing loss of left ventricular capture during cardiac resynchronization therapy.

    PubMed

    Cao, Yuan-Yuan; Su, Yan-Gang; Bai, Jin; Wang, Wei; Wang, Jing-Feng; Qin, Sheng-Mei; Ge, Jun-Bo

    2015-01-01

    Loss of left ventricular (LV) capture may lead to deterioration of heart failure in patients with cardiac resynchronization therapy (CRT). Recognition of loss of LV capture in time is important in clinical practice. A total of 422 electrocardiograms were acquired and analyzed from 53 CRT patients at 8 different pacing settings (LV only, right ventricle [RV] only, biventricular [BV] pacing with LV preactivation of 60, 40, 20, and 0 milliseconds and RV preactivation of 20 and 40 milliseconds). A modified Ammann algorithm by adding a third step-presence of Q (q, or QS) wave-to the original 2-step Ammann algorithm and a QRS axis shift method were devised to identify the loss of LV capture. The accuracy of modified Ammann algorithm was significantly higher than that of Ammann algorithm (78.9% vs. 69.1%, P < 0.001). The accuracy of the axis shift method was 66.4%, which was significantly lower than the modified Ammann algorithm (P < 0.001) and similar to the original one (P = 0.412). However, in the ECGs with QRS axis shift, 96.8% were correctly classified. LV preactivation or simultaneous BV activation and LV lead positioned in nonposterior or noninferior wall could elevate the accuracies of the modified Ammann algorithm and the QRS axis shift method. The accuracy of the modified Ammann algorithm is greatly improved. The QRS axis shift method can help diagnose LV capture. The LV preactivation, or simultaneous BV activation and LV lead positioned in nonposterior or noninferior wall can increase the diagnostic power of the modified Ammann algorithm and QRS axis shift method. © 2014 Wiley Periodicals, Inc.

  15. Mycosis inhibits cannibalism by Melanoplus sanguinipes, M. differentialis, Schistocerca americana, and Anabrus simplex

    USDA-ARS?s Scientific Manuscript database

    Cannibalism is common among the Acrididae and the Mormon cricket, Anabrus simplex, a tettigonid. These behaviors have been proposed as mechanisms for the horizontal transmission of Microsporida and entomopathogenic fungi. After anecdotal observations that Melanoplus sanguinipes and A. simplex did ...

  16. Application of an enhanced fuzzy algorithm for MR brain tumor image segmentation

    NASA Astrophysics Data System (ADS)

    Hemanth, D. Jude; Vijila, C. Kezi Selva; Anitha, J.

    2010-02-01

    Image segmentation is one of the significant digital image processing techniques commonly used in the medical field. One of the specific applications is tumor detection in abnormal Magnetic Resonance (MR) brain images. Fuzzy approaches are widely preferred for tumor segmentation which generally yields superior results in terms of accuracy. But most of the fuzzy algorithms suffer from the drawback of slow convergence rate which makes the system practically non-feasible. In this work, the application of modified Fuzzy C-means (FCM) algorithm to tackle the convergence problem is explored in the context of brain image segmentation. This modified FCM algorithm employs the concept of quantization to improve the convergence rate besides yielding excellent segmentation efficiency. This algorithm is experimented on real time abnormal MR brain images collected from the radiologists. A comprehensive feature vector is extracted from these images and used for the segmentation technique. An extensive feature selection process is performed which reduces the convergence time period and improve the segmentation efficiency. After segmentation, the tumor portion is extracted from the segmented image. Comparative analysis in terms of segmentation efficiency and convergence rate is performed between the conventional FCM and the modified FCM. Experimental results show superior results for the modified FCM algorithm in terms of the performance measures. Thus, this work highlights the application of the modified algorithm for brain tumor detection in abnormal MR brain images.

  17. Disparities in herpes simplex virus type 2 infection between black and white men who have sex with men in Atlanta, GA.

    PubMed

    Okafor, Netochukwu; Rosenberg, Eli S; Luisi, Nicole; Sanchez, Travis; del Rio, Carlos; Sullivan, Patrick S; Kelley, Colleen F

    2015-09-01

    HIV disproportionately affects black men who have sex with men, and herpes simplex virus type 2 is known to increase acquisition of HIV. However, data on racial disparities in herpes simplex virus type 2 prevalence and risk factors are limited among men who have sex with men in the United States. InvolveMENt was a cohort study of black and white HIV-negative men who have sex with men in Atlanta, GA. Univariate and multivariate cross-sectional associations with herpes simplex virus type 2 seroprevalence were assessed among 455 HIV-negative men who have sex with men for demographic, behavioural and social determinant risk factors using logistic regression. Seroprevalence of herpes simplex virus type 2 was 23% (48/211) for black and 16% (38/244) for white men who have sex with men (p = 0.05). Education, poverty, drug/alcohol use, incarceration, circumcision, unprotected anal intercourse, and condom use were not associated with herpes simplex virus type 2. In multivariate analyses, black race for those ≤25 years, but not >25 years, and number of sexual partners were significantly associated. Young black men who have sex with men are disproportionately affected by herpes simplex virus type 2, which may contribute to disparities in HIV acquisition. An extensive assessment of risk factors did not explain this disparity in herpes simplex virus type 2 infection suggesting differences in susceptibility or partner characteristics. © The Author(s) 2014.

  18. An Automated Energy Detection Algorithm Based on Morphological Filter Processing with a Modified Watershed Transform

    DTIC Science & Technology

    2018-01-01

    ARL-TR-8270 ● JAN 2018 US Army Research Laboratory An Automated Energy Detection Algorithm Based on Morphological Filter...Automated Energy Detection Algorithm Based on Morphological Filter Processing with a Modified Watershed Transform by Kwok F Tom Sensors and Electron...1 October 2016–30 September 2017 4. TITLE AND SUBTITLE An Automated Energy Detection Algorithm Based on Morphological Filter Processing with a

  19. Magnetic resonance imaging diffusion tensor tractography: evaluation of anatomic accuracy of different fiber tracking software packages.

    PubMed

    Feigl, Guenther C; Hiergeist, Wolfgang; Fellner, Claudia; Schebesch, Karl-Michael M; Doenitz, Christian; Finkenzeller, Thomas; Brawanski, Alexander; Schlaier, Juergen

    2014-01-01

    Diffusion tensor imaging (DTI)-based tractography has become an integral part of preoperative diagnostic imaging in many neurosurgical centers, and other nonsurgical specialties depend increasingly on DTI tractography as a diagnostic tool. The aim of this study was to analyze the anatomic accuracy of visualized white matter fiber pathways using different, readily available DTI tractography software programs. Magnetic resonance imaging scans of the head of 20 healthy volunteers were acquired using a Siemens Symphony TIM 1.5T scanner and a 12-channel head array coil. The standard settings of the scans in this study were 12 diffusion directions and 5-mm slices. The fornices were chosen as an anatomic structure for the comparative fiber tracking. Identical data sets were loaded into nine different fiber tracking packages that used different algorithms. The nine software packages and algorithms used were NeuroQLab (modified tensor deflection [TEND] algorithm), Sörensen DTI task card (modified streamline tracking technique algorithm), Siemens DTI module (modified fourth-order Runge-Kutta algorithm), six different software packages from Trackvis (interpolated streamline algorithm, modified FACT algorithm, second-order Runge-Kutta algorithm, Q-ball [FACT algorithm], tensorline algorithm, Q-ball [second-order Runge-Kutta algorithm]), DTI Query (modified streamline tracking technique algorithm), Medinria (modified TEND algorithm), Brainvoyager (modified TEND algorithm), DTI Studio modified FACT algorithm, and the BrainLab DTI module based on the modified Runge-Kutta algorithm. Three examiners (a neuroradiologist, a magnetic resonance imaging physicist, and a neurosurgeon) served as examiners. They were double-blinded with respect to the test subject and the fiber tracking software used in the presented images. Each examiner evaluated 301 images. The examiners were instructed to evaluate screenshots from the different programs based on two main criteria: (i) anatomic accuracy of the course of the displayed fibers and (ii) number of fibers displayed outside the anatomic boundaries. The mean overall grade for anatomic accuracy was 2.2 (range, 1.1-3.6) with a standard deviation (SD) of 0.9. The mean overall grade for incorrectly displayed fibers was 2.5 (range, 1.6-3.5) with a SD of 0.6. The mean grade of the overall program ranking was 2.3 with a SD of 0.6. The overall mean grade of the program ranked number one (NeuroQLab) was 1.7 (range, 1.5-2.8). The mean overall grade of the program ranked last (BrainLab iPlan Cranial 2.6 DTI Module) was 3.3 (range, 1.7-4). The difference between the mean grades of these two programs was statistically highly significant (P < 0.0001). There was no statistically significant difference between the programs ranked 1-3: NeuroQLab, Sörensen DTI Task Card, and Siemens DTI module. The results of this study show that there is a statistically significant difference in the anatomic accuracy of the tested DTI fiber tracking programs. Although incorrectly displayed fibers could lead to wrong conclusions in the neurosciences field, which relies heavily on this noninvasive imaging technique, incorrectly displayed fibers in neurosurgery could lead to surgical decisions potentially harmful for the patient if used without intraoperative cortical stimulation. DTI fiber tracking presents a valuable noninvasive preoperative imaging tool, which requires further validation after important standardization of the acquisition and processing techniques currently available. Copyright © 2014 Elsevier Inc. All rights reserved.

  20. Modified Shuffled Frog Leaping Optimization Algorithm Based Distributed Generation Rescheduling for Loss Minimization

    NASA Astrophysics Data System (ADS)

    Arya, L. D.; Koshti, Atul

    2018-05-01

    This paper investigates the Distributed Generation (DG) capacity optimization at location based on the incremental voltage sensitivity criteria for sub-transmission network. The Modified Shuffled Frog Leaping optimization Algorithm (MSFLA) has been used to optimize the DG capacity. Induction generator model of DG (wind based generating units) has been considered for study. Standard test system IEEE-30 bus has been considered for the above study. The obtained results are also validated by shuffled frog leaping algorithm and modified version of bare bones particle swarm optimization (BBExp). The performance of MSFLA has been found more efficient than the other two algorithms for real power loss minimization problem.

  1. Graphene-based room-temperature implementation of a modified Deutsch-Jozsa quantum algorithm.

    PubMed

    Dragoman, Daniela; Dragoman, Mircea

    2015-12-04

    We present an implementation of a one-qubit and two-qubit modified Deutsch-Jozsa quantum algorithm based on graphene ballistic devices working at room temperature. The modified Deutsch-Jozsa algorithm decides whether a function, equivalent to the effect of an energy potential distribution on the wave function of ballistic charge carriers, is constant or not, without measuring the output wave function. The function need not be Boolean. Simulations confirm that the algorithm works properly, opening the way toward quantum computing at room temperature based on the same clean-room technologies as those used for fabrication of very-large-scale integrated circuits.

  2. Semilinear programming: applications and implementation

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Mohan, S.

    Semilinear programming is a method of solving optimization problems with linear constraints where the non-negativity restrictions on the variables are dropped and the objective function coefficients can take on different values depending on whether the variable is positive or negative. The simplex method for linear programming is modified in this thesis to solve general semilinear and piecewise linear programs efficiently without having to transform them into equivalent standard linear programs. Several models in widely different areas of optimization such as production smoothing, facility locations, goal programming and L/sub 1/ estimation are presented first to demonstrate the compact formulation that arisesmore » when such problems are formulated as semilinear programs. A code SLP is constructed using the semilinear programming techniques. Problems in aggregate planning and L/sub 1/ estimation are solved using SLP and equivalent linear programs using a linear programming simplex code. Comparisons of CPU times and number iterations indicate SLP to be far superior. The semilinear programming techniques are extended to piecewise linear programming in the implementation of the code PLP. Piecewise linear models in aggregate planning are solved using PLP and equivalent standard linear programs using a simple upper bounded linear programming code SUBLP.« less

  3. Stabilising the Herpes Simplex Virus capsid by DNA packaging

    NASA Astrophysics Data System (ADS)

    Wuite, Gijs; Radtke, Kerstin; Sodeik, Beate; Roos, Wouter

    2009-03-01

    Three different types of Herpes Simplex Virus type 1 (HSV-1) nuclear capsids can be distinguished, A, B and C capsids. These capsids types are, respectively, empty, contain scaffold proteins, or hold DNA. We investigate the physical properties of these three capsids by combining biochemical and nanoindentation techniques. Atomic Force Microscopy (AFM) experiments show that A and C capsids are mechanically indistinguishable whereas B capsids already break at much lower forces. By extracting the pentamers with 2.0 M GuHCl or 6.0 M Urea we demonstrate an increased flexibility of all three capsid types. Remarkably, the breaking force of the B capsids without pentamers does not change, while the modified A and C capsids show a large drop in their breaking force to approximately the value of the B capsids. This result indicates that upon DNA packaging a structural change at or near the pentamers occurs which mechanically reinforces the capsids structure. The reported binding of proteins UL17/UL25 to the pentamers of the A and C capsids seems the most likely candidate for such capsids strengthening. Finally, the data supports the view that initiation of DNA packaging triggers the maturation of HSV-1 capsids.

  4. Identification of a novel higher molecular weight isoform of USP7/HAUSP that interacts with the Herpes simplex virus type-1 immediate early protein ICP0.

    PubMed

    Antrobus, Robin; Boutell, Chris

    2008-10-01

    The Herpes simplex virus type-1 (HSV-1) regulatory protein ICP0, a RING-finger E3 ubiquitin ligase, stimulates the onset of viral lytic replication and the reactivation of quiescent viral genomes from latency. Like many ubiquitin ligases ICP0 induces its own ubiquitination, a process that can lead to its proteasome-dependent degradation. ICP0 counteracts this activity by recruiting the cellular ubiquitin-specific protease USP7/HAUSP. Here we show that ICP0 can also interact with a previously unidentified isoform of USP7 (termed here USP7(beta)). This isoform is not a predominantly ubiquitinated, SUMO-modified, or phosphorylated species of USP7 but is constitutively expressed in a number of different cell types. Like USP7, USP7(beta) binds specifically to an electrophilic ubiquitin probe, indicating that it contains an accessible catalytic core with potential ubiquitin-protease activity. The interaction formed between ICP0 and USP7(beta) requires ICP0 to have an intact USP7-binding domain and results in its susceptibility to ICP0-mediated degradation during HSV-1 infection.

  5. The contribution of de novo coding mutations to autism spectrum disorder.

    PubMed

    Iossifov, Ivan; O'Roak, Brian J; Sanders, Stephan J; Ronemus, Michael; Krumm, Niklas; Levy, Dan; Stessman, Holly A; Witherspoon, Kali T; Vives, Laura; Patterson, Karynne E; Smith, Joshua D; Paeper, Bryan; Nickerson, Deborah A; Dea, Jeanselle; Dong, Shan; Gonzalez, Luis E; Mandell, Jeffrey D; Mane, Shrikant M; Murtha, Michael T; Sullivan, Catherine A; Walker, Michael F; Waqar, Zainulabedin; Wei, Liping; Willsey, A Jeremy; Yamrom, Boris; Lee, Yoon-ha; Grabowska, Ewa; Dalkic, Ertugrul; Wang, Zihua; Marks, Steven; Andrews, Peter; Leotta, Anthony; Kendall, Jude; Hakker, Inessa; Rosenbaum, Julie; Ma, Beicong; Rodgers, Linda; Troge, Jennifer; Narzisi, Giuseppe; Yoon, Seungtai; Schatz, Michael C; Ye, Kenny; McCombie, W Richard; Shendure, Jay; Eichler, Evan E; State, Matthew W; Wigler, Michael

    2014-11-13

    Whole exome sequencing has proven to be a powerful tool for understanding the genetic architecture of human disease. Here we apply it to more than 2,500 simplex families, each having a child with an autistic spectrum disorder. By comparing affected to unaffected siblings, we show that 13% of de novo missense mutations and 43% of de novo likely gene-disrupting (LGD) mutations contribute to 12% and 9% of diagnoses, respectively. Including copy number variants, coding de novo mutations contribute to about 30% of all simplex and 45% of female diagnoses. Almost all LGD mutations occur opposite wild-type alleles. LGD targets in affected females significantly overlap the targets in males of lower intelligence quotient (IQ), but neither overlaps significantly with targets in males of higher IQ. We estimate that LGD mutation in about 400 genes can contribute to the joint class of affected females and males of lower IQ, with an overlapping and similar number of genes vulnerable to contributory missense mutation. LGD targets in the joint class overlap with published targets for intellectual disability and schizophrenia, and are enriched for chromatin modifiers, FMRP-associated genes and embryonically expressed genes. Most of the significance for the latter comes from affected females.

  6. Novel measurement techniques (development and analysis of silicon solar cells near 20% effciency)

    NASA Technical Reports Server (NTRS)

    Wolf, M.; Newhouse, M.

    1986-01-01

    Work in identifying, developing, and analyzing techniques for measuring bulk recombination rates, and surface recombination velocities and rates in all regions of high-efficiency silicon solar cells is presented. The accuracy of the previously developed DC measurement system was improved by adding blocked interference filters. The system was further automated by writing software that completely samples the unkown solar cell regions with data of numerous recombination velocity and lifetime pairs. The results can be displayed in three dimensions and the best fit can be found numerically using the simplex minimization algorithm. Also described is a theoretical methodology to analyze and compare existing dynamic measurement techniques.

  7. A Comparison of Trajectory Optimization Methods for the Impulsive Minimum Fuel Rendezvous Problem

    NASA Technical Reports Server (NTRS)

    Hughes, Steven P.; Mailhe, Laurie M.; Guzman, Jose J.

    2002-01-01

    In this paper we present a comparison of optimization approaches to the minimum fuel rendezvous problem. Both indirect and direct methods are compared for a variety of test cases. The indirect approach is based on primer vector theory. The direct approaches are implemented numerically and include Sequential Quadratic Programming (SQP), Quasi-Newton, Simplex, Genetic Algorithms, and Simulated Annealing. Each method is applied to a variety of test cases including, circular to circular coplanar orbits, LEO to GEO, and orbit phasing in highly elliptic orbits. We also compare different constrained optimization routines on complex orbit rendezvous problems with complicated, highly nonlinear constraints.

  8. Novel measurement techniques (development and analysis of silicon solar cells near 20% effciency)

    NASA Astrophysics Data System (ADS)

    Wolf, M.; Newhouse, M.

    Work in identifying, developing, and analyzing techniques for measuring bulk recombination rates, and surface recombination velocities and rates in all regions of high-efficiency silicon solar cells is presented. The accuracy of the previously developed DC measurement system was improved by adding blocked interference filters. The system was further automated by writing software that completely samples the unkown solar cell regions with data of numerous recombination velocity and lifetime pairs. The results can be displayed in three dimensions and the best fit can be found numerically using the simplex minimization algorithm. Also described is a theoretical methodology to analyze and compare existing dynamic measurement techniques.

  9. Firefly algorithm for cardinality constrained mean-variance portfolio optimization problem with entropy diversity constraint.

    PubMed

    Bacanin, Nebojsa; Tuba, Milan

    2014-01-01

    Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem. This is especially true for swarm intelligence algorithms which represent the newer branch of nature-inspired algorithms. No application of any swarm intelligence metaheuristics to cardinality constrained mean-variance (CCMV) portfolio problem with entropy constraint was found in the literature. This paper introduces modified firefly algorithm (FA) for the CCMV portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results.

  10. Firefly Algorithm for Cardinality Constrained Mean-Variance Portfolio Optimization Problem with Entropy Diversity Constraint

    PubMed Central

    2014-01-01

    Portfolio optimization (selection) problem is an important and hard optimization problem that, with the addition of necessary realistic constraints, becomes computationally intractable. Nature-inspired metaheuristics are appropriate for solving such problems; however, literature review shows that there are very few applications of nature-inspired metaheuristics to portfolio optimization problem. This is especially true for swarm intelligence algorithms which represent the newer branch of nature-inspired algorithms. No application of any swarm intelligence metaheuristics to cardinality constrained mean-variance (CCMV) portfolio problem with entropy constraint was found in the literature. This paper introduces modified firefly algorithm (FA) for the CCMV portfolio model with entropy constraint. Firefly algorithm is one of the latest, very successful swarm intelligence algorithm; however, it exhibits some deficiencies when applied to constrained problems. To overcome lack of exploration power during early iterations, we modified the algorithm and tested it on standard portfolio benchmark data sets used in the literature. Our proposed modified firefly algorithm proved to be better than other state-of-the-art algorithms, while introduction of entropy diversity constraint further improved results. PMID:24991645

  11. The cancellous bone multiscale morphology-elasticity relationship.

    PubMed

    Agić, Ante; Nikolić, Vasilije; Mijović, Budimir

    2006-06-01

    The cancellous bone effective properties relations are analysed on multiscale across two aspects; properties of representative volume element on micro scale and statistical measure of trabecular trajectory orientation on mesoscale. Anisotropy of the microstructure is described across fabric tensor measure with trajectory orientation tensor as bridging scale connection. The scatter measured data (elastic modulus, trajectory orientation, apparent density) from compression test are fitted by stochastic interpolation procedure. The engineering constants of the elasticity tensor are estimated by last square fitt procedure in multidimensional space by Nelder-Mead simplex. The multiaxial failure surface in strain space is constructed and interpolated by modified super-ellipsoid.

  12. A new efficient mixture screening design for optimization of media.

    PubMed

    Rispoli, Fred; Shah, Vishal

    2009-01-01

    Screening ingredients for the optimization of media is an important first step to reduce the many potential ingredients down to the vital few components. In this study, we propose a new method of screening for mixture experiments called the centroid screening design. Comparison of the proposed design with Plackett-Burman, fractional factorial, simplex lattice design, and modified mixture design shows that the centroid screening design is the most efficient of all the designs in terms of the small number of experimental runs needed and for detecting high-order interaction among ingredients. (c) 2009 American Institute of Chemical Engineers Biotechnol. Prog., 2009.

  13. Two Aspects of the Simplex Model: Goodness of Fit to Linear Growth Curve Structures and the Analysis of Mean Trends.

    ERIC Educational Resources Information Center

    Mandys, Frantisek; Dolan, Conor V.; Molenaar, Peter C. M.

    1994-01-01

    Studied the conditions under which the quasi-Markov simplex model fits a linear growth curve covariance structure and determined when the model is rejected. Presents a quasi-Markov simplex model with structured means and gives an example. (SLD)

  14. Hydrocephalus in herpes simplex type 2 meningitis.

    PubMed

    Yap, Elaine; Ellis-Pegler, Rod

    2006-08-01

    A 34-year-old woman presented to hospital with symptoms of meningitis, later confirmed to be due to herpes simplex virus type 2. She developed hydrocephalus on day 2 of her admission. We describe the first case of hydrocephalus associated with herpes simplex type 2 meningitis in an adult.

  15. Optimization of the gypsum-based materials by the sequential simplex method

    NASA Astrophysics Data System (ADS)

    Doleželová, Magdalena; Vimmrová, Alena

    2017-11-01

    The application of the sequential simplex optimization method for the design of gypsum based materials is described. The principles of simplex method are explained and several examples of the method usage for the optimization of lightweight gypsum and ternary gypsum based materials are given. By this method lightweight gypsum based materials with desired properties and ternary gypsum based material with higher strength (16 MPa) were successfully developed. Simplex method is a useful tool for optimizing of gypsum based materials, but the objective of the optimization has to be formulated appropriately.

  16. Reactivation of latent herpes simplex virus infection by ultraviolet light: a human model

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Perna, J.J.; Mannix, M.L.; Rooney, J.F.

    1987-09-01

    Infection with herpes simplex virus often results in a latent infection of local sensory ganglia and a disease characterized by periodic viral reactivation and mucocutaneous lesions. The factors that trigger reactivation in humans are still poorly defined. In our study, five patients with documented histories of recurrent herpes simplex virus infection on the buttocks or sacrum were exposed to three times their minimal erythema dose of ultraviolet light. Site-specific cutaneous herpes simplex virus infection occurred at 4.4 +/- 0.4 days after exposure to ultraviolet light in 8 of 13 attempts at reactivation. We conclude that ultraviolet light can reactivate herpesmore » simplex virus under experimentally defined conditions. This model in humans should prove useful in evaluating the pathophysiology and prevention of viral reactivation.« less

  17. Reactivation of latent herpes simplex virus infection by ultraviolet light: a human model.

    PubMed

    Perna, J J; Mannix, M L; Rooney, J F; Notkins, A L; Straus, S E

    1987-09-01

    Infection with herpes simplex virus often results in a latent infection of local sensory ganglia and a disease characterized by periodic viral reactivation and mucocutaneous lesions. The factors that trigger reactivation in humans are still poorly defined. In our study, five patients with documented histories of recurrent herpes simplex virus infection on the buttocks or sacrum were exposed to three times their minimal erythema dose of ultraviolet light. Site-specific cutaneous herpes simplex virus infection occurred at 4.4 +/- 0.4 days after exposure to ultraviolet light in 8 of 13 attempts at reactivation. We conclude that ultraviolet light can reactivate herpes simplex virus under experimentally defined conditions. This model in humans should prove useful in evaluating the pathophysiology and prevention of viral reactivation.

  18. Expression of IFN-Inducible Genes with Antiviral Function OAS1 and MX1 in Health and under Conditions of Recurrent Herpes Simplex Infection.

    PubMed

    Karaulov, A V; Shulzhenko, A E; Karsonova, A V

    2017-07-01

    We studied the expression of IFN-inducible genes OAS1 and Mx1 in lysates of peripheral blood mononuclear cells from patients suffering from recurrent Herpes simplex infections in comparison with healthy people. To induce the expression of the studied genes, blood mononuclears were incubated with recombinant IFN-α2b in concentrations of 1, 10, and 100 U/ml for 3 h and then the content of the studied transcripts was evaluated. Relative expression of OAS1 and Mx1 in patients with recurrent forms of Herpes simplex both during the acute stage and clinical remission did not differ significantly from that in healthy people after stimulation with IFN-α2b in a concentration of 1 U/ml and in higher concentrations (10 and 100 U/ml). It was concluded that intracellular signal transduction in IFN-α-activated cells in vitro was not disturbed in patients with recurrent forms of Herpes simplex infection. Thus, the reported phenomenon of IFN-signalling distortion by Herpes simplex virus proteins observed in experiments on model cell lines infected with Herpes simplex virus was not confirmed in our experiments on peripheral blood mononuclear cells from patients with Herpes simplex infection.

  19. Psychosis in a 15-Year-Old Female with Herpes Simplex Encephalitis in a Background of Mannose-Binding Lecithin Deficiency.

    PubMed

    Asogwa, Kenneth; Buabeng, Kwame; Kaur, Amarjit

    2017-01-01

    Historically, psychotic disorder has been associated with viral infection. Herpes simplex infections and Epstein-Barr virus (EBV) among other viral infections have been implicated in psychotic disorder. Of note in this case report is psychotic disorder that occurred following reactivation of herpes simplex infection in a background of mannose-binding lecithin (MBL) deficiency, childhood EBV infection, and severe psychosocial stress. Herpes simplex encephalitis (HSE) remains a significant cause of morbidity and mortality despite advancement in its treatment with intravenous acyclovir. Many studies have reported psychiatric and neurological manifestation of herpes simplex infection following primary or reactivated infection, while others suggest milder clinical course of herpes simplex encephalitis in a background of immunosuppression. Another contributory factor to psychotic disorder in this case is childhood EBV exposure which has been reported to increase the risk of psychosis in adolescence and adulthood. This case report describes a 15-year-old female with MBL deficiency who presented with psychosis caused by reactivated herpes simplex infection and had good clinical recovery. Based on childhood Epstein-Barr virus exposure and psychosis in adolescence (current case), she is at increased risk of psychotic disorder in adulthood, which underscores the importance of long-term monitoring.

  20. Determining residual reduction algorithm kinematic tracking weights for a sidestep cut via numerical optimization.

    PubMed

    Samaan, Michael A; Weinhandl, Joshua T; Bawab, Sebastian Y; Ringleb, Stacie I

    2016-12-01

    Musculoskeletal modeling allows for the determination of various parameters during dynamic maneuvers by using in vivo kinematic and ground reaction force (GRF) data as inputs. Differences between experimental and model marker data and inconsistencies in the GRFs applied to these musculoskeletal models may not produce accurate simulations. Therefore, residual forces and moments are applied to these models in order to reduce these differences. Numerical optimization techniques can be used to determine optimal tracking weights of each degree of freedom of a musculoskeletal model in order to reduce differences between the experimental and model marker data as well as residual forces and moments. In this study, the particle swarm optimization (PSO) and simplex simulated annealing (SIMPSA) algorithms were used to determine optimal tracking weights for the simulation of a sidestep cut. The PSO and SIMPSA algorithms were able to produce model kinematics that were within 1.4° of experimental kinematics with residual forces and moments of less than 10 N and 18 Nm, respectively. The PSO algorithm was able to replicate the experimental kinematic data more closely and produce more dynamically consistent kinematic data for a sidestep cut compared to the SIMPSA algorithm. Future studies should use external optimization routines to determine dynamically consistent kinematic data and report the differences between experimental and model data for these musculoskeletal simulations.

  1. Modified retrieval algorithm for three types of precipitation distribution using x-band synthetic aperture radar

    NASA Astrophysics Data System (ADS)

    Xie, Yanan; Zhou, Mingliang; Pan, Dengke

    2017-10-01

    The forward-scattering model is introduced to describe the response of normalized radar cross section (NRCS) of precipitation with synthetic aperture radar (SAR). Since the distribution of near-surface rainfall is related to the rate of near-surface rainfall and horizontal distribution factor, a retrieval algorithm called modified regression empirical and model-oriented statistical (M-M) based on the volterra integration theory is proposed. Compared with the model-oriented statistical and volterra integration (MOSVI) algorithm, the biggest difference is that the M-M algorithm is based on the modified regression empirical algorithm rather than the linear regression formula to retrieve the value of near-surface rainfall rate. Half of the empirical parameters are reduced in the weighted integral work and a smaller average relative error is received while the rainfall rate is less than 100 mm/h. Therefore, the algorithm proposed in this paper can obtain high-precision rainfall information.

  2. Prodrugs of herpes simplex thymidine kinase inhibitors.

    PubMed

    Yanachkova, Milka; Xu, Wei-Chu; Dvoskin, Sofya; Dix, Edward J; Yanachkov, Ivan B; Focher, Federico; Savi, Lida; Sanchez, M Dulfary; Foster, Timothy P; Wright, George E

    2015-04-01

    Because guanine-based herpes simplex virus thymidine kinase inhibitors are not orally available, we synthesized various 6-deoxy prodrugs of these compounds and evaluated them with regard to solubility in water, oral bioavailability, and efficacy to prevent herpes simplex virus-1 reactivation from latency in a mouse model. Organic synthesis was used to prepare compounds, High Performance Liquid Chromatography (HPLC) to analyze hydrolytic conversion, Mass Spectrometry (MS) to measure oral bioavailability, and mouse latent infection and induced reactivation to evaluate the efficacy of a specific prodrug. Aqueous solubilities of prodrugs were improved, oxidation of prodrugs by animal cytosols occurred in vitro, and oral absorption of the optimal prodrug sacrovir™ (6-deoxy-mCF3PG) in the presence of the aqueous adjuvant Soluplus® and conversion to active compound N(2)-[3-(trifluoromethyl)pheny])guanine (mCF3PG) were accomplished in mice. Treatment of herpes simplex virus-1 latent mice with sacrovir™ in 1% Soluplus in drinking water significantly suppressed herpes simplex virus-1 reactivation and viral genomic replication. Ad libitum oral delivery of sacrovir™ was effective in suppressing herpes simplex virus-1 reactivation in ocularly infected latent mice as measured by the numbers of mice shedding infectious virus at the ocular surface, numbers of trigeminal ganglia positive for infectious virus, number of corneas that had detectable infectious virus, and herpes simplex virus-1 genome copy numbers in trigeminal ganglia following reactivation. These results demonstrate the statistically significant effect of the prodrug on suppressing herpes simplex virus-1 reactivation in vivo. © The Author(s) 2015.

  3. Asteroid mass estimation using Markov-Chain Monte Carlo techniques

    NASA Astrophysics Data System (ADS)

    Siltala, Lauri; Granvik, Mikael

    2016-10-01

    Estimates for asteroid masses are based on their gravitational perturbations on the orbits of other objects such as Mars, spacecraft, or other asteroids and/or their satellites. In the case of asteroid-asteroid perturbations, this leads to a 13-dimensional inverse problem where the aim is to derive the mass of the perturbing asteroid and six orbital elements for both the perturbing asteroid and the test asteroid using astrometric observations. We have developed and implemented three different mass estimation algorithms utilizing asteroid-asteroid perturbations into the OpenOrb asteroid-orbit-computation software: the very rough 'marching' approximation, in which the asteroid orbits are fixed at a given epoch, reducing the problem to a one-dimensional estimation of the mass, an implementation of the Nelder-Mead simplex method, and most significantly, a Markov-Chain Monte Carlo (MCMC) approach. We will introduce each of these algorithms with particular focus on the MCMC algorithm, and present example results for both synthetic and real data. Our results agree with the published mass estimates, but suggest that the published uncertainties may be misleading as a consequence of using linearized mass-estimation methods. Finally, we discuss remaining challenges with the algorithms as well as future plans, particularly in connection with ESA's Gaia mission.

  4. Advancing Paternal Age and Simplex Autism

    ERIC Educational Resources Information Center

    Puleo, Connor Morrow; Schmeidler, James; Reichenberg, Abraham; Kolevzon, Alexander; Soorya, Latha V.; Buxbaum, Joseph D.; Silverman, Jeremy M.

    2012-01-01

    De novo events appear more common in female and simplex autism spectrum disorder (ASD) cases and may underlie greater ASD risk in older fathers' offspring. This study examined whether advancing paternal age predicts an increase in simplex (n = 90) versus multiplex ASD cases (n = 587) in 677 participants (340 families). Whether or not controlling…

  5. Yager’s ranking method for solving the trapezoidal fuzzy number linear programming

    NASA Astrophysics Data System (ADS)

    Karyati; Wutsqa, D. U.; Insani, N.

    2018-03-01

    In the previous research, the authors have studied the fuzzy simplex method for trapezoidal fuzzy number linear programming based on the Maleki’s ranking function. We have found some theories related to the term conditions for the optimum solution of fuzzy simplex method, the fuzzy Big-M method, the fuzzy two-phase method, and the sensitivity analysis. In this research, we study about the fuzzy simplex method based on the other ranking function. It is called Yager's ranking function. In this case, we investigate the optimum term conditions. Based on the result of research, it is found that Yager’s ranking function is not like Maleki’s ranking function. Using the Yager’s function, the simplex method cannot work as well as when using the Maleki’s function. By using the Yager’s function, the value of the subtraction of two equal fuzzy numbers is not equal to zero. This condition makes the optimum table of the fuzzy simplex table is undetected. As a result, the simplified fuzzy simplex table becomes stopped and does not reach the optimum solution.

  6. A comparison of various algorithms to extract Magic Formula tyre model coefficients for vehicle dynamics simulations

    NASA Astrophysics Data System (ADS)

    Vijay Alagappan, A.; Narasimha Rao, K. V.; Krishna Kumar, R.

    2015-02-01

    Tyre models are a prerequisite for any vehicle dynamics simulation. Tyre models range from the simplest mathematical models that consider only the cornering stiffness to a complex set of formulae. Among all the steady-state tyre models that are in use today, the Magic Formula tyre model is unique and most popular. Though the Magic Formula tyre model is widely used, obtaining the model coefficients from either the experimental or the simulation data is not straightforward due to its nonlinear nature and the presence of a large number of coefficients. A common procedure used for this extraction is the least-squares minimisation that requires considerable experience for initial guesses. Various researchers have tried different algorithms, namely, gradient and Newton-based methods, differential evolution, artificial neural networks, etc. The issues involved in all these algorithms are setting bounds or constraints, sensitivity of the parameters, the features of the input data such as the number of points, noisy data, experimental procedure used such as slip angle sweep or tyre measurement (TIME) procedure, etc. The extracted Magic Formula coefficients are affected by these variants. This paper highlights the issues that are commonly encountered in obtaining these coefficients with different algorithms, namely, least-squares minimisation using trust region algorithms, Nelder-Mead simplex, pattern search, differential evolution, particle swarm optimisation, cuckoo search, etc. A key observation is that not all the algorithms give the same Magic Formula coefficients for a given data. The nature of the input data and the type of the algorithm decide the set of the Magic Formula tyre model coefficients.

  7. Shrinkage simplex-centroid designs for a quadratic mixture model

    NASA Astrophysics Data System (ADS)

    Hasan, Taha; Ali, Sajid; Ahmed, Munir

    2018-03-01

    A simplex-centroid design for q mixture components comprises of all possible subsets of the q components, present in equal proportions. The design does not contain full mixture blends except the overall centroid. In real-life situations, all mixture blends comprise of at least a minimum proportion of each component. Here, we introduce simplex-centroid designs which contain complete blends but with some loss in D-efficiency and stability in G-efficiency. We call such designs as shrinkage simplex-centroid designs. Furthermore, we use the proposed designs to generate component-amount designs by their projection.

  8. 78 FR 26818 - Self-Regulatory Organizations; New York Stock Exchange LLC; Notice of Filing and Immediate...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-05-08

    ... modifiers available to algorithms used by Floor brokers to route interest to the Exchange's matching engine...-Quotes entered into the matching engine by an algorithm on behalf of a Floor broker. STP modifiers would... algorithms removes impediments to and perfects the mechanism of a free and open market because there is a...

  9. Administration of herpes simplex-thymidine kinase-expressing donor T cells with a T-cell-depleted allogeneic marrow graft.

    PubMed

    Tiberghien, P; Ferrand, C; Lioure, B; Milpied, N; Angonin, R; Deconinck, E; Certoux, J M; Robinet, E; Saas, P; Petracca, B; Juttner, C; Reynolds, C W; Longo, D L; Hervé, P; Cahn, J Y

    2001-01-01

    Administration of donor T cells expressing the herpes simplex-thymidine kinase (HS-tk) with a hematopoietic stem cell (HSC) transplantation could allow, if graft-versus-host disease (GVHD) was to occur, a selective in vivo depletion of these T cells by the use of ganciclovir (GCV). The study evaluates the feasibility of such an approach. Escalating numbers of donor HS-tk-expressing CD3(+) gene-modified cells (GMCs) are infused with a T-cell-depleted bone marrow transplantation (BMT). Twelve patients with hematological malignancies received 2 x 10(5) (n = 5), 6 x 10(5) (n = 5), or 20 x 10(5) (n = 2) donor CD3(+) GMCs/kg with a BMT from a human leukocyte antigen (HLA)-identical sibling. No acute toxicity was associated with GMC administration. An early increase of circulating GMCs followed by a progressive decrease and long-lasting circulation of GMCs was documented. GCV treatment resulted in significant rapid decrease in circulating GMCs. Three patients developed acute GVHD, with a grade of at least II, while one patient developed chronic GVHD. Treatment with GCV alone was associated with a complete remission (CR) in 2 patients with acute GVHD, while the addition of glucocorticoids was necessary to achieve a CR in the last case. Long-lasting CR occurred with GCV treatment in the patient with chronic GVHD. Unfortunately, Epstein-Barr virus-lymphoproliferative disease occurred in 3 patients. Overall, the administration of low numbers of HS-tk-expressing T cells early following an HLA-identical BMT is associated with no acute toxicity, persistent circulation of the GMCs, and GCV-sensitive GVHD. Such findings open the way to the infusion of higher numbers of gene-modified donor T cells to enhance post-BMT immune competence while preserving GCV-sensitive alloreactivity.

  10. Association between Psychopathic Disorder and Serum Antibody to Herpes Simplex Virus (Type 1)

    PubMed Central

    Cleobury, J. F.; Skinner, G. R. B.; Thouless, M. E.; Wildy, P.

    1971-01-01

    The sera of a small of patients has been examined for herpes simplex virus antibody. Three clinically-defined groups of patients were compared: (a) aggressive psychopaths, (b) psychiatric controls, and (c) general hospital patients. The first group had an unusually high average kinetic neutralization constant against type 1 herpes simplex virus. PMID:5543996

  11. Association between psychopathic disorder and serum antibody to herpes simplex virus (type 1).

    PubMed

    Cleobury, J F; Skinner, G R; Thouless, M E; Wildy, P

    1971-02-20

    The sera of a small of patients has been examined for herpes simplex virus antibody. Three clinically-defined groups of patients were compared: (a) aggressive psychopaths, (b) psychiatric controls, and (c) general hospital patients. The first group had an unusually high average kinetic neutralization constant against type 1 herpes simplex virus.

  12. Application of modified Rosenbrock's method for optimization of nutrient media used in microorganism culturing.

    PubMed

    Votruba, J; Pilát, P; Prokop, A

    1975-12-01

    The Rosenbrock's procedure has been modified for optimization of nutrient medium composition and has been found to be less tedious than the Box-Wilson method, especially for larger numbers of optimized parameters. Its merits are particularly obvious with multiparameter optimization where the gradient method, so far the only one employed in microbiology from a variety of optimization methods (e.g., refs, 9 and 10), becomes impractical because of the excessive number of experiments required. The method suggested is also more stable during optimization than the gradient methods which are very sensitive to the selection of steps in the direction of the gradient and may thus easily shoot out of the optimized region. It is also anticipated that other direct search methods, particularly simplex design, may be easily adapted for optimization of medium composition. It is obvious that direct search methods may find an application in process improvement in antibiotic and related industries.

  13. Detection of herpes simplex virus-specific DNA sequences in latently infected mice and in humans.

    PubMed

    Efstathiou, S; Minson, A C; Field, H J; Anderson, J R; Wildy, P

    1986-02-01

    Herpes simplex virus-specific DNA sequences have been detected by Southern hybridization analysis in both central and peripheral nervous system tissues of latently infected mice. We have detected virus-specific sequences corresponding to the junction fragment but not the genomic termini, an observation first made by Rock and Fraser (Nature [London] 302:523-525, 1983). This "endless" herpes simplex virus DNA is both qualitatively and quantitatively stable in mouse neural tissue analyzed over a 4-month period. In addition, examination of DNA extracted from human trigeminal ganglia has shown herpes simplex virus DNA to be present in an "endless" form similar to that found in the mouse model system. Further restriction enzyme analysis of latently infected mouse brainstem and human trigeminal DNA has shown that this "endless" herpes simplex virus DNA is present in all four isomeric configurations.

  14. Detection of herpes simplex virus-specific DNA sequences in latently infected mice and in humans.

    PubMed Central

    Efstathiou, S; Minson, A C; Field, H J; Anderson, J R; Wildy, P

    1986-01-01

    Herpes simplex virus-specific DNA sequences have been detected by Southern hybridization analysis in both central and peripheral nervous system tissues of latently infected mice. We have detected virus-specific sequences corresponding to the junction fragment but not the genomic termini, an observation first made by Rock and Fraser (Nature [London] 302:523-525, 1983). This "endless" herpes simplex virus DNA is both qualitatively and quantitatively stable in mouse neural tissue analyzed over a 4-month period. In addition, examination of DNA extracted from human trigeminal ganglia has shown herpes simplex virus DNA to be present in an "endless" form similar to that found in the mouse model system. Further restriction enzyme analysis of latently infected mouse brainstem and human trigeminal DNA has shown that this "endless" herpes simplex virus DNA is present in all four isomeric configurations. Images PMID:3003377

  15. Herpes Simplex Encephalitis during Treatment with Tumor Necrosis Factor-α Inhibitors

    PubMed Central

    Bradford, Russell D.; Pettit, April C.; Wright, Patty W.; Mulligan, Mark J.; Moreland, Larry W.; McLain, David A.; Gnann, John W.; Bloch, Karen C.

    2012-01-01

    We report 3 cases of herpes simplex virus encephalitis in patients receiving tumor necrosis factor-alpha (TNF-α) inhibitors for rheumatologic disorders. Although TNF-α inhibitors have been reported to increase the risk of other infectious diseases, to our knowledge, an association between anti–TNF-α drugs and herpes simplex virus encephalitis has not been previously described. PMID:19681709

  16. Comparison of Full and Partial Admission Flow Fields in the Simplex Turbine

    NASA Technical Reports Server (NTRS)

    Dorney, Daniel J.; Griffin, Lisa W.; Sondak, Douglas L.

    2001-01-01

    The objectives of this project were to: (1) determine the effects of partial admission flow on rotor performance as a function of circumferential location and on unsteady rotor loading; and (2) Provide an efficient technique for determining turbine performance. Full admission simulation ws performed for the Simplex turbine and partial admission simulation is underway for the Simplex turbine.

  17. Herpes simplex encephalitis with thalamic, brainstem and cerebellar involvement.

    PubMed

    Garg, Meenal; Kulkarni, Shilpa; Udwadia Hegde, Anaita

    2018-04-01

    Herpes simplex virus encephalitis is a common and treatable cause of acute encephalitis in all age groups. Certain radiological features such as temporal parenchymal involvement facilitate the diagnosis. The use of herpes simplex virus polymerase chain reaction has expanded the clinical and imaging spectrum. We report the case of a young patient who presented with a movement disorder and predominant involvement of thalami, brainstem and cerebellum on magnetic resonance imaging, and was diagnosed with herpes simplex virus encephalitis. Differentiation from Japanese encephalitis may be difficult in these patients, especially in endemic areas, and may necessitate the use of relevant investigations in all patients.

  18. Herpes simplex virus type 2 (Mollaret's) meningitis: a case report.

    PubMed

    Abu Khattab, Mohammed; Al Soub, Hussam; Al Maslamani, Mona; Al Khuwaiter, Jameela; El Deeb, Yasser

    2009-11-01

    Mollaret's meningitis is an unusual and under-appreciated syndrome of benign, recurrent aseptic meningitis. The available literature indicates that the causative agent is herpes simplex virus type 2 (HSV-2) in the majority of cases and much less frequently herpes simplex virus type 1 (HSV-1). We report the case of a 49-year-old Indian female who had four attacks of recurrent lymphocytic meningitis (Mollaret's meningitis) occurring over a 7-year period. The diagnosis of herpes simplex meningitis was made at the time of the fourth episode by a positive PCR for herpes simplex virus infection in the cerebrospinal fluid. During the first three episodes, the patient was treated with anti-tuberculous drugs and antibiotics for bacterial meningitis; however for the last episode, once the diagnosis of herpes simplex meningitis was confirmed, only symptomatic treatment was given. No long-term suppressive therapy was given and no recurrence has been experienced so far. Mollaret's meningitis should be suspected in all cases of recurrent lymphocytic meningitis. Early diagnosis may prevent prolonged hospital admissions, unnecessary investigations, and exposure to unnecessary medications, with the associated considerable costs. Treatment with acyclovir may be beneficial in decreasing the severity and duration of attacks and in preventing further episodes. [Au?1].

  19. An efficient algorithm for function optimization: modified stem cells algorithm

    NASA Astrophysics Data System (ADS)

    Taherdangkoo, Mohammad; Paziresh, Mahsa; Yazdi, Mehran; Bagheri, Mohammad Hadi

    2013-03-01

    In this paper, we propose an optimization algorithm based on the intelligent behavior of stem cell swarms in reproduction and self-organization. Optimization algorithms, such as the Genetic Algorithm (GA), Particle Swarm Optimization (PSO) algorithm, Ant Colony Optimization (ACO) algorithm and Artificial Bee Colony (ABC) algorithm, can give solutions to linear and non-linear problems near to the optimum for many applications; however, in some case, they can suffer from becoming trapped in local optima. The Stem Cells Algorithm (SCA) is an optimization algorithm inspired by the natural behavior of stem cells in evolving themselves into new and improved cells. The SCA avoids the local optima problem successfully. In this paper, we have made small changes in the implementation of this algorithm to obtain improved performance over previous versions. Using a series of benchmark functions, we assess the performance of the proposed algorithm and compare it with that of the other aforementioned optimization algorithms. The obtained results prove the superiority of the Modified Stem Cells Algorithm (MSCA).

  20. Conic Sampling: An Efficient Method for Solving Linear and Quadratic Programming by Randomly Linking Constraints within the Interior

    PubMed Central

    Serang, Oliver

    2012-01-01

    Linear programming (LP) problems are commonly used in analysis and resource allocation, frequently surfacing as approximations to more difficult problems. Existing approaches to LP have been dominated by a small group of methods, and randomized algorithms have not enjoyed popularity in practice. This paper introduces a novel randomized method of solving LP problems by moving along the facets and within the interior of the polytope along rays randomly sampled from the polyhedral cones defined by the bounding constraints. This conic sampling method is then applied to randomly sampled LPs, and its runtime performance is shown to compare favorably to the simplex and primal affine-scaling algorithms, especially on polytopes with certain characteristics. The conic sampling method is then adapted and applied to solve a certain quadratic program, which compute a projection onto a polytope; the proposed method is shown to outperform the proprietary software Mathematica on large, sparse QP problems constructed from mass spectometry-based proteomics. PMID:22952741

  1. Minimization of transverse beam-emittance growth in the 90-degree bending section of the RAON rare-isotope accelerator

    NASA Astrophysics Data System (ADS)

    Oh, B. H.; Yoon, M.

    2016-11-01

    The major contribution of the transverse beam emittance growth (EG) in a RAON heavy-ion accelerator comes from the bending section, which consists of a charge-stripping section, a matching section, and a charge-selection section in sequence. In this paper, we describe our research to minimize the two-dimensional EG in the 90-degree bending section of the RAON currently being developed in Korea. The EG minimization was achieved with the help of multi-objective genetic algorithms and the simplex method. We utilized those algorithms to analyze the 90-degree bending section in a driver linac for the in-flight fragmentation system. Horizontal and vertical EGs were limited to below 10 % in the bending section by adjustment of the transverse beam optics upstream from the charge-stripping section, redesign of the charge-selection section, and optimization of the vertical beam optics at the entrance of a charge-selection section.

  2. A fast hidden line algorithm with contour option. M.S. Thesis

    NASA Technical Reports Server (NTRS)

    Thue, R. E.

    1984-01-01

    The JonesD algorithm was modified to allow the processing of N-sided elements and implemented in conjunction with a 3-D contour generation algorithm. The total hidden line and contour subsystem is implemented in the MOVIE.BYU Display package, and is compared to the subsystems already existing in the MOVIE.BYU package. The comparison reveals that the modified JonesD hidden line and contour subsystem yields substantial processing time savings, when processing moderate sized models comprised of 1000 elements or less. There are, however, some limitations to the modified JonesD subsystem.

  3. Modified Backtracking Search Optimization Algorithm Inspired by Simulated Annealing for Constrained Engineering Optimization Problems

    PubMed Central

    Wang, Hailong; Sun, Yuqiu; Su, Qinghua; Xia, Xuewen

    2018-01-01

    The backtracking search optimization algorithm (BSA) is a population-based evolutionary algorithm for numerical optimization problems. BSA has a powerful global exploration capacity while its local exploitation capability is relatively poor. This affects the convergence speed of the algorithm. In this paper, we propose a modified BSA inspired by simulated annealing (BSAISA) to overcome the deficiency of BSA. In the BSAISA, the amplitude control factor (F) is modified based on the Metropolis criterion in simulated annealing. The redesigned F could be adaptively decreased as the number of iterations increases and it does not introduce extra parameters. A self-adaptive ε-constrained method is used to handle the strict constraints. We compared the performance of the proposed BSAISA with BSA and other well-known algorithms when solving thirteen constrained benchmarks and five engineering design problems. The simulation results demonstrated that BSAISA is more effective than BSA and more competitive with other well-known algorithms in terms of convergence speed. PMID:29666635

  4. Method of modifying a volume mesh using sheet extraction

    DOEpatents

    Borden, Michael J [Albuquerque, NM; Shepherd, Jason F [Albuquerque, NM

    2007-02-20

    A method and machine-readable medium provide a technique to modify a hexahedral finite element volume mesh using dual generation and sheet extraction. After generating a dual of a volume stack (mesh), a predetermined algorithm may be followed to modify the volume mesh of hexahedral elements. The predetermined algorithm may include the steps of determining a sheet of hexahedral mesh elements, generating nodes for merging, and merging the nodes to delete the sheet of hexahedral mesh elements and modify the volume mesh.

  5. On the efficiency of a randomized mirror descent algorithm in online optimization problems

    NASA Astrophysics Data System (ADS)

    Gasnikov, A. V.; Nesterov, Yu. E.; Spokoiny, V. G.

    2015-04-01

    A randomized online version of the mirror descent method is proposed. It differs from the existing versions by the randomization method. Randomization is performed at the stage of the projection of a subgradient of the function being optimized onto the unit simplex rather than at the stage of the computation of a subgradient, which is common practice. As a result, a componentwise subgradient descent with a randomly chosen component is obtained, which admits an online interpretation. This observation, for example, has made it possible to uniformly interpret results on weighting expert decisions and propose the most efficient method for searching for an equilibrium in a zero-sum two-person matrix game with sparse matrix.

  6. Bouc-Wen hysteresis model identification using Modified Firefly Algorithm

    NASA Astrophysics Data System (ADS)

    Zaman, Mohammad Asif; Sikder, Urmita

    2015-12-01

    The parameters of Bouc-Wen hysteresis model are identified using a Modified Firefly Algorithm. The proposed algorithm uses dynamic process control parameters to improve its performance. The algorithm is used to find the model parameter values that results in the least amount of error between a set of given data points and points obtained from the Bouc-Wen model. The performance of the algorithm is compared with the performance of conventional Firefly Algorithm, Genetic Algorithm and Differential Evolution algorithm in terms of convergence rate and accuracy. Compared to the other three optimization algorithms, the proposed algorithm is found to have good convergence rate with high degree of accuracy in identifying Bouc-Wen model parameters. Finally, the proposed method is used to find the Bouc-Wen model parameters from experimental data. The obtained model is found to be in good agreement with measured data.

  7. Research on wind field algorithm of wind lidar based on BP neural network and grey prediction

    NASA Astrophysics Data System (ADS)

    Chen, Yong; Chen, Chun-Li; Luo, Xiong; Zhang, Yan; Yang, Ze-hou; Zhou, Jie; Shi, Xiao-ding; Wang, Lei

    2018-01-01

    This paper uses the BP neural network and grey algorithm to forecast and study radar wind field. In order to reduce the residual error in the wind field prediction which uses BP neural network and grey algorithm, calculating the minimum value of residual error function, adopting the residuals of the gray algorithm trained by BP neural network, using the trained network model to forecast the residual sequence, using the predicted residual error sequence to modify the forecast sequence of the grey algorithm. The test data show that using the grey algorithm modified by BP neural network can effectively reduce the residual value and improve the prediction precision.

  8. A Universal Tare Load Prediction Algorithm for Strain-Gage Balance Calibration Data Analysis

    NASA Technical Reports Server (NTRS)

    Ulbrich, N.

    2011-01-01

    An algorithm is discussed that may be used to estimate tare loads of wind tunnel strain-gage balance calibration data. The algorithm was originally developed by R. Galway of IAR/NRC Canada and has been described in the literature for the iterative analysis technique. Basic ideas of Galway's algorithm, however, are universally applicable and work for both the iterative and the non-iterative analysis technique. A recent modification of Galway's algorithm is presented that improves the convergence behavior of the tare load prediction process if it is used in combination with the non-iterative analysis technique. The modified algorithm allows an analyst to use an alternate method for the calculation of intermediate non-linear tare load estimates whenever Galway's original approach does not lead to a convergence of the tare load iterations. It is also shown in detail how Galway's algorithm may be applied to the non-iterative analysis technique. Hand load data from the calibration of a six-component force balance is used to illustrate the application of the original and modified tare load prediction method. During the analysis of the data both the iterative and the non-iterative analysis technique were applied. Overall, predicted tare loads for combinations of the two tare load prediction methods and the two balance data analysis techniques showed excellent agreement as long as the tare load iterations converged. The modified algorithm, however, appears to have an advantage over the original algorithm when absolute voltage measurements of gage outputs are processed using the non-iterative analysis technique. In these situations only the modified algorithm converged because it uses an exact solution of the intermediate non-linear tare load estimate for the tare load iteration.

  9. Inner tegument proteins of Herpes Simplex Virus are sufficient for intracellular capsid motility in neurons but not for axonal targeting

    PubMed Central

    Müller, Oliver; Ivanova, Lyudmila; Bialy, Dagmara; Pohlmann, Anja; Binz, Anne; Hegemann, Maike; Viejo-Borbolla, Abel; Rosenhahn, Bodo; Bauerfeind, Rudolf; Sodeik, Beate

    2017-01-01

    Upon reactivation from latency and during lytic infections in neurons, alphaherpesviruses assemble cytosolic capsids, capsids associated with enveloping membranes, and transport vesicles harboring fully enveloped capsids. It is debated whether capsid envelopment of herpes simplex virus (HSV) is completed in the soma prior to axonal targeting or later, and whether the mechanisms are the same in neurons derived from embryos or from adult hosts. We used HSV mutants impaired in capsid envelopment to test whether the inner tegument proteins pUL36 or pUL37 necessary for microtubule-mediated capsid transport were sufficient for axonal capsid targeting in neurons derived from the dorsal root ganglia of adult mice. Such neurons were infected with HSV1-ΔUL20 whose capsids recruited pUL36 and pUL37, with HSV1-ΔUL37 whose capsids associate only with pUL36, or with HSV1-ΔUL36 that assembles capsids lacking both proteins. While capsids of HSV1-ΔUL20 were actively transported along microtubules in epithelial cells and in the somata of neurons, those of HSV1-ΔUL36 and -ΔUL37 could only diffuse in the cytoplasm. Employing a novel image analysis algorithm to quantify capsid targeting to axons, we show that only a few capsids of HSV1-ΔUL20 entered axons, while vesicles transporting gD utilized axonal transport efficiently and independently of pUL36, pUL37, or pUL20. Our data indicate that capsid motility in the somata of neurons mediated by pUL36 and pUL37 does not suffice for targeting capsids to axons, and suggest that capsid envelopment needs to be completed in the soma prior to targeting of herpes simplex virus to the axons, and to spreading from neurons to neighboring cells. PMID:29284065

  10. DOE Office of Scientific and Technical Information (OSTI.GOV)

    Stevens, K; Huang, T; Buttler, D

    We present the C-Cat Wordnet package, an open source library for using and modifying Wordnet. The package includes four key features: an API for modifying Synsets; implementations of standard similarity metrics, implementations of well known Word Sense Disambiguation algorithms, and an implementation of the Castanet algorithm. The library is easily extendible and usable in many runtime environments. We demonstrate it's use on two standard Word Sense Disambiguation tasks and apply the Castanet algorithm to a corpus.

  11. Surgical excision for recurrent herpes simplex virus 2 (HSV-2) anogenital infection in a patient with human immunodeficiency virus (HIV).

    PubMed

    Arinze, Folasade; Shaver, Aaron; Raffanti, Stephen

    2017-10-01

    Recurrent anogenital herpes simplex virus infections are common in patients with human immunodeficiency virus (HIV), of whom approximately 5% develop resistance to acyclovir. We present a case of a 49-year-old man with HIV who had an 8-year history of recurrent left inguinal herpes simplex virus type 2 ulcerations. He initially responded to oral acyclovir, but developed resistance to acyclovir and eventually foscarnet. The lesion progressed to a large hypertrophic mass that required surgical excision, which led to resolution without recurrences. Our case highlights the importance of surgical excision as a treatment option in refractory herpes simplex virus anogenital infections.

  12. Clinical and biological differences between recurrent herpes simplex virus and varicella-zoster virus infections

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Straus, S.E.

    1989-12-01

    The major features that distinguish recurrent herpes simplex virus infections from zoster are illustrated in this article by two case histories. The clinical and epidemiologic features that characterize recurrent herpes simplex virus and varicella-zoster virus infections are reviewed. It is noted that herpesvirus infections are more common and severe in patients with cellular immune deficiency. Each virus evokes both humoral and cellular immune response in the course of primary infection. DNA hybridization studies with RNA probes labelled with sulfur-35 indicate that herpes simplex viruses persist within neurons, and that varicella-zoster virus is found in the satellite cells that encircle themore » neurons.« less

  13. ALPS: A Linear Program Solver

    NASA Technical Reports Server (NTRS)

    Ferencz, Donald C.; Viterna, Larry A.

    1991-01-01

    ALPS is a computer program which can be used to solve general linear program (optimization) problems. ALPS was designed for those who have minimal linear programming (LP) knowledge and features a menu-driven scheme to guide the user through the process of creating and solving LP formulations. Once created, the problems can be edited and stored in standard DOS ASCII files to provide portability to various word processors or even other linear programming packages. Unlike many math-oriented LP solvers, ALPS contains an LP parser that reads through the LP formulation and reports several types of errors to the user. ALPS provides a large amount of solution data which is often useful in problem solving. In addition to pure linear programs, ALPS can solve for integer, mixed integer, and binary type problems. Pure linear programs are solved with the revised simplex method. Integer or mixed integer programs are solved initially with the revised simplex, and the completed using the branch-and-bound technique. Binary programs are solved with the method of implicit enumeration. This manual describes how to use ALPS to create, edit, and solve linear programming problems. Instructions for installing ALPS on a PC compatible computer are included in the appendices along with a general introduction to linear programming. A programmers guide is also included for assistance in modifying and maintaining the program.

  14. Mucus-Penetrating Nanoparticles for Vaginal Drug Delivery Protect Against Herpes Simplex Virus

    PubMed Central

    Ensign, Laura M.; Tang, Benjamin C.; Wang, Ying-Ying; Tse, Terence A.; Hoen, Timothy; Cone, Richard; Hanes, Justin

    2013-01-01

    Incomplete coverage and short duration of action limit the effectiveness of vaginally administered drugs, including microbicides for preventing sexually transmitted infections. We investigated vaginal distribution, retention, and safety of nanoparticles with surfaces modified to enhance transport through mucus. We show that mucus-penetrating particles (MPPs) provide uniform distribution over the vaginal epithelium, whereas conventional nanoparticles (CPs) that are mucoadhesive are aggregated by mouse vaginal mucus, leading to poor distribution. Moreover, when delivered hypotonically, MPPs were transported advectively (versus diffusively) through mucus deep into vaginal folds (rugae) within minutes. By penetrating into the deepest mucus layers, more MPPs were retained in the vaginal tract after 6 h compared to CPs. After 24 h, when delivered in a conventional vaginal gel, patches of a model drug remained on the vaginal epithelium, whereas the epithelium was coated with drug delivered by MPP. We then developed MPPs composed of acyclovir monophosphate (ACVp). When administered prior to vaginal herpes simplex virus 2 (HSV-2) challenge, ACVp-MPPs protected 53% of mice, compared to only 16% protected by soluble drug. Overall, MPPs improved vaginal drug distribution and retention, provided more effective protection against vaginal viral challenge than soluble drug, and were non-toxic when administered daily for one week. PMID:22700955

  15. Using Mathematical Algorithms to Modify Glomerular Filtration Rate Estimation Equations

    PubMed Central

    Zhu, Bei; Wu, Jianqing; Zhu, Jin; Zhao, Weihong

    2013-01-01

    Background The equations provide a rapid and low-cost method of evaluating glomerular filtration rate (GFR). Previous studies indicated that the Modification of Diet in Renal Disease (MDRD), Chronic Kidney Disease-Epidemiology (CKD-EPI) and MacIsaac equations need further modification for application in Chinese population. Thus, this study was designed to modify the three equations, and compare the diagnostic accuracy of the equations modified before and after. Methodology With the use of 99 mTc-DTPA renal dynamic imaging as the reference GFR (rGFR), the MDRD, CKD-EPI and MacIsaac equations were modified by two mathematical algorithms: the hill-climbing and the simulated-annealing algorithms. Results A total of 703 Chinese subjects were recruited, with the average rGFR 77.14±25.93 ml/min. The entire modification process was based on a random sample of 80% of subjects in each GFR level as a training sample set, the rest of 20% of subjects as a validation sample set. After modification, the three equations performed significant improvement in slop, intercept, correlated coefficient, root mean square error (RMSE), total deviation index (TDI), and the proportion of estimated GFR (eGFR) within 10% and 30% deviation of rGFR (P10 and P30). Of the three modified equations, the modified CKD-EPI equation showed the best accuracy. Conclusions Mathematical algorithms could be a considerable tool to modify the GFR equations. Accuracy of all the three modified equations was significantly improved in which the modified CKD-EPI equation could be the optimal one. PMID:23472113

  16. A Modified Particle Swarm Optimization Technique for Finding Optimal Designs for Mixture Models

    PubMed Central

    Wong, Weng Kee; Chen, Ray-Bing; Huang, Chien-Chih; Wang, Weichung

    2015-01-01

    Particle Swarm Optimization (PSO) is a meta-heuristic algorithm that has been shown to be successful in solving a wide variety of real and complicated optimization problems in engineering and computer science. This paper introduces a projection based PSO technique, named ProjPSO, to efficiently find different types of optimal designs, or nearly optimal designs, for mixture models with and without constraints on the components, and also for related models, like the log contrast models. We also compare the modified PSO performance with Fedorov's algorithm, a popular algorithm used to generate optimal designs, Cocktail algorithm, and the recent algorithm proposed by [1]. PMID:26091237

  17. A streamlined artificial variable free version of simplex method.

    PubMed

    Inayatullah, Syed; Touheed, Nasir; Imtiaz, Muhammad

    2015-01-01

    This paper proposes a streamlined form of simplex method which provides some great benefits over traditional simplex method. For instance, it does not need any kind of artificial variables or artificial constraints; it could start with any feasible or infeasible basis of an LP. This method follows the same pivoting sequence as of simplex phase 1 without showing any explicit description of artificial variables which also makes it space efficient. Later in this paper, a dual version of the new method has also been presented which provides a way to easily implement the phase 1 of traditional dual simplex method. For a problem having an initial basis which is both primal and dual infeasible, our methods provide full freedom to the user, that whether to start with primal artificial free version or dual artificial free version without making any reformulation to the LP structure. Last but not the least, it provides a teaching aid for the teachers who want to teach feasibility achievement as a separate topic before teaching optimality achievement.

  18. A Streamlined Artificial Variable Free Version of Simplex Method

    PubMed Central

    Inayatullah, Syed; Touheed, Nasir; Imtiaz, Muhammad

    2015-01-01

    This paper proposes a streamlined form of simplex method which provides some great benefits over traditional simplex method. For instance, it does not need any kind of artificial variables or artificial constraints; it could start with any feasible or infeasible basis of an LP. This method follows the same pivoting sequence as of simplex phase 1 without showing any explicit description of artificial variables which also makes it space efficient. Later in this paper, a dual version of the new method has also been presented which provides a way to easily implement the phase 1 of traditional dual simplex method. For a problem having an initial basis which is both primal and dual infeasible, our methods provide full freedom to the user, that whether to start with primal artificial free version or dual artificial free version without making any reformulation to the LP structure. Last but not the least, it provides a teaching aid for the teachers who want to teach feasibility achievement as a separate topic before teaching optimality achievement. PMID:25767883

  19. Oncolytic Herpes Simplex Viral Therapy: A Stride toward Selective Targeting of Cancer Cells.

    PubMed

    Sanchala, Dhaval S; Bhatt, Lokesh K; Prabhavalkar, Kedar S

    2017-01-01

    Oncolytic viral therapy, which makes use of replication-competent lytic viruses, has emerged as a promising modality to treat malignancies. It has shown meaningful outcomes in both solid tumor and hematologic malignancies. Advancements during the last decade, mainly genetic engineering of oncolytic viruses have resulted in improved specificity and efficacy of oncolytic viruses in cancer therapeutics. Oncolytic viral therapy for treating cancer with herpes simplex virus-1 has been of particular interest owing to its range of benefits like: (a) large genome and power to infiltrate in the tumor, (b) easy access to manipulation with the flexibility to insert multiple transgenes, (c) infecting majority of the malignant cell types with quick replication in the infected cells and (d) as Anti-HSV agent to terminate HSV replication. This review provides an exhaustive list of oncolytic herpes simplex virus-1 along with their genetic alterations. It also encompasses the major developments in oncolytic herpes simplex-1 viral therapy and outlines the limitations and drawbacks of oncolytic herpes simplex viral therapy.

  20. Herpes simplex ulcerative esophagitis in healthy children.

    PubMed

    Al-Hussaini, Abdulrahman A; Fagih, Mosa A

    2011-01-01

    Herpes simplex virus is a common cause of ulcerative esophagitis in the immunocompromised or debilitated host. Despite a high prevalence of primary and recurrent Herpes simplex virus infection in the general population, Herpes simplex virus esophagitis (HSVE) appears to be rare in the immunocompetent host. We report three cases of endoscopically-diagnosed HSVE in apparently immunocompetent children; the presentation was characterized by acute onset of fever, odynophagia, and dysphagia. In two cases, the diagnosis was confirmed histologically by identification of herpes viral inclusions and culture of the virus in the presence of inflammation. The third case was considered to have probable HSVE based on the presence of typical cold sore on his lip, typical endoscopic finding, histopathological evidence of inflammation in esophageal biopsies and positive serologic evidence of acute Herpes simplex virus infection. Two cases received an intravenous course of acyclovir and one had self-limited recovery. All three cases had normal immunological workup and excellent health on long-term follow-up.

  1. Testing the simplex assumption underlying the Sport Motivation Scale: a structural equation modeling analysis.

    PubMed

    Li, F; Harmer, P

    1996-12-01

    Self-determination theory (Deci & Ryan, 1985) suggests that motivational orientation or regulatory styles with respect to various behaviors can be conceptualized along a continuum ranging from low (a motivation) to high (intrinsic motivation) levels of self-determination. This pattern is manifested in the rank order of correlations among these regulatory styles (i.e., adjacent correlations are expected to be higher than those more distant) and is known as a simplex structure. Using responses from the Sport Motivation Scale (Pelletier et al., 1995) obtained from a sample of 857 college students (442 men, 415 women), the present study tested the simplex structure underlying SMS subscales via structural equation modeling. Results confirmed the simplex model structure, indicating that the various motivational constructs are empirically organized from low to high self-determination. The simplex pattern was further found to be invariant across gender. Findings from this study support the construct validity of the SMS and have important implications for studies focusing on the influence of motivational orientation in sport.

  2. Modified artificial bee colony algorithm for reactive power optimization

    NASA Astrophysics Data System (ADS)

    Sulaiman, Noorazliza; Mohamad-Saleh, Junita; Abro, Abdul Ghani

    2015-05-01

    Bio-inspired algorithms (BIAs) implemented to solve various optimization problems have shown promising results which are very important in this severely complex real-world. Artificial Bee Colony (ABC) algorithm, a kind of BIAs has demonstrated tremendous results as compared to other optimization algorithms. This paper presents a new modified ABC algorithm referred to as JA-ABC3 with the aim to enhance convergence speed and avoid premature convergence. The proposed algorithm has been simulated on ten commonly used benchmarks functions. Its performance has also been compared with other existing ABC variants. To justify its robust applicability, the proposed algorithm has been tested to solve Reactive Power Optimization problem. The results have shown that the proposed algorithm has superior performance to other existing ABC variants e.g. GABC, BABC1, BABC2, BsfABC dan IABC in terms of convergence speed. Furthermore, the proposed algorithm has also demonstrated excellence performance in solving Reactive Power Optimization problem.

  3. Dendritic cells in the cornea during Herpes simplex viral infection and inflammation.

    PubMed

    Kwon, Min S; Carnt, Nicole A; Truong, Naomi R; Pattamatta, Ushasree; White, Andrew J; Samarawickrama, Chameen; Cunningham, Anthony L

    Herpes simplex keratitis is commonly caused by Herpes simplex virus type 1, which primarily infects eyelids, corneas, or conjunctiva. Herpes simplex virus type 1-through sophisticated interactions with dendritic cells (DCs), a type of antigen-presenting cell)-initiates proinflammatory responses in the cornea. Corneas were once thought to be an immune-privileged region; however, with the recent discovery of DCs that reside in the cornea, this long-held conjecture has been overturned. Therefore, evaluating the clinical, preclinical, and cell-based studies that investigate the roles of DCs in corneas infected with Herpes simplex virus is critical. With in vivo confocal microscopy, animal models, and cell culture experiments, we may further the understanding of the sophisticated interactions of Herpes simplex virus with DCs in the cornea and the molecular mechanism associated with it. It has been shown that specific differentiation of DCs using immunohistochemistry, flow cytometry, and polymerase chain reaction analysis in both human and mice tissues and viral tissue infections are integral to increasing understanding. As for in vivo confocal microscopy, it holds promise as it is the least invasive and a real-time investigation. These tools will facilitate the discovery of various targets to develop new treatments. Copyright © 2017 Elsevier Inc. All rights reserved.

  4. Laboratory diagnosis and epidemiology of herpes simplex 1 and 2 genital infections.

    PubMed

    Glinšek Biškup, Urška; Uršič, Tina; Petrovec, Miroslav

    2015-01-01

    Herpes simplex virus types 1 and 2 are the main cause of genital ulcers worldwide. Although herpes simplex virus type 2 is the major cause of genital lesions, herpes simplex virus type 1 accounts for half of new cases in developed countries. Herpes simplex virus type 2 seroprevalence rises with sexual activity from adolescence through adulthood. Slovenian data in a high-risk population shows 16% seroprevalence of HSV-2. HSV-1 and HSV-2 DNA in genital swabs was detected in 19% and 20.7%, respectively. In most cases, genital herpes is asymptomatic. Primary genital infection with herpes simplex virus types 1 and 2 can be manifested by a severe clinical picture, involving the vesicular skin and mucosal changes and ulcerative lesions of the vulva, vagina, and cervix in women and in the genital region in men. Direct methods of viral genome detection are recommended in the acute stage of primary and recurrent infections when manifest ulcers or lesions are evident. Serological testing is recommended as an aid in diagnosing genital herpes in patients with reinfection in atypical or already healed lesions. When herpes lesions are present, all sexual activities should be avoided to prevent transmission of infection. Antiviral drugs can reduce viral shedding and thus reduce the risk of sexual transmission of the virus.

  5. [A case of an allergic reaction due to Anisakis simplex possibly after the ingestion of squid--successful detection of four A. simplex allergens, Ani s 1, Ani s 2, Ani s 12 and troponin C-like protein].

    PubMed

    Iijima, Shigeruko; Moriyama, Tatsuya; Ichikawa, Hidetaka; Kobayashi, Yukihiro; Shiomi, Kazuo

    2012-08-01

    A 62-year-old man ingested dressed salmon and its roe (ikura) and grilled mackerel and one hour later further ingested raw tuna and squid as an evening meal at a bar. Soon after the ingestion of raw seafood, he showed wheals, loss of consciousness and low blood pressure. Specific serum IgE to the nematode Anisakis simplex was positive but those to some seafoods were negative. Moreover, a skin prick test using the crude extract was positive for A. simplex but negative for the seafoods, which he ingested on the day of the above episode. When the A. simplex extract was analyzed by IgE-binding immunoblot analysis using the patient serum, two highly intense protein bands were recognized at 18 and 17 kDa, one intense band at 35 kDa and two weak bands at 28 and 26 kDa. ELISA with 11 natural or recombinant A. simplex allergens (Ani s 1-6, 8, 9, 11 and 12 and troponin C-like protein) showed that the patient serum strongly reacted to Ani s 1 and Ani s 12 and weakly to Ani s 2 and troponin C-like protein. Based on these results, he was diagnosed as IgE-mediated A. simplex allergy due to four allergens (Ani s 1, Ani s 2, Ani s 12 and troponin C-like protein), possibly infested in the raw squid which he had ingested just before manifestation of allergic reactions.

  6. Allergy and parasites reevaluated: wide-scale induction of chronic urticaria by the ubiquitous fish-nematode Anisakis simplex in an endemic region.

    PubMed

    Daschner, A; Vega de la Osada, F; Pascual, C Y

    2005-01-01

    The ubiquitous fish-nematode Anisakis simplex produces acute urticaria or angioedema in the course of gastro-allergic anisakiasis. We studied the relationship between this nematode and chronic urticaria (CU), as well as the clinical usefulness of measuring specific IgG4 in A. simplex-sensitized patients with CU. First, the prevalence of sensitization to A. simplex was estimated in 135 consecutive CU patients and the result was compared with known data about sensitization in a healthy population. Then, clinical response to a 2-month diet without fish was analyzed in 76 CU patients. The improvement rate in patients with and without sensitization to A. simplex was compared. Finally, the improvement rate, other clinical data and specific immunoglobulins in sensitized patients with and without detectable specific IgG4 were compared. a) The A. simplex sensitization rate in CU patients was 52.6 % compared with a known prevalence of between 16 and 20 % in our region. b) Of 65 sensitized patients, 52 experienced clinical improvement after the diet compared with only three of 11 patients without sensitization to A. simplex (p = 0.001). c) Of 43 patients with detectable specific IgG4, 38 showed clinical improvement compared with only 14 of 22 patients without detectable IgG4 (p = 0.02). Eight of nine patients with previous fish-associated cutaneous symptoms had detectable specific IgG4 compared with 15 of 32 patients who reported no previous fish-associated symptoms or acute urticaria (p = 0.03). Our results indicate that A. simplex is a possibly widespread etiologic agent able to induce CU. This parasite model constitutes the first report that associates an infectious agent with CU on a large scale. The detection of IgG4 antibodies reflects a previous acute parasitic infection and a temporary diet without fish improves symptoms in most patients with detectable specific IgG4.

  7. Recourse-based facility-location problems in hybrid uncertain environment.

    PubMed

    Wang, Shuming; Watada, Junzo; Pedrycz, Witold

    2010-08-01

    The objective of this paper is to study facility-location problems in the presence of a hybrid uncertain environment involving both randomness and fuzziness. A two-stage fuzzy-random facility-location model with recourse (FR-FLMR) is developed in which both the demands and costs are assumed to be fuzzy-random variables. The bounds of the optimal objective value of the two-stage FR-FLMR are derived. As, in general, the fuzzy-random parameters of the FR-FLMR can be regarded as continuous fuzzy-random variables with an infinite number of realizations, the computation of the recourse requires solving infinite second-stage programming problems. Owing to this requirement, the recourse function cannot be determined analytically, and, hence, the model cannot benefit from the use of techniques of classical mathematical programming. In order to solve the location problems of this nature, we first develop a technique of fuzzy-random simulation to compute the recourse function. The convergence of such simulation scenarios is discussed. In the sequel, we propose a hybrid mutation-based binary ant-colony optimization (MBACO) approach to the two-stage FR-FLMR, which comprises the fuzzy-random simulation and the simplex algorithm. A numerical experiment illustrates the application of the hybrid MBACO algorithm. The comparison shows that the hybrid MBACO finds better solutions than the one using other discrete metaheuristic algorithms, such as binary particle-swarm optimization, genetic algorithm, and tabu search.

  8. Modified artificial bee colony for the vehicle routing problems with time windows.

    PubMed

    Alzaqebah, Malek; Abdullah, Salwani; Jawarneh, Sana

    2016-01-01

    The natural behaviour of the honeybee has attracted the attention of researchers in recent years and several algorithms have been developed that mimic swarm behaviour to solve optimisation problems. This paper introduces an artificial bee colony (ABC) algorithm for the vehicle routing problem with time windows (VRPTW). A Modified ABC algorithm is proposed to improve the solution quality of the original ABC. The high exploration ability of the ABC slows-down its convergence speed, which may due to the mechanism used by scout bees in replacing abandoned (unimproved) solutions with new ones. In the Modified ABC a list of abandoned solutions is used by the scout bees to memorise the abandoned solutions, then the scout bees select a solution from the list based on roulette wheel selection and replace by a new solution with random routs selected from the best solution. The performance of the Modified ABC is evaluated on Solomon benchmark datasets and compared with the original ABC. The computational results demonstrate that the Modified ABC outperforms the original ABC also produce good solutions when compared with the best-known results in the literature. Computational investigations show that the proposed algorithm is a good and promising approach for the VRPTW.

  9. Phase Response Design of Recursive All-Pass Digital Filters Using a Modified PSO Algorithm

    PubMed Central

    2015-01-01

    This paper develops a new design scheme for the phase response of an all-pass recursive digital filter. A variant of particle swarm optimization (PSO) algorithm will be utilized for solving this kind of filter design problem. It is here called the modified PSO (MPSO) algorithm in which another adjusting factor is more introduced in the velocity updating formula of the algorithm in order to improve the searching ability. In the proposed method, all of the designed filter coefficients are firstly collected to be a parameter vector and this vector is regarded as a particle of the algorithm. The MPSO with a modified velocity formula will force all particles into moving toward the optimal or near optimal solution by minimizing some defined objective function of the optimization problem. To show the effectiveness of the proposed method, two different kinds of linear phase response design examples are illustrated and the general PSO algorithm is compared as well. The obtained results show that the MPSO is superior to the general PSO for the phase response design of digital recursive all-pass filter. PMID:26366168

  10. Computational Efficiency of the Simplex Embedding Method in Convex Nondifferentiable Optimization

    NASA Astrophysics Data System (ADS)

    Kolosnitsyn, A. V.

    2018-02-01

    The simplex embedding method for solving convex nondifferentiable optimization problems is considered. A description of modifications of this method based on a shift of the cutting plane intended for cutting off the maximum number of simplex vertices is given. These modification speed up the problem solution. A numerical comparison of the efficiency of the proposed modifications based on the numerical solution of benchmark convex nondifferentiable optimization problems is presented.

  11. Trivial dynamics in discrete-time systems: carrying simplex and translation arcs

    NASA Astrophysics Data System (ADS)

    Niu, Lei; Ruiz-Herrera, Alfonso

    2018-06-01

    In this paper we show that the dynamical behavior in (first octant) of the classical Kolmogorov systems of competitive type admitting a carrying simplex can be sometimes determined completely by the number of fixed points on the boundary and the local behavior around them. Roughly speaking, T has trivial dynamics (i.e. the omega limit set of any orbit is a connected set contained in the set of fixed points) provided T has exactly four hyperbolic nontrivial fixed points in with local attractors on the carrying simplex and local repellers on the carrying simplex; and there exists a unique hyperbolic fixed point in Int. Our results are applied to some classical models including the Leslie–Gower models, Atkinson-Allen systems and Ricker maps.

  12. Prediction and identification of potential immunodominant epitopes in glycoproteins B, C, E, G, and I of herpes simplex virus type 2.

    PubMed

    Pan, Mingjie; Wang, Xingsheng; Liao, Jianmin; Yin, Dengke; Li, Suqin; Pan, Ying; Wang, Yao; Xie, Guangyan; Zhang, Shumin; Li, Yuexi

    2012-01-01

    Twenty B candidate epitopes of glycoproteins B (gB2), C (gC2), E (gE2), G (gG2), and I (gI2) of herpes simplex virus type 2 (HSV-2) were predicted using DNAstar, Biosun, and Antheprot methods combined with the polynomial method. Subsequently, the biological functions of the peptides were tested via experiments in vitro. Among the 20 epitope peptides, 17 could react with the antisera to the corresponding parent proteins in the EIA tests. In particular, five peptides, namely, gB2(466-473) (EQDRKPRN), gC2(216-223) (GRTDRPSA), gE2(483-491) (DPPERPDSP), gG2(572-579) (EPPDDDDS), and gI2(286-295) (CRRRYRRPRG) had strong reaction with the antisera. All conjugates of the five peptides with the carrier protein BSA could stimulate mice into producing antibodies. The antisera to these peptides reacted strongly with the corresponding parent glycoproteins during the Western Blot tests, and the peptides reacted strongly with the antibodies against the parent glycoproteins during the EIA tests. The antisera against the five peptides could neutralize HSV-2 infection in vitro, which has not been reported until now. These results suggest that the immunodominant epitopes screened using software algorithms may be used for virus diagnosis and vaccine design against HSV-2.

  13. Augmented design and analysis of computer experiments: a novel tolerance embedded global optimization approach applied to SWIR hyperspectral illumination design.

    PubMed

    Keresztes, Janos C; John Koshel, R; D'huys, Karlien; De Ketelaere, Bart; Audenaert, Jan; Goos, Peter; Saeys, Wouter

    2016-12-26

    A novel meta-heuristic approach for minimizing nonlinear constrained problems is proposed, which offers tolerance information during the search for the global optimum. The method is based on the concept of design and analysis of computer experiments combined with a novel two phase design augmentation (DACEDA), which models the entire merit space using a Gaussian process, with iteratively increased resolution around the optimum. The algorithm is introduced through a series of cases studies with increasing complexity for optimizing uniformity of a short-wave infrared (SWIR) hyperspectral imaging (HSI) illumination system (IS). The method is first demonstrated for a two-dimensional problem consisting of the positioning of analytical isotropic point sources. The method is further applied to two-dimensional (2D) and five-dimensional (5D) SWIR HSI IS versions using close- and far-field measured source models applied within the non-sequential ray-tracing software FRED, including inherent stochastic noise. The proposed method is compared to other heuristic approaches such as simplex and simulated annealing (SA). It is shown that DACEDA converges towards a minimum with 1 % improvement compared to simplex and SA, and more importantly requiring only half the number of simulations. Finally, a concurrent tolerance analysis is done within DACEDA for to the five-dimensional case such that further simulations are not required.

  14. Wavelet compression of multichannel ECG data by enhanced set partitioning in hierarchical trees algorithm.

    PubMed

    Sharifahmadian, Ershad

    2006-01-01

    The set partitioning in hierarchical trees (SPIHT) algorithm is very effective and computationally simple technique for image and signal compression. Here the author modified the algorithm which provides even better performance than the SPIHT algorithm. The enhanced set partitioning in hierarchical trees (ESPIHT) algorithm has performance faster than the SPIHT algorithm. In addition, the proposed algorithm reduces the number of bits in a bit stream which is stored or transmitted. I applied it to compression of multichannel ECG data. Also, I presented a specific procedure based on the modified algorithm for more efficient compression of multichannel ECG data. This method employed on selected records from the MIT-BIH arrhythmia database. According to experiments, the proposed method attained the significant results regarding compression of multichannel ECG data. Furthermore, in order to compress one signal which is stored for a long time, the proposed multichannel compression method can be utilized efficiently.

  15. An Algorithm for Automatically Modifying Train Crew Schedule

    NASA Astrophysics Data System (ADS)

    Takahashi, Satoru; Kataoka, Kenji; Kojima, Teruhito; Asami, Masayuki

    Once the break-down of the train schedule occurs, the crew schedule as well as the train schedule has to be modified as quickly as possible to restore them. In this paper, we propose an algorithm for automatically modifying a crew schedule that takes all constraints into consideration, presenting a model of the combined problem of crews and trains. The proposed algorithm builds an initial solution by relaxing some of the constraint conditions, and then uses a Taboo-search method to revise this solution in order to minimize the degree of constraint violation resulting from these relaxed conditions. Then we show not only that the algorithm can generate a constraint satisfaction solution, but also that the solution will satisfy the experts. That is, we show the proposed algorithm is capable of producing a usable solution in a short time by applying to actual cases of train-schedule break-down, and that the solution is at least as good as those produced manually, by comparing the both solutions with several point of view.

  16. The study on the control strategy of micro grid considering the economy of energy storage operation

    NASA Astrophysics Data System (ADS)

    Ma, Zhiwei; Liu, Yiqun; Wang, Xin; Li, Bei; Zeng, Ming

    2017-08-01

    To optimize the running of micro grid to guarantee the supply and demand balance of electricity, and to promote the utilization of renewable energy. The control strategy of micro grid energy storage system is studied. Firstly, the mixed integer linear programming model is established based on the receding horizon control. Secondly, the modified cuckoo search algorithm is proposed to calculate the model. Finally, a case study is carried out to study the signal characteristic of micro grid and batteries under the optimal control strategy, and the convergence of the modified cuckoo search algorithm is compared with others to verify the validity of the proposed model and method. The results show that, different micro grid running targets can affect the control strategy of energy storage system, which further affect the signal characteristics of the micro grid. Meanwhile, the convergent speed, computing time and the economy of the modified cuckoo search algorithm are improved compared with the traditional cuckoo search algorithm and differential evolution algorithm.

  17. Formation flight and collision avoidance for multiple UAVs based on modified tentacle algorithm in unstructured environments

    PubMed Central

    2017-01-01

    This paper presents a method for formation flight and collision avoidance of multiple UAVs. Due to the shortcomings such as collision avoidance caused by UAV’s high-speed and unstructured environments, this paper proposes a modified tentacle algorithm to ensure the high performance of collision avoidance. Different from the conventional tentacle algorithm which uses inverse derivation, the modified tentacle algorithm rapidly matches the radius of each tentacle and the steering command, ensuring that the data calculation problem in the conventional tentacle algorithm is solved. Meanwhile, both the speed sets and tentacles in one speed set are reduced and reconstructed so as to be applied to multiple UAVs. Instead of path iterative optimization, the paper selects the best tentacle to obtain the UAV collision avoidance path quickly. The simulation results show that the method presented in the paper effectively enhances the performance of flight formation and collision avoidance for multiple high-speed UAVs in unstructured environments. PMID:28763498

  18. The parametric modified limited penetrable visibility graph for constructing complex networks from time series

    NASA Astrophysics Data System (ADS)

    Li, Xiuming; Sun, Mei; Gao, Cuixia; Han, Dun; Wang, Minggang

    2018-02-01

    This paper presents the parametric modified limited penetrable visibility graph (PMLPVG) algorithm for constructing complex networks from time series. We modify the penetrable visibility criterion of limited penetrable visibility graph (LPVG) in order to improve the rationality of the original penetrable visibility and preserve the dynamic characteristics of the time series. The addition of view angle provides a new approach to characterize the dynamic structure of the time series that is invisible in the previous algorithm. The reliability of the PMLPVG algorithm is verified by applying it to three types of artificial data as well as the actual data of natural gas prices in different regions. The empirical results indicate that PMLPVG algorithm can distinguish the different time series from each other. Meanwhile, the analysis results of natural gas prices data using PMLPVG are consistent with the detrended fluctuation analysis (DFA). The results imply that the PMLPVG algorithm may be a reasonable and significant tool for identifying various time series in different fields.

  19. A Modified Decision Tree Algorithm Based on Genetic Algorithm for Mobile User Classification Problem

    PubMed Central

    Liu, Dong-sheng; Fan, Shu-jiang

    2014-01-01

    In order to offer mobile customers better service, we should classify the mobile user firstly. Aimed at the limitations of previous classification methods, this paper puts forward a modified decision tree algorithm for mobile user classification, which introduced genetic algorithm to optimize the results of the decision tree algorithm. We also take the context information as a classification attributes for the mobile user and we classify the context into public context and private context classes. Then we analyze the processes and operators of the algorithm. At last, we make an experiment on the mobile user with the algorithm, we can classify the mobile user into Basic service user, E-service user, Plus service user, and Total service user classes and we can also get some rules about the mobile user. Compared to C4.5 decision tree algorithm and SVM algorithm, the algorithm we proposed in this paper has higher accuracy and more simplicity. PMID:24688389

  20. Performance Analysis of Combined Methods of Genetic Algorithm and K-Means Clustering in Determining the Value of Centroid

    NASA Astrophysics Data System (ADS)

    Adya Zizwan, Putra; Zarlis, Muhammad; Budhiarti Nababan, Erna

    2017-12-01

    The determination of Centroid on K-Means Algorithm directly affects the quality of the clustering results. Determination of centroid by using random numbers has many weaknesses. The GenClust algorithm that combines the use of Genetic Algorithms and K-Means uses a genetic algorithm to determine the centroid of each cluster. The use of the GenClust algorithm uses 50% chromosomes obtained through deterministic calculations and 50% is obtained from the generation of random numbers. This study will modify the use of the GenClust algorithm in which the chromosomes used are 100% obtained through deterministic calculations. The results of this study resulted in performance comparisons expressed in Mean Square Error influenced by centroid determination on K-Means method by using GenClust method, modified GenClust method and also classic K-Means.

  1. Trajectory optimization of spacecraft high-thrust orbit transfer using a modified evolutionary algorithm

    NASA Astrophysics Data System (ADS)

    Shirazi, Abolfazl

    2016-10-01

    This article introduces a new method to optimize finite-burn orbital manoeuvres based on a modified evolutionary algorithm. Optimization is carried out based on conversion of the orbital manoeuvre into a parameter optimization problem by assigning inverse tangential functions to the changes in direction angles of the thrust vector. The problem is analysed using boundary delimitation in a common optimization algorithm. A method is introduced to achieve acceptable values for optimization variables using nonlinear simulation, which results in an enlarged convergence domain. The presented algorithm benefits from high optimality and fast convergence time. A numerical example of a three-dimensional optimal orbital transfer is presented and the accuracy of the proposed algorithm is shown.

  2. A Modified Artificial Bee Colony Algorithm for p-Center Problems

    PubMed Central

    Yurtkuran, Alkın

    2014-01-01

    The objective of the p-center problem is to locate p-centers on a network such that the maximum of the distances from each node to its nearest center is minimized. The artificial bee colony algorithm is a swarm-based meta-heuristic algorithm that mimics the foraging behavior of honey bee colonies. This study proposes a modified ABC algorithm that benefits from a variety of search strategies to balance exploration and exploitation. Moreover, random key-based coding schemes are used to solve the p-center problem effectively. The proposed algorithm is compared to state-of-the-art techniques using different benchmark problems, and computational results reveal that the proposed approach is very efficient. PMID:24616648

  3. Cerebrospinal fluid cyto-/chemokine profile during acute herpes simplex virus induced anti-N-methyl-d-aspartate receptor encephalitis and in chronic neurological sequelae.

    PubMed

    Kothur, Kavitha; Gill, Deepak; Wong, Melanie; Mohammad, Shekeeb S; Bandodkar, Sushil; Arbunckle, Susan; Wienholt, Louise; Dale, Russell C

    2017-08-01

    To examine the cytokine/chemokine profile of cerebrospinal fluid (CSF) during acute herpes simplex virus-induced N-methyl-d-aspartate receptor (NMDAR) autoimmunity and in chronic/relapsing post-herpes simplex virus encephalitis (HSE) neurological syndromes. We measured longitudinal serial CSF cyto-/chemokines (n=34) and a glial marker (calcium-binding astroglial protein, S100B) in one patient during acute HSE and subsequent anti-NMDAR encephalitis, and compared the results with those from two patients with anti-NMDAR encephalitis without preceding HSE. We also compared cyto-/chemokines in cross-sectional CSF samples from three children with previous HSE who had ongoing chronic or relapsing neurological symptoms (2yr 9 mo-16y after HSE) with those in a group of children having non-inflammatory neurological conditions (n=20). Acute HSE showed elevation of a broad range of all T-helper-subset-related cyto-/chemokines and S100B whereas the post-HSE anti-NMDAR encephalitis phase showed persistent elevation of two of five T-helper-1 (chemokine [C-X-C motif] ligand 9 [CXCL9], CXCL10), three of five predominantly B-cell (CXCL13, CCL19, a proliferation-inducing ligand [APRIL])-mediated cyto-/chemokines, and interferon-α. The post-HSE anti-NMDAR encephalitis inflammatory response was more pronounced than anti-NMDAR encephalitis. All three chronic post-HSE cases showed persistent elevation of CXCL9, CXCL10, and interferon-α, and there was histopathological evidence of chronic lymphocytic inflammation in one biopsied case 7 years after HSE. Two of three chronic cases showed a modest response to immune therapy. HSE-induced anti-NMDAR encephalitis is a complex and pronounced inflammatory syndrome. There is persistent CSF upregulation of cyto-/chemokines in chronic or relapsing post-HSE neurological symptoms, which may be modifiable with immune therapy. The elevated cyto-/chemokines may be targets of monoclonal therapies. © 2017 Mac Keith Press.

  4. Herpes simplex type 1 pneumonitis and acute respiratory distress syndrome in a patient with chronic lymphatic leukemia: a case report.

    PubMed

    Luginbuehl, Miriam; Imhof, Alexander; Klarer, Alexander

    2017-11-23

    Pulmonary pathogenicity of herpes simplex virus type 1 in patients in intensive care without classic immunosuppression as well as the necessity of antiviral treatment in the case of herpes simplex virus detection in respiratory specimens in these patients is controversial. We present a case of acute respiratory distress syndrome in a patient with stable chronic lymphatic leukemia not requiring treatment, in whom we diagnosed herpes simplex virus type 1 bronchopneumonitis based on herpes simplex virus type 1 detection in bronchoalveolar lavage fluid and clinical response to antiviral treatment. A 72-year-old white man presented with symptoms of lower respiratory tract infection. His medical history was significant for chronic lymphatic leukemia, which had been stable without treatment, arterial hypertension, multiple squamous cell carcinomas of the scalp, and alcohol overuse. Community-acquired pneumonia was suspected and appropriate broad-spectrum antibacterial treatment was initiated. Within a few hours, rapid respiratory deterioration led to cardiac arrest. He was successfully resuscitated, but developed acute respiratory distress syndrome. Furthermore, he remained febrile and inflammation markers remained elevated despite antibacterial treatment. Polymerase chain reaction from bronchoalveolar lavage fluid and viral culture from tracheobronchial secretions tested positive for herpes simplex virus type 1. We initiated antiviral treatment with acyclovir. Concomitantly we further escalated the antibacterial treatment, although no bacterial pathogen had been isolated at any point. Defervescence occurred rapidly and his C-reactive protein and leukocyte levels decreased. He was successfully weaned from mechanical ventilation, transferred to the ward, and eventually discharged to home. Herpes simplex virus should be considered a cause for lower respiratory tract infection in critically ill patients, especially in the setting of an underlying disease.

  5. Laryngopharyngeal reflux and herpes simplex virus type 2 are possible risk factors for adult-onset recurrent respiratory papillomatosis (prospective case-control study).

    PubMed

    Formánek, M; Jančatová, D; Komínek, P; Matoušek, P; Zeleník, K

    2017-06-01

    The human papillomavirus (HPV) causes recurrent respiratory papillomatosis (RRP). Although HPV prevalence is high, the incidence of papillomatosis is low. Thus, factors other than HPV infection probably contribute to RRP. This study investigated whether patients with papillomatosis are more often infected with herpes simplex virus type 2 and chlamydia trachomatis (ChT) and whether laryngopharyngeal reflux (LPR) occurs in this group of patients more often. Prospective case-control study. Department of Otorhinolaryngology of University Hospital. The study included 20 patients with adult-onset RRP and 20 adult patients with vocal cord cyst and no pathology of laryngeal mucosa (control group). Immunohistochemical analysis of pepsin, HPV, herpes simplex virus type 2 and ChT was performed in biopsy specimens of laryngeal papillomas and of healthy laryngeal mucosa (control group) obtained from medial part of removed vocal cord cyst during microlaryngoscopy procedures. Pathologic LPR (pepsin in tissue) was diagnosed in 8/20 (40.0%) patients with papillomatosis and in 0/20 control patients (P = .003). Herpes simplex virus type 2 was present in 9/20 (45.0%) patients with papillomatosis and in 0/20 control patients (P = .001). Five specimens were positive for both pepsin and herpes simplex virus type 2. No samples were positive for ChT. There were no significant differences between groups for age, body mass index, diabetes mellitus and gastrooesophageal reflux disease. Tobacco exposure was not more frequent in RRP group either (P = .01). Results show that LPR and herpes simplex virus type 2 are significantly more often present in patients with RRP. LPR and herpes simplex virus type 2 might activate latent HPV infection and thereby be possible risk factors for RRP. © 2016 John Wiley & Sons Ltd.

  6. Simplex-based optimization of numerical and categorical inputs in early bioprocess development: Case studies in HT chromatography.

    PubMed

    Konstantinidis, Spyridon; Titchener-Hooker, Nigel; Velayudhan, Ajoy

    2017-08-01

    Bioprocess development studies often involve the investigation of numerical and categorical inputs via the adoption of Design of Experiments (DoE) techniques. An attractive alternative is the deployment of a grid compatible Simplex variant which has been shown to yield optima rapidly and consistently. In this work, the method is combined with dummy variables and it is deployed in three case studies wherein spaces are comprised of both categorical and numerical inputs, a situation intractable by traditional Simplex methods. The first study employs in silico data and lays out the dummy variable methodology. The latter two employ experimental data from chromatography based studies performed with the filter-plate and miniature column High Throughput (HT) techniques. The solute of interest in the former case study was a monoclonal antibody whereas the latter dealt with the separation of a binary system of model proteins. The implemented approach prevented the stranding of the Simplex method at local optima, due to the arbitrary handling of the categorical inputs, and allowed for the concurrent optimization of numerical and categorical, multilevel and/or dichotomous, inputs. The deployment of the Simplex method, combined with dummy variables, was therefore entirely successful in identifying and characterizing global optima in all three case studies. The Simplex-based method was further shown to be of equivalent efficiency to a DoE-based approach, represented here by D-Optimal designs. Such an approach failed, however, to both capture trends and identify optima, and led to poor operating conditions. It is suggested that the Simplex-variant is suited to development activities involving numerical and categorical inputs in early bioprocess development. © 2017 The Authors. Biotechnology Journal published by WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  7. Herpes simplex virus type 2: Cluster of unrelated cases in an intensive care unit.

    PubMed

    Troché, Gilles; Marque Juillet, Stephanie; Burrel, Sonia; Boutolleau, David; Bédos, Jean-Pierre; Legriel, Stephane

    2016-10-01

    Herpes simplex viruses, which are associated with various clinical manifestations, can be transmitted to critically ill patients from other patients or health care staff. We report an apparent outbreak of mucocutaneous herpes simplex virus 2 infections (5 cases in 10 weeks). An epidemiologic investigation and genotype analysis showed no connections among the 5 cases. Copyright © 2016 Association for Professionals in Infection Control and Epidemiology, Inc. Published by Elsevier Inc. All rights reserved.

  8. Medical Surveillance Monthly Report (MSMR). Volume 20, Number 2, February 2013

    DTIC Science & Technology

    2013-02-01

    have viral etiologies: infections with human papillomavirus (HPV) and genital herpes simplex virus (HSV). Sexually transmitted infections have...infertility No Genital herpes simplex virus (HSV) 3 Virus No Yes Genital sores, infection of newborn babies No Acute gonorrhea 4 Bacterium Yes . PID...796.79 Chlamydia 099.41, 099.5 Genital herpes simplex virus (HSV) 054.1 Acute gonorrhea 098.0x, 098.1x, 098.4x, 098.8x Syphilis, all types All of those

  9. Comparison of a new bisphenol-a-glycidyl dimethacrylate-based cortical bone void filler with polymethyl methacrylate.

    PubMed

    Erbe, E M; Clineff, T D; Gualtieri, G

    2001-10-01

    A newly formulated and reinforced bisphenol-a-glycidyl dimethacrylate (bis-GMA) resin (Cortoss/Orthovita, Malvern, Pa.) was compared with Simplex P polymethyl methacrylate (Stryker Howmedica Osteonics, East Rutherford, N.J.) in rabbits for up to 52 weeks and in sheep for up to 78 weeks. As seen in scanning electron microscopy and histology examinations, both implant materials were surrounded by bone at late time periods, with fibrous layers of connective tissue seen in half the Simplex P specimens. No clinically significant safety differences between implant materials were apparent. Interfacial bond strengths between the implant and bone generally increased with time, but were 4.5-fold greater with Cortoss than Simplex P at 24 weeks, and 100-fold greater at 52 weeks. Forces required to displace 316SS rods held in place with Cortoss were consistently greater than forces to displace rods held in place with Simplex P. No statistically significant differences in displacement forces were found between rods held in place with Cortoss polymerized in situ and rods held with prepolymerized Cortoss. Interfacial bond strengths were greater for Simplex P that was polymerized in situ than for prepolymerized polymethyl methacrylate specimens. Cortoss synthetic cortical bone void filler is a good candidate material to fix implants in bone. It has characteristics consistent with long-term safety and has a better ability to bond to bone than Simplex P.

  10. Unscented Sampling Techniques For Evolutionary Computation With Applications To Astrodynamic Optimization

    DTIC Science & Technology

    2016-09-01

    to both genetic algorithms and evolution strategies to achieve these goals. The results of this research offer a promising new set of modified ...abs_all.jsp?arnumber=203904 [163] Z. Michalewicz, C. Z. Janikow, and J. B. Krawczyk, “A modified genetic algo- rithm for optimal control problems...Available: http://arc.aiaa.org/doi/abs/10.2514/ 2.7053 375 [166] N. Yokoyama and S. Suzuki, “ Modified genetic algorithm for constrained trajectory

  11. Adaption of unstructured meshes using node movement

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Carpenter, J.G.; McRae, V.D.S.

    1996-12-31

    The adaption algorithm of Benson and McRae is modified for application to unstructured grids. The weight function generation was modified for application to unstructured grids and movement was limited to prevent cross over. A NACA 0012 airfoil is used as a test case to evaluate the modified algorithm when applied to unstructured grids and compared to results obtained by Warren. An adaptive mesh solution for the Sudhoo and Hall four element airfoil is included as a demonstration case.

  12. Genital herpes simplex virus infections.

    PubMed

    Rosenthal, M S

    1979-09-01

    In recent years, a great increase in interest in genital herpes has been stimulated partly by the rising prevalence of this disease and partly by observations suggesting that genital herpes is a cause of cervical cancer. The clinical pictures produced by genital herpes simplex virus infections are similar in men and women. In contrast to recurrent attacks, initial episodes of infection are generally more extensive, last longer, and are more often associated with regional lymphadenopathy and systemic symptoms. Genital herpes in pregnancy may pose a serious threat to the newborn infant. Although the data suggesting genital herpes simplex virus infection is a cause of cervical cancer are quite extensive, the evidence is largely circumstantial. In spite of these more serious aspects of genital herpes simplex virus infection, episodes of genital herpes are almost always self-limited and benign. Frequent recurrences pose the major therapeutic and management problem. At present, there is no satisfactory treatment for recurrent genital herpes simplex virus in fection. Many of the suggested therapies, although some sound very promising, are potentially dangerous and should be used only under carefully controlled conditions.

  13. Modified kernel-based nonlinear feature extraction.

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Ma, J.; Perkins, S. J.; Theiler, J. P.

    2002-01-01

    Feature Extraction (FE) techniques are widely used in many applications to pre-process data in order to reduce the complexity of subsequent processes. A group of Kernel-based nonlinear FE ( H E ) algorithms has attracted much attention due to their high performance. However, a serious limitation that is inherent in these algorithms -- the maximal number of features extracted by them is limited by the number of classes involved -- dramatically degrades their flexibility. Here we propose a modified version of those KFE algorithms (MKFE), This algorithm is developed from a special form of scatter-matrix, whose rank is not determinedmore » by the number of classes involved, and thus breaks the inherent limitation in those KFE algorithms. Experimental results suggest that MKFE algorithm is .especially useful when the training set is small.« less

  14. Modified CC-LR algorithm with three diverse feature sets for motor imagery tasks classification in EEG based brain-computer interface.

    PubMed

    Siuly; Li, Yan; Paul Wen, Peng

    2014-03-01

    Motor imagery (MI) tasks classification provides an important basis for designing brain-computer interface (BCI) systems. If the MI tasks are reliably distinguished through identifying typical patterns in electroencephalography (EEG) data, a motor disabled people could communicate with a device by composing sequences of these mental states. In our earlier study, we developed a cross-correlation based logistic regression (CC-LR) algorithm for the classification of MI tasks for BCI applications, but its performance was not satisfactory. This study develops a modified version of the CC-LR algorithm exploring a suitable feature set that can improve the performance. The modified CC-LR algorithm uses the C3 electrode channel (in the international 10-20 system) as a reference channel for the cross-correlation (CC) technique and applies three diverse feature sets separately, as the input to the logistic regression (LR) classifier. The present algorithm investigates which feature set is the best to characterize the distribution of MI tasks based EEG data. This study also provides an insight into how to select a reference channel for the CC technique with EEG signals considering the anatomical structure of the human brain. The proposed algorithm is compared with eight of the most recently reported well-known methods including the BCI III Winner algorithm. The findings of this study indicate that the modified CC-LR algorithm has potential to improve the identification performance of MI tasks in BCI systems. The results demonstrate that the proposed technique provides a classification improvement over the existing methods tested. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

  15. Skull removal in MR images using a modified artificial bee colony optimization algorithm.

    PubMed

    Taherdangkoo, Mohammad

    2014-01-01

    Removal of the skull from brain Magnetic Resonance (MR) images is an important preprocessing step required for other image analysis techniques such as brain tissue segmentation. In this paper, we propose a new algorithm based on the Artificial Bee Colony (ABC) optimization algorithm to remove the skull region from brain MR images. We modify the ABC algorithm using a different strategy for initializing the coordinates of scout bees and their direction of search. Moreover, we impose an additional constraint to the ABC algorithm to avoid the creation of discontinuous regions. We found that our algorithm successfully removed all bony skull from a sample of de-identified MR brain images acquired from different model scanners. The obtained results of the proposed algorithm compared with those of previously introduced well known optimization algorithms such as Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) demonstrate the superior results and computational performance of our algorithm, suggesting its potential for clinical applications.

  16. Infrared study of vibrational relaxation in liquid benzene and its cyclohexane- d12 solutions

    NASA Astrophysics Data System (ADS)

    Akiyama, Minoru; Miyamae, Yuichi

    1997-10-01

    The infrared-band shapes and intensities were measured for the ν19 planar mode (the C-C stretching) of benzene both in the liquid phase and in cyclohexane- d12 solutions at 30°C. In order to investigate the vibrational dephasing dynamics, the data were analyzed on the bases of the Kubo-Rothschild theory. The rms magnitude of the Bohr frequency modulation and its correlation time were determined for the vibrational dephasing of the ν19 mode by using the modified simplex method so that the calculated band profile has the best fit with the observed. The parameters thus determined were compared with those obtained from time-resolved Raman scattering experiments.

  17. Modified artificial fish school algorithm for free space optical communication with sensor-less adaptive optics system

    NASA Astrophysics Data System (ADS)

    Cao, Jingtai; Zhao, Xiaohui; Li, Zhaokun; Liu, Wei; Gu, Haijun

    2017-11-01

    The performance of free space optical (FSO) communication system is limited by atmospheric turbulent extremely. Adaptive optics (AO) is the significant method to overcome the atmosphere disturbance. Especially, for the strong scintillation effect, the sensor-less AO system plays a major role for compensation. In this paper, a modified artificial fish school (MAFS) algorithm is proposed to compensate the aberrations in the sensor-less AO system. Both the static and dynamic aberrations compensations are analyzed and the performance of FSO communication before and after aberrations compensations is compared. In addition, MAFS algorithm is compared with artificial fish school (AFS) algorithm, stochastic parallel gradient descent (SPGD) algorithm and simulated annealing (SA) algorithm. It is shown that the MAFS algorithm has a higher convergence speed than SPGD algorithm and SA algorithm, and reaches the better convergence value than AFS algorithm, SPGD algorithm and SA algorithm. The sensor-less AO system with MAFS algorithm effectively increases the coupling efficiency at the receiving terminal with fewer numbers of iterations. In conclusion, the MAFS algorithm has great significance for sensor-less AO system to compensate atmospheric turbulence in FSO communication system.

  18. Effect of Prior Immunization on Induction of Cervical Cancer in Mice by Herpes Simplex Virus Type 2

    NASA Astrophysics Data System (ADS)

    Budd Wentz, W.; Heggie, Alfred D.; Anthony, Donald D.; Reagan, James W.

    1983-12-01

    Previous studies at this laboratory showed that repeated application of inactivated herpes simplex virus type 2 to the mouse cervix produces premalignant and malignant lesions. In the present study mice were inoculated with inactivated herpes simplex virus type 2 or control solution and Freund's adjuvant by intraperitoneal and subcutaneous routes before exposure of the cervix to inactivated virus. It appears that immunization with inactivated virus conferred a protection against the induction of cervical carcinoma.

  19. 4D Cone-beam CT reconstruction using a motion model based on principal component analysis

    PubMed Central

    Staub, David; Docef, Alen; Brock, Robert S.; Vaman, Constantin; Murphy, Martin J.

    2011-01-01

    Purpose: To provide a proof of concept validation of a novel 4D cone-beam CT (4DCBCT) reconstruction algorithm and to determine the best methods to train and optimize the algorithm. Methods: The algorithm animates a patient fan-beam CT (FBCT) with a patient specific parametric motion model in order to generate a time series of deformed CTs (the reconstructed 4DCBCT) that track the motion of the patient anatomy on a voxel by voxel scale. The motion model is constrained by requiring that projections cast through the deformed CT time series match the projections of the raw patient 4DCBCT. The motion model uses a basis of eigenvectors that are generated via principal component analysis (PCA) of a training set of displacement vector fields (DVFs) that approximate patient motion. The eigenvectors are weighted by a parameterized function of the patient breathing trace recorded during 4DCBCT. The algorithm is demonstrated and tested via numerical simulation. Results: The algorithm is shown to produce accurate reconstruction results for the most complicated simulated motion, in which voxels move with a pseudo-periodic pattern and relative phase shifts exist between voxels. The tests show that principal component eigenvectors trained on DVFs from a novel 2D/3D registration method give substantially better results than eigenvectors trained on DVFs obtained by conventionally registering 4DCBCT phases reconstructed via filtered backprojection. Conclusions: Proof of concept testing has validated the 4DCBCT reconstruction approach for the types of simulated data considered. In addition, the authors found the 2D/3D registration approach to be our best choice for generating the DVF training set, and the Nelder-Mead simplex algorithm the most robust optimization routine. PMID:22149852

  20. Intelligent design optimization of a shape-memory-alloy-actuated reconfigurable wing

    NASA Astrophysics Data System (ADS)

    Lagoudas, Dimitris C.; Strelec, Justin K.; Yen, John; Khan, Mohammad A.

    2000-06-01

    The unique thermal and mechanical properties offered by shape memory alloys (SMAs) present exciting possibilities in the field of aerospace engineering. When properly trained, SMA wires act as linear actuators by contracting when heated and returning to their original shape when cooled. It has been shown experimentally that the overall shape of an airfoil can be altered by activating several attached SMA wire actuators. This shape-change can effectively increase the efficiency of a wing in flight at several different flow regimes. To determine the necessary placement of these wire actuators within the wing, an optimization method that incorporates a fully-coupled structural, thermal, and aerodynamic analysis has been utilized. Due to the complexity of the fully-coupled analysis, intelligent optimization methods such as genetic algorithms have been used to efficiently converge to an optimal solution. The genetic algorithm used in this case is a hybrid version with global search and optimization capabilities augmented by the simplex method as a local search technique. For the reconfigurable wing, each chromosome represents a realizable airfoil configuration and its genes are the SMA actuators, described by their location and maximum transformation strain. The genetic algorithm has been used to optimize this design problem to maximize the lift-to-drag ratio for a reconfigured airfoil shape.

  1. An adaptable, low cost test-bed for unmanned vehicle systems research

    NASA Astrophysics Data System (ADS)

    Goppert, James M.

    2011-12-01

    An unmanned vehicle systems test-bed has been developed. The test-bed has been designed to accommodate hardware changes and various vehicle types and algorithms. The creation of this test-bed allows research teams to focus on algorithm development and employ a common well-tested experimental framework. The ArduPilotOne autopilot was developed to provide the necessary level of abstraction for multiple vehicle types. The autopilot was also designed to be highly integrated with the Mavlink protocol for Micro Air Vehicle (MAV) communication. Mavlink is the native protocol for QGroundControl, a MAV ground control program. Features were added to QGroundControl to accommodate outdoor usage. Next, the Mavsim toolbox was developed for Scicoslab to allow hardware-in-the-loop testing, control design and analysis, and estimation algorithm testing and verification. In order to obtain linear models of aircraft dynamics, the JSBSim flight dynamics engine was extended to use a probabilistic Nelder-Mead simplex method. The JSBSim aircraft dynamics were compared with wind-tunnel data collected. Finally, a structured methodology for successive loop closure control design is proposed. This methodology is demonstrated along with the rest of the test-bed tools on a quadrotor, a fixed wing RC plane, and a ground vehicle. Test results for the ground vehicle are presented.

  2. Research on sparse feature matching of improved RANSAC algorithm

    NASA Astrophysics Data System (ADS)

    Kong, Xiangsi; Zhao, Xian

    2018-04-01

    In this paper, a sparse feature matching method based on modified RANSAC algorithm is proposed to improve the precision and speed. Firstly, the feature points of the images are extracted using the SIFT algorithm. Then, the image pair is matched roughly by generating SIFT feature descriptor. At last, the precision of image matching is optimized by the modified RANSAC algorithm,. The RANSAC algorithm is improved from three aspects: instead of the homography matrix, this paper uses the fundamental matrix generated by the 8 point algorithm as the model; the sample is selected by a random block selecting method, which ensures the uniform distribution and the accuracy; adds sequential probability ratio test(SPRT) on the basis of standard RANSAC, which cut down the overall running time of the algorithm. The experimental results show that this method can not only get higher matching accuracy, but also greatly reduce the computation and improve the matching speed.

  3. Chancroid in Sheffield. A report of 22 cases diagnosed by isolating Haemophilus ducreyi in a modified medium.

    PubMed Central

    Hafiz, S; Kinghorn, G R; McEntegart, M G

    1981-01-01

    The causative organism of chancroid, Haemophilus ducreyi, is generally considered to be very fastidious and its isolation, maintenance, and detailed study very demanding. In this study a modified medium was developed, which allowed the organism to be isolated more frequently than previously would have been expected. Twenty-two cases of chancroid were confirmed by the isolation of H ducreyi in 160 patients with genital ulceration examined over a one-year period. The cases were apparently unrelated, and in only five was there a history of recent sexual contact abroad. Concurrent infection with other sexually transmitted diseases was present in 18 (81.8%) patients, and in 14 (63.6%) both H ducreyi and herpes simplex virus were isolated form the same genital ulcers. Thus, these findings indicate that chancroid is underdiagnosed in England and that H ducreyi may frequently occur as a secondary invader of damaged genital skin and mucosa. PMID:6976815

  4. A Modified Subpulse SAR Processing Procedure Based on the Range-Doppler Algorithm for Synthetic Wideband Waveforms

    PubMed Central

    Lim, Byoung-Gyun; Woo, Jea-Choon; Lee, Hee-Young; Kim, Young-Soo

    2008-01-01

    Synthetic wideband waveforms (SWW) combine a stepped frequency CW waveform and a chirp signal waveform to achieve high range resolution without requiring a large bandwidth or the consequent very high sampling rate. If an efficient algorithm like the range-Doppler algorithm (RDA) is used to acquire the SAR images for synthetic wideband signals, errors occur due to approximations, so the images may not show the best possible result. This paper proposes a modified subpulse SAR processing algorithm for synthetic wideband signals which is based on RDA. An experiment with an automobile-based SAR system showed that the proposed algorithm is quite accurate with a considerable improvement in resolution and quality of the obtained SAR image. PMID:27873984

  5. Modified Bat Algorithm for Feature Selection with the Wisconsin Diagnosis Breast Cancer (WDBC) Dataset

    PubMed

    Jeyasingh, Suganthi; Veluchamy, Malathi

    2017-05-01

    Early diagnosis of breast cancer is essential to save lives of patients. Usually, medical datasets include a large variety of data that can lead to confusion during diagnosis. The Knowledge Discovery on Database (KDD) process helps to improve efficiency. It requires elimination of inappropriate and repeated data from the dataset before final diagnosis. This can be done using any of the feature selection algorithms available in data mining. Feature selection is considered as a vital step to increase the classification accuracy. This paper proposes a Modified Bat Algorithm (MBA) for feature selection to eliminate irrelevant features from an original dataset. The Bat algorithm was modified using simple random sampling to select the random instances from the dataset. Ranking was with the global best features to recognize the predominant features available in the dataset. The selected features are used to train a Random Forest (RF) classification algorithm. The MBA feature selection algorithm enhanced the classification accuracy of RF in identifying the occurrence of breast cancer. The Wisconsin Diagnosis Breast Cancer Dataset (WDBC) was used for estimating the performance analysis of the proposed MBA feature selection algorithm. The proposed algorithm achieved better performance in terms of Kappa statistic, Mathew’s Correlation Coefficient, Precision, F-measure, Recall, Mean Absolute Error (MAE), Root Mean Square Error (RMSE), Relative Absolute Error (RAE) and Root Relative Squared Error (RRSE). Creative Commons Attribution License

  6. Modified harmony search

    NASA Astrophysics Data System (ADS)

    Mohamed, Najihah; Lutfi Amri Ramli, Ahmad; Majid, Ahmad Abd; Piah, Abd Rahni Mt

    2017-09-01

    A metaheuristic algorithm, called Harmony Search is quite highly applied in optimizing parameters in many areas. HS is a derivative-free real parameter optimization algorithm, and draws an inspiration from the musical improvisation process of searching for a perfect state of harmony. Propose in this paper Modified Harmony Search for solving optimization problems, which employs a concept from genetic algorithm method and particle swarm optimization for generating new solution vectors that enhances the performance of HS algorithm. The performances of MHS and HS are investigated on ten benchmark optimization problems in order to make a comparison to reflect the efficiency of the MHS in terms of final accuracy, convergence speed and robustness.

  7. A Novel Hybrid Clonal Selection Algorithm with Combinatorial Recombination and Modified Hypermutation Operators for Global Optimization

    PubMed Central

    Lin, Jingjing; Jing, Honglei

    2016-01-01

    Artificial immune system is one of the most recently introduced intelligence methods which was inspired by biological immune system. Most immune system inspired algorithms are based on the clonal selection principle, known as clonal selection algorithms (CSAs). When coping with complex optimization problems with the characteristics of multimodality, high dimension, rotation, and composition, the traditional CSAs often suffer from the premature convergence and unsatisfied accuracy. To address these concerning issues, a recombination operator inspired by the biological combinatorial recombination is proposed at first. The recombination operator could generate the promising candidate solution to enhance search ability of the CSA by fusing the information from random chosen parents. Furthermore, a modified hypermutation operator is introduced to construct more promising and efficient candidate solutions. A set of 16 common used benchmark functions are adopted to test the effectiveness and efficiency of the recombination and hypermutation operators. The comparisons with classic CSA, CSA with recombination operator (RCSA), and CSA with recombination and modified hypermutation operator (RHCSA) demonstrate that the proposed algorithm significantly improves the performance of classic CSA. Moreover, comparison with the state-of-the-art algorithms shows that the proposed algorithm is quite competitive. PMID:27698662

  8. Code-based Diagnostic Algorithms for Idiopathic Pulmonary Fibrosis. Case Validation and Improvement.

    PubMed

    Ley, Brett; Urbania, Thomas; Husson, Gail; Vittinghoff, Eric; Brush, David R; Eisner, Mark D; Iribarren, Carlos; Collard, Harold R

    2017-06-01

    Population-based studies of idiopathic pulmonary fibrosis (IPF) in the United States have been limited by reliance on diagnostic code-based algorithms that lack clinical validation. To validate a well-accepted International Classification of Diseases, Ninth Revision, code-based algorithm for IPF using patient-level information and to develop a modified algorithm for IPF with enhanced predictive value. The traditional IPF algorithm was used to identify potential cases of IPF in the Kaiser Permanente Northern California adult population from 2000 to 2014. Incidence and prevalence were determined overall and by age, sex, and race/ethnicity. A validation subset of cases (n = 150) underwent expert medical record and chest computed tomography review. A modified IPF algorithm was then derived and validated to optimize positive predictive value. From 2000 to 2014, the traditional IPF algorithm identified 2,608 cases among 5,389,627 at-risk adults in the Kaiser Permanente Northern California population. Annual incidence was 6.8/100,000 person-years (95% confidence interval [CI], 6.1-7.7) and was higher in patients with older age, male sex, and white race. The positive predictive value of the IPF algorithm was only 42.2% (95% CI, 30.6 to 54.6%); sensitivity was 55.6% (95% CI, 21.2 to 86.3%). The corrected incidence was estimated at 5.6/100,000 person-years (95% CI, 2.6-10.3). A modified IPF algorithm had improved positive predictive value but reduced sensitivity compared with the traditional algorithm. A well-accepted International Classification of Diseases, Ninth Revision, code-based IPF algorithm performs poorly, falsely classifying many non-IPF cases as IPF and missing a substantial proportion of IPF cases. A modification of the IPF algorithm may be useful for future population-based studies of IPF.

  9. Neurological Consequences of Cytomegalovirus Infection

    MedlinePlus

    ... viruses that causes cold sores (herpes simplex virus), infectious mononucleosis (Epstein-Barr virus), and chickenpox/shingles (varicella zoster ... viruses that causes cold sores (herpes simplex virus), infectious mononucleosis (Epstein-Barr virus), and chickenpox/shingles (varicella zoster ...

  10. Serum herpes simplex antibodies

    MedlinePlus

    ... causes cold sores (oral herpes). HSV-2 causes genital herpes. How the Test is Performed A blood sample ... person has ever been infected with oral or genital herpes . It looks for antibodies to herpes simplex virus ...

  11. Latency of Herpes Simplex Virus in Absence of Neutralizing Antibody: Model for Reactivation

    NASA Astrophysics Data System (ADS)

    Sekizawa, Tsuyoshi; Openshaw, Harry; Wohlenberg, Charles; Notkins, Abner Louis

    1980-11-01

    Mice inoculated with herpes simplex virus (type 1) by the lip or corneal route and then passively immunized with rabbit antibody to herpes simplex virus developed a latent infection in the trigeminal ganglia within 96 hours. Neutralizing antibody to herpes simplex virus was cleared from the circulation and could not be detected in most of these mice after 2 months. Examination of ganglia from the antibody-negative mice revealed latent virus in over 90 percent of the animals, indicating that serum neutralizing antibody is not necessary to maintain the latent state. When the lips or corneas of these mice were traumatized, viral reactivation occurred in up to 90 percent of the mice, as demonstrated by the appearance of neutralizing antibody. This study provides a model for identifying factors that trigger viral reactivation.

  12. The Type I Interferon Response and Age-Dependent Susceptibility to Herpes Simplex Virus Infection.

    PubMed

    Giraldo, Daniel; Wilcox, Douglas R; Longnecker, Richard

    2017-05-01

    Herpes simplex virus type 1 (HSV-1) is a highly prevalent human neurotropic pathogen. HSV-1 infection is associated with a variety of diseases ranging from benign orolabial lesions to more serious and even life-threatening conditions such as herpes simplex keratitis and herpes simplex encephalitis (HSE). HSE is a rare occurrence among healthy adult individuals, but newborns are a particularly susceptible population. Type I IFN signaling has been identified as a crucial component of the innate immune response to the control of HSV-1 infection. In this study, we review the contribution of the type I IFN response to controlling HSV-1 infection, and differences in the early host response between adults and newborns that may contribute to the increased susceptibility to infection and central nervous system disease in newborns.

  13. [The Spanish Society of Paediatric Infectious Diseases guidelines on the prevention, diagnosis and treatment of neonatal herpes simplex infections].

    PubMed

    2018-02-13

    Neonatal herpes simplex virus infections are rare, but are associated with significant morbidity and mortality. Most newborns acquire herpes simplex virus infection in the peripartum period. For peripartum transmission to occur, women must be shedding the virus in their genital tracts symptomatically or asymptomatically around the time of delivery. There are evidence-based interventions in pregnancy to prevent the transmission to the newborn. Caesarean section should be performed in the presence of herpetic lesions, and antiviral prophylaxis in the last weeks of pregnancy is recommended to suppress genital tract herpes simplex virus at the time of delivery. The diagnosis and early treatment of neonatal herpes simplex virus infections require a high index of suspicion, especially in the absence of skin lesions. It is recommended to rule out herpes simplex virus infections in those newborns with mucocutaneous lesions, central nervous system involvement, or septic appearance. The prognosis of newborns with skin, eye, and/or mouth disease in the high-dose acyclovir era is very good. Antiviral treatment not only improves mortality rates in disseminated and central nervous system disease, but also improves the rates of long-term neurodevelopmental impairment in the cases of disseminated disease. Interestingly, a 6-month suppressive course of oral acyclovir following the acute infection has improved the neurodevelopmental prognosis in patients with CNS involvement. Copyright © 2017 Asociación Española de Pediatría. Publicado por Elsevier España, S.L.U. All rights reserved.

  14. Improved Genetic Algorithm Based on the Cooperation of Elite and Inverse-elite

    NASA Astrophysics Data System (ADS)

    Kanakubo, Masaaki; Hagiwara, Masafumi

    In this paper, we propose an improved genetic algorithm based on the combination of Bee system and Inverse-elitism, both are effective strategies for the improvement of GA. In the Bee system, in the beginning, each chromosome tries to find good solution individually as global search. When some chromosome is regarded as superior one, the other chromosomes try to find solution around there. However, since chromosomes for global search are generated randomly, Bee system lacks global search ability. On the other hand, in the Inverse-elitism, an inverse-elite whose gene values are reversed from the corresponding elite is produced. This strategy greatly contributes to diversification of chromosomes, but it lacks local search ability. In the proposed method, the Inverse-elitism with Pseudo-simplex method is employed for global search of Bee system in order to strengthen global search ability. In addition, it also has strong local search ability. The proposed method has synergistic effects of the three strategies. We confirmed validity and superior performance of the proposed method by computer simulations.

  15. Experiences with the hydraulic design of the high specific speed Francis turbine

    NASA Astrophysics Data System (ADS)

    Obrovsky, J.; Zouhar, J.

    2014-03-01

    The high specific speed Francis turbine is still suitable alternative for refurbishment of older hydro power plants with lower heads and worse cavitation conditions. In the paper the design process of such kind of turbine together with the results comparison of homological model tests performed in hydraulic laboratory of ČKD Blansko Engineering is introduced. The turbine runner was designed using the optimization algorithm and considering the high specific speed hydraulic profile. It means that hydraulic profiles of the spiral case, the distributor and the draft tube were used from a Kaplan turbine. The optimization was done as the automatic cycle and was based on a simplex optimization method as well as on a genetic algorithm. The number of blades is shown as the parameter which changes the resulting specific speed of the turbine between ns=425 to 455 together with the cavitation characteristics. Minimizing of cavitation on the blade surface as well as on the inlet edge of the runner blade was taken into account during the design process. The results of CFD analyses as well as the model tests are mentioned in the paper.

  16. Comparison of optimization strategy and similarity metric in atlas-to-subject registration using statistical deformation model

    NASA Astrophysics Data System (ADS)

    Otake, Y.; Murphy, R. J.; Grupp, R. B.; Sato, Y.; Taylor, R. H.; Armand, M.

    2015-03-01

    A robust atlas-to-subject registration using a statistical deformation model (SDM) is presented. The SDM uses statistics of voxel-wise displacement learned from pre-computed deformation vectors of a training dataset. This allows an atlas instance to be directly translated into an intensity volume and compared with a patient's intensity volume. Rigid and nonrigid transformation parameters were simultaneously optimized via the Covariance Matrix Adaptation - Evolutionary Strategy (CMA-ES), with image similarity used as the objective function. The algorithm was tested on CT volumes of the pelvis from 55 female subjects. A performance comparison of the CMA-ES and Nelder-Mead downhill simplex optimization algorithms with the mutual information and normalized cross correlation similarity metrics was conducted. Simulation studies using synthetic subjects were performed, as well as leave-one-out cross validation studies. Both studies suggested that mutual information and CMA-ES achieved the best performance. The leave-one-out test demonstrated 4.13 mm error with respect to the true displacement field, and 26,102 function evaluations in 180 seconds, on average.

  17. Optimising mobile phase composition, its flow-rate and column temperature in HPLC using taboo search.

    PubMed

    Guillaume, Y C; Peyrin, E

    2000-03-06

    A chemometric methodology is proposed to study the separation of seven p-hydroxybenzoic esters in reversed phase liquid chromatography (RPLC). Fifteen experiments were found to be necessary to find a mathematical model which linked a novel chromatographic response function (CRF) with the column temperature, the water fraction in the mobile phase and its flow rate. The CRF optimum was determined using a new algorithm based on Glover's taboo search (TS). A flow-rate of 0.9 ml min(-1) with a water fraction of 0.64 in the ACN-water mixture and a column temperature of 10 degrees C gave the most efficient separation conditions. The usefulness of TS was compared with the pure random search (PRS) and simplex search (SS). As demonstrated by calculations, the algorithm avoids entrapment in local minima and continues the search to give a near-optimal final solution. Unlike other methods of global optimisation, this procedure is generally applicable, easy to implement, derivative free, conceptually simple and could be used in the future for much more complex optimisation problems.

  18. Infected cell protein 0 functional domains and their coordination in herpes simplex virus replication

    PubMed Central

    Gu, Haidong

    2016-01-01

    Herpes simplex virus 1 (HSV-1) is a ubiquitous human pathogen that establishes latent infection in ganglia neurons. Its unique life cycle requires a balanced “conquer and compromise” strategy to deal with the host anti-viral defenses. One of HSV-1 α (immediate early) gene products, infected cell protein 0 (ICP0), is a multifunctional protein that interacts with and modulates a wide range of cellular defensive pathways. These pathways may locate in different cell compartments, which then migrate or exchange factors upon stimulation, for the purpose of a concerted and effective defense. ICP0 is able to simultaneously attack multiple host pathways by either degrading key restrictive factors or modifying repressive complexes. This is a viral protein that contains an E3 ubiquitin ligase, translocates among different cell compartments and interacts with major defensive complexes. The multiple functional domains of ICP0 can work independently and at the same time coordinate with each other. Dissecting the functional domains of ICP0 and delineating the coordination of these domains will help us understand HSV-1 pathogenicity as well as host defense mechanisms. This article focuses on describing individual ICP0 domains, their biochemical properties and their implication in HSV-1 infection. By putting individual domain functions back into the picture of host anti-viral defense network, this review seeks to elaborate the complex interactions between HSV-1 and its host. PMID:26870669

  19. Amino-terminal sequence of glycoprotein D of herpes simplex virus types 1 and 2

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Eisenberg, R.J.; Long, D.; Hogue-Angeletti, R.

    1984-01-01

    Glycoprotein D (gD) of herpes simplex virus is a structural component of the virion envelope which stimulates production of high titers of herpes simplex virus type-common neutralizing antibody. The authors caried out automated N-terminal amino acid sequencing studies on radiolabeled preparations of gD-1 (gD of herpes simplex virus type 1) and gD-2 (gD of herpes simplex virus type 2). Although some differences were noted, particularly in the methionine and alanine profiles for gD-1 and gD-2, the amino acid sequence of a number of the first 30 residues of the amino terminus of gD-1 and gD-2 appears to be quite similar.more » For both proteins, the first residue is a lysine. When we compared out sequence data for gD-1 with those predicted by nucleic acid sequencing, the two sequences could be aligned (with one exception) starting at residue 26 (lysine) of the predicted sequence. Thus, the first 25 amino acids of the predicted sequence are absent from the polypeptides isolated from infected cells.« less

  20. Fabrication and investigation of electrochromatographic columns with a simplex configuration.

    PubMed

    Liu, Qing; Yang, Lijun; Wang, Qiuquan; Zhang, Bo

    2014-07-04

    Duplex capillary columns with a packed and an open section are widely used in electrochromatography (CEC). The duplex column configuration leads to non-uniform voltage drop, electrical field distribution and separation performance. It also adds to the complexity in understanding and optimizing electrochromatographic process. In this study, we introduced a simplex column configuration based on single particle fritting technology. The new column configuration has an essentially uniform packed bed through the entire column length, with only 1mm length left unpacked serving as the optical detection window. The study shows that a simplex column has higher separation efficiency than a duplex column, especially at the high voltage range, due to the consistent distribution of electrical field over the column length. In comparison to the duplex column, the simplex column presented a lower flow rate at the same applied voltage, suggesting that an open section may support a higher speed than a packed section. In practice, the long and short ends of the simplex column could be used as independent CEC columns respectively. This "two-in-one" bi-functional column configuration provided extra flexibilities in selecting and optimizing electrochromatographic conditions. Copyright © 2014 Elsevier B.V. All rights reserved.

  1. Prevalence of herpes simplex, Epstein Barr and human papilloma viruses in oral lichen planus.

    PubMed

    Yildirim, Benay; Sengüven, Burcu; Demir, Cem

    2011-03-01

    The aim of the present study was to assess the prevalence of Herpes Simplex virus, Epstein Barr virus and Human Papilloma virus -16 in oral lichen planus cases and to evaluate whether any clinical variant, histopathological or demographic feature correlates with these viruses. The study was conducted on 65 cases. Viruses were detected immunohistochemically. We evaluated the histopathological and demographic features and statistically analysed correlation of these features with Herpes Simplex virus, Epstein Barr virus and Human Papilloma virus-16 positivity. Herpes Simplex virus was positive in six (9%) cases and this was not statistically significant. The number of Epstein Barr virus positive cases was 23 (35%) and it was statistically significant. Human Papilloma virus positivity in 14 cases (21%) was statistically significant. Except basal cell degeneration in Herpes Simplex virus positive cases, we did not observe any significant correlation between virus positivity and demographic or histopathological features. However an increased risk of Epstein Barr virus and Human Papilloma virus infection was noted in oral lichen planus cases. Taking into account the oncogenic potential of both viruses, oral lichen planus cases should be detected for the presence of these viruses.

  2. Difficulty Factors, Distribution Effects, and the Least Squares Simplex Data Matrix Solution

    ERIC Educational Resources Information Center

    Ten Berge, Jos M. F.

    1972-01-01

    In the present article it is argued that the Least Squares Simplex Data Matrix Solution does not deal adequately with difficulty factors inasmuch as the theoretical foundation is insufficient. (Author/CB)

  3. Histogram-driven cupping correction (HDCC) in CT

    NASA Astrophysics Data System (ADS)

    Kyriakou, Y.; Meyer, M.; Lapp, R.; Kalender, W. A.

    2010-04-01

    Typical cupping correction methods are pre-processing methods which require either pre-calibration measurements or simulations of standard objects to approximate and correct for beam hardening and scatter. Some of them require the knowledge of spectra, detector characteristics, etc. The aim of this work was to develop a practical histogram-driven cupping correction (HDCC) method to post-process the reconstructed images. We use a polynomial representation of the raw-data generated by forward projection of the reconstructed images; forward and backprojection are performed on graphics processing units (GPU). The coefficients of the polynomial are optimized using a simplex minimization of the joint entropy of the CT image and its gradient. The algorithm was evaluated using simulations and measurements of homogeneous and inhomogeneous phantoms. For the measurements a C-arm flat-detector CT (FD-CT) system with a 30×40 cm2 detector, a kilovoltage on board imager (radiation therapy simulator) and a micro-CT system were used. The algorithm reduced cupping artifacts both in simulations and measurements using a fourth-order polynomial and was in good agreement to the reference. The minimization algorithm required less than 70 iterations to adjust the coefficients only performing a linear combination of basis images, thus executing without time consuming operations. HDCC reduced cupping artifacts without the necessity of pre-calibration or other scan information enabling a retrospective improvement of CT image homogeneity. However, the method can work with other cupping correction algorithms or in a calibration manner, as well.

  4. Testing calibration routines for LISFLOOD, a distributed hydrological model

    NASA Astrophysics Data System (ADS)

    Pannemans, B.

    2009-04-01

    Traditionally hydrological models are considered as difficult to calibrate: their highly non-linearity results in rugged and rough response surfaces were calibration algorithms easily get stuck in local minima. For the calibration of distributed hydrological models two extra factors play an important role: on the one hand they are often costly on computation, thus restricting the feasible number of model runs; on the other hand their distributed nature smooths the response surface, thus facilitating the search for a global minimum. Lisflood is a distributed hydrological model currently used for the European Flood Alert System - EFAS (Van der Knijff et al, 2008). Its upcoming recalibration over more then 200 catchments, each with an average runtime of 2-3 minutes, proved a perfect occasion to put several existing calibration algorithms to the test. The tested routines are Downhill Simplex (DHS, Nelder and Mead, 1965), SCEUA (Duan et Al. 1993), SCEM (Vrugt et al., 2003) and AMALGAM (Vrugt et al., 2008), and they were evaluated on their capability to efficiently converge onto the global minimum and on the spread in the found solutions in repeated runs. The routines were let loose on a simple hyperbolic function, on a Lisflood catchment using model output as observation, and on two Lisflood catchments using real observations (one on the river Inn in the Alps, the other along the downstream stretch of the Elbe). On the mathematical problem and on the catchment with synthetic observations DHS proved to be the fastest and the most efficient in finding a solution. SCEUA and AMALGAM are a slower, but while SCEUA keeps converging on the exact solution, AMALGAM slows down after about 600 runs. For the Lisflood models with real-time observations AMALGAM (hybrid algorithm that combines several other algorithms, we used CMA, PSO and GA) came as fastest out of the tests, and giving comparable results in consecutive runs. However, some more work is needed to tweak the stopping criteria. SCEUA is a bit slower, but has very transparent stopping rules. Both have closed in on the minima after about 600 runs. DHS equals only SCEUA on convergence speed. The stopping criteria we applied so far are too strict, causing it to stop too early. SCEM converges 5-6 times slower. This is a high price for the parameter uncertainty analysis that is simultaneously done. The ease with which all algorithms find the same optimum suggests that we are dealing with a smooth and relatively simple response surface. This leaves room for other deterministic calibration algorithms being smarter than DHS in sliding downhill. PEST seems promising but sofar we haven't managed to get it running with LISFLOOD. • Duan, Q.; Gupta, V. & Sorooshian, S., 1993, Shuffled complex evolution approach for effective and efficient global minimization, J Optim Theory Appl, Kluwer Academic Publishers-Plenum Publishers, 76, 501-521 • Nelder, J. & Mead, R., 1965, A simplex method for function minimization, Comput. J., 7, 308-313 • Van Der Knijff, J. M.; Younis, J. & De Roo, A. P. J., 2008, LISFLOOD: a GIS-based distributed model for river basin scale water balance and flood simulation, International Journal of Geographical Information Science, • Vrugt, J.; Gupta, H.; Bouten, W. & Sorooshian, S., 2003, A Shuffled Complex Evolution Metropolis algorithm for optimization and uncertainty assessment of hydrologic model parameters, Water Resour. Res., 39 • Vrugt, J.; Robinson, B. & Hyman, J., 2008, Self-Adaptive Multimethod Search for Global Optimization in Real-Parameter Spaces, IEEE Trans Evol Comput, IEEE,

  5. Varicella-zoster virus complements herpes simplex virus type 1 temperature-sensitive mutants.

    PubMed Central

    Felser, J M; Straus, S E; Ostrove, J M

    1987-01-01

    Varicella-zoster virus (VZV) can complement temperature-sensitive mutants of herpes simplex virus. Of seven mutants tested, two, carrying mutations in the immediate-early ICP4 and ICP27 proteins, were complemented. This complementation was not seen in coinfections with adenovirus type 5 or cytomegalovirus. Following transfection into CV-1 cells, a DNA fragment containing the VZV short repeat sequence complemented the ICP4 mutant. These data demonstrate a functional relationship between VZV and herpes simplex virus and have allowed localization of a putative VZV immediate-early gene. PMID:3023701

  6. Generation of Non-Homogeneous Poisson Processes by Thinning: Programming Considerations and Comparision with Competing Algorithms.

    DTIC Science & Technology

    1978-12-01

    Poisson processes . The method is valid for Poisson processes with any given intensity function. The basic thinning algorithm is modified to exploit several refinements which reduce computer execution time by approximately one-third. The basic and modified thinning programs are compared with the Poisson decomposition and gap-statistics algorithm, which is easily implemented for Poisson processes with intensity functions of the form exp(a sub 0 + a sub 1t + a sub 2 t-squared. The thinning programs are competitive in both execution

  7. Application of importance sampling to the computation of large deviations in nonequilibrium processes.

    PubMed

    Kundu, Anupam; Sabhapandit, Sanjib; Dhar, Abhishek

    2011-03-01

    We present an algorithm for finding the probabilities of rare events in nonequilibrium processes. The algorithm consists of evolving the system with a modified dynamics for which the required event occurs more frequently. By keeping track of the relative weight of phase-space trajectories generated by the modified and the original dynamics one can obtain the required probabilities. The algorithm is tested on two model systems of steady-state particle and heat transport where we find a huge improvement from direct simulation methods.

  8. Experiments at SRT Using the NOAA CrIS/ATMS Proxy Data Set

    NASA Technical Reports Server (NTRS)

    Susskind, Joel; Kouvaris, Louis; Iredell, Lena

    2011-01-01

    The objectives of the talk are: (1) Assess the performance of NGAS Version-1.5.03.00 CrIS/ATMS retrieval algorithm as delivered by LaRC, modified to include the MW and IR tuning coefficients and new CrIS noise model (a) Percent acceptance (b) RMS and mean differences of T(p) vs. ECMWF truth as a function of % yield (2) Compare performance of NGAS retrieval algorithm with an AIRS Science Team Version-6 like retrieval algorithm modified at Sounder Research Team (SRT) for CrIS/ATMS

  9. Multi-Scale Peak and Trough Detection Optimised for Periodic and Quasi-Periodic Neuroscience Data.

    PubMed

    Bishop, Steven M; Ercole, Ari

    2018-01-01

    The reliable detection of peaks and troughs in physiological signals is essential to many investigative techniques in medicine and computational biology. Analysis of the intracranial pressure (ICP) waveform is a particular challenge due to multi-scale features, a changing morphology over time and signal-to-noise limitations. Here we present an efficient peak and trough detection algorithm that extends the scalogram approach of Scholkmann et al., and results in greatly improved algorithm runtime performance. Our improved algorithm (modified Scholkmann) was developed and analysed in MATLAB R2015b. Synthesised waveforms (periodic, quasi-periodic and chirp sinusoids) were degraded with white Gaussian noise to achieve signal-to-noise ratios down to 5 dB and were used to compare the performance of the original Scholkmann and modified Scholkmann algorithms. The modified Scholkmann algorithm has false-positive (0%) and false-negative (0%) detection rates identical to the original Scholkmann when applied to our test suite. Actual compute time for a 200-run Monte Carlo simulation over a multicomponent noisy test signal was 40.96 ± 0.020 s (mean ± 95%CI) for the original Scholkmann and 1.81 ± 0.003 s (mean ± 95%CI) for the modified Scholkmann, demonstrating the expected improvement in runtime complexity from [Formula: see text] to [Formula: see text]. The accurate interpretation of waveform data to identify peaks and troughs is crucial in signal parameterisation, feature extraction and waveform identification tasks. Modification of a standard scalogram technique has produced a robust algorithm with linear computational complexity that is particularly suited to the challenges presented by large, noisy physiological datasets. The algorithm is optimised through a single parameter and can identify sub-waveform features with minimal additional overhead, and is easily adapted to run in real time on commodity hardware.

  10. US-VISIT Identity Matching Algorithm Evaluation Program: ADIS Algorithm Evaluation Project Plan Update

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Grant, C W; Lenderman, J S; Gansemer, J D

    This document is an update to the 'ADIS Algorithm Evaluation Project Plan' specified in the Statement of Work for the US-VISIT Identity Matching Algorithm Evaluation Program, as deliverable II.D.1. The original plan was delivered in August 2010. This document modifies the plan to reflect modified deliverables reflecting delays in obtaining a database refresh. This document describes the revised schedule of the program deliverables. The detailed description of the processes used, the statistical analysis processes and the results of the statistical analysis will be described fully in the program deliverables. The US-VISIT Identity Matching Algorithm Evaluation Program is work performed bymore » Lawrence Livermore National Laboratory (LLNL) under IAA HSHQVT-07-X-00002 P00004 from the Department of Homeland Security (DHS).« less

  11. Adaptive optics compensation of orbital angular momentum beams with a modified Gerchberg-Saxton-based phase retrieval algorithm

    NASA Astrophysics Data System (ADS)

    Chang, Huan; Yin, Xiao-li; Cui, Xiao-zhou; Zhang, Zhi-chao; Ma, Jian-xin; Wu, Guo-hua; Zhang, Li-jia; Xin, Xiang-jun

    2017-12-01

    Practical orbital angular momentum (OAM)-based free-space optical (FSO) communications commonly experience serious performance degradation and crosstalk due to atmospheric turbulence. In this paper, we propose a wave-front sensorless adaptive optics (WSAO) system with a modified Gerchberg-Saxton (GS)-based phase retrieval algorithm to correct distorted OAM beams. We use the spatial phase perturbation (SPP) GS algorithm with a distorted probe Gaussian beam as the only input. The principle and parameter selections of the algorithm are analyzed, and the performance of the algorithm is discussed. The simulation results show that the proposed adaptive optics (AO) system can significantly compensate for distorted OAM beams in single-channel or multiplexed OAM systems, which provides new insights into adaptive correction systems using OAM beams.

  12. Study of mural painting isolates, leading to the transfer of 'Bacillus maroccanus' and 'Bacillus carotarum' to Bacillus simplex, emended description of Bacillus simplex, re-examination of the strains previously attributed to 'Bacillus macroides' and description of Bacillus muralis sp. nov.

    PubMed

    Heyrman, Jeroen; Logan, Niall A; Rodríguez-Díaz, Marina; Scheldeman, Patsy; Lebbe, Liesbeth; Swings, Jean; Heyndrickx, Marc; De Vos, Paul

    2005-01-01

    A group of 24 strains was isolated from deteriorated mural paintings situated in Spain (necropolis of Carmona) and Germany (church of Greene-Kreiensen). (GTG)5-PCR genomic fingerprinting was performed on these strains to assess their genomic variability and the strains were delineated into four groups. Representatives were studied by 16S rRNA gene sequencing and were found to be closely related to Bacillus simplex and the species 'Bacillus macroides' (strain NCIMB 8796) and 'Bacillus maroccanus' (names not validly published) according to a fasta search. The close similarity between B. simplex, 'B. macroides' NCIMB 8796, 'B. maroccanus' and the mural painting isolates was confirmed by additional (GTG)5-PCR, ARDRA, FAME and SDS-PAGE analyses. Furthermore, these techniques revealed that strains of 'Bacillus carotarum', another name that has not been validly published, also showed high similarity to this group of organisms. On the other hand, it was shown that the strains labelled 'B. macroides' in different collections do not all belong to the same species. Strain NCIMB 8796 can be allocated to B. simplex, while strain DSM 54 (=ATCC 12905) shares the highest 16S rRNA gene sequence similarity with Bacillus sphaericus and Bacillus fusiformis (both around 98.6 %). On the basis of further DNA-DNA hybridization data and the study of phenotypic characteristics, one group of five mural painting strains was attributed to a novel species in the genus Bacillus, for which the name Bacillus muralis sp. nov. is proposed. Finally, the remaining mural painting strains, one (LMG 18508=NCIMB 8796) of two strains belonging to 'B. macroides' and strains belonging to 'B. maroccanus' and 'B. carotarum' are allocated to the species B. simplex and an emended description of B. simplex is given.

  13. [Infection and physico-chemical characteristics of Anisakis among marine fish caught in Zhoushan Fishery].

    PubMed

    Wang, Jian-yue; Zhang, Jun-he; Lin, Qi; Zhang, Qian-tong; He, Wei-xian; Li, Ke-feng; Xu, Xu

    2010-09-01

    To study the rates of infection and physicochemical characteristics of the third stage Anisakis simplex larvae among marine fish caught in Zhoushan Fishery. Fish were dissected to detect Anisakis larvae and identified morphologically. The survival tolerance of the third stage Anisakis simplex larvae in various medium, anthelmintic drug, temperature were studied in laboratory. The total infection rate of Anisakis simplex larvae in fish was 49.10%. High rates of Anisakis infection were observed in hairtails, Pneumatophorus japonicus, Miichthys milky, Argyrosomus argentatus and Muraenesox cinereus (infection rates > 90 percent). The infection intensity of Anisakis per fish varied from 1 to 114. The mean intensity of Anisakis larvae was 15.20 per fish. 3314 Anisakis were detected in 218 marine fish. The survival tolerance of the third stage Anisakis simplex larvae in various Medium, anthelmintic drug, temperature were observed in laboratory condition. The third stage Anisakis simplex larvae showed a strong endurance to stock condiment. The anisakicidal effects of the high purity wine were more effective than that of the low purity wine. The anisakicidal effects of 6.25 g/L mebendazole composite were more effective than that of 18.75 g/L and also more effective than those of other drugs. The third stage Anisakis simplex larvae could survive with length up to 9 h and 12 h in condition of -20°C, -10°C and very sensitive to high temperature treatment. However, they could barely survive in more than 11 s and 1 s under the temperature of 50°C and 60°C. The percentage of infection was fairly high for Anisakis larvae of marine fish caught in Zhoushan Fishery. The third stage Anisakis simplex larvae was shown to have a fairly good tolerance to the external environments. The marine fish were frozen under -20°C beyond 24 h before they were sold on market and cooked with high temperature seemed to be helpful for preventing and controlling effectively the infection of Anisakis.

  14. The Texas Children's Medication Algorithm Project: Revision of the Algorithm for Pharmacotherapy of Attention-Deficit/Hyperactivity Disorder

    ERIC Educational Resources Information Center

    Pliszka, Steven R.; Crismon, M. Lynn; Hughes, Carroll W.; Corners, C. Keith; Emslie, Graham J.; Jensen, Peter S.; McCracken, James T.; Swanson, James M.; Lopez, Molly

    2006-01-01

    Objective: In 1998, the Texas Department of Mental Health and Mental Retardation developed algorithms for medication treatment of attention-deficit/hyperactivity disorder (ADHD). Advances in the psychopharmacology of ADHD and results of a feasibility study of algorithm use in community mental health centers caused the algorithm to be modified and…

  15. [Herpetic folliculitis barbae. A rare cause of folliculitis].

    PubMed

    Anliker, M D; Itin, P

    2003-03-01

    Viral folliculitis is a rare disease usually caused by herpes simplex, herpes zoster and molluscum contagiosum in immune-compromised patients. An otherwise healthy 30 year old patient without history of herpes simplex contracted a folliculitis in the beard region after a flu-like illness. He had no oral or labial lesions but instead showed a crusty erythematous folliculitis confined to the beard region with small grouped vesicles on the neck and reactive cervical lymph nodes. Bacterial and mycological analysis from swabs were negative. The culture was positive for herpes simplex virus and the immune fluorescence showed HSV type 1. Systemic therapy with valaciclovir 2x 500 mg/d and lotio alba locally led to rapid improvement. When confronted with folliculitis, non-bacterial causes such as viral (herpes simplex, herpes zoster, molluscum contagiosum), mycological (pityrosporon, candida), demodex and eosinophilic follicultitis should be taken under consideration.

  16. Mersalyl: a Diuretic with Antiviral Properties

    PubMed Central

    Kramer, M. J.; Cleeland, R.; Grunberg, E.

    1975-01-01

    Mersalyl (Salyrgan), an organic mercurial diuretic, was tested against human and animal viruses with in vivo model infections in mice and tissue culture systems. Mersalyl was active against coxsackieviruses A21 and B1 in mice if administered intraperitoneally immediately after infection. No effect was observed if intraperitoneal treatment was delayed 1 or 2 h postinfection, or if treatment was administered either subcutaneously or per os. Topical treatment with a 5% aqueous solution of mersalyl produced a statistically significant effect against herpes simplex dermatitis in mice but the substance was inactive against systemic infections in mice with herpes simplex as well as Columbia SK, influenza, Semliki Forest, and Sendai viruses. Contact inactivation of coxsackieviruses A21 and B1 and herpes simplex virus was observed, but mersalyl was inactive in tissue culture against coxackieviruses A21 and B1, herpes simplex, influenza, rhinovirus, Semliki Forest, Sendai, and vaccinia viruses. PMID:810082

  17. Pediatric herpes simplex virus infections: an evidence-based approach to treatment.

    PubMed

    Sanders, Jennifer E; Garcia, Sylvia E

    2014-01-01

    Herpes simplex virus is a common virus that causes a variety of clinical presentations ranging from mild to life-threatening. Orolabial and genital herpes are common disorders that can often be managed in an outpatient setting; however, some patients do present to the emergency department with those conditions, and emergency clinicians should be aware of possible complications in the pediatric population. Neonatal herpes is a rare disorder, but prompt recognition and initiation of antiviral therapy is imperative, as the morbidity and mortality of the disease is high. Herpes encephalitis is an emergency that also requires a high index of suspicion to diagnose. Herpes simplex virus is also responsible for a variety of other clinical presentations, including herpes gladiatorum, herpetic whitlow, eczema herpeticum, and ocular herpes. This issue reviews the common clinical presentations of the herpes simplex virus, the life-threatening infections that require expedient identification and management, and recommended treatment regimens.

  18. Retention of urine and sacral paraesthesia in anogenital herpes simplex infection.

    PubMed

    Edis, R H

    1981-01-01

    Two definite and 2 probable cases of anogenital herpes simplex and sacral radiculitis are described. Symptoms were typical and consisted of paraesthesia and neuralgic pain in the perineum and legs, urinary retention and constipation occurring within several days to a week after an anogenital herpetic eruption. However, at presentation only 1 case had an obvious history of anogenital herpes simplex. Neurological signs were not striking and consisted of a reduced appreciation of light touch and pin prick over the sacral dermatomes and in 2 cases reduced anal sphincter tone. CSF examination in 3 patients showed a lymphocytosis. Bladder catheterisation was required for up to 2 weeks in 2 patients. The paraesthesia persisted for weeks to months. It should be more widely recognised that anogenital herpes simplex, with sacral radiculitis, is probably the commonest cause of acute retention of urine in young sexually active people.

  19. [Ulcerating Herpes simplex infections in intensive care patients].

    PubMed

    Fischer, M; Wohlrab, J; Radke, J; Marsch, W C; Soukup, J

    2002-11-01

    Herpes simplex infections are potentially a life-threatening situation for immunocompromised as well as critically ill patients. The correct diagnosis is made more difficult in comatose patients by the fact that the characteristic symptom of extreme pain cannot be registered. The clinical dermatological findings (polycyclic configuration, easily bleeding ulcers) are thus especially important in patients under intensive care conditions. As examples, the cases of 3 critically ill patients (subarachnoid bleeding or head injury) developing therapy-resistant, flat sacral or perioral skin ulcers with peripheral blisters are presented. Herpes simplex virus was confirmed immunohistologically and in the smear test. All patients subsequently died. These cases emphasize that patients in the intensive care unit are in danger of developing a chronic persistent Herpes simplex infection due to latent immunosuppression. Chronic persistent Herpes infections may be underrated in intensive therapy, and must always be ruled out in case of therapy-resistant erosions or ulcerations.

  20. A 9 year-old girl with herpes simplex virus type 2 acute retinal necrosis treated with intravitreal foscarnet.

    PubMed

    King, John; Chung, Mina; DiLoreto, David A

    2007-01-01

    A 9-year-old girl presented with a 2-week history of redness in the left eye. Examination revealed vitritis, retinal whitening, vasculitis, and optic nerve head edema. Polymerase chain reaction testing of the aqueous fluid revealed herpes simplex virus type 2. The retinitis was controlled with intravenous acyclovir and intravitreal foscarnet. The clinical course was complicated by retinal neovascularization and vitreous hemorrhage, which was treated by pars plana vitrectomy and endolaser. While there are few case reports of herpes simplex virus type 2 retinitis in children, this one is unique for the following reasons: it is the first reported case of herpes simplex virus type 2 retinitis in a child less than 10 years old without a previous history of neonatal infection or central nervous system involvement; no other children have been reported to have been treated with intravitreal foscarnet; and retinal neovascularization complicated the recovery.

  1. An Enhanced K-Means Algorithm for Water Quality Analysis of The Haihe River in China.

    PubMed

    Zou, Hui; Zou, Zhihong; Wang, Xiaojing

    2015-11-12

    The increase and the complexity of data caused by the uncertain environment is today's reality. In order to identify water quality effectively and reliably, this paper presents a modified fast clustering algorithm for water quality analysis. The algorithm has adopted a varying weights K-means cluster algorithm to analyze water monitoring data. The varying weights scheme was the best weighting indicator selected by a modified indicator weight self-adjustment algorithm based on K-means, which is named MIWAS-K-means. The new clustering algorithm avoids the margin of the iteration not being calculated in some cases. With the fast clustering analysis, we can identify the quality of water samples. The algorithm is applied in water quality analysis of the Haihe River (China) data obtained by the monitoring network over a period of eight years (2006-2013) with four indicators at seven different sites (2078 samples). Both the theoretical and simulated results demonstrate that the algorithm is efficient and reliable for water quality analysis of the Haihe River. In addition, the algorithm can be applied to more complex data matrices with high dimensionality.

  2. Brain-Inspired Constructive Learning Algorithms with Evolutionally Additive Nonlinear Neurons

    NASA Astrophysics Data System (ADS)

    Fang, Le-Heng; Lin, Wei; Luo, Qiang

    In this article, inspired partially by the physiological evidence of brain’s growth and development, we developed a new type of constructive learning algorithm with evolutionally additive nonlinear neurons. The new algorithms have remarkable ability in effective regression and accurate classification. In particular, the algorithms are able to sustain a certain reduction of the loss function when the dynamics of the trained network are bogged down in the vicinity of the local minima. The algorithm augments the neural network by adding only a few connections as well as neurons whose activation functions are nonlinear, nonmonotonic, and self-adapted to the dynamics of the loss functions. Indeed, we analytically demonstrate the reduction dynamics of the algorithm for different problems, and further modify the algorithms so as to obtain an improved generalization capability for the augmented neural networks. Finally, through comparing with the classical algorithm and architecture for neural network construction, we show that our constructive learning algorithms as well as their modified versions have better performances, such as faster training speed and smaller network size, on several representative benchmark datasets including the MNIST dataset for handwriting digits.

  3. New Enhanced Artificial Bee Colony (JA-ABC5) Algorithm with Application for Reactive Power Optimization

    PubMed Central

    2015-01-01

    The standard artificial bee colony (ABC) algorithm involves exploration and exploitation processes which need to be balanced for enhanced performance. This paper proposes a new modified ABC algorithm named JA-ABC5 to enhance convergence speed and improve the ability to reach the global optimum by balancing exploration and exploitation processes. New stages have been proposed at the earlier stages of the algorithm to increase the exploitation process. Besides that, modified mutation equations have also been introduced in the employed and onlooker-bees phases to balance the two processes. The performance of JA-ABC5 has been analyzed on 27 commonly used benchmark functions and tested to optimize the reactive power optimization problem. The performance results have clearly shown that the newly proposed algorithm has outperformed other compared algorithms in terms of convergence speed and global optimum achievement. PMID:25879054

  4. New enhanced artificial bee colony (JA-ABC5) algorithm with application for reactive power optimization.

    PubMed

    Sulaiman, Noorazliza; Mohamad-Saleh, Junita; Abro, Abdul Ghani

    2015-01-01

    The standard artificial bee colony (ABC) algorithm involves exploration and exploitation processes which need to be balanced for enhanced performance. This paper proposes a new modified ABC algorithm named JA-ABC5 to enhance convergence speed and improve the ability to reach the global optimum by balancing exploration and exploitation processes. New stages have been proposed at the earlier stages of the algorithm to increase the exploitation process. Besides that, modified mutation equations have also been introduced in the employed and onlooker-bees phases to balance the two processes. The performance of JA-ABC5 has been analyzed on 27 commonly used benchmark functions and tested to optimize the reactive power optimization problem. The performance results have clearly shown that the newly proposed algorithm has outperformed other compared algorithms in terms of convergence speed and global optimum achievement.

  5. Robust Adaptive Modified Newton Algorithm for Generalized Eigendecomposition and Its Application

    NASA Astrophysics Data System (ADS)

    Yang, Jian; Yang, Feng; Xi, Hong-Sheng; Guo, Wei; Sheng, Yanmin

    2007-12-01

    We propose a robust adaptive algorithm for generalized eigendecomposition problems that arise in modern signal processing applications. To that extent, the generalized eigendecomposition problem is reinterpreted as an unconstrained nonlinear optimization problem. Starting from the proposed cost function and making use of an approximation of the Hessian matrix, a robust modified Newton algorithm is derived. A rigorous analysis of its convergence properties is presented by using stochastic approximation theory. We also apply this theory to solve the signal reception problem of multicarrier DS-CDMA to illustrate its practical application. The simulation results show that the proposed algorithm has fast convergence and excellent tracking capability, which are important in a practical time-varying communication environment.

  6. Method of generating a surface mesh

    DOEpatents

    Shepherd, Jason F [Albuquerque, NM; Benzley, Steven [Provo, UT; Grover, Benjamin T [Tracy, CA

    2008-03-04

    A method and machine-readable medium provide a technique to generate and modify a quadrilateral finite element surface mesh using dual creation and modification. After generating a dual of a surface (mesh), a predetermined algorithm may be followed to generate and modify a surface mesh of quadrilateral elements. The predetermined algorithm may include the steps of generating two-dimensional cell regions in dual space, determining existing nodes in primal space, generating new nodes in the dual space, and connecting nodes to form the quadrilateral elements (faces) for the generated and modifiable surface mesh.

  7. Learning Intelligent Genetic Algorithms Using Japanese Nonograms

    ERIC Educational Resources Information Center

    Tsai, Jinn-Tsong; Chou, Ping-Yi; Fang, Jia-Cen

    2012-01-01

    An intelligent genetic algorithm (IGA) is proposed to solve Japanese nonograms and is used as a method in a university course to learn evolutionary algorithms. The IGA combines the global exploration capabilities of a canonical genetic algorithm (CGA) with effective condensed encoding, improved fitness function, and modified crossover and…

  8. Optimal solution for travelling salesman problem using heuristic shortest path algorithm with imprecise arc length

    NASA Astrophysics Data System (ADS)

    Bakar, Sumarni Abu; Ibrahim, Milbah

    2017-08-01

    The shortest path problem is a popular problem in graph theory. It is about finding a path with minimum length between a specified pair of vertices. In any network the weight of each edge is usually represented in a form of crisp real number and subsequently the weight is used in the calculation of shortest path problem using deterministic algorithms. However, due to failure, uncertainty is always encountered in practice whereby the weight of edge of the network is uncertain and imprecise. In this paper, a modified algorithm which utilized heuristic shortest path method and fuzzy approach is proposed for solving a network with imprecise arc length. Here, interval number and triangular fuzzy number in representing arc length of the network are considered. The modified algorithm is then applied to a specific example of the Travelling Salesman Problem (TSP). Total shortest distance obtained from this algorithm is then compared with the total distance obtained from traditional nearest neighbour heuristic algorithm. The result shows that the modified algorithm can provide not only on the sequence of visited cities which shown to be similar with traditional approach but it also provides a good measurement of total shortest distance which is lesser as compared to the total shortest distance calculated using traditional approach. Hence, this research could contribute to the enrichment of methods used in solving TSP.

  9. Anisakis simplex: from Obscure Infectious Worm to Inducer of Immune Hypersensitivity

    PubMed Central

    Audicana, M. Teresa; Kennedy, Malcolm W.

    2008-01-01

    Summary: Infection of humans with the nematode worm parasite Anisakis simplex was first described in the 1960s in association with the consumption of raw or undercooked fish. During the 1990s it was realized that even the ingestion of dead worms in food fish can cause severe hypersensitivity reactions, that these may be more prevalent than infection itself, and that this outcome could be associated with food preparations previously considered safe. Not only may allergic symptoms arise from infection by the parasites (“gastroallergic anisakiasis”), but true anaphylactic reactions can also occur following exposure to allergens from dead worms by food-borne, airborne, or skin contact routes. This review discusses A. simplex pathogenesis in humans, covering immune hypersensitivity reactions both in the context of a living infection and in terms of exposure to its allergens by other routes. Over the last 20 years, several studies have concentrated on A. simplex antigen characterization and innate as well as adaptive immune response to this parasite. Molecular characterization of Anisakis allergens and isolation of their encoding cDNAs is now an active field of research that should provide improved diagnostic tools in addition to tools with which to enhance our understanding of pathogenesis and controversial aspects of A. simplex allergy. We also discuss the potential relevance of parasite products such as allergens, proteinases, and proteinase inhibitors and the activation of basophils, eosinophils, and mast cells in the induction of A. simplex-related immune hypersensitivity states induced by exposure to the parasite, dead or alive. PMID:18400801

  10. Association of anti-herpes simplex virus IgG in tears and serum with clinical presentation in patients with presumed herpetic simplex keratitis.

    PubMed

    Borderie, Vincent M; Gineys, Raquel; Goldschmidt, Pablo; Batellier, Laurence; Laroche, Laurent; Chaumeil, Christine

    2012-11-01

    To assess the clinical relevance of tear anti-herpes simplex virus (HSV) antibody measurement for the diagnosis of herpes simplex keratitis. Records of 364 patients clinically suspect of HSV-related keratitis who had tear anti-HSV IgG assessment (tear-quantified anti-HSV IgG/filtrated IgG ratio) in our institution between January 2000 and August 2008 were retrospectively analyzed. Patients were classified into 4 groups as follows: group 1, anti-HSV IgG negative in serum and tears; group 2, anti-HSV IgG negative in tears and positive in serum; group 3, anti-HSV IgG nonsignificantly positive in tears and positive in serum; and group 4, anti-HSV IgG significantly positive in serum and tears. Randomly selected patient charts from each group were reviewed for clinical data. The prevalence of anti-HSV IgG in blood increased with age from >70% before 20 years to 95% after 70 years. The prevalence of anti-HSV IgG in tears increased with age from 20% before 20 years to >50% after 70 years. The presence (either significant or not) of anti-HSV IgG in tears was significantly associated with decreased corneal sensation, presence of stromal opacities, and with neurotrophic keratitis. Logistic regression showed no significant association between age and clinical signs except for herpetic ulcers and herpetic necrotizing keratitis. Tear production of anti-HSV IgG increases with age, and it is associated with sequelae of herpes simplex keratitis. Conversely, it is poorly associated with clinical signs of acute herpes simplex keratitis.

  11. Mycosis Inhibits Cannibalism by Melanoplus sanguinipes, M. differentialis, Schistocerca americana, and Anabrus simplex

    PubMed Central

    Jaronski, Stefan T.

    2013-01-01

    Cannibalism is common among the Acrididae and the Mormon cricket, Anabrus simplex Haldeman (Orthoptera: Tettigoniidae). This behavior has been proposed as a mechanism for the horizontal transmission of Microsporida and entomopathogenic fungi. Aanecdotal observations suggested that the migratory grasshopper, Melanoplus sanguinipes Fabricius (Acrididae), and A. simplex did not eat cadavers that had been killed by insect pathogenic fungi. The hypothesis tested was that A. simplex or M. sanguinipes would not cannibalize individuals freshly killed by the entomopathogenic fungi, Beauveria bassiana Bals.-Criv. (Vuill.) (Hypocreales: Clavicipitaceae), or Metarhizium acridum (Driver and Milner) Bischoff, Rehner, and Humber. Cannibalism was examined in a series of no-choice tests with individual insects. Test insects included healthy adults of M. sanguinipes; the differential grasshopper, M. differentialis (Thomas); the American grasshopper, Schistocerca americana (Drury) (Acrididae); and A. simplex. Individual, starved Acrididae or A. simplex were confined in small cages with either a fungus-killed (but unsporulated) or uninfected cadaver. The insects were then observed periodically for the first 4 hr. After 24 hr, the cadavers were scored for the degree to which they had been consumed. Very few mycotic cadavers were fed upon by the healthy insects, and, at most only the tarsi were eaten. All four species generally refused to eat fungus-infected cadavers. In contrast, freeze-killed cadavers were partly or entirely consumed by most of the test insects, often within a few hours. Transmission of infection through contact in these tests was between 0–18.9%, depending upon the fungus and insect species, and was lower than the prevalence of cannibalism in all cases. PMID:24786183

  12. Evaluation of a new approach to compute intervertebral disc height measurements from lateral radiographic views of the spine.

    PubMed

    Allaire, Brett T; DePaolis Kaluza, M Clara; Bruno, Alexander G; Samelson, Elizabeth J; Kiel, Douglas P; Anderson, Dennis E; Bouxsein, Mary L

    2017-01-01

    Current standard methods to quantify disc height, namely distortion compensated Roentgen analysis (DCRA), have been mostly utilized in the lumbar and cervical spine and have strict exclusion criteria. Specifically, discs adjacent to a vertebral fracture are excluded from measurement, thus limiting the use of DCRA in studies that include older populations with a high prevalence of vertebral fractures. Thus, we developed and tested a modified DCRA algorithm that does not depend on vertebral shape. Participants included 1186 men and women from the Framingham Heart Study Offspring and Third Generation Multidetector CT Study. Lateral CT scout images were used to place 6 morphometry points around each vertebra at 13 vertebral levels in each participant. Disc heights were calculated utilizing these morphometry points using DCRA methodology and our modified version of DCRA, which requires information from fewer morphometry points than the standard DCRA. Modified DCRA and standard DCRA measures of disc height are highly correlated, with concordance correlation coefficients above 0.999. Both measures demonstrate good inter- and intra-operator reproducibility. 13.9 % of available disc heights were not evaluable or excluded using the standard DCRA algorithm, while only 3.3 % of disc heights were not evaluable using our modified DCRA algorithm. Using our modified DCRA algorithm, it is not necessary to exclude vertebrae with fracture or other deformity from disc height measurements as in the standard DCRA. Modified DCRA also yields identical measurements to the standard DCRA. Thus, the use of modified DCRA for quantitative assessment of disc height will lead to less missing data without any loss of accuracy, making it a preferred alternative to the current standard methodology.

  13. Design and evaluation of a multi-epitope assembly Peptide (MEAP) against herpes simplex virus type 2 infection in BALB/c mice

    PubMed Central

    2011-01-01

    Background Human herpes simplex virus (HSV) 1 and 2 causes oral, ocular, or genital infections, which remains a significant health problem worldwide. HSV-1 and -2 infections in humans range from localized skin infections of the oral, ocular, and genital regions to severe and often disseminated infections in immunocompromised hosts. Epitope based vaccination is a promising mean to achieve protective immunity and to avoid infections with Human herpes simplex virus type 2 (HSV-2). Methods The twelve selected epitopes, six B cell epitopes from different glycoprotein of HSV-2 (amino acid residues 466-473 (EQDRKPRN) from envelope glycoprotein B, 216-223 (GRTDRPSA) from C, 6-18 (DPSLKMADPNRFR) from D, 483-491 (DPPERPDSP) from E, 572-579 (EPPDDDDS) from G and 286-295 (CRRRYRRPRG) from I glycoprotein of HSV-2), four CD4+ T cell epitopes (amino acid residues 21-28 (NLPVLDQL) from D, 162-177 (KDVTVSQVWFGHRYSQ) from B, 205-224 (KAYQQGVTVDSIGMLPRFIP) from D and 245-259 (KPPYTSTLLPPELSD) from D) and two CD8+ T cell epitopes (amino acid residues 10-20 (KMADPNRFRGK) from D and 268-276 (ALLEDPAGT) from D), are responsible for the elicitation of the neutralizing antibodies and cytotoxic T lymphocytes (CTLs) that impart protective immunity to the host. In this study, all above epitopes were inserted into the extracellular fragment (amino acid residues 1-290) of HSV-2 glycoprotein D to construct multi-epitope assembly peptides (MEAPs) by replacing some non-epitope amino acid sequences. The epitope independency of the MEAPs was predicted by three-dimensional software algorithms. The gene of the selected MEAP was expressed in E.coli BL21(DE3), and its protective efficacy against HSV-2 infection was assessed in BALB/c mice. Results The MEAP, with each inserted epitopes independently displayed on the molecule surface, was selected as candidate proteins. The results showed that the MEAP was highly immunogenic and could elicit high titer neutralizing antibodies and cell-mediated immune responses. Conclusions The MEAP provided complete protection against infection with HSV-2 in mice, which indicates that it might be a potential candidate vaccine against HSV-2. PMID:21575169

  14. On the existence of binary simplex codes. [using combinatorial construction

    NASA Technical Reports Server (NTRS)

    Taylor, H.

    1977-01-01

    Using a simple combinatorial construction, the existence of a binary simplex code with m codewords for all m is greater than or equal to 1 is proved. The problem of the shortest possible length is left open.

  15. IL-12 Expressing oncolytic herpes simplex virus promotes anti-tumor activity and immunologic control of metastatic ovarian cancer in mice.

    PubMed

    Thomas, Eric D; Meza-Perez, Selene; Bevis, Kerri S; Randall, Troy D; Gillespie, G Yancey; Langford, Catherine; Alvarez, Ronald D

    2016-10-27

    Despite advances in surgical aggressiveness and conventional chemotherapy, ovarian cancer remains the most lethal cause of gynecologic cancer mortality; consequently there is a need for new therapeutic agents and innovative treatment paradigms for the treatment of ovarian cancer. Several studies have demonstrated that ovarian cancer is an immunogenic disease and immunotherapy represents a promising and novel approach that has not been completely evaluated in ovarian cancer. Our objective was to evaluate the anti-tumor activity of an oncolytic herpes simplex virus "armed" with murine interleukin-12 and its ability to elicit tumor-specific immune responses. We evaluated the ability of interleukin-12-expressing and control oncolytic herpes simplex virus to kill murine and human ovarian cancer cell lines in vitro. We also administered interleukin-12-expressing oncolytic herpes simplex virus to the peritoneal cavity of mice that had developed spontaneous, metastatic ovarian cancer and determined overall survival and tumor burden at 95 days. We used flow cytometry to quantify the tumor antigen-specific CD8 + T cell response in the omentum and peritoneal cavity. All ovarian cancer cell lines demonstrated susceptibility to oncolytic herpes simplex virus in vitro. Compared to controls, mice treated with interleukin-12-expressing oncolytic herpes simplex virus demonstrated a more robust tumor antigen-specific CD8 + T-cell immune response in the omentum (471.6 cells vs 33.1 cells; p = 0.02) and peritoneal cavity (962.3 cells vs 179.5 cells; p = 0.05). Compared to controls, mice treated with interleukin-12-expressing oncolytic herpes simplex virus were more likely to control ovarian cancer metastases (81.2 % vs 18.2 %; p = 0.008) and had a significantly longer overall survival (p = 0.02). Finally, five of 6 mice treated with interleukin-12-expressing oHSV had no evidence of metastatic tumor when euthanized at 6 months, compared to two of 4 mice treated with sterile phosphate buffer solution. Our pilot study demonstrates that an interleukin-12-expressing oncolytic herpes simplex virus effectively kills both murine and human ovarian cancer cell lines and promotes tumor antigen-specific CD8 + T-cell responses in the peritoneal cavity and omentum, leading to reduced peritoneal metastasis and improved survival in a mouse model.

  16. A multi-stage heuristic algorithm for matching problem in the modified miniload automated storage and retrieval system of e-commerce

    NASA Astrophysics Data System (ADS)

    Wang, Wenrui; Wu, Yaohua; Wu, Yingying

    2016-05-01

    E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can't fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.

  17. Modified Polar-Format Software for Processing SAR Data

    NASA Technical Reports Server (NTRS)

    Chen, Curtis

    2003-01-01

    HMPF is a computer program that implements a modified polar-format algorithm for processing data from spaceborne synthetic-aperture radar (SAR) systems. Unlike prior polar-format processing algorithms, this algorithm is based on the assumption that the radar signal wavefronts are spherical rather than planar. The algorithm provides for resampling of SAR pulse data from slant range to radial distance from the center of a reference sphere that is nominally the local Earth surface. Then, invoking the projection-slice theorem, the resampled pulse data are Fourier-transformed over radial distance, arranged in the wavenumber domain according to the acquisition geometry, resampled to a Cartesian grid, and inverse-Fourier-transformed. The result of this process is the focused SAR image. HMPF, and perhaps other programs that implement variants of the algorithm, may give better accuracy than do prior algorithms for processing strip-map SAR data from high altitudes and may give better phase preservation relative to prior polar-format algorithms for processing spotlight-mode SAR data.

  18. Non-uniform cosine modulated filter banks using meta-heuristic algorithms in CSD space.

    PubMed

    Kalathil, Shaeen; Elias, Elizabeth

    2015-11-01

    This paper presents an efficient design of non-uniform cosine modulated filter banks (CMFB) using canonic signed digit (CSD) coefficients. CMFB has got an easy and efficient design approach. Non-uniform decomposition can be easily obtained by merging the appropriate filters of a uniform filter bank. Only the prototype filter needs to be designed and optimized. In this paper, the prototype filter is designed using window method, weighted Chebyshev approximation and weighted constrained least square approximation. The coefficients are quantized into CSD, using a look-up-table. The finite precision CSD rounding, deteriorates the filter bank performances. The performances of the filter bank are improved using suitably modified meta-heuristic algorithms. The different meta-heuristic algorithms which are modified and used in this paper are Artificial Bee Colony algorithm, Gravitational Search algorithm, Harmony Search algorithm and Genetic algorithm and they result in filter banks with less implementation complexity, power consumption and area requirements when compared with those of the conventional continuous coefficient non-uniform CMFB.

  19. Non-uniform cosine modulated filter banks using meta-heuristic algorithms in CSD space

    PubMed Central

    Kalathil, Shaeen; Elias, Elizabeth

    2014-01-01

    This paper presents an efficient design of non-uniform cosine modulated filter banks (CMFB) using canonic signed digit (CSD) coefficients. CMFB has got an easy and efficient design approach. Non-uniform decomposition can be easily obtained by merging the appropriate filters of a uniform filter bank. Only the prototype filter needs to be designed and optimized. In this paper, the prototype filter is designed using window method, weighted Chebyshev approximation and weighted constrained least square approximation. The coefficients are quantized into CSD, using a look-up-table. The finite precision CSD rounding, deteriorates the filter bank performances. The performances of the filter bank are improved using suitably modified meta-heuristic algorithms. The different meta-heuristic algorithms which are modified and used in this paper are Artificial Bee Colony algorithm, Gravitational Search algorithm, Harmony Search algorithm and Genetic algorithm and they result in filter banks with less implementation complexity, power consumption and area requirements when compared with those of the conventional continuous coefficient non-uniform CMFB. PMID:26644921

  20. Developing a New Wireless Sensor Network Platform and Its Application in Precision Agriculture

    PubMed Central

    Aquino-Santos, Raúl; González-Potes, Apolinar; Edwards-Block, Arthur; Virgen-Ortiz, Raúl Alejandro

    2011-01-01

    Wireless sensor networks are gaining greater attention from the research community and industrial professionals because these small pieces of “smart dust” offer great advantages due to their small size, low power consumption, easy integration and support for “green” applications. Green applications are considered a hot topic in intelligent environments, ubiquitous and pervasive computing. This work evaluates a new wireless sensor network platform and its application in precision agriculture, including its embedded operating system and its routing algorithm. To validate the technological platform and the embedded operating system, two different routing strategies were compared: hierarchical and flat. Both of these routing algorithms were tested in a small-scale network applied to a watermelon field. However, we strongly believe that this technological platform can be also applied to precision agriculture because it incorporates a modified version of LORA-CBF, a wireless location-based routing algorithm that uses cluster-based flooding. Cluster-based flooding addresses the scalability concerns of wireless sensor networks, while the modified LORA-CBF routing algorithm includes a metric to monitor residual battery energy. Furthermore, results show that the modified version of LORA-CBF functions well with both the flat and hierarchical algorithms, although it functions better with the flat algorithm in a small-scale agricultural network. PMID:22346622

  1. Developing a new wireless sensor network platform and its application in precision agriculture.

    PubMed

    Aquino-Santos, Raúl; González-Potes, Apolinar; Edwards-Block, Arthur; Virgen-Ortiz, Raúl Alejandro

    2011-01-01

    Wireless sensor networks are gaining greater attention from the research community and industrial professionals because these small pieces of "smart dust" offer great advantages due to their small size, low power consumption, easy integration and support for "green" applications. Green applications are considered a hot topic in intelligent environments, ubiquitous and pervasive computing. This work evaluates a new wireless sensor network platform and its application in precision agriculture, including its embedded operating system and its routing algorithm. To validate the technological platform and the embedded operating system, two different routing strategies were compared: hierarchical and flat. Both of these routing algorithms were tested in a small-scale network applied to a watermelon field. However, we strongly believe that this technological platform can be also applied to precision agriculture because it incorporates a modified version of LORA-CBF, a wireless location-based routing algorithm that uses cluster-based flooding. Cluster-based flooding addresses the scalability concerns of wireless sensor networks, while the modified LORA-CBF routing algorithm includes a metric to monitor residual battery energy. Furthermore, results show that the modified version of LORA-CBF functions well with both the flat and hierarchical algorithms, although it functions better with the flat algorithm in a small-scale agricultural network.

  2. Modified compensation algorithm of lever-arm effect and flexural deformation for polar shipborne transfer alignment based on improved adaptive Kalman filter

    NASA Astrophysics Data System (ADS)

    Wang, Tongda; Cheng, Jianhua; Guan, Dongxue; Kang, Yingyao; Zhang, Wei

    2017-09-01

    Due to the lever-arm effect and flexural deformation in the practical application of transfer alignment (TA), the TA performance is decreased. The existing polar TA algorithm only compensates a fixed lever-arm without considering the dynamic lever-arm caused by flexural deformation; traditional non-polar TA algorithms also have some limitations. Thus, the performance of existing compensation algorithms is unsatisfactory. In this paper, a modified compensation algorithm of the lever-arm effect and flexural deformation is proposed to promote the accuracy and speed of the polar TA. On the basis of a dynamic lever-arm model and a noise compensation method for flexural deformation, polar TA equations are derived in grid frames. Based on the velocity-plus-attitude matching method, the filter models of polar TA are designed. An adaptive Kalman filter (AKF) is improved to promote the robustness and accuracy of the system, and then applied to the estimation of the misalignment angles. Simulation and experiment results have demonstrated that the modified compensation algorithm based on the improved AKF for polar TA can effectively compensate the lever-arm effect and flexural deformation, and then improve the accuracy and speed of TA in the polar region.

  3. Projective-Dual Method for Solving Systems of Linear Equations with Nonnegative Variables

    NASA Astrophysics Data System (ADS)

    Ganin, B. V.; Golikov, A. I.; Evtushenko, Yu. G.

    2018-02-01

    In order to solve an underdetermined system of linear equations with nonnegative variables, the projection of a given point onto its solutions set is sought. The dual of this problem—the problem of unconstrained maximization of a piecewise-quadratic function—is solved by Newton's method. The problem of unconstrained optimization dual of the regularized problem of finding the projection onto the solution set of the system is considered. A connection of duality theory and Newton's method with some known algorithms of projecting onto a standard simplex is shown. On the example of taking into account the specifics of the constraints of the transport linear programming problem, the possibility to increase the efficiency of calculating the generalized Hessian matrix is demonstrated. Some examples of numerical calculations using MATLAB are presented.

  4. Minimization of three-dimensional beam emittance growth in rare-isotope accelerator

    NASA Astrophysics Data System (ADS)

    Oh, B. H.; Yoon, M.

    2016-12-01

    In this paper, we describe a research to minimize the three-dimensional (3D) emittance growth (EG) in the RAON accelerator, a heavy ion accelerator currently being developed in Korea to produce various rare isotopes. The emittance minimization is performed using the multi-objective genetic algorithm and the simplex method. We use them to analyze the driver linac for the in-flight fragmentation separator of the RAON facility and show that redesign of the 90-degree bending section of the RAON accelerator together with adjustment of optics in the upstream and downstream superconducting linacs can limit the 3D EG to 20 % in the entire region of the driver linac. Effects of various magnet and rf accelerating cavity errors on the beam-EG are also discussed.

  5. NASA/RAE collaboration on nonlinear control using the F-8C digital fly-by-wire aircraft

    NASA Technical Reports Server (NTRS)

    Butler, G. F.; Corbin, M. J.; Mepham, S.; Stewart, J. F.; Larson, R. R.

    1983-01-01

    Design procedures are reviewed for variable integral control to optimize response (VICTOR) algorithms and results of preliminary flight tests are presented. The F-8C aircraft is operated in the remotely augmented vehicle (RAV) mode, with the control laws implemented as FORTRAN programs on a ground-based computer. Pilot commands and sensor information are telemetered to the ground, where the data are processed to form surface commands which are then telemetered back to the aircraft. The RAV mode represents a singlestring (simplex) system and is therefore vulnerable to a hardover since comparison monitoring is not possible. Hence, extensive error checking is conducted on both the ground and airborne computers to prevent the development of potentially hazardous situations. Experience with the RAV monitoring and validation procedures is described.

  6. Dictionary Indexing of Electron Channeling Patterns.

    PubMed

    Singh, Saransh; De Graef, Marc

    2017-02-01

    The dictionary-based approach to the indexing of diffraction patterns is applied to electron channeling patterns (ECPs). The main ingredients of the dictionary method are introduced, including the generalized forward projector (GFP), the relevant detector model, and a scheme to uniformly sample orientation space using the "cubochoric" representation. The GFP is used to compute an ECP "master" pattern. Derivative free optimization algorithms, including the Nelder-Mead simplex and the bound optimization by quadratic approximation are used to determine the correct detector parameters and to refine the orientation obtained from the dictionary approach. The indexing method is applied to poly-silicon and shows excellent agreement with the calibrated values. Finally, it is shown that the method results in a mean disorientation error of 1.0° with 0.5° SD for a range of detector parameters.

  7. Lifetime Prediction of IGBT in a STATCOM Using Modified-Graphical Rainflow Counting Algorithm

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Gopi Reddy, Lakshmi Reddy; Tolbert, Leon M; Ozpineci, Burak

    Rainflow algorithms are one of the best counting methods used in fatigue and failure analysis [17]. There have been many approaches to the rainflow algorithm, some proposing modifications. Graphical Rainflow Method (GRM) was proposed recently with a claim of faster execution times [10]. However, the steps of the graphical method of rainflow algorithm, when implemented, do not generate the same output as the four-point or ASTM standard algorithm. A modified graphical method is presented and discussed in this paper to overcome the shortcomings of graphical rainflow algorithm. A fast rainflow algorithm based on four-point algorithm but considering point comparison thanmore » range comparison is also presented. A comparison between the performances of the common rainflow algorithms [6-10], including the proposed methods, in terms of execution time, memory used, and efficiency, complexity, and load sequences is presented. Finally, the rainflow algorithm is applied to temperature data of an IGBT in assessing the lifetime of a STATCOM operating for power factor correction of the load. From 5-minute data load profiles available, the lifetime is estimated to be at 3.4 years.« less

  8. Improvement on sugar cane bagasse hydrolysis using enzymatic mixture designed cocktail.

    PubMed

    Bussamra, Bianca Consorti; Freitas, Sindelia; Costa, Aline Carvalho da

    2015-01-01

    The aim of this work was to study cocktail supplementation for sugar cane bagasse hydrolysis, where the enzymes were provided from both commercial source and microorganism cultivation (Trichoderma reesei and genetically modified Escherichia coli), followed by purification. Experimental simplex lattice mixture design was performed to optimize the enzymatic proportion. The response was evaluated through hydrolysis microassays validated here. The optimized enzyme mixture, comprised of T. reesei fraction (80%), endoglucanase (10%) and β-glucosidase (10%), converted, theoretically, 72% of cellulose present in hydrothermally pretreated bagasse, whereas commercial Celluclast 1.5L converts 49.11%±0.49. Thus, a rational enzyme mixture designed by using synergism concept and statistical analysis was capable of improving biomass saccharification. Copyright © 2015 Elsevier Ltd. All rights reserved.

  9. Simplex-stochastic collocation method with improved scalability

    NASA Astrophysics Data System (ADS)

    Edeling, W. N.; Dwight, R. P.; Cinnella, P.

    2016-04-01

    The Simplex-Stochastic Collocation (SSC) method is a robust tool used to propagate uncertain input distributions through a computer code. However, it becomes prohibitively expensive for problems with dimensions higher than 5. The main purpose of this paper is to identify bottlenecks, and to improve upon this bad scalability. In order to do so, we propose an alternative interpolation stencil technique based upon the Set-Covering problem, and we integrate the SSC method in the High-Dimensional Model-Reduction framework. In addition, we address the issue of ill-conditioned sample matrices, and we present an analytical map to facilitate uniformly-distributed simplex sampling.

  10. Amplification of Herpes Simplex Virus Types 1 and 2 and Human Herpes Virus Type 5 Polymerase Gene Segment From Formalin-Fixed Brain Tissue From Alzheimer’s Disease Patients

    DTIC Science & Technology

    2005-08-01

    The neuronal nitric oxide synthase (NOS1) gene target was amplified and sequenced in all samples tested, in addition to HSV1 , HSV2 , or Human Herpes...Triphosphate DNA Deoxyribonucleic acid GAPDH Glyceraldehyde-3 -phosphate dehydrogenase HSV Herpes Simplex Virus HSV1 Herpes Simplex Virus Type 1 HSV2 Herpes... HSV2 ) share 50-70 % homology. HSV1 is primarily associated with oral and ocular lesions, while HSV2 is primarily associated with genital and anal lesions

  11. T cell-macrophage interaction in arginase-mediated resistance to herpes simplex virus.

    PubMed

    Bonina, L; Nash, A A; Arena, A; Leung, K N; Wildy, P

    1984-09-01

    Peritoneal macrophages activated by-products derived from a herpes simplex virus-specific helper T cell clone were used to investigate intrinsic and extrinsic resistance mechanisms to herpes simplex virus type 1 infection in vitro. T cell-activated macrophages produced fewer infective centres, indicating enhanced intrinsic resistance, and markedly reduced the growth of virus in a permissive cell line. The reduction in virus growth correlated with the depletion of arginine in the support medium, presumably resulting from increased arginase production by activated macrophages. The significance of these findings for antiviral immunity in vivo is discussed.

  12. Herpes Simplex Virus Infections of the Central Nervous System.

    PubMed

    Whitley, Richard J

    2015-12-01

    This article summarizes knowledge of herpes simplex virus (HSV) infections of the central nervous system (CNS). Disease pathogenesis, detection of DNA polymerase chain reaction (PCR) for diagnosis and prognosis, and approaches to therapy warrant consideration. HSV infection of the CNS is one of few treatable viral diseases. Clinical trials indicate that outcome following neonatal herpes simplex virus type 2 (HSV-2) infections of the CNS is significantly improved when 6 months of suppressive oral acyclovir therapy follows IV antiviral therapy. In contrast, herpes simplex virus type 1 (HSV-1) infections of the brain do not benefit from extended oral antiviral therapy. This implies a difference in disease pathogenesis between HSV-2 and HSV-1 infections of the brain. PCR detection of viral DNA in the CSF is the gold standard for diagnosis. Use of PCR is now being adopted as a basis for determining the duration of therapy in the newborn. HSV infections are among the most common encountered by humans; seropositivity occurs in 50% to 90% of adult populations. Herpes simplex encephalitis, however, is an uncommon result of this infection. Since no new antiviral drugs have been introduced in nearly 3 decades, much effort has focused on learning how to better use acyclovir and how to use existing databases to establish earlier diagnosis.

  13. An Empirical Derivation of the Run Time of the Bubble Sort Algorithm.

    ERIC Educational Resources Information Center

    Gonzales, Michael G.

    1984-01-01

    Suggests a moving pictorial tool to help teach principles in the bubble sort algorithm. Develops such a tool applied to an unsorted list of numbers and describes a method to derive the run time of the algorithm. The method can be modified to run the times of various other algorithms. (JN)

  14. Two-Swim Operators in the Modified Bacterial Foraging Algorithm for the Optimal Synthesis of Four-Bar Mechanisms

    PubMed Central

    Hernández-Ocaña, Betania; Pozos-Parra, Ma. Del Pilar; Mezura-Montes, Efrén; Portilla-Flores, Edgar Alfredo; Vega-Alvarado, Eduardo; Calva-Yáñez, Maria Bárbara

    2016-01-01

    This paper presents two-swim operators to be added to the chemotaxis process of the modified bacterial foraging optimization algorithm to solve three instances of the synthesis of four-bar planar mechanisms. One swim favors exploration while the second one promotes fine movements in the neighborhood of each bacterium. The combined effect of the new operators looks to increase the production of better solutions during the search. As a consequence, the ability of the algorithm to escape from local optimum solutions is enhanced. The algorithm is tested through four experiments and its results are compared against two BFOA-based algorithms and also against a differential evolution algorithm designed for mechanical design problems. The overall results indicate that the proposed algorithm outperforms other BFOA-based approaches and finds highly competitive mechanisms, with a single set of parameter values and with less evaluations in the first synthesis problem, with respect to those mechanisms obtained by the differential evolution algorithm, which needed a parameter fine-tuning process for each optimization problem. PMID:27057156

  15. Two-Swim Operators in the Modified Bacterial Foraging Algorithm for the Optimal Synthesis of Four-Bar Mechanisms.

    PubMed

    Hernández-Ocaña, Betania; Pozos-Parra, Ma Del Pilar; Mezura-Montes, Efrén; Portilla-Flores, Edgar Alfredo; Vega-Alvarado, Eduardo; Calva-Yáñez, Maria Bárbara

    2016-01-01

    This paper presents two-swim operators to be added to the chemotaxis process of the modified bacterial foraging optimization algorithm to solve three instances of the synthesis of four-bar planar mechanisms. One swim favors exploration while the second one promotes fine movements in the neighborhood of each bacterium. The combined effect of the new operators looks to increase the production of better solutions during the search. As a consequence, the ability of the algorithm to escape from local optimum solutions is enhanced. The algorithm is tested through four experiments and its results are compared against two BFOA-based algorithms and also against a differential evolution algorithm designed for mechanical design problems. The overall results indicate that the proposed algorithm outperforms other BFOA-based approaches and finds highly competitive mechanisms, with a single set of parameter values and with less evaluations in the first synthesis problem, with respect to those mechanisms obtained by the differential evolution algorithm, which needed a parameter fine-tuning process for each optimization problem.

  16. A Modified MinMax k-Means Algorithm Based on PSO.

    PubMed

    Wang, Xiaoyan; Bai, Yanping

    The MinMax k -means algorithm is widely used to tackle the effect of bad initialization by minimizing the maximum intraclustering errors. Two parameters, including the exponent parameter and memory parameter, are involved in the executive process. Since different parameters have different clustering errors, it is crucial to choose appropriate parameters. In the original algorithm, a practical framework is given. Such framework extends the MinMax k -means to automatically adapt the exponent parameter to the data set. It has been believed that if the maximum exponent parameter has been set, then the programme can reach the lowest intraclustering errors. However, our experiments show that this is not always correct. In this paper, we modified the MinMax k -means algorithm by PSO to determine the proper values of parameters which can subject the algorithm to attain the lowest clustering errors. The proposed clustering method is tested on some favorite data sets in several different initial situations and is compared to the k -means algorithm and the original MinMax k -means algorithm. The experimental results indicate that our proposed algorithm can reach the lowest clustering errors automatically.

  17. A Modified Distributed Bees Algorithm for Multi-Sensor Task Allocation.

    PubMed

    Tkach, Itshak; Jevtić, Aleksandar; Nof, Shimon Y; Edan, Yael

    2018-03-02

    Multi-sensor systems can play an important role in monitoring tasks and detecting targets. However, real-time allocation of heterogeneous sensors to dynamic targets/tasks that are unknown a priori in their locations and priorities is a challenge. This paper presents a Modified Distributed Bees Algorithm (MDBA) that is developed to allocate stationary heterogeneous sensors to upcoming unknown tasks using a decentralized, swarm intelligence approach to minimize the task detection times. Sensors are allocated to tasks based on sensors' performance, tasks' priorities, and the distances of the sensors from the locations where the tasks are being executed. The algorithm was compared to a Distributed Bees Algorithm (DBA), a Bees System, and two common multi-sensor algorithms, market-based and greedy-based algorithms, which were fitted for the specific task. Simulation analyses revealed that MDBA achieved statistically significant improved performance by 7% with respect to DBA as the second-best algorithm, and by 19% with respect to Greedy algorithm, which was the worst, thus indicating its fitness to provide solutions for heterogeneous multi-sensor systems.

  18. A Modified Distributed Bees Algorithm for Multi-Sensor Task Allocation †

    PubMed Central

    Nof, Shimon Y.; Edan, Yael

    2018-01-01

    Multi-sensor systems can play an important role in monitoring tasks and detecting targets. However, real-time allocation of heterogeneous sensors to dynamic targets/tasks that are unknown a priori in their locations and priorities is a challenge. This paper presents a Modified Distributed Bees Algorithm (MDBA) that is developed to allocate stationary heterogeneous sensors to upcoming unknown tasks using a decentralized, swarm intelligence approach to minimize the task detection times. Sensors are allocated to tasks based on sensors’ performance, tasks’ priorities, and the distances of the sensors from the locations where the tasks are being executed. The algorithm was compared to a Distributed Bees Algorithm (DBA), a Bees System, and two common multi-sensor algorithms, market-based and greedy-based algorithms, which were fitted for the specific task. Simulation analyses revealed that MDBA achieved statistically significant improved performance by 7% with respect to DBA as the second-best algorithm, and by 19% with respect to Greedy algorithm, which was the worst, thus indicating its fitness to provide solutions for heterogeneous multi-sensor systems. PMID:29498683

  19. Novel Role for Protein Inhibitor of Activated STAT 4 (PIAS4) in the Restriction of Herpes Simplex Virus 1 by the Cellular Intrinsic Antiviral Immune Response.

    PubMed

    Conn, Kristen L; Wasson, Peter; McFarlane, Steven; Tong, Lily; Brown, James R; Grant, Kyle G; Domingues, Patricia; Boutell, Chris

    2016-05-01

    Small ubiquitin-like modifier (SUMO) is used by the intrinsic antiviral immune response to restrict viral pathogens, such as herpes simplex virus 1 (HSV-1). Despite characterization of the host factors that rely on SUMOylation to exert their antiviral effects, the enzymes that mediate these SUMOylation events remain to be defined. We show that unconjugated SUMO levels are largely maintained throughout infection regardless of the presence of ICP0, the HSV-1 SUMO-targeted ubiquitin ligase. Moreover, in the absence of ICP0, high-molecular-weight SUMO-conjugated proteins do not accumulate if HSV-1 DNA does not replicate. These data highlight the continued importance for SUMO signaling throughout infection. We show that the SUMO ligase protein inhibitor of activated STAT 4 (PIAS4) is upregulated during HSV-1 infection and localizes to nuclear domains that contain viral DNA. PIAS4 is recruited to sites associated with HSV-1 genome entry through SUMO interaction motif (SIM)-dependent mechanisms that are destabilized by ICP0. In contrast, PIAS4 accumulates in replication compartments through SIM-independent mechanisms irrespective of ICP0 expression. Depletion of PIAS4 enhances the replication of ICP0-null mutant HSV-1, which is susceptible to restriction by the intrinsic antiviral immune response. The mechanisms of PIAS4-mediated restriction are synergistic with the restriction mechanisms of a characterized intrinsic antiviral factor, promyelocytic leukemia protein, and are antagonized by ICP0. We provide the first evidence that PIAS4 is an intrinsic antiviral factor. This novel role for PIAS4 in intrinsic antiviral immunity contrasts with the known roles of PIAS proteins as suppressors of innate immunity. Posttranslational modifications with small ubiquitin-like modifier (SUMO) proteins regulate multiple aspects of host immunity and viral replication. The protein inhibitor of activated STAT (PIAS) family of SUMO ligases is predominantly associated with the suppression of innate immune signaling. We now identify a unique and contrasting role for PIAS proteins as positive regulators of the intrinsic antiviral immune response to herpes simplex virus 1 (HSV-1) infection. We show that PIAS4 relocalizes to nuclear domains that contain viral DNA throughout infection. Depletion of PIAS4, either alone or in combination with the intrinsic antiviral factor promyelocytic leukemia protein, significantly impairs the intrinsic antiviral immune response to HSV-1 infection. Our data reveal a novel and dynamic role for PIAS4 in the cellular-mediated restriction of herpesviruses and establish a new functional role for the PIAS family of SUMO ligases in the intrinsic antiviral immune response to DNA virus infection. Copyright © 2016 Conn et al.

  20. Novel Role for Protein Inhibitor of Activated STAT 4 (PIAS4) in the Restriction of Herpes Simplex Virus 1 by the Cellular Intrinsic Antiviral Immune Response

    PubMed Central

    Conn, Kristen L.; Wasson, Peter; McFarlane, Steven; Tong, Lily; Brown, James R.; Grant, Kyle G.; Domingues, Patricia

    2016-01-01

    ABSTRACT Small ubiquitin-like modifier (SUMO) is used by the intrinsic antiviral immune response to restrict viral pathogens, such as herpes simplex virus 1 (HSV-1). Despite characterization of the host factors that rely on SUMOylation to exert their antiviral effects, the enzymes that mediate these SUMOylation events remain to be defined. We show that unconjugated SUMO levels are largely maintained throughout infection regardless of the presence of ICP0, the HSV-1 SUMO-targeted ubiquitin ligase. Moreover, in the absence of ICP0, high-molecular-weight SUMO-conjugated proteins do not accumulate if HSV-1 DNA does not replicate. These data highlight the continued importance for SUMO signaling throughout infection. We show that the SUMO ligase protein inhibitor of activated STAT 4 (PIAS4) is upregulated during HSV-1 infection and localizes to nuclear domains that contain viral DNA. PIAS4 is recruited to sites associated with HSV-1 genome entry through SUMO interaction motif (SIM)-dependent mechanisms that are destabilized by ICP0. In contrast, PIAS4 accumulates in replication compartments through SIM-independent mechanisms irrespective of ICP0 expression. Depletion of PIAS4 enhances the replication of ICP0-null mutant HSV-1, which is susceptible to restriction by the intrinsic antiviral immune response. The mechanisms of PIAS4-mediated restriction are synergistic with the restriction mechanisms of a characterized intrinsic antiviral factor, promyelocytic leukemia protein, and are antagonized by ICP0. We provide the first evidence that PIAS4 is an intrinsic antiviral factor. This novel role for PIAS4 in intrinsic antiviral immunity contrasts with the known roles of PIAS proteins as suppressors of innate immunity. IMPORTANCE Posttranslational modifications with small ubiquitin-like modifier (SUMO) proteins regulate multiple aspects of host immunity and viral replication. The protein inhibitor of activated STAT (PIAS) family of SUMO ligases is predominantly associated with the suppression of innate immune signaling. We now identify a unique and contrasting role for PIAS proteins as positive regulators of the intrinsic antiviral immune response to herpes simplex virus 1 (HSV-1) infection. We show that PIAS4 relocalizes to nuclear domains that contain viral DNA throughout infection. Depletion of PIAS4, either alone or in combination with the intrinsic antiviral factor promyelocytic leukemia protein, significantly impairs the intrinsic antiviral immune response to HSV-1 infection. Our data reveal a novel and dynamic role for PIAS4 in the cellular-mediated restriction of herpesviruses and establish a new functional role for the PIAS family of SUMO ligases in the intrinsic antiviral immune response to DNA virus infection. PMID:26937035

  1. Speech enhancement based on modified phase-opponency detectors

    NASA Astrophysics Data System (ADS)

    Deshmukh, Om D.; Espy-Wilson, Carol Y.

    2005-09-01

    A speech enhancement algorithm based on a neural model was presented by Deshmukh et al., [149th meeting of the Acoustical Society America, 2005]. The algorithm consists of a bank of Modified Phase Opponency (MPO) filter pairs tuned to different center frequencies. This algorithm is able to enhance salient spectral features in speech signals even at low signal-to-noise ratios. However, the algorithm introduces musical noise and sometimes misses a spectral peak that is close in frequency to a stronger spectral peak. Refinement in the design of the MPO filters was recently made that takes advantage of the falling spectrum of the speech signal in sonorant regions. The modified set of filters leads to better separation of the noise and speech signals, and more accurate enhancement of spectral peaks. The improvements also lead to a significant reduction in musical noise. Continuity algorithms based on the properties of speech signals are used to further reduce the musical noise effect. The efficiency of the proposed method in enhancing the speech signal when the level of the background noise is fluctuating will be demonstrated. The performance of the improved speech enhancement method will be compared with various spectral subtraction-based methods. [Work supported by NSF BCS0236707.

  2. A time series based sequence prediction algorithm to detect activities of daily living in smart home.

    PubMed

    Marufuzzaman, M; Reaz, M B I; Ali, M A M; Rahman, L F

    2015-01-01

    The goal of smart homes is to create an intelligent environment adapting the inhabitants need and assisting the person who needs special care and safety in their daily life. This can be reached by collecting the ADL (activities of daily living) data and further analysis within existing computing elements. In this research, a very recent algorithm named sequence prediction via enhanced episode discovery (SPEED) is modified and in order to improve accuracy time component is included. The modified SPEED or M-SPEED is a sequence prediction algorithm, which modified the previous SPEED algorithm by using time duration of appliance's ON-OFF states to decide the next state. M-SPEED discovered periodic episodes of inhabitant behavior, trained it with learned episodes, and made decisions based on the obtained knowledge. The results showed that M-SPEED achieves 96.8% prediction accuracy, which is better than other time prediction algorithms like PUBS, ALZ with temporal rules and the previous SPEED. Since human behavior shows natural temporal patterns, duration times can be used to predict future events more accurately. This inhabitant activity prediction system will certainly improve the smart homes by ensuring safety and better care for elderly and handicapped people.

  3. Multipass Target Search in Natural Environments

    PubMed Central

    Otte, Michael W.; Sofge, Donald; Gupta, Satyandra K.

    2017-01-01

    Consider a disaster scenario where search and rescue workers must search difficult to access buildings during an earthquake or flood. Often, finding survivors a few hours sooner results in a dramatic increase in saved lives, suggesting the use of drones for expedient rescue operations. Entropy can be used to quantify the generation and resolution of uncertainty. When searching for targets, maximizing mutual information of future sensor observations will minimize expected target location uncertainty by minimizing the entropy of the future estimate. Motion planning for multi-target autonomous search requires planning over an area with an imperfect sensor and may require multiple passes, which is hindered by the submodularity property of mutual information. Further, mission duration constraints must be handled accordingly, requiring consideration of the vehicle’s dynamics to generate feasible trajectories and must plan trajectories spanning the entire mission duration, something which most information gathering algorithms are incapable of doing. If unanticipated changes occur in an uncertain environment, new plans must be generated quickly. In addition, planning multipass trajectories requires evaluating path dependent rewards, requiring planning in the space of all previously selected actions, compounding the problem. We present an anytime algorithm for autonomous multipass target search in natural environments. The algorithm is capable of generating long duration dynamically feasible multipass coverage plans that maximize mutual information using a variety of techniques such as ϵ-admissible heuristics to speed up the search. To the authors’ knowledge this is the first attempt at efficiently solving multipass target search problems of such long duration. The proposed algorithm is based on best first branch and bound and is benchmarked against state of the art algorithms adapted to the problem in natural Simplex environments, gathering the most information in the given search time. PMID:29099087

  4. Evaluation of the selection methods used in the exIWO algorithm based on the optimization of multidimensional functions

    NASA Astrophysics Data System (ADS)

    Kostrzewa, Daniel; Josiński, Henryk

    2016-06-01

    The expanded Invasive Weed Optimization algorithm (exIWO) is an optimization metaheuristic modelled on the original IWO version inspired by dynamic growth of weeds colony. The authors of the present paper have modified the exIWO algorithm introducing a set of both deterministic and non-deterministic strategies of individuals' selection. The goal of the project was to evaluate the modified exIWO by testing its usefulness for multidimensional numerical functions optimization. The optimized functions: Griewank, Rastrigin, and Rosenbrock are frequently used as benchmarks because of their characteristics.

  5. Recurrent lumbosacral herpes simplex virus infection

    PubMed Central

    Vassantachart, Janna M.

    2016-01-01

    We present the case of a 54-year-old white woman with episodic lumbosacral lesions that she had been treating as psoriasis. Evaluation revealed classic herpes simplex virus (HSV) infection. The discussion reviews the significance and potential complications of recurrent lumbosacral HSV infection. PMID:26722168

  6. NFκB-mediated activation of the cellular FUT3, 5 and 6 gene cluster by herpes simplex virus type 1.

    PubMed

    Nordén, Rickard; Samuelsson, Ebba; Nyström, Kristina

    2017-11-01

    Herpes simplex virus type 1 has the ability to induce expression of a human gene cluster located on chromosome 19 upon infection. This gene cluster contains three fucosyltransferases (encoded by FUT3, FUT5 and FUT6) with the ability to add a fucose to an N-acetylglucosamine residue. Little is known regarding the transcriptional activation of these three genes in human cells. Intriguingly, herpes simplex virus type 1 activates all three genes simultaneously during infection, a situation not observed in uninfected tissue, pointing towards a virus specific mechanism for transcriptional activation. The aim of this study was to define the underlying mechanism for the herpes simplex virus type 1 activation of FUT3, FUT5 and FUT6 transcription. The transcriptional activation of the FUT-gene cluster on chromosome 19 in fibroblasts was specific, not involving adjacent genes. Moreover, inhibition of NFκB signaling through panepoxydone treatment significantly decreased the induction of FUT3, FUT5 and FUT6 transcriptional activation, as did siRNA targeting of p65, in herpes simplex virus type 1 infected fibroblasts. NFκB and p65 signaling appears to play an important role in the regulation of FUT3, FUT5 and FUT6 transcriptional activation by herpes simplex virus type 1 although additional, unidentified, viral factors might account for part of the mechanism as direct interferon mediated stimulation of NFκB was not sufficient to induce the fucosyltransferase encoding gene cluster in uninfected cells. © The Author 2017. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

  7. Parasite diversity of Nyctiphanes simplex and Nematoscelis difficilis (Crustacea: Euphausiacea) along the northwestern coast of Mexico.

    PubMed

    Gómez-Gutiérrez, Jaime; Robinson, Carlos J; Kawaguchi, So; Nicol, Stephen

    2010-02-17

    The diversity of parasites found on Nyctiphanes simplex and Nematoscelis difficilis (Order Euphausiacea) was compared during 10 oceanographic cruises made off both coasts of the Baja California peninsula, Mexico. We tested the hypothesis that N. simplex has a more diverse parasitic assemblage than N. difficilis because it is a neritic species, has larger population abundance, and tends to form denser and more compact swarms than N. difficilis. These biological and behavioral features may enhance parasite transmission within swarms. We detected 6 types of ectoparasites: (1) epibiotic diatoms Licmophora sp.; (2) Ephelotidae suctorian ciliates; (3) Foettingeriidae exuviotrophic apostome ciliates; (4) an unidentified epicaridean cryptoniscus larvae (isopoda); and 2 castrators: (5) the ectoparasitic Dajidae isopod Notophryxus lateralis and (6) the ellobiopsid mesoparasite Thalassomyces fagei. We also detected 7 types of endoparasites: (1) an undescribed Collinia ciliate (Apostomatida); 3 types of Cestoda: (2) a Tetrarhynchobothruium sp. (Trypanorhyncha), (3) Echinobothrium sp. (Diphyllidea: Echinobothyriidae), and (4) unidentified metacestode; (5) a Trematoda Paronatrema-like metacercaria (Syncoeliidae); (6) the nematode Anisakis simplex (L3); and (7) Polymorphidae acantocephalan larvae (acanthor, acanthella, and cystacanth larval stages). N. simplex is affected by all types of parasites, except the isopod N. lateralis, having a considerably larger parasitic diversity and prevalence rates than N. difficilis, which is only infested with 3 types of ectoparasites and T. fagei. Euphausiid swarming is an adaptive behavior for reproduction, protection against predators, and increased efficiency in food searching, but has a negative effect due to parasitism. Although the advantages of aggregation must overcome the reduction of population and individual fitness induced by parasites, we demonstrated that all types of parasites can affect approximately 14% of N. simplex individuals. Collinia spp. endoparasitoids must occasionally have a significant influence on population mortality with potential epizootic events.

  8. V2.1.4 L2AS Detailed Release Description September 27, 2001

    Atmospheric Science Data Center

    2013-03-14

    ... 27, 2001 Algorithm Changes Change method of selecting radiance pixels to use in aerosol retrieval over ... het. surface retrieval algorithm over areas of 100% dark water. Modify algorithm for selecting a default aerosol model to use in ...

  9. Computational benefits using artificial intelligent methodologies for the solution of an environmental design problem: saltwater intrusion.

    PubMed

    Papadopoulou, Maria P; Nikolos, Ioannis K; Karatzas, George P

    2010-01-01

    Artificial Neural Networks (ANNs) comprise a powerful tool to approximate the complicated behavior and response of physical systems allowing considerable reduction in computation time during time-consuming optimization runs. In this work, a Radial Basis Function Artificial Neural Network (RBFN) is combined with a Differential Evolution (DE) algorithm to solve a water resources management problem, using an optimization procedure. The objective of the optimization scheme is to cover the daily water demand on the coastal aquifer east of the city of Heraklion, Crete, without reducing the subsurface water quality due to seawater intrusion. The RBFN is utilized as an on-line surrogate model to approximate the behavior of the aquifer and to replace some of the costly evaluations of an accurate numerical simulation model which solves the subsurface water flow differential equations. The RBFN is used as a local approximation model in such a way as to maintain the robustness of the DE algorithm. The results of this procedure are compared to the corresponding results obtained by using the Simplex method and by using the DE procedure without the surrogate model. As it is demonstrated, the use of the surrogate model accelerates the convergence of the DE optimization procedure and additionally provides a better solution at the same number of exact evaluations, compared to the original DE algorithm.

  10. Modified truncated randomized singular value decomposition (MTRSVD) algorithms for large scale discrete ill-posed problems with general-form regularization

    NASA Astrophysics Data System (ADS)

    Jia, Zhongxiao; Yang, Yanfei

    2018-05-01

    In this paper, we propose new randomization based algorithms for large scale linear discrete ill-posed problems with general-form regularization: subject to , where L is a regularization matrix. Our algorithms are inspired by the modified truncated singular value decomposition (MTSVD) method, which suits only for small to medium scale problems, and randomized SVD (RSVD) algorithms that generate good low rank approximations to A. We use rank-k truncated randomized SVD (TRSVD) approximations to A by truncating the rank- RSVD approximations to A, where q is an oversampling parameter. The resulting algorithms are called modified TRSVD (MTRSVD) methods. At every step, we use the LSQR algorithm to solve the resulting inner least squares problem, which is proved to become better conditioned as k increases so that LSQR converges faster. We present sharp bounds for the approximation accuracy of the RSVDs and TRSVDs for severely, moderately and mildly ill-posed problems, and substantially improve a known basic bound for TRSVD approximations. We prove how to choose the stopping tolerance for LSQR in order to guarantee that the computed and exact best regularized solutions have the same accuracy. Numerical experiments illustrate that the best regularized solutions by MTRSVD are as accurate as the ones by the truncated generalized singular value decomposition (TGSVD) algorithm, and at least as accurate as those by some existing truncated randomized generalized singular value decomposition (TRGSVD) algorithms. This work was supported in part by the National Science Foundation of China (Nos. 11771249 and 11371219).

  11. An Enhanced K-Means Algorithm for Water Quality Analysis of The Haihe River in China

    PubMed Central

    Zou, Hui; Zou, Zhihong; Wang, Xiaojing

    2015-01-01

    The increase and the complexity of data caused by the uncertain environment is today’s reality. In order to identify water quality effectively and reliably, this paper presents a modified fast clustering algorithm for water quality analysis. The algorithm has adopted a varying weights K-means cluster algorithm to analyze water monitoring data. The varying weights scheme was the best weighting indicator selected by a modified indicator weight self-adjustment algorithm based on K-means, which is named MIWAS-K-means. The new clustering algorithm avoids the margin of the iteration not being calculated in some cases. With the fast clustering analysis, we can identify the quality of water samples. The algorithm is applied in water quality analysis of the Haihe River (China) data obtained by the monitoring network over a period of eight years (2006–2013) with four indicators at seven different sites (2078 samples). Both the theoretical and simulated results demonstrate that the algorithm is efficient and reliable for water quality analysis of the Haihe River. In addition, the algorithm can be applied to more complex data matrices with high dimensionality. PMID:26569283

  12. Imaging 2D structures by the CSAMT method: application to the Pantano di S. Gregorio Magno faulted basin (Southern Italy)

    NASA Astrophysics Data System (ADS)

    Troiano, Antonio; Di Giuseppe, Maria Giulia; Petrillo, Zaccaria; Patella, Domenico

    2009-06-01

    A controlled source audiofrequency magnetotelluric (CSAMT) survey has been undertaken in the Pantano di San Gregorio Magno faulted basin, an earthquake prone area of Southern Apennines in Italy. A dataset from 11 soundings, distributed along a nearly N-S 780 m long profile, was acquired in the basin's easternmost area, where the fewest data are available as to the faulting shallow features. A preliminary skew analysis allowed a prevailing 2D nature of the dataset to be ascertained. Then, using a single-site multi-frequency approach, Dantzig's simplex algorithm was introduced for the first time to estimate the CSAMT decomposition parameters. The simplex algorithm, freely available online, proved to be fast and efficient. By this approach, the TM and TE mode field diagrams were obtained and a N35°W ± 10° 2D strike mean direction was estimated along the profile, in substantial agreement with the fault traces within the basin. A 2D inversion of the apparent resistivity and phase curves at seven almost noise-free sites distributed along the central portion of the profile was finally elaborated, reinforced by a sensitivity analysis, which allowed the best resolved portion of the model to be imaged from the first few meters of depth down to a mean depth of 300 m b.g.l. From the inverted section, the following features have been outlined: (i) a cover layer with resistivity in the range 3-30 Ω m ascribed to the Quaternary lacustrine clayey deposits filling the basin, down to an average depth of about 35 m b.g.l., underlain by a structure with resistivity over 50 Ω m up to about 600 Ω m, ascribed to the Mesozoic carbonate bedrock; (ii) a system of two normal faults within the carbonate basement, extending down to the maximum best resolved depth of the order of 300 m b.g.l.; (iii) two wedge-shaped domains separating the opposite blocks of the faults with resistivity ranging between 30 Ω m and 50 Ω m and horizontal extent of the order of some tens of metres, likely filled with lacustrine sediments and embedded fine gravels.

  13. The "Other" Venereal Diseases: Herpes Simplex, Trichomoniasis and Candidiasis.

    ERIC Educational Resources Information Center

    McNab, Warren L.

    1979-01-01

    Although the term venereal disease has been synonymous with gonorrhea and syphilis, the Center for Disease Control now states that the number of new cases of herpes simplex, trichomoniasis, and candidiasis is rapidly approaching the number of cases of syphilis and gonorrhea. (MM)

  14. The Longitudinal Guttman Simplex: Applications to Health Behavior Data.

    ERIC Educational Resources Information Center

    Collins, Linda M.; Dent, Clyde W.

    Because health behavior is often concerned with dynamic constructs, a longitudinal approach to measurement is needed. The Longitudinal Guttman Simplex (LGS) is a measurement model developed especially for dynamic constructs exhibiting cumulative, unitary development measured longitudinally. Data from the Television Smoking Prevention Project, a…

  15. Immunity to herpes simplex virus type 2. Suppression of virus-induced immune responses in ultraviolet B-irradiated mice

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Yasumoto, S.; Hayashi, Y.; Aurelian, L.

    1987-10-15

    Ultraviolet B irradiation (280 to 320 nm) of mice at the site of intradermal infection with herpes simplex virus type 2 increased the severity of the herpes simplex virus type 2 disease and decreased delayed-type hypersensitivity (DTH) responses to viral antigen. Decrease in DTH resulted from the induction of suppressor T cells, as evidenced by the ability of spleen cells from UV-irradiated mice to inhibit DTH and proliferative responses after adoptive transfer. Lymph node cells from UV-irradiated animals did not transfer suppression. DTH was suppressed at the induction but not the expression phase. Suppressor T cells were Lyt-1+, L3T4+, andmore » their activity was antigen-specific. However, after in vitro culture of spleen cells from UV-irradiated mice with herpes simplex virus type 2 antigen, suppressor activity was mediated by Lyt-2+ cells. Culture supernatants contained soluble nonantigen-specific suppressive factors.« less

  16. Expression of Genes Encoding the Enzymes for Glycogen and Trehalose Metabolism in L3 and L4 Larvae of Anisakis simplex.

    PubMed

    Łopieńska-Biernat, E; Zaobidna, E A; Dmitryjuk, M

    2015-01-01

    Trehalose and glycogen metabolism plays an important role in supporting life processes in many nematodes, including Anisakis simplex. Nematodes, cosmopolitan helminths parasitizing sea mammals and humans, cause a disease known as anisakiasis. The aim of this study was to investigate the expression of genes encoding the enzymes involved in the metabolism of trehalose and glycogen-trehalose-6-phosphate synthase (TPS), trehalose-6-phosphate phosphatase (TPP), glycogen synthase (GS), and glycogen phosphorylase (GP)-in stage L3 and stage L4 larvae of A. simplex. The expression of mRNA all four genes, tps, tpp, gs, and gp, was examined by real-time polymerase chain reaction. The A. simplex ribosomal gene (18S) was used as a reference gene. Enzymatic activity was determined. The expression of trehalose enzyme genes was higher in L3 than in L4 larvae, but an inverse relationship was noted for the expression of gs and gp genes.

  17. Expression of Genes Encoding the Enzymes for Glycogen and Trehalose Metabolism in L3 and L4 Larvae of Anisakis simplex

    PubMed Central

    Łopieńska-Biernat, E.; Zaobidna, E. A.; Dmitryjuk, M.

    2015-01-01

    Trehalose and glycogen metabolism plays an important role in supporting life processes in many nematodes, including Anisakis simplex. Nematodes, cosmopolitan helminths parasitizing sea mammals and humans, cause a disease known as anisakiasis. The aim of this study was to investigate the expression of genes encoding the enzymes involved in the metabolism of trehalose and glycogen—trehalose-6-phosphate synthase (TPS), trehalose-6-phosphate phosphatase (TPP), glycogen synthase (GS), and glycogen phosphorylase (GP)—in stage L3 and stage L4 larvae of A. simplex. The expression of mRNA all four genes, tps, tpp, gs, and gp, was examined by real-time polymerase chain reaction. The A. simplex ribosomal gene (18S) was used as a reference gene. Enzymatic activity was determined. The expression of trehalose enzyme genes was higher in L3 than in L4 larvae, but an inverse relationship was noted for the expression of gs and gp genes. PMID:26783451

  18. Construction of Poxviruses as Cloning Vectors: Insertion of the Thymidine Kinase Gene from Herpes Simplex Virus into the DNA of Infectious Vaccinia Virus

    NASA Astrophysics Data System (ADS)

    Panicali, Dennis; Paoletti, Enzo

    1982-08-01

    We have constructed recombinant vaccinia viruses containing the thymidine kinase gene from herpes simplex virus. The gene was inserted into the genome of a variant of vaccinia virus that had undergone spontaneous deletion as well as into the 120-megadalton genome of the large prototypic vaccinia variant. This was accomplished via in vivo recombination by contransfection of eukaryotic tissue culture cells with cloned BamHI-digested thymidine kinase gene from herpes simplex virus containing flanking vaccinia virus DNA sequences and infectious rescuing vaccinia virus. Pure populations of the recombinant viruses were obtained by replica filter techniques or by growth of the recombinant virus in biochemically selective medium. The herpes simplex virus thymidine kinase gene, as an insert in vaccinia virus, is transcribed in vivo and in vitro, and the fidelity of in vivo transcription into a functional gene product was detected by the phosphorylation of 5-[125I]iodo-2'-deoxycytidine.

  19. 75 FR 66404 - Self-Regulatory Organizations; C2 Options Exchange, Incorporated; Notice of Filing and Immediate...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-10-28

    ... Change The Exchange proposes to modify the wording of Rule 6.12 relating to the C2 matching algorithm... matching algorithm and subsequently overlay certain priorities over the selected base algorithm. There are currently two base algorithms: price-time (often referred to as first in, first out or FIFO) in which...

  20. Adaptive cockroach swarm algorithm

    NASA Astrophysics Data System (ADS)

    Obagbuwa, Ibidun C.; Abidoye, Ademola P.

    2017-07-01

    An adaptive cockroach swarm optimization (ACSO) algorithm is proposed in this paper to strengthen the existing cockroach swarm optimization (CSO) algorithm. The ruthless component of CSO algorithm is modified by the employment of blend crossover predator-prey evolution method which helps algorithm prevent any possible population collapse, maintain population diversity and create adaptive search in each iteration. The performance of the proposed algorithm on 16 global optimization benchmark function problems was evaluated and compared with the existing CSO, cuckoo search, differential evolution, particle swarm optimization and artificial bee colony algorithms.

  1. Magnified gradient function with deterministic weight modification in adaptive learning.

    PubMed

    Ng, Sin-Chun; Cheung, Chi-Chung; Leung, Shu-Hung

    2004-11-01

    This paper presents two novel approaches, backpropagation (BP) with magnified gradient function (MGFPROP) and deterministic weight modification (DWM), to speed up the convergence rate and improve the global convergence capability of the standard BP learning algorithm. The purpose of MGFPROP is to increase the convergence rate by magnifying the gradient function of the activation function, while the main objective of DWM is to reduce the system error by changing the weights of a multilayered feedforward neural network in a deterministic way. Simulation results show that the performance of the above two approaches is better than BP and other modified BP algorithms for a number of learning problems. Moreover, the integration of the above two approaches forming a new algorithm called MDPROP, can further improve the performance of MGFPROP and DWM. From our simulation results, the MDPROP algorithm always outperforms BP and other modified BP algorithms in terms of convergence rate and global convergence capability.

  2. Radionuclide imaging in herpes simplex encephalitis. [/sup 99m/Tc tracer techniques

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Karlin, C.A.; Robinson, R.G.; Hinthorn, D.R.

    1978-01-01

    Eight patients with herpes simplex encephalitis among the 10 cases diagnosed at the University of Kansas Medical Center from 1966 to 1976 were studied with /sup 99m/Tc early in their diagnostic work-up. The images were unilaterally positive in the temporal lobe area in all 8 patients. Radionuclide studies can suggest herpes simplex as the specific etiology in cases of encephalitis and can also indicate the best site for brain biopsy to confirm the diagnosis by fluorescent antibody techniques. Appropriate antiviral therapy should be instituted as soon as possible to alter the course of this destructive form of viral encephalitis.

  3. Herpes Simplex Encephalitis Complicated by Cerebral Hemorrhage during Acyclovir Therapy.

    PubMed

    Harada, Yukinori; Hara, Yuuta

    2017-01-01

    Herpes simplex encephalitis (HSE) can be complicated by adverse events in the acute phase. We herein present the case of a 71-year-old woman with HSE complicated by cerebral hemorrhage. She presented with acute deterioration of consciousness and fever and was diagnosed with HSE based on the detection of herpes simplex virus-1 in the cerebrospinal fluid by a polymerase chain reaction. The cerebral hemorrhage developed during acyclovir therapy; however, its diagnosis was delayed for 2 days. After the conservative treatment of the cerebral hemorrhage, the patient made a near-complete recovery. Cerebral hemorrhage should be considered as an acute-phase complication of HSE.

  4. Helicase-primase inhibitors for herpes simplex virus: looking to the future of non-nucleoside inhibitors for treating herpes virus infections.

    PubMed

    Biswas, Subhajit; Sukla, Soumi; Field, Hugh J

    2014-01-01

    Helicase-primase inhibitors (HPIs) are the first new family of potent herpes virus (herpes simplex and varicella-zoster virus) inhibitors to go beyond the preliminary stages of investigation since the emergence of the original nucleoside analog inhibitors. To consider the clinical future of HPIs, this review puts the exciting new findings with two HPIs, amenamevir and pritelivir, into the historical context of antiviral development for the prevention and treatment of herpes simplex virus over the last century and, on this basis, the authors speculate on the potential evolution of these and other non-nucleoside inhibitors in the future.

  5. DOE Office of Scientific and Technical Information (OSTI.GOV)

    Yeung, Yu-Hong; Pothen, Alex; Halappanavar, Mahantesh

    We present an augmented matrix approach to update the solution to a linear system of equations when the coefficient matrix is modified by a few elements within a principal submatrix. This problem arises in the dynamic security analysis of a power grid, where operators need to performmore » $N-x$ contingency analysis, i.e., determine the state of the system when up to $x$ links from $N$ fail. Our algorithms augment the coefficient matrix to account for the changes in it, and then compute the solution to the augmented system without refactoring the modified matrix. We provide two algorithms, a direct method, and a hybrid direct-iterative method for solving the augmented system. We also exploit the sparsity of the matrices and vectors to accelerate the overall computation. Our algorithms are compared on three power grids with PARDISO, a parallel direct solver, and CHOLMOD, a direct solver with the ability to modify the Cholesky factors of the coefficient matrix. We show that our augmented algorithms outperform PARDISO (by two orders of magnitude), and CHOLMOD (by a factor of up to 5). Further, our algorithms scale better than CHOLMOD as the number of elements updated increases. The solutions are computed with high accuracy. Our algorithms are capable of computing $N-x$ contingency analysis on a $778K$ bus grid, updating a solution with $x=20$ elements in $$1.6 \\times 10^{-2}$$ seconds on an Intel Xeon processor.« less

  6. Herpes simplex virus-induced anti-N-methyl-d-aspartate receptor encephalitis: a systematic literature review with analysis of 43 cases.

    PubMed

    Nosadini, Margherita; Mohammad, Shekeeb S; Corazza, Francesco; Ruga, Ezia Maria; Kothur, Kavitha; Perilongo, Giorgio; Frigo, Anna Chiara; Toldo, Irene; Dale, Russell C; Sartori, Stefano

    2017-08-01

    To conduct a systematic literature review on patients with biphasic disease with herpes simplex virus (HSV) encephalitis followed by anti-N-methyl-D-aspartate receptor (NMDAR) encephalitis. We conducted a case report and systematic literature review (up to 10 December 2016), focused on differences between herpes simplex encephalitis (HSE) and anti-NMDAR encephalitis phases, age-related characteristics of HSV-induced anti-NMDAR encephalitis, and therapy. For statistical analyses, McNemar's test, Fisher's test, and Wilcoxon rank sum test were used (two-tailed significance level set at 5%). Forty-three patients with biphasic disease were identified (31 children). Latency between HSE and anti-NMDAR encephalitis was significantly shorter in children than adults (median 24 vs 40.5d; p=0.006). Compared with HSE, anti-NMDAR encephalitis was characterized by significantly higher frequency of movement disorder (2.5% vs 75% respectively; p<0.001), and significantly lower rate of seizures (70% vs 30% respectively; p=0.001). Compared with adults, during anti-NMDAR encephalitis children had significantly more movement disorders (86.7% children vs 40% adults; p=0.006), fewer psychiatric symptoms (41.9% children vs 90.0% adults; p=0.025), and a slightly higher median modified Rankin Scale score (5 in children vs 4 in adults; p=0.015). During anti-NMDAR encephalitis, 84.6 per cent of patients received aciclovir (for ≤7d in 22.7%; long-term antivirals in 18.0% only), and 92.7 per cent immune therapy, but none had recurrence of HSE clinically or using cerebrospinal fluid HSV polymerase chain reaction (median follow-up 7mo). Our review suggests that movement disorder may help differentiate clinically an episode of HSV-induced anti-NMDAR encephalitis from HSE relapse. Compared with adults, children have shorter latency between HSE and anti-NMDAR encephalitis and, during anti-NMDAR encephalitis, more movement disorder, fewer psychiatric symptoms, and slightly more severe disease. According to our results, immune therapy given for HSV-induced anti-NMDAR encephalitis does not predispose patients to HSE recurrence. © 2017 Mac Keith Press.

  7. Principles and Concepts for Information and Communication Technology Design.

    ERIC Educational Resources Information Center

    Adams, Ray; Langdon, Patrick

    2003-01-01

    This article presents a theory for evaluating information and communication technology design for individuals with disabilities. Simplex 1 evaluates designs in five zones: sensory and input zone; output zone; abstract working memory; long-term memory; and central executive functioning. Simplex 2 evaluates feedback, emotional responses, cognitive…

  8. Argument Structure of Tsou: Simplex and Complex Predicates

    ERIC Educational Resources Information Center

    Lin, Gujing

    2010-01-01

    This thesis investigates the argument structure of Tsou, a Formosan language within the Austronesian family. The investigation studies both simplex and complex predicates as well as describes the valency groupings and alignment patterns emerging from various clausal configurations. Assuming the stance that language description should respect…

  9. Molecular requirement for sterols in herpes simplex virus entry and infectivity

    USDA-ARS?s Scientific Manuscript database

    Herpes simplex virus 1 (HSV-1) required cholesterol for virion-induced membrane fusion. HSV successfully entered DHCR24-/-cells, which lack a desmosterol-to-cholesterol conversion enzyme, indicating entry can occur independently of cholesterol. Depletion of desmosterol from these cells resulted in d...

  10. RESEARCH PROGRAM FOR ALERTING, DETECTION AND IDENTIFICATION OF PATHOGENES.

    DTIC Science & Technology

    characteristic products. BHK-21 and RK-13 tissue cultures infected with NDV, influenza, YFV , Sendai, Vaccinia, and Herpes simplex showed a depletion of...infected and control serum could be detected in mice infected with YFV , influenza, Herpes simplex, and LDV superinfected with YFV . Several methods of

  11. A modified sparse reconstruction method for three-dimensional synthetic aperture radar image

    NASA Astrophysics Data System (ADS)

    Zhang, Ziqiang; Ji, Kefeng; Song, Haibo; Zou, Huanxin

    2018-03-01

    There is an increasing interest in three-dimensional Synthetic Aperture Radar (3-D SAR) imaging from observed sparse scattering data. However, the existing 3-D sparse imaging method requires large computing times and storage capacity. In this paper, we propose a modified method for the sparse 3-D SAR imaging. The method processes the collection of noisy SAR measurements, usually collected over nonlinear flight paths, and outputs 3-D SAR imagery. Firstly, the 3-D sparse reconstruction problem is transformed into a series of 2-D slices reconstruction problem by range compression. Then the slices are reconstructed by the modified SL0 (smoothed l0 norm) reconstruction algorithm. The improved algorithm uses hyperbolic tangent function instead of the Gaussian function to approximate the l0 norm and uses the Newton direction instead of the steepest descent direction, which can speed up the convergence rate of the SL0 algorithm. Finally, numerical simulation results are given to demonstrate the effectiveness of the proposed algorithm. It is shown that our method, compared with existing 3-D sparse imaging method, performs better in reconstruction quality and the reconstruction time.

  12. Generalized sidelobe canceller beamforming method for ultrasound imaging.

    PubMed

    Wang, Ping; Li, Na; Luo, Han-Wu; Zhu, Yong-Kun; Cui, Shi-Gang

    2017-03-01

    A modified generalized sidelobe canceller (IGSC) algorithm is proposed to enhance the resolution and robustness against the noise of the traditional generalized sidelobe canceller (GSC) and coherence factor combined method (GSC-CF). In the GSC algorithm, weighting vector is divided into adaptive and non-adaptive parts, while the non-adaptive part does not block all the desired signal. A modified steer vector of the IGSC algorithm is generated by the projection of the non-adaptive vector on the signal space constructed by the covariance matrix of received data. The blocking matrix is generated based on the orthogonal complementary space of the modified steer vector and the weighting vector is updated subsequently. The performance of IGSC was investigated by simulations and experiments. Through simulations, IGSC outperformed GSC-CF in terms of spatial resolution by 0.1 mm regardless there is noise or not, as well as the contrast ratio respect. The proposed IGSC can be further improved by combining with CF. The experimental results also validated the effectiveness of the proposed algorithm with dataset provided by the University of Michigan.

  13. Modification Of Learning Rate With Lvq Model Improvement In Learning Backpropagation

    NASA Astrophysics Data System (ADS)

    Tata Hardinata, Jaya; Zarlis, Muhammad; Budhiarti Nababan, Erna; Hartama, Dedy; Sembiring, Rahmat W.

    2017-12-01

    One type of artificial neural network is a backpropagation, This algorithm trained with the network architecture used during the training as well as providing the correct output to insert a similar but not the same with the architecture in use at training.The selection of appropriate parameters also affects the outcome, value of learning rate is one of the parameters which influence the process of training, Learning rate affects the speed of learning process on the network architecture.If the learning rate is set too large, then the algorithm will become unstable and otherwise the algorithm will converge in a very long period of time.So this study was made to determine the value of learning rate on the backpropagation algorithm. LVQ models of learning rate is one of the models used in the determination of the value of the learning rate of the algorithm LVQ.By modifying this LVQ model to be applied to the backpropagation algorithm. From the experimental results known to modify the learning rate LVQ models were applied to the backpropagation algorithm learning process becomes faster (epoch less).

  14. Adoption of the Hash algorithm in a conceptual model for the civil registry of Ecuador

    NASA Astrophysics Data System (ADS)

    Toapanta, Moisés; Mafla, Enrique; Orizaga, Antonio

    2018-04-01

    The Hash security algorithm was analyzed in order to mitigate information security in a distributed architecture. The objective of this research is to develop a prototype for the Adoption of the algorithm Hash in a conceptual model for the Civil Registry of Ecuador. The deductive method was used in order to analyze the published articles that have a direct relation with the research project "Algorithms and Security Protocols for the Civil Registry of Ecuador" and articles related to the Hash security algorithm. It resulted from this research: That the SHA-1 security algorithm is appropriate for use in Ecuador's civil registry; we adopted the SHA-1 algorithm used in the flowchart technique and finally we obtained the adoption of the hash algorithm in a conceptual model. It is concluded that from the comparison of the DM5 and SHA-1 algorithm, it is suggested that in the case of an implementation, the SHA-1 algorithm is taken due to the amount of information and data available from the Civil Registry of Ecuador; It is determined that the SHA-1 algorithm that was defined using the flowchart technique can be modified according to the requirements of each institution; the model for adopting the hash algorithm in a conceptual model is a prototype that can be modified according to all the actors that make up each organization.

  15. Rapid and highly sensitive detection of Enterovirus 71 by using nanogold-enhanced electrochemical impedance spectroscopy

    NASA Astrophysics Data System (ADS)

    Li, Hsing-Yuan; Tseng, Shing-Hua; Cheng, Tsai-Mu; Chu, Hsueh-Liang; Lu, Yu-Ning; Wang, Fang-Yu; Tsai, Li-Yun; Shieh, Juo-Yu; Yang, Jyh-Yuan; Juan, Chien-Chang; Tu, Lung-Chen; Chang, Chia-Ching

    2013-07-01

    Enterovirus 71 (EV71) infection is an emerging infectious disease causing neurological complications and/or death within two to three days after the development of fever and rash. A low viral titre in clinical specimens makes the detection of EV71 difficult. Conventional approaches for detecting EV71 are time consuming, poorly sensitive, or complicated, and cannot be used effectively for clinical diagnosis. Furthermore, EV71 and Coxsackie virus A16 (CA16) may cross react in conventional assays. Therefore, a rapid, highly sensitive, specific, and user-friendly test is needed. We developed an EV71-specific nanogold-modified working electrode for electrochemical impedance spectroscopy in the detection of EV71. Our results show that EV71 can be distinguished from CA16, Herpes simplex virus, and lysozyme, with the modified nanogold electrode being able to detect EV71 in concentrations as low as 1 copy number/50 μl reaction volume, and the duration between sample preparation and detection being 11 min. This detection platform may have the potential for use in point-of-care diagnostics.

  16. Multiplex Droplet Digital PCR Protocols for Quantification of GM Maize Events.

    PubMed

    Dobnik, David; Spilsberg, Bjørn; Bogožalec Košir, Alexandra; Štebih, Dejan; Morisset, Dany; Holst-Jensen, Arne; Žel, Jana

    2018-01-01

    The standard-curve based simplex quantitative polymerase chain reaction (qPCR) has been the gold standard for DNA target quantification for more than a decade. The large and growing number of individual analyses needed to test for genetically modified organisms (GMOs) is reducing the cost-effectiveness of qPCR. Droplet digital PCR (ddPCR) enables absolute quantification without standard curves, avoids the amplification efficiency bias observed with qPCR, allows more accurate estimations at low target copy numbers and, in combination with multiplexing, significantly improves cost efficiency. Here we describe two protocols for multiplex quantification of GM maize events: (1) nondiscriminating, with multiplex quantification of targets as a group (12 GM maize lines) and (2) discriminating, with multiplex quantification of individual targets (events). The first enables the quantification of twelve European Union authorized GM maize events as a group with only two assays, but does not permit determination of the individual events present. The second protocol enables the quantification of four individual targets (three GM events and one endogene) in a single reaction. Both protocols can be modified for quantification of any other DNA target.

  17. Image quality enhancement in low-light-level ghost imaging using modified compressive sensing method

    NASA Astrophysics Data System (ADS)

    Shi, Xiaohui; Huang, Xianwei; Nan, Suqin; Li, Hengxing; Bai, Yanfeng; Fu, Xiquan

    2018-04-01

    Detector noise has a significantly negative impact on ghost imaging at low light levels, especially for existing recovery algorithm. Based on the characteristics of the additive detector noise, a method named modified compressive sensing ghost imaging is proposed to reduce the background imposed by the randomly distributed detector noise at signal path. Experimental results show that, with an appropriate choice of threshold value, modified compressive sensing ghost imaging algorithm can dramatically enhance the contrast-to-noise ratio of the object reconstruction significantly compared with traditional ghost imaging and compressive sensing ghost imaging methods. The relationship between the contrast-to-noise ratio of the reconstruction image and the intensity ratio (namely, the average signal intensity to average noise intensity ratio) for the three reconstruction algorithms are also discussed. This noise suppression imaging technique will have great applications in remote-sensing and security areas.

  18. Monte Carlo tests of the ELIPGRID-PC algorithm

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Davidson, J.R.

    1995-04-01

    The standard tool for calculating the probability of detecting pockets of contamination called hot spots has been the ELIPGRID computer code of Singer and Wickman. The ELIPGRID-PC program has recently made this algorithm available for an IBM{reg_sign} PC. However, no known independent validation of the ELIPGRID algorithm exists. This document describes a Monte Carlo simulation-based validation of a modified version of the ELIPGRID-PC code. The modified ELIPGRID-PC code is shown to match Monte Carlo-calculated hot-spot detection probabilities to within {plus_minus}0.5% for 319 out of 320 test cases. The one exception, a very thin elliptical hot spot located within a rectangularmore » sampling grid, differed from the Monte Carlo-calculated probability by about 1%. These results provide confidence in the ability of the modified ELIPGRID-PC code to accurately predict hot-spot detection probabilities within an acceptable range of error.« less

  19. Modified echo peak correction for radial acquisition regime (RADAR).

    PubMed

    Takizawa, Masahiro; Ito, Taeko; Itagaki, Hiroyuki; Takahashi, Tetsuhiko; Shimizu, Kanichirou; Harada, Junta

    2009-01-01

    Because radial sampling imposes many limitations on magnetic resonance (MR) imaging hardware, such as on the accuracy of the gradient magnetic field or the homogeneity of B(0), some correction of the echo signal is usually needed before image reconstruction. In our previous study, we developed an echo-peak-shift correction (EPSC) algorithm not easily affected by hardware performance. However, some artifacts remained in lung imaging, where tissue is almost absent, or in cardiac imaging, which is affected by blood flow. In this study, we modified the EPSC algorithm to improve the image quality of the radial aquisition regime (RADAR) and expand its application sequences. We assumed the artifacts were mainly caused by errors in the phase map for EPSC and used a phantom on a 1.5-tesla (T) MR scanner to investigate whether to modify the EPSC algorithm. To evaluate the effectiveness of EPSC, we compared results from T(1)- and T(2)-weighted images of a volunteer's lung region using the current and modified EPSC. We then applied the modified EPSC to RADAR spin echo (SE) and RADAR balanced steady-state acquisition with rewound gradient echo (BASG) sequence. The modified EPSC reduced phase discontinuity in the reference data used for EPSC and improved visualization of blood vessels in the lungs. Motion and blood flow caused no visible artifacts in the resulting images in either RADAR SE or RADAR BASG sequence. Use of the modified EPSC eliminated artifacts caused by signal loss in the reference data for EPSC. In addition, the modified EPSC was applied to RADAR SE and RADAR BASG sequences.

  20. Production and first-in-man use of T cells engineered to express a HSVTK-CD34 sort-suicide gene.

    PubMed

    Zhan, Hong; Gilmour, Kimberly; Chan, Lucas; Farzaneh, Farzin; McNicol, Anne Marie; Xu, Jin-Hua; Adams, Stuart; Fehse, Boris; Veys, Paul; Thrasher, Adrian; Gaspar, Hubert; Qasim, Waseem

    2013-01-01

    Suicide gene modified donor T cells can improve immune reconstitution after allogeneic haematopoietic stem cell transplantation (SCT), but can be eliminated in the event of graft versus host disease (GVHD) through the administration of prodrug. Here we report the production and first-in-man use of mismatched donor T cells modified with a gamma-retroviral vector expressing a herpes simplex thymidine kinase (HSVTK):truncated CD34 (tCD34) suicide gene/magnetic selection marker protein. A stable packaging cell line was established to produce clinical grade vector pseudotyped with the Gibbon Ape Leukaemia Virus (GALV). T cells were transduced in a closed bag system following activation with anti-CD3/CD28 beads, and enriched on the basis of CD34 expression. Engineered cells were administered in two escalating doses to three children receiving T-depleted, CD34 stem cell selected, mismatched allogeneic grafts. All patients had pre-existing viral infections and received chemotherapy conditioning without serotherapy. In all three subjects cell therapy was tolerated without acute toxicity or the development of acute GVHD. Circulating gene modified T cells were detectable by flow cytometry and by molecular tracking in all three subjects. There was resolution of virus infections, concordant with detectable antigen-specific T cell responses and gene modified cells persisted for over 12 months. These findings highlight the suitability of tCD34 as a GMP compliant selection marker and demonstrate the feasibility, safety and immunological potential of HSVTK-tCD34 suicide gene modified donor T cells. ClinicalTrials.gov NCT01204502

  1. The Law of Cosines for an "n"-Dimensional Simplex

    ERIC Educational Resources Information Center

    Ding, Yiren

    2008-01-01

    Using the divergence theorem technique of L. Eifler and N.H. Rhee, "The n-dimensional Pythagorean Theorem via the Divergence Theorem" (to appear: Amer. Math. Monthly), we extend the law of cosines for a triangle in a plane to an "n"-dimensional simplex in an "n"-dimensional space.

  2. Nonlinear and Quasi-Simplex Patterns in Latent Growth Models

    ERIC Educational Resources Information Center

    Bianconcini, Silvia

    2012-01-01

    In the SEM literature, simplex and latent growth models have always been considered competing approaches for the analysis of longitudinal data, even if they are strongly connected and both of specific importance. General dynamic models, which simultaneously estimate autoregressive structures and latent curves, have been recently proposed in the…

  3. Can Herpes Simplex Virus Encephalitis Cause Aphasia?

    ERIC Educational Resources Information Center

    Naude, H.; Pretorius, E.

    2003-01-01

    Aphasia implies the loss or impairment of language caused by brain damage. The key to understanding the nature of aphasic symptoms is the neuro-anatomical site of brain damage, and not the causative agent. However, because "Herpes simplex" virus (HSV) encephalitis infection usually affects the frontal and temporal lobes, subcortical…

  4. Prevalence of Herpes Simplex Virus Antibodies in Dental Students.

    ERIC Educational Resources Information Center

    Rodu, Brad; And Others

    1992-01-01

    A study of 125 sophomore preclinical dental students found that these young professionals, because of having a low prevalence of herpes simplex virus (HSV) antibodies, are at risk for acquiring a primary HSV infection when treating HSV positive patients and should take precautions to avoid virus transmission. (MSE)

  5. Quantitative autoradiographic mapping of focal herpes simplex virus encephalitis using a radiolabeled antiviral drug

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Price, R.

    1984-12-18

    A method of mapping herpes simplex viral infection comprising administering a radiolabeled antiviral active 5-substituted 1-(2'-deoxy-2'-substituted-D-arabinofuranosyl) pyrimidine nucleoside to the infected subject, and scanning the area in which the infection is to be mapped for the radiolabel.

  6. 21 CFR 866.3305 - Herpes simplex virus serological assays.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 21 Food and Drugs 8 2013-04-01 2013-04-01 false Herpes simplex virus serological assays. 866.3305 Section 866.3305 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL DEVICES IMMUNOLOGY AND MICROBIOLOGY DEVICES Serological Reagents § 866.3305 Herpes...

  7. 21 CFR 866.3305 - Herpes simplex virus serological assays.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 21 Food and Drugs 8 2012-04-01 2012-04-01 false Herpes simplex virus serological assays. 866.3305 Section 866.3305 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL DEVICES IMMUNOLOGY AND MICROBIOLOGY DEVICES Serological Reagents § 866.3305 Herpes...

  8. 21 CFR 866.3305 - Herpes simplex virus serological assays.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 21 Food and Drugs 8 2011-04-01 2011-04-01 false Herpes simplex virus serological assays. 866.3305 Section 866.3305 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL DEVICES IMMUNOLOGY AND MICROBIOLOGY DEVICES Serological Reagents § 866.3305 Herpes...

  9. 21 CFR 866.3305 - Herpes simplex virus serological assays.

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... 21 Food and Drugs 8 2014-04-01 2014-04-01 false Herpes simplex virus serological assays. 866.3305 Section 866.3305 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL DEVICES IMMUNOLOGY AND MICROBIOLOGY DEVICES Serological Reagents § 866.3305 Herpes...

  10. 21 CFR 866.3305 - Herpes simplex virus serological assays.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Herpes simplex virus serological assays. 866.3305 Section 866.3305 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL DEVICES IMMUNOLOGY AND MICROBIOLOGY DEVICES Serological Reagents § 866.3305 Herpes...

  11. Herpes simplex virus meningitis complicated by ascending paralysis

    PubMed Central

    Benjamin, Mina M.; Gummelt, Kyle L.; Zaki, Rabeea; Afzal, Aasim; Sloan, Louis

    2013-01-01

    A case of herpes simplex virus (HSV) meningitis complicated by ascending paralysis with almost complete recovery following antiviral treatment is reported. We present this case to illustrate the importance of including HSV-induced neuropathy in the differential diagnosis of acute neurologic symptoms following the viral illness. PMID:23814385

  12. Expression of the Broad Autism Phenotype in Simplex Autism Families from the Simons Simplex Collection

    ERIC Educational Resources Information Center

    Davidson, Julie; Goin-Kochel, Robin P.; Green-Snyder, Lee Anne; Hundley, Rachel J.; Warren, Zachary; Peters, Sarika U.

    2014-01-01

    The broad autism phenotype (BAP) refers to the phenotypic expression of an underlying genetic liability to autism, manifest in non-autistic relatives. This study examined the relationship among the "Broad Autism Phenotype Questionnaire" (BAPQ), "Social Responsiveness Scale: Adult Research Version" (SRS:ARV), and "Family…

  13. Human Herpes Simplex Virus Type 1 in Confiscated Gorilla

    PubMed Central

    Oxford, Kristie L.; Gardner-Roberts, David; Kinani, Jean-Felix; Spelman, Lucy; Barry, Peter A.; Cranfield, Michael R.; Lowenstine, Linda J.

    2014-01-01

    In 2007, we detected human herpes simplex virus type 1, which caused stomatitis, in a juvenile confiscated eastern lowland gorilla (Gorilla beringei graueri) that had a high degree of direct contact with human caretakers. Our findings confirm that pathogens can transfer between nonhuman primate hosts and humans. PMID:25341185

  14. Human herpes simplex virus type 1 in confiscated gorilla.

    PubMed

    Gilardi, Kirsten V K; Oxford, Kristie L; Gardner-Roberts, David; Kinani, Jean-Felix; Spelman, Lucy; Barry, Peter A; Cranfield, Michael R; Lowenstine, Linda J

    2014-11-01

    In 2007, we detected human herpes simplex virus type 1, which caused stomatitis, in a juvenile confiscated eastern lowland gorilla (Gorilla beringei graueri) that had a high degree of direct contact with human caretakers. Our findings confirm that pathogens can transfer between nonhuman primate hosts and humans.

  15. CO 2 water-alternating-gas injection for enhanced oil recovery: Optimal well controls and half-cycle lengths

    DOE PAGES

    Chen, Bailian; Reynolds, Albert C.

    2018-03-11

    We report that CO 2 water-alternating-gas (WAG) injection is an enhanced oil recovery method designed to improve sweep efficiency during CO 2 injection with the injected water to control the mobility of CO 2 and to stabilize the gas front. Optimization of CO 2 -WAG injection is widely regarded as a viable technique for controlling the CO 2 and oil miscible process. Poor recovery from CO 2 -WAG injection can be caused by inappropriately designed WAG parameters. In previous study (Chen and Reynolds, 2016), we proposed an algorithm to optimize the well controls which maximize the life-cycle net-present-value (NPV). However,more » the effect of injection half-cycle lengths for each injector on oil recovery or NPV has not been well investigated. In this paper, an optimization framework based on augmented Lagrangian method and the newly developed stochastic-simplex-approximate-gradient (StoSAG) algorithm is proposed to explore the possibility of simultaneous optimization of the WAG half-cycle lengths together with the well controls. Finally, the proposed framework is demonstrated with three reservoir examples.« less

  16. Flux-corrected transport algorithms for continuous Galerkin methods based on high order Bernstein finite elements

    NASA Astrophysics Data System (ADS)

    Lohmann, Christoph; Kuzmin, Dmitri; Shadid, John N.; Mabuza, Sibusiso

    2017-09-01

    This work extends the flux-corrected transport (FCT) methodology to arbitrary order continuous finite element discretizations of scalar conservation laws on simplex meshes. Using Bernstein polynomials as local basis functions, we constrain the total variation of the numerical solution by imposing local discrete maximum principles on the Bézier net. The design of accuracy-preserving FCT schemes for high order Bernstein-Bézier finite elements requires the development of new algorithms and/or generalization of limiting techniques tailored for linear and multilinear Lagrange elements. In this paper, we propose (i) a new discrete upwinding strategy leading to local extremum bounded low order approximations with compact stencils, (ii) high order variational stabilization based on the difference between two gradient approximations, and (iii) new localized limiting techniques for antidiffusive element contributions. The optional use of a smoothness indicator, based on a second derivative test, makes it possible to potentially avoid unnecessary limiting at smooth extrema and achieve optimal convergence rates for problems with smooth solutions. The accuracy of the proposed schemes is assessed in numerical studies for the linear transport equation in 1D and 2D.

  17. A statistical framework for genetic association studies of power curves in bird flight

    PubMed Central

    Lin, Min; Zhao, Wei

    2006-01-01

    How the power required for bird flight varies as a function of forward speed can be used to predict the flight style and behavioral strategy of a bird for feeding and migration. A U-shaped curve was observed between the power and flight velocity in many birds, which is consistent to the theoretical prediction by aerodynamic models. In this article, we present a general genetic model for fine mapping of quantitative trait loci (QTL) responsible for power curves in a sample of birds drawn from a natural population. This model is developed within the maximum likelihood context, implemented with the EM algorithm for estimating the population genetic parameters of QTL and the simplex algorithm for estimating the QTL genotype-specific parameters of power curves. Using Monte Carlo simulation derived from empirical observations of power curves in the European starling (Sturnus vulgaris), we demonstrate how the underlying QTL for power curves can be detected from molecular markers and how the QTL detected affect the most appropriate flight speeds used to design an optimal migration strategy. The results from our model can be directly integrated into a conceptual framework for understanding flight origin and evolution. PMID:17066123

  18. Adult encephalitis surveillance: experiences from an Australian prospective sentinel site study.

    PubMed

    Eastwood, K; Paterson, B J; Levi, C; Givney, R; Loewenthal, M; DE Malmanche, T; Lai, K; Granerod, J; Durrheim, D N

    2015-11-01

    Few countries routinely collect comprehensive encephalitis data, yet understanding the epidemiology of this condition has value for clinical management, detecting novel and emerging pathogens, and guiding timely public health interventions. When this study was conducted there was no standardized diagnostic algorithm to aid identification of encephalitis or systematic surveillance for adult encephalitis. In July 2012 we tested three pragmatic surveillance options aimed at identifying possible adult encephalitis cases admitted to a major Australian hospital: hospital admissions searches, clinician notifications and laboratory test alerts (CSF herpes simplex virus requests). Eligible cases underwent structured laboratory investigation and a specialist panel arbitrated on the final diagnosis. One hundred and thirteen patients were initially recruited into the 10-month study; 20/113 (18%) met the study case definition, seven were diagnosed with infectious or immune-mediated encephalitis and the remainder were assigned alternative diagnoses. The laboratory alert identified 90% (102/113) of recruited cases including six of the seven cases of confirmed encephalitis suggesting that this may be a practical data source for case ascertainment. The application of a standardized diagnostic algorithm and specialist review by an expert clinical panel aided diagnosis of patients with encephalitis.

  19. CO 2 water-alternating-gas injection for enhanced oil recovery: Optimal well controls and half-cycle lengths

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Chen, Bailian; Reynolds, Albert C.

    We report that CO 2 water-alternating-gas (WAG) injection is an enhanced oil recovery method designed to improve sweep efficiency during CO 2 injection with the injected water to control the mobility of CO 2 and to stabilize the gas front. Optimization of CO 2 -WAG injection is widely regarded as a viable technique for controlling the CO 2 and oil miscible process. Poor recovery from CO 2 -WAG injection can be caused by inappropriately designed WAG parameters. In previous study (Chen and Reynolds, 2016), we proposed an algorithm to optimize the well controls which maximize the life-cycle net-present-value (NPV). However,more » the effect of injection half-cycle lengths for each injector on oil recovery or NPV has not been well investigated. In this paper, an optimization framework based on augmented Lagrangian method and the newly developed stochastic-simplex-approximate-gradient (StoSAG) algorithm is proposed to explore the possibility of simultaneous optimization of the WAG half-cycle lengths together with the well controls. Finally, the proposed framework is demonstrated with three reservoir examples.« less

  20. An improved exploratory search technique for pure integer linear programming problems

    NASA Technical Reports Server (NTRS)

    Fogle, F. R.

    1990-01-01

    The development is documented of a heuristic method for the solution of pure integer linear programming problems. The procedure draws its methodology from the ideas of Hooke and Jeeves type 1 and 2 exploratory searches, greedy procedures, and neighborhood searches. It uses an efficient rounding method to obtain its first feasible integer point from the optimal continuous solution obtained via the simplex method. Since this method is based entirely on simple addition or subtraction of one to each variable of a point in n-space and the subsequent comparison of candidate solutions to a given set of constraints, it facilitates significant complexity improvements over existing techniques. It also obtains the same optimal solution found by the branch-and-bound technique in 44 of 45 small to moderate size test problems. Two example problems are worked in detail to show the inner workings of the method. Furthermore, using an established weighted scheme for comparing computational effort involved in an algorithm, a comparison of this algorithm is made to the more established and rigorous branch-and-bound method. A computer implementation of the procedure, in PC compatible Pascal, is also presented and discussed.

  1. A Modified MinMax k-Means Algorithm Based on PSO

    PubMed Central

    2016-01-01

    The MinMax k-means algorithm is widely used to tackle the effect of bad initialization by minimizing the maximum intraclustering errors. Two parameters, including the exponent parameter and memory parameter, are involved in the executive process. Since different parameters have different clustering errors, it is crucial to choose appropriate parameters. In the original algorithm, a practical framework is given. Such framework extends the MinMax k-means to automatically adapt the exponent parameter to the data set. It has been believed that if the maximum exponent parameter has been set, then the programme can reach the lowest intraclustering errors. However, our experiments show that this is not always correct. In this paper, we modified the MinMax k-means algorithm by PSO to determine the proper values of parameters which can subject the algorithm to attain the lowest clustering errors. The proposed clustering method is tested on some favorite data sets in several different initial situations and is compared to the k-means algorithm and the original MinMax k-means algorithm. The experimental results indicate that our proposed algorithm can reach the lowest clustering errors automatically. PMID:27656201

  2. PS-FW: A Hybrid Algorithm Based on Particle Swarm and Fireworks for Global Optimization

    PubMed Central

    Chen, Shuangqing; Wei, Lixin; Guan, Bing

    2018-01-01

    Particle swarm optimization (PSO) and fireworks algorithm (FWA) are two recently developed optimization methods which have been applied in various areas due to their simplicity and efficiency. However, when being applied to high-dimensional optimization problems, PSO algorithm may be trapped in the local optima owing to the lack of powerful global exploration capability, and fireworks algorithm is difficult to converge in some cases because of its relatively low local exploitation efficiency for noncore fireworks. In this paper, a hybrid algorithm called PS-FW is presented, in which the modified operators of FWA are embedded into the solving process of PSO. In the iteration process, the abandonment and supplement mechanism is adopted to balance the exploration and exploitation ability of PS-FW, and the modified explosion operator and the novel mutation operator are proposed to speed up the global convergence and to avoid prematurity. To verify the performance of the proposed PS-FW algorithm, 22 high-dimensional benchmark functions have been employed, and it is compared with PSO, FWA, stdPSO, CPSO, CLPSO, FIPS, Frankenstein, and ALWPSO algorithms. Results show that the PS-FW algorithm is an efficient, robust, and fast converging optimization method for solving global optimization problems. PMID:29675036

  3. Discovering the Unknown: Improving Detection of Novel Species and Genera from Short Reads

    DOE PAGES

    Rosen, Gail L.; Polikar, Robi; Caseiro, Diamantino A.; ...

    2011-01-01

    High-throughput sequencing technologies enable metagenome profiling, simultaneous sequencing of multiple microbial species present within an environmental sample. Since metagenomic data includes sequence fragments (“reads”) from organisms that are absent from any database, new algorithms must be developed for the identification and annotation of novel sequence fragments. Homology-based techniques have been modified to detect novel species and genera, but, composition-based methods, have not been adapted. We develop a detection technique that can discriminate between “known” and “unknown” taxa, which can be used with composition-based methods, as well as a hybrid method. Unlike previous studies, we rigorously evaluate all algorithms for theirmore » ability to detect novel taxa. First, we show that the integration of a detector with a composition-based method performs significantly better than homology-based methods for the detection of novel species and genera, with best performance at finer taxonomic resolutions. Most importantly, we evaluate all the algorithms by introducing an “unknown” class and show that the modified version of PhymmBL has similar or better overall classification performance than the other modified algorithms, especially for the species-level and ultrashort reads. Finally, we evaluate theperformance of several algorithms on a real acid mine drainage dataset.« less

  4. Analysis Balance Parameter of Optimal Ramp metering

    NASA Astrophysics Data System (ADS)

    Li, Y.; Duan, N.; Yang, X.

    2018-05-01

    Ramp metering is a motorway control method to avoid onset congestion through limiting the access of ramp inflows into the main road of the motorway. The optimization model of ramp metering is developed based upon cell transmission model (CTM). With the piecewise linear structure of CTM, the corresponding motorway traffic optimization problem can be formulated as a linear programming (LP) problem. It is known that LP problem can be solved by established solution algorithms such as SIMPLEX or interior-point methods for the global optimal solution. The commercial software (CPLEX) is adopted in this study to solve the LP problem within reasonable computational time. The concept is illustrated through a case study of the United Kingdom M25 Motorway. The optimal solution provides useful insights and guidances on how to manage motorway traffic in order to maximize the corresponding efficiency.

  5. The fastclime Package for Linear Programming and Large-Scale Precision Matrix Estimation in R.

    PubMed

    Pang, Haotian; Liu, Han; Vanderbei, Robert

    2014-02-01

    We develop an R package fastclime for solving a family of regularized linear programming (LP) problems. Our package efficiently implements the parametric simplex algorithm, which provides a scalable and sophisticated tool for solving large-scale linear programs. As an illustrative example, one use of our LP solver is to implement an important sparse precision matrix estimation method called CLIME (Constrained L 1 Minimization Estimator). Compared with existing packages for this problem such as clime and flare, our package has three advantages: (1) it efficiently calculates the full piecewise-linear regularization path; (2) it provides an accurate dual certificate as stopping criterion; (3) it is completely coded in C and is highly portable. This package is designed to be useful to statisticians and machine learning researchers for solving a wide range of problems.

  6. 75 FR 36147 - Self-Regulatory Organizations; Chicago Board Options Exchange, Incorporated; Order Approving...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-06-24

    ..., as Modified by Amendment No. 1 Thereto, Related to the Hybrid Matching Algorithms June 17, 2010. On... Hybrid System. Each rule currently provides allocation algorithms the Exchange can utilize when executing incoming electronic orders, including the Ultimate Matching Algorithm (``UMA''), and price-time and pro...

  7. Application of the simplex method to the optimal adjustment of the parameters of a ventilation network

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Kamba, G.M.; Jacques, E.; Patigny, J.

    1995-12-31

    Literature is rather abundant on the topic of steady-state network analysis programs. Many versions exist, some of them have real extended facilities such as full graphical manipulation, fire simulation in motion, etc. These programs are certainly of great help to any ventilation planning and often assist the ventilation engineer in his operational decision making. However, what ever the efficiency of the calculation algorithms might be, their weak point still is the overall validity of the model. This numerical model, apart from maybe the questionable application of some physical laws, depends directly on the quality of the data used to identifymore » its most influencing parameters such as the passive (resistance) or active (fan) characteristic of each of the branches in the network. Considering the non-linear character of the problem and the great number of variables involved, finding the closest numerical model of a real mine ventilation network is without any doubt a very difficult problem. This problem, often referred to as the parameter adjustment problem, is in almost every practical case solved on an experimental and {open_quotes}feeling{close_quotes} basis. Only a few papers put forward a mathematical solution based on a least square approach as the best fit criterion. The aim of this paper is to examine the possibility to apply the well-known simplex method to this problem. The performance of this method and its capability to reach the global optimum which corresponds to the best fit is discussed and compared to that of other methods.« less

  8. Conception of discrete systems decomposition algorithm using p-invariants and hypergraphs

    NASA Astrophysics Data System (ADS)

    Stefanowicz, Ł.

    2016-09-01

    In the article author presents an idea of decomposition algorithm of discrete systems described by Petri Nets using pinvariants. Decomposition process is significant from the point of view of discrete systems design, because it allows separation of the smaller sequential parts. Proposed algorithm uses modified Martinez-Silva method as well as author's selection algorithm. The developed method is a good complement of classical decomposition algorithms using graphs and hypergraphs.

  9. EARLY DIAGNOSIS IN POST RENAL TRANSPLANT OPPORTUNISTIC INFECTIONS: A FRESH LOOK.

    PubMed

    Chopra, G S; Narula, A S; Reddy, P S; Bhardwaj, J R

    1999-04-01

    A total of 86 renal transplant patients who were transplanted with live related donor (LRD) and live unrelated donor (LURD) kidneys were studied for opportunistic infections. Immune diagnosis of Toxoplasma, Cytomegalovirus (CMV), Herpes-simplex virus type II (HSV-2), Aspergillosis and Tuberculosis was carried out in these patients along with sputum examination, CSF studies and biopsy of lymphnode and other tissues in few cases. A high degree of Toxoplasma, CMV & HSV-2 positivity was seen in transplanted patients. However sensitivity of serological diagnosis of tuberculos was found to be low with standard criteria, which increased significantly when modified criteria were used. It is concluded that regular immunological monitoring should be carried out in transplanted patients so as to reach an early diagnosis and management of opportunistic infections.

  10. Immune reactions and allergy in experimental anisakiasis

    PubMed Central

    Lee, Haneul Nari

    2006-01-01

    The third-stage larvae (L3) of the parasitic nematode, Anisakis simplex, have been implicated in the induction of hyperimmune allergic reactions in orally infected humans. In this work, we have conducted a review of an investigation into immune reactions occurring in animals experimentally infected with A. simplex L3. The patterns of serum antibody productions in the experimental animals against excretory-secretory products (ESP) of A. simplex L3 contributed to our current knowledge regarding specific humoral immune reactions in humans. In our review, we were able to determine that L3 infection of experimental animals may constitute a good model system for further exploration of immune mechanisms and allergy in anisakiasis of humans. PMID:17170569

  11. Identification by GC-EAD of the two-component trail-following pheromone of Prorhinotermes simplex (Isoptera, Rhinotermitidae, Prorhinotermitinae).

    PubMed

    Sillam-Dussès, David; Kalinová, Blanka; Jiros, Pavel; Brezinová, Anna; Cvacka, Josef; Hanus, Robert; Sobotník, Jan; Bordereau, Christian; Valterová, Irena

    2009-08-01

    GC/MS analysis confirmed that neocembrene is the major component of the trail pheromone in the three species of the termite genus Prorhinotermes (P. simplex, P. canalifrons, P. inopinatus). In addition, EAG and GC-EAD experiments with P. simplex strongly suggest that dodecatrienol is a quantitatively minor component but a qualitatively important component of this trail pheromone. Trail-following bioassays confirmed the two-component nature of the trail pheromone. This is the first report of the use of the GC-EAD for the identification of trail pheromone in termites. These original results underline once again the special phylogenetic status of the Prorhinotermitinae among Rhinotermitidae.

  12. A novel algorithm for Bluetooth ECG.

    PubMed

    Pandya, Utpal T; Desai, Uday B

    2012-11-01

    In wireless transmission of ECG, data latency will be significant when battery power level and data transmission distance are not maintained. In applications like home monitoring or personalized care, to overcome the joint effect of previous issues of wireless transmission and other ECG measurement noises, a novel filtering strategy is required. Here, a novel algorithm, identified as peak rejection adaptive sampling modified moving average (PRASMMA) algorithm for wireless ECG is introduced. This algorithm first removes error in bit pattern of received data if occurred in wireless transmission and then removes baseline drift. Afterward, a modified moving average is implemented except in the region of each QRS complexes. The algorithm also sets its filtering parameters according to different sampling rate selected for acquisition of signals. To demonstrate the work, a prototyped Bluetooth-based ECG module is used to capture ECG with different sampling rate and in different position of patient. This module transmits ECG wirelessly to Bluetooth-enabled devices where the PRASMMA algorithm is applied on captured ECG. The performance of PRASMMA algorithm is compared with moving average and S-Golay algorithms visually as well as numerically. The results show that the PRASMMA algorithm can significantly improve the ECG reconstruction by efficiently removing the noise and its use can be extended to any parameters where peaks are importance for diagnostic purpose.

  13. Weakness in the band: nutrient-mediated trade-offs between migration and immunity of Mormon crickets, Anabrus simplex

    USDA-ARS?s Scientific Manuscript database

    MMormon crickets (Anabrus simplex) form large migratory bands that march over rangeland in the western United States in search of nutrients. Immune defense is particularly relevant to survival in migratory bands, but little is known about the role of nutrition in insect immunity, particularly in nat...

  14. Laboratory bioassays and field-cage trials of Metarhizium spp. isolates with field-collected Mormon crickets (Anabrus simplex)

    USDA-ARS?s Scientific Manuscript database

    The Mormon cricket, Anabrus simplex, is an important pest in the western United States. This study evaluates the virulence of 32 isolates of Metarhizium towards field-collected Mormon crickets. Additionally, several isolates were tested in outdoor field-cage studies. All 32 Metarhizium isolates were...

  15. 75 FR 59670 - Immunology and Microbiology Devices; Reclassification of the Herpes Simplex Virus Serological...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-09-28

    ... DEPARTMENT OF HEALTH AND HUMAN SERVICES Food and Drug Administration 21 CFR Part 866 [Docket No. FDA-2010-N-0429] Immunology and Microbiology Devices; Reclassification of the Herpes Simplex Virus... proposed that 21 CFR part 866 be amended as follows: PART 866--IMMUNOLOGY AND MICROBIOLOGY DEVICES 1. The...

  16. 75 FR 59611 - Microbiology Devices; Reclassification of Herpes Simplex Virus Types 1 and 2 Serological Assays...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-09-28

    ... DEPARTMENT OF HEALTH AND HUMAN SERVICES Food and Drug Administration 21 CFR Part 866 [Docket No. FDA-2009-N-0344] Microbiology Devices; Reclassification of Herpes Simplex Virus Types 1 and 2 Serological Assays; Confirmation of Effective Date AGENCY: Food and Drug Administration, HHS. ACTION: Direct...

  17. 76 FR 48715 - Immunology and Microbiology Devices; Reclassification of the Herpes Simplex Virus Serological...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-08-09

    ... DEPARTMENT OF HEALTH AND HUMAN SERVICES Food and Drug Administration 21 CFR Part 866 [Docket No. FDA-2010-N-0429] Immunology and Microbiology Devices; Reclassification of the Herpes Simplex Virus... CFR part 866 is amended as follows: PART 866--IMMUNOLOGY AND MICROBIOLOGY DEVICES 0 1. The authority...

  18. Norrie disease. Diagnosis of a simplex case by DNA analysis.

    PubMed

    Chynn, E W; Walton, D S; Hahn, L B; Dryja, T P

    1996-09-01

    Norrie disease is a rare, X-linked recessive disorder characterized by congenital blindness due to malformed retinas. We describe a simplex patient who had leukokoria and whose clinical diagnosis was confirmed only after molecular genetics analysis. DNA analysis was also used to determine the carrier status of relatives of the proband.

  19. Herpes Simplex Virus Infection in a University Health Population: Clinical Manifestations, Epidemiology, and Implications

    ERIC Educational Resources Information Center

    Horowitz, Robert; Aierstuck, Sara; Williams, Elizabeth A.; Melby, Bernette

    2010-01-01

    Objective: The authors described clinical presentations of oral and genital herpes simplex virus (HSV) infections in a university health population and implications of these findings. Participants and Methods: Using a standardized data collection tool, 215 records of patients with symptomatic culture-positive HSV infections were reviewed. Results:…

  20. Does the Cognitive Architecture of Simplex and Multiplex ASD Families Differ?

    ERIC Educational Resources Information Center

    Oerlemans, Anoek M.; Hartman, Catharina A.; Franke, Barbara; Buitelaar, Jan K.; Rommelse, Nanda N. J.

    2016-01-01

    Children with an autism spectrum disorder (ASD) and their unaffected siblings from 54 simplex (SPX, one individual in the family affected) and 59 multiplex (MPX, two or more individuals affected) families, and 124 controls were assessed on intelligence, social cognition and executive functions. SPX and MPX ASD probands displayed similar cognitive…

  1. Molecular diagnosis of allergy to Anisakis simplex and Gymnorhynchus gigas fish parasites.

    PubMed

    Armentia, A; Santos, J; Serrano, Z; Martín, B; Martín, S; Barrio, J; Fernández, S; González-Sagrado, M; Pineda, F; Palacios, R

    There has been an increase in the prevalence of hypersensitivity to Anisakis simplex. There are fish parasites other than Anisakis simplex whose allergenicity has not yet been studied. To assess IgE hypersensitivity caused by fish parasite allergens in patients with gastro-allergic symptoms after consumption of fish, shellfish or cephalopods, compared with healthy subjects, pollen allergic individuals and children with digestive symptoms after eating marine food. We carried out in vivo tests (skin prick) and in vitro tests (specific IgE determination, Western blot) and component resolved diagnostics (CRD) using microarray analysis in all patients. CRD better detected sensitisation to allergens from marine parasites than skin prick tests and determination of specific IgE by CAP. Sensitisation to Gymnorhynchus gigas was detected in 26% of patients measured by skin prick tests and 36% measured by IgE. The prevalence of hypersensitivity to marine parasite allergens other than Anisakis simplex should be studied, and the most appropriate technique for this is CRD. Copyright © 2017 SEICAP. Published by Elsevier España, S.L.U. All rights reserved.

  2. MOTIVATION INTERNALIZATION AND SIMPLEX STRUCTURE IN SELF-DETERMINATION THEORY.

    PubMed

    Ünlü, Ali; Dettweiler, Ulrich

    2015-12-01

    Self-determination theory, as proposed by Deci and Ryan, postulated different types of motivation regulation. As to the introjected and identified regulation of extrinsic motivation, their internalizations were described as "somewhat external" and "somewhat internal" and remained undetermined in the theory. This paper introduces a constrained regression analysis that allows these vaguely expressed motivations to be estimated in an "optimal" manner, in any given empirical context. The approach was even generalized and applied for simplex structure analysis in self-determination theory. The technique was exemplified with an empirical study comparing science teaching in a classical school class versus an expeditionary outdoor program. Based on a sample of 84 German pupils (43 girls, 41 boys, 10 to 12 years old), data were collected using the German version of the Academic Self-Regulation Questionnaire. The science-teaching format was seen to not influence the pupils' internalization of identified regulation. The internalization of introjected regulation differed and shifted more toward the external pole in the outdoor teaching format. The quantification approach supported the simplex structure of self-determination theory, whereas correlations may disconfirm the simplex structure.

  3. Role of Autoantibodies to N-Methyl-d-Aspartate (NMDA) Receptor in Relapsing Herpes Simplex Encephalitis: A Retrospective, One-Center Experience.

    PubMed

    Sutcu, Murat; Akturk, Hacer; Somer, Ayper; Tatli, Burak; Torun, Selda Hancerli; Yıldız, Edibe Pembegul; Şık, Guntulu; Citak, Agop; Agacfidan, Ali; Salman, Nuran

    2016-03-01

    Post-herpes simplex virus encephalitis relapses have been recently associated with autoimmunity driven by autoantibodies against N-methyl-d-aspartate (NMDA) receptors. Because it offers different treatment options, determination of this condition is important. Between 2011 and 2014, 7 children with proven diagnosis of herpes simplex virus encephalitis were identified in a university hospital of Istanbul. Two patients had neurologic relapse characterized mainly by movement disorders 2 to 3 weeks after initial encephalitis. The first patient received a second 14 days of acyclovir treatment together with antiepileptic drugs and left with severe neurologic sequelae. The second patient was found to be NMDA receptors antibody positive in the cerebrospinal fluid. She was treated with intravenous immunoglobulin and prednisolone. She showed substantial improvement, gradually regaining lost neurologic abilities. Post-herpes simplex virus encephalitis relapses may frequently be immune-mediated rather than a viral reactivation, particularly in children displaying movement disorders like choreoathetosis. Immunotherapy may provide benefit for this potentially devastating condition, like the case described in this report. © The Author(s) 2015.

  4. Vaccinia Virus Recombinant Expressing Herpes Simplex Virus Type 1 Glycoprotein D Prevents Latent Herpes in Mice

    NASA Astrophysics Data System (ADS)

    Cremer, Kenneth J.; Mackett, Michael; Wohlenberg, Charles; Notkins, Abner Louis; Moss, Bernard

    1985-05-01

    In humans, herpes simplex virus causes a primary infection and then often a latent ganglionic infection that persists for life. Because these latent infections can recur periodically, vaccines are needed that can protect against both primary and latent herpes simplex infections. Infectious vaccinia virus recombinants that contain the herpes simplex virus type 1 (HSV-1) glycoprotein D gene under control of defined early or late vaccinia virus promoters were constructed. Tissue culture cells infected with these recombinant viruses synthesized a glycosylated protein that had the same mass (60,000 daltons) as the glycoprotein D produced by HSV-1. Immunization of mice with one of these recombinant viruses by intradermal, subcutaneous, or intraperitoneal routes resulted in the production of antibodies that neutralized HSV-1 and protected the mice against subsequent lethal challenge with HSV-1 or HSV-2. Immunization with the recombinant virus also protected the majority of the mice against the development of a latent HSV-1 infection of the trigeminal ganglia. This is the first demonstration that a genetically engineered vaccine can prevent the development of latency.

  5. An approximate stationary solution for multi-allele neutral diffusion with low mutation rates.

    PubMed

    Burden, Conrad J; Tang, Yurong

    2016-12-01

    We address the problem of determining the stationary distribution of the multi-allelic, neutral-evolution Wright-Fisher model in the diffusion limit. A full solution to this problem for an arbitrary K×K mutation rate matrix involves solving for the stationary solution of a forward Kolmogorov equation over a (K-1)-dimensional simplex, and remains intractable. In most practical situations mutations rates are slow on the scale of the diffusion limit and the solution is heavily concentrated on the corners and edges of the simplex. In this paper we present a practical approximate solution for slow mutation rates in the form of a set of line densities along the edges of the simplex. The method of solution relies on parameterising the general non-reversible rate matrix as the sum of a reversible part and a set of (K-1)(K-2)/2 independent terms corresponding to fluxes of probability along closed paths around faces of the simplex. The solution is potentially a first step in estimating non-reversible evolutionary rate matrices from observed allele frequency spectra. Copyright © 2016 Elsevier Inc. All rights reserved.

  6. Simulated bi-SQUID Arrays Performing Direction Finding

    DTIC Science & Technology

    2015-09-01

    First, we applied the multiple signal classification ( MUSIC ) algorithm on linearly polarized signals. We included multiple signals in the output...both of the same frequency and different fre- quencies. Next, we explored a modified MUSIC algorithm called dimensionality reduction MUSIC (DR- MUSIC ... MUSIC algorithm is able to determine the AoA from the simulated SQUID data for linearly polarized signals. The MUSIC algorithm could accurately find

  7. Antiviral Activity of Crude Hydroethanolic Extract from Schinus terebinthifolia against Herpes simplex Virus Type 1.

    PubMed

    Nocchi, Samara Requena; Companhoni, Mychelle Vianna Pereira; de Mello, João Carlos Palazzo; Dias Filho, Benedito Prado; Nakamura, Celso Vataru; Carollo, Carlos Alexandre; Silva, Denise Brentan; Ueda-Nakamura, Tânia

    2017-04-01

    Herpes simplex virus infections persist throughout the lifetime of the host and affect more than 80 % of the humans worldwide. The intensive use of available therapeutic drugs has led to undesirable effects, such as drug-resistant strains, prompting the search for new antiherpetic agents. Although diverse bioactivities have been identified in Schinus terebinthifolia , its antiviral activity has not attracted much attention. The present study evaluated the antiherpetic effects of a crude hydroethanolic extract from the stem bark of S. terebinthifolia against Herpes simplex virus type 1 in vitro and in vivo as well as its genotoxicity in bone marrow in mammals and established the chemical composition of the crude hydroethanolic extract based on liquid chromatography-diode array detector-mass spectrometry and MS/MS. The crude hydroethanolic extract inhibited all of the tested Herpes simplex virus type 1 strains in vitro and was effective in the attachment and penetration stages, and showed virucidal activity, which was confirmed by transmission electron microscopy. The micronucleus test showed that the crude hydroethanolic extract had no genotoxic effect at the concentrations tested. The crude hydroethanolic extract afforded protection against lesions that were caused by Herpes simplex virus type 1 in vivo . Liquid chromatography-diode array detector-mass spectrometry and MS/MS identified 25 substances, which are condensed tannins mainly produced by a B-type linkage and prodelphinidin and procyanidin units. Georg Thieme Verlag KG Stuttgart · New York.

  8. Unified Lambert Tool for Massively Parallel Applications in Space Situational Awareness

    NASA Astrophysics Data System (ADS)

    Woollands, Robyn M.; Read, Julie; Hernandez, Kevin; Probe, Austin; Junkins, John L.

    2018-03-01

    This paper introduces a parallel-compiled tool that combines several of our recently developed methods for solving the perturbed Lambert problem using modified Chebyshev-Picard iteration. This tool (unified Lambert tool) consists of four individual algorithms, each of which is unique and better suited for solving a particular type of orbit transfer. The first is a Keplerian Lambert solver, which is used to provide a good initial guess (warm start) for solving the perturbed problem. It is also used to determine the appropriate algorithm to call for solving the perturbed problem. The arc length or true anomaly angle spanned by the transfer trajectory is the parameter that governs the automated selection of the appropriate perturbed algorithm, and is based on the respective algorithm convergence characteristics. The second algorithm solves the perturbed Lambert problem using the modified Chebyshev-Picard iteration two-point boundary value solver. This algorithm does not require a Newton-like shooting method and is the most efficient of the perturbed solvers presented herein, however the domain of convergence is limited to about a third of an orbit and is dependent on eccentricity. The third algorithm extends the domain of convergence of the modified Chebyshev-Picard iteration two-point boundary value solver to about 90% of an orbit, through regularization with the Kustaanheimo-Stiefel transformation. This is the second most efficient of the perturbed set of algorithms. The fourth algorithm uses the method of particular solutions and the modified Chebyshev-Picard iteration initial value solver for solving multiple revolution perturbed transfers. This method does require "shooting" but differs from Newton-like shooting methods in that it does not require propagation of a state transition matrix. The unified Lambert tool makes use of the General Mission Analysis Tool and we use it to compute thousands of perturbed Lambert trajectories in parallel on the Space Situational Awareness computer cluster at the LASR Lab, Texas A&M University. We demonstrate the power of our tool by solving a highly parallel example problem, that is the generation of extremal field maps for optimal spacecraft rendezvous (and eventual orbit debris removal). In addition we demonstrate the need for including perturbative effects in simulations for satellite tracking or data association. The unified Lambert tool is ideal for but not limited to space situational awareness applications.

  9. Mixing times in quantum walks on two-dimensional grids

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Marquezino, F. L.; Portugal, R.; Abal, G.

    2010-10-15

    Mixing properties of discrete-time quantum walks on two-dimensional grids with toruslike boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving the eigenproblem for the evolution operator for this particular graph. The limiting distribution and mixing time of a quantum walk with a coin operator modified as in the abstract search algorithm are obtained numerically. On the basis of these results, the relation between the mixing time of the modified walk and themore » running time of the corresponding abstract search algorithm is discussed.« less

  10. Mixing times in quantum walks on two-dimensional grids

    NASA Astrophysics Data System (ADS)

    Marquezino, F. L.; Portugal, R.; Abal, G.

    2010-10-01

    Mixing properties of discrete-time quantum walks on two-dimensional grids with toruslike boundary conditions are analyzed, focusing on their connection to the complexity of the corresponding abstract search algorithm. In particular, an exact expression for the stationary distribution of the coherent walk over odd-sided lattices is obtained after solving the eigenproblem for the evolution operator for this particular graph. The limiting distribution and mixing time of a quantum walk with a coin operator modified as in the abstract search algorithm are obtained numerically. On the basis of these results, the relation between the mixing time of the modified walk and the running time of the corresponding abstract search algorithm is discussed.

  11. A Modified Artificial Bee Colony Algorithm Application for Economic Environmental Dispatch

    NASA Astrophysics Data System (ADS)

    Tarafdar Hagh, M.; Baghban Orandi, Omid

    2018-03-01

    In conventional fossil-fuel power systems, the economic environmental dispatch (EED) problem is a major problem that optimally determines the output power of generating units in a way that cost of total production and emission level be minimized simultaneously, and at the same time all the constraints of units and system are satisfied properly. To solve EED problem which is a non-convex optimization problem, a modified artificial bee colony (MABC) algorithm is proposed in this paper. This algorithm by implementing weighted sum method is applied on two test systems, and eventually, obtained results are compared with other reported results. Comparison of results confirms superiority and efficiency of proposed method clearly.

  12. [Anisakis simplex larvae: infection status in marine fishes for sale in Shantou].

    PubMed

    Chen, Jun-Hua; Xu, Zhi-Xia; Xu, Guang-Xing; Huang, Jian-Yun; Chen, Hong-Hui; Shi, Shi-Zun; Wu, Xiu-Yang; Liang, Jing-Jing

    2014-06-01

    To investigate the infection status of Anisakis simplex larvae in marine fishes for sale in Shantou. Marine fishes were randomly collected from markets in Shantou City from February to December 2013, and then classified. The viscera and muscle of each fish were carefully dissected and thoroughly examined for anisakids. The larvae were examined under a light microscope. The infection rate and intensity of Anisakis simplex larvae were calculated. A total of 382 fish specimens belonging to 52 species were examined. 42 out of 52 species (80.8%) were found infected by A. simplex larvae. The overall infection rate reached 47.4% (181/382), and average 5.5 larvae parasitized per infected fish (995/181). The survival rate of larvae was 100%. The highest infection rate observed was 100% in Scomber australasicus (4/4), Trachurus japonicus (9/9), Decapterus maruadsi (8/8), Lutjanus lutjanus (9/9), Argyrosomus argentatus (4/4), Nibea albiflora (4/4), Nemipterus bathybius (12/12), Trachinocephalus myops (7/7) and Mene maculata (9/9), followed by 16/18 in Pneumatophorus japonicus, 6/7 in Lutjanus ophuysenii and 5/6 in Lutjanus fulvus. A. simplex larvae were not detected in 10 fish species, namely, Megalaspis cordyla, Lutjanus argentimaculatus, Lutjanus fulviflamma, Acanthopagrus australis, Acanthopagrus latus, Plectorhinchus nigrus, Dentex tumifrons, Psenopsis anomala, Scatophagus argus, and Seriola lalandi. The infection intensity was the highest in Lutjanus fulvus (21.0 per fish), followed by Trachinocephalus myops (16.7 per fish), Saurida filamentosa (14.0 per fish) and Mene maculate (10.1 per fish). The lowest infection intensity was found in Rastrelliger kanagurta, Kaiwarinus equula, Atule mate, Lutjanus russellii, Plectorhinchus cinctus, Priacanthus tayenus, Branchiostegus argentatus, Branchiostegus albus, Sphyraena pinguis, Formio niger, Trachinotus blochii, Siganus fuscescens and Choerodon azurio (less than 2 per fish). The highest infection rate (34.3%, 131/382) was found in the mesentery. The infection intensity was highest in pyloric appendage (3.5 per fish). A. simplex larvae were not found in muscle. The highest infection rate (60.2%, 74/123) was found in fishes with body weight of 100-200 g. The infection intensity was highest in fish with body weight of 301-400 g (7.8 per fish). The infection rate of A. simplex larvae is high in marine fishes from Shantou markets.

  13. Modifying a numerical algorithm for solving the matrix equation X + AX T B = C

    NASA Astrophysics Data System (ADS)

    Vorontsov, Yu. O.

    2013-06-01

    Certain modifications are proposed for a numerical algorithm solving the matrix equation X + AX T B = C. By keeping the intermediate results in storage and repeatedly using them, it is possible to reduce the total complexity of the algorithm from O( n 4) to O( n 3) arithmetic operations.

  14. 75 FR 27850 - Self-Regulatory Organizations; Chicago Board Options Exchange, Incorporated; Notice of Filing of...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-05-18

    ... Change, as Modified by Amendment No. 1 Thereto, Related to the Hybrid Matching Algorithms May 12, 2010... allocation algorithms to choose from when executing incoming electronic orders. The menu format allows the Exchange to utilize different allocation algorithms on a class-by-class basis. The menu includes, among...

  15. An Efficient Algorithm for TUCKALS3 on Data with Large Numbers of Observation Units.

    ERIC Educational Resources Information Center

    Kiers, Henk A. L.; And Others

    1992-01-01

    A modification of the TUCKALS3 algorithm is proposed that handles three-way arrays of order I x J x K for any I. The reduced work space needed for storing data and increased execution speed make the modified algorithm very suitable for use on personal computers. (SLD)

  16. Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Vecharynski, Eugene; Brabec, Jiri; Shao, Meiyue

    We present two efficient iterative algorithms for solving the linear response eigen- value problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into a product eigenvalue problem that is self-adjoint with respect to a K-inner product. This product eigenvalue problem can be solved efficiently by a modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-innermore » product. The solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. However, the other component of the eigenvector can be easily recovered in a postprocessing procedure. Therefore, the algorithms we present here are more efficient than existing algorithms that try to approximate both components of the eigenvectors simultaneously. The efficiency of the new algorithms is demonstrated by numerical examples.« less

  17. Improved egg crack detection algorithm for modified pressure imaging system

    USDA-ARS?s Scientific Manuscript database

    Shell eggs with microcracks are often undetected during egg grading processes. In the past, a modified pressure imaging system was developed to detect eggs with microcracks without adversely affecting the quality of normal intact eggs. The basic idea of the modified pressure imaging system was to ap...

  18. An Approximation of the Error Backpropagation Algorithm in a Predictive Coding Network with Local Hebbian Synaptic Plasticity

    PubMed Central

    Whittington, James C. R.; Bogacz, Rafal

    2017-01-01

    To efficiently learn from feedback, cortical networks need to update synaptic weights on multiple levels of cortical hierarchy. An effective and well-known algorithm for computing such changes in synaptic weights is the error backpropagation algorithm. However, in this algorithm, the change in synaptic weights is a complex function of weights and activities of neurons not directly connected with the synapse being modified, whereas the changes in biological synapses are determined only by the activity of presynaptic and postsynaptic neurons. Several models have been proposed that approximate the backpropagation algorithm with local synaptic plasticity, but these models require complex external control over the network or relatively complex plasticity rules. Here we show that a network developed in the predictive coding framework can efficiently perform supervised learning fully autonomously, employing only simple local Hebbian plasticity. Furthermore, for certain parameters, the weight change in the predictive coding model converges to that of the backpropagation algorithm. This suggests that it is possible for cortical networks with simple Hebbian synaptic plasticity to implement efficient learning algorithms in which synapses in areas on multiple levels of hierarchy are modified to minimize the error on the output. PMID:28333583

  19. Automatic arrival time detection for earthquakes based on Modified Laplacian of Gaussian filter

    NASA Astrophysics Data System (ADS)

    Saad, Omar M.; Shalaby, Ahmed; Samy, Lotfy; Sayed, Mohammed S.

    2018-04-01

    Precise identification of onset time for an earthquake is imperative in the right figuring of earthquake's location and different parameters that are utilized for building seismic catalogues. P-wave arrival detection of weak events or micro-earthquakes cannot be precisely determined due to background noise. In this paper, we propose a novel approach based on Modified Laplacian of Gaussian (MLoG) filter to detect the onset time even in the presence of very weak signal-to-noise ratios (SNRs). The proposed algorithm utilizes a denoising-filter algorithm to smooth the background noise. In the proposed algorithm, we employ the MLoG mask to filter the seismic data. Afterward, we apply a Dual-threshold comparator to detect the onset time of the event. The results show that the proposed algorithm can detect the onset time for micro-earthquakes accurately, with SNR of -12 dB. The proposed algorithm achieves an onset time picking accuracy of 93% with a standard deviation error of 0.10 s for 407 field seismic waveforms. Also, we compare the results with short and long time average algorithm (STA/LTA) and the Akaike Information Criterion (AIC), and the proposed algorithm outperforms them.

  20. An Approximation of the Error Backpropagation Algorithm in a Predictive Coding Network with Local Hebbian Synaptic Plasticity.

    PubMed

    Whittington, James C R; Bogacz, Rafal

    2017-05-01

    To efficiently learn from feedback, cortical networks need to update synaptic weights on multiple levels of cortical hierarchy. An effective and well-known algorithm for computing such changes in synaptic weights is the error backpropagation algorithm. However, in this algorithm, the change in synaptic weights is a complex function of weights and activities of neurons not directly connected with the synapse being modified, whereas the changes in biological synapses are determined only by the activity of presynaptic and postsynaptic neurons. Several models have been proposed that approximate the backpropagation algorithm with local synaptic plasticity, but these models require complex external control over the network or relatively complex plasticity rules. Here we show that a network developed in the predictive coding framework can efficiently perform supervised learning fully autonomously, employing only simple local Hebbian plasticity. Furthermore, for certain parameters, the weight change in the predictive coding model converges to that of the backpropagation algorithm. This suggests that it is possible for cortical networks with simple Hebbian synaptic plasticity to implement efficient learning algorithms in which synapses in areas on multiple levels of hierarchy are modified to minimize the error on the output.

  1. Knowledge requirements for automated inference of medical textbook markup.

    PubMed Central

    Berrios, D. C.; Kehler, A.; Fagan, L. M.

    1999-01-01

    Indexing medical text in journals or textbooks requires a tremendous amount of resources. We tested two algorithms for automatically indexing nouns, noun-modifiers, and noun phrases, and inferring selected binary relations between UMLS concepts in a textbook of infectious disease. Sixty-six percent of nouns and noun-modifiers and 81% of noun phrases were correctly matched to UMLS concepts. Semantic relations were identified with 100% specificity and 94% sensitivity. For some medical sub-domains, these algorithms could permit expeditious generation of more complex indexing. PMID:10566445

  2. A Tensor Product Formulation of Strassen's Matrix Multiplication Algorithm with Memory Reduction

    DOE PAGES

    Kumar, B.; Huang, C. -H.; Sadayappan, P.; ...

    1995-01-01

    In this article, we present a program generation strategy of Strassen's matrix multiplication algorithm using a programming methodology based on tensor product formulas. In this methodology, block recursive programs such as the fast Fourier Transforms and Strassen's matrix multiplication algorithm are expressed as algebraic formulas involving tensor products and other matrix operations. Such formulas can be systematically translated to high-performance parallel/vector codes for various architectures. In this article, we present a nonrecursive implementation of Strassen's algorithm for shared memory vector processors such as the Cray Y-MP. A previous implementation of Strassen's algorithm synthesized from tensor product formulas required working storagemore » of size O(7 n ) for multiplying 2 n × 2 n matrices. We present a modified formulation in which the working storage requirement is reduced to O(4 n ). The modified formulation exhibits sufficient parallelism for efficient implementation on a shared memory multiprocessor. Performance results on a Cray Y-MP8/64 are presented.« less

  3. Analysis of Modified SMI Method for Adaptive Array Weight Control. M.S. Thesis

    NASA Technical Reports Server (NTRS)

    Dilsavor, Ronald Louis

    1989-01-01

    An adaptive array is used to receive a desired signal in the presence of weak interference signals which need to be suppressed. A modified sample matrix inversion (SMI) algorithm controls the array weights. The modification leads to increased interference suppression by subtracting a fraction of the noise power from the diagonal elements of the covariance matrix. The modified algorithm maximizes an intuitive power ratio criterion. The expected values and variances of the array weights, output powers, and power ratios as functions of the fraction and the number of snapshots are found and compared to computer simulation and real experimental array performance. Reduced-rank covariance approximations and errors in the estimated covariance are also described.

  4. The N-Simplex and Its Generalizations towards Fractals

    ERIC Educational Resources Information Center

    Kosi-Ulbl, Irena; Pagon, Dusan

    2002-01-01

    Nature is full of different crystals and many of them have shapes of regular geometric objects. Those in which the fractal structure of a geometric object can be recognized are especially unusual. In this paper a generalization of one of these shapes is described: a formation, based on an n-dimensional simplex. The construction of an n-dimensional…

  5. [Folliculitis barbae in herpes simplex infection].

    PubMed

    Löhrer, R; Rübben, A

    2004-01-01

    A 60-year-old male athlete developed a folliculitis in the beard region after several competitions. After identification of herpes simplex antigen within the lesions, systemic therapy with acyclovir led to rapid improvement. In folliculitis resistant to antibiotic and anti-inflammatory therapy, viral and mycotic infections as well as eosinophilic folliculitis should be considered as differential diagnostic possibilities.

  6. Relating Factor Models for Longitudinal Data to Quasi-Simplex and NARMA Models

    ERIC Educational Resources Information Center

    Rovine, Michael J.; Molenaar, Peter C. M.

    2005-01-01

    In this article we show the one-factor model can be rewritten as a quasi-simplex model. Using this result along with addition theorems from time series analysis, we describe a common general model, the nonstationary autoregressive moving average (NARMA) model, that includes as a special case, any latent variable model with continuous indicators…

  7. The Broader Autism Phenotype in Simplex and Multiplex Families

    ERIC Educational Resources Information Center

    Gerdts, Jennifer A.; Bernier, Raphael; Dawson, Geraldine; Estes, Annette

    2013-01-01

    Mothers, fathers, and siblings from 87 multiplex (M-mothers, M-fathers, and M-siblings) and 41 simplex (S-mothers, S-fathers, and S-siblings) Autism spectrum disorder families were assessed using the Broader Phenotype Autism Symptom Scale. S-mothers, S-fathers, and S-siblings showed more social interest and were more expressive in their use of…

  8. Serologic Screening for Herpes Simplex Virus among University Students: A Pilot Study

    ERIC Educational Resources Information Center

    Mark, Hayley; Nanda, Joy P.; Joffe, Alain; Roberts, Jessica; Rompalo, Anne; Melendez, Johan; Zenilman, Jonathan

    2008-01-01

    Objective: The authors examined the feasibility of conducting serologic testing for the herpes simplex virus 2 (HSV-2) among university students and assessed the psychosocial impact of an HSV-2 diagnosis. Methods: The authors recruited a convenience sample of 100 students (aged 18-39 years) without a history of genital herpes from 1 university…

  9. Identification of ribonucleotide reductase mutation causing temperature-sensitivity of herpes simplex virus isolates from whitlow by deep sequencing.

    PubMed

    Daikoku, Tohru; Oyama, Yukari; Yajima, Misako; Sekizuka, Tsuyoshi; Kuroda, Makoto; Shimada, Yuka; Takehara, Kazuhiko; Miwa, Naoko; Okuda, Tomoko; Sata, Tetsutaro; Shiraki, Kimiyasu

    2015-06-01

    Herpes simplex virus 2 caused a genital ulcer, and a secondary herpetic whitlow appeared during acyclovir therapy. The secondary and recurrent whitlow isolates were acyclovir-resistant and temperature-sensitive in contrast to a genital isolate. We identified the ribonucleotide reductase mutation responsible for temperature-sensitivity by deep-sequencing analysis.

  10. Smallpox Antiviral Drug

    DTIC Science & Technology

    2007-01-01

    viruses, herpes simplex virus (HSV), cytomegalovirus (CMV), varicella-zoster virus (VZV), influenza A and B viruses, and respiratory syncytial virus...Rouzioux C. 2004. Penetration of enfuvirtide, tenofovir, efavirenz, and protease inhibitors in the genital tract of HIV-1-infected men. Aids 18:1958...1968. Sensitivity of herpes simplex virus, vaccinia virus, and adenoviruses to deoxyribonucleic acid inhibitors and thiosemicarbazones in a plaque

  11. Increased Sensory Processing Atypicalities in Parents of Multiplex ASD Families versus Typically Developing and Simplex ASD Families

    ERIC Educational Resources Information Center

    Donaldson, Chelsea K.; Stauder, Johannes E. A.; Donkers, Franc C. L.

    2017-01-01

    Recent studies have suggested that sensory processing atypicalities may share genetic influences with autism spectrum disorder (ASD). To further investigate this, the adolescent/adult sensory profile (AASP) questionnaire was distributed to 85 parents of typically developing children (P-TD), 121 parents from simplex ASD families (SPX), and 54…

  12. A case of urinary retention in the early stages of herpes simplex virus type-1 encephalitis.

    PubMed

    Fukuoka, Takuya; Nakazato, Yoshihiko; Miyake, Akifumi; Tamura, Naotoshi; Araki, Nobuo; Yamamoto, Toshimasa

    2017-06-01

    A 70-year-old man developed urinary retention in the early stages of herpes simplex virus (HSV) type-1 encephalitis. A nerve conduction study suggested latent myeloradiculitis. This is the first report of human herpes simplex virus-1 encephalitis followed by urinary retention at early stage from the onset like the Elsberg syndrome. Although relatively few similar cases have been reported, we consider that urinary retention is common in HSV-1 encephalitis, in which disturbances of consciousness usually require bladder catheterization from the onset. We further emphasize that urinary retention may occasionally occur in early stages of HSV-1 encephalitis, with a significant possibility of recovery. Copyright © 2017. Published by Elsevier B.V.

  13. Fatal herpes simplex infection in a pygmy African hedgehog (Atelerix albiventris).

    PubMed

    Allison, N; Chang, T C; Steele, K E; Hilliard, J K

    2002-01-01

    An adult pygmy African hedgehog developed acute posterior paresis attributed to a prolapsed intervertebral disc diagnosed by C-T scan. Corticosteroid therapy resulted in prompt resolution of the ataxia, but 2 weeks later the animal became anorexic and died. Macroscopically, the liver was stippled with punctate off-white foci which were confirmed microscopically to be foci of necrosis. Numerous hepatocytes contained intranuclear inclusions and syncytial cell formation was also present. A herpes virus was isolated and identified by fluorescent antibody and polymerase chain reaction studies as herpesvirus simplex type 1. To our knowledge, this is the first report of herpes infection in the African hedgehog and the first time herpes simplex has been identified as a cause of disease in insectivores.

  14. Algorithm for designing smart factory Industry 4.0

    NASA Astrophysics Data System (ADS)

    Gurjanov, A. V.; Zakoldaev, D. A.; Shukalov, A. V.; Zharinov, I. O.

    2018-03-01

    The designing task of production division of the Industry 4.0 item designing company is being studied. The authors proposed an algorithm, which is based on the modified V L Volkovich method. This algorithm allows generating options how to arrange the production with robotized technological equipment functioning in the automatic mode. The optimization solution of the multi-criteria task for some additive criteria is the base of the algorithm.

  15. One improved LSB steganography algorithm

    NASA Astrophysics Data System (ADS)

    Song, Bing; Zhang, Zhi-hong

    2013-03-01

    It is easy to be detected by X2 and RS steganalysis with high accuracy that using LSB algorithm to hide information in digital image. We started by selecting information embedded location and modifying the information embedded method, combined with sub-affine transformation and matrix coding method, improved the LSB algorithm and a new LSB algorithm was proposed. Experimental results show that the improved one can resist the X2 and RS steganalysis effectively.

  16. [Laboratory diagnosis of genital herpes--direct immunofluorescence method].

    PubMed

    Majewska, Anna; Romejko-Wolniewicz, Ewa; Zareba-Szczudlik, Julia; Kilijańczyk, Marek; Gajewska, Małgorzata; Młynarczyk, Grazyna

    2013-07-01

    Aim of the study was to determine clinical usefulness of direct immunofluorescence method in the laboratory diagnosis of genital herpes in women. Overall 187 anogenital swabs were collected from 120 women. Using a dacron-tipped applicator 83 swabs were collected from women suspected of genital herpes and 104 from patients with no signs of genital infection. All samples were tested using cell culture (Vero cell line) and then direct immunofluorescence method (DIF) for the identification of antigens of herpes simplex viruses: HSV-1 and HSV-2. Characteristic cytopathic effect (CPE), indicative of alphaherpesvirus infection, was observed in 43.4% of cultures with clinical specimens collected from women with suspected genital herpes and in 29.8% of cultures of clinical specimens taken from patients with no clinical symptoms of genital herpes. Herpes simplex viruses were determined in 73 samples by direct immunofluorescence method after amplification of the virus in cell culture. The DIF test confirmed the diagnosis based on the microscopic CPE observation in 85%. In 15% of samples (taken from pregnant women without clinical signs of infection) we reported positive immunofluorescence in the absence of CPE. The frequency of antigen detection was statistically significantly higher in samples that were positive by culture study (chi-square test with Yates's correction, p < 0.01). This method proved to be highly sensitive (97%) in women with clinically suspected infection. High negative predictive value (99%) proves the clinical utility of the DIF in these group of patients. In asymptomatic infections, viral antigens were detected most frequently in the swabs from the cervical canal, and in cases of suspected genital herpes in swabs taken from the vestibule of the vagina and the vulva. However, there was no statistically significant difference in the frequency of detection of Herpes Simplex Virus antigens in specimens from different parts of the genital tract in both groups of women (chi-square test, p > 0.05). In our study HHV-1 was the main causative agent of genital herpes. The growing worldwide prevalence of genital herpes, challenges with the clinical diagnosis, and availability of effective antiviral therapy are the main reasons for a growing interest in rapid, proper laboratory diagnosis of infected patients. Optimal testing diagnostic algorithm depends on patient population, clinical circumstances and availability. Our results indicated that combination of laboratory tests may help to establish the diagnosis if genital herpes is suspected but there are no typical signs.

  17. Improved CT Detection of Acute Herpes Simplex Virus Type 1 Encephalitis Based on a Frequency-Selective Nonlinear Blending: Comparison With MRI.

    PubMed

    Bongers, Malte Niklas; Bier, Georg; Ditt, Hendrik; Beck, Robert; Ernemann, Ulrike; Nikolaou, Konstantin; Horger, Marius

    2016-11-01

    The purpose of this study is to compare the diagnostic efficacy of a new CT postprocessing tool based on frequency-selective nonlinear blending (best-contrast CT) with that of standard linear blending of unenhanced head CT in patients with herpes simplex virus type 1 and herpes simplex virus encephalitis (HSE), using FLAIR MRI sequences as the standard of reference. Fifteen consecutive patients (six women and nine men; mean [± SD] age, 60 ± 19 years) with proven HSE (positive polymerase chain reaction results from CSF analysis and the presence of neurologic deficits) were retrospectively enrolled. All patients had undergone head CT and MRI (mean time interval, 2 ± 2 days). After standardized unenhanced head CT scans were read, presets of the best-contrast algorithm were determined (center, 30 HU; delta, 5 HU; slope, 5 nondimensional), and resulting images were analyzed. Contrast enhancement was objectively measured by ROI analysis, comparing contrast-to-noise ratios (CNRs) of unenhanced CT and best-contrast CT. FLAIR and DWI MRI sequences were analyzed, and FLAIR was considered as the standard of reference. For assessment of disease extent, a previously reported 50-point score (HSE score) was used. CNR values for unenhanced head CT (CNR, 5.42 ± 2.77) could be statistically significantly increased using best-contrast CT (CNR, 9.62 ± 4.28) (p = 0.003). FLAIR sequences yielded a median HSE score of 9.0 (range, 6-17) and DWI sequences yielded HSE scores of 6.0 (range, 5-17). By comparison, unenhanced head CT resulted in a median HSE score of 3.5 (range, 1-6). The median best-contrast CT HSE score was 7.5 (range, 6-10). Agreement between FLAIR and unenhanced CT was 54.44%, that between DWI and best-contrast CT was 95.36%, and that between FLAIR and best-contrast CT was 85.21%. The most frequently overseen findings were located at the level of the upper part of the mesencephalon and at the subthalamic or insular level. Frequency-selective nonlinear blending significantly increases contrast and detects brain parenchymal involvement in HSE more sensitively compared with unenhanced CT. The sensitivity of best-contrast CT seems to be equal to that of DWI and almost as good as that of FLAIR.

  18. Migration of dispersive GPR data

    USGS Publications Warehouse

    Powers, M.H.; Oden, C.P.; ,

    2004-01-01

    Electrical conductivity and dielectric and magnetic relaxation phenomena cause electromagnetic propagation to be dispersive in earth materials. Both velocity and attenuation may vary with frequency, depending on the frequency content of the propagating energy and the nature of the relaxation phenomena. A minor amount of velocity dispersion is associated with high attenuation. For this reason, measuring effects of velocity dispersion in ground penetrating radar (GPR) data is difficult. With a dispersive forward model, GPR responses to propagation through materials with known frequency-dependent properties have been created. These responses are used as test data for migration algorithms that have been modified to handle specific aspects of dispersive media. When either Stolt or Gazdag migration methods are modified to correct for just velocity dispersion, the results are little changed from standard migration. For nondispersive propagating wavefield data, like deep seismic, ensuring correct phase summation in a migration algorithm is more important than correctly handling amplitude. However, the results of migrating model responses to dispersive media with modified algorithms indicate that, in this case, correcting for frequency-dependent amplitude loss has a much greater effect on the result than correcting for proper phase summation. A modified migration is only effective when it includes attenuation recovery, performing deconvolution and migration simultaneously.

  19. Evaluation of a metal artifact reduction algorithm applied to post-interventional flat detector CT in comparison to pre-treatment CT in patients with acute subarachnoid haemorrhage.

    PubMed

    Mennecke, Angelika; Svergun, Stanislav; Scholz, Bernhard; Royalty, Kevin; Dörfler, Arnd; Struffert, Tobias

    2017-01-01

    Metal artefacts can impair accurate diagnosis of haemorrhage using flat detector CT (FD-CT), especially after aneurysm coiling. Within this work we evaluate a prototype metal artefact reduction algorithm by comparison of the artefact-reduced and the non-artefact-reduced FD-CT images to pre-treatment FD-CT and multi-slice CT images. Twenty-five patients with acute aneurysmal subarachnoid haemorrhage (SAH) were selected retrospectively. FD-CT and multi-slice CT before endovascular treatment as well as FD-CT data sets after treatment were available for all patients. The algorithm was applied to post-treatment FD-CT. The effect of the algorithm was evaluated utilizing the pre-post concordance of a modified Fisher score, a subjective image quality assessment, the range of the Hounsfield units within three ROIs, and the pre-post slice-wise Pearson correlation. The pre-post concordance of the modified Fisher score, the subjective image quality, and the pre-post correlation of the ranges of the Hounsfield units were significantly higher for artefact-reduced than for non-artefact-reduced images. Within the metal-affected slices, the pre-post slice-wise Pearson correlation coefficient was higher for artefact-reduced than for non-artefact-reduced images. The overall diagnostic quality of the artefact-reduced images was improved and reached the level of the pre-interventional FD-CT images. The metal-unaffected parts of the image were not modified. • After coiling subarachnoid haemorrhage, metal artefacts seriously reduce FD-CT image quality. • This new metal artefact reduction algorithm is feasible for flat-detector CT. • After coiling, MAR is necessary for diagnostic quality of affected slices. • Slice-wise Pearson correlation is introduced to evaluate improvement of MAR in future studies. • Metal-unaffected parts of image are not modified by this MAR algorithm.

  20. Construction of nested maximin designs based on successive local enumeration and modified novel global harmony search algorithm

    NASA Astrophysics Data System (ADS)

    Yi, Jin; Li, Xinyu; Xiao, Mi; Xu, Junnan; Zhang, Lin

    2017-01-01

    Engineering design often involves different types of simulation, which results in expensive computational costs. Variable fidelity approximation-based design optimization approaches can realize effective simulation and efficiency optimization of the design space using approximation models with different levels of fidelity and have been widely used in different fields. As the foundations of variable fidelity approximation models, the selection of sample points of variable-fidelity approximation, called nested designs, is essential. In this article a novel nested maximin Latin hypercube design is constructed based on successive local enumeration and a modified novel global harmony search algorithm. In the proposed nested designs, successive local enumeration is employed to select sample points for a low-fidelity model, whereas the modified novel global harmony search algorithm is employed to select sample points for a high-fidelity model. A comparative study with multiple criteria and an engineering application are employed to verify the efficiency of the proposed nested designs approach.

  1. A two-stage path planning approach for multiple car-like robots based on PH curves and a modified harmony search algorithm

    NASA Astrophysics Data System (ADS)

    Zeng, Wenhui; Yi, Jin; Rao, Xiao; Zheng, Yun

    2017-11-01

    In this article, collision-avoidance path planning for multiple car-like robots with variable motion is formulated as a two-stage objective optimization problem minimizing both the total length of all paths and the task's completion time. Accordingly, a new approach based on Pythagorean Hodograph (PH) curves and Modified Harmony Search algorithm is proposed to solve the two-stage path-planning problem subject to kinematic constraints such as velocity, acceleration, and minimum turning radius. First, a method of path planning based on PH curves for a single robot is proposed. Second, a mathematical model of the two-stage path-planning problem for multiple car-like robots with variable motion subject to kinematic constraints is constructed that the first-stage minimizes the total length of all paths and the second-stage minimizes the task's completion time. Finally, a modified harmony search algorithm is applied to solve the two-stage optimization problem. A set of experiments demonstrate the effectiveness of the proposed approach.

  2. Optimizing doped libraries by using genetic algorithms

    NASA Astrophysics Data System (ADS)

    Tomandl, Dirk; Schober, Andreas; Schwienhorst, Andreas

    1997-01-01

    The insertion of random sequences into protein-encoding genes in combination with biologicalselection techniques has become a valuable tool in the design of molecules that have usefuland possibly novel properties. By employing highly effective screening protocols, a functionaland unique structure that had not been anticipated can be distinguished among a hugecollection of inactive molecules that together represent all possible amino acid combinations.This technique is severely limited by its restriction to a library of manageable size. Oneapproach for limiting the size of a mutant library relies on `doping schemes', where subsetsof amino acids are generated that reveal only certain combinations of amino acids in a proteinsequence. Three mononucleotide mixtures for each codon concerned must be designed, suchthat the resulting codons that are assembled during chemical gene synthesis represent thedesired amino acid mixture on the level of the translated protein. In this paper we present adoping algorithm that `reverse translates' a desired mixture of certain amino acids into threemixtures of mononucleotides. The algorithm is designed to optimally bias these mixturestowards the codons of choice. This approach combines a genetic algorithm with localoptimization strategies based on the downhill simplex method. Disparate relativerepresentations of all amino acids (and stop codons) within a target set can be generated.Optional weighing factors are employed to emphasize the frequencies of certain amino acidsand their codon usage, and to compensate for reaction rates of different mononucleotidebuilding blocks (synthons) during chemical DNA synthesis. The effect of statistical errors thataccompany an experimental realization of calculated nucleotide mixtures on the generatedmixtures of amino acids is simulated. These simulations show that the robustness of differentoptima with respect to small deviations from calculated values depends on their concomitantfitness. Furthermore, the calculations probe the fitness landscape locally and allow apreliminary assessment of its structure.

  3. Modified Mahalanobis Taguchi System for Imbalance Data Classification

    PubMed Central

    2017-01-01

    The Mahalanobis Taguchi System (MTS) is considered one of the most promising binary classification algorithms to handle imbalance data. Unfortunately, MTS lacks a method for determining an efficient threshold for the binary classification. In this paper, a nonlinear optimization model is formulated based on minimizing the distance between MTS Receiver Operating Characteristics (ROC) curve and the theoretical optimal point named Modified Mahalanobis Taguchi System (MMTS). To validate the MMTS classification efficacy, it has been benchmarked with Support Vector Machines (SVMs), Naive Bayes (NB), Probabilistic Mahalanobis Taguchi Systems (PTM), Synthetic Minority Oversampling Technique (SMOTE), Adaptive Conformal Transformation (ACT), Kernel Boundary Alignment (KBA), Hidden Naive Bayes (HNB), and other improved Naive Bayes algorithms. MMTS outperforms the benchmarked algorithms especially when the imbalance ratio is greater than 400. A real life case study on manufacturing sector is used to demonstrate the applicability of the proposed model and to compare its performance with Mahalanobis Genetic Algorithm (MGA). PMID:28811820

  4. Optimized scheme in coal-fired boiler combustion based on information entropy and modified K-prototypes algorithm

    NASA Astrophysics Data System (ADS)

    Gu, Hui; Zhu, Hongxia; Cui, Yanfeng; Si, Fengqi; Xue, Rui; Xi, Han; Zhang, Jiayu

    2018-06-01

    An integrated combustion optimization scheme is proposed for the combined considering the restriction in coal-fired boiler combustion efficiency and outlet NOx emissions. Continuous attribute discretization and reduction techniques are handled as optimization preparation by E-Cluster and C_RED methods, in which the segmentation numbers don't need to be provided in advance and can be continuously adapted with data characters. In order to obtain results of multi-objections with clustering method for mixed data, a modified K-prototypes algorithm is then proposed. This algorithm can be divided into two stages as K-prototypes algorithm for clustering number self-adaptation and clustering for multi-objective optimization, respectively. Field tests were carried out at a 660 MW coal-fired boiler to provide real data as a case study for controllable attribute discretization and reduction in boiler system and obtaining optimization parameters considering [ maxηb, minyNOx ] multi-objective rule.

  5. Remote sensing image stitch using modified structure deformation

    NASA Astrophysics Data System (ADS)

    Pan, Ke-cheng; Chen, Jin-wei; Chen, Yueting; Feng, Huajun

    2012-10-01

    To stitch remote sensing images seamlessly without producing visual artifact which is caused by severe intensity discrepancy and structure misalignment, we modify the original structure deformation based stitching algorithm which have two main problems: Firstly, using Poisson equation to propagate deformation vectors leads to the change of the topological relationship between the key points and their surrounding pixels, which may bring in wrong image characteristics. Secondly, the diffusion area of the sparse matrix is too limited to rectify the global intensity discrepancy. To solve the first problem, we adopt Spring-Mass model and bring in external force to keep the topological relationship between key points and their surrounding pixels. We also apply tensor voting algorithm to achieve the global intensity corresponding curve of the two images to solve the second problem. Both simulated and experimental results show that our algorithm is faster and can reach better result than the original algorithm.

  6. Modified reactive tabu search for the symmetric traveling salesman problems

    NASA Astrophysics Data System (ADS)

    Lim, Yai-Fung; Hong, Pei-Yee; Ramli, Razamin; Khalid, Ruzelan

    2013-09-01

    Reactive tabu search (RTS) is an improved method of tabu search (TS) and it dynamically adjusts tabu list size based on how the search is performed. RTS can avoid disadvantage of TS which is in the parameter tuning in tabu list size. In this paper, we proposed a modified RTS approach for solving symmetric traveling salesman problems (TSP). The tabu list size of the proposed algorithm depends on the number of iterations when the solutions do not override the aspiration level to achieve a good balance between diversification and intensification. The proposed algorithm was tested on seven chosen benchmarked problems of symmetric TSP. The performance of the proposed algorithm is compared with that of the TS by using empirical testing, benchmark solution and simple probabilistic analysis in order to validate the quality of solution. The computational results and comparisons show that the proposed algorithm provides a better quality solution than that of the TS.

  7. New Secure E-mail System Based on Bio-Chaos Key Generation and Modified AES Algorithm

    NASA Astrophysics Data System (ADS)

    Hoomod, Haider K.; Radi, A. M.

    2018-05-01

    The E-mail messages exchanged between sender’s Mailbox and recipient’s Mailbox over the open systems and insecure Networks. These messages may be vulnerable to eavesdropping and itself poses a real threat to the privacy and data integrity from unauthorized persons. The E-mail Security includes the following properties (Confidentiality, Authentication, Message integrity). We need a safe encryption algorithm to encrypt Email messages such as the algorithm Advanced Encryption Standard (AES) or Data Encryption Standard DES, as well as biometric recognition and chaotic system. The proposed E-mail system security uses modified AES algorithm and uses secret key-bio-chaos that consist of biometric (Fingerprint) and chaotic system (Lu and Lorenz). This modification makes the proposed system more sensitive and random. The execution time for both encryption and decryption of the proposed system is much less from original AES, in addition to being compatible with all Mail Servers.

  8. Computing Maximum Likelihood Estimates of Loglinear Models from Marginal Sums with Special Attention to Loglinear Item Response Theory.

    ERIC Educational Resources Information Center

    Kelderman, Henk

    1992-01-01

    Describes algorithms used in the computer program LOGIMO for obtaining maximum likelihood estimates of the parameters in loglinear models. These algorithms are also useful for the analysis of loglinear item-response theory models. Presents modified versions of the iterative proportional fitting and Newton-Raphson algorithms. Simulated data…

  9. Algorithm Animations for Teaching and Learning the Main Ideas of Basic Sortings

    ERIC Educational Resources Information Center

    Végh, Ladislav; Stoffová, Veronika

    2017-01-01

    Algorithms are hard to understand for novice computer science students because they dynamically modify values of elements of abstract data structures. Animations can help to understand algorithms, since they connect abstract concepts to real life objects and situations. In the past 30-35 years, there have been conducted many experiments in the…

  10. Optimal feature selection using a modified differential evolution algorithm and its effectiveness for prediction of heart disease.

    PubMed

    Vivekanandan, T; Sriman Narayana Iyengar, N Ch

    2017-11-01

    Enormous data growth in multiple domains has posed a great challenge for data processing and analysis techniques. In particular, the traditional record maintenance strategy has been replaced in the healthcare system. It is vital to develop a model that is able to handle the huge amount of e-healthcare data efficiently. In this paper, the challenging tasks of selecting critical features from the enormous set of available features and diagnosing heart disease are carried out. Feature selection is one of the most widely used pre-processing steps in classification problems. A modified differential evolution (DE) algorithm is used to perform feature selection for cardiovascular disease and optimization of selected features. Of the 10 available strategies for the traditional DE algorithm, the seventh strategy, which is represented by DE/rand/2/exp, is considered for comparative study. The performance analysis of the developed modified DE strategy is given in this paper. With the selected critical features, prediction of heart disease is carried out using fuzzy AHP and a feed-forward neural network. Various performance measures of integrating the modified differential evolution algorithm with fuzzy AHP and a feed-forward neural network in the prediction of heart disease are evaluated in this paper. The accuracy of the proposed hybrid model is 83%, which is higher than that of some other existing models. In addition, the prediction time of the proposed hybrid model is also evaluated and has shown promising results. Copyright © 2017 Elsevier Ltd. All rights reserved.

  11. Evolution of recombination rates in a multi-locus, haploid-selection, symmetric-viability model.

    PubMed

    Chasnov, J R; Ye, Felix Xiaofeng

    2013-02-01

    A fast algorithm for computing multi-locus recombination is extended to include a recombination-modifier locus. This algorithm and a linear stability analysis is used to investigate the evolution of recombination rates in a multi-locus, haploid-selection, symmetric-viability model for which stable equilibria have recently been determined. When the starting equilibrium is symmetric with two selected loci, we show analytically that modifier alleles that reduce recombination always invade. When the starting equilibrium is monomorphic, and there is a fixed nonzero recombination rate between the modifier locus and the selected loci, we determine analytical conditions for which a modifier allele can invade. In particular, we show that a gap exists between the recombination rates of modifiers that can invade and the recombination rate that specifies the lower stability boundary of the monomorphic equilibrium. A numerical investigation shows that a similar gap exists in a weakened form when the starting equilibrium is fully polymorphic but asymmetric. Copyright © 2012 Elsevier Inc. All rights reserved.

  12. Anisakis haemoglobin is a main antigen inducing strong and prolonged immunoreactions in rats.

    PubMed

    Abe, Niichiro; Teramoto, Isao

    2017-07-01

    Anisakis simplex larvae are well known to cause gastrointestinal and allergic manifestations after ingestion of parasitized raw or undercooked seafood. The antibody recognition dynamics against the components of Anisakis larval antigen after primary and re-infection with Anisakis live larvae remain unclear. For this study, immunoblot analyses of serum IgG, IgE, and IgM against Anisakis larval somatic extract were performed in rats that had been orally inoculated with A. simplex live larvae. Multiple antigen fractions were recognized after primary infection. Their reaction was enhanced after re-infection. Antibody recognition was observed for 12 weeks after re-infection. The fraction of approximately 35 kDa contained a main antigen that induced strong and prolonged immunoreactions in IgG and IgE. The antibody reaction to this fraction appeared to be enhanced after inoculation of larval homogenates. This fraction was heat tolerant with boiling for 30 min. The fraction was spotted by immunoblotting after two-dimensional electrophoresis and was identified as Anisakis haemoglobin (Ani s 13) using mass spectrometry analysis. The amino acid sequences of haemoglobin mRNAs from two A. simplex sensu stricto and one Anisakis pegreffii were identified by RACE-PCR. They differed from those of two isolates of Pseudoterranova decipiens and A. pegreffii. Results of this study show that Anisakis haemoglobin, which is known to be a major allergen of A. simplex, induces strong and prolonged immunoreaction in rats. This report is the first to show the amino acid sequence variation of Anisakis haemoglobin mRNA between A. simplex sensu stricto and A. pegreffii.

  13. HIV-associated hypertrophic herpes simplex genitalis with concomitant early invasive squamous cell carcinoma mimicking advanced genital cancer: case report and literature review.

    PubMed

    Strehl, Johanna D; Mehlhorn, Grit; Koch, Martin C; Harrer, Ellen G; Harrer, Thomas; Beckmann, Matthias W; Agaimy, Abbas

    2012-05-01

    Hypertrophic herpes simplex genitalis (HHSG) is an uncommon anogenital manifestation of herpes simplex virus (HSV) infection in immunocompromised patients. To date, 24 cases of HHSG have been reported; 23 of them were affected human immune deficiency virus (HIV) type 1-positive patients. We describe the case of a 44-year-old African HIV-1-positive woman who presented with painful ulcerated nodular lesions of the vulva and perianal area measuring up to 7 cm in diameter. Macroscopically, the lesions were highly suspicious of widely invasive cancer. The histologic workup of the resection specimen revealed patchy high-grade vulvar intraepithelial neoplasia Grade 3 (VIN 3) and 2 microscopic foci of superficially invasive squamous cell carcinoma. The nodular lesions were caused by massive tumefactive plasma cell-rich inflammatory infiltrates extending into the subcutis. Multinucleated herpes simplex virus 1 and herpes simplex virus 2-positive epithelial cells with glassy intranuclear inclusions were detected at the borders of the ulcerations, consistent with HHSG. Despite repeated surgery and medical treatment, the patient had 3 recurrences of HHSG within 18 months. The presence of intraepithelial neoplasia in HHSG lesions is relatively rare and has been described in 6 of 18 resected HHSG lesions in the literature so far. With regard to invasive malignancy, the present case is the first report of a superficially invasive squamous cell carcinoma associated with HHSG. Awareness of this condition is necessary to avoid misinterpretation of HHSG as widely invasive squamous cell carcinoma with the hazard of surgical and oncological overtreatment.

  14. Optimization of wastewater treatment plant operation for greenhouse gas mitigation.

    PubMed

    Kim, Dongwook; Bowen, James D; Ozelkan, Ertunga C

    2015-11-01

    This study deals with the determination of optimal operation of a wastewater treatment system for minimizing greenhouse gas emissions, operating costs, and pollution loads in the effluent. To do this, an integrated performance index that includes three objectives was established to assess system performance. The ASMN_G model was used to perform system optimization aimed at determining a set of operational parameters that can satisfy three different objectives. The complex nonlinear optimization problem was simulated using the Nelder-Mead Simplex optimization algorithm. A sensitivity analysis was performed to identify influential operational parameters on system performance. The results obtained from the optimization simulations for six scenarios demonstrated that there are apparent trade-offs among the three conflicting objectives. The best optimized system simultaneously reduced greenhouse gas emissions by 31%, reduced operating cost by 11%, and improved effluent quality by 2% compared to the base case operation. Copyright © 2015 Elsevier Ltd. All rights reserved.

  15. Optimization, Monotonicity and the Determination of Nash Equilibria — An Algorithmic Analysis

    NASA Astrophysics Data System (ADS)

    Lozovanu, D.; Pickl, S. W.; Weber, G.-W.

    2004-08-01

    This paper is concerned with the optimization of a nonlinear time-discrete model exploiting the special structure of the underlying cost game and the property of inverse matrices. The costs are interlinked by a system of linear inequalities. It is shown that, if the players cooperate, i.e., minimize the sum of all the costs, they achieve a Nash equilibrium. In order to determine Nash equilibria, the simplex method can be applied with respect to the dual problem. An introduction into the TEM model and its relationship to an economic Joint Implementation program is given. The equivalence problem is presented. The construction of the emission cost game and the allocation problem is explained. The assumption of inverse monotony for the matrices leads to a new result in the area of such allocation problems. A generalization of such problems is presented.

  16. Combinatorial construction of tilings by barycentric simplex orbits (D symbols) and their realizations in Euclidean and other homogeneous spaces.

    PubMed

    Molnár, Emil

    2005-11-01

    A new method, developed in previous works by the author (partly with co-authors), is presented which decides algorithmically, in principle by computer, whether a combinatorial space tiling (Tau, Gamma) is realizable in the d-dimensional Euclidean space E(d) (think of d = 2, 3, 4) or in other homogeneous spaces, e.g. in Thurston's 3-geometries: E(3), S(3), H(3), S(2) x R, H(2) x R, SL(2)R, Nil, Sol. Then our group Gamma will be an isometry group of a projective metric 3-sphere PiS(3) (R, < , >), acting discontinuously on its above tiling Tau. The method is illustrated by a plane example and by the well known rhombohedron tiling (Tau, Gamma), where Gamma = R3m is the Euclidean space group No. 166 in International Tables for Crystallography.

  17. Determining Spacecraft Reaction Wheel Friction Parameters

    NASA Technical Reports Server (NTRS)

    Sarani, Siamak

    2009-01-01

    Software was developed to characterize the drag in each of the Cassini spacecraft's Reaction Wheel Assemblies (RWAs) to determine the RWA friction parameters. This tool measures the drag torque of RWAs for not only the high spin rates (greater than 250 RPM), but also the low spin rates (less than 250 RPM) where there is a lack of an elastohydrodynamic boundary layer in the bearings. RWA rate and drag torque profiles as functions of time are collected via telemetry once every 4 seconds and once every 8 seconds, respectively. Intermediate processing steps single-out the coast-down regions. A nonlinear model for the drag torque as a function of RWA spin rate is incorporated in order to characterize the low spin rate regime. The tool then uses a nonlinear parameter optimization algorithm based on the Nelder-Mead simplex method to determine the viscous coefficient, the Dahl friction, and the two parameters that account for the low spin-rate behavior.

  18. A multiphase equation of state of three solid phases, liquid, and gas for titanium

    NASA Astrophysics Data System (ADS)

    Pecker, S.; Eliezer, S.; Fisher, D.; Henis, Z.; Zinamon, Z.

    2005-08-01

    A multiple-phase equation of state of the α phase, β phase, ω phase, liquid, and gas for titanium is presented. This equation of state is thermodynamically consistent, based on a three-term semiempirical model for the Helmholtz free energy. The parameters of the free energy are first evaluated from the experimental data and solid-state theoretical calculations. Then, the values of the parameters are adjusted using a numerical minimization scheme based on the simplex algorithm, to values that best reproduce measured phase diagrams and other experimental data. The predicted phase diagram shows a compression-induced β-ω transition, up to a β-ω-liquid triple point at ˜45GPa and ˜2200K. For pressures above this triple point, the melting occurs from the ω phase. Moreover, no β-ω transition is predicted along the Hugoniot curve starting at STP conditions.

  19. ISCFD Nagoya 1989 - International Symposium on Computational Fluid Dynamics, 3rd, Nagoya, Japan, Aug. 28-31, 1989, Technical Papers

    NASA Astrophysics Data System (ADS)

    Recent advances in computational fluid dynamics are discussed in reviews and reports. Topics addressed include large-scale LESs for turbulent pipe and channel flows, numerical solutions of the Euler and Navier-Stokes equations on parallel computers, multigrid methods for steady high-Reynolds-number flow past sudden expansions, finite-volume methods on unstructured grids, supersonic wake flow on a blunt body, a grid-characteristic method for multidimensional gas dynamics, and CIC numerical simulation of a wave boundary layer. Consideration is given to vortex simulations of confined two-dimensional jets, supersonic viscous shear layers, spectral methods for compressible flows, shock-wave refraction at air/water interfaces, oscillatory flow in a two-dimensional collapsible channel, the growth of randomness in a spatially developing wake, and an efficient simplex algorithm for the finite-difference and dynamic linear-programming method in optimal potential control.

  20. Single-Step Conversion of Cells to Retrovirus Vector Producers with Herpes Simplex Virus–Epstein-Barr Virus Hybrid Amplicons

    PubMed Central

    Sena-Esteves, Miguel; Saeki, Yoshinaga; Camp, Sara M.; Chiocca, E. Antonio; Breakefield, Xandra O.

    1999-01-01

    We report here on the development and characterization of a novel herpes simplex virus type 1 (HSV-1) amplicon-based vector system which takes advantage of the host range and retention properties of HSV–Epstein-Barr virus (EBV) hybrid amplicons to efficiently convert cells to retrovirus vector producer cells after single-step transduction. The retrovirus genes gag-pol and env (GPE) and retroviral vector sequences were modified to minimize sequence overlap and cloned into an HSV-EBV hybrid amplicon. Retrovirus expression cassettes were used to generate the HSV-EBV-retrovirus hybrid vectors, HERE and HERA, which code for the ecotropic and the amphotropic envelopes, respectively. Retrovirus vector sequences encoding lacZ were cloned downstream from the GPE expression unit. Transfection of 293T/17 cells with amplicon plasmids yielded retrovirus titers between 106 and 107 transducing units/ml, while infection of the same cells with amplicon vectors generated maximum titers 1 order of magnitude lower. Retrovirus titers were dependent on the extent of transduction by amplicon vectors for the same cell line, but different cell lines displayed varying capacities to produce retrovirus vectors even at the same transduction efficiencies. Infection of human and dog primary gliomas with this system resulted in the production of retrovirus vectors for more than 1 week and the long-term retention and increase in transgene activity over time in these cell populations. Although the efficiency of this system still has to be determined in vivo, many applications are foreseeable for this approach to gene delivery. PMID:10559361

  1. Recombinant glycoprotein G analog for determination of specific immunoglobulins to herpes simplex virus type 2 by ELISA.

    PubMed

    Korshun, Ludmila; Vudmaska, Mariya; Moysa, Larissa; Kovtonjuk, Galina; Mikhalap, Svetlana; Ganova, Larissa; Spivak, Nikolay

    2013-12-01

    In order to the detection of type-specific IgG to herpes simplex virus type 2 (HSV-2) in human serum or plasma the recombinant analog of HSV-2 glycoprotein G (gG2) was created. To construct an expression vector the DNA fragment with a sequence identical to immunodominant regions of HSV-2 gG2 was cloned into modified vector pET28a containing of the glutation-S-transferase sequence (pET28-GST). Escherichia coli BL21 (DE3) were transformed with the recombinant plasmid. The target protein was expressed mainly in soluble form. Chromatographic purification of soluble GST-gG2 protein was performed taking into account the features of its primary structure that are 6His-tag and GST-tag. To determine the affinity constant of the specific IgG to GST-gG2 we used the method proposed by Friguet et al. (1985). The affinity constants were within the range of 10(7)-10(8)M(-1) proving their high-affinity. The purified recombinant HSV-2 antigen was used to design a diagnostic ELISA kit, which was evaluated with referent controls and standard panels of sera containing and/or not containing anti-HSV-2 IgG. Comparative evaluation of this kit and the commercially available "HSV-Type 2 IgG-ELISA" (NovaTec, Dietzenbach, Germany) kit was performed. There was no significant difference (P>0.05). It allows to use developed ELISA kit for clinical diagnosis of HSV-2 infection. Copyright © 2013 Elsevier B.V. All rights reserved.

  2. Limited distortion in LSB steganography

    NASA Astrophysics Data System (ADS)

    Kim, Younhee; Duric, Zoran; Richards, Dana

    2006-02-01

    It is well known that all information hiding methods that modify the least significant bits introduce distortions into the cover objects. Those distortions have been utilized by steganalysis algorithms to detect that the objects had been modified. It has been proposed that only coefficients whose modification does not introduce large distortions should be used for embedding. In this paper we propose an effcient algorithm for information hiding in the LSBs of JPEG coefficients. Our algorithm uses parity coding to choose the coefficients whose modifications introduce minimal additional distortion. We derive the expected value of the additional distortion as a function of the message length and the probability distribution of the JPEG quantization errors of cover images. Our experiments show close agreement between the theoretical prediction and the actual additional distortion.

  3. Partial fingerprint identification algorithm based on the modified generalized Hough transform on mobile device

    NASA Astrophysics Data System (ADS)

    Qin, Jin; Tang, Siqi; Han, Congying; Guo, Tiande

    2018-04-01

    Partial fingerprint identification technology which is mainly used in device with small sensor area like cellphone, U disk and computer, has taken more attention in recent years with its unique advantages. However, owing to the lack of sufficient minutiae points, the conventional method do not perform well in the above situation. We propose a new fingerprint matching technique which utilizes ridges as features to deal with partial fingerprint images and combines the modified generalized Hough transform and scoring strategy based on machine learning. The algorithm can effectively meet the real-time and space-saving requirements of the resource constrained devices. Experiments on in-house database indicate that the proposed algorithm have an excellent performance.

  4. Failure and Redemption of Multifilter Rotating Shadowband Radiometer (MFRSR)/Normal Incidence Multifilter Radiometer (NIMFR) Cloud Screening: Contrasting Algorithm Performance at Atmospheric Radiation Measurement (ARM) North Slope of Alaska (NSA) and Southern Great Plains (SGP) Sites

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Kassianov, Evgueni I.; Flynn, Connor J.; Koontz, Annette S.

    2013-09-11

    Well-known cloud-screening algorithms, which are designed to remove cloud-contaminated aerosol optical depths (AOD) from AOD measurements, have shown great performance at many middle-to-low latitude sites around the world. However, they may occasionally fail under challenging observational conditions, such as when the sun is low (near the horizon) or when optically thin clouds with small spatial inhomogeneity occur. Such conditions have been observed quite frequently at the high-latitude Atmospheric Radiation Measurement (ARM) North Slope of Alaska (NSA) sites. A slightly modified cloud-screening version of the standard algorithm is proposed here with a focus on the ARM-supported Multifilter Rotating Shadowband Radiometer (MFRSR)more » and Normal Incidence Multifilter Radiometer (NIMFR) data. The modified version uses approximately the same techniques as the standard algorithm, but it additionally examines the magnitude of the slant-path line of sight transmittance and eliminates points when the observed magnitude is below a specified threshold. Substantial improvement of the multi-year (1999-2012) aerosol product (AOD and its Angstrom exponent) is shown for the NSA sites when the modified version is applied. Moreover, this version reproduces the AOD product at the ARM Southern Great Plains (SGP) site, which was originally generated by the standard cloud-screening algorithms. The proposed minor modification is easy to implement and its application to existing and future cloud-screening algorithms can be particularly beneficial for challenging observational conditions.« less

  5. Simulated aerial sprays for field cage evaluation of Beauveria bassiana and Metarhizium brunneum (Ascomycetes: Hypocreales) against Anabrus simplex (Orthoptera: Tettigoniidae) in Montana

    USDA-ARS?s Scientific Manuscript database

    Field efficacy of the entomopathogenic Ascomycete Beauveria bassiana strain GHA and Metarhizium brunneum strain F52 was evaluated against nymphs of the Mormon cricket, Anabrus simplex. Fungi were applied with a new apparatus that allows simulated aerial sprays to 0.1m2 areas in the field. The Mormon...

  6. Contributions of herpes simplex virus type 1 envelope proteins to entry by endocytosis

    USDA-ARS?s Scientific Manuscript database

    Herpes simplex virus (HSV) proteins specifically required for endocytic entry but not direct penetration have not been identified. HSVs deleted of gE, gG, gI, gJ, gM, UL45, or Us9 entered cells via either pH-dependent or pH-independent endocytosis and were inactivated by mildly acidic pH. Thus, the ...

  7. Aerophagia and belching after herpes simplex encephalitis.

    PubMed

    Scheid, Rainer; Teich, Niels; Schroeter, Matthias L

    2008-03-01

    The etiology of abnormal belching is not known. Currently, it is being subsumed under "functional gastroduodenal disorders." Here, we report the unusual case history of a patient who developed aerophagia and consecutive excessive belching in association with herpes simplex encephalitis. The case report adds to the limited information about potential organic geneses of belching. Implications for possible medical therapies are discussed.

  8. Atypical presentations of genital herpes simplex virus in HIV-1 and HIV-2 effectively treated by imiquimod.

    PubMed

    McKendry, Anna; Narayana, Srinivasulu; Browne, Rita

    2015-05-01

    Atypical presentations of genital herpes simplex virus have been described in HIV. We report two cases with hypertrophic presentations which were effectively treated with imiquimod, one of which is the first reported case occurring in a patient with HIV-2. © The Author(s) 2014 Reprints and permissions: sagepub.co.uk/journalsPermissions.nav.

  9. Stage Structure of Moral Development: A Comparison of Alternative Models.

    ERIC Educational Resources Information Center

    Hau, Kit-Tai

    This study evaluated the stage structure of several quasi-simplex and non-simplex models of moral development in two domains of moral development in a British and a Chinese sample. Analyses were based on data reported by Sachs (1992): the Chinese sample consisted of 1,005 students from grade 9 to post-college, and the British sample consisted of…

  10. Comparison of Full and Partial Admission Flow Fields in the Simplex Turbine

    NASA Technical Reports Server (NTRS)

    Dorney, Daniel J.; Griffin, Lisa W.; Sondak, Douglas L.

    2002-01-01

    This viewgraph presentation provides information on computerized simulations of flow fields in a Simplex turbine. The motivations for the simulation were: Determining the effects of partial admission flow on rotor performance as a function of circumferential location and on unsteady rotor loading; Providing an efficient technique for determining turbine performance. The simulation used the flow code CORSAIR.

  11. Evasion of Early Antiviral Responses by Herpes Simplex Viruses

    PubMed Central

    Suazo, Paula A.; Ibañez, Francisco J.; Retamal-Díaz, Angello R.; Paz-Fiblas, Marysol V.; Bueno, Susan M.; Kalergis, Alexis M.; González, Pablo A.

    2015-01-01

    Besides overcoming physical constraints, such as extreme temperatures, reduced humidity, elevated pressure, and natural predators, human pathogens further need to overcome an arsenal of antimicrobial components evolved by the host to limit infection, replication and optimally, reinfection. Herpes simplex virus-1 (HSV-1) and herpes simplex virus-2 (HSV-2) infect humans at a high frequency and persist within the host for life by establishing latency in neurons. To gain access to these cells, herpes simplex viruses (HSVs) must replicate and block immediate host antiviral responses elicited by epithelial cells and innate immune components early after infection. During these processes, infected and noninfected neighboring cells, as well as tissue-resident and patrolling immune cells, will sense viral components and cell-associated danger signals and secrete soluble mediators. While type-I interferons aim at limiting virus spread, cytokines and chemokines will modulate resident and incoming immune cells. In this paper, we discuss recent findings relative to the early steps taking place during HSV infection and replication. Further, we discuss how HSVs evade detection by host cells and the molecular mechanisms evolved by these viruses to circumvent early antiviral mechanisms, ultimately leading to neuron infection and the establishment of latency. PMID:25918478

  12. Analysis of Cortical Shape in Children with Simplex Autism

    PubMed Central

    Dierker, Donna L.; Feczko, Eric; Pruett, John R.; Petersen, Steven E.; Schlaggar, Bradley L.; Constantino, John N.; Harwell, John W.; Coalson, Timothy S.; Van Essen, David C.

    2015-01-01

    We used surface-based morphometry to test for differences in cortical shape between children with simplex autism (n = 34, mean age 11.4 years) and typical children (n = 32, mean age 11.3 years). This entailed testing for group differences in sulcal depth and in 3D coordinates after registering cortical midthickness surfaces to an atlas target using 2 independent registration methods. We identified bilateral differences in sulcal depth in restricted portions of the anterior-insula and frontal-operculum (aI/fO) and in the temporoparietal junction (TPJ). The aI/fO depth differences are associated with and likely to be caused by a shape difference in the inferior frontal gyrus in children with simplex autism. Comparisons of average midthickness surfaces of children with simplex autism and those of typical children suggest that the significant sulcal depth differences represent local peaks in a larger pattern of regional differences that are below statistical significance when using coordinate-based analysis methods. Cortical regions that are statistically significant before correction for multiple measures are peaks of more extended, albeit subtle regional differences that may guide hypothesis generation for studies using other imaging modalities. PMID:24165833

  13. Identification of a herpes simplex labialis susceptibility region on human chromosome 21.

    PubMed

    Hobbs, Maurine R; Jones, Brandt B; Otterud, Brith E; Leppert, Mark; Kriesel, John D

    2008-02-01

    Most of the United States population is infected with either herpes simplex virus type 1 (HSV-1), herpes simplex virus type 2, or both. Reactivations of HSV-1 infection cause herpes simplex labialis (HSL; cold sores or fever blisters), which is the most common recurring viral infection in humans. To investigate the possibility of a human genetic component conferring resistance or susceptibility to cold sores (i.e., a HSL susceptibility gene), we conducted a genetic linkage analysis that included serotyping and phenotyping 421 individuals from 39 families enrolled in the Utah Genetic Reference Project. Linkage analysis identified a 2.5-Mb nonrecombinant region of interest on the long arm of human chromosome 21, with a multipoint logarithm of odds score of 3.9 noted near marker abmc65 (D21S409). Nonparametric linkage analysis of the data also provided strong evidence for linkage (P = .0005). This region of human chromosome 21 contains 6 candidate genes for herpes susceptibility. The development of frequent cold sores is associated with a region on the long arm of human chromosome 21. This region contains several candidate genes that could influence the frequency of outbreaks of HSL.

  14. In vivo production of cytokines and beta (C-C) chemokines in human recurrent herpes simplex lesions--do herpes simplex virus-infected keratinocytes contribute to their production?

    PubMed

    Mikloska, Z; Danis, V A; Adams, S; Lloyd, A R; Adrian, D L; Cunningham, A L

    1998-04-01

    Recurrent human herpes simplex lesions are infiltrated by macrophages and CD4 and CD8 lymphocytes, which secrete cytokines and chemokines. Vesicle fluid was examined by ELISA for the presence of cytokines and beta (C-C) chemokines. On the first day of the lesion, high concentrations of interleukin (IL)-1beta, and IL-6, moderate concentrations of IL-1alpha and IL-10, and low concentrations of IL-12 and beta chemokines were found; levels of macrophage inflammatory protein (MIP)-1beta were significantly higher than levels of MIP-1alpha and RANTES. At day 3, the concentrations of IL-1beta, IL-6, and MIP-1beta were lower, whereas the levels of IL-10, IL-12, and MIP-1alpha remained similar, and the level of tumor necrosis factor-alpha was now detectable. Herpes simplex virus infection of keratinocytes in vitro stimulated production of beta chemokines followed by IL-12 and then IL-10, IL-1alpha, IL-1beta, and IL-6, indicating a potential role for these events in early recruitment, activation, and interferon-gamma production of CD4 cells in herpetic lesions.

  15. Feasibility and validity of using WHO adolescent job aid algorithms by health workers for reproductive morbidities among adolescent girls in rural North India.

    PubMed

    Archana, Siddaiah; Nongkrynh, B; Anand, K; Pandav, C S

    2015-09-21

    High prevalence of reproductive morbidities is seen among adolescents in India. Health workers play an important role in providing health services in the community, including the adolescent reproductive health services. A study was done to assess the feasibility of training female health workers (FHWs) in the classification and management of selected adolescent girls' reproductive health problems according to modified WHO algorithms. The study was conducted between Jan-Sept 2011 in Northern India. Thirteen FHWs were trained regarding adolescent girls' reproductive health as per WHO Adolescent Job-Aid booklet. A pre and post-test assessment of the knowledge of the FHWs was carried out. All FHWs were given five modified WHO algorithms to classify and manage common reproductive morbidities among adolescent girls. All the FHWs applied the algorithms on at least ten adolescent girls at their respective sub-centres. Simultaneously, a medical doctor independently applied the same algorithms in all girls. Classification of the condition was followed by relevant management and advice provided in the algorithm. Focus group discussion with the FHWs was carried out to receive their feedback. After training the median score of the FHWs increased from 19.2 to 25.2 (p - 0.0071). Out of 144 girls examined by the FHWs 108 were classified as true positives and 30 as true negatives and agreement as measured by kappa was 0.7 (0.5-0.9). Sensitivity, specificity, positive predictive value (PPV) and negative predictive value (NPV) were 94.3% (88.2-97.4), 78.9% (63.6-88.9), 92.5% (86.0-96.2), and 83.3% (68.1-92.1) respectively. A consistent and significant difference between pre and post training knowledge scores of the FHWs were observed and hence it was possible to use the modified Job Aid algorithms with ease. Limitation of this study was the munber of FHWs trained was small. Issues such as time management during routine work, timing of training, overhead cost of training etc were not taken into account. Training was successful in increasing the knowledge of the FHWs about adolescent girls' reproductive health issues. The FHWs were able to satisfactorily classify the common adolescent girls' problems using the modified WHO algorithms.

  16. A miniature and field-applicable multipumping flow analyzer for ammonium monitoring in seawater with fluorescence detection.

    PubMed

    Horstkotte, Burkhard; Duarte, Carlos M; Cerdà, Víctor

    2011-07-15

    In this article, a simple, economic, and miniature flow analyzer for ammonium in seawater based on the solenoid micropumps is presented. A single reagent of sodium tetraborate, ortho-phthaldialdehyde (OPA), and sodium sulfite was used and optimized applying the modified SIMPLEX method. A special-made detection cell for fluorescence detection of the reaction product isoindol-1-sulfonat was made and combined with a commercial photomultiplier tube, a long-pass optical filter, and an UV-LED as excitation light source. A LOD down to 13 nmol/L was achieved. The fabrication and application of a miniature reaction coil heating device for reaction rate enhancement is further described. The system featured an injection frequency of 32 h(-1) at average standard deviation of 3%. Copyright © 2011 Elsevier B.V. All rights reserved.

  17. Indirect micro-immunofluorescence test for detecting type-specific antibodies to herpes simplex virus.

    PubMed

    Forsey, T; Darougar, S

    1980-02-01

    A rapid indirect micro-immunofluorescence test capable of detecting and differentiating type-specific antibodies to herpes simplex virus is described. The test proved highly sensitive and, in 80 patients with active herpes ocular infection, antibody was detected in 94%. No anti-herpes antibody was detected in a control group of 20 patients with adenovirus infections. Testing of animal sera prepared against herpes simplex virus types 1 and 2 and of human sera from cases of ocular and genital herpes infections showed that the test can differentiate antibodies to the infecting serotypes. Specimens of whole blood, taken by fingerprick, and eye secretions, both collected on cellulose sponges, could be tested by indirect micro-immunofluorescence. Anti-herpes IgG, IgM, and IgA can also be detected.

  18. Effect of Acycloguanosine Treatment on Acute and Latent Herpes Simplex Infections in Mice

    PubMed Central

    Field, Hugh J.; Bell, Susanne E.; Elion, Gertrude B.; Nash, Anthony A.; Wildy, Peter

    1979-01-01

    Systemic treatment of mice with the nucleoside analog 9-(2-hydroxyethoxymethyl)guanine (acycloguanosine [aciclovir]) was found to be highly effective against acute type 1 herpes simplex virus infection of the pinna. The drug ablated clinical signs and reduced virus replication both in tissue local to the inoculation site and within the nervous system. Provided that moderate-sized virus inocula were used, acycloguanosine treatment reduced or prevented the establishment of a latent infection in the dorsal root ganglia relating to the sensory nerve supply of the ear. However, although it aborted artificially produced infections in dorsal root ganglia, acycloguanosine was found not to be effective against the latent infection once established. This finding strongly indicated that latent herpes simplex virus in mice can exist in a nonreplicating form. PMID:464587

  19. Effect of acycloguanosine treatment of acute and latent herpes simplex infections in mice.

    PubMed

    Field, H J; Bell, S E; Elion, G B; Nash, A A; Wildy, P

    1979-04-01

    Systemic treatment of mice with the nucleoside analog 9-(2-hydroxyethoxymethyl)guanine (acycloguanosine [aciclovir]) was found to be highly effective against acute type 1 herpes simplex virus infection of the pinna. The drug ablated clinical signs and reduced virus replication both in tissue local to the inoculation site and within the nervous system. Provided that moderate-sized virus inocula were used, acycloguanosine treatment reduced or prevented the establishment of a latent infection in the dorsal root ganglia relating to the sensory nerve supply of the ear. However, although it aborted artificially produced infections in dorsal root ganglia, acycloguanosine was found not to be effective against the latent infection once established. This finding strongly indicated that latent herpes simplex virus in mice can exist in a nonreplicating form.

  20. Recurrent herpes simplex virus type 2 meningitis in elderly persons.

    PubMed

    Davis, Larry E; Guerre, Jenny; Gerstein, Wendy H

    2010-06-01

    To review the ages of patients with recurrent herpes simplex virus type 2 (HSV-2) meningitis. Case report and literature review back to 1970. Referral Veterans Affairs hospital. Our patient developed his first episode of recurrent HSV-2 meningitis at 78 years of age, 57 years after his only episode of genital herpes simplex infection. Of 223 patients in the literature with recurrent HSV-2 meningitis, 5% occurred in patients older than 60 years and 19% in patients older than 50 years. Although recurrent meningitis due to HSV is primarily seen in young, sexually active adults, a surprising number of episodes of HSV meningitis can develop in older age. Meningitis due to HSV-2 should be in the differential diagnosis of aseptic meningitis in older patients.

  1. Cycloartenol triterpenoid saponins from Cimicifuga simplex (Ranunculaceae) and their biological effects.

    PubMed

    Wu, Lun; Chen, Zhi-Li; Su, Yang; Wang, Qiu-Hong; Kuang, Hai-Xue

    2015-02-01

    The constituents of Cimicifuga plants have been extensively investigated, and the principal metabolites are 9,19-cyclolanostane triterpenoid glycosides, which are distributed widely in Cimicifuga plants, but not in other members of the Ranunculaceae family, and are considered to be characteristics of the Cimicifuga genus. This type of triterpenoid glycoside possesses several important biological activities. More than 120 cycloartane triterpene glycosides have been isolated from Cimicifuga simplex Wormsk. The aim of this review article is to summarize all the major findings based on the available scientific literatures on C. simplex, with a focus on the identified 9,19-cyclolanostane triterpenoid glycosides. Biological studies of cycloartane triterpene glycosides from Cimicifuga spp. are also discussed. Copyright © 2015 China Pharmaceutical University. Published by Elsevier B.V. All rights reserved.

  2. Advancements to the planogram frequency–distance rebinning algorithm

    PubMed Central

    Champley, Kyle M; Raylman, Raymond R; Kinahan, Paul E

    2010-01-01

    In this paper we consider the task of image reconstruction in positron emission tomography (PET) with the planogram frequency–distance rebinning (PFDR) algorithm. The PFDR algorithm is a rebinning algorithm for PET systems with panel detectors. The algorithm is derived in the planogram coordinate system which is a native data format for PET systems with panel detectors. A rebinning algorithm averages over the redundant four-dimensional set of PET data to produce a three-dimensional set of data. Images can be reconstructed from this rebinned three-dimensional set of data. This process enables one to reconstruct PET images more quickly than reconstructing directly from the four-dimensional PET data. The PFDR algorithm is an approximate rebinning algorithm. We show that implementing the PFDR algorithm followed by the (ramp) filtered backprojection (FBP) algorithm in linogram coordinates from multiple views reconstructs a filtered version of our image. We develop an explicit formula for this filter which can be used to achieve exact reconstruction by means of a modified FBP algorithm applied to the stack of rebinned linograms and can also be used to quantify the errors introduced by the PFDR algorithm. This filter is similar to the filter in the planogram filtered backprojection algorithm derived by Brasse et al. The planogram filtered backprojection and exact reconstruction with the PFDR algorithm require complete projections which can be completed with a reprojection algorithm. The PFDR algorithm is similar to the rebinning algorithm developed by Kao et al. By expressing the PFDR algorithm in detector coordinates, we provide a comparative analysis between the two algorithms. Numerical experiments using both simulated data and measured data from a positron emission mammography/tomography (PEM/PET) system are performed. Images are reconstructed by PFDR+FBP (PFDR followed by 2D FBP reconstruction), PFDRX (PFDR followed by the modified FBP algorithm for exact reconstruction) and planogram filtered backprojection image reconstruction algorithms. We show that the PFDRX algorithm produces images that are nearly as accurate as images reconstructed with the planogram filtered backprojection algorithm and more accurate than images reconstructed with the PFDR+FBP algorithm. Both the PFDR+FBP and PFDRX algorithms provide a dramatic improvement in computation time over the planogram filtered backprojection algorithm. PMID:20436790

  3. A modify ant colony optimization for the grid jobs scheduling problem with QoS requirements

    NASA Astrophysics Data System (ADS)

    Pu, Xun; Lu, XianLiang

    2011-10-01

    Job scheduling with customers' quality of service (QoS) requirement is challenging in grid environment. In this paper, we present a modify Ant colony optimization (MACO) for the Job scheduling problem in grid. Instead of using the conventional construction approach to construct feasible schedules, the proposed algorithm employs a decomposition method to satisfy the customer's deadline and cost requirements. Besides, a new mechanism of service instances state updating is embedded to improve the convergence of MACO. Experiments demonstrate the effectiveness of the proposed algorithm.

  4. Adaptive antenna arrays for satellite communication

    NASA Technical Reports Server (NTRS)

    Gupta, Inder J.

    1989-01-01

    The feasibility of using adaptive antenna arrays to provide interference protection in satellite communications was studied. The feedback loops as well as the sample matric inversion (SMI) algorithm for weight control were studied. Appropriate modifications in the two were made to achieve the required interference suppression. An experimental system was built to test the modified feedback loops and the modified SMI algorithm. The performance of the experimental system was evaluated using bench generated signals and signals received from TVRO geosynchronous satellites. A summary of results is given. Some suggestions for future work are also presented.

  5. 78 FR 26821 - Self-Regulatory Organizations; NYSE MKT LLC; Notice of Filing and Immediate Effectiveness of...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-05-08

    ... make the STP modifiers available to algorithms used by Floor brokers to route interest to the Exchange..., pegging e- Quotes, and g-Quotes entered into the matching engine by an algorithm on behalf of a Floor... algorithms removes impediments to and perfects the mechanism of a free and open market because there is a...

  6. 75 FR 81704 - Self-Regulatory Organizations; Chicago Board Options Exchange, Incorporated; Notice of Filing and...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-12-28

    ... algorithm \\5\\ for HOSS and to make related changes to Interpretation and Policy .03. Currently, there are... applicable allocation algorithm for the HOSS and modified HOSS rotation procedures. Paragraph (c)(iv) of the... allocation algorithm in effect for the option class pursuant to Rule 6.45A or 6.45B), then to limit orders...

  7. A High-Speed Vision-Based Sensor for Dynamic Vibration Analysis Using Fast Motion Extraction Algorithms.

    PubMed

    Zhang, Dashan; Guo, Jie; Lei, Xiujun; Zhu, Changan

    2016-04-22

    The development of image sensor and optics enables the application of vision-based techniques to the non-contact dynamic vibration analysis of large-scale structures. As an emerging technology, a vision-based approach allows for remote measuring and does not bring any additional mass to the measuring object compared with traditional contact measurements. In this study, a high-speed vision-based sensor system is developed to extract structure vibration signals in real time. A fast motion extraction algorithm is required for this system because the maximum sampling frequency of the charge-coupled device (CCD) sensor can reach up to 1000 Hz. Two efficient subpixel level motion extraction algorithms, namely the modified Taylor approximation refinement algorithm and the localization refinement algorithm, are integrated into the proposed vision sensor. Quantitative analysis shows that both of the two modified algorithms are at least five times faster than conventional upsampled cross-correlation approaches and achieve satisfactory error performance. The practicability of the developed sensor is evaluated by an experiment in a laboratory environment and a field test. Experimental results indicate that the developed high-speed vision-based sensor system can extract accurate dynamic structure vibration signals by tracking either artificial targets or natural features.

  8. Hybridization of Strength Pareto Multiobjective Optimization with Modified Cuckoo Search Algorithm for Rectangular Array

    NASA Astrophysics Data System (ADS)

    Abdul Rani, Khairul Najmy; Abdulmalek, Mohamedfareq; A. Rahim, Hasliza; Siew Chin, Neoh; Abd Wahab, Alawiyah

    2017-04-01

    This research proposes the various versions of modified cuckoo search (MCS) metaheuristic algorithm deploying the strength Pareto evolutionary algorithm (SPEA) multiobjective (MO) optimization technique in rectangular array geometry synthesis. Precisely, the MCS algorithm is proposed by incorporating the Roulette wheel selection operator to choose the initial host nests (individuals) that give better results, adaptive inertia weight to control the positions exploration of the potential best host nests (solutions), and dynamic discovery rate to manage the fraction probability of finding the best host nests in 3-dimensional search space. In addition, the MCS algorithm is hybridized with the particle swarm optimization (PSO) and hill climbing (HC) stochastic techniques along with the standard strength Pareto evolutionary algorithm (SPEA) forming the MCSPSOSPEA and MCSHCSPEA, respectively. All the proposed MCS-based algorithms are examined to perform MO optimization on Zitzler-Deb-Thiele’s (ZDT’s) test functions. Pareto optimum trade-offs are done to generate a set of three non-dominated solutions, which are locations, excitation amplitudes, and excitation phases of array elements, respectively. Overall, simulations demonstrates that the proposed MCSPSOSPEA outperforms other compatible competitors, in gaining a high antenna directivity, small half-power beamwidth (HPBW), low average side lobe level (SLL) suppression, and/or significant predefined nulls mitigation, simultaneously.

  9. Computing an upper bound on contact stress with surrogate duality

    NASA Astrophysics Data System (ADS)

    Xuan, Zhaocheng; Papadopoulos, Panayiotis

    2016-07-01

    We present a method for computing an upper bound on the contact stress of elastic bodies. The continuum model of elastic bodies with contact is first modeled as a constrained optimization problem by using finite elements. An explicit formulation of the total contact force, a fraction function with the numerator as a linear function and the denominator as a quadratic convex function, is derived with only the normalized nodal contact forces as the constrained variables in a standard simplex. Then two bounds are obtained for the sum of the nodal contact forces. The first is an explicit formulation of matrices of the finite element model, derived by maximizing the fraction function under the constraint that the sum of the normalized nodal contact forces is one. The second bound is solved by first maximizing the fraction function subject to the standard simplex and then using Dinkelbach's algorithm for fractional programming to find the maximum—since the fraction function is pseudo concave in a neighborhood of the solution. These two bounds are solved with the problem dimensions being only the number of contact nodes or node pairs, which are much smaller than the dimension for the original problem, namely, the number of degrees of freedom. Next, a scheme for constructing an upper bound on the contact stress is proposed that uses the bounds on the sum of the nodal contact forces obtained on a fine finite element mesh and the nodal contact forces obtained on a coarse finite element mesh, which are problems that can be solved at a lower computational cost. Finally, the proposed method is verified through some examples concerning both frictionless and frictional contact to demonstrate the method's feasibility, efficiency, and robustness.

  10. Segmentation and classification of brain images using firefly and hybrid kernel-based support vector machine

    NASA Astrophysics Data System (ADS)

    Selva Bhuvaneswari, K.; Geetha, P.

    2017-05-01

    Magnetic resonance imaging segmentation refers to a process of assigning labels to set of pixels or multiple regions. It plays a major role in the field of biomedical applications as it is widely used by the radiologists to segment the medical images input into meaningful regions. In recent years, various brain tumour detection techniques are presented in the literature. The entire segmentation process of our proposed work comprises three phases: threshold generation with dynamic modified region growing phase, texture feature generation phase and region merging phase. by dynamically changing two thresholds in the modified region growing approach, the first phase of the given input image can be performed as dynamic modified region growing process, in which the optimisation algorithm, firefly algorithm help to optimise the two thresholds in modified region growing. After obtaining the region growth segmented image using modified region growing, the edges can be detected with edge detection algorithm. In the second phase, the texture feature can be extracted using entropy-based operation from the input image. In region merging phase, the results obtained from the texture feature-generation phase are combined with the results of dynamic modified region growing phase and similar regions are merged using a distance comparison between regions. After identifying the abnormal tissues, the classification can be done by hybrid kernel-based SVM (Support Vector Machine). The performance analysis of the proposed method will be carried by K-cross fold validation method. The proposed method will be implemented in MATLAB with various images.

  11. Pre-clinical development of gene modification of haematopoietic stem cells with chimeric antigen receptors for cancer immunotherapy.

    PubMed

    Larson, Sarah M; Truscott, Laurel C; Chiou, Tzu-Ting; Patel, Amie; Kao, Roy; Tu, Andy; Tyagi, Tulika; Lu, Xiang; Elashoff, David; De Oliveira, Satiro N

    2017-05-04

    Patients with refractory or recurrent B-lineage hematologic malignancies have less than 50% of chance of cure despite intensive therapy and innovative approaches are needed. We hypothesize that gene modification of haematopoietic stem cells (HSC) with an anti-CD19 chimeric antigen receptor (CAR) will produce a multi-lineage, persistent immunotherapy against B-lineage malignancies that can be controlled by the HSVsr39TK suicide gene. High-titer third-generation self-inactivating lentiviral constructs were developed to deliver a second-generation CD19-specific CAR and the herpes simplex virus thymidine kinase HSVsr39TK to provide a suicide gene to allow ablation of gene-modified cells if necessary. Human HSC were transduced with such lentiviral vectors and evaluated for function of both CAR and HSVsr39TK. Satisfactory transduction efficiency was achieved; the addition of the suicide gene did not impair CAR expression or antigen-specific cytotoxicity, and determined marked cytotoxicity to ganciclovir. NSG mice transplanted with gene-modified human HSC showed CAR expression not significantly different between transduced cells with or without HSVsr39TK, and expression of anti-CD19 CAR conferred anti-tumor survival advantage. Treatment with ganciclovir led to significant ablation of gene-modified cells in mouse tissues. Haematopoietic stem cell transplantation is frequently part of the standard of care for patients with relapsed and refractory B cell malignancies; following HSC collection, a portion of the cells could be modified to express the CD19-specific CAR and give rise to a persistent, multi-cell lineage, HLA-independent immunotherapy, enhancing the graft-versus-malignancy activity.

  12. Tendency for interlaboratory precision in the GMO analysis method based on real-time PCR.

    PubMed

    Kodama, Takashi; Kurosawa, Yasunori; Kitta, Kazumi; Naito, Shigehiro

    2010-01-01

    The Horwitz curve estimates interlaboratory precision as a function only of concentration, and is frequently used as a method performance criterion in food analysis with chemical methods. The quantitative biochemical methods based on real-time PCR require an analogous criterion to progressively promote method validation. We analyzed the tendency of precision using a simplex real-time PCR technique in 53 collaborative studies of seven genetically modified (GM) crops. Reproducibility standard deviation (SR) and repeatability standard deviation (Sr) of the genetically modified organism (GMO) amount (%) was more or less independent of GM crops (i.e., maize, soybean, cotton, oilseed rape, potato, sugar beet, and rice) and evaluation procedure steps. Some studies evaluated whole steps consisting of DNA extraction and PCR quantitation, whereas others focused only on the PCR quantitation step by using DNA extraction solutions. Therefore, SR and Sr for GMO amount (%) are functions only of concentration similar to the Horwitz curve. We proposed S(R) = 0.1971C 0.8685 and S(r) = 0.1478C 0.8424, where C is the GMO amount (%). We also proposed a method performance index in GMO quantitative methods that is analogous to the Horwitz Ratio.

  13. Double heterozygous mutations of MITF and PAX3 result in Waardenburg syndrome with increased penetrance in pigmentary defects.

    PubMed

    Yang, T; Li, X; Huang, Q; Li, L; Chai, Y; Sun, L; Wang, X; Zhu, Y; Wang, Z; Huang, Z; Li, Y; Wu, H

    2013-01-01

    Waardenburg syndrome (WS) is characterized by sensorineural hearing loss and pigmentary defects of the hair, skin, and iris. Heterozygous mutations of MITF and its transactivator gene PAX3 are associated with Waardenburg syndrome type II (WS2) and type I (WS1), respectively. Most patients with MITF or PAX3 mutations, however, show variable penetrance of WS-associated phenotypes even within families segregating the same mutation, possibly mediated by genetic background or specific modifiers. In this study, we reported a rare Waardenburg syndrome simplex family in which a pair of WS parents gave birth to a child with double heterozygous mutations of MITF and PAX3. Compared to his parents who carried a single mutation in either MITF or PAX3, this child showed increased penetrance of pigmentary defects including white forelock, white eyebrows and eyelashes, and patchy facial depigmentation. This observation suggested that the expression level of MITF is closely correlated to the penetrance of WS, and variants in transcription regulator genes of MITF may modify the relevant clinical phenotypes. © 2012 John Wiley & Sons A/S. Published by Blackwell Publishing Ltd.

  14. HECLIB. Volume 2: HECDSS Subroutines Programmer’s Manual

    DTIC Science & Technology

    1991-05-01

    algorithm and hierarchical design for database accesses. This algorithm provides quick access to data sets and an efficient means of adding new data set...Description of How DSS Works DSS version 6 utilizes a modified hash algorithm based upon the pathname to store and retrieve data. This structure allows...balancing disk space and record access times. A variation in this algorithm is for "stable" files. In a stable file, a hash table is not utilized

  15. On accuracy, privacy, and complexity in the identification problem

    NASA Astrophysics Data System (ADS)

    Beekhof, F.; Voloshynovskiy, S.; Koval, O.; Holotyak, T.

    2010-02-01

    This paper presents recent advances in the identification problem taking into account the accuracy, complexity and privacy leak of different decoding algorithms. Using a model of different actors from literature, we show that it is possible to use more accurate decoding algorithms using reliability information without increasing the privacy leak relative to algorithms that only use binary information. Existing algorithms from literature have been modified to take advantage of reliability information, and we show that a proposed branch-and-bound algorithm can outperform existing work, including the enhanced variants.

  16. Autonomous dynamic obstacle avoidance for bacteria-powered microrobots (BPMs) with modified vector field histogram

    PubMed Central

    Kim, Hoyeon; Cheang, U. Kei

    2017-01-01

    In order to broaden the use of microrobots in practical fields, autonomous control algorithms such as obstacle avoidance must be further developed. However, most previous studies of microrobots used manual motion control to navigate past tight spaces and obstacles while very few studies demonstrated the use of autonomous motion. In this paper, we demonstrated a dynamic obstacle avoidance algorithm for bacteria-powered microrobots (BPMs) using electric field in fluidic environments. A BPM consists of an artificial body, which is made of SU-8, and a high dense layer of harnessed bacteria. BPMs can be controlled using externally applied electric fields due to the electrokinetic property of bacteria. For developing dynamic obstacle avoidance for BPMs, a kinematic model of BPMs was utilized to prevent collision and a finite element model was used to characteristic the deformation of an electric field near the obstacle walls. In order to avoid fast moving obstacles, we modified our previously static obstacle avoidance approach using a modified vector field histogram (VFH) method. To validate the advanced algorithm in experiments, magnetically controlled moving obstacles were used to intercept the BPMs as the BPMs move from the initial position to final position. The algorithm was able to successfully guide the BPMs to reach their respective goal positions while avoiding the dynamic obstacles. PMID:29020016

  17. Autonomous dynamic obstacle avoidance for bacteria-powered microrobots (BPMs) with modified vector field histogram.

    PubMed

    Kim, Hoyeon; Cheang, U Kei; Kim, Min Jun

    2017-01-01

    In order to broaden the use of microrobots in practical fields, autonomous control algorithms such as obstacle avoidance must be further developed. However, most previous studies of microrobots used manual motion control to navigate past tight spaces and obstacles while very few studies demonstrated the use of autonomous motion. In this paper, we demonstrated a dynamic obstacle avoidance algorithm for bacteria-powered microrobots (BPMs) using electric field in fluidic environments. A BPM consists of an artificial body, which is made of SU-8, and a high dense layer of harnessed bacteria. BPMs can be controlled using externally applied electric fields due to the electrokinetic property of bacteria. For developing dynamic obstacle avoidance for BPMs, a kinematic model of BPMs was utilized to prevent collision and a finite element model was used to characteristic the deformation of an electric field near the obstacle walls. In order to avoid fast moving obstacles, we modified our previously static obstacle avoidance approach using a modified vector field histogram (VFH) method. To validate the advanced algorithm in experiments, magnetically controlled moving obstacles were used to intercept the BPMs as the BPMs move from the initial position to final position. The algorithm was able to successfully guide the BPMs to reach their respective goal positions while avoiding the dynamic obstacles.

  18. Schizophrenia Susceptibility Genes Directly Implicated in the Life Cycles of Pathogens: Cytomegalovirus, Influenza, Herpes simplex, Rubella, and Toxoplasma gondii

    PubMed Central

    Carter, C.J.

    2009-01-01

    Many genes implicated in schizophrenia can be related to glutamatergic transmission and neuroplasticity, oligodendrocyte function, and other families clearly related to neurobiology and schizophrenia phenotypes. Others appear rather to be involved in the life cycles of the pathogens implicated in the disease. For example, aspartylglucosaminidase (AGA), PLA2, SIAT8B, GALNT7, or B3GAT1 metabolize chemical ligands to which the influenza virus, herpes simplex, cytomegalovirus (CMV), rubella, or Toxoplasma gondii bind. The epidermal growth factor receptor (EGR/EGFR) is used by the CMV to gain entry to cells, and a CMV gene codes for an interleukin (IL-10) mimic that binds the host cognate receptor, IL10R. The fibroblast growth factor receptor (FGFR1) is used by herpes simplex. KPNA3 and RANBP5 control the nuclear import of the influenza virus. Disrupted in schizophrenia 1 (DISC1) controls the microtubule network that is used by viruses as a route to the nucleus, while DTNBP1, MUTED, and BLOC1S3 regulate endosomal to lysosomal routing that is also important in viral traffic. Neuregulin 1 activates ERBB receptors releasing a factor, EBP1, known to inhibit the influenza virus transcriptase. Other viral or bacterial components bind to genes or proteins encoded by CALR, FEZ1, FYN, HSPA1B, IL2, HTR2A, KPNA3, MED12, MED15, MICB, NQO2, PAX6, PIK3C3, RANBP5, or TP53, while the cerebral infectivity of the herpes simplex virus is modified by Apolipoprotein E (APOE). Genes encoding for proteins related to the innate immune response, including cytokine related (CCR5, CSF2RA, CSF2RB, IL1B, IL1RN, IL2, IL3, IL3RA, IL4, IL10, IL10RA, IL18RAP, lymphotoxin-alpha, tumor necrosis factor alpha [TNF]), human leukocyte antigen (HLA) antigens (HLA-A10, HLA-B, HLA-DRB1), and genes involved in antigen processing (angiotensin-converting enzyme and tripeptidyl peptidase 2) are all concerned with defense against invading pathogens. Human microRNAs (Hsa-mir-198 and Hsa-mir-206) are predicted to bind to influenza, rubella, or poliovirus genes. Certain genes associated with schizophrenia, including those also concerned with neurophysiology, are intimately related to the life cycles of the pathogens implicated in the disease. Several genes may affect pathogen virulence, while the pathogens in turn may affect genes and processes relevant to the neurophysiology of schizophrenia. For such genes, the strength of association in genetic studies is likely to be conditioned by the presence of the pathogen, which varies in different populations at different times, a factor that may explain the heterogeneity that plagues such studies. This scenario also suggests that drugs or vaccines designed to eliminate the pathogens that so clearly interact with schizophrenia susceptibility genes could have a dramatic effect on the incidence of the disease. PMID:18552348

  19. Propeller sheet cavitation noise source modeling and inversion

    NASA Astrophysics Data System (ADS)

    Lee, Keunhwa; Lee, Jaehyuk; Kim, Dongho; Kim, Kyungseop; Seong, Woojae

    2014-02-01

    Propeller sheet cavitation is the main contributor to high level of noise and vibration in the after body of a ship. Full measurement of the cavitation-induced hull pressure over the entire surface of the affected area is desired but not practical. Therefore, using a few measurements on the outer hull above the propeller in a cavitation tunnel, empirical or semi-empirical techniques based on physical model have been used to predict the hull-induced pressure (or hull-induced force). In this paper, with the analytic source model for sheet cavitation, a multi-parameter inversion scheme to find the positions of noise sources and their strengths is suggested. The inversion is posed as a nonlinear optimization problem, which is solved by the optimization algorithm based on the adaptive simplex simulated annealing algorithm. Then, the resulting hull pressure can be modeled with boundary element method from the inverted cavitation noise sources. The suggested approach is applied to the hull pressure data measured in a cavitation tunnel of the Samsung Heavy Industry. Two monopole sources are adequate to model the propeller sheet cavitation noise. The inverted source information is reasonable with the cavitation dynamics of the propeller and the modeled hull pressure shows good agreement with cavitation tunnel experimental data.

  20. Guidance on management of asymptomatic neonates born to women with active genital herpes lesions.

    PubMed

    Kimberlin, David W; Baley, Jill

    2013-02-01

    Herpes simplex virus (HSV) infection of the neonate is uncommon, but genital herpes infections in adults are very common. Thus, although treating an infant with neonatal herpes is a relatively rare occurrence, managing infants potentially exposed to HSV at the time of delivery occurs more frequently. The risk of transmitting HSV to an infant during delivery is determined in part by the mother's previous immunity to HSV. Women with primary genital HSV infections who are shedding HSV at delivery are 10 to 30 times more likely to transmit the virus to their newborn infants than are women with recurrent HSV infection who are shedding virus at delivery. With the availability of commercial serological tests that reliably can distinguish type-specific HSV antibodies, it is now possible to determine the type of maternal infection and, thus, further refine management of infants delivered to women who have active genital HSV lesions. The management algorithm presented herein uses both serological and virological studies to determine the risk of HSV transmission to the neonate who is delivered to a mother with active herpetic genital lesions and tailors management accordingly. The algorithm does not address the approach to asymptomatic neonates delivered to women with a history of genital herpes but no active lesions at delivery.

Top