NaNet-10: a 10GbE network interface card for the GPU-based low-level trigger of the NA62 RICH detector

International Nuclear Information System (INIS)

Ammendola, R.; Biagioni, A.; Frezza, O.; Lonardo, A.; Cicero, F. Lo; Martinelli, M.; Paolucci, P.S.; Pastorelli, E.; Simula, F.; Tosoratto, L.; Vicini, P.; Fiorini, M.; Neri, I.; Lamanna, G.; Piandani, R.; Pontisso, L.; Sozzi, M.; Rossetti, D.

2016-01-01

A GPU-based low level (L0) trigger is currently integrated in the experimental setup of the RICH detector of the NA62 experiment to assess the feasibility of building more refined physics-related trigger primitives and thus improve the trigger discriminating power. To ensure the real-time operation of the system, a dedicated data transport mechanism has been implemented: an FPGA-based Network Interface Card (NaNet-10) receives data from detectors and forwards them with low, predictable latency to the memory of the GPU performing the trigger algorithms. Results of the ring-shaped hit patterns reconstruction will be reported and discussed

Selection of discriminant mid-infrared wavenumbers by combining a naïve Bayesian classifier and a genetic algorithm: Application to the evaluation of lignocellulosic biomass biodegradation.

Science.gov (United States)

Rammal, Abbas; Perrin, Eric; Vrabie, Valeriu; Assaf, Rabih; Fenniri, Hassan

2017-07-01

Infrared spectroscopy provides useful information on the molecular compositions of biological systems related to molecular vibrations, overtones, and combinations of fundamental vibrations. Mid-infrared (MIR) spectroscopy is sensitive to organic and mineral components and has attracted growing interest in the development of biomarkers related to intrinsic characteristics of lignocellulose biomass. However, not all spectral information is valuable for biomarker construction or for applying analysis methods such as classification. Better processing and interpretation can be achieved by identifying discriminating wavenumbers. The selection of wavenumbers has been addressed through several variable- or feature-selection methods. Some of them have not been adapted for use in large data sets or are difficult to tune, and others require additional information, such as concentrations. This paper proposes a new approach by combining a naïve Bayesian classifier with a genetic algorithm to identify discriminating spectral wavenumbers. The genetic algorithm uses a linear combination of an a posteriori probability and the Bayes error rate as the fitness function for optimization. Such a function allows the improvement of both the compactness and the separation of classes. This approach was tested to classify a small set of maize roots in soil according to their biodegradation process based on their MIR spectra. The results show that this optimization method allows better discrimination of the biodegradation process, compared with using the information of the entire MIR spectrum, the use of the spectral information at wavenumbers selected by a genetic algorithm based on a classical validity index or the use of the spectral information selected by combining a genetic algorithm with other methods, such as Linear Discriminant Analysis. The proposed method selects wavenumbers that correspond to principal vibrations of chemical functional groups of compounds that undergo degradation

Uso de algoritmo de otimização na determinação de tipos de animal funcional Use of optimization algorithm for determining of animal functional types

Directory of Open Access Journals (Sweden)

Carlos Eduardo Nogueira Martins

2012-08-01

Full Text Available O presente trabalho teve como objetivo avaliar o uso de algoritmo de otimização na determinação de tipos funcionais de animais da raça Braford para diferentes condições ambientais. Foram utilizados algoritmos específicos de otimização por meio do progama computacional SYNCSA, com o objetivo de determinar subconjuntos ótimos de atributos que definem diferentes tipos funcionais, tendo em vista a eficiência de utilização da pastagem pelos animais. Tais algoritmos estão fundamentados na definição de matrizes de incidência que relacionam as variáveis de interesse. No presente estudo, a matriz B definiu a relação animais x medidas corporais; a matriz W, a relação produtividade acumulada x graus de sangue; e a matriz E, a relação graus de sangue x ambientes (com e sem restrição alimentar. Os resultados mostraram a existência de três tipos funcionais: animais de maior estrutura corporal; animais de estrutura intermediária e animais com menor estrutura, com exceção do atributo largura do peito. Os animais de maior estrutura corporal obtiveram 30 e 47,7kg a mais de terneiros desmamados, no ambiente sem restrição alimentar, que os animais de estrutura corporal média e pequena, respectivamente. No ambiente com restrição alimentar, o tipo de animal de estrutura média apresentou melhor desempenho produtivo, sendo este 18,5 e 36,8% superior aos tipos de maior e menor estrutura corporal, respectivamente. Os resultados deste trabalho demonstram que o algoritmo criado para determinação de tipos funcionais pode ser utilizado na busca do melhor biótipo animal para os diferentes sistemas de produção.This study aimed to evaluate the use of optimization algorithm to determine functional types of animals Braford for different environmental conditions. We used specific optimization algorithms through the computer program SYNCSA in order to determine optimal subsets of attributes that define different functional types in view

An efficient feedback calibration algorithm for direct imaging radio telescopes

Science.gov (United States)

Beardsley, Adam P.; Thyagarajan, Nithyanandan; Bowman, Judd D.; Morales, Miguel F.

2017-10-01

We present the E-field Parallel Imaging Calibration (EPICal) algorithm, which addresses the need for a fast calibration method for direct imaging radio astronomy correlators. Direct imaging involves a spatial fast Fourier transform of antenna signals, alleviating an O(Na ^2) computational bottleneck typical in radio correlators, and yielding a more gentle O(Ng log _2 Ng) scaling, where Na is the number of antennas in the array and Ng is the number of gridpoints in the imaging analysis. This can save orders of magnitude in computation cost for next generation arrays consisting of hundreds or thousands of antennas. However, because antenna signals are mixed in the imaging correlator without creating visibilities, gain correction must be applied prior to imaging, rather than on visibilities post-correlation. We develop the EPICal algorithm to form gain solutions quickly and without ever forming visibilities. This method scales as the number of antennas, and produces results comparable to those from visibilities. We use simulations to demonstrate the EPICal technique and study the noise properties of our gain solutions, showing they are similar to visibility-based solutions in realistic situations. By applying EPICal to 2 s of Long Wavelength Array data, we achieve a 65 per cent dynamic range improvement compared to uncalibrated images, showing this algorithm is a promising solution for next generation instruments.

Prediction of Endocrine System Affectation in Fisher 344 Rats by Food Intake Exposed with Malathion, Applying Naïve Bayes Classifier and Genetic Algorithms.

Science.gov (United States)

Mora, Juan David Sandino; Hurtado, Darío Amaya; Sandoval, Olga Lucía Ramos

2016-01-01

Reported cases of uncontrolled use of pesticides and its produced effects by direct or indirect exposition, represent a high risk for human health. Therefore, in this paper, it is shown the results of the development and execution of an algorithm that predicts the possible effects in endocrine system in Fisher 344 (F344) rats, occasioned by ingestion of malathion. It was referred to ToxRefDB database in which different case studies in F344 rats exposed to malathion were collected. The experimental data were processed using Naïve Bayes (NB) machine learning classifier, which was subsequently optimized using genetic algorithms (GAs). The model was executed in an application with a graphical user interface programmed in C#. There was a tendency to suffer bigger alterations, increasing levels in the parathyroid gland in dosages between 4 and 5 mg/kg/day, in contrast to the thyroid gland for doses between 739 and 868 mg/kg/day. It was showed a greater resistance for females to contract effects on the endocrine system by the ingestion of malathion. Females were more susceptible to suffer alterations in the pituitary gland with exposure times between 3 and 6 months. The prediction model based on NB classifiers allowed to analyze all the possible combinations of the studied variables and improving its accuracy using GAs. Excepting the pituitary gland, females demonstrated better resistance to contract effects by increasing levels on the rest of endocrine system glands.

Human activity recognition based on feature selection in smart home using back-propagation algorithm.

Science.gov (United States)

Fang, Hongqing; He, Lei; Si, Hao; Liu, Peng; Xie, Xiaolei

2014-09-01

In this paper, Back-propagation(BP) algorithm has been used to train the feed forward neural network for human activity recognition in smart home environments, and inter-class distance method for feature selection of observed motion sensor events is discussed and tested. And then, the human activity recognition performances of neural network using BP algorithm have been evaluated and compared with other probabilistic algorithms: Naïve Bayes(NB) classifier and Hidden Markov Model(HMM). The results show that different feature datasets yield different activity recognition accuracy. The selection of unsuitable feature datasets increases the computational complexity and degrades the activity recognition accuracy. Furthermore, neural network using BP algorithm has relatively better human activity recognition performances than NB classifier and HMM. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.

Parametri za procena na kvalitetot na polietilenska i na polipropilenska ambalaza i na gumeni zatvoraci nameneti za farmacevtski preparati

Directory of Open Access Journals (Sweden)

Liljana Ugrinova

2002-03-01

Full Text Available Napraven e pregled na parametrite za procena na kvalitetot na polietilenska i na polipropilenska ambalaza i na gumeni zatvoraci nameneti za farmacevtski preparati. Za procena na kvalitetot na ispituvaniot materijal bea izvrseni fizicki, hemiski i bioloski ispituvanja spored postapkite dadeni vo Ph. Eur., DIN i spored DIN ISO standardite. Baranjata za kvalitet na ovoj vid ambalaza propisani spored Ph. Eur., DIN i DIN ISO standardite se razlikuvaat vo odnos na predvidenite parametri za fizicki, za hemiski i za bioloski ispituvanja. Isto taka, propisani se i razlicni granici na dozvoleno otstapuvanje na oddelni parametri.

Simulating prescribed particle densities in the grand canonical ensemble using iterative algorithms.

Science.gov (United States)

Malasics, Attila; Gillespie, Dirk; Boda, Dezso

2008-03-28

We present two efficient iterative Monte Carlo algorithms in the grand canonical ensemble with which the chemical potentials corresponding to prescribed (targeted) partial densities can be determined. The first algorithm works by always using the targeted densities in the kT log(rho(i)) (ideal gas) terms and updating the excess chemical potentials from the previous iteration. The second algorithm extrapolates the chemical potentials in the next iteration from the results of the previous iteration using a first order series expansion of the densities. The coefficients of the series, the derivatives of the densities with respect to the chemical potentials, are obtained from the simulations by fluctuation formulas. The convergence of this procedure is shown for the examples of a homogeneous Lennard-Jones mixture and a NaCl-CaCl(2) electrolyte mixture in the primitive model. The methods are quite robust under the conditions investigated. The first algorithm is less sensitive to initial conditions.

Predicting Smoking Status Using Machine Learning Algorithms and Statistical Analysis

Directory of Open Access Journals (Sweden)

Charles Frank

2018-03-01

Full Text Available Smoking has been proven to negatively affect health in a multitude of ways. As of 2009, smoking has been considered the leading cause of preventable morbidity and mortality in the United States, continuing to plague the country’s overall health. This study aims to investigate the viability and effectiveness of some machine learning algorithms for predicting the smoking status of patients based on their blood tests and vital readings results. The analysis of this study is divided into two parts: In part 1, we use One-way ANOVA analysis with SAS tool to show the statistically significant difference in blood test readings between smokers and non-smokers. The results show that the difference in INR, which measures the effectiveness of anticoagulants, was significant in favor of non-smokers which further confirms the health risks associated with smoking. In part 2, we use five machine learning algorithms: Naïve Bayes, MLP, Logistic regression classifier, J48 and Decision Table to predict the smoking status of patients. To compare the effectiveness of these algorithms we use: Precision, Recall, F-measure and Accuracy measures. The results show that the Logistic algorithm outperformed the four other algorithms with Precision, Recall, F-Measure, and Accuracy of 83%, 83.4%, 83.2%, 83.44%, respectively.

Automated quantitative analysis of in-situ NaI measured spectra in the marine environment using a wavelet-based smoothing technique

International Nuclear Information System (INIS)

Tsabaris, Christos; Prospathopoulos, Aristides

2011-01-01

An algorithm for automated analysis of in-situ NaI γ-ray spectra in the marine environment is presented. A standard wavelet denoising technique is implemented for obtaining a smoothed spectrum, while the stability of the energy spectrum is achieved by taking advantage of the permanent presence of two energy lines in the marine environment. The automated analysis provides peak detection, net area calculation, energy autocalibration, radionuclide identification and activity calculation. The results of the algorithm performance, presented for two different cases, show that analysis of short-term spectra with poor statistical information is considerably improved and that incorporation of further advancements could allow the use of the algorithm in early-warning marine radioactivity systems. - Highlights: → Algorithm for automated analysis of in-situ NaI γ-ray marine spectra. → Wavelet denoising technique provides smoothed spectra even at parts of the energy spectrum that exhibits strong statistical fluctuations. → Automated analysis provides peak detection, net area calculation, energy autocalibration, radionuclide identification and activity calculation. → Analysis of short-term spectra with poor statistical information is considerably improved.

Načrtovan porod na domu

OpenAIRE

Todorović, Tamara; Takač, Iztok

2017-01-01

Izhodišča: Porod na domu je sicer star toliko kot človeštvo, pa vendar v veliki večini srednje in visoko razvitih držav prevladuje mnenje, da so zaradi nepredvidljivosti zapletov porodnišnice najbolj varno okolje za rojevanje. Kljub temu obstaja peščica držav, v katerih je porod na domu integriran v sistem zdravstvenega varstva (npr. Nizozemska, Velika Britanija, Kanada). Pri porodih na domu ločimo nenačrtovane in načrtovane porode na domu, slednje pa lahko nadalje razdelimo še na porode s sp...

Algebraic dynamics algorithm: Numerical comparison with Runge-Kutta algorithm and symplectic geometric algorithm

Institute of Scientific and Technical Information of China (English)

WANG ShunJin; ZHANG Hua

2007-01-01

Based on the exact analytical solution of ordinary differential equations,a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm.A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models.The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision,and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.

Algebraic dynamics algorithm:Numerical comparison with Runge-Kutta algorithm and symplectic geometric algorithm

Institute of Scientific and Technical Information of China (English)

2007-01-01

Based on the exact analytical solution of ordinary differential equations, a truncation of the Taylor series of the exact solution to the Nth order leads to the Nth order algebraic dynamics algorithm. A detailed numerical comparison is presented with Runge-Kutta algorithm and symplectic geometric algorithm for 12 test models. The results show that the algebraic dynamics algorithm can better preserve both geometrical and dynamical fidelity of a dynamical system at a controllable precision, and it can solve the problem of algorithm-induced dissipation for the Runge-Kutta algorithm and the problem of algorithm-induced phase shift for the symplectic geometric algorithm.

The Algorithm for Algorithms: An Evolutionary Algorithm Based on Automatic Designing of Genetic Operators

Directory of Open Access Journals (Sweden)

Dazhi Jiang

2015-01-01

Full Text Available At present there is a wide range of evolutionary algorithms available to researchers and practitioners. Despite the great diversity of these algorithms, virtually all of the algorithms share one feature: they have been manually designed. A fundamental question is “are there any algorithms that can design evolutionary algorithms automatically?” A more complete definition of the question is “can computer construct an algorithm which will generate algorithms according to the requirement of a problem?” In this paper, a novel evolutionary algorithm based on automatic designing of genetic operators is presented to address these questions. The resulting algorithm not only explores solutions in the problem space like most traditional evolutionary algorithms do, but also automatically generates genetic operators in the operator space. In order to verify the performance of the proposed algorithm, comprehensive experiments on 23 well-known benchmark optimization problems are conducted. The results show that the proposed algorithm can outperform standard differential evolution algorithm in terms of convergence speed and solution accuracy which shows that the algorithm designed automatically by computers can compete with the algorithms designed by human beings.

Data fusion for a vision-aided radiological detection system: Calibration algorithm performance

Science.gov (United States)

Stadnikia, Kelsey; Henderson, Kristofer; Martin, Allan; Riley, Phillip; Koppal, Sanjeev; Enqvist, Andreas

2018-05-01

calibration-difference of 22 cm. Using NaI and He-3 detectors in place of the EJ-309, the calibration-difference was 52 cm for NaI and 75 cm for He-3. The algorithm is not detector dependent; however, from these results it was determined that detector dependent adjustments are required.

An extensive assessment of network alignment algorithms for comparison of brain connectomes.

Science.gov (United States)

Milano, Marianna; Guzzi, Pietro Hiram; Tymofieva, Olga; Xu, Duan; Hess, Christofer; Veltri, Pierangelo; Cannataro, Mario

2017-06-06

Recently the study of the complex system of connections in neural systems, i.e. the connectome, has gained a central role in neurosciences. The modeling and analysis of connectomes are therefore a growing area. Here we focus on the representation of connectomes by using graph theory formalisms. Macroscopic human brain connectomes are usually derived from neuroimages; the analyzed brains are co-registered in the image domain and brought to a common anatomical space. An atlas is then applied in order to define anatomically meaningful regions that will serve as the nodes of the network - this process is referred to as parcellation. The atlas-based parcellations present some known limitations in cases of early brain development and abnormal anatomy. Consequently, it has been recently proposed to perform atlas-free random brain parcellation into nodes and align brains in the network space instead of the anatomical image space, as a way to deal with the unknown correspondences of the parcels. Such process requires modeling of the brain using graph theory and the subsequent comparison of the structure of graphs. The latter step may be modeled as a network alignment (NA) problem. In this work, we first define the problem formally, then we test six existing state of the art of network aligners on diffusion MRI-derived brain networks. We compare the performances of algorithms by assessing six topological measures. We also evaluated the robustness of algorithms to alterations of the dataset. The results confirm that NA algorithms may be applied in cases of atlas-free parcellation for a fully network-driven comparison of connectomes. The analysis shows MAGNA++ is the best global alignment algorithm. The paper presented a new analysis methodology that uses network alignment for validating atlas-free parcellation brain connectomes. The methodology has been experimented on several brain datasets.

Image-based point spread function implementation in a fully 3D OSEM reconstruction algorithm for PET.

Science.gov (United States)

Rapisarda, E; Bettinardi, V; Thielemans, K; Gilardi, M C

2010-07-21

The interest in positron emission tomography (PET) and particularly in hybrid integrated PET/CT systems has significantly increased in the last few years due to the improved quality of the obtained images. Nevertheless, one of the most important limits of the PET imaging technique is still its poor spatial resolution due to several physical factors originating both at the emission (e.g. positron range, photon non-collinearity) and at detection levels (e.g. scatter inside the scintillating crystals, finite dimensions of the crystals and depth of interaction). To improve the spatial resolution of the images, a possible way consists of measuring the point spread function (PSF) of the system and then accounting for it inside the reconstruction algorithm. In this work, the system response of the GE Discovery STE operating in 3D mode has been characterized by acquiring (22)Na point sources in different positions of the scanner field of view. An image-based model of the PSF was then obtained by fitting asymmetric two-dimensional Gaussians on the (22)Na images reconstructed with small pixel sizes. The PSF was then incorporated, at the image level, in a three-dimensional ordered subset maximum likelihood expectation maximization (OS-MLEM) reconstruction algorithm. A qualitative and quantitative validation of the algorithm accounting for the PSF has been performed on phantom and clinical data, showing improved spatial resolution, higher contrast and lower noise compared with the corresponding images obtained using the standard OS-MLEM algorithm.

RISC mezzanines for controlling data acquisition in the NA48 experiment at CERN

International Nuclear Information System (INIS)

Guzik, Z.; Chlopik, A.; Bal, Fr.; Formenti, F.; Lacourt, A.

2000-01-01

A part of the LKr calorimeter data acquisition system of the NA48 experiment (a precision measurements of ε/ε' in CP violating; K 0 →2π decays) is described. The experiment runs on the SPS north area in CERN. This paper presents some aspects of controlling the NA48 readout process based on commercial RIO 8260 RISC processors, which were used as a core for maintaining control algorithms. Several RISC processors were equipped with custom-made VME mezzanine boards providing interfacing, pre-processing and data formatting. These mezzanines are subjects of this paper. They are: RIO-TIC/DAT - time stamp distributor and buffered DT-bus interface, FOL-RIO - optical data formatter and event merger and 'TAXI receiver' - handling trigger data of the NA48 Level 2 trigger supervisor. Also the interface between DT-bus and S-link/PCI is described

Application of the method ELECTRE II (Elimination and Choice Translating Algorithm) to support the customers order in liquefied petroleum gas distributors; Aplicacao do metodo ELECTRE II (Elimination and Choice Translating Algorithm) na ordenacao de clientes em uma distribuidora de gas liquefeito do petroleo

Energy Technology Data Exchange (ETDEWEB)

Sobral, Marcos Felipe Falcao; Costa, Ana Paula Cabral Seixas [Universidade Federal de Pernambuco (UFPE), Recife, PE (Brazil)

2008-07-01

The objective of this study is to promote the use of multi criteria decision method ELECTRE II to support the customers order in liquefied petroleum gas distributors, located in the Northeast of Brazil. The company has difficulties to rank the customers their factory, causing various difficult related like reduction of performance indicators and high costs with extra-hours. Finally, is presented a results comparison obtained by the method with the current results, performing a utilization viability analysis of method for this problem. (author)

Algorithms

Indian Academy of Sciences (India)

polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language Is used to describe an algorithm for execution on a computer. An algorithm expressed using a programming.

RISC mezzanines for controlling data acquisition in the NA48 experiment at CERN

CERN Document Server

Guzik, Z; Bal, F; Formenti, F; Lacourt, A

2000-01-01

A part of the LKr calorimeter data acquisition system of the NA48 experiment (a precision measurements of epsilon / epsilon ' in CP- violating K/sup 0/ to 2 pi decays) is described. The experiment runs on the SPS north area in CERN. This paper presents some aspects of controlling the NA48 readout process based on commercial RIO 8260 RISC processors, which were used as a core for maintaining control algorithms. Several RISC processors were equipped with custom-made VME mezzanine boards providing interfacing, pre-processing and data formatting. These mezzanines are the subjects of this paper. They are: RIO-TIC/DAT (a time-stamp distributor and buffered DT-bus interface), FOL-RIO (an optical data formatter and event merger) and "TAXI receiver" (for handling trigger data of the NA48 Level-2 trigger supervisor). Also, the interface between the DT-bus and S- link/PCI is described. (8 refs).

Estimating the chance of success in IVF treatment using a ranking algorithm.

Science.gov (United States)

Güvenir, H Altay; Misirli, Gizem; Dilbaz, Serdar; Ozdegirmenci, Ozlem; Demir, Berfu; Dilbaz, Berna

2015-09-01

In medicine, estimating the chance of success for treatment is important in deciding whether to begin the treatment or not. This paper focuses on the domain of in vitro fertilization (IVF), where estimating the outcome of a treatment is very crucial in the decision to proceed with treatment for both the clinicians and the infertile couples. IVF treatment is a stressful and costly process. It is very stressful for couples who want to have a baby. If an initial evaluation indicates a low pregnancy rate, decision of the couple may change not to start the IVF treatment. The aim of this study is twofold, firstly, to develop a technique that can be used to estimate the chance of success for a couple who wants to have a baby and secondly, to determine the attributes and their particular values affecting the outcome in IVF treatment. We propose a new technique, called success estimation using a ranking algorithm (SERA), for estimating the success of a treatment using a ranking-based algorithm. The particular ranking algorithm used here is RIMARC. The performance of the new algorithm is compared with two well-known algorithms that assign class probabilities to query instances. The algorithms used in the comparison are Naïve Bayes Classifier and Random Forest. The comparison is done in terms of area under the ROC curve, accuracy and execution time, using tenfold stratified cross-validation. The results indicate that the proposed SERA algorithm has a potential to be used successfully to estimate the probability of success in medical treatment.

STAR Algorithm Integration Team - Facilitating operational algorithm development

Science.gov (United States)

Mikles, V. J.

2015-12-01

The NOAA/NESDIS Center for Satellite Research and Applications (STAR) provides technical support of the Joint Polar Satellite System (JPSS) algorithm development and integration tasks. Utilizing data from the S-NPP satellite, JPSS generates over thirty Environmental Data Records (EDRs) and Intermediate Products (IPs) spanning atmospheric, ocean, cryosphere, and land weather disciplines. The Algorithm Integration Team (AIT) brings technical expertise and support to product algorithms, specifically in testing and validating science algorithms in a pre-operational environment. The AIT verifies that new and updated algorithms function in the development environment, enforces established software development standards, and ensures that delivered packages are functional and complete. AIT facilitates the development of new JPSS-1 algorithms by implementing a review approach based on the Enterprise Product Lifecycle (EPL) process. Building on relationships established during the S-NPP algorithm development process and coordinating directly with science algorithm developers, the AIT has implemented structured reviews with self-contained document suites. The process has supported algorithm improvements for products such as ozone, active fire, vegetation index, and temperature and moisture profiles.

Na+-stimulated ATPase of alkaliphilic halotolerant cyanobacterium Aphanothece halophytica translocates Na+ into proteoliposomes via Na+ uniport mechanism

Directory of Open Access Journals (Sweden)

Soontharapirakkul Kanteera

2010-08-01

Full Text Available Abstract Background When cells are exposed to high salinity conditions, they develop a mechanism to extrude excess Na+ from cells to maintain the cytoplasmic Na+ concentration. Until now, the ATPase involved in Na+ transport in cyanobacteria has not been characterized. Here, the characterization of ATPase and its role in Na+ transport of alkaliphilic halotolerant Aphanothece halophytica were investigated to understand the survival mechanism of A. halophytica under high salinity conditions. Results The purified enzyme catalyzed the hydrolysis of ATP in the presence of Na+ but not K+, Li+ and Ca2+. The apparent Km values for Na+ and ATP were 2.0 and 1.2 mM, respectively. The enzyme is likely the F1F0-ATPase based on the usual subunit pattern and the protection against N,N'-dicyclohexylcarbodiimide inhibition of ATPase activity by Na+ in a pH-dependent manner. Proteoliposomes reconstituted with the purified enzyme could take up Na+ upon the addition of ATP. The apparent Km values for this uptake were 3.3 and 0.5 mM for Na+ and ATP, respectively. The mechanism of Na+ transport mediated by Na+-stimulated ATPase in A. halophytica was revealed. Using acridine orange as a probe, alkalization of the lumen of proteoliposomes reconstituted with Na+-stimulated ATPase was observed upon the addition of ATP with Na+ but not with K+, Li+ and Ca2+. The Na+- and ATP-dependent alkalization of the proteoliposome lumen was stimulated by carbonyl cyanide m - chlorophenylhydrazone (CCCP but was inhibited by a permeant anion nitrate. The proteoliposomes showed both ATPase activity and ATP-dependent Na+ uptake activity. The uptake of Na+ was enhanced by CCCP and nitrate. On the other hand, both CCCP and nitrate were shown to dissipate the preformed electric potential generated by Na+-stimulated ATPase of the proteoliposomes. Conclusion The data demonstrate that Na+-stimulated ATPase from A. halophytica, a likely member of F-type ATPase, functions as an electrogenic Na

Selfish Gene Algorithm Vs Genetic Algorithm: A Review

Science.gov (United States)

Ariff, Norharyati Md; Khalid, Noor Elaiza Abdul; Hashim, Rathiah; Noor, Noorhayati Mohamed

2016-11-01

Evolutionary algorithm is one of the algorithms inspired by the nature. Within little more than a decade hundreds of papers have reported successful applications of EAs. In this paper, the Selfish Gene Algorithms (SFGA), as one of the latest evolutionary algorithms (EAs) inspired from the Selfish Gene Theory which is an interpretation of Darwinian Theory ideas from the biologist Richards Dawkins on 1989. In this paper, following a brief introduction to the Selfish Gene Algorithm (SFGA), the chronology of its evolution is presented. It is the purpose of this paper is to present an overview of the concepts of Selfish Gene Algorithm (SFGA) as well as its opportunities and challenges. Accordingly, the history, step involves in the algorithm are discussed and its different applications together with an analysis of these applications are evaluated.

Algorithms

Indian Academy of Sciences (India)

to as 'divide-and-conquer'. Although there has been a large effort in realizing efficient algorithms, there are not many universally accepted algorithm design paradigms. In this article, we illustrate algorithm design techniques such as balancing, greedy strategy, dynamic programming strategy, and backtracking or traversal of ...

Polarization dependence of Na* + Na* associative ionization revisited

NARCIS (Netherlands)

Meijer, H.A.J.; Meulen, H.P. v.d.; Morgenstern, R.; Hertel, I.V.; Meyer, E.; Witte, R.

1986-01-01

The dependence of the associative ionization process Na 3 2P3/2 + Na 3 2P3/2 → Na2+ + e- on the polarization of the laser light used for Na excitation was independently investigated in Utrecht and Berlin. The purpose of this paper is to clarify discrepancies between two other earlier experimental

Algorithmic mathematics

CERN Document Server

Hougardy, Stefan

2016-01-01

Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.

Evaluation Technique of Chloride Penetration Using Apparent Diffusion Coefficient and Neural Network Algorithm

Directory of Open Access Journals (Sweden)

Yun-Yong Kim

2014-01-01

Full Text Available Diffusion coefficient from chloride migration test is currently used; however this cannot provide a conventional solution like total chloride contents since it depicts only ion migration velocity in electrical field. This paper proposes a simple analysis technique for chloride behavior using apparent diffusion coefficient from neural network algorithm with time-dependent diffusion phenomena. For this work, thirty mix proportions of high performance concrete are prepared and their diffusion coefficients are obtained after long term-NaCl submerged test. Considering time-dependent diffusion coefficient based on Fick’s 2nd Law and NNA (neural network algorithm, analysis technique for chloride penetration is proposed. The applicability of the proposed technique is verified through the results from accelerated test, long term submerged test, and field investigation results.

Essential algorithms a practical approach to computer algorithms

CERN Document Server

Stephens, Rod

2013-01-01

A friendly and accessible introduction to the most useful algorithms Computer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve difficult programming problems. Written in simple, intuitive English, this book describes how and when to use the most practical classic algorithms, and even how to create new algorithms to meet future needs. The book also includes a collection of questions that can help readers prepare for a programming job interview. Reveals methods for manipulating common data structures s

Algorithmic cryptanalysis

CERN Document Server

Joux, Antoine

2009-01-01

Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic

Denni Algorithm An Enhanced Of SMS (Scan, Move and Sort) Algorithm

Science.gov (United States)

Aprilsyah Lubis, Denni; Salim Sitompul, Opim; Marwan; Tulus; Andri Budiman, M.

2017-12-01

Sorting has been a profound area for the algorithmic researchers, and many resources are invested to suggest a more working sorting algorithm. For this purpose many existing sorting algorithms were observed in terms of the efficiency of the algorithmic complexity. Efficient sorting is important to optimize the use of other algorithms that require sorted lists to work correctly. Sorting has been considered as a fundamental problem in the study of algorithms that due to many reasons namely, the necessary to sort information is inherent in many applications, algorithms often use sorting as a key subroutine, in algorithm design there are many essential techniques represented in the body of sorting algorithms, and many engineering issues come to the fore when implementing sorting algorithms., Many algorithms are very well known for sorting the unordered lists, and one of the well-known algorithms that make the process of sorting to be more economical and efficient is SMS (Scan, Move and Sort) algorithm, an enhancement of Quicksort invented Rami Mansi in 2010. This paper presents a new sorting algorithm called Denni-algorithm. The Denni algorithm is considered as an enhancement on the SMS algorithm in average, and worst cases. The Denni algorithm is compared with the SMS algorithm and the results were promising.

Feature Reduction Based on Genetic Algorithm and Hybrid Model for Opinion Mining

Directory of Open Access Journals (Sweden)

P. Kalaivani

2015-01-01

Full Text Available With the rapid growth of websites and web form the number of product reviews is available on the sites. An opinion mining system is needed to help the people to evaluate emotions, opinions, attitude, and behavior of others, which is used to make decisions based on the user preference. In this paper, we proposed an optimized feature reduction that incorporates an ensemble method of machine learning approaches that uses information gain and genetic algorithm as feature reduction techniques. We conducted comparative study experiments on multidomain review dataset and movie review dataset in opinion mining. The effectiveness of single classifiers Naïve Bayes, logistic regression, support vector machine, and ensemble technique for opinion mining are compared on five datasets. The proposed hybrid method is evaluated and experimental results using information gain and genetic algorithm with ensemble technique perform better in terms of various measures for multidomain review and movie reviews. Classification algorithms are evaluated using McNemar’s test to compare the level of significance of the classifiers.

Gamma spectra analysis from a NaI(Tl) scintillation detector using a micro-computer

International Nuclear Information System (INIS)

Levinson, S.

1990-01-01

A software package of programs was devloped for qualitative and quantitative evaluation of gamma ray spectra obtained from a NaI(Tl) scintilation counter, by means of a micro-computer. The programs can easily be transformed for use with a Ge(Li) detector. The various algorithms enable automatic analyzing of a spectrum and also interactive or manual mode. The graphic programs display the measured spectrum as well as spectra of standard radionuclides which helps in the determination of peaks and related radionuclides in the spectrum. The peak search is carried out on a smoothed spectrum and is done by checking the behaviour of the second and third derivatives. The algorithm solves the problem of overlapping peaks and performs gaussian fitting, if necessary. Determination of the various radionuclides in the spectrum is done by linear minimum least squares techniques. Overall analysis of the radionuclides activities in the spectrum is obtained for samples of various counting geometries. In addition, a model was developed for efficiency calibration of flat 3X3 inch NaI(Tl) detectors for different samples measured in various counting geometries. It is based on point source experimental efficiency curve fitting. (author)

Pseudo-ternary phase diagram in the Na2O-Na2O2-NaOH system

International Nuclear Information System (INIS)

Saito, Jun-ichi; Tendo, Masayuki; Aoto, Kazumi

1997-10-01

Generally, the phase diagrams are always used to understand the present state of compounds at certain temperature. In order to understand the corrosion behavior of structural material for FBR by main sodium compounds (Na 2 O, Na 2 O 2 and NaOH), it is very important to comprehend the phase diagrams of their compounds. However, only Na 2 O-NaOH pseudo-binary phase diagram had been investigated previously in this system. There is no study of other pseudo-binary or ternary phase diagrams in the Na 2 O-Na 2 O 2 -NaOH system. In this study, in order to clarify the present states of their compounds at certain temperatures, the pseudo-binary and ternary phase diagrams in the Na 2 O-Na 2 O 2 -NaOH system were prepared. A series of thermal analyses with binary and ternary component system has been carried out using the differential scanning calorimetry (DSC). The liquidus temperature and ternary eutectic temperatures were confirmed by these measurements. The beneficial indications for constructing phase diagrams were obtained from these experiments. On the basis of these results, the interaction parameters between compounds which were utilized for the Thermo-Calc calculation were optimized. Thermo-Calc is one of thermodynamic calculation software. Consequently the accurate pseudo-binary and ternary phase diagrams were indicated using the optimized parameters. (author)

Python algorithms mastering basic algorithms in the Python language

CERN Document Server

Hetland, Magnus Lie

2014-01-01

Python Algorithms, Second Edition explains the Python approach to algorithm analysis and design. Written by Magnus Lie Hetland, author of Beginning Python, this book is sharply focused on classical algorithms, but it also gives a solid understanding of fundamental algorithmic problem-solving techniques. The book deals with some of the most important and challenging areas of programming and computer science in a highly readable manner. It covers both algorithmic theory and programming practice, demonstrating how theory is reflected in real Python programs. Well-known algorithms and data struc

Fall detection using supervised machine learning algorithms: A comparative study

KAUST Repository

Zerrouki, Nabil; Harrou, Fouzi; Houacine, Amrane; Sun, Ying

2017-01-01

Fall incidents are considered as the leading cause of disability and even mortality among older adults. To address this problem, fall detection and prevention fields receive a lot of intention over the past years and attracted many researcher efforts. We present in the current study an overall performance comparison between fall detection systems using the most popular machine learning approaches which are: Naïve Bayes, K nearest neighbor, neural network, and support vector machine. The analysis of the classification power associated to these most widely utilized algorithms is conducted on two fall detection databases namely FDD and URFD. Since the performance of the classification algorithm is inherently dependent on the features, we extracted and used the same features for all classifiers. The classification evaluation is conducted using different state of the art statistical measures such as the overall accuracy, the F-measure coefficient, and the area under ROC curve (AUC) value.

Fall detection using supervised machine learning algorithms: A comparative study

KAUST Repository

Zerrouki, Nabil

2017-01-05

Fall incidents are considered as the leading cause of disability and even mortality among older adults. To address this problem, fall detection and prevention fields receive a lot of intention over the past years and attracted many researcher efforts. We present in the current study an overall performance comparison between fall detection systems using the most popular machine learning approaches which are: Naïve Bayes, K nearest neighbor, neural network, and support vector machine. The analysis of the classification power associated to these most widely utilized algorithms is conducted on two fall detection databases namely FDD and URFD. Since the performance of the classification algorithm is inherently dependent on the features, we extracted and used the same features for all classifiers. The classification evaluation is conducted using different state of the art statistical measures such as the overall accuracy, the F-measure coefficient, and the area under ROC curve (AUC) value.

A potential theory approach to an algorithm of conceptual space partitioning

Directory of Open Access Journals (Sweden)

Roman Urban

2017-12-01

Full Text Available A potential theory approach to an algorithm of conceptual space partitioning This paper proposes a new classification algorithm for the partitioning of a conceptual space. All the algorithms which have been used until now have mostly been based on the theory of Voronoi diagrams. This paper proposes an approach based on potential theory, with the criteria for measuring similarities between objects in the conceptual space being based on the Newtonian potential function. The notion of a fuzzy prototype, which generalizes the previous definition of a prototype, is introduced. Furthermore, the necessary conditions that a natural concept must meet are discussed. Instead of convexity, as proposed by Gärdenfors, the notion of geodesically convex sets is used. Thus, if a concept corresponds to a set which is geodesically convex, it is a natural concept. This definition applies, for example, if the conceptual space is an Euclidean space. As a by-product of the construction of the algorithm, an extension of the conceptual space to d-dimensional Riemannian manifolds is obtained.   Algorytm podziału przestrzeni konceptualnych przy użyciu teorii potencjału W niniejszej pracy zaproponowany został nowy algorytm podziału przestrzeni konceptualnej. Dotąd podział taki zazwyczaj wykorzystywał teorię diagramów Voronoi. Nasze podejście do problemu oparte jest na teorii potencjału Miara podobieństwa pomiędzy elementami przestrzeni konceptualnej bazuje na Newtonowskiej funkcji potencjału. Definiujemy pojęcie rozmytego prototypu, który uogólnia dotychczas stosowane definicje prototypu. Ponadto zajmujemy się warunkiem koniecznym, który musi spełniać naturalny koncept. Zamiast wypukłości zaproponowanej przez Gärdenforsa, rozważamy linie geodezyjne w obszarze odpowiadającym danemu konceptowi naturalnemu, otrzymując warunek mówiący, że koncept jest konceptem naturalnym, jeżeli zbiór odpowiadający temu konceptowi jest geodezyjnie wypuk

Hybrid Cryptosystem Using Tiny Encryption Algorithm and LUC Algorithm

Science.gov (United States)

Rachmawati, Dian; Sharif, Amer; Jaysilen; Andri Budiman, Mohammad

2018-01-01

Security becomes a very important issue in data transmission and there are so many methods to make files more secure. One of that method is cryptography. Cryptography is a method to secure file by writing the hidden code to cover the original file. Therefore, if the people do not involve in cryptography, they cannot decrypt the hidden code to read the original file. There are many methods are used in cryptography, one of that method is hybrid cryptosystem. A hybrid cryptosystem is a method that uses a symmetric algorithm to secure the file and use an asymmetric algorithm to secure the symmetric algorithm key. In this research, TEA algorithm is used as symmetric algorithm and LUC algorithm is used as an asymmetric algorithm. The system is tested by encrypting and decrypting the file by using TEA algorithm and using LUC algorithm to encrypt and decrypt the TEA key. The result of this research is by using TEA Algorithm to encrypt the file, the cipher text form is the character from ASCII (American Standard for Information Interchange) table in the form of hexadecimal numbers and the cipher text size increase by sixteen bytes as the plaintext length is increased by eight characters.

Extracellular Na+ levels regulate formation and activity of the NaX/alpha1-Na+/K+-ATPase complex in neuronal cells.

Directory of Open Access Journals (Sweden)

Emmanuelle eBerret

2014-12-01

Full Text Available MnPO neurons play a critical role in hydromineral homeostasis regulation by acting as sensors of extracellular sodium concentration ([Na+]out. The mechanism underlying Na+-sensing involves Na+-flow through the NaX channel, directly regulated by the Na+/K+-ATPase α1-isoform which controls Na+-influx by modulating channel permeability. Together, these two partners form a complex involved in the regulation of intracellular sodium ([Na+]in. Here we aim to determine whether environmental changes in Na+ could actively modulate the NaX/Na+/K+-ATPase complex activity.We investigated the complex activity using patch-clamp recordings from rat MnPO neurons and Neuro2a cells. When the rats were fed with a high-salt-diet, or the [Na+] in the culture medium was increased, the activity of the complex was up-regulated. In contrast, drop in environmental [Na+] decreased the activity of the complex. Interestingly under hypernatremic condition, the colocalization rate and protein level of both partners were up-regulated. Under hyponatremic condition, only NaX protein expression was increased and the level of NaX/Na+/K+-ATPase remained unaltered. This unbalance between NaX and Na+/K+-ATPase pump proportion would induce a bigger portion of Na+/K+-ATPase-control-free NaX channel. Thus we suggest that hypernatremic environment increases NaX/Na+/K+-ATPase α1-isoform activity by increasing the number of both partners and their colocalization rate, whereas hyponatremic environment down-regulates complex activity via a decrease in the relative number of NaX channels controlled by the pump.

Sound algorithms

OpenAIRE

De Götzen , Amalia; Mion , Luca; Tache , Olivier

2007-01-01

International audience; We call sound algorithms the categories of algorithms that deal with digital sound signal. Sound algorithms appeared in the very infancy of computer. Sound algorithms present strong specificities that are the consequence of two dual considerations: the properties of the digital sound signal itself and its uses, and the properties of auditory perception.

A Study of the Distribution of Sodium Cations in the Zeolites NaX, NaY and ZnNaY Using Carbon Monoxide Adsorption and 23Na NMR Techniques

Science.gov (United States)

Seidel, A.; Boddenberg, B.

1995-03-01

The zeolites NaX, NaY, Zn(55)NaY, and Zn(74)NaY were investigated by means of carbon monoxide adsorption and with static and magic angle spinning (MAS) 23Na NMR spectroscopy. The Na+ distribution between the sodalite (ß)- and supercages of the fully hydrated zeolites NaX and NaY were found to agree with XRD results. In the hydrated zinc-exchanged zeolites the Na+ ions almost exclusively populate the ß-cages. The adsorption isotherms of CO in the dehydrated zeolites were analyzed quantitatively to yield the concentrations of Na+ residing in the supercages. The measured static and MAS 23Na NMR spectra were analyzed by comparing their widths and shapes with simulated central transition patterns and yield, inter alia, the concentrations of Na+ associated with the spectrum components. Arguments are put forward that 23Na NMR of dehydrated zeolites is well suited to distinguish Na+ cations in highly symmetric environments and mobile Na+ species from others located on general positions, but further resolution is hardly feasible.

HCO3(-)-coupled Na+ influx is a major determinant of Na+ turnover and Na+/K+ pump activity in rat hepatocytes

International Nuclear Information System (INIS)

Fitz, J.G.; Lidofsky, S.D.; Weisiger, R.A.; Xie, M.H.; Cochran, M.; Grotmol, T.; Scharschmidt, B.F.

1991-01-01

Recent studies in hepatocytes indicate that Na(+)-coupled HCO3- transport contributes importantly to regulation of intracellular pH and membrane HCO3- transport. However, the direction of net coupled Na+ and HCO3- movement and the effect of HCO3- on Na+ turnover and Na+/K+ pump activity are not known. In these studies, the effect of HCO3- on Na+ influx and turnover were measured in primary rat hepatocyte cultures with 22Na+, and [Na+]i was measured in single hepatocytes using the Na(+)-sensitive fluorochrome SBFI. Na+/K+ pump activity was measured in intact perfused rat liver and hepatocyte monolayers as Na(+)-dependent or ouabain-suppressible 86Rb uptake, and was measured in single hepatocytes as the effect of transient pump inhibition by removal of extracellular K+ on membrane potential difference (PD) and [Na+]i. In hepatocyte monolayers, HCO3- increased 22Na+ entry and turnover rates by 50-65%, without measurably altering 22Na+ pool size or cell volume, and HCO3- also increased Na+/K+ pump activity by 70%. In single cells, exposure to HCO3- produced an abrupt and sustained rise in [Na+]i from approximately 8 to 12 mM. Na+/K+ pump activity assessed in single cells by PD excursions during transient K+ removal increased congruent to 2.5-fold in the presence of HCO3-, and the rise in [Na+]i produced by inhibition of the Na+/K+ pump was similarly increased congruent to 2.5-fold in the presence of HCO3-. In intact perfused rat liver, HCO3- increased both Na+/K+ pump activity and O2 consumption. These findings indicate that, in hepatocytes, net coupled Na+ and HCO3- movement is inward and represents a major determinant of Na+ influx and Na+/K+ pump activity. About half of hepatic Na+/K+ pump activity appears dedicated to recycling Na+ entering in conjunction with HCO3- to maintain [Na+]i within the physiologic range

The effect of Na vapor on the Na content of chondrules

Science.gov (United States)

Lewis, R. Dean; Lofgren, Gary E.; Franzen, Hugo F.; Windom, Kenneth E.

1993-01-01

Chondrules contain higher concentrations of volatiles (Na) than expected for melt droplets in the solar nebula. Recent studies have proposed that chondrules may have formed under non-canonical nebular conditions such as in particle/gas-rich clumps. Such chondrule formation areas may have contained significant Na vapor. To test the hypothesis of whether a Na-rich vapor would minimize Na volatilization reaction rates in a chondrule analog and maintain the Na value of the melt, experiments were designed where a Na-rich vapor could be maintained around the sample. A starting material with a melting point lower that typical chondrules was required to keep the logistics of working with Na volatilization from NaCl within the realm of feasibility. The Knippa basalt, a MgO-rich alkali olivine basalt with a melting temperature of 1325 +/- 5 C and a Na2O content of 3.05 wt%, was used as the chondrule analog. Experiments were conducted in a 1 atm, gas-mixing furnace with the fO2 controlled by a CO/CO2 gas mixture and fixed at the I-W buffer curve. To determine the extent of Na loss from the sample, initial experiments were conducted at high temperatures (1300 C - 1350 C) for duration of up to 72 h without a Na-rich vapor present. Almost all (up to 98%) Na was volatilized in runs of 72 h. Subsequent trials were conducted at 1330 C for 16 h in the presence of a Na-rich vapor, supplied by a NaCl-filled crucible placed in the bottom of the furnace. Succeeding Knudsen cell weight-loss mass-spectrometry analysis of NaCl determined the P(sub Na) for these experimental conditions to be in the 10(exp -6) atm range. This value is considered high for nebula conditions but is still plausible for non-canonical environments. In these trials the Na2O content of the glass was maintained or in some cases increased; Na2O values ranged from 2.62% wt to 4.37% wt. The Na content of chondrules may be controlled by the Na vapor pressure in the chondrule formation region. Most heating events capable

Genetic algorithms

Science.gov (United States)

Wang, Lui; Bayer, Steven E.

1991-01-01

Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.

The trigger for $K^0 \\rightarrow \\pi^{0}\\pi^{0}$ decays of the NA48 experiment at CERN

OpenAIRE

Barr, Giles David; Cundy, Donald C; Formenti, F; Gorini, B; Hallgren, Björn I; Iwanski, W; Kapusta, P; Laverrière, G C; Lenti, M; Mikulec, I; Velasco, M; Vossnack, O; Wahl, H; Ziolkowski, M; Porcu, M

2001-01-01

The trigger used for the collection of the samples of $K^{0}$ yields $\\pi^{0}\\pi^{0}$ decays in the NA48 experiment at CERN uses a novel pipeline design in order to satisfy the demanding specifications of a high rate kaon beam. The trigger algorithms, architecture and performance are described.

Na/K pump inactivation, subsarcolemmal Na measurements, and cytoplasmic ion turnover kinetics contradict restricted Na spaces in murine cardiac myocytes.

Science.gov (United States)

Lu, Fang-Min; Hilgemann, Donald W

2017-07-03

Decades ago, it was proposed that Na transport in cardiac myocytes is modulated by large changes in cytoplasmic Na concentration within restricted subsarcolemmal spaces. Here, we probe this hypothesis for Na/K pumps by generating constitutive transsarcolemmal Na flux with the Na channel opener veratridine in whole-cell patch-clamp recordings. Using 25 mM Na in the patch pipette, pump currents decay strongly during continuous activation by extracellular K (τ, ∼2 s). In contradiction to depletion hypotheses, the decay becomes stronger when pump currents are decreased by hyperpolarization. Na channel currents are nearly unchanged by pump activity in these conditions, and conversely, continuous Na currents up to 0.5 nA in magnitude have negligible effects on pump currents. These outcomes are even more pronounced using 50 mM Li as a cytoplasmic Na congener. Thus, the Na/K pump current decay reflects mostly an inactivation mechanism that immobilizes Na/K pump charge movements, not cytoplasmic Na depletion. When channel currents are increased beyond 1 nA, models with unrestricted subsarcolemmal diffusion accurately predict current decay (τ ∼15 s) and reversal potential shifts observed for Na, Li, and K currents through Na channels opened by veratridine, as well as for Na, K, Cs, Li, and Cl currents recorded in nystatin-permeabilized myocytes. Ion concentrations in the pipette tip (i.e., access conductance) track without appreciable delay the current changes caused by sarcolemmal ion flux. Importantly, cytoplasmic mixing volumes, calculated from current decay kinetics, increase and decrease as expected with osmolarity changes (τ >30 s). Na/K pump current run-down over 20 min reflects a failure of pumps to recover from inactivation. Simulations reveal that pump inactivation coupled with Na-activated recovery enhances the rapidity and effectivity of Na homeostasis in cardiac myocytes. In conclusion, an autoregulatory mechanism enhances cardiac Na/K pump activity when

Algorithm aversion: people erroneously avoid algorithms after seeing them err.

Science.gov (United States)

Dietvorst, Berkeley J; Simmons, Joseph P; Massey, Cade

2015-02-01

Research shows that evidence-based algorithms more accurately predict the future than do human forecasters. Yet when forecasters are deciding whether to use a human forecaster or a statistical algorithm, they often choose the human forecaster. This phenomenon, which we call algorithm aversion, is costly, and it is important to understand its causes. We show that people are especially averse to algorithmic forecasters after seeing them perform, even when they see them outperform a human forecaster. This is because people more quickly lose confidence in algorithmic than human forecasters after seeing them make the same mistake. In 5 studies, participants either saw an algorithm make forecasts, a human make forecasts, both, or neither. They then decided whether to tie their incentives to the future predictions of the algorithm or the human. Participants who saw the algorithm perform were less confident in it, and less likely to choose it over an inferior human forecaster. This was true even among those who saw the algorithm outperform the human.

The Texas Medication Algorithm Project (TMAP) schizophrenia algorithms.

Science.gov (United States)

Miller, A L; Chiles, J A; Chiles, J K; Crismon, M L; Rush, A J; Shon, S P

1999-10-01

In the Texas Medication Algorithm Project (TMAP), detailed guidelines for medication management of schizophrenia and related disorders, bipolar disorders, and major depressive disorders have been developed and implemented. This article describes the algorithms developed for medication treatment of schizophrenia and related disorders. The guidelines recommend a sequence of medications and discuss dosing, duration, and switch-over tactics. They also specify response criteria at each stage of the algorithm for both positive and negative symptoms. The rationale and evidence for each aspect of the algorithms are presented.

Na+/Ca2+ exchange and Na+/K+-ATPase in the heart

Science.gov (United States)

Shattock, Michael J; Ottolia, Michela; Bers, Donald M; Blaustein, Mordecai P; Boguslavskyi, Andrii; Bossuyt, Julie; Bridge, John H B; Chen-Izu, Ye; Clancy, Colleen E; Edwards, Andrew; Goldhaber, Joshua; Kaplan, Jack; Lingrel, Jerry B; Pavlovic, Davor; Philipson, Kenneth; Sipido, Karin R; Xie, Zi-Jian

2015-01-01

This paper is the third in a series of reviews published in this issue resulting from the University of California Davis Cardiovascular Symposium 2014: Systems approach to understanding cardiac excitation–contraction coupling and arrhythmias: Na+ channel and Na+ transport. The goal of the symposium was to bring together experts in the field to discuss points of consensus and controversy on the topic of sodium in the heart. The present review focuses on cardiac Na+/Ca2+ exchange (NCX) and Na+/K+-ATPase (NKA). While the relevance of Ca2+ homeostasis in cardiac function has been extensively investigated, the role of Na+ regulation in shaping heart function is often overlooked. Small changes in the cytoplasmic Na+ content have multiple effects on the heart by influencing intracellular Ca2+ and pH levels thereby modulating heart contractility. Therefore it is essential for heart cells to maintain Na+ homeostasis. Among the proteins that accomplish this task are the Na+/Ca2+ exchanger (NCX) and the Na+/K+ pump (NKA). By transporting three Na+ ions into the cytoplasm in exchange for one Ca2+ moved out, NCX is one of the main Na+ influx mechanisms in cardiomyocytes. Acting in the opposite direction, NKA moves Na+ ions from the cytoplasm to the extracellular space against their gradient by utilizing the energy released from ATP hydrolysis. A fine balance between these two processes controls the net amount of intracellular Na+ and aberrations in either of these two systems can have a large impact on cardiac contractility. Due to the relevant role of these two proteins in Na+ homeostasis, the emphasis of this review is on recent developments regarding the cardiac Na+/Ca2+ exchanger (NCX1) and Na+/K+ pump and the controversies that still persist in the field. PMID:25772291

Algorithming the Algorithm

DEFF Research Database (Denmark)

Mahnke, Martina; Uprichard, Emma

2014-01-01

Imagine sailing across the ocean. The sun is shining, vastness all around you. And suddenly [BOOM] you’ve hit an invisible wall. Welcome to the Truman Show! Ever since Eli Pariser published his thoughts on a potential filter bubble, this movie scenario seems to have become reality, just with slight...... changes: it’s not the ocean, it’s the internet we’re talking about, and it’s not a TV show producer, but algorithms that constitute a sort of invisible wall. Building on this assumption, most research is trying to ‘tame the algorithmic tiger’. While this is a valuable and often inspiring approach, we...

Pseudo-deterministic Algorithms

OpenAIRE

Goldwasser , Shafi

2012-01-01

International audience; In this talk we describe a new type of probabilistic algorithm which we call Bellagio Algorithms: a randomized algorithm which is guaranteed to run in expected polynomial time, and to produce a correct and unique solution with high probability. These algorithms are pseudo-deterministic: they can not be distinguished from deterministic algorithms in polynomial time by a probabilistic polynomial time observer with black box access to the algorithm. We show a necessary an...

The Algorithmic Imaginary

DEFF Research Database (Denmark)

Bucher, Taina

2017-01-01

the notion of the algorithmic imaginary. It is argued that the algorithmic imaginary – ways of thinking about what algorithms are, what they should be and how they function – is not just productive of different moods and sensations but plays a generative role in moulding the Facebook algorithm itself...... of algorithms affect people's use of these platforms, if at all? To help answer these questions, this article examines people's personal stories about the Facebook algorithm through tweets and interviews with 25 ordinary users. To understand the spaces where people and algorithms meet, this article develops...

Altered Na+ transport after an intracellular alpha-subunit deletion reveals strict external sequential release of Na+ from the Na/K pump.

Science.gov (United States)

Yaragatupalli, Siddhartha; Olivera, J Fernando; Gatto, Craig; Artigas, Pablo

2009-09-08

The Na/K pump actively exports 3 Na(+) in exchange for 2 K(+) across the plasmalemma of animal cells. As in other P-type ATPases, pump function is more effective when the relative affinity for transported ions is altered as the ion binding sites alternate between opposite sides of the membrane. Deletion of the five C-terminal residues from the alpha-subunit diminishes internal Na(+) (Na(i)(+)) affinity approximately 25-fold [Morth et al. (2007) Nature 450:1043-1049]. Because external Na(+) (Na(o)(+)) binding is voltage-dependent, we studied the reactions involving this process by using two-electrode and inside-out patch voltage clamp in normal and truncated (DeltaKESYY) Xenopus-alpha1 pumps expressed in oocytes. We observed that DeltaKESYY (i) decreased both Na(o)(+) and Na(i)(+) apparent affinities in the absence of K(o)(+), and (ii) did not affect apparent Na(o)(+) affinity at high K(o)(+). These results support a model of strict sequential external release of Na(+) ions, where the Na(+)-exclusive site releases Na(+) before the sites shared with K(+) and the DeltaKESYY deletion only reduces Na(o)(+) affinity at the shared sites. Moreover, at nonsaturating K(o)(+), DeltaKESYY induced an inward flow of Na(+) through Na/K pumps at negative potentials. Guanidinium(+) can also permeate truncated pumps, whereas N-methyl-D-glucamine cannot. Because guanidinium(o)(+) can also traverse normal Na/K pumps in the absence of both Na(o)(+) and K(o)(+) and can also inhibit Na/K pump currents in a Na(+)-like voltage-dependent manner, we conclude that the normal pathway transited by the first externally released Na(+) is large enough to accommodate guanidinium(+).

An Adaptive Filtering Algorithm Based on Genetic Algorithm-Backpropagation Network

Directory of Open Access Journals (Sweden)

Kai Hu

2013-01-01

Full Text Available A new image filtering algorithm is proposed. GA-BPN algorithm uses genetic algorithm (GA to decide weights in a back propagation neural network (BPN. It has better global optimal characteristics than traditional optimal algorithm. In this paper, we used GA-BPN to do image noise filter researching work. Firstly, this paper uses training samples to train GA-BPN as the noise detector. Then, we utilize the well-trained GA-BPN to recognize noise pixels in target image. And at last, an adaptive weighted average algorithm is used to recover noise pixels recognized by GA-BPN. Experiment data shows that this algorithm has better performance than other filters.

Nature-inspired optimization algorithms

CERN Document Server

Yang, Xin-She

2014-01-01

Nature-Inspired Optimization Algorithms provides a systematic introduction to all major nature-inspired algorithms for optimization. The book's unified approach, balancing algorithm introduction, theoretical background and practical implementation, complements extensive literature with well-chosen case studies to illustrate how these algorithms work. Topics include particle swarm optimization, ant and bee algorithms, simulated annealing, cuckoo search, firefly algorithm, bat algorithm, flower algorithm, harmony search, algorithm analysis, constraint handling, hybrid methods, parameter tuning

Convex hull ranking algorithm for multi-objective evolutionary algorithms

NARCIS (Netherlands)

Davoodi Monfrared, M.; Mohades, A.; Rezaei, J.

2012-01-01

Due to many applications of multi-objective evolutionary algorithms in real world optimization problems, several studies have been done to improve these algorithms in recent years. Since most multi-objective evolutionary algorithms are based on the non-dominated principle, and their complexity

Total algorithms

NARCIS (Netherlands)

Tel, G.

We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of

Active transport of Na+ by reconstituted Na,K-ATPase

International Nuclear Information System (INIS)

Boldyrev, A.A.; Svinukhova, I.A.

1987-01-01

The ability of ATP, CTP, ITP, GTP, and UTP to support ouabain-sensitive accumulation of Na + by proteoliposomes with a reconstituted Na/K-pump was investigated. At a low [Na + ]/[K + ] ratio in the medium (20 mM/50 mM), a correlation is observed between the proton-accepting capacity of the nucleotide and its effectiveness as a substrate of active transport. To test the hypothesis of the importance of the presence of a negative charge in the 1-position of the purine (3-pyrimidine) base of the nucleotide for mutual transitions between the Na- and K-conformations of Na,K-ATPase they used two analogs of ATP: N 1 -hydroxy-ATP, possessing proton acceptor capacity, and N 1 -methoxy-ATP, in the molecule of which the negative charge is quenched by a methyl group. The first substrate supports active accumulation of Na + in proteoliposomes at the same rate as ATP, whereas the second substrate is relatively ineffective

Investigation on U - O - Na, Pu - O - Na and U,Pu - O - Na phase diagrams

International Nuclear Information System (INIS)

Pillon, S.

1989-03-01

The thermochemical interaction between the nuclear fuel (uranium and plutonium mixed oxides) and the sodium has been investigated and particularly the three phase diagrams: U - O - Na; Pu - O - Na; U,Pu - O - Na. High temperature neutron diffraction, microcalorimetry and powder X-ray diffraction were used for the characterization of the compounds synthetized. This study allowed to complete the knowledge about each of these diagrams and to measure some physical and thermal properties on the compounds. The limits on the modelization of the fuel-sodium interaction are discussed from the results of the UO 2 - Na reaction [fr

Progressive geometric algorithms

NARCIS (Netherlands)

Alewijnse, S.P.A.; Bagautdinov, T.M.; de Berg, M.T.; Bouts, Q.W.; ten Brink, Alex P.; Buchin, K.A.; Westenberg, M.A.

2015-01-01

Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, and develop efficient progressive algorithms

Progressive geometric algorithms

NARCIS (Netherlands)

Alewijnse, S.P.A.; Bagautdinov, T.M.; Berg, de M.T.; Bouts, Q.W.; Brink, ten A.P.; Buchin, K.; Westenberg, M.A.

2014-01-01

Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, and develop efficient progressive algorithms

Measurement of exchangeable sodium: 22Na or 24Na

International Nuclear Information System (INIS)

Smith, T.; Edmonds, C.J.

1987-01-01

A case is made for the use of 22 Na in low activities in preference to 24 Na for routine diagnostic estimation of exchangeable sodium, and is based chiefly on considerations of availability, cost and radiation dosimetry. A method in which only 37 kBq (1 μCi) 22 Na is administered orally is shown to be sufficiently accurate and to possess distinct advantages in terms of cost and convenience with a committed radiation dose no greater than that for a measurement using 24 Na. (author)

Archimedean copula estimation of distribution algorithm based on artificial bee colony algorithm

Institute of Scientific and Technical Information of China (English)

Haidong Xu; Mingyan Jiang; Kun Xu

2015-01-01

The artificial bee colony (ABC) algorithm is a com-petitive stochastic population-based optimization algorithm. How-ever, the ABC algorithm does not use the social information and lacks the knowledge of the problem structure, which leads to in-sufficiency in both convergent speed and searching precision. Archimedean copula estimation of distribution algorithm (ACEDA) is a relatively simple, time-economic and multivariate correlated EDA. This paper proposes a novel hybrid algorithm based on the ABC algorithm and ACEDA cal ed Archimedean copula estima-tion of distribution based on the artificial bee colony (ACABC) algorithm. The hybrid algorithm utilizes ACEDA to estimate the distribution model and then uses the information to help artificial bees to search more efficiently in the search space. Six bench-mark functions are introduced to assess the performance of the ACABC algorithm on numerical function optimization. Experimen-tal results show that the ACABC algorithm converges much faster with greater precision compared with the ABC algorithm, ACEDA and the global best (gbest)-guided ABC (GABC) algorithm in most of the experiments.

Theoretical study of weakly bound vibrational states of the sodium trimer. Numerical methods; prospects for the formation of Na3 in an ultracold gas

International Nuclear Information System (INIS)

Willner, K.

2006-01-01

A Mapped Fourier Grid method for solving the radial Schroedinger equation is improved. It is observed that a discrete sine and cosine transform algorithm allows to compute a Hamiltonian matrix the spectrum of which is free of spurious eigenvalues. - The energies of the highest, least bound vibrational states of the Na - Na 2 van der Waals complex are computed using a hyperspherical diabatic-by-sector method. The computed levels are analyzed using quantum defect theory. (orig.)

Suppression of Na interstitials in Na-F codoped ZnO

Science.gov (United States)

Huo, Wenxing; Mei, Zengxia; Tang, Aihua; Liang, Huili; Du, Xiaolong

2018-04-01

Controlling the formation of interstitial Na (Nai) self-compensating defects has been a long-term physics problem for effective Na doping in ZnO. Herein, we present an experimental approach to the suppression of Nai defects in ZnO via Na and F codoping under an oxygen-rich condition during the molecular beam epitaxy growth process. It is found that the incorporation of such large numbers of Na and F dopants (˜1020 cm-3) does not cause an obvious influence on the lattice parameters. Hall-effect measurements demonstrate that F doping efficiently raises the Fermi level (EF) of ZnO films, which is expected to make the formation energy of Nai and NaZn increase and decrease, respectively. Most of the Na atoms occupy the substitutional Zn sites, and the formation of Nai is suppressed consequently. Secondary ion mass spectrometry measurements reveal that F and Na atoms are tightly bonded together due to their strong Coulomb interaction. The enhanced deep level emission (DLE) in ZnO:Na-F is ascribed to the considerable amount of isolated Zn vacancy (VZn) defects induced by the elevated EF and the formation of neutral (" separators="| FO + - Na Zn - ) 0 complexes. On the other hand, formation of (" separators="| FO + - VZn 2 - ) - complexes in ZnO:F exhausts most of the isolated Zn vacancies, leading to the disappearance of the DLE band.

A filtered backprojection algorithm with characteristics of the iterative landweber algorithm

OpenAIRE

L. Zeng, Gengsheng

2012-01-01

Purpose: In order to eventually develop an analytical algorithm with noise characteristics of an iterative algorithm, this technical note develops a window function for the filtered backprojection (FBP) algorithm in tomography that behaves as an iterative Landweber algorithm.

OGLAŠEVANJE NA DRUŽBENIH OMREŽJIH NA PRIMERU FACEBOOKA

OpenAIRE

Novak, Martina

2012-01-01

V diplomskem delu obravnavamo družbene medije kot novo priložnost za promocijo in oglaševanje podjetij. Spoznali smo družbena omrežja na splošno in nekaj teh, ki jih uporabljamo tudi v Sloveniji na kratko predstavili. Podrobneje smo se osredotočili na družbeno omrežje Facebook, predvsem na samo spletno stran, njen izgled in storitve, ki jih ponuja uporabnikom. V nalogi je podrobneje opisan Facebook kot orodje za uporabo oglaševanja. Spoznali smo brezplačne in plačljive načine promocije in ogl...

Na+,K+-ATPase Na+ affinity in rat skeletal muscle fiber types

DEFF Research Database (Denmark)

Kristensen, Michael; Juel, Carsten

2010-01-01

Previous studies in expression systems have found different ion activation of the Na(+)/K(+)-ATPase isozymes, which suggest that different muscles have different ion affinities. The rate of ATP hydrolysis was used to quantify Na(+),K(+)-ATPase activity, and the Na(+) affinity of Na(+),K(+)-ATPase...

Crystal structure of Na+, K(+)-ATPase in the Na(+)-bound state.

Science.gov (United States)

Nyblom, Maria; Poulsen, Hanne; Gourdon, Pontus; Reinhard, Linda; Andersson, Magnus; Lindahl, Erik; Fedosova, Natalya; Nissen, Poul

2013-10-04

The Na(+), K(+)-adenosine triphosphatase (ATPase) maintains the electrochemical gradients of Na(+) and K(+) across the plasma membrane--a prerequisite for electrical excitability and secondary transport. Hitherto, structural information has been limited to K(+)-bound or ouabain-blocked forms. We present the crystal structure of a Na(+)-bound Na(+), K(+)-ATPase as determined at 4.3 Å resolution. Compared with the K(+)-bound form, large conformational changes are observed in the α subunit whereas the β and γ subunit structures are maintained. The locations of the three Na(+) sites are indicated with the unique site III at the recently suggested IIIb, as further supported by electrophysiological studies on leak currents. Extracellular release of the third Na(+) from IIIb through IIIa, followed by exchange of Na(+) for K(+) at sites I and II, is suggested.

Super-Encryption Implementation Using Monoalphabetic Algorithm and XOR Algorithm for Data Security

Science.gov (United States)

Rachmawati, Dian; Andri Budiman, Mohammad; Aulia, Indra

2018-03-01

The exchange of data that occurs offline and online is very vulnerable to the threat of data theft. In general, cryptography is a science and art to maintain data secrecy. An encryption is a cryptography algorithm in which data is transformed into cipher text, which is something that is unreadable and meaningless so it cannot be read or understood by other parties. In super-encryption, two or more encryption algorithms are combined to make it more secure. In this work, Monoalphabetic algorithm and XOR algorithm are combined to form a super- encryption. Monoalphabetic algorithm works by changing a particular letter into a new letter based on existing keywords while the XOR algorithm works by using logic operation XOR Since Monoalphabetic algorithm is a classical cryptographic algorithm and XOR algorithm is a modern cryptographic algorithm, this scheme is expected to be both easy-to-implement and more secure. The combination of the two algorithms is capable of securing the data and restoring it back to its original form (plaintext), so the data integrity is still ensured.

Level Zero Trigger Processor for the NA62 experiment

Science.gov (United States)

Soldi, D.; Chiozzi, S.

2018-05-01

The NA62 experiment is designed to measure the ultra-rare decay K+ arrow π+ ν bar nu branching ratio with a precision of ~ 10% at the CERN Super Proton Synchrotron (SPS). The trigger system of NA62 consists in three different levels designed to select events of physics interest in a high beam rate environment. The L0 Trigger Processor (L0TP) is the lowest level system of the trigger chain. It is hardware implemented using programmable logic. The architecture of the NA62 L0TP system is a new approach compared to existing systems used in high-energy physics experiments. It is fully digital, based on a standard gigabit Ethernet communication between detectors and the L0TP Board. The L0TP Board is a commercial development board, mounting a programmable logic device (FPGA). The primitives generated by sub-detectors are sent asynchronously using the UDP protocol to the L0TP during the entire beam spill period. The L0TP realigns in time the primitives coming from seven different sources and performs a data selection based on the characteristics of the event such as energy, multiplicity and topology of hits in the sub-detectors. It guarantees a maximum latency of 1 ms. The maximum input rate is about 10 MHz for each sub-detector, while the design maximum output trigger rate is 1 MHz. A description of the trigger algorithm is presented here.

Linear feature detection algorithm for astronomical surveys - I. Algorithm description

Science.gov (United States)

Bektešević, Dino; Vinković, Dejan

2017-11-01

Computer vision algorithms are powerful tools in astronomical image analyses, especially when automation of object detection and extraction is required. Modern object detection algorithms in astronomy are oriented towards detection of stars and galaxies, ignoring completely the detection of existing linear features. With the emergence of wide-field sky surveys, linear features attract scientific interest as possible trails of fast flybys of near-Earth asteroids and meteors. In this work, we describe a new linear feature detection algorithm designed specifically for implementation in big data astronomy. The algorithm combines a series of algorithmic steps that first remove other objects (stars and galaxies) from the image and then enhance the line to enable more efficient line detection with the Hough algorithm. The rate of false positives is greatly reduced thanks to a step that replaces possible line segments with rectangles and then compares lines fitted to the rectangles with the lines obtained directly from the image. The speed of the algorithm and its applicability in astronomical surveys are also discussed.

Golden Sine Algorithm: A Novel Math-Inspired Algorithm

Directory of Open Access Journals (Sweden)

TANYILDIZI, E.

2017-05-01

Full Text Available In this study, Golden Sine Algorithm (Gold-SA is presented as a new metaheuristic method for solving optimization problems. Gold-SA has been developed as a new search algorithm based on population. This math-based algorithm is inspired by sine that is a trigonometric function. In the algorithm, random individuals are created as many as the number of search agents with uniform distribution for each dimension. The Gold-SA operator searches to achieve a better solution in each iteration by trying to bring the current situation closer to the target value. The solution space is narrowed by the golden section so that the areas that are supposed to give only good results are scanned instead of the whole solution space scan. In the tests performed, it is seen that Gold-SA has better results than other population based methods. In addition, Gold-SA has fewer algorithm-dependent parameters and operators than other metaheuristic methods, increasing the importance of this method by providing faster convergence of this new method.

The Orthogonally Partitioned EM Algorithm: Extending the EM Algorithm for Algorithmic Stability and Bias Correction Due to Imperfect Data.

Science.gov (United States)

Regier, Michael D; Moodie, Erica E M

2016-05-01

We propose an extension of the EM algorithm that exploits the common assumption of unique parameterization, corrects for biases due to missing data and measurement error, converges for the specified model when standard implementation of the EM algorithm has a low probability of convergence, and reduces a potentially complex algorithm into a sequence of smaller, simpler, self-contained EM algorithms. We use the theory surrounding the EM algorithm to derive the theoretical results of our proposal, showing that an optimal solution over the parameter space is obtained. A simulation study is used to explore the finite sample properties of the proposed extension when there is missing data and measurement error. We observe that partitioning the EM algorithm into simpler steps may provide better bias reduction in the estimation of model parameters. The ability to breakdown a complicated problem in to a series of simpler, more accessible problems will permit a broader implementation of the EM algorithm, permit the use of software packages that now implement and/or automate the EM algorithm, and make the EM algorithm more accessible to a wider and more general audience.

Meltability in system of K2TaF7-NaF-NaCl-KCl

International Nuclear Information System (INIS)

Kartsev, V.E.; Kovalev, F.V.; Korshunov, B.G.

1975-01-01

Thermographic and visual-polythermal techniques were used to study the meltability in K 2 TaF 7 -NaF-NaCl-KCl system. The tetrahedron-forming sections NaF-NaCl-K 2 TaF 7 xKCl and NaF-K 2 TaF 7 xKCl-2K 2 TaF 7 xNaCl divide the concentration tetrahedron into three particular tetrahedra: NaF-K 2 TaF 7 xKCl-2K 2 TaF 7 xNaCl-K 2 TaF 7 , NaF-NaCl-K 2 TaF 7 xKCl-2K 2 TaF 7 xaCl, and NaF-NaCl-KCl-K 2 TaF 7 xKCl. Non-variant equilibrium points in all of the particular four-component systems have been determined

Parallel sorting algorithms

CERN Document Server

Akl, Selim G

1985-01-01

Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the

Active transport of Na/sup +/ by reconstituted Na,K-ATPase

Energy Technology Data Exchange (ETDEWEB)

Boldyrev, A.A.; Svinukhova, I.A.

1987-02-20

The ability of ATP, CTP, ITP, GTP, and UTP to support ouabain-sensitive accumulation of Na/sup +/ by proteoliposomes with a reconstituted Na/K-pump was investigated. At a low (Na/sup +/)/(K/sup +/) ratio in the medium (20 mM/50 mM), a correlation is observed between the proton-accepting capacity of the nucleotide and its effectiveness as a substrate of active transport. To test the hypothesis of the importance of the presence of a negative charge in the 1-position of the purine (3-pyrimidine) base of the nucleotide for mutual transitions between the Na- and K-conformations of Na,K-ATPase they used two analogs of ATP: N/sub 1/-hydroxy-ATP, possessing proton acceptor capacity, and N/sub 1/-methoxy-ATP, in the molecule of which the negative charge is quenched by a methyl group. The first substrate supports active accumulation of Na/sup +/ in proteoliposomes at the same rate as ATP, whereas the second substrate is relatively ineffective.

Biokinetic model-based multi-objective optimization of Dunaliella tertiolecta cultivation using elitist non-dominated sorting genetic algorithm with inheritance.

Science.gov (United States)

Sinha, Snehal K; Kumar, Mithilesh; Guria, Chandan; Kumar, Anup; Banerjee, Chiranjib

2017-10-01

Algal model based multi-objective optimization using elitist non-dominated sorting genetic algorithm with inheritance was carried out for batch cultivation of Dunaliella tertiolecta using NPK-fertilizer. Optimization problems involving two- and three-objective functions were solved simultaneously. The objective functions are: maximization of algae-biomass and lipid productivity with minimization of cultivation time and cost. Time variant light intensity and temperature including NPK-fertilizer, NaCl and NaHCO 3 loadings are the important decision variables. Algal model involving Monod/Andrews adsorption kinetics and Droop model with internal nutrient cell quota was used for optimization studies. Sets of non-dominated (equally good) Pareto optimal solutions were obtained for the problems studied. It was observed that time variant optimal light intensity and temperature trajectories, including optimum NPK fertilizer, NaCl and NaHCO 3 concentration has significant influence to improve biomass and lipid productivity under minimum cultivation time and cost. Proposed optimization studies may be helpful to implement the control strategy in scale-up operation. Copyright © 2017 Elsevier Ltd. All rights reserved.

Relationship between intracellular Na+ concentration and reduced Na+ affinity in Na+,K+-ATPase mutants causing neurological disease

DEFF Research Database (Denmark)

Toustrup-Jensen, Mads Schak; Einholm, Anja P.; Schack, Vivien

The neurological disorders familial hemiplegic migraine type 2 (FHM2), alternating hemiplegia of childhood (AHC), and rapid-onset dystonia parkinsonism (RDP) are caused by mutations of Na+,K+-ATPase α2 and α3 isoforms, expressed in glial and neuronal cells, respectively. Although these disorders......, addressing the question to what extent they cause a change of the intracellular Na+ and K+ concentrations ([Na+]i and [K+]i) in COS cells. C-terminal extension mutants generally showed dramatically reduced Na+ affinity without disturbance of K+ binding, as did other RDP mutants. No phosphorylation from ATP...

Krypton calibration of time projection chambers of the NA61/SHINE experiment

CERN Document Server

Naskret, Michal

The NA61/SHINE experiment at CERN is searching for the critical point in phase transition between quark-gluon plasma and hadronic matter. To do so we use the most precise apparatus - Time Projection Chamber. Its main task is to find trajectories of particles created in a relativistic collision. In order to improve efficiency of TPCs, we introduce calibration using radioactive krypton gas. Simulation of events in a TPC cham- ber through a decay of excited krypton atoms gives us a spectrum, which is later fitted to the model spectrum of krypton from a Monte-Carlo simulation. The data obtained in such a way serves us to determine malfunctioning electronics in TPCs. Thanks to the krypton calibration we can create a map of pad by pad gains. In this thesis I will de- scribe in detail the NA61 experimental setup, krypton calibration procedure, calibration algorithm and results for recent calibration runs

MOŽNOSTI VSTOPA NA TUJE TRGE NA PRIMERU PODJETJA AWOODTURE

OpenAIRE

Orličnik, Urša

2014-01-01

Danes pojavljanje podjetja samo na domačem trgu ni več dovolj. Spremembe okolja, naraščanje konkurence ter hiter tehnološki napredek, silijo podjetja k nenehnemu prilagajanju in iskanju novih priložnosti tako na domačem kot tudi na tujem trgu. Internacionalizacija podjetja tako postaja vedno bolj pomemembna za preživetje podjetja. Internacionalizacija se v najširšem smislu nanaša na vse oblike mednarodnega ekonomskega sodelovanja. Je dinamičen proces, kateremu nujno sledi sprememba stanja...

Na/K pump inactivation, subsarcolemmal Na measurements, and cytoplasmic ion turnover kinetics contradict restricted Na spaces in murine cardiac myocytes

OpenAIRE

Lu, Fang-Min; Hilgemann, Donald W.

2017-01-01

The Na/K pump exports cytoplasmic Na ions while importing K ions, and its activity is thought to be affected by restricted intracellular Na diffusion in cardiac myocytes. Lu and Hilgemann find instead that the pump can enter an inactivated state and that inactivation can be relieved by cytoplasmic Na.

Fermion cluster algorithms

International Nuclear Information System (INIS)

Chandrasekharan, Shailesh

2000-01-01

Cluster algorithms have been recently used to eliminate sign problems that plague Monte-Carlo methods in a variety of systems. In particular such algorithms can also be used to solve sign problems associated with the permutation of fermion world lines. This solution leads to the possibility of designing fermion cluster algorithms in certain cases. Using the example of free non-relativistic fermions we discuss the ideas underlying the algorithm

Algorithm improvement program nuclide identification algorithm scoring criteria and scoring application.

Energy Technology Data Exchange (ETDEWEB)

Enghauser, Michael [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2016-02-01

The goal of the Domestic Nuclear Detection Office (DNDO) Algorithm Improvement Program (AIP) is to facilitate gamma-radiation detector nuclide identification algorithm development, improvement, and validation. Accordingly, scoring criteria have been developed to objectively assess the performance of nuclide identification algorithms. In addition, a Microsoft Excel spreadsheet application for automated nuclide identification scoring has been developed. This report provides an overview of the equations, nuclide weighting factors, nuclide equivalencies, and configuration weighting factors used by the application for scoring nuclide identification algorithm performance. Furthermore, this report presents a general overview of the nuclide identification algorithm scoring application including illustrative examples.

Algorithm of Particle Data Association for SLAM Based on Improved Ant Algorithm

Directory of Open Access Journals (Sweden)

KeKe Gen

2015-01-01

Full Text Available The article considers a problem of data association algorithm for simultaneous localization and mapping guidelines in determining the route of unmanned aerial vehicles (UAVs. Currently, these equipments are already widely used, but mainly controlled from the remote operator. An urgent task is to develop a control system that allows for autonomous flight. Algorithm SLAM (simultaneous localization and mapping, which allows to predict the location, speed, the ratio of flight parameters and the coordinates of landmarks and obstacles in an unknown environment, is one of the key technologies to achieve real autonomous UAV flight. The aim of this work is to study the possibility of solving this problem by using an improved ant algorithm.The data association for SLAM algorithm is meant to establish a matching set of observed landmarks and landmarks in the state vector. Ant algorithm is one of the widely used optimization algorithms with positive feedback and the ability to search in parallel, so the algorithm is suitable for solving the problem of data association for SLAM. But the traditional ant algorithm in the process of finding routes easily falls into local optimum. Adding random perturbations in the process of updating the global pheromone to avoid local optima. Setting limits pheromone on the route can increase the search space with a reasonable amount of calculations for finding the optimal route.The paper proposes an algorithm of the local data association for SLAM algorithm based on an improved ant algorithm. To increase the speed of calculation, local data association is used instead of the global data association. The first stage of the algorithm defines targets in the matching space and the observed landmarks with the possibility of association by the criterion of individual compatibility (IC. The second stage defines the matched landmarks and their coordinates using improved ant algorithm. Simulation results confirm the efficiency and

Pile-up correction by Genetic Algorithm and Artificial Neural Network

Science.gov (United States)

Kafaee, M.; Saramad, S.

2009-08-01

Pile-up distortion is a common problem for high counting rates radiation spectroscopy in many fields such as industrial, nuclear and medical applications. It is possible to reduce pulse pile-up using hardware-based pile-up rejections. However, this phenomenon may not be eliminated completely by this approach and the spectrum distortion caused by pile-up rejection can be increased as well. In addition, inaccurate correction or rejection of pile-up artifacts in applications such as energy dispersive X-ray (EDX) spectrometers can lead to losses of counts, will give poor quantitative results and even false element identification. Therefore, it is highly desirable to use software-based models to predict and correct any recognized pile-up signals in data acquisition systems. The present paper describes two new intelligent approaches for pile-up correction; the Genetic Algorithm (GA) and Artificial Neural Networks (ANNs). The validation and testing results of these new methods have been compared, which shows excellent agreement with the measured data with 60Co source and NaI detector. The Monte Carlo simulation of these new intelligent algorithms also shows their advantages over hardware-based pulse pile-up rejection methods.

The BR eigenvalue algorithm

Energy Technology Data Exchange (ETDEWEB)

Geist, G.A. [Oak Ridge National Lab., TN (United States). Computer Science and Mathematics Div.; Howell, G.W. [Florida Inst. of Tech., Melbourne, FL (United States). Dept. of Applied Mathematics; Watkins, D.S. [Washington State Univ., Pullman, WA (United States). Dept. of Pure and Applied Mathematics

1997-11-01

The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrowband, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30--60 in computing time and a factor of over 100 in matrix storage space.

Vpliv toplotnih mostov na porabo energije za ogrevanje na primeru osnovne šole

OpenAIRE

Megušar, Primož

2015-01-01

Na primeru Osnovne šole Dobrova sem preveril, kakšen vpliv imajo dejanski toplotni mostovi na porabo energije za ogrevanje. Iz načrtov stavbe sem evidentiral vse toplotne mostove, kateri vplivajo na porabo energije. Tem toplotnim mostovom sem nato v standardu SIST EN ISO 14683 poiskal ustrezne približke. Nato sem s programom TOST izvedel tri simulacije. V prvem primeru toplotnih mostov nisem upošteval. V drugem primeru sem toplotne mostove upošteval na poenostavljen način, v zadnjem primeru p...

Na and K dependence of the Na/K pump in cystic fibrosis fibroblasts.

OpenAIRE

Reznik, V M; Schneider, J A; Mendoza, S A

1981-01-01

The Na and K dependence of the Na/K pump was measured in skin fibroblasts from patients with cystic fibrosis and age/sex-matched controls. Under basal conditions, there was no difference between control and cystic fibrosis cells in protein per cell, intracellular Na and K content, or Na/K pump activity (measured as ouabain-sensitive 86Rb uptake). There was no difference in the Na dependence of the Na/K pump between cystic fibrosis cells and control cells. In cells from patients with cystic fi...

Vliv mikroflóry na senzorické vlastnosti vína

OpenAIRE

Petrášová, Ludmila

2014-01-01

Tato bakalářská práce se zabývá vlivem mikroflóry na senzorické vlastnosti vína. Teoretická část informuje o botanickém popisu hroznů vína Veltlínské zelené, dále o jeho složení, o technologii zpracování bílého vína a o vlivu kvasinek na aromatický profil vína. V další části popisuje metodu stanovení aromaticky aktivních látek pomocí plynové chromatografie v kombinaci s mikroextrakcí tuhou fází (SPME-GC). Cílem experimentální části bylo proměřit vzorky 4 různých moštů odrůdy Veltlínské zelené...

Geometric approximation algorithms

CERN Document Server

Har-Peled, Sariel

2011-01-01

Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterparts. This book is the first to cover geometric approximation algorithms in detail. In addition, more traditional computational geometry techniques that are widely used in developing such algorithms, like sampling, linear programming, etc., are also surveyed. Other topics covered include approximate nearest-neighbor search, shape approximation, coresets, dimension reduction, and embeddings. The topics covered are relatively independent and are supplemented by exercises. Close to 200 color figures are included in the text to illustrate proofs and ideas.

Automatic motor task selection via a bandit algorithm for a brain-controlled button

Science.gov (United States)

Fruitet, Joan; Carpentier, Alexandra; Munos, Rémi; Clerc, Maureen

2013-02-01

Objective. Brain-computer interfaces (BCIs) based on sensorimotor rhythms use a variety of motor tasks, such as imagining moving the right or left hand, the feet or the tongue. Finding the tasks that yield best performance, specifically to each user, is a time-consuming preliminary phase to a BCI experiment. This study presents a new adaptive procedure to automatically select (online) the most promising motor task for an asynchronous brain-controlled button. Approach. We develop for this purpose an adaptive algorithm UCB-classif based on the stochastic bandit theory and design an EEG experiment to test our method. We compare (offline) the adaptive algorithm to a naïve selection strategy which uses uniformly distributed samples from each task. We also run the adaptive algorithm online to fully validate the approach. Main results. By not wasting time on inefficient tasks, and focusing on the most promising ones, this algorithm results in a faster task selection and a more efficient use of the BCI training session. More precisely, the offline analysis reveals that the use of this algorithm can reduce the time needed to select the most appropriate task by almost half without loss in precision, or alternatively, allow us to investigate twice the number of tasks within a similar time span. Online tests confirm that the method leads to an optimal task selection. Significance. This study is the first one to optimize the task selection phase by an adaptive procedure. By increasing the number of tasks that can be tested in a given time span, the proposed method could contribute to reducing ‘BCI illiteracy’.

Algorithms in Singular

Directory of Open Access Journals (Sweden)

Hans Schonemann

1996-12-01

Full Text Available Some algorithms for singularity theory and algebraic geometry The use of Grobner basis computations for treating systems of polynomial equations has become an important tool in many areas. This paper introduces of the concept of standard bases (a generalization of Grobner bases and the application to some problems from algebraic geometry. The examples are presented as SINGULAR commands. A general introduction to Grobner bases can be found in the textbook [CLO], an introduction to syzygies in [E] and [St1]. SINGULAR is a computer algebra system for computing information about singularities, for use in algebraic geometry. The basic algorithms in SINGULAR are several variants of a general standard basis algorithm for general monomial orderings (see [GG]. This includes wellorderings (Buchberger algorithm ([B1], [B2] and tangent cone orderings (Mora algorithm ([M1], [MPT] as special cases: It is able to work with non-homogeneous and homogeneous input and also to compute in the localization of the polynomial ring in 0. Recent versions include algorithms to factorize polynomials and a factorizing Grobner basis algorithm. For a complete description of SINGULAR see [Si].

Multimodal optimization by using hybrid of artificial bee colony algorithm and BFGS algorithm

Science.gov (United States)

Anam, S.

2017-10-01

Optimization has become one of the important fields in Mathematics. Many problems in engineering and science can be formulated into optimization problems. They maybe have many local optima. The optimization problem with many local optima, known as multimodal optimization problem, is how to find the global solution. Several metaheuristic methods have been proposed to solve multimodal optimization problems such as Particle Swarm Optimization (PSO), Genetics Algorithm (GA), Artificial Bee Colony (ABC) algorithm, etc. The performance of the ABC algorithm is better than or similar to those of other population-based algorithms with the advantage of employing a fewer control parameters. The ABC algorithm also has the advantages of strong robustness, fast convergence and high flexibility. However, it has the disadvantages premature convergence in the later search period. The accuracy of the optimal value cannot meet the requirements sometimes. Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm is a good iterative method for finding a local optimum. Compared with other local optimization methods, the BFGS algorithm is better. Based on the advantages of the ABC algorithm and the BFGS algorithm, this paper proposes a hybrid of the artificial bee colony algorithm and the BFGS algorithm to solve the multimodal optimization problem. The first step is that the ABC algorithm is run to find a point. In the second step is that the point obtained by the first step is used as an initial point of BFGS algorithm. The results show that the hybrid method can overcome from the basic ABC algorithm problems for almost all test function. However, if the shape of function is flat, the proposed method cannot work well.

Modified Firefly Algorithm

Directory of Open Access Journals (Sweden)

Surafel Luleseged Tilahun

2012-01-01

Full Text Available Firefly algorithm is one of the new metaheuristic algorithms for optimization problems. The algorithm is inspired by the flashing behavior of fireflies. In the algorithm, randomly generated solutions will be considered as fireflies, and brightness is assigned depending on their performance on the objective function. One of the rules used to construct the algorithm is, a firefly will be attracted to a brighter firefly, and if there is no brighter firefly, it will move randomly. In this paper we modify this random movement of the brighter firefly by generating random directions in order to determine the best direction in which the brightness increases. If such a direction is not generated, it will remain in its current position. Furthermore the assignment of attractiveness is modified in such a way that the effect of the objective function is magnified. From the simulation result it is shown that the modified firefly algorithm performs better than the standard one in finding the best solution with smaller CPU time.

Network-Oblivious Algorithms

DEFF Research Database (Denmark)

Bilardi, Gianfranco; Pietracaprina, Andrea; Pucci, Geppino

2016-01-01

A framework is proposed for the design and analysis of network-oblivious algorithms, namely algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network......-oblivious algorithm be specified on a parallel model of computation where the only parameter is the problem’s input size, and then evaluated on a model with two parameters, capturing parallelism granularity and communication latency. It is shown that for a wide class of network-oblivious algorithms, optimality...... of cache hierarchies, to the realm of parallel computation. Its effectiveness is illustrated by providing optimal network-oblivious algorithms for a number of key problems. Some limitations of the oblivious approach are also discussed....

A novel hybrid algorithm of GSA with Kepler algorithm for numerical optimization

Directory of Open Access Journals (Sweden)

Soroor Sarafrazi

2015-07-01

Full Text Available It is now well recognized that pure algorithms can be promisingly improved by hybridization with other techniques. One of the relatively new metaheuristic algorithms is Gravitational Search Algorithm (GSA which is based on the Newton laws. In this paper, to enhance the performance of GSA, a novel algorithm called “Kepler”, inspired by the astrophysics, is introduced. The Kepler algorithm is based on the principle of the first Kepler law. The hybridization of GSA and Kepler algorithm is an efficient approach to provide much stronger specialization in intensification and/or diversification. The performance of GSA–Kepler is evaluated by applying it to 14 benchmark functions with 20–1000 dimensions and the optimal approximation of linear system as a practical optimization problem. The results obtained reveal that the proposed hybrid algorithm is robust enough to optimize the benchmark functions and practical optimization problems.

Algorithmically specialized parallel computers

CERN Document Server

Snyder, Lawrence; Gannon, Dennis B

1985-01-01

Algorithmically Specialized Parallel Computers focuses on the concept and characteristics of an algorithmically specialized computer.This book discusses the algorithmically specialized computers, algorithmic specialization using VLSI, and innovative architectures. The architectures and algorithms for digital signal, speech, and image processing and specialized architectures for numerical computations are also elaborated. Other topics include the model for analyzing generalized inter-processor, pipelined architecture for search tree maintenance, and specialized computer organization for raster

DEVELOPMENT OF A NEW ALGORITHM FOR KEY AND S-BOX GENERATION IN BLOWFISH ALGORITHM

Directory of Open Access Journals (Sweden)

TAYSEER S. ATIA

2014-08-01

Full Text Available Blowfish algorithm is a block cipher algorithm, its strong, simple algorithm used to encrypt data in block of size 64-bit. Key and S-box generation process in this algorithm require time and memory space the reasons that make this algorithm not convenient to be used in smart card or application requires changing secret key frequently. In this paper a new key and S-box generation process was developed based on Self Synchronization Stream Cipher (SSS algorithm where the key generation process for this algorithm was modified to be used with the blowfish algorithm. Test result shows that the generation process requires relatively slow time and reasonably low memory requirement and this enhance the algorithm and gave it the possibility for different usage.

Monte Carlo algorithms with absorbing Markov chains: Fast local algorithms for slow dynamics

International Nuclear Information System (INIS)

Novotny, M.A.

1995-01-01

A class of Monte Carlo algorithms which incorporate absorbing Markov chains is presented. In a particular limit, the lowest order of these algorithms reduces to the n-fold way algorithm. These algorithms are applied to study the escape from the metastable state in the two-dimensional square-lattice nearest-neighbor Ising ferromagnet in an unfavorable applied field, and the agreement with theoretical predictions is very good. It is demonstrated that the higher-order algorithms can be many orders of magnitude faster than either the traditional Monte Carlo or n-fold way algorithms

Density functional theory study of neutral and singly-charged (NaBH{sub 4}){sub n} (n = 1–6) nanoclusters

Energy Technology Data Exchange (ETDEWEB)

Yang, Yongpeng [State Key Laboratory of Organic–Inorganic Composites, Beijing University of Chemical Technology, Beijing 100029 (China); Wu, Xiangming [Ping Xiang Sports School, Jiangxi 337000 (China); Liu, Chuan [State Key Laboratory of Organic–Inorganic Composites, Beijing University of Chemical Technology, Beijing 100029 (China); Huang, Shiping, E-mail: huangsp@mail.buct.edu.cn [State Key Laboratory of Organic–Inorganic Composites, Beijing University of Chemical Technology, Beijing 100029 (China)

2014-10-31

Highlights: • Structures of (NaBH{sub 4}){sub n} (n = 1–6) clusters are optimized by DFT calculation. • The Kubas interaction is observed in each cationic cluster. • Hydrogen molecule interacts with attached boron atom by Kubas interaction. • Cationic NaBH{sub 4} nanoclusters exhibit more easily H{sub 2} desorption. - Abstract: We report the global minimum structures of (NaBH{sub 4}){sub n} (n = 1–6) clusters by combining the particle swarm optimization algorithm with density functional theory. A newly formed hydrogen molecule is observed in each cationic structure, and the H{sub 2} interacts with adjacent boron atom by Kubas interaction. The results of localized orbital locator and natural bond orbital analysis reveal that the hydrogen molecule interacts with attached boron atom by the σ-bond and σ{sup ∗}-antibond of H{sub 2} in [NaBH{sub 4}]{sub n}{sup +} (n = 1, 2, 3 and 5), and the σ{sup ∗}-antibond dominates this interaction in [NaBH{sub 4}]{sub 4}{sup +} and [NaBH{sub 4}]{sub 6}{sup +}. The desorption energy of the hydrogen molecule is relatively small for [NaBH{sub 4}]{sup +} (1.05 eV), [NaBH{sub 4}]{sub 2}{sup +} (0.99 eV) and [NaBH{sub 4}]{sub 3}{sup +} (0.97 eV). It is also found that the negative desorption energy of the [NaBH{sub 4}]{sub 4}{sup +} (−0.26 eV), [NaBH{sub 4}]{sub 5}{sup +} (−0.26 eV) and [NaBH{sub 4}]{sub 6}{sup +} (−0.54 eV) shows that the hydrogen molecule can be released easily.

Dynamic route guidance algorithm based algorithm based on artificial immune system

Institute of Scientific and Technical Information of China (English)

无

2007-01-01

To improve the performance of the K-shortest paths search in intelligent traffic guidance systems,this paper proposes an optimal search algorithm based on the intelligent optimization search theory and the memphor mechanism of vertebrate immune systems.This algorithm,applied to the urban traffic network model established by the node-expanding method,can expediently realize K-shortest paths search in the urban traffic guidance systems.Because of the immune memory and global parallel search ability from artificial immune systems,K shortest paths can be found without any repeat,which indicates evidently the superiority of the algorithm to the conventional ones.Not only does it perform a better parallelism,the algorithm also prevents premature phenomenon that often occurs in genetic algorithms.Thus,it is especially suitable for real-time requirement of the traffic guidance system and other engineering optimal applications.A case study verifies the efficiency and the practicability of the algorithm aforementioned.

Hamiltonian Algorithm Sound Synthesis

OpenAIRE

大矢, 健一

2013-01-01

Hamiltonian Algorithm (HA) is an algorithm for searching solutions is optimization problems. This paper introduces a sound synthesis technique using Hamiltonian Algorithm and shows a simple example. "Hamiltonian Algorithm Sound Synthesis" uses phase transition effect in HA. Because of this transition effect, totally new waveforms are produced.

An efficient grid layout algorithm for biological networks utilizing various biological attributes

Directory of Open Access Journals (Sweden)

Kato Mitsuru

2007-03-01

Full Text Available Abstract Background Clearly visualized biopathways provide a great help in understanding biological systems. However, manual drawing of large-scale biopathways is time consuming. We proposed a grid layout algorithm that can handle gene-regulatory networks and signal transduction pathways by considering edge-edge crossing, node-edge crossing, distance measure between nodes, and subcellular localization information from Gene Ontology. Consequently, the layout algorithm succeeded in drastically reducing these crossings in the apoptosis model. However, for larger-scale networks, we encountered three problems: (i the initial layout is often very far from any local optimum because nodes are initially placed at random, (ii from a biological viewpoint, human layouts still exceed automatic layouts in understanding because except subcellular localization, it does not fully utilize biological information of pathways, and (iii it employs a local search strategy in which the neighborhood is obtained by moving one node at each step, and automatic layouts suggest that simultaneous movements of multiple nodes are necessary for better layouts, while such extension may face worsening the time complexity. Results We propose a new grid layout algorithm. To address problem (i, we devised a new force-directed algorithm whose output is suitable as the initial layout. For (ii, we considered that an appropriate alignment of nodes having the same biological attribute is one of the most important factors of the comprehension, and we defined a new score function that gives an advantage to such configurations. For solving problem (iii, we developed a search strategy that considers swapping nodes as well as moving a node, while keeping the order of the time complexity. Though a naïve implementation increases by one order, the time complexity, we solved this difficulty by devising a method that caches differences between scores of a layout and its possible updates

Modified Clipped LMS Algorithm

Directory of Open Access Journals (Sweden)

Lotfizad Mojtaba

2005-01-01

Full Text Available Abstract A new algorithm is proposed for updating the weights of an adaptive filter. The proposed algorithm is a modification of an existing method, namely, the clipped LMS, and uses a three-level quantization ( scheme that involves the threshold clipping of the input signals in the filter weight update formula. Mathematical analysis shows the convergence of the filter weights to the optimum Wiener filter weights. Also, it can be proved that the proposed modified clipped LMS (MCLMS algorithm has better tracking than the LMS algorithm. In addition, this algorithm has reduced computational complexity relative to the unmodified one. By using a suitable threshold, it is possible to increase the tracking capability of the MCLMS algorithm compared to the LMS algorithm, but this causes slower convergence. Computer simulations confirm the mathematical analysis presented.

Algorithms as fetish: Faith and possibility in algorithmic work

Directory of Open Access Journals (Sweden)

Suzanne L Thomas

2018-01-01

Full Text Available Algorithms are powerful because we invest in them the power to do things. With such promise, they can transform the ordinary, say snapshots along a robotic vacuum cleaner’s route, into something much more, such as a clean home. Echoing David Graeber’s revision of fetishism, we argue that this easy slip from technical capabilities to broader claims betrays not the “magic” of algorithms but rather the dynamics of their exchange. Fetishes are not indicators of false thinking, but social contracts in material form. They mediate emerging distributions of power often too nascent, too slippery or too disconcerting to directly acknowledge. Drawing primarily on 2016 ethnographic research with computer vision professionals, we show how faith in what algorithms can do shapes the social encounters and exchanges of their production. By analyzing algorithms through the lens of fetishism, we can see the social and economic investment in some people’s labor over others. We also see everyday opportunities for social creativity and change. We conclude that what is problematic about algorithms is not their fetishization but instead their stabilization into full-fledged gods and demons – the more deserving objects of critique.

Quick fuzzy backpropagation algorithm.

Science.gov (United States)

Nikov, A; Stoeva, S

2001-03-01

A modification of the fuzzy backpropagation (FBP) algorithm called QuickFBP algorithm is proposed, where the computation of the net function is significantly quicker. It is proved that the FBP algorithm is of exponential time complexity, while the QuickFBP algorithm is of polynomial time complexity. Convergence conditions of the QuickFBP, resp. the FBP algorithm are defined and proved for: (1) single output neural networks in case of training patterns with different targets; and (2) multiple output neural networks in case of training patterns with equivalued target vector. They support the automation of the weights training process (quasi-unsupervised learning) establishing the target value(s) depending on the network's input values. In these cases the simulation results confirm the convergence of both algorithms. An example with a large-sized neural network illustrates the significantly greater training speed of the QuickFBP rather than the FBP algorithm. The adaptation of an interactive web system to users on the basis of the QuickFBP algorithm is presented. Since the QuickFBP algorithm ensures quasi-unsupervised learning, this implies its broad applicability in areas of adaptive and adaptable interactive systems, data mining, etc. applications.

A New Modified Firefly Algorithm

Directory of Open Access Journals (Sweden)

Medha Gupta

2016-07-01

Full Text Available Nature inspired meta-heuristic algorithms studies the emergent collective intelligence of groups of simple agents. Firefly Algorithm is one of the new such swarm-based metaheuristic algorithm inspired by the flashing behavior of fireflies. The algorithm was first proposed in 2008 and since then has been successfully used for solving various optimization problems. In this work, we intend to propose a new modified version of Firefly algorithm (MoFA and later its performance is compared with the standard firefly algorithm along with various other meta-heuristic algorithms. Numerical studies and results demonstrate that the proposed algorithm is superior to existing algorithms.

Study of the Na-C-O and Na-H-O ternary systems in the sodium rich corner

International Nuclear Information System (INIS)

Maupre, J.-P.

1978-02-01

The purpose of this study is to provide a contribution to the understanding of the sodium - carbon - oxygen and sodium - hydrogen - oxygen ternary systems in the sodium rich corner. In order to do this the Na-NaH-Na 2 O-NaOH phase diagram was completed and the Na-Na 2 O-Na 2 CO 3 -C phase diagram was outlined. This work is made up of two parts. The first is devoted to a critical literature survey essential to establish correct phase diagrams. The second is an experimental study followed by a discussion collating our finding to the literary data. The basic experimental technique used is differential thermal analysis (DTA) but it has been completed by quenching, X-ray and chemical analysis methods. The proposed phase diagrams imply that Na-NaH-Na 2 O-NaOH and Na-Na 2 O-Na 2 CO 3 -C systems are reciprocal ternary systems. Temperatures of stable pairs reversal are respectively 410 and 690 0 C. The stable pairs are Na-NaOH and Na-Na 2 CO 3 at elevated temperature, Na 2 O-NaH and Na 2 O-C at low temperature [fr

Quantum Computation and Algorithms

International Nuclear Information System (INIS)

Biham, O.; Biron, D.; Biham, E.; Grassi, M.; Lidar, D.A.

1999-01-01

It is now firmly established that quantum algorithms provide a substantial speedup over classical algorithms for a variety of problems, including the factorization of large numbers and the search for a marked element in an unsorted database. In this talk I will review the principles of quantum algorithms, the basic quantum gates and their operation. The combination of superposition and interference, that makes these algorithms efficient, will be discussed. In particular, Grover's search algorithm will be presented as an example. I will show that the time evolution of the amplitudes in Grover's algorithm can be found exactly using recursion equations, for any initial amplitude distribution

Behavioral Modeling for Mental Health using Machine Learning Algorithms.

Science.gov (United States)

Srividya, M; Mohanavalli, S; Bhalaji, N

2018-04-03

Mental health is an indicator of emotional, psychological and social well-being of an individual. It determines how an individual thinks, feels and handle situations. Positive mental health helps one to work productively and realize their full potential. Mental health is important at every stage of life, from childhood and adolescence through adulthood. Many factors contribute to mental health problems which lead to mental illness like stress, social anxiety, depression, obsessive compulsive disorder, drug addiction, and personality disorders. It is becoming increasingly important to determine the onset of the mental illness to maintain proper life balance. The nature of machine learning algorithms and Artificial Intelligence (AI) can be fully harnessed for predicting the onset of mental illness. Such applications when implemented in real time will benefit the society by serving as a monitoring tool for individuals with deviant behavior. This research work proposes to apply various machine learning algorithms such as support vector machines, decision trees, naïve bayes classifier, K-nearest neighbor classifier and logistic regression to identify state of mental health in a target group. The responses obtained from the target group for the designed questionnaire were first subject to unsupervised learning techniques. The labels obtained as a result of clustering were validated by computing the Mean Opinion Score. These cluster labels were then used to build classifiers to predict the mental health of an individual. Population from various groups like high school students, college students and working professionals were considered as target groups. The research presents an analysis of applying the aforementioned machine learning algorithms on the target groups and also suggests directions for future work.

AqSo_NaCl: Computer program to calculate p-T-V-x properties in the H2O-NaCl fluid system applied to fluid inclusion research and pore fluid calculation

Science.gov (United States)

Bakker, Ronald J.

2018-06-01

The program AqSo_NaCl has been developed to calculate pressure - molar volume - temperature - composition (p-V-T-x) properties, enthalpy, and heat capacity of the binary H2O-NaCl system. The algorithms are designed in BASIC within the Xojo programming environment, and can be operated as stand-alone project with Macintosh-, Windows-, and Unix-based operating systems. A series of ten self-instructive interfaces (modules) are developed to calculate fluid inclusion properties and pore fluid properties. The modules may be used to calculate properties of pure NaCl, the halite-liquidus, the halite-vapourus, dew-point and bubble-point curves (liquid-vapour), critical point, and SLV solid-liquid-vapour curves at temperatures above 0.1 °C (with halite) and below 0.1 °C (with ice or hydrohalite). Isochores of homogeneous fluids and unmixed fluids in a closed system can be calculated and exported to a.txt file. Isochores calculated for fluid inclusions can be corrected according to the volumetric properties of quartz. Microthermometric data, i.e. dissolution temperatures and homogenization temperatures, can be used to calculated bulk fluid properties of fluid inclusions. Alternatively, in the absence of total homogenization temperature the volume fraction of the liquid phase in fluid inclusions can be used to obtain bulk properties.

Response of saliva Na/K ratio to changing Na supply of lactating cows under tropical conditions.

Science.gov (United States)

Thiangtum, Wandee; Schonewille, J Thomas; Verstegen, Martin Wa; Arsawakulsudhi, Supot; Rukkwamsuk, Theera; Hendriks, Wouter H

2017-06-01

Factorial determination of the sodium (Na) requirement of heat-stressed lactating cows is hindered by accurate estimates of the Na losses through sweat. Direct studies, therefore, may be needed requiring information on the time course of healthy animals to become Na depleted and the subsequent rate of repletion. The rate of Na depletion and subsequent rate of Na repletion with two levels of dietary Na to lactating dairy cows housed under tropical conditions were investigated using the salivary Na/K. The 12 lactating cows (salivary Na/K ratio 14.6) rapidly developed clinical signs of Na deficiency, including pica, polyuria and polydipsia, reduced body weight and reduced milk yield when fed a low-Na ration (0.33 g kg -1 dry matter (DM)) for 3 weeks. Deficiency symptoms were associated with a rapid decrease in salivary Na/K ratio to cows with NaCl to a ration concentration of 1.1 or 1.6 g Na kg -1 DM for 5 weeks did not restore salivary Na/K ratio to values of >6. A daily Na intake of heat-stressed lactating cows to a ration intake of 1.6 g Na kg -1 DM was insufficient to restore Na deficiency. One week was sufficient to deplete heat-stressed lactating cows of Na, allowing for rapid dose-response studies utilizing the salivary Na/K ratio as a parameter for Na status of cows under tropical conditions. © 2016 Society of Chemical Industry. © 2016 Society of Chemical Industry.

Semioptimal practicable algorithmic cooling

International Nuclear Information System (INIS)

Elias, Yuval; Mor, Tal; Weinstein, Yossi

2011-01-01

Algorithmic cooling (AC) of spins applies entropy manipulation algorithms in open spin systems in order to cool spins far beyond Shannon's entropy bound. Algorithmic cooling of nuclear spins was demonstrated experimentally and may contribute to nuclear magnetic resonance spectroscopy. Several cooling algorithms were suggested in recent years, including practicable algorithmic cooling (PAC) and exhaustive AC. Practicable algorithms have simple implementations, yet their level of cooling is far from optimal; exhaustive algorithms, on the other hand, cool much better, and some even reach (asymptotically) an optimal level of cooling, but they are not practicable. We introduce here semioptimal practicable AC (SOPAC), wherein a few cycles (typically two to six) are performed at each recursive level. Two classes of SOPAC algorithms are proposed and analyzed. Both attain cooling levels significantly better than PAC and are much more efficient than the exhaustive algorithms. These algorithms are shown to bridge the gap between PAC and exhaustive AC. In addition, we calculated the number of spins required by SOPAC in order to purify qubits for quantum computation. As few as 12 and 7 spins are required (in an ideal scenario) to yield a mildly pure spin (60% polarized) from initial polarizations of 1% and 10%, respectively. In the latter case, about five more spins are sufficient to produce a highly pure spin (99.99% polarized), which could be relevant for fault-tolerant quantum computing.

An Ordering Linear Unification Algorithm

Institute of Scientific and Technical Information of China (English)

胡运发

1989-01-01

In this paper,we present an ordering linear unification algorithm(OLU).A new idea on substituteion of the binding terms is introduced to the algorithm,which is able to overcome some drawbacks of other algorithms,e.g.,MM algorithm[1],RG1 and RG2 algorithms[2],Particularly,if we use the directed eyclie graphs,the algoritm needs not check the binding order,then the OLU algorithm can also be aplied to the infinite tree data struceture,and a higher efficiency can be expected.The paper focuses upon the discussion of OLU algorithm and a partial order structure with respect to the unification algorithm.This algorithm has been implemented in the GKD-PROLOG/VAX 780 interpreting system.Experimental results have shown that the algorithm is very simple and efficient.

Glutathionylation-Dependence of Na+-K+-Pump Currents Can Mimic Reduced Subsarcolemmal Na+ Diffusion

Science.gov (United States)

Garcia, Alvaro; Liu, Chia-Chi; Cornelius, Flemming; Clarke, Ronald J.; Rasmussen, Helge H.

2016-01-01

The existence of a subsarcolemmal space with restricted diffusion for Na+ in cardiac myocytes has been inferred from a transient peak electrogenic Na+-K+ pump current beyond steady state on reexposure of myocytes to K+ after a period of exposure to K+-free extracellular solution. The transient peak current is attributed to enhanced electrogenic pumping of Na+ that accumulated in the diffusion-restricted space during pump inhibition in K+-free extracellular solution. However, there are no known physical barriers that account for such restricted Na+ diffusion, and we examined if changes of activity of the Na+-K+ pump itself cause the transient peak current. Reexposure to K+ reproduced a transient current beyond steady state in voltage-clamped ventricular myocytes as reported by others. Persistence of it when the Na+ concentration in patch pipette solutions perfusing the intracellular compartment was high and elimination of it with K+-free pipette solution could not be reconciled with restricted subsarcolemmal Na+ diffusion. The pattern of the transient current early after pump activation was dependent on transmembrane Na+- and K+ concentration gradients suggesting the currents were related to the conformational poise imposed on the pump. We examined if the currents might be accounted for by changes in glutathionylation of the β1 Na+-K+ pump subunit, a reversible oxidative modification that inhibits the pump. Susceptibility of the β1 subunit to glutathionylation depends on the conformational poise of the Na+-K+ pump, and glutathionylation with the pump stabilized in conformations equivalent to those expected to be imposed on voltage-clamped myocytes supported this hypothesis. So did elimination of the transient K+-induced peak Na+-K+ pump current when we included glutaredoxin 1 in patch pipette solutions to reverse glutathionylation. We conclude that transient K+-induced peak Na+-K+ pump current reflects the effect of conformation-dependent β1 pump subunit

Glutathionylation-Dependence of Na(+)-K(+)-Pump Currents Can Mimic Reduced Subsarcolemmal Na(+) Diffusion.

Science.gov (United States)

Garcia, Alvaro; Liu, Chia-Chi; Cornelius, Flemming; Clarke, Ronald J; Rasmussen, Helge H

2016-03-08

The existence of a subsarcolemmal space with restricted diffusion for Na(+) in cardiac myocytes has been inferred from a transient peak electrogenic Na(+)-K(+) pump current beyond steady state on reexposure of myocytes to K(+) after a period of exposure to K(+)-free extracellular solution. The transient peak current is attributed to enhanced electrogenic pumping of Na(+) that accumulated in the diffusion-restricted space during pump inhibition in K(+)-free extracellular solution. However, there are no known physical barriers that account for such restricted Na(+) diffusion, and we examined if changes of activity of the Na(+)-K(+) pump itself cause the transient peak current. Reexposure to K(+) reproduced a transient current beyond steady state in voltage-clamped ventricular myocytes as reported by others. Persistence of it when the Na(+) concentration in patch pipette solutions perfusing the intracellular compartment was high and elimination of it with K(+)-free pipette solution could not be reconciled with restricted subsarcolemmal Na(+) diffusion. The pattern of the transient current early after pump activation was dependent on transmembrane Na(+)- and K(+) concentration gradients suggesting the currents were related to the conformational poise imposed on the pump. We examined if the currents might be accounted for by changes in glutathionylation of the β1 Na(+)-K(+) pump subunit, a reversible oxidative modification that inhibits the pump. Susceptibility of the β1 subunit to glutathionylation depends on the conformational poise of the Na(+)-K(+) pump, and glutathionylation with the pump stabilized in conformations equivalent to those expected to be imposed on voltage-clamped myocytes supported this hypothesis. So did elimination of the transient K(+)-induced peak Na(+)-K(+) pump current when we included glutaredoxin 1 in patch pipette solutions to reverse glutathionylation. We conclude that transient K(+)-induced peak Na(+)-K(+) pump current reflects the effect

VISUALIZATION OF PAGERANK ALGORITHM

OpenAIRE

Perhaj, Ervin

2013-01-01

The goal of the thesis is to develop a web application that help users understand the functioning of the PageRank algorithm. The thesis consists of two parts. First we develop an algorithm to calculate PageRank values of web pages. The input of algorithm is a list of web pages and links between them. The user enters the list through the web interface. From the data the algorithm calculates PageRank value for each page. The algorithm repeats the process, until the difference of PageRank va...

RFID Location Algorithm

Directory of Open Access Journals (Sweden)

Wang Zi Min

2016-01-01

Full Text Available With the development of social services, people’s living standards improve further requirements, there is an urgent need for a way to adapt to the complex situation of the new positioning technology. In recent years, RFID technology have a wide range of applications in all aspects of life and production, such as logistics tracking, car alarm, security and other items. The use of RFID technology to locate, it is a new direction in the eyes of the various research institutions and scholars. RFID positioning technology system stability, the error is small and low-cost advantages of its location algorithm is the focus of this study.This article analyzes the layers of RFID technology targeting methods and algorithms. First, RFID common several basic methods are introduced; Secondly, higher accuracy to political network location method; Finally, LANDMARC algorithm will be described. Through this it can be seen that advanced and efficient algorithms play an important role in increasing RFID positioning accuracy aspects.Finally, the algorithm of RFID location technology are summarized, pointing out the deficiencies in the algorithm, and put forward a follow-up study of the requirements, the vision of a better future RFID positioning technology.

Crystal structure of a Na+-bound Na+,K+-ATPase preceding the E1P state.

Science.gov (United States)

Kanai, Ryuta; Ogawa, Haruo; Vilsen, Bente; Cornelius, Flemming; Toyoshima, Chikashi

2013-10-10

Na(+),K(+)-ATPase pumps three Na(+) ions out of cells in exchange for two K(+) taken up from the extracellular medium per ATP molecule hydrolysed, thereby establishing Na(+) and K(+) gradients across the membrane in all animal cells. These ion gradients are used in many fundamental processes, notably excitation of nerve cells. Here we describe 2.8 Å-resolution crystal structures of this ATPase from pig kidney with bound Na(+), ADP and aluminium fluoride, a stable phosphate analogue, with and without oligomycin that promotes Na(+) occlusion. These crystal structures represent a transition state preceding the phosphorylated intermediate (E1P) in which three Na(+) ions are occluded. Details of the Na(+)-binding sites show how this ATPase functions as a Na(+)-specific pump, rejecting K(+) and Ca(2+), even though its affinity for Na(+) is low (millimolar dissociation constant). A mechanism for sequential, cooperative Na(+) binding can now be formulated in atomic detail.

Improved multivariate polynomial factoring algorithm

International Nuclear Information System (INIS)

Wang, P.S.

1978-01-01

A new algorithm for factoring multivariate polynomials over the integers based on an algorithm by Wang and Rothschild is described. The new algorithm has improved strategies for dealing with the known problems of the original algorithm, namely, the leading coefficient problem, the bad-zero problem and the occurrence of extraneous factors. It has an algorithm for correctly predetermining leading coefficients of the factors. A new and efficient p-adic algorithm named EEZ is described. Bascially it is a linearly convergent variable-by-variable parallel construction. The improved algorithm is generally faster and requires less store then the original algorithm. Machine examples with comparative timing are included

Na+-H+ exchange and Na+-dependent transport systems in streptozotocin diabetic rat kidneys

International Nuclear Information System (INIS)

El-Seifi, S.; Freiberg, J.M.; Kinsella, F.J.; Cheng, L.; Sacktor, B.

1987-01-01

The streptozotocin-induced diabetic rat was used to test the hypothesis that Na + -H + exchange activity in the proximal tubule luminal membrane would be increased in association with renal hypertrophy, altered glomerular hemodynamics, enhanced filtered load and tubular reabsorption of 22 Na + , and stimulated 22 Na= pump activity in the basolateral membrane, previously reported characteristics of this experimental animal model. Amiloride-sensitive H + gradient-dependent Na + uptake and Na + gradient-dependent H + flux were increased in brush-border membrane vesicles from the streptozotocin-treated animals. Na + gradient-dependent uptakes of phosphate, D-glucose, L-proline, and myoinositol were decreased in the drug-induced diabetic animals. These membrane transport alterations were not found when the streptozotocin-diabetic animals were treated with insulin

Governance by algorithms

Directory of Open Access Journals (Sweden)

Francesca Musiani

2013-08-01

Full Text Available Algorithms are increasingly often cited as one of the fundamental shaping devices of our daily, immersed-in-information existence. Their importance is acknowledged, their performance scrutinised in numerous contexts. Yet, a lot of what constitutes 'algorithms' beyond their broad definition as “encoded procedures for transforming input data into a desired output, based on specified calculations” (Gillespie, 2013 is often taken for granted. This article seeks to contribute to the discussion about 'what algorithms do' and in which ways they are artefacts of governance, providing two examples drawing from the internet and ICT realm: search engine queries and e-commerce websites’ recommendations to customers. The question of the relationship between algorithms and rules is likely to occupy an increasingly central role in the study and the practice of internet governance, in terms of both institutions’ regulation of algorithms, and algorithms’ regulation of our society.

The two C-terminal tyrosines stabilize occluded Na/K pump conformations containing Na or K ions.

Science.gov (United States)

Vedovato, Natascia; Gadsby, David C

2010-07-01

Interactions of the three transported Na ions with the Na/K pump remain incompletely understood. Na/K pump crystal structures show that the extended C terminus of the Na,K-adenosine triphosphatase (ATPase) alpha subunit directly contacts transmembrane helices. Deletion of the last five residues (KETYY in almost all Na/K pumps) markedly lowered the apparent affinity for Na activation of pump phosphorylation from ATP, a reflection of cytoplasmic Na affinity for forming the occluded E1P(Na3) conformation. ATPase assays further suggested that C-terminal truncations also interfere with low affinity Na interactions, which are attributable to extracellular effects. Because extracellular Na ions traverse part of the membrane's electric field to reach their binding sites in the Na/K pump, their movements generate currents that can be monitored with high resolution. We report here electrical measurements to examine how Na/K pump interactions with extracellular Na ions are influenced by C-terminal truncations. We deleted the last two (YY) or five (KESYY) residues in Xenopus laevis alpha1 Na/K pumps made ouabain resistant by either of two kinds of point mutations and measured their currents as 10-mM ouabain-sensitive currents in Xenopus oocytes after silencing endogenous Xenopus Na/K pumps with 1 microM ouabain. We found the low affinity inhibitory influence of extracellular Na on outward Na/K pump current at negative voltages to be impaired in all of the C-terminally truncated pumps. Correspondingly, voltage jump-induced transient charge movements that reflect pump interactions with extracellular Na ions were strongly shifted to more negative potentials; this signals a several-fold reduction of the apparent affinity for extracellular Na in the truncated pumps. Parallel lowering of Na affinity on both sides of the membrane argues that the C-terminal contacts provide important stabilization of the occluded E1P(Na3) conformation, regardless of the route of Na ion entry into the

Algorithmic and user study of an autocompletion algorithm on a large medical vocabulary.

Science.gov (United States)

Sevenster, Merlijn; van Ommering, Rob; Qian, Yuechen

2012-02-01

Autocompletion supports human-computer interaction in software applications that let users enter textual data. We will be inspired by the use case in which medical professionals enter ontology concepts, catering the ongoing demand for structured and standardized data in medicine. Goal is to give an algorithmic analysis of one particular autocompletion algorithm, called multi-prefix matching algorithm, which suggests terms whose words' prefixes contain all words in the string typed by the user, e.g., in this sense, opt ner me matches optic nerve meningioma. Second we aim to investigate how well it supports users entering concepts from a large and comprehensive medical vocabulary (snomed ct). We give a concise description of the multi-prefix algorithm, and sketch how it can be optimized to meet required response time. Performance will be compared to a baseline algorithm, which gives suggestions that extend the string typed by the user to the right, e.g. optic nerve m gives optic nerve meningioma, but opt ner me does not. We conduct a user experiment in which 12 participants are invited to complete 40 snomed ct terms with the baseline algorithm and another set of 40 snomed ct terms with the multi-prefix algorithm. Our results show that users need significantly fewer keystrokes when supported by the multi-prefix algorithm than when supported by the baseline algorithm. The proposed algorithm is a competitive candidate for searching and retrieving terms from a large medical ontology. Copyright © 2011 Elsevier Inc. All rights reserved.

Optimal Fungal Space Searching Algorithms.

Science.gov (United States)

Asenova, Elitsa; Lin, Hsin-Yu; Fu, Eileen; Nicolau, Dan V; Nicolau, Dan V

2016-10-01

Previous experiments have shown that fungi use an efficient natural algorithm for searching the space available for their growth in micro-confined networks, e.g., mazes. This natural "master" algorithm, which comprises two "slave" sub-algorithms, i.e., collision-induced branching and directional memory, has been shown to be more efficient than alternatives, with one, or the other, or both sub-algorithms turned off. In contrast, the present contribution compares the performance of the fungal natural algorithm against several standard artificial homologues. It was found that the space-searching fungal algorithm consistently outperforms uninformed algorithms, such as Depth-First-Search (DFS). Furthermore, while the natural algorithm is inferior to informed ones, such as A*, this under-performance does not importantly increase with the increase of the size of the maze. These findings suggest that a systematic effort of harvesting the natural space searching algorithms used by microorganisms is warranted and possibly overdue. These natural algorithms, if efficient, can be reverse-engineered for graph and tree search strategies.

Autonomous Star Tracker Algorithms

DEFF Research Database (Denmark)

Betto, Maurizio; Jørgensen, John Leif; Kilsgaard, Søren

1998-01-01

Proposal, in response to an ESA R.f.P., to design algorithms for autonomous star tracker operations.The proposal also included the development of a star tracker breadboard to test the algorithms performances.......Proposal, in response to an ESA R.f.P., to design algorithms for autonomous star tracker operations.The proposal also included the development of a star tracker breadboard to test the algorithms performances....

Anion-coupled Na efflux mediated by the human red blood cell Na/K pump

International Nuclear Information System (INIS)

Dissing, S.; Hoffman, J.F.

1990-01-01

The red cell Na/K pump is known to continue to extrude Na when both Na and K are removed from the external medium. Because this ouabain-sensitive flux occurs in the absence of an exchangeable cation, it is referred to as uncoupled Na efflux. This flux is also known to be inhibited by 5 mM Nao but to a lesser extent than that inhibitable by ouabain. Uncoupled Na efflux via the Na/K pump therefore can be divided into a Nao-sensitive and Nao-insensitive component. We used DIDS-treated, SO4-equilibrated human red blood cells suspended in HEPES-buffered (pHo 7.4) MgSO4 or (Tris)2SO4, in which we measured 22Na efflux, 35SO4 efflux, and changes in the membrane potential with the fluorescent dye, diS-C3 (5). A principal finding is that uncoupled Na efflux occurs electroneurally, in contrast to the pump's normal electrogenic operation when exchanging Nai for Ko. This electroneutral uncoupled efflux of Na was found to be balanced by an efflux of cellular anions. (We were unable to detect any ouabain-sensitive uptake of protons, measured in an unbuffered medium at pH 7.4 with a Radiometer pH-STAT.) The Nao-sensitive efflux of Nai was found to be 1.95 +/- 0.10 times the Nao-sensitive efflux of (SO4)i, indicating that the stoichiometry of this cotransport is two Na+ per SO4=, accounting for 60-80% of the electroneutral Na efflux. The remainder portion, that is, the ouabain-sensitive Nao-insensitive component, has been identified as PO4-coupled Na transport and is the subject of a separate paper. That uncoupled Na efflux occurs as a cotransport with anions is supported by the result, obtained with resealed ghosts, that when internal and external SO4 was substituted by the impermeant anion, tartrate i,o, the efflux of Na was inhibited 60-80%. This inhibition could be relieved by the inclusion, before DIDS treatment, of 5 mM Cli,o

Fast geometric algorithms

International Nuclear Information System (INIS)

Noga, M.T.

1984-01-01

This thesis addresses a number of important problems that fall within the framework of the new discipline of Computational Geometry. The list of topics covered includes sorting and selection, convex hull algorithms, the L 1 hull, determination of the minimum encasing rectangle of a set of points, the Euclidean and L 1 diameter of a set of points, the metric traveling salesman problem, and finding the superrange of star-shaped and monotype polygons. The main theme of all the work was to develop a set of very fast state-of-the-art algorithms that supersede any rivals in terms of speed and ease of implementation. In some cases existing algorithms were refined; for others new techniques were developed that add to the present database of fast adaptive geometric algorithms. What emerges is a collection of techniques that is successful at merging modern tools developed in analysis of algorithms with those of classical geometry

Genetic Algorithm Applied to the Eigenvalue Equalization Filtered-x LMS Algorithm (EE-FXLMS

Directory of Open Access Journals (Sweden)

Stephan P. Lovstedt

2008-01-01

Full Text Available The FXLMS algorithm, used extensively in active noise control (ANC, exhibits frequency-dependent convergence behavior. This leads to degraded performance for time-varying tonal noise and noise with multiple stationary tones. Previous work by the authors proposed the eigenvalue equalization filtered-x least mean squares (EE-FXLMS algorithm. For that algorithm, magnitude coefficients of the secondary path transfer function are modified to decrease variation in the eigenvalues of the filtered-x autocorrelation matrix, while preserving the phase, giving faster convergence and increasing overall attenuation. This paper revisits the EE-FXLMS algorithm, using a genetic algorithm to find magnitude coefficients that give the least variation in eigenvalues. This method overcomes some of the problems with implementing the EE-FXLMS algorithm arising from finite resolution of sampled systems. Experimental control results using the original secondary path model, and a modified secondary path model for both the previous implementation of EE-FXLMS and the genetic algorithm implementation are compared.

On factoring RSA modulus using random-restart hill-climbing algorithm and Pollard’s rho algorithm

Science.gov (United States)

Budiman, M. A.; Rachmawati, D.

2017-12-01

The security of the widely-used RSA public key cryptography algorithm depends on the difficulty of factoring a big integer into two large prime numbers. For many years, the integer factorization problem has been intensively and extensively studied in the field of number theory. As a result, a lot of deterministic algorithms such as Euler’s algorithm, Kraitchik’s, and variants of Pollard’s algorithms have been researched comprehensively. Our study takes a rather uncommon approach: rather than making use of intensive number theories, we attempt to factorize RSA modulus n by using random-restart hill-climbing algorithm, which belongs the class of metaheuristic algorithms. The factorization time of RSA moduli with different lengths is recorded and compared with the factorization time of Pollard’s rho algorithm, which is a deterministic algorithm. Our experimental results indicates that while random-restart hill-climbing algorithm is an acceptable candidate to factorize smaller RSA moduli, the factorization speed is much slower than that of Pollard’s rho algorithm.

Na5NbO5 and Na5TaO5 phases

International Nuclear Information System (INIS)

Darriet, J.; Maazaz, A.; Bouloux, J.C.; Delmas, C.

1982-01-01

New ternary oxides of formulas Na 5 NbO 5 and Na 5 TaO 5 have been prepared. They crystallize in the monoclinic system (space group C2/c). The crystal structure of Na 5 NbO 5 has been determined. It derives from a NaCl-type structure by ordering of the cations and of the oxygen vacancies in the anionic sublattice, the corresponding formula being Nasub(5/6)Nbsub(1/6)Osub(5/6)vacant sub(1/6). Sodium and niobium have a distorted square-pyramidal surrounding. (author)

Opposition-Based Adaptive Fireworks Algorithm

Directory of Open Access Journals (Sweden)

Chibing Gong

2016-07-01

Full Text Available A fireworks algorithm (FWA is a recent swarm intelligence algorithm that is inspired by observing fireworks explosions. An adaptive fireworks algorithm (AFWA proposes additional adaptive amplitudes to improve the performance of the enhanced fireworks algorithm (EFWA. The purpose of this paper is to add opposition-based learning (OBL to AFWA with the goal of further boosting performance and achieving global optimization. Twelve benchmark functions are tested in use of an opposition-based adaptive fireworks algorithm (OAFWA. The final results conclude that OAFWA significantly outperformed EFWA and AFWA in terms of solution accuracy. Additionally, OAFWA was compared with a bat algorithm (BA, differential evolution (DE, self-adapting control parameters in differential evolution (jDE, a firefly algorithm (FA, and a standard particle swarm optimization 2011 (SPSO2011 algorithm. The research results indicate that OAFWA ranks the highest of the six algorithms for both solution accuracy and runtime cost.

Opposite Degree Algorithm and Its Applications

Directory of Open Access Journals (Sweden)

Xiao-Guang Yue

2015-12-01

Full Text Available The opposite (Opposite Degree, referred to as OD algorithm is an intelligent algorithm proposed by Yue Xiaoguang et al. Opposite degree algorithm is mainly based on the concept of opposite degree, combined with the idea of design of neural network and genetic algorithm and clustering analysis algorithm. The OD algorithm is divided into two sub algorithms, namely: opposite degree - numerical computation (OD-NC algorithm and opposite degree - Classification computation (OD-CC algorithm.

Multiagency Urban Search Experiment Detector and Algorithm Test Bed

Science.gov (United States)

Nicholson, Andrew D.; Garishvili, Irakli; Peplow, Douglas E.; Archer, Daniel E.; Ray, William R.; Swinney, Mathew W.; Willis, Michael J.; Davidson, Gregory G.; Cleveland, Steven L.; Patton, Bruce W.; Hornback, Donald E.; Peltz, James J.; McLean, M. S. Lance; Plionis, Alexander A.; Quiter, Brian J.; Bandstra, Mark S.

2017-07-01

In order to provide benchmark data sets for radiation detector and algorithm development, a particle transport test bed has been created using experimental data as model input and validation. A detailed radiation measurement campaign at the Combined Arms Collective Training Facility in Fort Indiantown Gap, PA (FTIG), USA, provides sample background radiation levels for a variety of materials present at the site (including cinder block, gravel, asphalt, and soil) using long dwell high-purity germanium (HPGe) measurements. In addition, detailed light detection and ranging data and ground-truth measurements inform model geometry. This paper describes the collected data and the application of these data to create background and injected source synthetic data for an arbitrary gamma-ray detection system using particle transport model detector response calculations and statistical sampling. In the methodology presented here, HPGe measurements inform model source terms while detector response calculations are validated via long dwell measurements using 2"×4"×16" NaI(Tl) detectors at a variety of measurement points. A collection of responses, along with sampling methods and interpolation, can be used to create data sets to gauge radiation detector and algorithm (including detection, identification, and localization) performance under a variety of scenarios. Data collected at the FTIG site are available for query, filtering, visualization, and download at muse.lbl.gov.

Synthesis of Na-A and/or Na-X zeolite/porous carbon composites from carbonized rice husk

International Nuclear Information System (INIS)

Katsuki, Hiroaki; Komarneni, Sridhar

2009-01-01

Na-A and/or Na-X zeolite/porous carbon composites were prepared under hydrothermal conditions by NaOH dissolution of silica first from carbonized rice husk followed by addition of NaAlO 2 and in situ crystallization of zeolites i.e., using a two-step process. When a one-step process was used, both Na-A and Na-X zeolites crystallized on the surface of carbon. Na-A or Na-X zeolite crystals were prepared on the porous carbonized rice husk at 90 deg. C for 2-6 h by changing the SiO 2 /Al 2 O 3 , H 2 O/Na 2 O and Na 2 O/SiO 2 molar ratios of precursors in the two-step process. The surface area and NH 4 + -cation exchange capacity (CEC) of Na-A zeolite/porous carbon were found to be 171 m 2 /g and 506 meq/100 g, respectively, while those of Na-X zeolite/porous carbon composites were 676 m 2 /g and 317 meq/100 g, respectively. Na-A and Na-X zeolites are well-known microporous and hydrophilic materials while carbonized rice husk was found to be mesoporous (pores of ∼3.9 nm) and hydrophobic. These hybrid microporous-mesoporous and hydrophilic-hydrophobic composites are expected to be useful for decontamination of metal cations as well as organic contaminants simultaneously. - Graphical Abstract: Novel Na-X zeolite/porous carbon composite.

Equilibrium chemical transformations in NaPO3 + NaCl melts

International Nuclear Information System (INIS)

Kovarskaya, E.N.; Rodionov, Yu.I.

1988-01-01

Because of the problems of the burial of solidified radioactive wastes into different geological rock formations, in particular into massives of rock-salt, the state of molten polyphosphate-chloride mixtures (taking into account the chemical character of the interaction of their components) for a prolonged period of time. The equilibrium products of the reaction in the NaPO 3 -NaCl system were studied in melts in air in the composition range of 30-70 mole % NaCl. It was shown that with increase in the NaCl content in the mixtures, the polyphosphate gradually depolymerizes to sodium tri-, di-, and monophosphates, and the composition of the equilibrium melts is dependent only on the ratio between the components in the initial molten mixtures. The time until the equilibrium is attained is shorter, the higher is the experimental temperature

Long-Range Effects of Na(+) Binding in Na,K-ATPase Reported by ATP.

Science.gov (United States)

Middleton, David A; Fedosova, Natalya U; Esmann, Mikael

2015-12-01

This paper addresses the question of long-range interactions between the intramembranous cation binding sites and the cytoplasmic nucleotide binding site of the ubiquitous ion-transporting Na,K-ATPase using (13)C cross-polarization magic-angle spinning (CP-MAS) solid-state nuclear magnetic resonance. High-affinity ATP binding is induced by the presence of Na(+) as well as of Na-like substances such as Tris(+), and these ions are equally efficient promoters of nucleotide binding. CP-MAS analysis of bound ATP with Na,K-ATPase purified from pig kidney membranes reveals subtle differences in the nucleotide interactions within the nucleotide site depending on whether Na(+) or Tris(+) is used to induce binding. Differences in chemical shifts for ATP atoms C1' and C5' observed in the presence of Na(+) or Tris(+) suggest alterations in the residues surrounding the bound nucleotide, hydrogen bonding, and/or conformation of the ribose ring. This is taken as evidence of a long-distance communication between the Na(+)-filled ion sites in the membrane interior and the nucleotide binding site in the cytoplasmic domain and reflects the first conformational change ultimately leading to phosphorylation of the enzyme. Stopped-flow fluorescence measurements with the nucleotide analogue eosin show that the dissociation rate constant for eosin is larger in Tris(+) than in Na(+), giving kinetic evidence of the difference in structural effects of Na(+) and Tris(+). According to the recent crystal structure of the E1·AlF4(-)·ADP·3Na(+) form, the coupling between the ion binding sites and the nucleotide side is mediated by, among others, the M5 helix.

Interaction between Na+/K+-pump and Na+/Ca2+-exchanger modulates intercellular communication.

Science.gov (United States)

Matchkov, Vladimir V; Gustafsson, Helena; Rahman, Awahan; Briggs Boedtkjer, Donna M; Gorintin, Sarah; Hansen, Anne Kirstine; Bouzinova, Elena V; Praetorius, Helle A; Aalkjaer, Christian; Nilsson, Holger

2007-04-13

Ouabain, a specific inhibitor of the Na(+)/K(+)-pump, has previously been shown to interfere with intercellular communication. Here we test the hypothesis that the communication between vascular smooth muscle cells is regulated through an interaction between the Na(+)/K(+)-pump and the Na(+)/Ca(2+)-exchanger leading to an increase in the intracellular calcium concentration ([Ca(2+)](i)) in discrete areas near the plasma membrane. [Ca(2+)](i) in smooth muscle cells was imaged in cultured rat aortic smooth muscle cell pairs (A7r5) and in rat mesenteric small artery segments simultaneously with force. In A7r5 coupling between cells was estimated by measuring membrane capacitance. Smooth muscle cells were uncoupled when the Na(+)/K(+)-pump was inhibited either by a low concentration of ouabain, which also caused a localized increase of [Ca(2+)](i) near the membrane, or by ATP depletion. Reduction of Na(+)/K(+)-pump activity by removal of extracellular potassium ([K(+)](o)) also uncoupled cells, but only after inhibition of K(ATP) channels. Inhibition of the Na(+)/Ca(2+)-exchange activity by SEA0400 or by a reduction of the equilibrium potential (making it more negative) also uncoupled the cells. Depletion of intracellular Na(+) and clamping of [Ca(2+)](i) at low concentrations prevented the uncoupling. The experiments suggest that the Na(+)/K(+)-pump may affect gap junction conductivity via localized changes in [Ca(2+)](i) through modulation of Na(+)/Ca(2+)-exchanger activity.

Intracellular Na(+) and metabolic modulation of Na/K pump and excitability in the rat suprachiasmatic nucleus neurons.

Science.gov (United States)

Wang, Yi-Chi; Yang, Jyh-Jeen; Huang, Rong-Chi

2012-10-01

Na/K pump activity and metabolic rate are both higher during the day in the suprachiasmatic nucleus (SCN) that houses the circadian clock. Here we investigated the role of intracellular Na(+) and energy metabolism in regulating Na/K pump activity and neuronal excitability. Removal of extracellular K(+) to block the Na/K pump excited SCN neurons to fire at higher rates and return to normal K(+) to reactivate the pump produced rebound hyperpolarization to inhibit firing. In the presence of tetrodotoxin to block the action potentials, both zero K(+)-induced depolarization and rebound hyperpolarization were blocked by the cardiac glycoside strophanthidin. Ratiometric Na(+) imaging with a Na(+)-sensitive fluorescent dye indicated saturating accumulation of intracellular Na(+) in response to pump blockade with zero K(+). The Na(+) ionophore monensin also induced Na(+) loading and hyperpolarized the membrane potential, with the hyperpolarizing effect of monensin abolished in zero Na(+) or by pump blockade. Conversely, Na(+) depletion with Na(+)-free pipette solution depolarized membrane potential but retained residual Na/K pump activity. Cyanide inhibition of oxidative phosphorylation blocked the Na/K pump to depolarize resting potential and increase spontaneous firing in most cells, and to raise intracellular Na(+) levels in all cells. Nonetheless, the Na/K pump was incompletely blocked by cyanide but completely blocked by iodoacetate to inhibit glycolysis, indicating the involvement of both oxidative phosphorylation and glycolysis in fueling the Na/K pump. Together, the results indicate the importance of intracellular Na(+) and energy metabolism in regulating Na/K pump activity as well as neuronal excitability in the SCN neurons.

Synthesis of zeolites Na-A and Na-X from tablet compressed and calcinated coal fly ash

Science.gov (United States)

Hu, Tao; Gao, Wenyan; Liu, Xin; Zhang, Yifu; Meng, Changgong

2017-10-01

Zeolites Na-A and Na-X are important synthetic zeolites widely used for separation and adsorption in industry. It is of great significance to develop energy-efficient routines that can synthesize zeolites Na-A and Na-X from low-cost raw materials. Coal fly ash (CFA) is the major residue from the combustion of coal and biomass containing more than 85% SiO2 and Al2O3, which can readily replace the conventionally used sodium silicate and aluminate for zeolite synthesis. We used Na2CO3 to replace the expensive NaOH used for the calcination of CFA and showed that tablet compression can enhance the contact with Na2CO3 for the activation of CFA through calcination for the synthesis of zeolites Na-A and Na-X under mild conditions. We optimized the control variables for zeolite synthesis and showed that phase-pure zeolite Na-A can be synthesized with CFA at reactant molar ratio, hydrothermal reaction temperature and reaction time of 1.3Na2O: 0.6Al2O3: 1SiO2: 38H2O at 80°C for 6 h, respectively, while phase-pure zeolite Na-X can be synthesized at 2.2Na2O: 0.2Al2O3: 1SiO2: 88H2O at 100°C for 8 h, respectively. The composition, morphology, specific surface area, vibration spectrum and thermogravimetry of synthesized Na-A and Na-X were further characterized.

The CERES / NA45 experiment

CERN Multimedia

Laurent Guiraud

2000-01-01

Ceres is one of the second generation heavy ion experiments at CERN's SPS. It is dedicated to the study of electron-positron pairs in relativistic nuclear collisions. NA45 is one of the seven experiments (NA44, NA45, NA49, NA50, NA52, WA97/NA57 and WA98) involved in CERN's Heavy Ion programme which provided evidence for the existence of a new state of matter, the quark-gluon plasma. In this state, quarks, instead of being bound up into more complex particles such as protons and neutrons, are liberated and roam freely. Theory predicts that this state must have existed at about 10 microseconds after the Big Bang, before the formation of matter as we know it today.

Algorithmic phase diagrams

Science.gov (United States)

Hockney, Roger

1987-01-01

Algorithmic phase diagrams are a neat and compact representation of the results of comparing the execution time of several algorithms for the solution of the same problem. As an example, the recent results are shown of Gannon and Van Rosendale on the solution of multiple tridiagonal systems of equations in the form of such diagrams. The act of preparing these diagrams has revealed an unexpectedly complex relationship between the best algorithm and the number and size of the tridiagonal systems, which was not evident from the algebraic formulae in the original paper. Even so, for a particular computer, one diagram suffices to predict the best algorithm for all problems that are likely to be encountered the prediction being read directly from the diagram without complex calculation.

Recursive forgetting algorithms

DEFF Research Database (Denmark)

Parkum, Jens; Poulsen, Niels Kjølstad; Holst, Jan

1992-01-01

In the first part of the paper, a general forgetting algorithm is formulated and analysed. It contains most existing forgetting schemes as special cases. Conditions are given ensuring that the basic convergence properties will hold. In the second part of the paper, the results are applied...... to a specific algorithm with selective forgetting. Here, the forgetting is non-uniform in time and space. The theoretical analysis is supported by a simulation example demonstrating the practical performance of this algorithm...

Agency and Algorithms

Directory of Open Access Journals (Sweden)

Hanns Holger Rutz

2016-11-01

Full Text Available Although the concept of algorithms has been established a long time ago, their current topicality indicates a shift in the discourse. Classical definitions based on logic seem to be inadequate to describe their aesthetic capabilities. New approaches stress their involvement in material practices as well as their incompleteness. Algorithmic aesthetics can no longer be tied to the static analysis of programs, but must take into account the dynamic and experimental nature of coding practices. It is suggested that the aesthetic objects thus produced articulate something that could be called algorithmicity or the space of algorithmic agency. This is the space or the medium – following Luhmann’s form/medium distinction – where human and machine undergo mutual incursions. In the resulting coupled “extimate” writing process, human initiative and algorithmic speculation cannot be clearly divided out any longer. An observation is attempted of defining aspects of such a medium by drawing a trajectory across a number of sound pieces. The operation of exchange between form and medium I call reconfiguration and it is indicated by this trajectory. 

The rapid-onset dystonia parkinsonism mutation D923N of the Na+, K+-ATPase alpha3 isoform disrupts Na+ interaction at the third Na+ site.

Science.gov (United States)

Einholm, Anja Pernille; Toustrup-Jensen, Mads S; Holm, Rikke; Andersen, Jens Peter; Vilsen, Bente

2010-08-20

Rapid-onset dystonia parkinsonism (RDP), a rare neurological disorder, is caused by mutation of the neuron-specific alpha3-isoform of Na(+), K(+)-ATPase. Here, we present the functional consequences of RDP mutation D923N. Relative to the wild type, the mutant exhibits a remarkable approximately 200-fold reduction of Na(+) affinity for activation of phosphorylation from ATP, reflecting a defective interaction of the E(1) form with intracellular Na(+). This is the largest effect on Na(+) affinity reported so far for any Na(+), K(+)-ATPase mutant. D923N also affects the interaction with extracellular Na(+) normally driving the E(1)P to E(2)P conformational transition backward. However, no impairment of K(+) binding was observed for D923N, leading to the conclusion that Asp(923) is specifically associated with the third Na(+) site that is selective toward Na(+). The crystal structure of the Na(+), K(+)-ATPase in E(2) form shows that Asp(923) is located in the cytoplasmic half of transmembrane helix M8 inside a putative transport channel, which is lined by residues from the transmembrane helices M5, M7, M8, and M10 and capped by the C terminus, recently found involved in recognition of the third Na(+) ion. Structural modeling of the E(1) form of Na(+), K(+)-ATPase based on the Ca(2+)-ATPase crystal structure is consistent with the hypothesis that Asp(923) contributes to a site binding the third Na(+) ion. These results in conjunction with our previous findings with other RDP mutants suggest that a selective defect in the handling of Na(+) may be a general feature of the RDP disorder.

Recikliranje plastenk na kreativen način

OpenAIRE

Pavlin, Suzana

2017-01-01

Plastenke, poleg ostalih plastičnih izdelkov, v zadnjih letih predstavljajo pravo katastrofo za okolje. Domnevamo, da se le redko kdo vpraša, kaj se zgodi z njo po tem, ko je iz nje zaužil še zadnjo kapljico vode. Plastenka je lahko kot večina ostalih komunalnih odpadkov ponovno uporabljena, reciklirana, sežgana ali odložena na deponijo. V primeru nespoštovanja Zakona o varstvu okolja pa pristane v naravi, pogosto v morju, kjer prav počasi razpada in negativno vpliva na celoten ekosistem. V d...

Plant Defensins NaD1 and NaD2 Induce Different Stress Response Pathways in Fungi

Directory of Open Access Journals (Sweden)

Peter M. Dracatos

2016-09-01

Full Text Available Nicotiana alata defensins 1 and 2 (NaD1 and NaD2 are plant defensins from the ornamental tobacco that have antifungal activity against a variety of fungal pathogens. Some plant defensins interact with fungal cell wall O-glycosylated proteins. Therefore, we investigated if this was the case for NaD1 and NaD2, by assessing the sensitivity of the three Aspergillus nidulans (An O-mannosyltransferase (pmt knockout (KO mutants (An∆pmtA, An∆pmtB, and An∆pmtC. An∆pmtA was resistant to both defensins, while An∆pmtC was resistant to NaD2 only, suggesting NaD1 and NaD2 are unlikely to have a general interaction with O-linked side chains. Further evidence of this difference in the antifungal mechanism was provided by the dissimilarity of the NaD1 and NaD2 sensitivities of the Fusarium oxysporum f. sp. lycopersici (Fol signalling knockout mutants from the cell wall integrity (CWI and high osmolarity glycerol (HOG mitogen-activated protein kinase (MAPK pathways. HOG pathway mutants were sensitive to both NaD1 and NaD2, while CWI pathway mutants only displayed sensitivity to NaD2.

Glutamate Water Gates in the Ion Binding Pocket of Na(+) Bound Na(+), K(+)-ATPase

DEFF Research Database (Denmark)

Han, Minwoo; Kopec, Wojciech; Solov'yov, Ilia A

2017-01-01

III is always protonated. Glutamic acid residues in the three binding sites act as water gates, and their deprotonation triggers water entry to the binding sites. From DFT calculations of Na(+) binding energies, we conclude that three protons in the binding site are needed to effectively bind Na......The dynamically changing protonation states of the six acidic amino acid residues in the ion binding pocket of the Na(+), K(+) -ATPase (NKA) during the ion transport cycle are proposed to drive ion binding, release and possibly determine Na(+) or K(+) selectivity. We use molecular dynamics (MD......(+) from water and four are needed to release them in the next step. Protonation of Asp926 in site III will induce Na(+) release, and Glu327, Glu954 and Glu779 are all likely to be protonated in the Na(+) bound occluded conformation. Our data provides key insights into the role of protons in the Na...

Real-Coded Quantum-Inspired Genetic Algorithm-Based BP Neural Network Algorithm

Directory of Open Access Journals (Sweden)

Jianyong Liu

2015-01-01

Full Text Available The method that the real-coded quantum-inspired genetic algorithm (RQGA used to optimize the weights and threshold of BP neural network is proposed to overcome the defect that the gradient descent method makes the algorithm easily fall into local optimal value in the learning process. Quantum genetic algorithm (QGA is with good directional global optimization ability, but the conventional QGA is based on binary coding; the speed of calculation is reduced by the coding and decoding processes. So, RQGA is introduced to explore the search space, and the improved varied learning rate is adopted to train the BP neural network. Simulation test shows that the proposed algorithm is effective to rapidly converge to the solution conformed to constraint conditions.

TU-C-12A-12: Differentiating Bone Lesions and Degenerative Joint Disease in NaF PET/CT Scans Using Machine Learning

Energy Technology Data Exchange (ETDEWEB)

Perk, T; Bradshaw, T; Muzahir, S; Jeraj, R [University of Wisconsin, Madison, Wisconsin (United States); Meyer, E [Case Western Reserve University School of Medicine, Cleveland, Ohio (United States)

2014-06-15

Purpose: [F-18]NaF PET can be used to image bone metastases; however, tracer uptake in degenerative joint disease (DJD) often appears similar to metastases. This study aims to develop and compare different machine learning algorithms to automatically identify regions of [F-18]NaF scans that correspond to DJD. Methods: 10 metastatic prostate cancer patients received whole body [F-18]NaF PET/CT scans prior to treatment. Image segmentation resulted in 852 ROIs, 69 of which were identified by a nuclear medicine physician as DJD. For all ROIs, various PET and CT textural features were computed. ROIs were divided into training and testing sets used to train eight different machine learning classifiers. Classifiers were evaluated based on receiver operating characteristics area under the curve (AUC), sensitivity, specificity, and positive predictive value (PPV). We also assessed the added value of including CT features in addition to PET features for training classifiers. Results: The training set consisted of 37 DJD ROIs with 475 non-DJD ROIs, and the testing set consisted of 32 DJD ROIs with 308 non-DJD ROIs. Of all classifiers, generalized linear models (GLM), decision forests (DF), and support vector machines (SVM) had the best performance. AUCs of GLM (0.929), DF (0.921), and SVM (0.889) were significantly higher than the other models (p<0.001). GLM and DF, overall, had the best sensitivity, specificity, and PPV, and gave a significantly better performance (p<0.01) than all other models. PET/CT GLM classifiers had higher AUC than just PET or just CT. GLMs built using PET/CT information had superior or comparable sensitivities, specificities and PPVs to just PET or just CT. Conclusion: Machine learning algorithms trained with PET/CT features were able to identify some cases of DJD. GLM outperformed the other classification algorithms. Using PET and CT information together was shown to be superior to using PET or CT features alone. Research supported by the Prostate

TU-C-12A-12: Differentiating Bone Lesions and Degenerative Joint Disease in NaF PET/CT Scans Using Machine Learning

International Nuclear Information System (INIS)

Perk, T; Bradshaw, T; Muzahir, S; Jeraj, R; Meyer, E

2014-01-01

Purpose: [F-18]NaF PET can be used to image bone metastases; however, tracer uptake in degenerative joint disease (DJD) often appears similar to metastases. This study aims to develop and compare different machine learning algorithms to automatically identify regions of [F-18]NaF scans that correspond to DJD. Methods: 10 metastatic prostate cancer patients received whole body [F-18]NaF PET/CT scans prior to treatment. Image segmentation resulted in 852 ROIs, 69 of which were identified by a nuclear medicine physician as DJD. For all ROIs, various PET and CT textural features were computed. ROIs were divided into training and testing sets used to train eight different machine learning classifiers. Classifiers were evaluated based on receiver operating characteristics area under the curve (AUC), sensitivity, specificity, and positive predictive value (PPV). We also assessed the added value of including CT features in addition to PET features for training classifiers. Results: The training set consisted of 37 DJD ROIs with 475 non-DJD ROIs, and the testing set consisted of 32 DJD ROIs with 308 non-DJD ROIs. Of all classifiers, generalized linear models (GLM), decision forests (DF), and support vector machines (SVM) had the best performance. AUCs of GLM (0.929), DF (0.921), and SVM (0.889) were significantly higher than the other models (p<0.001). GLM and DF, overall, had the best sensitivity, specificity, and PPV, and gave a significantly better performance (p<0.01) than all other models. PET/CT GLM classifiers had higher AUC than just PET or just CT. GLMs built using PET/CT information had superior or comparable sensitivities, specificities and PPVs to just PET or just CT. Conclusion: Machine learning algorithms trained with PET/CT features were able to identify some cases of DJD. GLM outperformed the other classification algorithms. Using PET and CT information together was shown to be superior to using PET or CT features alone. Research supported by the Prostate

A cluster algorithm for graphs

NARCIS (Netherlands)

S. van Dongen

2000-01-01

textabstractA cluster algorithm for graphs called the emph{Markov Cluster algorithm (MCL~algorithm) is introduced. The algorithm provides basically an interface to an algebraic process defined on stochastic matrices, called the MCL~process. The graphs may be both weighted (with nonnegative weight)

Unsupervised learning algorithms

CERN Document Server

Aydin, Kemal

2016-01-01

This book summarizes the state-of-the-art in unsupervised learning. The contributors discuss how with the proliferation of massive amounts of unlabeled data, unsupervised learning algorithms, which can automatically discover interesting and useful patterns in such data, have gained popularity among researchers and practitioners. The authors outline how these algorithms have found numerous applications including pattern recognition, market basket analysis, web mining, social network analysis, information retrieval, recommender systems, market research, intrusion detection, and fraud detection. They present how the difficulty of developing theoretically sound approaches that are amenable to objective evaluation have resulted in the proposal of numerous unsupervised learning algorithms over the past half-century. The intended audience includes researchers and practitioners who are increasingly using unsupervised learning algorithms to analyze their data. Topics of interest include anomaly detection, clustering,...

Generalized-ensemble molecular dynamics and Monte Carlo algorithms beyond the limit of the multicanonical algorithm

International Nuclear Information System (INIS)

Okumura, Hisashi

2010-01-01

I review two new generalized-ensemble algorithms for molecular dynamics and Monte Carlo simulations of biomolecules, that is, the multibaric–multithermal algorithm and the partial multicanonical algorithm. In the multibaric–multithermal algorithm, two-dimensional random walks not only in the potential-energy space but also in the volume space are realized. One can discuss the temperature dependence and pressure dependence of biomolecules with this algorithm. The partial multicanonical simulation samples a wide range of only an important part of potential energy, so that one can concentrate the effort to determine a multicanonical weight factor only on the important energy terms. This algorithm has higher sampling efficiency than the multicanonical and canonical algorithms. (review)

Theoretic derivation of directed acyclic subgraph algorithm and comparisons with message passing algorithm

Science.gov (United States)

Ha, Jeongmok; Jeong, Hong

2016-07-01

This study investigates the directed acyclic subgraph (DAS) algorithm, which is used to solve discrete labeling problems much more rapidly than other Markov-random-field-based inference methods but at a competitive accuracy. However, the mechanism by which the DAS algorithm simultaneously achieves competitive accuracy and fast execution speed, has not been elucidated by a theoretical derivation. We analyze the DAS algorithm by comparing it with a message passing algorithm. Graphical models, inference methods, and energy-minimization frameworks are compared between DAS and message passing algorithms. Moreover, the performances of DAS and other message passing methods [sum-product belief propagation (BP), max-product BP, and tree-reweighted message passing] are experimentally compared.

NA62 and NA48/2 results on search for Heavy Neutral Leptons

Directory of Open Access Journals (Sweden)

Lamanna Gianluca

2018-01-01

Full Text Available In this paper we present new results on upper limits for the search of Heavy Neutral Leptons (HNL with data collected by NA48/2 (2003-2004, NA62-RK (2007 and NA62 (2015 CERN experiments. The data collected with different trigger configuration allow to search for both long and short living heavy neutrinos in the mass range below the kaon mass. In addition the status of the search for K+ → π+vv with the NA62 detector will be briefly presented.

Shadow algorithms data miner

CERN Document Server

Woo, Andrew

2012-01-01

Digital shadow generation continues to be an important aspect of visualization and visual effects in film, games, simulations, and scientific applications. This resource offers a thorough picture of the motivations, complexities, and categorized algorithms available to generate digital shadows. From general fundamentals to specific applications, it addresses shadow algorithms and how to manage huge data sets from a shadow perspective. The book also examines the use of shadow algorithms in industrial applications, in terms of what algorithms are used and what software is applicable.

Diversity-Guided Evolutionary Algorithms

DEFF Research Database (Denmark)

Ursem, Rasmus Kjær

2002-01-01

Population diversity is undoubtably a key issue in the performance of evolutionary algorithms. A common hypothesis is that high diversity is important to avoid premature convergence and to escape local optima. Various diversity measures have been used to analyze algorithms, but so far few...... algorithms have used a measure to guide the search. The diversity-guided evolutionary algorithm (DGEA) uses the wellknown distance-to-average-point measure to alternate between phases of exploration (mutation) and phases of exploitation (recombination and selection). The DGEA showed remarkable results...

Contact-impact algorithms on parallel computers

International Nuclear Information System (INIS)

Zhong Zhihua; Nilsson, Larsgunnar

1994-01-01

Contact-impact algorithms on parallel computers are discussed within the context of explicit finite element analysis. The algorithms concerned include a contact searching algorithm and an algorithm for contact force calculations. The contact searching algorithm is based on the territory concept of the general HITA algorithm. However, no distinction is made between different contact bodies, or between different contact surfaces. All contact segments from contact boundaries are taken as a single set. Hierarchy territories and contact territories are expanded. A three-dimensional bucket sort algorithm is used to sort contact nodes. The defence node algorithm is used in the calculation of contact forces. Both the contact searching algorithm and the defence node algorithm are implemented on the connection machine CM-200. The performance of the algorithms is examined under different circumstances, and numerical results are presented. ((orig.))

A review on quantum search algorithms

Science.gov (United States)

Giri, Pulak Ranjan; Korepin, Vladimir E.

2017-12-01

The use of superposition of states in quantum computation, known as quantum parallelism, has significant advantage in terms of speed over the classical computation. It is evident from the early invented quantum algorithms such as Deutsch's algorithm, Deutsch-Jozsa algorithm and its variation as Bernstein-Vazirani algorithm, Simon algorithm, Shor's algorithms, etc. Quantum parallelism also significantly speeds up the database search algorithm, which is important in computer science because it comes as a subroutine in many important algorithms. Quantum database search of Grover achieves the task of finding the target element in an unsorted database in a time quadratically faster than the classical computer. We review Grover's quantum search algorithms for a singe and multiple target elements in a database. The partial search algorithm of Grover and Radhakrishnan and its optimization by Korepin called GRK algorithm are also discussed.

Magnet sorting algorithms

International Nuclear Information System (INIS)

Dinev, D.

1996-01-01

Several new algorithms for sorting of dipole and/or quadrupole magnets in synchrotrons and storage rings are described. The algorithms make use of a combinatorial approach to the problem and belong to the class of random search algorithms. They use an appropriate metrization of the state space. The phase-space distortion (smear) is used as a goal function. Computational experiments for the case of the JINR-Dubna superconducting heavy ion synchrotron NUCLOTRON have shown a significant reduction of the phase-space distortion after the magnet sorting. (orig.)

Composite Differential Search Algorithm

Directory of Open Access Journals (Sweden)

Bo Liu

2014-01-01

Full Text Available Differential search algorithm (DS is a relatively new evolutionary algorithm inspired by the Brownian-like random-walk movement which is used by an organism to migrate. It has been verified to be more effective than ABC, JDE, JADE, SADE, EPSDE, GSA, PSO2011, and CMA-ES. In this paper, we propose four improved solution search algorithms, namely “DS/rand/1,” “DS/rand/2,” “DS/current to rand/1,” and “DS/current to rand/2” to search the new space and enhance the convergence rate for the global optimization problem. In order to verify the performance of different solution search methods, 23 benchmark functions are employed. Experimental results indicate that the proposed algorithm performs better than, or at least comparable to, the original algorithm when considering the quality of the solution obtained. However, these schemes cannot still achieve the best solution for all functions. In order to further enhance the convergence rate and the diversity of the algorithm, a composite differential search algorithm (CDS is proposed in this paper. This new algorithm combines three new proposed search schemes including “DS/rand/1,” “DS/rand/2,” and “DS/current to rand/1” with three control parameters using a random method to generate the offspring. Experiment results show that CDS has a faster convergence rate and better search ability based on the 23 benchmark functions.

Artifact removal algorithms for stroke detection using a multistatic MIST beamforming algorithm.

Science.gov (United States)

Ricci, E; Di Domenico, S; Cianca, E; Rossi, T

2015-01-01

Microwave imaging (MWI) has been recently proved as a promising imaging modality for low-complexity, low-cost and fast brain imaging tools, which could play a fundamental role to efficiently manage emergencies related to stroke and hemorrhages. This paper focuses on the UWB radar imaging approach and in particular on the processing algorithms of the backscattered signals. Assuming the use of the multistatic version of the MIST (Microwave Imaging Space-Time) beamforming algorithm, developed by Hagness et al. for the early detection of breast cancer, the paper proposes and compares two artifact removal algorithms. Artifacts removal is an essential step of any UWB radar imaging system and currently considered artifact removal algorithms have been shown not to be effective in the specific scenario of brain imaging. First of all, the paper proposes modifications of a known artifact removal algorithm. These modifications are shown to be effective to achieve good localization accuracy and lower false positives. However, the main contribution is the proposal of an artifact removal algorithm based on statistical methods, which allows to achieve even better performance but with much lower computational complexity.

Law and Order in Algorithmics

NARCIS (Netherlands)

Fokkinga, M.M.

1992-01-01

An algorithm is the input-output effect of a computer program; mathematically, the notion of algorithm comes close to the notion of function. Just as arithmetic is the theory and practice of calculating with numbers, so is ALGORITHMICS the theory and practice of calculating with algorithms. Just as

Transmural gradients in Na/K pump activity and [Na+]I in canine ventricle.

Science.gov (United States)

Gao, J; Wang, W; Cohen, I S; Mathias, R T

2005-09-01

There are well-documented differences in ion channel activity and action potential shape between epicardial (EPI), midmyocardial (MID), and endocardial (ENDO) ventricular myocytes. The purpose of this study was to determine if differences exist in Na/K pump activity. The whole cell patch-clamp was used to measure Na/K pump current (I(P)) and inward background Na(+)-current (I(inb)) in cells isolated from canine left ventricle. All currents were normalized to membrane capacitance. I(P) was measured as the current blocked by a saturating concentration of dihydro-ouabain. [Na(+)](i) was measured using SBFI-AM. I(P)(ENDO) (0.34 +/- 0.04 pA/pF, n = 17) was smaller than I(P)(EPI) (0.68 +/- 0.09 pA/pF, n = 38); the ratio was 0.50 with I(P)(MID) being intermediate (0.53 +/- 0.13 pA/pF, n = 19). The dependence of I(P) on [Na(+)](i) or voltage was essentially identical in EPI and ENDO (half-maximal activation at 9-10 mM [Na(+)](i) or approximately -90 mV). Increasing [K(+)](o) from 5.4 to 15 mM caused both I(P)(ENDO) and I(P)(EPI) to increase, but the ratio remained approximately 0.5. I(inb) in EPI and ENDO were nearly identical ( approximately 0.6 pA/pF). Physiological [Na(+)](i) was lower in EPI (7 +/- 2 mM, n = 31) than ENDO (12 +/- 3 mM, n = 29), with MID being intermediate (9 +/- 3 mM, n = 22). When cells were paced at 2 Hz, [Na(+)](i) increased but the differences persisted (ENDO 14 +/- 3 mM, n = 10; EPI 9 +/- 2 mM, n = 10; and MID intermediate, 11 +/- 2 mM, n = 9). Based on these results, the larger I(P) in EPI appears to reflect a higher maximum turnover rate, which implies either a larger number of active pumps or a higher turnover rate per pump protein. The transmural gradient in [Na(+)](i) means physiological I(P) is approximately uniform across the ventricular wall, whereas transporters that utilize the transmembrane electrochemical gradient for Na(+), such as Na/Ca exchange, have a larger driving force in EPI than ENDO.

Algorithms in Algebraic Geometry

CERN Document Server

Dickenstein, Alicia; Sommese, Andrew J

2008-01-01

In the last decade, there has been a burgeoning of activity in the design and implementation of algorithms for algebraic geometric computation. Some of these algorithms were originally designed for abstract algebraic geometry, but now are of interest for use in applications and some of these algorithms were originally designed for applications, but now are of interest for use in abstract algebraic geometry. The workshop on Algorithms in Algebraic Geometry that was held in the framework of the IMA Annual Program Year in Applications of Algebraic Geometry by the Institute for Mathematics and Its

Explaining algorithms using metaphors

CERN Document Server

Forišek, Michal

2013-01-01

There is a significant difference between designing a new algorithm, proving its correctness, and teaching it to an audience. When teaching algorithms, the teacher's main goal should be to convey the underlying ideas and to help the students form correct mental models related to the algorithm. This process can often be facilitated by using suitable metaphors. This work provides a set of novel metaphors identified and developed as suitable tools for teaching many of the 'classic textbook' algorithms taught in undergraduate courses worldwide. Each chapter provides exercises and didactic notes fo

Portfolios of quantum algorithms.

Science.gov (United States)

Maurer, S M; Hogg, T; Huberman, B A

2001-12-17

Quantum computation holds promise for the solution of many intractable problems. However, since many quantum algorithms are stochastic in nature they can find the solution of hard problems only probabilistically. Thus the efficiency of the algorithms has to be characterized by both the expected time to completion and the associated variance. In order to minimize both the running time and its uncertainty, we show that portfolios of quantum algorithms analogous to those of finance can outperform single algorithms when applied to the NP-complete problems such as 3-satisfiability.

DNABIT Compress - Genome compression algorithm.

Science.gov (United States)

Rajarajeswari, Pothuraju; Apparao, Allam

2011-01-22

Data compression is concerned with how information is organized in data. Efficient storage means removal of redundancy from the data being stored in the DNA molecule. Data compression algorithms remove redundancy and are used to understand biologically important molecules. We present a compression algorithm, "DNABIT Compress" for DNA sequences based on a novel algorithm of assigning binary bits for smaller segments of DNA bases to compress both repetitive and non repetitive DNA sequence. Our proposed algorithm achieves the best compression ratio for DNA sequences for larger genome. Significantly better compression results show that "DNABIT Compress" algorithm is the best among the remaining compression algorithms. While achieving the best compression ratios for DNA sequences (Genomes),our new DNABIT Compress algorithm significantly improves the running time of all previous DNA compression programs. Assigning binary bits (Unique BIT CODE) for (Exact Repeats, Reverse Repeats) fragments of DNA sequence is also a unique concept introduced in this algorithm for the first time in DNA compression. This proposed new algorithm could achieve the best compression ratio as much as 1.58 bits/bases where the existing best methods could not achieve a ratio less than 1.72 bits/bases.

Reactions of metal oxides with molten NaPO3 + NaCl mixtures

International Nuclear Information System (INIS)

Kovarskaya, E.N.; Mityakhina, V.S.; Rodionov, Yu.I.; Silin, M.Yu.

1988-01-01

We consider the dissolution mechanism for iron (III), europium(III), and tin(IV) oxides in molten NaPO 3 + NaCl that are responsible for the peak solubilities. We chose Fe 2 O 3 as the basic material since this occurs in large amounts around damaged metal structures in rock salt mines in a proposed zone for storing vitrified radioactive wastes. Solubility measurement and paper chromatography show that Fe 2 O 3 dissolves in molten NaPO 3 + NaCl in air by reaction with the solvent to give double iron and sodium diphosphates and monophosphates in accordance with the initial solution-in-the-melt composition, the degree of equilibration, and the temperature. The elevated solubilities for initial NaCl contents close to 30 mole % are due to sodium triphosphates and tricyclophosphates present in these melts. Moessbauer spectroscopy confirms that double iron, europium and tin diphosphates and monophosphates containing sodium occur in these chloride-polyphosphate melts

A verified LLL algorithm

NARCIS (Netherlands)

Divasón, Jose; Joosten, Sebastiaan; Thiemann, René; Yamada, Akihisa

2018-01-01

The Lenstra-Lenstra-Lovász basis reduction algorithm, also known as LLL algorithm, is an algorithm to find a basis with short, nearly orthogonal vectors of an integer lattice. Thereby, it can also be seen as an approximation to solve the shortest vector problem (SVP), which is an NP-hard problem,

SPECIAL LIBRARIES OF FRAGMENTS OF ALGORITHMIC NETWORKS TO AUTOMATE THE DEVELOPMENT OF ALGORITHMIC MODELS

Directory of Open Access Journals (Sweden)

V. E. Marley

2015-01-01

Full Text Available Summary. The concept of algorithmic models appeared from the algorithmic approach in which the simulated object, the phenomenon appears in the form of process, subject to strict rules of the algorithm, which placed the process of operation of the facility. Under the algorithmic model is the formalized description of the scenario subject specialist for the simulated process, the structure of which is comparable with the structure of the causal and temporal relationships between events of the process being modeled, together with all information necessary for its software implementation. To represent the structure of algorithmic models used algorithmic network. Normally, they were defined as loaded finite directed graph, the vertices which are mapped to operators and arcs are variables, bound by operators. The language of algorithmic networks has great features, the algorithms that it can display indifference the class of all random algorithms. In existing systems, automation modeling based on algorithmic nets, mainly used by operators working with real numbers. Although this reduces their ability, but enough for modeling a wide class of problems related to economy, environment, transport, technical processes. The task of modeling the execution of schedules and network diagrams is relevant and useful. There are many counting systems, network graphs, however, the monitoring process based analysis of gaps and terms of graphs, no analysis of prediction execution schedule or schedules. The library is designed to build similar predictive models. Specifying source data to obtain a set of projections from which to choose one and take it for a new plan.

Na(+),K (+)-ATPase as a docking station: protein-protein complexes of the Na(+),K (+)-ATPase.

Science.gov (United States)

Reinhard, Linda; Tidow, Henning; Clausen, Michael J; Nissen, Poul

2013-01-01

The Na(+),K(+)-ATPase, or sodium pump, is well known for its role in ion transport across the plasma membrane of animal cells. It carries out the transport of Na(+) ions out of the cell and of K(+) ions into the cell and thus maintains electrolyte and fluid balance. In addition to the fundamental ion-pumping function of the Na(+),K(+)-ATPase, recent work has suggested additional roles for Na(+),K(+)-ATPase in signal transduction and biomembrane structure. Several signaling pathways have been found to involve Na(+),K(+)-ATPase, which serves as a docking station for a fast-growing number of protein interaction partners. In this review, we focus on Na(+),K(+)-ATPase as a signal transducer, but also briefly discuss other Na(+),K(+)-ATPase protein-protein interactions, providing a comprehensive overview of the diverse signaling functions ascribed to this well-known enzyme.

Characterization of Na+-linked and Na+-independent Cl-/HCO3- exchange systems in Chinese hamster lung fibroblasts

International Nuclear Information System (INIS)

Cassel, D.; Scharf, O.; Rotman, M.; Cragoe, E.J. Jr.; Katz, M.

1988-01-01

The PS120 variant of Chinese hamster lung fibroblasts which lacks Na + /H + exchange activity was used to investigate bicarbonate transport systems and their role in intracellular pH (pH/sub i/) regulation. When pH/sub i/ was decreased by acid load, bicarbonate caused pH/sub i/ increase and stimulated 36 Cl - efflux from the cells, both in a Na + -dependent manner. These results together with previous findings that bicarbonate stimulates 22 Na + uptake in PS120 cells demonstrate the presence of a Na + -linked Cl - /HCO 3 - exchange system. In cells with normal initial pH/sub i/, bicarbonate caused Na + -independent pH/sub i/ increase in Cl - -free solutions and stimulated Na + -independent 36 Cl - efflux, indicating that a Na + -independent Cl - /HCO 3 - exchanger is also present in the cell. Na + -linked and Na + -independent Cl - /HCO 3- exchange is apparently mediated by two distinct systems, since a [(tetrahydrofluorene-7-yl)oxy]acetic acid derivative selectively inhibits the Na + -independent exchanger. An additional distinctive features is a 10-fold lower affinity for chloride of the Na + -linked exchanger. The Na + -linked and Na + -independent Cl - /HCO 3 - exchange systems are likely to protect the cell from acid and alkaline load, respectively

Group leaders optimization algorithm

Science.gov (United States)

Daskin, Anmer; Kais, Sabre

2011-03-01

We present a new global optimization algorithm in which the influence of the leaders in social groups is used as an inspiration for the evolutionary technique which is designed into a group architecture. To demonstrate the efficiency of the method, a standard suite of single and multi-dimensional optimization functions along with the energies and the geometric structures of Lennard-Jones clusters are given as well as the application of the algorithm on quantum circuit design problems. We show that as an improvement over previous methods, the algorithm scales as N 2.5 for the Lennard-Jones clusters of N-particles. In addition, an efficient circuit design is shown for a two-qubit Grover search algorithm which is a quantum algorithm providing quadratic speedup over the classical counterpart.

Totally parallel multilevel algorithms

Science.gov (United States)

Frederickson, Paul O.

1988-01-01

Four totally parallel algorithms for the solution of a sparse linear system have common characteristics which become quite apparent when they are implemented on a highly parallel hypercube such as the CM2. These four algorithms are Parallel Superconvergent Multigrid (PSMG) of Frederickson and McBryan, Robust Multigrid (RMG) of Hackbusch, the FFT based Spectral Algorithm, and Parallel Cyclic Reduction. In fact, all four can be formulated as particular cases of the same totally parallel multilevel algorithm, which are referred to as TPMA. In certain cases the spectral radius of TPMA is zero, and it is recognized to be a direct algorithm. In many other cases the spectral radius, although not zero, is small enough that a single iteration per timestep keeps the local error within the required tolerance.

The global Minmax k-means algorithm.

Science.gov (United States)

Wang, Xiaoyan; Bai, Yanping

2016-01-01

The global k -means algorithm is an incremental approach to clustering that dynamically adds one cluster center at a time through a deterministic global search procedure from suitable initial positions, and employs k -means to minimize the sum of the intra-cluster variances. However the global k -means algorithm sometimes results singleton clusters and the initial positions sometimes are bad, after a bad initialization, poor local optimal can be easily obtained by k -means algorithm. In this paper, we modified the global k -means algorithm to eliminate the singleton clusters at first, and then we apply MinMax k -means clustering error method to global k -means algorithm to overcome the effect of bad initialization, proposed the global Minmax k -means algorithm. The proposed clustering method is tested on some popular data sets and compared to the k -means algorithm, the global k -means algorithm and the MinMax k -means algorithm. The experiment results show our proposed algorithm outperforms other algorithms mentioned in the paper.

Characterization and analysis of NaI(Tl) and BGO detectors

International Nuclear Information System (INIS)

Harrison, J.R.

1994-01-01

There have been many studies concerning the performance characteristics of NaI(Tl) and BGO scintillating crystals, most of which generate data by algorithms rather than from experimentation. Those studies which do deal with collected data, however, usually test only a few detecting units. It was, therefore, the purpose of this project to develop a characterization method and to characterize a large number of scintillators of various sizes and histories as well as to create a performance profile based on the data collected. The energy ranges at which the detectors show relatively good resolution % and photo peak efficiency was also desired for future reference. Enough statistical data was collected and analyzed so that a differentiation between those detectors which perform well and those that do not can be made

New Optimization Algorithms in Physics

CERN Document Server

Hartmann, Alexander K

2004-01-01

Many physicists are not aware of the fact that they can solve their problems by applying optimization algorithms. Since the number of such algorithms is steadily increasing, many new algorithms have not been presented comprehensively until now. This presentation of recently developed algorithms applied in physics, including demonstrations of how they work and related results, aims to encourage their application, and as such the algorithms selected cover concepts and methods from statistical physics to optimization problems emerging in theoretical computer science.

Learning algorithms and automatic processing of languages; Algorithmes a apprentissage et traitement automatique des langues

Energy Technology Data Exchange (ETDEWEB)

Fluhr, Christian Yves Andre

1977-06-15

This research thesis concerns the field of artificial intelligence. It addresses learning algorithms applied to automatic processing of languages. The author first briefly describes some mechanisms of human intelligence in order to describe how these mechanisms are simulated on a computer. He outlines the specific role of learning in various manifestations of intelligence. Then, based on the Markov's algorithm theory, the author discusses the notion of learning algorithm. Two main types of learning algorithms are then addressed: firstly, an 'algorithm-teacher dialogue' type sanction-based algorithm which aims at learning how to solve grammatical ambiguities in submitted texts; secondly, an algorithm related to a document system which structures semantic data automatically obtained from a set of texts in order to be able to understand by references to any question on the content of these texts.

Na/K Pump and Beyond: Na/K-ATPase as a Modulator of Apoptosis and Autophagy

Directory of Open Access Journals (Sweden)

Cassiano Felippe Gonçalves-de-Albuquerque

2017-04-01

Full Text Available Lung cancer is a leading cause of global cancer deaths. Na/K-ATPase has been studied as a target for cancer treatment. Cardiotonic steroids (CS trigger intracellular signalling upon binding to Na/K-ATPase. Normal lung and tumour cells frequently express different pump isoforms. Thus, Na/K-ATPase is a powerful target for lung cancer treatment. Drugs targeting Na/K-ATPase may induce apoptosis and autophagy in transformed cells. We argue that Na/K-ATPase has a role as a potential target in chemotherapy in lung cancer treatment. We discuss the effects of Na/K-ATPase ligands and molecular pathways inducing deleterious effects on lung cancer cells, especially those leading to apoptosis and autophagy.

Na/K Pump and Beyond: Na/K-ATPase as a Modulator of Apoptosis and Autophagy.

Science.gov (United States)

Felippe Gonçalves-de-Albuquerque, Cassiano; Ribeiro Silva, Adriana; Ignácio da Silva, Camila; Caire Castro-Faria-Neto, Hugo; Burth, Patrícia

2017-04-21

Lung cancer is a leading cause of global cancer deaths. Na/K-ATPase has been studied as a target for cancer treatment. Cardiotonic steroids (CS) trigger intracellular signalling upon binding to Na/K-ATPase. Normal lung and tumour cells frequently express different pump isoforms. Thus, Na/K-ATPase is a powerful target for lung cancer treatment. Drugs targeting Na/K-ATPase may induce apoptosis and autophagy in transformed cells. We argue that Na/K-ATPase has a role as a potential target in chemotherapy in lung cancer treatment. We discuss the effects of Na/K-ATPase ligands and molecular pathways inducing deleterious effects on lung cancer cells, especially those leading to apoptosis and autophagy.

Subnitride chemistry: A first-principles study of the NaBa3N, Na5Ba3N, and Na16Ba6N phases

International Nuclear Information System (INIS)

Oliva, Josep M.

2005-01-01

An ab initio study on the electronic structure of the subnitrides NaBa 3 N, Na 5 Ba 3 N, and Na 16 Ba 6 N is performed for the first time. The NaBa 3 N and Na 5 Ba 3 N phases consist of infinite 1 ∞ [NBa 6/2 ] strands composed of face-sharing NBa 6 octahedra surrounded by a 'sea' of sodium atoms. The Na 16 Ba 6 N phase consist of discrete [NBa 6 ] octahedra arranged in a body-cubic fashion, surrounded by a 'sea' of sodium atoms. Our calculations suggest that the title subnitrides are metals. Analysis of the electronic structure shows partial interaction of N(2s) with Ba(5p) electrons in the lower energy region for NaBa 3 N and Na 5 Ba 3 N. However, no dispersion is observed for the N(2s) and Ba(5p) bands in the cubic phase Na 16 Ba 6 N. The metallic band below the Fermi level shows a strong mixing of N(2p), Ba(6s), Ba(5d), Ba(6p), Na(3s) and Na(3p) orbitals. The metallic character in these nitrides stems from delocalized electrons corresponding to hybridized 5d l 6s m 6p n barium orbitals which interact with hybridized 3s n 3p m sodium orbitals. Analysis of the electron density and electronic structure in these nitrides shows two different regions: a metallic matrix corresponding to the sodium atoms and the regions around them and heteropolar bonding between nitrogen and barium within the infinite 1 ∞ [NBa 6/2 ] strands of the NaBa 3 N and Na 5 Ba 3 N phases, and within the isolated [NBa 6 ] octahedra of the Na 16 Ba 6 N phase. The nitrogen atoms inside the strands and octahedra are negatively charged, the anionic character of nitrogens being larger in the isolated octahedra of the cubic phase Na 16 Ba 6 N, due to the lack of electron delocalization along one direction as opposed to the other phases. The sodium and barium atoms appear to be slightly negatively and positively charged, the latter to a larger extent. From the computed Ba-N overlap populations as well as the analysis of the contour maps of differences between total density and superposition of

WPŁYW WIEKU NA WYTRZYMAŁOŚĆ NA ŚCISKANIE BETONU MODYFIKOWANEGO DODATKIEM METAKAOLINITU

Directory of Open Access Journals (Sweden)

Janusz KONKOL

Full Text Available W artykule przedstawiono wyniki badań wytrzymałości na ściskanie betonów modyfikowanych dodatkiem metakaolinitu po 2, 3, 7, 14, 28 i 56 dniach dojrzewania. Dodatek metakaolinitu użyto jako częściowy substytut cementu, dokonując wymiany 10% masy cementu na metakaolinit. Udział ten uznawany jest za optymalny z uwagi na inne niż wytrzymałość na ściskanie właściwości betonu, w tym trwałość betonu modyfikowanego metakaolinitem. Badania przeprowadzono także dla betonu tła, betonu bez dodatku metakaolinitu. Betony wykonano przy założeniu stałego stosunku woda/spoiwo, względnie woda/cement wynoszącego 0,45 oraz przy użyciu cementu portlandzkiego CEM I 32,5R, piasku kwarcowego frakcji do 2 mm oraz grysu bazaltowego frakcji do 16 mm. W celu uzyskania pożądanej konsystencji mieszanki betonowej zastosowano upłynniacz na bazie estrów polikarboksylowych. Uzyskane rezultaty badań potwierdziły wysoką aktywność pucolanową metakaolinitu już we wczesnym okresie dojrzewania betonu. W okresie między 3 a 7 dniem dojrzewania stwierdzono wolniejszy przyrost wytrzymałości na ściskanie w betonie niemodyfikowanym metakaolinitem, podczas gdy w betonie, w którym 10% masy cementu zastąpiono metakaolinitem uwidocznił się znaczący przyrost wytrzymałości na ściskanie. Po 2 dniach dojrzewania wytrzymałość na ściskanie betonu tła była nieznacznie wyższa od wytrzymałości na ściskanie betonu modyfikowanego. Korzystny wpływ dodatku metakaolinitu wynikający z jego wysokiej aktywności pucolanowej, jak również z uszczelniającego charakteru tego dodatku obserwowano jest zwłaszcza w okresie między 3 a 14 dniem dojrzewania. W tym okresie obserwowano znaczny przyrost wytrzymałości na ściskanie betonu modyfikowanego w porównaniu z wytrzymałością na ściskanie betonu tła. Po 7 i 14 dniach dojrzewania stwierdzono odpowiednio prawie 25% i 21% wzrost wytrzymałości na ściskanie na skutek użycia metakaolinitu.

Teratological studies of DTPA-CaNa3, DTPA-ZnNa3 and quinamic acid in mice

International Nuclear Information System (INIS)

Luo Meichu; Ruan Tianming; Tong Shungao

1989-01-01

DTPA-CaNa 3 , DTPA-ZnNa 3 and quinamic acid are effective chelating agents for removing actinide elements from the body. In this experiment, different doses of DTPA-CaNa 3 , DTPA-ZnNa 3 and quinamic acid were given to mice on gestation days 6-10. Eight groups of mice received 0.8 and 2.0 mM/kg of DTPA-CaNa 3 , 3.8, 7.6, and 11.4 mM/kg of DTPA-ZnNa 3 and 0.42, 2.1, and 4.2 mM/kg of quinamic acid. Hypetonic saline and isotonic saline were given to two control groups. DTPA-CaNa 3 and quinamidic acid were found to be much more toxic to fetus of mice than DTPA-ZnNa 3 . When the doses of DTPA-CaMa 3 and quinamidic acid were 20 times higher than the human dose, the number of resorbed fetus was increased and the number and weight of live fetus were reduced. The result of injection with 7.6 mM/kg (200 times of human dose)DTPA-ZnNa 3 and that of injection with isotonic saline are the same. Therefore, we suggest that the DTPA-CaNa 3 and quinamidic acid should not be given to pregnant woman, if chelation therapy is needed, while the much safer DTPA-ZnNa 3 could be used

Graph Colouring Algorithms

DEFF Research Database (Denmark)

Husfeldt, Thore

2015-01-01

This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...

FRAMEWORK FOR COMPARING SEGMENTATION ALGORITHMS

Directory of Open Access Journals (Sweden)

G. Sithole

2015-05-01

Full Text Available The notion of a ‘Best’ segmentation does not exist. A segmentation algorithm is chosen based on the features it yields, the properties of the segments (point sets it generates, and the complexity of its algorithm. The segmentation is then assessed based on a variety of metrics such as homogeneity, heterogeneity, fragmentation, etc. Even after an algorithm is chosen its performance is still uncertain because the landscape/scenarios represented in a point cloud have a strong influence on the eventual segmentation. Thus selecting an appropriate segmentation algorithm is a process of trial and error. Automating the selection of segmentation algorithms and their parameters first requires methods to evaluate segmentations. Three common approaches for evaluating segmentation algorithms are ‘goodness methods’, ‘discrepancy methods’ and ‘benchmarks’. Benchmarks are considered the most comprehensive method of evaluation. This paper shortcomings in current benchmark methods are identified and a framework is proposed that permits both a visual and numerical evaluation of segmentations for different algorithms, algorithm parameters and evaluation metrics. The concept of the framework is demonstrated on a real point cloud. Current results are promising and suggest that it can be used to predict the performance of segmentation algorithms.

From Genetics to Genetic Algorithms

Indian Academy of Sciences (India)

Genetic algorithms (GAs) are computational optimisation schemes with an ... The algorithms solve optimisation problems ..... Genetic Algorithms in Search, Optimisation and Machine. Learning, Addison-Wesley Publishing Company, Inc. 1989.

Na-ion dynamics in Quasi-1D compound NaV2O4

International Nuclear Information System (INIS)

Månsson, M; Umegaki, I; Nozaki, H; Higuchi, Y; Sugiyama, J; Kawasaki, I; Watanabe, I; Sakurai, H

2014-01-01

We have used the pulsed muon source at ISIS to study high-temperature Na-ion dynamics in the quasi-one-dimensional (Q1D) metallic antiferromagnet NaV 2 O 4 . By performing systematic zero-field and longitudinal-field measurements as a function of temperature we clearly distinguish that the hopping rate increases exponentially above T diff ≈ 250 K. The data is well fitted to an Arrhenius type equation typical for a diffusion process, showing that the Na-ions starts to be mobile above T diff . Such results make this compound very interesting for the tuning of Q1D magnetism using atomic-scale ion-texturing through the periodic potential from ordered Na-vacancies. Further, it also opens the door to possible use of NaV 2 O 4 and related compounds in energy related applications

O Passeio Público do Rio de Janeiro na Literatura, na Pintura e na Fotografia do Século XIX

Directory of Open Access Journals (Sweden)

Solange de Aragão

2012-06-01

Full Text Available Este artigo tem como objetivo geral e mais amplo chamar a atenção dos pesquisadores para a importância da literatura, da pintura e da fotografia como fontes documentais para a construção da História do Paisagismo no Brasil por meio de um estudo de caso muito particular: o Passeio Público do Rio de Janeiro no século XIX. São objetivos específicos apresentar e analisar o modo como esse espaço livre público aparece na literatura, na pintura e na fotografia desse período, considerando suas transformações paisagísticas.

Solubility of NaNd(CO3)2.6H2O(c) in concentrated Na2CO3 and NaHCO3 solutions

International Nuclear Information System (INIS)

Rao, L.; Rai, D.; Felmy, A.R.; Fulton, R.W.; Novak, C.F.

1996-01-01

NaNd(CO 3 ) 2 x 6 H 2 O(c) was identified to be the final equilibrium solid phase in suspensions containing concentrated sodium carbonate (0.1 to 2.0 M) and sodium bicarbonate (0.1 to 1.0 M), with either NaNd(CO 3 ) 2 x 6 H 2 O(c) or Nd 2 (CO 3 ) 3 x xH 2 O(s) as initial solids. A thermodynamic model, based on Pitzer's specific into-interaction approach, was developed to interpret the solubility of NaNd(CO 3 ) 2 x 6 H 2 O(c) as functions of sodium carbonate and sodium bicarbonate concentrations. In this model, the solubility data of NaNd(CO 3 ) 2 x 6 H 2 O(c) were explained by assuming the formation of NdCO 3 + , Nd(CO 3 ) 2 - and Nd(CO 3 ) 3 3- species and invoking the specific ion interactions between Na + and Nd(CO 3 ) 3 3- . Ion interaction parameters for Na + -Nd(CO 3 ) 3 3- were developed to fit the solubility data. Based on the model calculations, Nd(CO 3 ) 3 3- was the predominant aqueous neodymium species in 0.1 to 2 M sodium carbonate and 0.1 to 1 M sodium bicarbonate solutions. The logarithm of the NaNd(CO 3 ) 2 x 6 H 2 O solubility product (NaNd(CO 3 ) 2 x 6 H 2 O(c)=Na + +Nd 3+ +2 CO 3 2- +6 H 2 O) was calculated to be -21.39. This model also provided satisfactory interpretation of the solubility data of the analogous Am(III) system in less concentrated carbonate and bicarbonate solutions. (orig.)

Quantum random-walk search algorithm

International Nuclear Information System (INIS)

Shenvi, Neil; Whaley, K. Birgitta; Kempe, Julia

2003-01-01

Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with O(√(N)) calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms

Prediction of insemination outcomes in Holstein dairy cattle using alternative machine learning algorithms.

Science.gov (United States)

Shahinfar, Saleh; Page, David; Guenther, Jerry; Cabrera, Victor; Fricke, Paul; Weigel, Kent

2014-02-01

When making the decision about whether or not to breed a given cow, knowledge about the expected outcome would have an economic impact on profitability of the breeding program and net income of the farm. The outcome of each breeding can be affected by many management and physiological features that vary between farms and interact with each other. Hence, the ability of machine learning algorithms to accommodate complex relationships in the data and missing values for explanatory variables makes these algorithms well suited for investigation of reproduction performance in dairy cattle. The objective of this study was to develop a user-friendly and intuitive on-farm tool to help farmers make reproduction management decisions. Several different machine learning algorithms were applied to predict the insemination outcomes of individual cows based on phenotypic and genotypic data. Data from 26 dairy farms in the Alta Genetics (Watertown, WI) Advantage Progeny Testing Program were used, representing a 10-yr period from 2000 to 2010. Health, reproduction, and production data were extracted from on-farm dairy management software, and estimated breeding values were downloaded from the US Department of Agriculture Agricultural Research Service Animal Improvement Programs Laboratory (Beltsville, MD) database. The edited data set consisted of 129,245 breeding records from primiparous Holstein cows and 195,128 breeding records from multiparous Holstein cows. Each data point in the final data set included 23 and 25 explanatory variables and 1 binary outcome for of 0.756 ± 0.005 and 0.736 ± 0.005 for primiparous and multiparous cows, respectively. The naïve Bayes algorithm, Bayesian network, and decision tree algorithms showed somewhat poorer classification performance. An information-based variable selection procedure identified herd average conception rate, incidence of ketosis, number of previous (failed) inseminations, days in milk at breeding, and mastitis as the most

Recognition algorithms in knot theory

International Nuclear Information System (INIS)

Dynnikov, I A

2003-01-01

In this paper the problem of constructing algorithms for comparing knots and links is discussed. A survey of existing approaches and basic results in this area is given. In particular, diverse combinatorial methods for representing links are discussed, the Haken algorithm for recognizing a trivial knot (the unknot) and a scheme for constructing a general algorithm (using Haken's ideas) for comparing links are presented, an approach based on representing links by closed braids is described, the known algorithms for solving the word problem and the conjugacy problem for braid groups are described, and the complexity of the algorithms under consideration is discussed. A new method of combinatorial description of knots is given together with a new algorithm (based on this description) for recognizing the unknot by using a procedure for monotone simplification. In the conclusion of the paper several problems are formulated whose solution could help to advance towards the 'algorithmization' of knot theory

Fast algorithm for Morphological Filters

International Nuclear Information System (INIS)

Lou Shan; Jiang Xiangqian; Scott, Paul J

2011-01-01

In surface metrology, morphological filters, which evolved from the envelope filtering system (E-system) work well for functional prediction of surface finish in the analysis of surfaces in contact. The naive algorithms are time consuming, especially for areal data, and not generally adopted in real practice. A fast algorithm is proposed based on the alpha shape. The hull obtained by rolling the alpha ball is equivalent to the morphological opening/closing in theory. The algorithm depends on Delaunay triangulation with time complexity O(nlogn). In comparison to the naive algorithms it generates the opening and closing envelope without combining dilation and erosion. Edge distortion is corrected by reflective padding for open profiles/surfaces. Spikes in the sample data are detected and points interpolated to prevent singularities. The proposed algorithm works well both for morphological profile and area filters. Examples are presented to demonstrate the validity and superiority on efficiency of this algorithm over the naive algorithm.

An Algorithm Computing the Local $b$ Function by an Approximate Division Algorithm in $\\hat{\\mathcal{D}}$

OpenAIRE

Nakayama, Hiromasa

2006-01-01

We give an algorithm to compute the local $b$ function. In this algorithm, we use the Mora division algorithm in the ring of differential operators and an approximate division algorithm in the ring of differential operators with power series coefficient.

Mechanism of μ-conotoxin PIIIA binding to the voltage-gated Na+ channel NaV1.4.

Directory of Open Access Journals (Sweden)

Rong Chen

Full Text Available Several subtypes of voltage-gated Na+ (NaV channels are important targets for pain management. μ-Conotoxins isolated from venoms of cone snails are potent and specific blockers of different NaV channel isoforms. The inhibitory effect of μ-conotoxins on NaV channels has been examined extensively, but the mechanism of toxin specificity has not been understood in detail. Here the known structure of μ-conotoxin PIIIA and a model of the skeletal muscle channel NaV1.4 are used to elucidate elements that contribute to the structural basis of μ-conotoxin binding and specificity. The model of NaV1.4 is constructed based on the crystal structure of the bacterial NaV channel, NaVAb. Six different binding modes, in which the side chain of each of the basic residues carried by the toxin protrudes into the selectivity filter of NaV1.4, are examined in atomic detail using molecular dynamics simulations with explicit solvent. The dissociation constants (Kd computed for two selected binding modes in which Lys9 or Arg14 from the toxin protrudes into the filter of the channel are within 2 fold; both values in close proximity to those determined from dose response data for the block of NaV currents. To explore the mechanism of PIIIA specificity, a double mutant of NaV1.4 mimicking NaV channels resistant to μ-conotoxins and tetrodotoxin is constructed and the binding of PIIIA to this mutant channel examined. The double mutation causes the affinity of PIIIA to reduce by two orders of magnitude.

Muscle K+, Na+, and Cl- disturbances and Na+-K+ pump inactivation: implications for fatigue

DEFF Research Database (Denmark)

McKenna, Michael J; Bangsbo, Jens; Renaud, Jean-Marc

2008-01-01

(+)-ATPase activity during exercise stabilizes Na(+) and K(+) concentration gradients and membrane excitability and thus protects against fatigue. However, during intense contraction some Na(+)-K(+) pumps are inactivated and together with further ionic disturbances, likely precipitate muscle fatigue.......Membrane excitability is a critical regulatory step in skeletal muscle contraction and is modulated by local ionic concentrations, conductances, ion transporter activities, temperature, and humoral factors. Intense fatiguing contractions induce cellular K(+) efflux and Na(+) and Cl(-) influx......, causing pronounced perturbations in extracellular (interstitial) and intracellular K(+) and Na(+) concentrations. Muscle interstitial K(+) concentration may increase 1- to 2-fold to 11-13 mM and intracellular K(+) concentration fall by 1.3- to 1.7-fold; interstitial Na(+) concentration may decline by 10 m...

Introduction to Evolutionary Algorithms

CERN Document Server

Yu, Xinjie

2010-01-01

Evolutionary algorithms (EAs) are becoming increasingly attractive for researchers from various disciplines, such as operations research, computer science, industrial engineering, electrical engineering, social science, economics, etc. This book presents an insightful, comprehensive, and up-to-date treatment of EAs, such as genetic algorithms, differential evolution, evolution strategy, constraint optimization, multimodal optimization, multiobjective optimization, combinatorial optimization, evolvable hardware, estimation of distribution algorithms, ant colony optimization, particle swarm opti

Route, mechanism, and implications of proton import during Na+/K+ exchange by native Na+/K+-ATPase pumps

Science.gov (United States)

Vedovato, Natascia

2014-01-01

A single Na+/K+-ATPase pumps three Na+ outwards and two K+ inwards by alternately exposing ion-binding sites to opposite sides of the membrane in a conformational sequence coupled to pump autophosphorylation from ATP and auto-dephosphorylation. The larger flow of Na+ than K+ generates outward current across the cell membrane. Less well understood is the ability of Na+/K+ pumps to generate an inward current of protons. Originally noted in pumps deprived of external K+ and Na+ ions, as inward current at negative membrane potentials that becomes amplified when external pH is lowered, this proton current is generally viewed as an artifact of those unnatural conditions. We demonstrate here that this inward current also flows at physiological K+ and Na+ concentrations. We show that protons exploit ready reversibility of conformational changes associated with extracellular Na+ release from phosphorylated Na+/K+ pumps. Reversal of a subset of these transitions allows an extracellular proton to bind an acidic side chain and to be subsequently released to the cytoplasm. This back-step of phosphorylated Na+/K+ pumps that enables proton import is not required for completion of the 3 Na+/2 K+ transport cycle. However, the back-step occurs readily during Na+/K+ transport when external K+ ion binding and occlusion are delayed, and it occurs more frequently when lowered extracellular pH raises the probability of protonation of the externally accessible carboxylate side chain. The proton route passes through the Na+-selective binding site III and is distinct from the principal pathway traversed by the majority of transported Na+ and K+ ions that passes through binding site II. The inferred occurrence of Na+/K+ exchange and H+ import during the same conformational cycle of a single molecule identifies the Na+/K+ pump as a hybrid transporter. Whether Na+/K+ pump–mediated proton inflow may have any physiological or pathophysiological significance remains to be clarified. PMID

Route, mechanism, and implications of proton import during Na+/K+ exchange by native Na+/K+-ATPase pumps.

Science.gov (United States)

Vedovato, Natascia; Gadsby, David C

2014-04-01

A single Na(+)/K(+)-ATPase pumps three Na(+) outwards and two K(+) inwards by alternately exposing ion-binding sites to opposite sides of the membrane in a conformational sequence coupled to pump autophosphorylation from ATP and auto-dephosphorylation. The larger flow of Na(+) than K(+) generates outward current across the cell membrane. Less well understood is the ability of Na(+)/K(+) pumps to generate an inward current of protons. Originally noted in pumps deprived of external K(+) and Na(+) ions, as inward current at negative membrane potentials that becomes amplified when external pH is lowered, this proton current is generally viewed as an artifact of those unnatural conditions. We demonstrate here that this inward current also flows at physiological K(+) and Na(+) concentrations. We show that protons exploit ready reversibility of conformational changes associated with extracellular Na(+) release from phosphorylated Na(+)/K(+) pumps. Reversal of a subset of these transitions allows an extracellular proton to bind an acidic side chain and to be subsequently released to the cytoplasm. This back-step of phosphorylated Na(+)/K(+) pumps that enables proton import is not required for completion of the 3 Na(+)/2 K(+) transport cycle. However, the back-step occurs readily during Na(+)/K(+) transport when external K(+) ion binding and occlusion are delayed, and it occurs more frequently when lowered extracellular pH raises the probability of protonation of the externally accessible carboxylate side chain. The proton route passes through the Na(+)-selective binding site III and is distinct from the principal pathway traversed by the majority of transported Na(+) and K(+) ions that passes through binding site II. The inferred occurrence of Na(+)/K(+) exchange and H(+) import during the same conformational cycle of a single molecule identifies the Na(+)/K(+) pump as a hybrid transporter. Whether Na(+)/K(+) pump-mediated proton inflow may have any physiological or

Growth mechanism of NaClO 3 and NaBrO 3 crystals from aqueous ...

Indian Academy of Sciences (India)

A study of growth rates of NaClO3 and NaBrO3 has been carried out using a small growth cell by in situ observation. Normal growth rates of {100} faces of NaClO3 and {111} faces of NaBrO3 along ⟨ 110 ⟩ direction are measured under relatively high supersaturation ranging from 3–8%. In the initial stages of growth, {100}, ...

Rescue of Na+ affinity in aspartate 928 mutants of Na+,K+-ATPase by secondary mutation of glutamate 314.

Science.gov (United States)

Holm, Rikke; Einholm, Anja P; Andersen, Jens P; Vilsen, Bente

2015-04-10

The Na(+),K(+)-ATPase binds Na(+) at three transport sites denoted I, II, and III, of which site III is Na(+)-specific and suggested to be the first occupied in the cooperative binding process activating phosphorylation from ATP. Here we demonstrate that the asparagine substitution of the aspartate associated with site III found in patients with rapid-onset dystonia parkinsonism or alternating hemiplegia of childhood causes a dramatic reduction of Na(+) affinity in the α1-, α2-, and α3-isoforms of Na(+),K(+)-ATPase, whereas other substitutions of this aspartate are much less disruptive. This is likely due to interference by the amide function of the asparagine side chain with Na(+)-coordinating residues in site III. Remarkably, the Na(+) affinity of site III aspartate to asparagine and alanine mutants is rescued by second-site mutation of a glutamate in the extracellular part of the fourth transmembrane helix, distant to site III. This gain-of-function mutation works without recovery of the lost cooperativity and selectivity of Na(+) binding and does not affect the E1-E2 conformational equilibrium or the maximum phosphorylation rate. Hence, the rescue of Na(+) affinity is likely intrinsic to the Na(+) binding pocket, and the underlying mechanism could be a tightening of Na(+) binding at Na(+) site II, possibly via movement of transmembrane helix four. The second-site mutation also improves Na(+),K(+) pump function in intact cells. Rescue of Na(+) affinity and Na(+) and K(+) transport by second-site mutation is unique in the history of Na(+),K(+)-ATPase and points to new possibilities for treatment of neurological patients carrying Na(+),K(+)-ATPase mutations. © 2015 by The American Society for Biochemistry and Molecular Biology, Inc.

Evidence-based algorithm for heparin dosing before cardiopulmonary bypass. Part 1: Development of the algorithm.

Science.gov (United States)

McKinney, Mark C; Riley, Jeffrey B

2007-12-01

The incidence of heparin resistance during adult cardiac surgery with cardiopulmonary bypass has been reported at 15%-20%. The consistent use of a clinical decision-making algorithm may increase the consistency of patient care and likely reduce the total required heparin dose and other problems associated with heparin dosing. After a directed survey of practicing perfusionists regarding treatment of heparin resistance and a literature search for high-level evidence regarding the diagnosis and treatment of heparin resistance, an evidence-based decision-making algorithm was constructed. The face validity of the algorithm decisive steps and logic was confirmed by a second survey of practicing perfusionists. The algorithm begins with review of the patient history to identify predictors for heparin resistance. The definition for heparin resistance contained in the algorithm is an activated clotting time 450 IU/kg heparin loading dose. Based on the literature, the treatment for heparin resistance used in the algorithm is anti-thrombin III supplement. The algorithm seems to be valid and is supported by high-level evidence and clinician opinion. The next step is a human randomized clinical trial to test the clinical procedure guideline algorithm vs. current standard clinical practice.

Algorithmic Principles of Mathematical Programming

NARCIS (Netherlands)

Faigle, Ulrich; Kern, Walter; Still, Georg

2002-01-01

Algorithmic Principles of Mathematical Programming investigates the mathematical structures and principles underlying the design of efficient algorithms for optimization problems. Recent advances in algorithmic theory have shown that the traditionally separate areas of discrete optimization, linear

Correction of quantification errors in pelvic and spinal lesions caused by ignoring higher photon attenuation of bone in [{sup 18}F]NaF PET/MR

Energy Technology Data Exchange (ETDEWEB)

Schramm, Georg, E-mail: georg.schramm@kuleuven.be; Maus, Jens; Hofheinz, Frank; Petr, Jan; Lougovski, Alexandr [Helmholtz-Zentrum Dresden-Rossendorf, Institute of Radiopharmaceutical Cancer Research, Dresden 01328 (Germany); Beuthien-Baumann, Bettina; Oehme, Liane [Department of Nuclear Medicine, University Hospital Carl Gustav Carus, Dresden 01307 (Germany); Platzek, Ivan [Department of Radiology, University Hospital Carl Gustav Carus, Dresden 01307 (Germany); Hoff, Jörg van den [Helmholtz-Zentrum Dresden-Rossendorf, Institute for Radiopharmaceutical Cancer Research, Dresden 01328 (Germany); Department of Nuclear Medicine, University Hospital Carl Gustav Carus, Dresden 01307 (Germany)

2015-11-15

Purpose: MR-based attenuation correction (MRAC) in routine clinical whole-body positron emission tomography and magnetic resonance imaging (PET/MRI) is based on tissue type segmentation. Due to lack of MR signal in cortical bone and the varying signal of spongeous bone, standard whole-body segmentation-based MRAC ignores the higher attenuation of bone compared to the one of soft tissue (MRAC{sub nobone}). The authors aim to quantify and reduce the bias introduced by MRAC{sub nobone} in the standard uptake value (SUV) of spinal and pelvic lesions in 20 PET/MRI examinations with [{sup 18}F]NaF. Methods: The authors reconstructed 20 PET/MR [{sup 18}F]NaF patient data sets acquired with a Philips Ingenuity TF PET/MRI. The PET raw data were reconstructed with two different attenuation images. First, the authors used the vendor-provided MRAC algorithm that ignores the higher attenuation of bone to reconstruct PET{sub nobone}. Second, the authors used a threshold-based algorithm developed in their group to automatically segment bone structures in the [{sup 18}F]NaF PET images. Subsequently, an attenuation coefficient of 0.11 cm{sup −1} was assigned to the segmented bone regions in the MRI-based attenuation image (MRAC{sub bone}) which was used to reconstruct PET{sub bone}. The automatic bone segmentation algorithm was validated in six PET/CT [{sup 18}F]NaF examinations. Relative SUV{sub mean} and SUV{sub max} differences between PET{sub bone} and PET{sub nobone} of 8 pelvic and 41 spinal lesions, and of other regions such as lung, liver, and bladder, were calculated. By varying the assigned bone attenuation coefficient from 0.11 to 0.13 cm{sup −1}, the authors investigated its influence on the reconstructed SUVs of the lesions. Results: The comparison of [{sup 18}F]NaF-based and CT-based bone segmentation in the six PET/CT patients showed a Dice similarity of 0.7 with a true positive rate of 0.72 and a false discovery rate of 0.33. The [{sup 18}F]NaF-based bone

The system NaVO3-Na2WO4-Na2W2O7

International Nuclear Information System (INIS)

Kazanbekov, V.R.; Gasanaliev, A.M.; Kazanbekov, R.G.

1994-01-01

Phase diagrams of sodium metavanadate-sodium ditungstate, sodium metavanadate-sodium tungstate systems and surface of primary crystallization of sodium metavabadate-sodium tungstate-sodium ditungstate system were studied. The system sodium metavanadate-sodium ditungstate is eutectic one. Compound NaVO 3 x2Na 2 WO 4 is formed in solid state in sodium metavanadate-sodium tungstate system. Liquidus surface of sodium metavanadate-sodium tungstate-sodium ditungstate is presented by three crystallization fields of initial components. Composition and melting point of ternary eutectics are determined

ADORE-GA: Genetic algorithm variant of the ADORE algorithm for ROP detector layout optimization in CANDU reactors

International Nuclear Information System (INIS)

Kastanya, Doddy

2012-01-01

Highlights: ► ADORE is an algorithm for CANDU ROP Detector Layout Optimization. ► ADORE-GA is a Genetic Algorithm variant of the ADORE algorithm. ► Robustness test of ADORE-GA algorithm is presented in this paper. - Abstract: The regional overpower protection (ROP) systems protect CANDU® reactors against overpower in the fuel that could reduce the safety margin-to-dryout. The overpower could originate from a localized power peaking within the core or a general increase in the global core power level. The design of the detector layout for ROP systems is a challenging discrete optimization problem. In recent years, two algorithms have been developed to find a quasi optimal solution to this detector layout optimization problem. Both of these algorithms utilize the simulated annealing (SA) algorithm as their optimization engine. In the present paper, an alternative optimization algorithm, namely the genetic algorithm (GA), has been implemented as the optimization engine. The implementation is done within the ADORE algorithm. Results from evaluating the effects of using various mutation rates and crossover parameters are presented in this paper. It has been demonstrated that the algorithm is sufficiently robust in producing similar quality solutions.

Where genetic algorithms excel.

Science.gov (United States)

Baum, E B; Boneh, D; Garrett, C

2001-01-01

We analyze the performance of a genetic algorithm (GA) we call Culling, and a variety of other algorithms, on a problem we refer to as the Additive Search Problem (ASP). We show that the problem of learning the Ising perceptron is reducible to a noisy version of ASP. Noisy ASP is the first problem we are aware of where a genetic-type algorithm bests all known competitors. We generalize ASP to k-ASP to study whether GAs will achieve "implicit parallelism" in a problem with many more schemata. GAs fail to achieve this implicit parallelism, but we describe an algorithm we call Explicitly Parallel Search that succeeds. We also compute the optimal culling point for selective breeding, which turns out to be independent of the fitness function or the population distribution. We also analyze a mean field theoretic algorithm performing similarly to Culling on many problems. These results provide insight into when and how GAs can beat competing methods.

The NA50 segmented target and vertex recognition system

International Nuclear Information System (INIS)

Bellaiche, F.; Cheynis, B.; Contardo, D.; Drapier, O.; Grossiord, J.Y.; Guichard, A.; Haroutunian, R.; Jacquin, M.; Ohlsson-Malek, F.; Pizzi, J.R.

1997-01-01

The NA50 segmented target and vertex recognition system is described. The segmented target consists of 7 sub-targets of 1-2 mm thickness. The vertex recognition system used to determine the sub-target where an interaction has occured is based upon quartz elements which produce Cerenkov light when traversed by charged particles from the interaction. The geometrical arrangement of the quartz elements has been optimized for vertex recognition in 208 Pb-Pb collisions at 158 GeV/nucleon. A simple algorithm provides a vertex recognition efficiency of better than 85% for dimuon trigger events collected with a 1 mm sub-target set-up. A method for recognizing interactions of projectile fragments (nuclei and/or groups of nucleons) is presented. The segmented target allows a large target thickness which together with a high beam intensity (∼10 7 ions/s) enables high statistics measurements. (orig.)

Mao-Gilles Stabilization Algorithm

OpenAIRE

Jérôme Gilles

2013-01-01

Originally, the Mao-Gilles stabilization algorithm was designed to compensate the non-rigid deformations due to atmospheric turbulence. Given a sequence of frames affected by atmospheric turbulence, the algorithm uses a variational model combining optical flow and regularization to characterize the static observed scene. The optimization problem is solved by Bregman Iteration and the operator splitting method. The algorithm is simple, efficient, and can be easily generalized for different sce...

Summer sudden Na number density enhancements measured with the ALOMAR Weber Na Lidar

Directory of Open Access Journals (Sweden)

D. Heinrich

2008-05-01

Full Text Available We present summer Na-densities and atmospheric temperatures measured 80 to 110 km above the Arctic Lidar Observatory for Middle Atmosphere Research (ALOMAR. The Weber Na Lidar is part of ALOMAR, located at 69° N in Norway, 150 km north of the Arctic Circle. The sun does not set here during the summer months, and measurements require a narrowband Faraday Anomalous Dispersion Optical Filter (FADOF.

We discuss an observed sudden enhancement in the Na number density around 22:00 UT on 1 to 2 June 2006. We compare this observation with previous summer measurements and find a frequent appearance of Na number density enhancements near local midnight. We describe the time of appearance, the altitude distribution, the duration and the strength of these enhancements and compare them to winter observations. We investigate possible formation mechanisms and, as others before, we find a strong link between these Na number density enhancements and sporadic E layers.

Summer sudden Na number density enhancements measured with the ALOMAR Weber Na Lidar

Directory of Open Access Journals (Sweden)

D. Heinrich

2008-05-01

Full Text Available We present summer Na-densities and atmospheric temperatures measured 80 to 110 km above the Arctic Lidar Observatory for Middle Atmosphere Research (ALOMAR. The Weber Na Lidar is part of ALOMAR, located at 69° N in Norway, 150 km north of the Arctic Circle. The sun does not set here during the summer months, and measurements require a narrowband Faraday Anomalous Dispersion Optical Filter (FADOF. We discuss an observed sudden enhancement in the Na number density around 22:00 UT on 1 to 2 June 2006. We compare this observation with previous summer measurements and find a frequent appearance of Na number density enhancements near local midnight. We describe the time of appearance, the altitude distribution, the duration and the strength of these enhancements and compare them to winter observations. We investigate possible formation mechanisms and, as others before, we find a strong link between these Na number density enhancements and sporadic E layers.

Efficient GPS Position Determination Algorithms

National Research Council Canada - National Science Library

Nguyen, Thao Q

2007-01-01

... differential GPS algorithm for a network of users. The stand-alone user GPS algorithm is a direct, closed-form, and efficient new position determination algorithm that exploits the closed-form solution of the GPS trilateration equations and works...

Improved autonomous star identification algorithm

International Nuclear Information System (INIS)

Luo Li-Yan; Xu Lu-Ping; Zhang Hua; Sun Jing-Rong

2015-01-01

The log–polar transform (LPT) is introduced into the star identification because of its rotation invariance. An improved autonomous star identification algorithm is proposed in this paper to avoid the circular shift of the feature vector and to reduce the time consumed in the star identification algorithm using LPT. In the proposed algorithm, the star pattern of the same navigation star remains unchanged when the stellar image is rotated, which makes it able to reduce the star identification time. The logarithmic values of the plane distances between the navigation and its neighbor stars are adopted to structure the feature vector of the navigation star, which enhances the robustness of star identification. In addition, some efforts are made to make it able to find the identification result with fewer comparisons, instead of searching the whole feature database. The simulation results demonstrate that the proposed algorithm can effectively accelerate the star identification. Moreover, the recognition rate and robustness by the proposed algorithm are better than those by the LPT algorithm and the modified grid algorithm. (paper)

The Application of Machine Learning Algorithms for Text Mining based on Sentiment Analysis Approach

Directory of Open Access Journals (Sweden)

Reza Samizade

2018-06-01

Full Text Available Classification of the cyber texts and comments into two categories of positive and negative sentiment among social media users is of high importance in the research are related to text mining. In this research, we applied supervised classification methods to classify Persian texts based on sentiment in cyber space. The result of this research is in a form of a system that can decide whether a comment which is published in cyber space such as social networks is considered positive or negative. The comments that are published in Persian movie and movie review websites from 1392 to 1395 are considered as the data set for this research. A part of these data are considered as training and others are considered as testing data. Prior to implementing the algorithms, pre-processing activities such as tokenizing, removing stop words, and n-germs process were applied on the texts. Naïve Bayes, Neural Networks and support vector machine were used for text classification in this study. Out of sample tests showed that there is no evidence indicating that the accuracy of SVM approach is statistically higher than Naïve Bayes or that the accuracy of Naïve Bayes is not statistically higher than NN approach. However, the researchers can conclude that the accuracy of the classification using SVM approach is statistically higher than the accuracy of NN approach in 5% confidence level.

Fluid-structure-coupling algorithm

International Nuclear Information System (INIS)

McMaster, W.H.; Gong, E.Y.; Landram, C.S.; Quinones, D.F.

1980-01-01

A fluid-structure-interaction algorithm has been developed and incorporated into the two dimensional code PELE-IC. This code combines an Eulerian incompressible fluid algorithm with a Lagrangian finite element shell algorithm and incorporates the treatment of complex free surfaces. The fluid structure, and coupling algorithms have been verified by the calculation of solved problems from the literature and from air and steam blowdown experiments. The code has been used to calculate loads and structural response from air blowdown and the oscillatory condensation of steam bubbles in water suppression pools typical of boiling water reactors. The techniques developed here have been extended to three dimensions and implemented in the computer code PELE-3D

Fluid structure coupling algorithm

International Nuclear Information System (INIS)

McMaster, W.H.; Gong, E.Y.; Landram, C.S.; Quinones, D.F.

1980-01-01

A fluid-structure-interaction algorithm has been developed and incorporated into the two-dimensional code PELE-IC. This code combines an Eulerian incompressible fluid algorithm with a Lagrangian finite element shell algorithm and incorporates the treatment of complex free surfaces. The fluid structure and coupling algorithms have been verified by the calculation of solved problems from the literature and from air and steam blowdown experiments. The code has been used to calculate loads and structural response from air blowdown and the oscillatory condensation of steam bubbles in water suppression pools typical of boiling water reactors. The techniques developed have been extended to three dimensions and implemented in the computer code PELE-3D

Majorization arrow in quantum-algorithm design

International Nuclear Information System (INIS)

Latorre, J.I.; Martin-Delgado, M.A.

2002-01-01

We apply majorization theory to study the quantum algorithms known so far and find that there is a majorization principle underlying the way they operate. Grover's algorithm is a neat instance of this principle where majorization works step by step until the optimal target state is found. Extensions of this situation are also found in algorithms based in quantum adiabatic evolution and the family of quantum phase-estimation algorithms, including Shor's algorithm. We state that in quantum algorithms the time arrow is a majorization arrow

Foundations of genetic algorithms 1991

CERN Document Server

1991-01-01

Foundations of Genetic Algorithms 1991 (FOGA 1) discusses the theoretical foundations of genetic algorithms (GA) and classifier systems.This book compiles research papers on selection and convergence, coding and representation, problem hardness, deception, classifier system design, variation and recombination, parallelization, and population divergence. Other topics include the non-uniform Walsh-schema transform; spurious correlations and premature convergence in genetic algorithms; and variable default hierarchy separation in a classifier system. The grammar-based genetic algorithm; condition

Opposition-Based Adaptive Fireworks Algorithm

OpenAIRE

Chibing Gong

2016-01-01

A fireworks algorithm (FWA) is a recent swarm intelligence algorithm that is inspired by observing fireworks explosions. An adaptive fireworks algorithm (AFWA) proposes additional adaptive amplitudes to improve the performance of the enhanced fireworks algorithm (EFWA). The purpose of this paper is to add opposition-based learning (OBL) to AFWA with the goal of further boosting performance and achieving global optimization. Twelve benchmark functions are tested in use of an opposition-based a...

Muziki wa Hip Hop na Haki Za Kijamii: Dhima, Changamoto na ...

African Journals Online (AJOL)

Ni dhahiri kuwa haki za kijamii zinaweza kuwasilishwa kwa jamii pana kupitia sanaa ya hip hop. Makala haya basi, yanabainisha dhima na mchango wa muziki wa hip hop katika masuala ya haki za kijamii, yanafafanua changamoto za muziki huu katika kuwasilisha haki za kijamii na kutoa mapendekezo kwa makundi ...

Sequential growth of sandwiched NaYF{sub 4}:Yb/Er@NaYF{sub 4}:Yb@NaNdF{sub 4}:Yb core–shell–shell nanoparticles for photodynamic therapy

Energy Technology Data Exchange (ETDEWEB)

Peng, Huang-Yong; Ding, Bin-Bin; Ma, Yin-Chu [Department of Medical Materials and Rehabilitation Engineering, School of Medical Engineering, Hefei University of Technology, Hefei 230009 (China); Sun, Shi-Qi [State Key Laboratory of Veterinary Etiological Biology and Key Laboratory of Animal Virology of Ministry of Agriculture, Lanzhou Veterinary Research Institute, Chinese Academy of Agricultural Sciences, Xujiaping 1, Lanzhou, Gansu 730046 (China); Tao, Wei [Department of Medical Materials and Rehabilitation Engineering, School of Medical Engineering, Hefei University of Technology, Hefei 230009 (China); Guo, Yan-Chuan [Technical Institute of Physics and Chemistry, Chinese Academy of Sciences, Beijing 100190 (China); Guo, Hui-Chen, E-mail: ghch-2004@hotmail.com [State Key Laboratory of Veterinary Etiological Biology and Key Laboratory of Animal Virology of Ministry of Agriculture, Lanzhou Veterinary Research Institute, Chinese Academy of Agricultural Sciences, Xujiaping 1, Lanzhou, Gansu 730046 (China); Yang, Xian-Zhu, E-mail: yangxz@hftu.edu.cn [Department of Medical Materials and Rehabilitation Engineering, School of Medical Engineering, Hefei University of Technology, Hefei 230009 (China); Qian, Hai-Sheng, E-mail: shqian@hfut.edu.cn [Department of Medical Materials and Rehabilitation Engineering, School of Medical Engineering, Hefei University of Technology, Hefei 230009 (China)

2015-12-01

Graphical abstract: The monodisperse elliptical NaYF{sub 4}:Yb/Er@NaYF{sub 4}:Yb@NaNdF{sub 4}:Yb core–shell–shell nanoparticles have been synthesized successfully by a facile sequential growth process, which can be used as transducer for photodynamic therapy of cancer cells. - Highlights: • The NaYF{sub 4}:Yb/Er@NaYF{sub 4}:Yb@NaNdF{sub 4}:Yb nanoparticles have been fabricated successfully. • The as-prepared nanoparticles show strong fluorescence excited at 980 or 808 nm. • The nanoparticles were transferred into the aqueous phase via a facile process. • Photosensitizers were loaded into the composites for photodynamic therapy. - Abstract: Upconversion (UC) nanostructures have attracted much interest for their extensive biological applications. In this work, we describe a sequential synthetic route to prepare sandwiched NaYF{sub 4}:Yb/Er@NaYF{sub 4}:Yb@NaNdF{sub 4}:Yb core–shell upconversion nanoparticles. The as-prepared products were investigated by X-ray diffraction (XRD) and transmission electron microscopy (TEM, JEM 2100F), respectively. The as-prepared core–shell nanoparticles of NaYF{sub 4}:Yb/Er@NaYF{sub 4}:Yb@NaNdF{sub 4}:Yb are composed of elliptical nanoparticles with a length of 80 nm and width of 42 nm, which show efficient upconversion fluorescence excited at 808 nm indicating the formation of core–shell–shell sandwiched nanostructures. In addition, the as-prepared sandwiched NaYF{sub 4}:Yb/Er@NaYF{sub 4}:Yb@NaNdF{sub 4}:Yb core–shell upconversion nanoparticles also show strong upconversion fluorescence excited at 980 nm. Amphiphilic mPEG{sub 2k}-b-PEBEP{sub 6K} copolymers (denoted as PPE) were chosen to transfer these hydrophobic UCNPs into the aqueous phase for biological application. In vitro photodynamic therapy of cancer cells show that the viability of cells incubated with the nanoparticles loaded with MC 540 was significantly lower as compared to the nanoparticles without photosensitizers exposed to NIR laser.

Intracellular Na+ regulation of Na+ pump sites in cultured vascular smooth muscle cells

International Nuclear Information System (INIS)

Allen, J.C.; Navran, S.S.; Seidel, C.L.; Dennison, D.K.; Amann, J.M.; Jemelka, S.K.

1989-01-01

Enzymatically dispersed cells from canine saphenous vein and femoral artery were grown in fetal calf serum and studied at day 0 (freshly dispersed) through confluence in primary culture. Intracellular Na levels (Nai), but not intracellular K (Ki), were increased after 24 h in culture and then decreased to a steady state by 4 days. Na+ pump site number [( 3 H] ouabain binding) increased through day 3 and remained elevated. Nai was still elevated at 2 days when the Na+ pump site number began to increase. Total pump turnover (maximum ouabain-inhibited 86 Rb uptake) reflected the increase in Na+ pump site number. These key events precede the observed increases in both protein production and cellular proliferation. If the same cells are maintained in defined medium, without fetal calf serum, Nai, Ki, and the number of [ 3 H]ouabain binding sites do not change with time. These data are consistent with the suggestion that the initial mitogenic response of vascular smooth muscle cells to fetal calf serum involves an increased Na+ influx, and a Nai accumulation, caused by low Na+ pump density. The synthesis of new pump sites effects a decrease in the accumulated Nai, which may be related to cell proliferation

On the Stability of NaO2 in Na-O2 Batteries.

Science.gov (United States)

Liu, Chenjuan; Carboni, Marco; Brant, William R; Pan, Ruijun; Hedman, Jonas; Zhu, Jiefang; Gustafsson, Torbjörn; Younesi, Reza

2018-04-25

Na-O 2 batteries are regarded as promising candidates for energy storage. They have higher energy efficiency, rate capability, and chemical reversibility than Li-O 2 batteries; in addition, sodium is cheaper and more abundant compared to lithium. However, inconsistent observations and instability of discharge products have inhibited the understanding of the working mechanism of this technology. In this work, we have investigated a number of factors that influence the stability of the discharge products. By means of in operando powder X-ray diffraction study, the influence of oxygen, sodium anode, salt, solvent, and carbon cathode were investigated. The Na metal anode and an ether-based solvent are the main factors that lead to the instability and decomposition of NaO 2 in the cell environment. This fundamental insight brings new information on the working mechanism of Na-O 2 batteries.

NaK handling and removal

International Nuclear Information System (INIS)

Desreumaux, J.; Rodriguez, G.; Guigon, A.; Verdelli, J.; Thomine, G.

1997-01-01

Sodium-potassium alloy is used in specific application in French Fast Breeder Reactors as: cold traps, NaK bubbler for argon purification, valves and also in experimental irradiation devices. lt has been preferred to sodium because it is liquid from + 7 deg. C for the most common peritectic alloy. After its use, NaK is considered as a hazardous waste (nuclear or not) due to its high reactivity with air and water. The most important risk remains in handling NaK systems which have not been operated for some time. The NaK will be covered with a crust of the superoxide K02 which is a strong oxidising agent. Thermodynamically, K02 will react with most organic material or metallic dust or swarfs and can also react with additional NaK to give sufficient heat to boil part of the NaK, resulting in a sudden increase in pressure and small explosions. We describe the formation given to experimenters in our Sodium School and the CEA's experience in treating specific devices for transportation, decanting of tanks, tank opening and NaK removal. (author)

Angiotensin II-induced hypertension increases plasma membrane Na pump activity by enhancing Na entry in rat thick ascending limbs.

Science.gov (United States)

Gonzalez-Vicente, Agustin; Garvin, Jeffrey L

2013-11-01

Thick ascending limbs (TAL) reabsorb 30% of the filtered NaCl load. Na enters the cells via apical Na-K-2Cl cotransporters and Na/H exchangers and exits via basolateral Na pumps. Chronic angiotensin II (ANG II) infusion increases net TAL Na transport and Na apical entry; however, little is known about its effects on the basolateral Na pump. We hypothesized that in rat TALs Na pump activity is enhanced by ANG II-infusion, a model of ANG II-induced hypertension. Rats were infused with 200 ng·kg(-1)·min(-1) ANG II or vehicle for 7 days, and TAL suspensions were obtained. We studied plasma membrane Na pump activity by measuring changes in 1) intracellular Na (Nai) induced by ouabain; and 2) ouabain-sensitive oxygen consumption (QO2). We found that the ouabain-sensitive rise in Nai in TALs from ANG II-infused rats was 12.8 ± 0.4 arbitrary fluorescent units (AFU)·mg(-1)·min(-1) compared with only 9.9 ± 1.1 AFU·mg(-1)·min(-1) in controls (P Na pump expression, the number of Na pumps in the plasma membrane, or the affinity for Na. When furosemide (1.1 mg·kg(-1)·day(-1)) was coinfused with ANG II, no increase in plasma membrane Na pump activity was observed. We concluded that in ANG II-induced hypertension Na pump activity is increased in the plasma membrane of TALs and that this increase is caused by the chronically enhanced Na entry occurring in this model.

Chinese handwriting recognition an algorithmic perspective

CERN Document Server

Su, Tonghua

2013-01-01

This book provides an algorithmic perspective on the recent development of Chinese handwriting recognition. Two technically sound strategies, the segmentation-free and integrated segmentation-recognition strategy, are investigated and algorithms that have worked well in practice are primarily focused on. Baseline systems are initially presented for these strategies and are subsequently expanded on and incrementally improved. The sophisticated algorithms covered include: 1) string sample expansion algorithms which synthesize string samples from isolated characters or distort realistic string samples; 2) enhanced feature representation algorithms, e.g. enhanced four-plane features and Delta features; 3) novel learning algorithms, such as Perceptron learning with dynamic margin, MPE training and distributed training; and lastly 4) ensemble algorithms, that is, combining the two strategies using both parallel structure and serial structure. All the while, the book moves from basic to advanced algorithms, helping ...

Combinatorial algorithms

CERN Document Server

Hu, T C

2002-01-01

Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9

Silicene for Na-ion battery applications

KAUST Repository

Zhu, Jiajie

2016-08-19

Na-ion batteries are promising candidates to replace Li-ion batteries in large scale applications because of the advantages in natural abundance and cost of Na. Silicene has potential as the anode in Li-ion batteries but so far has not received attention with respect to Na-ion batteries. In this context, freestanding silicene, a graphene-silicene-graphene heterostructure, and a graphene-silicene superlattice are investigated for possible application in Na-ion batteries, using first-principles calculations. The calculated Na capacities of 954mAh/g for freestanding silicene and 730mAh/g for the graphenesilicene superlattice (10% biaxial tensile strain) are highly competitive and potentials of >0.3 V against the Na/Na potential exceed the corresponding value of graphite. In addition, the diffusion barriers are predicted to be <0.3 eV.

THE APPROACHING TRAIN DETECTION ALGORITHM

OpenAIRE

S. V. Bibikov

2015-01-01

The paper deals with detection algorithm for rail vibroacoustic waves caused by approaching train on the background of increased noise. The urgency of algorithm development for train detection in view of increased rail noise, when railway lines are close to roads or road intersections is justified. The algorithm is based on the method of weak signals detection in a noisy environment. The information statistics ultimate expression is adjusted. We present the results of algorithm research and t...

Combinatorial optimization algorithms and complexity

CERN Document Server

Papadimitriou, Christos H

1998-01-01

This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering.

Hydrolysis of Rice Straw Pretreated by Na2SO3 Over Fe-resin/NaCl

Directory of Open Access Journals (Sweden)

YANG Hui

2017-05-01

Full Text Available To increase the conversion of rice straw(RS and the yield of products, we employed three methods, which were ultrasonic wave, steam explosion and Na2SO3 pretreatment to pretreat RS(the treated RS noted as CS-RS, ZQ-RS and Na2SO3-RS, respectively and found that Na2SO3 treatment was the best pretreatment method based on XRD, SEM, elemental analysis and content of cellulose, hemicellulose and lignin. The conversion of Na2SO3-RS and the yield of total reducing sugar(TRS and levulinic acid(LA were 97.3%, 29.6% and 13.5%, respectively by 10% Fe-resin in 3.3% NaCl solution under 200 ℃.

Enhanced sampling algorithms.

Science.gov (United States)

Mitsutake, Ayori; Mori, Yoshiharu; Okamoto, Yuko

2013-01-01

In biomolecular systems (especially all-atom models) with many degrees of freedom such as proteins and nucleic acids, there exist an astronomically large number of local-minimum-energy states. Conventional simulations in the canonical ensemble are of little use, because they tend to get trapped in states of these energy local minima. Enhanced conformational sampling techniques are thus in great demand. A simulation in generalized ensemble performs a random walk in potential energy space and can overcome this difficulty. From only one simulation run, one can obtain canonical-ensemble averages of physical quantities as functions of temperature by the single-histogram and/or multiple-histogram reweighting techniques. In this article we review uses of the generalized-ensemble algorithms in biomolecular systems. Three well-known methods, namely, multicanonical algorithm, simulated tempering, and replica-exchange method, are described first. Both Monte Carlo and molecular dynamics versions of the algorithms are given. We then present various extensions of these three generalized-ensemble algorithms. The effectiveness of the methods is tested with short peptide and protein systems.

Na+/H+ and Na+/NH4+ exchange activities of zebrafish NHE3b expressed in Xenopus oocytes

Science.gov (United States)

Ito, Yusuke; Kato, Akira; Hirata, Taku; Hirose, Shigehisa

2014-01-01

Zebrafish Na+/H+ exchanger 3b (zNHE3b) is highly expressed in the apical membrane of ionocytes where Na+ is absorbed from ion-poor fresh water against a concentration gradient. Much in vivo data indicated that zNHE3b is involved in Na+ absorption but not leakage. However, zNHE3b-mediated Na+ absorption has not been thermodynamically explained, and zNHE3b activity has not been measured. To address this issue, we overexpressed zNHE3b in Xenopus oocytes and characterized its activity by electrophysiology. Exposure of zNHE3b oocytes to Na+-free media resulted in significant decrease in intracellular pH (pHi) and intracellular Na+ activity (aNai). aNai increased significantly when the cytoplasm was acidified by media containing CO2-HCO3− or butyrate. Activity of zNHE3b was inhibited by amiloride or 5-ethylisopropyl amiloride (EIPA). Although the activity was accompanied by a large hyperpolarization of ∼50 mV, voltage-clamp experiments showed that Na+/H+ exchange activity of zNHE3b is electroneutral. Exposure of zNHE3b oocytes to medium containing NH3/NH4+ resulted in significant decreases in pHi and aNai and significant increase in intracellular NH4+ activity, indicating that zNHE3b mediates the Na+/NH4+ exchange. In low-Na+ (0.5 mM) media, zNHE3b oocytes maintained aNai of 1.3 mM, and Na+-influx was observed when pHi was decreased by media containing CO2-HCO3− or butyrate. These results provide thermodynamic evidence that zNHE3b mediates Na+ absorption from ion-poor fresh water by its Na+/H+ and Na+/NH4+ exchange activities. PMID:24401990

Economic dispatch using chaotic bat algorithm

International Nuclear Information System (INIS)

Adarsh, B.R.; Raghunathan, T.; Jayabarathi, T.; Yang, Xin-She

2016-01-01

This paper presents the application of a new metaheuristic optimization algorithm, the chaotic bat algorithm for solving the economic dispatch problem involving a number of equality and inequality constraints such as power balance, prohibited operating zones and ramp rate limits. Transmission losses and multiple fuel options are also considered for some problems. The chaotic bat algorithm, a variant of the basic bat algorithm, is obtained by incorporating chaotic sequences to enhance its performance. Five different example problems comprising 6, 13, 20, 40 and 160 generating units are solved to demonstrate the effectiveness of the algorithm. The algorithm requires little tuning by the user, and the results obtained show that it either outperforms or compares favorably with several existing techniques reported in literature. - Highlights: • The chaotic bat algorithm, a new metaheuristic optimization algorithm has been used. • The problem solved – the economic dispatch problem – is nonlinear, discontinuous. • It has number of equality and inequality constraints. • The algorithm has been demonstrated to be applicable on high dimensional problems.

Inclusive Flavour Tagging Algorithm

International Nuclear Information System (INIS)

Likhomanenko, Tatiana; Derkach, Denis; Rogozhnikov, Alex

2016-01-01

Identifying the flavour of neutral B mesons production is one of the most important components needed in the study of time-dependent CP violation. The harsh environment of the Large Hadron Collider makes it particularly hard to succeed in this task. We present an inclusive flavour-tagging algorithm as an upgrade of the algorithms currently used by the LHCb experiment. Specifically, a probabilistic model which efficiently combines information from reconstructed vertices and tracks using machine learning is proposed. The algorithm does not use information about underlying physics process. It reduces the dependence on the performance of lower level identification capacities and thus increases the overall performance. The proposed inclusive flavour-tagging algorithm is applicable to tag the flavour of B mesons in any proton-proton experiment. (paper)

Distributed k-Means Algorithm and Fuzzy c-Means Algorithm for Sensor Networks Based on Multiagent Consensus Theory.

Science.gov (United States)

Qin, Jiahu; Fu, Weiming; Gao, Huijun; Zheng, Wei Xing

2016-03-03

This paper is concerned with developing a distributed k-means algorithm and a distributed fuzzy c-means algorithm for wireless sensor networks (WSNs) where each node is equipped with sensors. The underlying topology of the WSN is supposed to be strongly connected. The consensus algorithm in multiagent consensus theory is utilized to exchange the measurement information of the sensors in WSN. To obtain a faster convergence speed as well as a higher possibility of having the global optimum, a distributed k-means++ algorithm is first proposed to find the initial centroids before executing the distributed k-means algorithm and the distributed fuzzy c-means algorithm. The proposed distributed k-means algorithm is capable of partitioning the data observed by the nodes into measure-dependent groups which have small in-group and large out-group distances, while the proposed distributed fuzzy c-means algorithm is capable of partitioning the data observed by the nodes into different measure-dependent groups with degrees of membership values ranging from 0 to 1. Simulation results show that the proposed distributed algorithms can achieve almost the same results as that given by the centralized clustering algorithms.

The relation between aging, aortic NaF avidity and coronary artery NaF avidity: A NaF PET CT study

DEFF Research Database (Denmark)

Blomberg, Björn; Thomassen, Anders; Hildebrandt, Malene

2013-01-01

volunteers without traditional cardiovascular risk factors were prospectively assessed by Sodium 18-Fluoride (Na-18F) PET CT imaging. Global aortic uptake of Na-18F was determined by calculating the average aortic blood pool subtracted maximum standardized uptake value (cSUV) [maximum SUVaorta - mean...

A survey of parallel multigrid algorithms

Science.gov (United States)

Chan, Tony F.; Tuminaro, Ray S.

1987-01-01

A typical multigrid algorithm applied to well-behaved linear-elliptic partial-differential equations (PDEs) is described. Criteria for designing and evaluating parallel algorithms are presented. Before evaluating the performance of some parallel multigrid algorithms, consideration is given to some theoretical complexity results for solving PDEs in parallel and for executing the multigrid algorithm. The effect of mapping and load imbalance on the partial efficiency of the algorithm is studied.

Rescue of Na+ and H+ binding in Na+,K+-ATPase M8 aspartate mutants by secondary mutation

DEFF Research Database (Denmark)

Holm, Rikke; Einholm, Anja P.; Andersen, Jens Peter

A mutation replacing the aspartate in transmembrane segment M8 in the a3-isoform of Na,K-ATPase with asparagine has been found in patients with rapid-onset dystonia parkinsonism or alternating hemiplegia of childhood. This aspartate may be a critical Na+ coordinating residue, but the crystal......-isoforms of Na,K-ATPase, and much smaller effects were seen for other mutations to the M8 aspartate, which were less disruptive of Na+ binding than mutations to other residues related to Na+ site III. The D928 (rat a1 numbering) mutations strongly diminished the cooperativity of Na+ binding. Moreover the p......H optimum of Na,K-ATPase activity was left-shifted, again with D928N being most disruptive. The reduced affinity for activating Na+ and for inhibitory protons, caused by D928N and D928A mutations, could be rescued by introduction of an additional mutation of a glutamate located far away from D928....

Autodriver algorithm

Directory of Open Access Journals (Sweden)

Anna Bourmistrova

2011-02-01

Full Text Available The autodriver algorithm is an intelligent method to eliminate the need of steering by a driver on a well-defined road. The proposed method performs best on a four-wheel steering (4WS vehicle, though it is also applicable to two-wheel-steering (TWS vehicles. The algorithm is based on coinciding the actual vehicle center of rotation and road center of curvature, by adjusting the kinematic center of rotation. The road center of curvature is assumed prior information for a given road, while the dynamic center of rotation is the output of dynamic equations of motion of the vehicle using steering angle and velocity measurements as inputs. We use kinematic condition of steering to set the steering angles in such a way that the kinematic center of rotation of the vehicle sits at a desired point. At low speeds the ideal and actual paths of the vehicle are very close. With increase of forward speed the road and tire characteristics, along with the motion dynamics of the vehicle cause the vehicle to turn about time-varying points. By adjusting the steering angles, our algorithm controls the dynamic turning center of the vehicle so that it coincides with the road curvature center, hence keeping the vehicle on a given road autonomously. The position and orientation errors are used as feedback signals in a closed loop control to adjust the steering angles. The application of the presented autodriver algorithm demonstrates reliable performance under different driving conditions.

Quantum algorithm for support matrix machines

Science.gov (United States)

Duan, Bojia; Yuan, Jiabin; Liu, Ying; Li, Dan

2017-09-01

We propose a quantum algorithm for support matrix machines (SMMs) that efficiently addresses an image classification problem by introducing a least-squares reformulation. This algorithm consists of two core subroutines: a quantum matrix inversion (Harrow-Hassidim-Lloyd, HHL) algorithm and a quantum singular value thresholding (QSVT) algorithm. The two algorithms can be implemented on a universal quantum computer with complexity O[log(npq) ] and O[log(pq)], respectively, where n is the number of the training data and p q is the size of the feature space. By iterating the algorithms, we can find the parameters for the SMM classfication model. Our analysis shows that both HHL and QSVT algorithms achieve an exponential increase of speed over their classical counterparts.

Salinity tolerance in barley (hordeum vulgare l.): effects of varying NaCl, K/sup +/ Na/sup +/ and NaHCO/sub 3/ levels on cultivars differing in tolerance

International Nuclear Information System (INIS)

Mahmood, K.

2011-01-01

Although barley (Hordeum vulgare L.) is regarded as salt tolerant among crop plants, its growth and plant development is severely affected by ionic and osmotic stresses in salt-affected soils. To elucidate the tolerance mechanism, growth and ion uptake of three barley cultivars, differing in salt tolerance, were examined under different levels of NaCl, K/sup +/ Na/sup +/ and NaHCO/sub 3/ in the root medium. The cultivars differed greatly in their responses to varying root medium conditions. Plant growth was more adversely affected by NaHCO/sub 3/ than NaCl. In general, biomass yields were comparable under control and 100 mM NaCl. However, growth of all three cultivars was significantly inhibited by NaHCO/sub 3/ even at low concentration (10 mM). Improved K/sup +/ supply in saline medium increased K/sup +/ uptake and growth of less tolerant cultivars. K/sup +/ uptake was more adversely affected by NaHCO/sub 3/ than NaCl salinity. Selective K/sup +/ uptake and lower Cl/sup -/ in shoots seemed to be associated with the growth responses. K application would help better growth of these cultivars on K-deficient saline-sodic soils and under irrigation with poor quality water having high Residual Sodium Carbonate (RSC) and/or Sodium Adsorption Ratio (SAR). (author)

Mao-Gilles Stabilization Algorithm

Directory of Open Access Journals (Sweden)

Jérôme Gilles

2013-07-01

Full Text Available Originally, the Mao-Gilles stabilization algorithm was designed to compensate the non-rigid deformations due to atmospheric turbulence. Given a sequence of frames affected by atmospheric turbulence, the algorithm uses a variational model combining optical flow and regularization to characterize the static observed scene. The optimization problem is solved by Bregman Iteration and the operator splitting method. The algorithm is simple, efficient, and can be easily generalized for different scenarios involving non-rigid deformations.

Glutathionylation-Dependence of Na+-K+-Pump Currents Can Mimic Reduced Subsarcolemmal Na+ Diffusion

OpenAIRE

Garcia, Alvaro; Liu, Chia-Chi; Cornelius, Flemming; Clarke, Ronald?J.; Rasmussen, Helge?H.

2016-01-01

The existence of a subsarcolemmal space with restricted diffusion for Na+ in cardiac myocytes has been inferred from a transient peak electrogenic Na+-K+ pump current beyond steady state on reexposure of myocytes to K+ after a period of exposure to K+-free extracellular solution. The transient peak current is attributed to enhanced electrogenic pumping of Na+ that accumulated in the diffusion-restricted space during pump inhibition in K+-free extracellular solution. However, there are no know...

Effects of visualization on algorithm comprehension

Science.gov (United States)

Mulvey, Matthew

Computer science students are expected to learn and apply a variety of core algorithms which are an essential part of the field. Any one of these algorithms by itself is not necessarily extremely complex, but remembering the large variety of algorithms and the differences between them is challenging. To address this challenge, we present a novel algorithm visualization tool designed to enhance students understanding of Dijkstra's algorithm by allowing them to discover the rules of the algorithm for themselves. It is hoped that a deeper understanding of the algorithm will help students correctly select, adapt and apply the appropriate algorithm when presented with a problem to solve, and that what is learned here will be applicable to the design of other visualization tools designed to teach different algorithms. Our visualization tool is currently in the prototype stage, and this thesis will discuss the pedagogical approach that informs its design, as well as the results of some initial usability testing. Finally, to clarify the direction for further development of the tool, four different variations of the prototype were implemented, and the instructional effectiveness of each was assessed by having a small sample participants use the different versions of the prototype and then take a quiz to assess their comprehension of the algorithm.

Myocardial Na,K-ATPase: Clinical aspects

OpenAIRE

Kjeldsen, Keld

2003-01-01

The specific binding of digitalis glycosides to Na,K-ATPase is used as a tool for Na,K-ATPase quantification with high accuracy and precision. In myocardial biopsies from patients with heart failure, total Na,K-ATPase concentration is decreased by around 40%; a correlation exists between a decrease in heart function and a decrease in Na,K-ATPase concentration. During digitalization, around 30% of remaining pumps are occupied by digoxin. Myocardial Na,K-ATPase is also influenced by other drugs...

Down-Regulation of the Na+-Coupled Phosphate Transporter NaPi-IIa by AMP-Activated Protein Kinase

Directory of Open Access Journals (Sweden)

Miribane Dërmaku-Sopjani

2013-11-01

Full Text Available Background/Aims: The Na+-coupled phosphate transporter NaPi-IIa is the main carrier accomplishing renal tubular phosphate reabsorption. It is driven by the electrochemical Na+ gradient across the apical cell membrane, which is maintained by Na+ extrusion across the basolateral cell membrane through the Na+/K+ ATPase. The operation of NaPi-IIa thus requires energy in order to avoid cellular Na+ accumulation and K+ loss with eventual decrease of cell membrane potential, Cl- entry and cell swelling. Upon energy depletion, early inhibition of Na+-coupled transport processes may delay cell swelling and thus foster cell survival. Energy depletion is sensed by the AMP-activated protein kinase (AMPK, a serine/threonine kinase stimulating several cellular mechanisms increasing energy production and limiting energy utilization. The present study explored whether AMPK influences the activity of NAPi-IIa. Methods: cRNA encoding NAPi-IIa was injected into Xenopus oocytes with or without additional expression of wild-type AMPK (AMPKα1-HA+AMPKβ1-Flag+AMPKγ1-HA, of inactive AMPKαK45R (AMPKα1K45R+AMPKβ1-Flag+AMPKγ1-HA or of constitutively active AMPKγR70Q (AMPKα1-HA+AMPKβ1-Flag+AMPKγ1R70Q. NaPi-IIa activity was estimated from phosphate-induced current in dual electrode voltage clamp experiments. Results: In NaPi-IIa-expressing, but not in water-injected Xenopus oocytes, the addition of phosphate (1 mM to the extracellular bath solution generated a current (Ip, which was significantly decreased by coexpression of wild-type AMPK and of AMPKγR70Q but not of AMPKαK45R. The phosphate-induced current in NaPi-IIa- and AMPK-expressing Xenopus ooocytes was significantly increased by AMPK inhibitor Compound C (20 µM. Kinetic analysis revealed that AMPK significantly decreased the maximal transport rate. Conclusion: The AMP-activated protein kinase AMPK is a powerful regulator of NaPi-IIa and thus of renal tubular phosphate transport.

Algorithmic approach to diagram techniques

International Nuclear Information System (INIS)

Ponticopoulos, L.

1980-10-01

An algorithmic approach to diagram techniques of elementary particles is proposed. The definition and axiomatics of the theory of algorithms are presented, followed by the list of instructions of an algorithm formalizing the construction of graphs and the assignment of mathematical objects to them. (T.A.)

Multisensor data fusion algorithm development

Energy Technology Data Exchange (ETDEWEB)

Yocky, D.A.; Chadwick, M.D.; Goudy, S.P.; Johnson, D.K.

1995-12-01

This report presents a two-year LDRD research effort into multisensor data fusion. We approached the problem by addressing the available types of data, preprocessing that data, and developing fusion algorithms using that data. The report reflects these three distinct areas. First, the possible data sets for fusion are identified. Second, automated registration techniques for imagery data are analyzed. Third, two fusion techniques are presented. The first fusion algorithm is based on the two-dimensional discrete wavelet transform. Using test images, the wavelet algorithm is compared against intensity modulation and intensity-hue-saturation image fusion algorithms that are available in commercial software. The wavelet approach outperforms the other two fusion techniques by preserving spectral/spatial information more precisely. The wavelet fusion algorithm was also applied to Landsat Thematic Mapper and SPOT panchromatic imagery data. The second algorithm is based on a linear-regression technique. We analyzed the technique using the same Landsat and SPOT data.

A new cluster algorithm for graphs

NARCIS (Netherlands)

S. van Dongen

1998-01-01

textabstractA new cluster algorithm for graphs called the emph{Markov Cluster algorithm ($MCL$ algorithm) is introduced. The graphs may be both weighted (with nonnegative weight) and directed. Let~$G$~be such a graph. The $MCL$ algorithm simulates flow in $G$ by first identifying $G$ in a

Thermodynamic study of NaFe complex oxides. High temperature properties of Na sub 5 FeO sub 4 and Na sub 3 FeO sub 3

CERN Document Server

Furukawa, T

2002-01-01

In order to contribute the investigation into corrosion mechanism of the structural materials by leakage sodium, thermodynamic study of Na-Fe complex oxides formed by the reactions was carried out. Na sub 5 FeO sub 4 and Na sub 3 FeO sub 3 were used as the sample. Its high temperature properties (i.e. melting, solidification and transformation) were observed by Differential Scanning Calorimetry, DSC. Moreover, the original test named 'melting point confirmation test' was performed for the observation of traces of melting and solidification after the tests. Following contents have been obtained by this study. (1) Na sub 5 FeO sub 4 was stably as the solid without phase transformation and melting until 800degC. However, the compound was showing a tendency to change into Na sub 4 FeO sub 3 with temperature increasing under the low oxygen potential. (2) The stability of Na sub 3 FeO sub 3 is the same as that of Na sub 5 FeO sub 4 until 700degC. Over the temperature, the compound was changed differential compound ...

Metallic Na formation in NaCl crystals with irradiation of electron or vacuum ultraviolet photon

Energy Technology Data Exchange (ETDEWEB)

Owaki, Shigehiro [Osaka Prefecture Univ., Sakai, Osaka (Japan). Coll. of Integrated Arts and Sciences; Koyama, Shigeko; Takahashi, Masao; Kamada, Masao; Suzuki, Ryouichi

1997-03-01

Metallic Na was formed in NaCl single crystals with irradiation of a variety of radiation sources and analyzed the physical states with several methods. In the case of irradiation of 21 MeV electron pulses to the crystal blocks, the optical absorption and lifetime measurement of positron annihilation indicated appearance of Na clusters inside. Radiation effects of electron beam of 30 keV to the crystals in vacuum showed the appearance of not only metallic Na but atomic one during irradiation with Auger electron spectroscopy. Intense photon fluxes in vacuum ultraviolet region of synchrotron radiation were used as another source and an analyzing method of ultraviolet photoelectron spectroscopy. The results showed the metallic Na layered so thick that bulk plasmon can exist. (author)

An overview of smart grid routing algorithms

Science.gov (United States)

Wang, Junsheng; OU, Qinghai; Shen, Haijuan

2017-08-01

This paper summarizes the typical routing algorithm in smart grid by analyzing the communication business and communication requirements of intelligent grid. Mainly from the two kinds of routing algorithm is analyzed, namely clustering routing algorithm and routing algorithm, analyzed the advantages and disadvantages of two kinds of typical routing algorithm in routing algorithm and applicability.

A Parametric k-Means Algorithm

Science.gov (United States)

Tarpey, Thaddeus

2007-01-01

Summary The k points that optimally represent a distribution (usually in terms of a squared error loss) are called the k principal points. This paper presents a computationally intensive method that automatically determines the principal points of a parametric distribution. Cluster means from the k-means algorithm are nonparametric estimators of principal points. A parametric k-means approach is introduced for estimating principal points by running the k-means algorithm on a very large simulated data set from a distribution whose parameters are estimated using maximum likelihood. Theoretical and simulation results are presented comparing the parametric k-means algorithm to the usual k-means algorithm and an example on determining sizes of gas masks is used to illustrate the parametric k-means algorithm. PMID:17917692

DNABIT Compress – Genome compression algorithm

Science.gov (United States)

Rajarajeswari, Pothuraju; Apparao, Allam

2011-01-01

Data compression is concerned with how information is organized in data. Efficient storage means removal of redundancy from the data being stored in the DNA molecule. Data compression algorithms remove redundancy and are used to understand biologically important molecules. We present a compression algorithm, “DNABIT Compress” for DNA sequences based on a novel algorithm of assigning binary bits for smaller segments of DNA bases to compress both repetitive and non repetitive DNA sequence. Our proposed algorithm achieves the best compression ratio for DNA sequences for larger genome. Significantly better compression results show that “DNABIT Compress” algorithm is the best among the remaining compression algorithms. While achieving the best compression ratios for DNA sequences (Genomes),our new DNABIT Compress algorithm significantly improves the running time of all previous DNA compression programs. Assigning binary bits (Unique BIT CODE) for (Exact Repeats, Reverse Repeats) fragments of DNA sequence is also a unique concept introduced in this algorithm for the first time in DNA compression. This proposed new algorithm could achieve the best compression ratio as much as 1.58 bits/bases where the existing best methods could not achieve a ratio less than 1.72 bits/bases. PMID:21383923

Some software algorithms for microprocessor ratemeters

International Nuclear Information System (INIS)

Savic, Z.

1991-01-01

After a review of the basic theoretical ratemeter problem and a general discussion of microprocessor ratemeters, a short insight into their hardware organization is given. Three software algorithms are described: the old ones the quasi-exponential and floating mean algorithm, and a new weighted moving average algorithm. The equations for statistical characterization of the new algorithm are given and an intercomparison is made. It is concluded that the new algorithm has statistical advantages over the old ones. (orig.)

Some software algorithms for microprocessor ratemeters

Energy Technology Data Exchange (ETDEWEB)

Savic, Z. (Military Technical Inst., Belgrade (Yugoslavia))

1991-03-15

After a review of the basic theoretical ratemeter problem and a general discussion of microprocessor ratemeters, a short insight into their hardware organization is given. Three software algorithms are described: the old ones the quasi-exponential and floating mean algorithm, and a new weighted moving average algorithm. The equations for statistical characterization of the new algorithm are given and an intercomparison is made. It is concluded that the new algorithm has statistical advantages over the old ones. (orig.).

Higher-order force gradient symplectic algorithms

Science.gov (United States)

Chin, Siu A.; Kidwell, Donald W.

2000-12-01

We show that a recently discovered fourth order symplectic algorithm, which requires one evaluation of force gradient in addition to three evaluations of the force, when iterated to higher order, yielded algorithms that are far superior to similarly iterated higher order algorithms based on the standard Forest-Ruth algorithm. We gauge the accuracy of each algorithm by comparing the step-size independent error functions associated with energy conservation and the rotation of the Laplace-Runge-Lenz vector when solving a highly eccentric Kepler problem. For orders 6, 8, 10, and 12, the new algorithms are approximately a factor of 103, 104, 104, and 105 better.

The Retina Algorithm

CERN Multimedia

CERN. Geneva; PUNZI, Giovanni

2015-01-01

Charge particle reconstruction is one of the most demanding computational tasks found in HEP, and it becomes increasingly important to perform it in real time. We envision that HEP would greatly benefit from achieving a long-term goal of making track reconstruction happen transparently as part of the detector readout ("detector-embedded tracking"). We describe here a track-reconstruction approach based on a massively parallel pattern-recognition algorithm, inspired by studies of the processing of visual images by the brain as it happens in nature ('RETINA algorithm'). It turns out that high-quality tracking in large HEP detectors is possible with very small latencies, when this algorithm is implemented in specialized processors, based on current state-of-the-art, high-speed/high-bandwidth digital devices.

Scintillation efficiency measurement of Na recoils in NaI(Tl) below the DAMA/LIBRA energy threshold

Energy Technology Data Exchange (ETDEWEB)

Xu, Jingke; Shields, Emily; Calaprice, Frank; Westerdale, Shawn; Froborg, Francis; Suerfu, Burkhant; Alexander, Thomas; Aprahamian, Ani; Back, Henning O.; Casarella, Clark; Fang, Xiao; Gupta, Yogesh K.; Ianni, Aldo; Lamere, Edward; Lippincott, W. Hugh; Liu, Qian; Lyons, Stephanie; Siegl, Kevin; Smith, Mallory; Tan, Wanpeng; Kolk, Bryant Vande

2015-07-01

The dark matter interpretation of the DAMA modulation signal depends on the NaI(Tl) scintillation efficiency of nuclear recoils. Previous measurements for Na recoils have large discrepancies, especially in the DAMA/LIBRA modulation energy region. We report a quenching effect measurement of Na recoils in NaI(Tl) from 3 to 52 keVnr, covering the whole DAMA/LIBRA energy region for dark matter-Na scattering interpretations. By using a low-energy, pulsed neutron beam, a double time-of-flight technique, and pulse-shape discrimination methods, we obtained the most accurate measurement of this kind for NaI(Tl) to date. The results differ significantly from the DAMA reported values at low energies but fall between the other previous measurements. We present the implications of the new quenching results for the dark matter interpretation of the DAMA modulation signal.

Synthesis of Ag or Pt Nanoparticles by Hydrolysis of Either Ag2Na or PtNa

Directory of Open Access Journals (Sweden)

Huabin Wang

2008-01-01

Full Text Available Ag and Pt nanoparticles have successfully been synthesized by hydrolysis of either Ag2Na or PtNa at room temperature. The oxidation of sodium in the Pt-Na pellets was much faster than that in the Ag-Na pellets since Pt is a catalyst for H2O formation reaction from hydrogen and oxygen at room temperature. The hydrolysis byproduct, NaOH, has a high solubility and easily is removed. This method offers a simple method of preparing transition metal nanoparticles. The Ag and Pt nanoparticles prepared by this method were crystalline in nature, and spherical in shape with a mean size of around 10 nm.

Machine Learning an algorithmic perspective

CERN Document Server

Marsland, Stephen

2009-01-01

Traditional books on machine learning can be divided into two groups - those aimed at advanced undergraduates or early postgraduates with reasonable mathematical knowledge and those that are primers on how to code algorithms. The field is ready for a text that not only demonstrates how to use the algorithms that make up machine learning methods, but also provides the background needed to understand how and why these algorithms work. Machine Learning: An Algorithmic Perspective is that text.Theory Backed up by Practical ExamplesThe book covers neural networks, graphical models, reinforcement le

Dynamic polarizabilities and Van der Waals coefficients for alkali atoms Li, Na and alkali dimer molecules Li2, Na2 and NaLi

Science.gov (United States)

Mérawa, M.; Dargelos, A.

1998-07-01

The present paper gives an account of investigations of the polarizability of the alkali atoms Li, Na, diatomics homonuclear and heteronuclear Li2, Na2 and NaLi at SCF (Self Consistent Field) level of approximation and at correlated level, using a time Time-Dependent Gauge Invariant method (TDGI). Our static polarizability values agree with the best experimental and theoretical determinations. The Van der Waals C6 coefficients for the atom-atom, atom-dimer and dimer-dimer interactions have been evaluated. Les polarisabilités des atomes alcalins Li, Na, et des molécules diatomiques homonucléaires et hétéronucléaire Li2, Na2 et NaLi, ont été calculées au niveau SCF (Self Consistent Field) et au niveau corrélé à partir d'une méthode invariante de jauge dépendante du temps(TDGI). Nos valeurs des polarisabilités statiques sont en accord avec les meilleurs déterminations expérimentales et théoriques. Les coefficients C6 de Van de Waals pour les interactions atome-atome, atome-dimère et dimère-dimère ont également été évalués.

Structure-function relationships of Na+, K+, ATP, or Mg2+ binding and energy transduction in Na,K-ATPase

DEFF Research Database (Denmark)

Jorgensen, Peter L.; Pedersen, Per Amstrup

2000-01-01

Na,K-ATPase; Mutagenesis; Na+ binding; K+ binding; Tl+ binding; Mg2+ binding; ATP binding; Cation binding site; Energy transduction......Na,K-ATPase; Mutagenesis; Na+ binding; K+ binding; Tl+ binding; Mg2+ binding; ATP binding; Cation binding site; Energy transduction...

Instance-specific algorithm configuration

CERN Document Server

Malitsky, Yuri

2014-01-01

This book presents a modular and expandable technique in the rapidly emerging research area of automatic configuration and selection of the best algorithm for the instance at hand. The author presents the basic model behind ISAC and then details a number of modifications and practical applications. In particular, he addresses automated feature generation, offline algorithm configuration for portfolio generation, algorithm selection, adaptive solvers, online tuning, and parallelization.    The author's related thesis was honorably mentioned (runner-up) for the ACP Dissertation Award in 2014,

Quantum algorithm for linear regression

Science.gov (United States)

Wang, Guoming

2017-07-01

We present a quantum algorithm for fitting a linear regression model to a given data set using the least-squares approach. Differently from previous algorithms which yield a quantum state encoding the optimal parameters, our algorithm outputs these numbers in the classical form. So by running it once, one completely determines the fitted model and then can use it to make predictions on new data at little cost. Moreover, our algorithm works in the standard oracle model, and can handle data sets with nonsparse design matrices. It runs in time poly( log2(N ) ,d ,κ ,1 /ɛ ) , where N is the size of the data set, d is the number of adjustable parameters, κ is the condition number of the design matrix, and ɛ is the desired precision in the output. We also show that the polynomial dependence on d and κ is necessary. Thus, our algorithm cannot be significantly improved. Furthermore, we also give a quantum algorithm that estimates the quality of the least-squares fit (without computing its parameters explicitly). This algorithm runs faster than the one for finding this fit, and can be used to check whether the given data set qualifies for linear regression in the first place.

Algorithm FIRE-Feynman Integral REduction

International Nuclear Information System (INIS)

Smirnov, A.V.

2008-01-01

The recently developed algorithm FIRE performs the reduction of Feynman integrals to master integrals. It is based on a number of strategies, such as applying the Laporta algorithm, the s-bases algorithm, region-bases and integrating explicitly over loop momenta when possible. Currently it is being used in complicated three-loop calculations.

Synthesis of Greedy Algorithms Using Dominance Relations

Science.gov (United States)

Nedunuri, Srinivas; Smith, Douglas R.; Cook, William R.

2010-01-01

Greedy algorithms exploit problem structure and constraints to achieve linear-time performance. Yet there is still no completely satisfactory way of constructing greedy algorithms. For example, the Greedy Algorithm of Edmonds depends upon translating a problem into an algebraic structure called a matroid, but the existence of such a translation can be as hard to determine as the existence of a greedy algorithm itself. An alternative characterization of greedy algorithms is in terms of dominance relations, a well-known algorithmic technique used to prune search spaces. We demonstrate a process by which dominance relations can be methodically derived for a number of greedy algorithms, including activity selection, and prefix-free codes. By incorporating our approach into an existing framework for algorithm synthesis, we demonstrate that it could be the basis for an effective engineering method for greedy algorithms. We also compare our approach with other characterizations of greedy algorithms.

Algorithm for Compressing Time-Series Data

Science.gov (United States)

Hawkins, S. Edward, III; Darlington, Edward Hugo

2012-01-01

An algorithm based on Chebyshev polynomials effects lossy compression of time-series data or other one-dimensional data streams (e.g., spectral data) that are arranged in blocks for sequential transmission. The algorithm was developed for use in transmitting data from spacecraft scientific instruments to Earth stations. In spite of its lossy nature, the algorithm preserves the information needed for scientific analysis. The algorithm is computationally simple, yet compresses data streams by factors much greater than two. The algorithm is not restricted to spacecraft or scientific uses: it is applicable to time-series data in general. The algorithm can also be applied to general multidimensional data that have been converted to time-series data, a typical example being image data acquired by raster scanning. However, unlike most prior image-data-compression algorithms, this algorithm neither depends on nor exploits the two-dimensional spatial correlations that are generally present in images. In order to understand the essence of this compression algorithm, it is necessary to understand that the net effect of this algorithm and the associated decompression algorithm is to approximate the original stream of data as a sequence of finite series of Chebyshev polynomials. For the purpose of this algorithm, a block of data or interval of time for which a Chebyshev polynomial series is fitted to the original data is denoted a fitting interval. Chebyshev approximation has two properties that make it particularly effective for compressing serial data streams with minimal loss of scientific information: The errors associated with a Chebyshev approximation are nearly uniformly distributed over the fitting interval (this is known in the art as the "equal error property"); and the maximum deviations of the fitted Chebyshev polynomial from the original data have the smallest possible values (this is known in the art as the "min-max property").

Algorithms

Indian Academy of Sciences (India)

ticians but also forms the foundation of computer science. Two ... with methods of developing algorithms for solving a variety of problems but ... applications of computers in science and engineer- ... numerical calculus are as important. We will ...

Novel medical image enhancement algorithms

Science.gov (United States)

Agaian, Sos; McClendon, Stephen A.

2010-01-01

In this paper, we present two novel medical image enhancement algorithms. The first, a global image enhancement algorithm, utilizes an alpha-trimmed mean filter as its backbone to sharpen images. The second algorithm uses a cascaded unsharp masking technique to separate the high frequency components of an image in order for them to be enhanced using a modified adaptive contrast enhancement algorithm. Experimental results from enhancing electron microscopy, radiological, CT scan and MRI scan images, using the MATLAB environment, are then compared to the original images as well as other enhancement methods, such as histogram equalization and two forms of adaptive contrast enhancement. An image processing scheme for electron microscopy images of Purkinje cells will also be implemented and utilized as a comparison tool to evaluate the performance of our algorithm.

At NA2

CERN Multimedia

1977-01-01

One of the NA2 calorimeter sections is moved in. The NA2 calorimeter was divided in two halves, to the left and the right of the beam, each half consisting of sheets of passive high Z material interleaved with blades of plastic scintillators. The photo shows on the right, the upstream 'electron' module with eleven lead plates for a total radiation length of 20.

Wavelet-LMS algorithm-based echo cancellers

Science.gov (United States)

Seetharaman, Lalith K.; Rao, Sathyanarayana S.

2002-12-01

This paper presents Echo Cancellers based on the Wavelet-LMS Algorithm. The performance of the Least Mean Square Algorithm in Wavelet transform domain is observed and its application in Echo cancellation is analyzed. The Widrow-Hoff Least Mean Square Algorithm is most widely used algorithm for Adaptive filters that function as Echo Cancellers. The present day communication signals are widely non-stationary in nature and some errors crop up when Least Mean Square Algorithm is used for the Echo Cancellers handling such signals. The analysis of non-stationary signals often involves a compromise between how well transitions or discontinuities can be located. The multi-scale or multi-resolution of signal analysis, which is the essence of wavelet transform, makes Wavelets popular in non-stationary signal analysis. In this paper, we present a Wavelet-LMS algorithm wherein the wavelet coefficients of a signal are modified adaptively using the Least Mean Square Algorithm and then reconstructed to give an Echo-free signal. The Echo Canceller based on this Algorithm is found to have a better convergence and a comparatively lesser MSE (Mean Square error).

Analysis and Improvement of Fireworks Algorithm

Directory of Open Access Journals (Sweden)

Xi-Guang Li

2017-02-01

Full Text Available The Fireworks Algorithm is a recently developed swarm intelligence algorithm to simulate the explosion process of fireworks. Based on the analysis of each operator of Fireworks Algorithm (FWA, this paper improves the FWA and proves that the improved algorithm converges to the global optimal solution with probability 1. The proposed algorithm improves the goal of further boosting performance and achieving global optimization where mainly include the following strategies. Firstly using the opposition-based learning initialization population. Secondly a new explosion amplitude mechanism for the optimal firework is proposed. In addition, the adaptive t-distribution mutation for non-optimal individuals and elite opposition-based learning for the optimal individual are used. Finally, a new selection strategy, namely Disruptive Selection, is proposed to reduce the running time of the algorithm compared with FWA. In our simulation, we apply the CEC2013 standard functions and compare the proposed algorithm (IFWA with SPSO2011, FWA, EFWA and dynFWA. The results show that the proposed algorithm has better overall performance on the test functions.

Empirical study of parallel LRU simulation algorithms

Science.gov (United States)

Carr, Eric; Nicol, David M.

1994-01-01

This paper reports on the performance of five parallel algorithms for simulating a fully associative cache operating under the LRU (Least-Recently-Used) replacement policy. Three of the algorithms are SIMD, and are implemented on the MasPar MP-2 architecture. Two other algorithms are parallelizations of an efficient serial algorithm on the Intel Paragon. One SIMD algorithm is quite simple, but its cost is linear in the cache size. The two other SIMD algorithm are more complex, but have costs that are independent on the cache size. Both the second and third SIMD algorithms compute all stack distances; the second SIMD algorithm is completely general, whereas the third SIMD algorithm presumes and takes advantage of bounds on the range of reference tags. Both MIMD algorithm implemented on the Paragon are general and compute all stack distances; they differ in one step that may affect their respective scalability. We assess the strengths and weaknesses of these algorithms as a function of problem size and characteristics, and compare their performance on traces derived from execution of three SPEC benchmark programs.

A Hybrid Chaotic Quantum Evolutionary Algorithm

DEFF Research Database (Denmark)

Cai, Y.; Zhang, M.; Cai, H.

2010-01-01

A hybrid chaotic quantum evolutionary algorithm is proposed to reduce amount of computation, speed up convergence and restrain premature phenomena of quantum evolutionary algorithm. The proposed algorithm adopts the chaotic initialization method to generate initial population which will form a pe...... tests. The presented algorithm is applied to urban traffic signal timing optimization and the effect is satisfied....

Na+-K+ pump in chronic renal failure

International Nuclear Information System (INIS)

Deepak, K.; Kahn, T.

1987-01-01

This review summarizes the evidence for the defect in Na + -K + pump in chronic renal failure, considers the role of various factors in causing this defect, and discusses the clinical implications thereof. Intracellular Na is elevated in erythrocytes, leukocytes, and muscle cells from some patients with chronic renal failure (CRF). Recent evidence suggest that this elevation of cell Na may be, in large part, a consequence of decreased number of Na + -K + pump units per cell. Maintenance dialysis over a period of weeks ameliorates the defect in intracellular Na + , and this improvement is contemporaneous with an increase in the number of Na + -K + pump sites per cell. In erythrocytes with normal cell Na + , acute hemodialysis increases the rate of 22 Na + and 42 K + transport. Many factors such as the presence of retained toxic metabolite or circulating inhibitor in the uremic plasma, or biochemical changes produced by acute hemodialysis, may explain this finding. In cells with high cell Na + , the pump-mediated 42 K + transport is normalized at the expense of a raised cell Na + . The decreased muscle membrane potential in uremic subjects has been attributed to a decreased activity of Na + -K + pump. The authors discuss the role of hormonal abnormalities and circulating inhibitors, which may cause an acute inhibition of the pump and of other factors such as K + depletion, which may cause more chronic alterations. The implications of alteration of Na + and K + pump transport and raised cell Na + on other non-pump-mediated transport pathways are discussed. Raised cell Na + may be a marker for the adequacy of maintenance dialysis in patients with end-stage renal failure

Pozitivni in negativni vplivi risank na otroke

OpenAIRE

Povše, Nika

2017-01-01

V tej diplomski nalogi smo raziskovali pozitivne in negativne vplive risank na otroke. Začeli smo z zgodovino televizije, tako svetovno zgodovino kot zgodovino televizije na Slovenskem. Na isti način smo pregledali tudi zgodovino risank. Raziskovali smo otrokov razvoj, predvsem tiste vidike, ki so izpostavljeni vplivom risank, kot so morala, jezik, domišljija in učenje. Sledilo je raziskovanje negativnih in pozitivnih vplivov, ki jih imajo risanke na otroke, kar je tudi naš glavni problem te ...

Comparison between iterative wavefront control algorithm and direct gradient wavefront control algorithm for adaptive optics system

International Nuclear Information System (INIS)

Cheng Sheng-Yi; Liu Wen-Jin; Chen Shan-Qiu; Dong Li-Zhi; Yang Ping; Xu Bing

2015-01-01

Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n 2 ) ∼ O(n 3 ) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ∼ (O(n) 3/2 ), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits. (paper)

The Parallel Algorithm Based on Genetic Algorithm for Improving the Performance of Cognitive Radio

Directory of Open Access Journals (Sweden)

Liu Miao

2018-01-01

Full Text Available The intercarrier interference (ICI problem of cognitive radio (CR is severe. In this paper, the machine learning algorithm is used to obtain the optimal interference subcarriers of an unlicensed user (un-LU. Masking the optimal interference subcarriers can suppress the ICI of CR. Moreover, the parallel ICI suppression algorithm is designed to improve the calculation speed and meet the practical requirement of CR. Simulation results show that the data transmission rate threshold of un-LU can be set, the data transmission quality of un-LU can be ensured, the ICI of a licensed user (LU is suppressed, and the bit error rate (BER performance of LU is improved by implementing the parallel suppression algorithm. The ICI problem of CR is solved well by the new machine learning algorithm. The computing performance of the algorithm is improved by designing a new parallel structure and the communication performance of CR is enhanced.

Vpliv konfucija na sodobno izobraževanje na Kitajskem

Directory of Open Access Journals (Sweden)

Katja Skitek

2009-12-01

Full Text Available Izobraževanje na Kitajskem je bilo vedno trdno povezano s Konfucijem in konfucianizmom, kar pa ni čudno, saj je bil Konfucij prvi, ki je poudarjal moč z nanja in izobraževanja. LR Kitajska je v zadnjih petdesetih letih počasi in postopoma začela uveljavljati določene spremembe v vzgojno-izobraževalni sistem. Kakšne so te spremembe in koliko nanje še vedno vpliva konfucianizem, bo osrednja tema pričujočega članka. Konfucianizem danes na Kitajskem ni preveč popularen, izobraženci pa so se razporedili v dve skupini: eni trdijo, da je njegov vpliv še vedno velik, drugi pa zatrjujejo, da nima več nobenega vpliva na sodobno življenje. Katera stran ima prav? Konfucij je v prvi vrsti poudarjal pomembnost moralnih vrednot vsakega človeka in prav moralne vrednote, za katere se je zavzemal, so še danes trdno zasidrane v kitajski kulturi. Ali je torej sploh mogoče popolnoma izriniti Konfucija iz sodobnega izobraževanja?

Low-spin states of 23Na

International Nuclear Information System (INIS)

Bakkum, E.L.

1987-01-01

A study of 23 Na via the 22 Ne(p,γ) 23 Na and 23 Na(γ,γ) 23 Na reactions is presented. Only a limited number of resonances has been studied, selected on the basis of strong excitation of the lowest levels of which the spin was unknown. As a result the spins are now known of all levels of 23 Na with excitation energies up to 7 MeV, except for a few high-spin states which are too weakly excited in the decay of the known 22 Ne(p,γ) resonances. The mean lifetimes of the 23 Na levels at 4.43 and 7.89 MeV were found to be 350±70 and 220±17 attoseconds (1 attosecond = 10 -18 seconds) respectively. 97 refs.; 22 figs.; 12 tabs

Response of saliva Na/K ratio to changing Na supply of lactating cows under tropical conditions

NARCIS (Netherlands)

Thiangtum, Wandee; Schonewille, J Thomas; Verstegen, Martin Wa; Arsawakulsudhi, Supot; Rukkwamsuk, Theera; Hendriks, Wouter H

BACKGROUND: Factorial determination of the sodium (Na) requirement of heat-stressed lactating cows is hindered by accurate estimates of the Na losses through sweat. Direct studies, therefore, may be needed requiring information on the time course of healthy animals to become Na depleted and the

Response of saliva Na/K ratio to changing Na supply of lactating cows under tropical conditions

NARCIS (Netherlands)

Thiangtum, Wandee; Schonewille, Thomas J.; Verstegen, Martin W.A.; Arsawakulsudhi, Supot; Rukkwamsuk, Theera; Hendriks, Wouter H.

2017-01-01

BACKGROUND: Factorial determination of the sodium (Na) requirement of heat-stressed lactating cows is hindered by accurate estimates of the Na losses through sweat. Direct studies, therefore, may be needed requiring information on the time course of healthy animals to become Na depleted and the

Look-ahead fermion algorithm

International Nuclear Information System (INIS)

Grady, M.

1986-01-01

I describe a fast fermion algorithm which utilizes pseudofermion fields but appears to have little or no systematic error. Test simulations on two-dimensional gauge theories are described. A possible justification for the algorithm being exact is discussed. 8 refs

Online co-regularized algorithms

NARCIS (Netherlands)

Ruijter, T. de; Tsivtsivadze, E.; Heskes, T.

2012-01-01

We propose an online co-regularized learning algorithm for classification and regression tasks. We demonstrate that by sequentially co-regularizing prediction functions on unlabeled data points, our algorithm provides improved performance in comparison to supervised methods on several UCI benchmarks

Algorithmic complexity of quantum capacity

Science.gov (United States)

Oskouei, Samad Khabbazi; Mancini, Stefano

2018-04-01

We analyze the notion of quantum capacity from the perspective of algorithmic (descriptive) complexity. To this end, we resort to the concept of semi-computability in order to describe quantum states and quantum channel maps. We introduce algorithmic entropies (like algorithmic quantum coherent information) and derive relevant properties for them. Then we show that quantum capacity based on semi-computable concept equals the entropy rate of algorithmic coherent information, which in turn equals the standard quantum capacity. Thanks to this, we finally prove that the quantum capacity, for a given semi-computable channel, is limit computable.

Clues to NaCN formation

Science.gov (United States)

Quintana-Lacaci, G.; Cernicharo, J.; Velilla Prieto, L.; Agúndez, M.; Castro-Carrizo, A.; Fonfría, J. P.; Massalkhi, S.; Pardo, J. R.

2017-11-01

Context. ALMA is providing us essential information on where certain molecules form. Observing where these molecules emission arises from, the physical conditions of the gas, and how this relates with the presence of other species allows us to understand the formation of many species, and to significantly improve our knowledge of the chemistry that occurs in the space. Aims: We studied the molecular distribution of NaCN around IRC +10216, a molecule detected previously, but whose origin is not clear. High angular resolution maps allow us to model the abundance distribution of this molecule and check suggested formation paths. Methods: We modeled the emission of NaCN assuming local thermal equilibrium (LTE) conditions. These profiles were fitted to azimuthal averaged intensity profiles to obtain an abundance distribution of NaCN. Results: We found that the presence of NaCN seems compatible with the presence of CN, probably as a result of the photodissociation of HCN, in the inner layers of the ejecta of IRC +10216. However, similar as for CH3CN, current photochemical models fail to reproduce this CN reservoir. We also found that the abundance peak of NaCN appears at a radius of 3 × 1015 cm, approximately where the abundance of NaCl, suggested to be the parent species, starts to decay. However, the abundance ratio shows that the NaCl abundance is lower than that obtained for NaCN. We expect that the LTE assumption might result in NaCN abundances higher than the real ones. Updated photochemical models, collisional rates, and reaction rates are essential to determine the possible paths of the NaCN formation. Based on observations carried out with ALMA and the IRAM 30 m Telescope. ALMA is a partnership of ESO (representing its member states), NSF (USA) and NINS (Japan), together with NRC (Canada) and NSC and ASIAA (Taiwan), in cooperation with the Republic of Chile. The Joint ALMA Observatory is operated by ESO, AUI/NRAO and NAOJ. IRAM is supported by INSU/CNRS (France

Learning from nature: Nature-inspired algorithms

DEFF Research Database (Denmark)

Albeanu, Grigore; Madsen, Henrik; Popentiu-Vladicescu, Florin

2016-01-01

.), genetic and evolutionary strategies, artificial immune systems etc. Well-known examples of applications include: aircraft wing design, wind turbine design, bionic car, bullet train, optimal decisions related to traffic, appropriate strategies to survive under a well-adapted immune system etc. Based......During last decade, the nature has inspired researchers to develop new algorithms. The largest collection of nature-inspired algorithms is biology-inspired: swarm intelligence (particle swarm optimization, ant colony optimization, cuckoo search, bees' algorithm, bat algorithm, firefly algorithm etc...... on collective social behaviour of organisms, researchers have developed optimization strategies taking into account not only the individuals, but also groups and environment. However, learning from nature, new classes of approaches can be identified, tested and compared against already available algorithms...

Cache-Oblivious Algorithms and Data Structures

DEFF Research Database (Denmark)

Brodal, Gerth Stølting

2004-01-01

Frigo, Leiserson, Prokop and Ramachandran in 1999 introduced the ideal-cache model as a formal model of computation for developing algorithms in environments with multiple levels of caching, and coined the terminology of cache-oblivious algorithms. Cache-oblivious algorithms are described...... as standard RAM algorithms with only one memory level, i.e. without any knowledge about memory hierarchies, but are analyzed in the two-level I/O model of Aggarwal and Vitter for an arbitrary memory and block size and an optimal off-line cache replacement strategy. The result are algorithms that automatically...... apply to multi-level memory hierarchies. This paper gives an overview of the results achieved on cache-oblivious algorithms and data structures since the seminal paper by Frigo et al....

Portable Health Algorithms Test System

Science.gov (United States)

Melcher, Kevin J.; Wong, Edmond; Fulton, Christopher E.; Sowers, Thomas S.; Maul, William A.

2010-01-01

A document discusses the Portable Health Algorithms Test (PHALT) System, which has been designed as a means for evolving the maturity and credibility of algorithms developed to assess the health of aerospace systems. Comprising an integrated hardware-software environment, the PHALT system allows systems health management algorithms to be developed in a graphical programming environment, to be tested and refined using system simulation or test data playback, and to be evaluated in a real-time hardware-in-the-loop mode with a live test article. The integrated hardware and software development environment provides a seamless transition from algorithm development to real-time implementation. The portability of the hardware makes it quick and easy to transport between test facilities. This hard ware/software architecture is flexible enough to support a variety of diagnostic applications and test hardware, and the GUI-based rapid prototyping capability is sufficient to support development execution, and testing of custom diagnostic algorithms. The PHALT operating system supports execution of diagnostic algorithms under real-time constraints. PHALT can perform real-time capture and playback of test rig data with the ability to augment/ modify the data stream (e.g. inject simulated faults). It performs algorithm testing using a variety of data input sources, including real-time data acquisition, test data playback, and system simulations, and also provides system feedback to evaluate closed-loop diagnostic response and mitigation control.

Algorithms

Indian Academy of Sciences (India)

algorithm design technique called 'divide-and-conquer'. One of ... Turtle graphics, September. 1996. 5. ... whole list named 'PO' is a pointer to the first element of the list; ..... Program for computing matrices X and Y and placing the result in C *).

Hardware Acceleration of Adaptive Neural Algorithms.

Energy Technology Data Exchange (ETDEWEB)

James, Conrad D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2017-11-01

As tradit ional numerical computing has faced challenges, researchers have turned towards alternative computing approaches to reduce power - per - computation metrics and improve algorithm performance. Here, we describe an approach towards non - conventional computing that strengthens the connection between machine learning and neuroscience concepts. The Hardware Acceleration of Adaptive Neural Algorithms (HAANA) project ha s develop ed neural machine learning algorithms and hardware for applications in image processing and cybersecurity. While machine learning methods are effective at extracting relevant features from many types of data, the effectiveness of these algorithms degrades when subjected to real - world conditions. Our team has generated novel neural - inspired approa ches to improve the resiliency and adaptability of machine learning algorithms. In addition, we have also designed and fabricated hardware architectures and microelectronic devices specifically tuned towards the training and inference operations of neural - inspired algorithms. Finally, our multi - scale simulation framework allows us to assess the impact of microelectronic device properties on algorithm performance.

Performance of Jet Algorithms in CMS

CERN Document Server

CMS Collaboration

The CMS Combined Software and Analysis Challenge 2007 (CSA07) is well underway and expected to produce a wealth of physics analyses to be applied to the first incoming detector data in 2008. The JetMET group of CMS supports four different jet clustering algorithms for the CSA07 Monte Carlo samples, with two different parameterizations each: \\fastkt, \\siscone, \\midpoint, and \\itcone. We present several studies comparing the performance of these algorithms using QCD dijet and \\ttbar Monte Carlo samples. We specifically observe that the \\siscone algorithm performs equal to or better than the \\midpoint algorithm in all presented studies and propose that \\siscone be adopted as the preferred cone-based jet clustering algorithm in future CMS physics analyses, as it is preferred by theorists for its infrared- and collinear-safety to all orders of perturbative QCD. We furthermore encourage the use of the \\fastkt algorithm which is found to perform as good as any other algorithm under study, features dramatically reduc...

Quantum-circuit model of Hamiltonian search algorithms

International Nuclear Information System (INIS)

Roland, Jeremie; Cerf, Nicolas J.

2003-01-01

We analyze three different quantum search algorithms, namely, the traditional circuit-based Grover's algorithm, its continuous-time analog by Hamiltonian evolution, and the quantum search by local adiabatic evolution. We show that these algorithms are closely related in the sense that they all perform a rotation, at a constant angular velocity, from a uniform superposition of all states to the solution state. This makes it possible to implement the two Hamiltonian-evolution algorithms on a conventional quantum circuit, while keeping the quadratic speedup of Grover's original algorithm. It also clarifies the link between the adiabatic search algorithm and Grover's algorithm

The effect of Na+ and K+ on the thermal denaturation of Na+ and + K+-dependent ATPase.

Science.gov (United States)

Fischer, T H

1983-01-01

To increase our understanding of the physical nature of the Na+ and K+ forms of the Na+ + K+-dependent ATPase, thermal-denaturation studies were conducted in different types of ionic media. Thermal-denaturation measurements were performed by measuring the regeneration of ATPase activity after slow pulse exposure to elevated temperatures. Two types of experiments were performed. First, the dependence of the thermal-denaturation rate on Na+ and K+ concentrations was examined. It was found that both cations stabilized the pump protein. Also, K+ was a more effective stabilizer of the native state than was Na+. Secondly, a set of thermodynamic parameters was obtained by measuring the temperature-dependence of the thermal-denaturation rate under three ionic conditions: 60 mM-K+, 150 mM-Na+ and no Na+ or K+. It was found that ion-mediated stabilization of the pump protein was accompanied by substantial increases in activation enthalpy and entropy, the net effect being a less-pronounced increase in activation free energy. PMID:6309139

Financiranje projekata na pomorskom dobru

Directory of Open Access Journals (Sweden)

Zoran Tasić

2018-02-01

Full Text Available Koncesije otvaraju vrlo osjetljiva politička, ekonomska i pravna pitanja u mnogim državama svijeta. Samo definiranje pojma koncesije često je komplicirana i ne sasvim jasna zadaća. OECD je prihvatila definiciju koncesije kao: ’’davanje prava privatnom trgovačkom društvu da može gospodarski upravljati određenom infrastrukturnim uslugama i za to zarađivati naknadu. Koncesionar dobija u posjed određene objekte (ali vlasništvo na tim objektima ostaje u rukama države te ih koristi u svrhu obavljanja određene djelatnosti ili usluge sukladno odredbama ugovora’’. Hrvatsko pravo definira koncesije načelno kao pravo stečeno temeljem ugovora o koncesiji, a sukladno uvjetima sadržanim u odluci o davanju koncesije (koju je donijelo odgovarajuće upravno tijelo, a u odnosu na pomorsko dobro, specifično, kao pravo državne vlasti da može dio pomorskog dobra, koje je inače dobro izvan pravnog prometa (res extra commercium, isključiti iz opće uporabe bilo dijelom ili u cijelosti, i dati ga fizičkoj ili pravnoj osobi na gospodarsko korištenje sukladno određenim prostornim planovima. Građevine i drugi objekti izgrađeni na pomorskom dobru čine njegov sastavni dio. Zakonom je jasno određeno da nikakva stvarna prava nisu dopuštena na pomorskom dobru, uključivo i na objektima izgrađenima na njemu. Projekti na pomorskom dobru često uključuju velike infrastrukturne projekte, razvoje luka i marina, koji iziskuju značajna financijska sredstva. Banke koje financiraju takve projekte zahtijevaju organiziran i transparentan zakonski okvir koncesija, slobodu ugovaranja, pravnu zaštitu svih strana uključenih u projekt (uključivo i mogućnost međunarodne arbitraže. (...

Algorithms for parallel computers

International Nuclear Information System (INIS)

Churchhouse, R.F.

1985-01-01

Until relatively recently almost all the algorithms for use on computers had been designed on the (usually unstated) assumption that they were to be run on single processor, serial machines. With the introduction of vector processors, array processors and interconnected systems of mainframes, minis and micros, however, various forms of parallelism have become available. The advantage of parallelism is that it offers increased overall processing speed but it also raises some fundamental questions, including: (i) which, if any, of the existing 'serial' algorithms can be adapted for use in the parallel mode. (ii) How close to optimal can such adapted algorithms be and, where relevant, what are the convergence criteria. (iii) How can we design new algorithms specifically for parallel systems. (iv) For multi-processor systems how can we handle the software aspects of the interprocessor communications. Aspects of these questions illustrated by examples are considered in these lectures. (orig.)

Controlled phase stability of highly Na-active triclinic structure in nanoscale high-voltage Na2-2xCo1+xP2O7 cathode for Na-ion batteries

Science.gov (United States)

Song, Hee Jo; Kim, Jae-Chan; Dar, Mushtaq Ahmad; Kim, Dong-Wan

2018-02-01

With the increasing demand for high energy density in energy-storage systems, a high-voltage cathode is essential in rechargeable Li-ion and Na-ion batteries. The operating voltage of a triclinic-polymorph Na2CoP2O7, also known as the rose form, is above 4.0 V (vs. Na/Na+), which is relatively high compared to that of other cathode materials. Thus, it can be employed as a potential high-voltage cathode material in Na-ion batteries. However, it is difficult to synthesize a pure rose phase because of its low phase stability, thus limiting its use in high-voltage applications. Herein, compositional-engineered, rose-phase Na2-2xCo1+xP2O7/C (x = 0, 0.1 and 0.2) nanopowder are prepared using a wet-chemical method. The Na2-2xCo1+xP2O7/C cathode shows high electrochemical reactivity with Na ions at 4.0 V, delivering high capacity and high energy density.

A hardware-algorithm co-design approach to optimize seizure detection algorithms for implantable applications.

Science.gov (United States)

Raghunathan, Shriram; Gupta, Sumeet K; Markandeya, Himanshu S; Roy, Kaushik; Irazoqui, Pedro P

2010-10-30

Implantable neural prostheses that deliver focal electrical stimulation upon demand are rapidly emerging as an alternate therapy for roughly a third of the epileptic patient population that is medically refractory. Seizure detection algorithms enable feedback mechanisms to provide focally and temporally specific intervention. Real-time feasibility and computational complexity often limit most reported detection algorithms to implementations using computers for bedside monitoring or external devices communicating with the implanted electrodes. A comparison of algorithms based on detection efficacy does not present a complete picture of the feasibility of the algorithm with limited computational power, as is the case with most battery-powered applications. We present a two-dimensional design optimization approach that takes into account both detection efficacy and hardware cost in evaluating algorithms for their feasibility in an implantable application. Detection features are first compared for their ability to detect electrographic seizures from micro-electrode data recorded from kainate-treated rats. Circuit models are then used to estimate the dynamic and leakage power consumption of the compared features. A score is assigned based on detection efficacy and the hardware cost for each of the features, then plotted on a two-dimensional design space. An optimal combination of compared features is used to construct an algorithm that provides maximal detection efficacy per unit hardware cost. The methods presented in this paper would facilitate the development of a common platform to benchmark seizure detection algorithms for comparison and feasibility analysis in the next generation of implantable neuroprosthetic devices to treat epilepsy. Copyright © 2010 Elsevier B.V. All rights reserved.

Optimization of NaOH Molarity, LUSI Mud/Alkaline Activator, and Na2SiO3/NaOH Ratio to Produce Lightweight Aggregate-Based Geopolymer

Directory of Open Access Journals (Sweden)

Rafiza Abdul Razak

2015-05-01

Full Text Available This paper presents the mechanical function and characterization of an artificial lightweight geopolymer aggregate (ALGA using LUSI (Sidoarjo mud and alkaline activator as source materials. LUSI stands for LU-Lumpur and SI-Sidoarjo, meaning mud from Sidoarjo which erupted near the Banjarpanji-1 exploration well in Sidoarjo, East Java, Indonesia on 27 May 2006. The effect of NaOH molarity, LUSI mud/Alkaline activator (LM/AA ratio, and Na2SiO3/NaOH ratio to the ALGA are investigated at a sintering temperature of 950 °C. The results show that the optimum NaOH molarity found in this study is 12 M due to the highest strength (lowest AIV value of 15.79% with lower water absorption and specific gravity. The optimum LUSI mud/Alkaline activator (LM/AA ratio of 1.7 and the Na2SiO3/NaOH ratio of 0.4 gives the highest strength with AIV value of 15.42% with specific gravity of 1.10 g/cm3 and water absorption of 4.7%. The major synthesized crystalline phases were identified as sodalite, quartz and albite. Scanning Electron Microscope (SEM image showed more complete geopolymer matrix which contributes to highest strength of ALGA produced.

Optimization of NaOH Molarity, LUSI Mud/Alkaline Activator, and Na2SiO3/NaOH Ratio to Produce Lightweight Aggregate-Based Geopolymer

Science.gov (United States)

Abdul Razak, Rafiza; Abdullah, Mohd Mustafa Al Bakri; Hussin, Kamarudin; Ismail, Khairul Nizar; Hardjito, Djwantoro; Yahya, Zarina

2015-01-01

This paper presents the mechanical function and characterization of an artificial lightweight geopolymer aggregate (ALGA) using LUSI (Sidoarjo mud) and alkaline activator as source materials. LUSI stands for LU-Lumpur and SI-Sidoarjo, meaning mud from Sidoarjo which erupted near the Banjarpanji-1 exploration well in Sidoarjo, East Java, Indonesia on 27 May 2006. The effect of NaOH molarity, LUSI mud/Alkaline activator (LM/AA) ratio, and Na2SiO3/NaOH ratio to the ALGA are investigated at a sintering temperature of 950 °C. The results show that the optimum NaOH molarity found in this study is 12 M due to the highest strength (lowest AIV value) of 15.79% with lower water absorption and specific gravity. The optimum LUSI mud/Alkaline activator (LM/AA) ratio of 1.7 and the Na2SiO3/NaOH ratio of 0.4 gives the highest strength with AIV value of 15.42% with specific gravity of 1.10 g/cm3 and water absorption of 4.7%. The major synthesized crystalline phases were identified as sodalite, quartz and albite. Scanning Electron Microscope (SEM) image showed more complete geopolymer matrix which contributes to highest strength of ALGA produced. PMID:26006238

UTJECAJ POZITIVNE DISKRIMINACIJE NA UKLJUČIVANJE ŽENA NA TRŽIŠTE RADA U REPUBLICI HRVATSKOJ

OpenAIRE

Dovranić, Dora; Katavić, Ivica

2016-01-01

U početku 21. stoljeća često se koristi pojam pozitivne (afirmativne) diskriminacije. Pozitivna diskriminacija mjera je koju poduzima vlada, neka organizacija ili korporacija s ciljem da se smanje nejednakosti u društvu nastale upravo diskriminacijom, na način da se pružaju određene povlastice onima koji su pretrpjeli neku vrstu diskriminacije. Nastala je u Sjedinjenim Američkim Državama na inicijativu predsjednika Kennedyja, Johnsona i Nixona. Diskriminacija, nažalost, ima mnogo oblika, a ne...

8. Algorithm Design Techniques

Indian Academy of Sciences (India)

Home; Journals; Resonance – Journal of Science Education; Volume 2; Issue 8. Algorithms - Algorithm Design Techniques. R K Shyamasundar. Series Article Volume 2 ... Author Affiliations. R K Shyamasundar1. Computer Science Group, Tata Institute of Fundamental Research, Homi Bhabha Road, Mumbai 400 005, India ...

Efficient RNA structure comparison algorithms.

Science.gov (United States)

Arslan, Abdullah N; Anandan, Jithendar; Fry, Eric; Monschke, Keith; Ganneboina, Nitin; Bowerman, Jason

2017-12-01

Recently proposed relative addressing-based ([Formula: see text]) RNA secondary structure representation has important features by which an RNA structure database can be stored into a suffix array. A fast substructure search algorithm has been proposed based on binary search on this suffix array. Using this substructure search algorithm, we present a fast algorithm that finds the largest common substructure of given multiple RNA structures in [Formula: see text] format. The multiple RNA structure comparison problem is NP-hard in its general formulation. We introduced a new problem for comparing multiple RNA structures. This problem has more strict similarity definition and objective, and we propose an algorithm that solves this problem efficiently. We also develop another comparison algorithm that iteratively calls this algorithm to locate nonoverlapping large common substructures in compared RNAs. With the new resulting tools, we improved the RNASSAC website (linked from http://faculty.tamuc.edu/aarslan ). This website now also includes two drawing tools: one specialized for preparing RNA substructures that can be used as input by the search tool, and another one for automatically drawing the entire RNA structure from a given structure sequence.

Reaction of metal oxides with molten mixtures NaPO3+NaCl

International Nuclear Information System (INIS)

Kovarskaya, E.N.; Mityakhina, V.S.; Rodionov, Yu.I.; Silin, M.Yu.

1988-01-01

By methods of solubility determination and paper chromatography it is shown, that Fe 2 O 3 solution in NaPO 3 +NaCl melts in the air relizes due to its chemical interaction with solvent resulting in formation of iron and sodium binary di- and monophosphates depending on melt-solvent initial composition, its attainment of equilibrium state and experiment temperature. It is established, that oxides increased solubility in melts with NaCl initial content ∼30 mol.% is specified by sodium tri- and tricyclophosphates presence in the melts. On this basis of NGR-spectroscopy data the presence of iron, europium, tin and sodium binary di- and monophosphates in some chloride-polyphosphate melts is confirmed

Crystal structure of polyphosphates NaCd(PO3)3 and NaMn(PO3)3

International Nuclear Information System (INIS)

Murashova, E.V.; Chudinova, N.N.

1997-01-01

Crystal structure of NaCd(PO 3 ) 3 (1) and NaMn(PO 3 ) 3 (2) isostructural polyphosphates was determined for twin samples. Rhombic lattice parameters of (1): a = 14.678, b = 14.669, c = 14.705 A, sp. gr. P2 1 2 1 2 1 , Z = 16. The structure of compounds is of frame type. Polyphosphate chain with repetition period of 24 PO 4 tetrahedrons contacts with NaO 6 and M 2 O 6 octahedrons by means of common oxygen vertices. Similarities and differences in structure of mentioned polyphosphates and earlier analyzed NaMg(PO 3 ) 3 polyphosphate are noted [ru

Algorithms for worst-case tolerance optimization

DEFF Research Database (Denmark)

Schjær-Jacobsen, Hans; Madsen, Kaj

1979-01-01

New algorithms are presented for the solution of optimum tolerance assignment problems. The problems considered are defined mathematically as a worst-case problem (WCP), a fixed tolerance problem (FTP), and a variable tolerance problem (VTP). The basic optimization problem without tolerances...... is denoted the zero tolerance problem (ZTP). For solution of the WCP we suggest application of interval arithmetic and also alternative methods. For solution of the FTP an algorithm is suggested which is conceptually similar to algorithms previously developed by the authors for the ZTP. Finally, the VTP...... is solved by a double-iterative algorithm in which the inner iteration is performed by the FTP- algorithm. The application of the algorithm is demonstrated by means of relatively simple numerical examples. Basic properties, such as convergence properties, are displayed based on the examples....

Elementary functions algorithms and implementation

CERN Document Server

Muller, Jean-Michel

2016-01-01

This textbook presents the concepts and tools necessary to understand, build, and implement algorithms for computing elementary functions (e.g., logarithms, exponentials, and the trigonometric functions). Both hardware- and software-oriented algorithms are included, along with issues related to accurate floating-point implementation. This third edition has been updated and expanded to incorporate the most recent advances in the field, new elementary function algorithms, and function software. After a preliminary chapter that briefly introduces some fundamental concepts of computer arithmetic, such as floating-point arithmetic and redundant number systems, the text is divided into three main parts. Part I considers the computation of elementary functions using algorithms based on polynomial or rational approximations and using table-based methods; the final chapter in this section deals with basic principles of multiple-precision arithmetic. Part II is devoted to a presentation of “shift-and-add” algorithm...

Streaming Algorithms for Line Simplification

DEFF Research Database (Denmark)

Abam, Mohammad; de Berg, Mark; Hachenberger, Peter

2010-01-01

this problem in a streaming setting, where we only have a limited amount of storage, so that we cannot store all the points. We analyze the competitive ratio of our algorithms, allowing resource augmentation: we let our algorithm maintain a simplification with 2k (internal) points and compare the error of our...... simplification to the error of the optimal simplification with k points. We obtain the algorithms with O(1) competitive ratio for three cases: convex paths, where the error is measured using the Hausdorff distance (or Fréchet distance), xy-monotone paths, where the error is measured using the Hausdorff distance...... (or Fréchet distance), and general paths, where the error is measured using the Fréchet distance. In the first case the algorithm needs O(k) additional storage, and in the latter two cases the algorithm needs O(k 2) additional storage....

Advancements to the planogram frequency–distance rebinning algorithm

International Nuclear Information System (INIS)

Champley, Kyle M; Kinahan, Paul E; Raylman, Raymond R

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

Effect of growth in lithium on ouabain binding, Na-K-ATPase and Na and K transport in hela cells.

Science.gov (United States)

Boardman, L J; Hume, S P; Lamb, J F; Polson, J

1975-01-01

1. HeLa cells were grown for 24 hr in growth medium in which part of the Na was replaced with Li. Ion contents, cell volumes and numbers, Na-K-ATPase and specific ouabain binding were measured. In some experiments the Na efflux and net Na transport was also measured. 2. Growth in Li caused a rise in the specific ouabain binding and membrane Na-K-ATPase of these cells. The Li concentrations in the cells necessary to produce this effect ranged up to 50 mM. 3. It is suggested that Li, like Na, acts on the genetic material of the cells to cause the production of more Na pumps within the membrane. PMID:124350

Multiple-algorithm parallel fusion of infrared polarization and intensity images based on algorithmic complementarity and synergy

Science.gov (United States)

Zhang, Lei; Yang, Fengbao; Ji, Linna; Lv, Sheng

2018-01-01

Diverse image fusion methods perform differently. Each method has advantages and disadvantages compared with others. One notion is that the advantages of different image methods can be effectively combined. A multiple-algorithm parallel fusion method based on algorithmic complementarity and synergy is proposed. First, in view of the characteristics of the different algorithms and difference-features among images, an index vector-based feature-similarity is proposed to define the degree of complementarity and synergy. This proposed index vector is a reliable evidence indicator for algorithm selection. Second, the algorithms with a high degree of complementarity and synergy are selected. Then, the different degrees of various features and infrared intensity images are used as the initial weights for the nonnegative matrix factorization (NMF). This avoids randomness of the NMF initialization parameter. Finally, the fused images of different algorithms are integrated using the NMF because of its excellent data fusing performance on independent features. Experimental results demonstrate that the visual effect and objective evaluation index of the fused images obtained using the proposed method are better than those obtained using traditional methods. The proposed method retains all the advantages that individual fusion algorithms have.

Effects of EDTA-Na (Na ethylenediaminetetraacetate) upon the metabolism of radiostrontium and radioyttrium in mice

Energy Technology Data Exchange (ETDEWEB)

Kikuchi, T; Wakisaka, G; Kono, T; Hiroaki, A; Yamamasu, T; Sugawa, I

1954-01-01

The toxicity of EDTA-Na, inert Sr (NO/sub 3/)/sub 2/ and Ba (NO/sub 3/)/sub 2/ has been examined. Simultaneous injection of EDTA-Na showed no significant effect upon the distribution of radio-Sr in the bones of mice. The distribution of radio-Y in the bones of mice tended to decrease following the simultaneous subcutaneous injection of /sup 91/Y and EDTA-Na.

Algorithmic alternatives

International Nuclear Information System (INIS)

Creutz, M.

1987-11-01

A large variety of Monte Carlo algorithms are being used for lattice gauge simulations. For purely bosonic theories, present approaches are generally adequate; nevertheless, overrelaxation techniques promise savings by a factor of about three in computer time. For fermionic fields the situation is more difficult and less clear. Algorithms which involve an extrapolation to a vanishing step size are all quite closely related. Methods which do not require such an approximation tend to require computer time which grows as the square of the volume of the system. Recent developments combining global accept/reject stages with Langevin or microcanonical updatings promise to reduce this growth to V/sup 4/3/

Novel aspects of Na+,K+-ATPase

OpenAIRE

Aizman, Oleg

2002-01-01

Na,K-ATPase, an integral membrane protein expressed in each eukaryotic cell, serves as the major determinant of intracellular ion composition. In the current study we investigated novel aspects of Na,K-ATPase function and regulation. It is well established that Na,K-ATPase activity is regulated by reversible phosphorylation. New findings in this study are: 1) the level of intracellular Ca 2. concentration determines the functional effects of PKA and PKC-mediated Na,K-ATP...

High-Performance Na-O2 Batteries Enabled by Oriented NaO2 Nanowires as Discharge Products.

Science.gov (United States)

Khajehbashi, S Mohammad B; Xu, Lin; Zhang, Guobin; Tan, Shuangshuang; Zhao, Yan; Wang, Lai-Sen; Li, Jiantao; Luo, Wen; Peng, Dong-Liang; Mai, Liqiang

2018-06-13

Na-O 2 batteries are emerging rechargeable batteries due to their high theoretical energy density and abundant resources, but they suffer from sluggish kinetics due to the formation of large-size discharge products with cubic or irregular particle shapes. Here, we report the unique growth of discharge products of NaO 2 nanowires inside Na-O 2 batteries that significantly boosts the performance of Na-O 2 batteries. For this purpose, a high-spin Co 3 O 4 electrocatalyst was synthesized via the high-temperature oxidation of pure cobalt nanoparticles in an external magnetic field. The discharge products of NaO 2 nanowires are 10-20 nm in diameter and ∼10 μm in length, characteristics that provide facile pathways for electron and ion transfer. With these nanowires, Na-O 2 batteries have surpassed 400 cycles with a fixed capacity of 1000 mA h g -1 , an ultra-low over-potential of ∼60 mV during charging, and near-zero over-potential during discharging. This strategy not only provides a unique way to control the morphology of discharge products to achieve high-performance Na-O 2 batteries but also opens up the opportunity to explore growing nanowires in novel conditions.

A Global algorithm for linear radiosity

OpenAIRE

Sbert Cassasayas, Mateu; Pueyo Sánchez, Xavier

1993-01-01

A linear algorithm for radiosity is presented, linear both in time and storage. The new algorithm is based on previous work by the authors and on the well known algorithms for progressive radiosity and Monte Carlo particle transport.

Algorithmic Mechanism Design of Evolutionary Computation.

Science.gov (United States)

Pei, Yan

2015-01-01

We consider algorithmic design, enhancement, and improvement of evolutionary computation as a mechanism design problem. All individuals or several groups of individuals can be considered as self-interested agents. The individuals in evolutionary computation can manipulate parameter settings and operations by satisfying their own preferences, which are defined by an evolutionary computation algorithm designer, rather than by following a fixed algorithm rule. Evolutionary computation algorithm designers or self-adaptive methods should construct proper rules and mechanisms for all agents (individuals) to conduct their evolution behaviour correctly in order to definitely achieve the desired and preset objective(s). As a case study, we propose a formal framework on parameter setting, strategy selection, and algorithmic design of evolutionary computation by considering the Nash strategy equilibrium of a mechanism design in the search process. The evaluation results present the efficiency of the framework. This primary principle can be implemented in any evolutionary computation algorithm that needs to consider strategy selection issues in its optimization process. The final objective of our work is to solve evolutionary computation design as an algorithmic mechanism design problem and establish its fundamental aspect by taking this perspective. This paper is the first step towards achieving this objective by implementing a strategy equilibrium solution (such as Nash equilibrium) in evolutionary computation algorithm.

Naïve Bayes Approach for Expert System Design of Children Skin Identification Based on Android

Science.gov (United States)

Hartatik; Purnomo, A.; Hartono, R.; Munawaroh, H.

2018-03-01

The development of technology gives some benefits to each person that we can use it properly and correctly. Technology has helped humans in every way. Such as the excess task of an expert in providing information or answers to a problem. Thus problem that often occurs is skin disease that affecting on child. That because the skin of children still vulnerable to the environment. The application was developed using the naïve Bayes algorithm. Through this application, users can consult with a system like an expert to know the symptoms that occur to the child and find the correct treatment to solve the problems.

MultiAspect Graphs: Algebraic Representation and Algorithms

Directory of Open Access Journals (Sweden)

Klaus Wehmuth

2016-12-01

Full Text Available We present the algebraic representation and basic algorithms for MultiAspect Graphs (MAGs. A MAG is a structure capable of representing multilayer and time-varying networks, as well as higher-order networks, while also having the property of being isomorphic to a directed graph. In particular, we show that, as a consequence of the properties associated with the MAG structure, a MAG can be represented in matrix form. Moreover, we also show that any possible MAG function (algorithm can be obtained from this matrix-based representation. This is an important theoretical result since it paves the way for adapting well-known graph algorithms for application in MAGs. We present a set of basic MAG algorithms, constructed from well-known graph algorithms, such as degree computing, Breadth First Search (BFS, and Depth First Search (DFS. These algorithms adapted to the MAG context can be used as primitives for building other more sophisticated MAG algorithms. Therefore, such examples can be seen as guidelines on how to properly derive MAG algorithms from basic algorithms on directed graphs. We also make available Python implementations of all the algorithms presented in this paper.

Firefly Mating Algorithm for Continuous Optimization Problems

Directory of Open Access Journals (Sweden)

Amarita Ritthipakdee

2017-01-01

Full Text Available This paper proposes a swarm intelligence algorithm, called firefly mating algorithm (FMA, for solving continuous optimization problems. FMA uses genetic algorithm as the core of the algorithm. The main feature of the algorithm is a novel mating pair selection method which is inspired by the following 2 mating behaviors of fireflies in nature: (i the mutual attraction between males and females causes them to mate and (ii fireflies of both sexes are of the multiple-mating type, mating with multiple opposite sex partners. A female continues mating until her spermatheca becomes full, and, in the same vein, a male can provide sperms for several females until his sperm reservoir is depleted. This new feature enhances the global convergence capability of the algorithm. The performance of FMA was tested with 20 benchmark functions (sixteen 30-dimensional functions and four 2-dimensional ones against FA, ALC-PSO, COA, MCPSO, LWGSODE, MPSODDS, DFOA, SHPSOS, LSA, MPDPGA, DE, and GABC algorithms. The experimental results showed that the success rates of our proposed algorithm with these functions were higher than those of other algorithms and the proposed algorithm also required fewer numbers of iterations to reach the global optima.

Unconventional Algorithms: Complementarity of Axiomatics and Construction

Directory of Open Access Journals (Sweden)

Gordana Dodig Crnkovic

2012-10-01

Full Text Available In this paper, we analyze axiomatic and constructive issues of unconventional computations from a methodological and philosophical point of view. We explain how the new models of algorithms and unconventional computations change the algorithmic universe, making it open and allowing increased flexibility and expressive power that augment creativity. At the same time, the greater power of new types of algorithms also results in the greater complexity of the algorithmic universe, transforming it into the algorithmic multiverse and demanding new tools for its study. That is why we analyze new powerful tools brought forth by local mathematics, local logics, logical varieties and the axiomatic theory of algorithms, automata and computation. We demonstrate how these new tools allow efficient navigation in the algorithmic multiverse. Further work includes study of natural computation by unconventional algorithms and constructive approaches.

Insight to the Thermal Decomposition and Hydrogen Desorption Behaviors of NaNH2-NaBH4 Hydrogen Storage Composite.

Science.gov (United States)

Pei, Ziwei; Bai, Ying; Wang, Yue; Wu, Feng; Wu, Chuan

2017-09-20

The lightweight compound material NaNH 2 -NaBH 4 is regarded as a promising hydrogen storage composite due to the high hydrogen density. Mechanical ball milling was employed to synthesize the composite NaNH 2 -NaBH 4 (2/1 molar ratio), and the samples were investigated utilizing thermogravimetric-differential thermal analysis-mass spectroscopy (TG-DTA-MS), X-ray diffraction (XRD), and Fourier transform infrared spectroscopy (FTIR) analyses. The full-spectrum test (range of the ratio of mass to charge: 0-200) shows that the released gaseous species contain H 2 , NH 3 , B 2 H 6 , and N 2 in the heating process from room temperature to 400 °C, and possibly the impurity gas B 6 H 12 also exists. The TG/DTA analyses show that the composite NaNH 2 -NaBH 4 (2/1 molar ratio) is conductive to generate hydrogen so that the dehydrogenation process can be finished before 400 °C. Moreover, the thermal decomposition process from 200 to 400 °C involves two-step dehydrogenation reactions: (1) Na 3 (NH 2 ) 2 BH 4 hydride decomposes into Na 3 BN 2 and H 2 (200-350 °C); (2) remaining Na 3 (NH 2 ) 2 BH 4 reacts with NaBH 4 and Na 3 BN 2 , generating Na, BN, NH 3 , N 2 , and H 2 (350-400 °C). The better mechanism understanding of the thermal decomposition pathway lays a foundation for tailoring the hydrogen storage performance of the composite complex hydrides system.

Integrated Association Rules Complete Hiding Algorithms

Directory of Open Access Journals (Sweden)

Mohamed Refaat Abdellah

2017-01-01

Full Text Available This paper presents database security approach for complete hiding of sensitive association rules by using six novel algorithms. These algorithms utilize three new weights to reduce the needed database modifications and support complete hiding, as well as they reduce the knowledge distortion and the data distortions. Complete weighted hiding algorithms enhance the hiding failure by 100%; these algorithms have the advantage of performing only a single scan for the database to gather the required information to form the hiding process. These proposed algorithms are built within the database structure which enables the sanitized database to be generated on run time as needed.

New Insights into the RLS Algorithm

Directory of Open Access Journals (Sweden)

Gänsler Tomas

2004-01-01

Full Text Available The recursive least squares (RLS algorithm is one of the most popular adaptive algorithms that can be found in the literature, due to the fact that it is easily and exactly derived from the normal equations. In this paper, we give another interpretation of the RLS algorithm and show the importance of linear interpolation error energies in the RLS structure. We also give a very efficient way to recursively estimate the condition number of the input signal covariance matrix thanks to fast versions of the RLS algorithm. Finally, we quantify the misalignment of the RLS algorithm with respect to the condition number.

Distinct pH dependencies of Na+/K+ selectivity at the two faces of Na,K-ATPase.

Science.gov (United States)

Cornelius, Flemming; Tsunekawa, Naoki; Toyoshima, Chikashi

2018-02-09

The sodium pump (Na,K-ATPase) in animal cells is vital for actively maintaining ATP hydrolysis-powered Na + and K + electrochemical gradients across the cell membrane. These ion gradients drive co- and countertransport and are critical for establishing the membrane potential. It has been an enigma how Na,K-ATPase discriminates between Na + and K + , despite the pumped ion on each side being at a lower concentration than the other ion. Recent crystal structures of analogs of the intermediate conformations E2·Pi·2K + and Na + -bound E1∼P·ADP suggest that the dimensions of the respective binding sites in Na,K-ATPase are crucial in determining its selectivity. Here, we found that the selectivity at each membrane face is pH-dependent and that this dependence is unique for each face. Most notable was a strong increase in the specific affinity for K + at the extracellular face ( i.e. E2 conformation) as the pH is lowered from 7.5 to 5. We also observed a smaller increase in affinity for K + on the cytoplasmic side (E1 conformation), which reduced the selectivity for Na + Theoretical analysis of the p K a values of ion-coordinating acidic amino acid residues suggested that the face-specific pH dependences and Na + /K + selectivities may arise from the protonation or ionization of key residues. The increase in K + selectivity at low pH on the cytoplasmic face, for instance, appeared to be associated with Asp 808 protonation. We conclude that changes in the ionization state of coordinating residues in Na,K-ATPase could contribute to altering face-specific ion selectivity. © 2018 by The American Society for Biochemistry and Molecular Biology, Inc.

OGLAŠEVANJE NA FACEBOOKU

OpenAIRE

Renko, Katica

2013-01-01

V magistrskem delu smo se seznanili z oglaševanjem na Facebooku. S pregledom gradiva, ki nam je ponujeno, smo preverili pogoje, načine, oblike … oglaševanja, ki pa smo jih s pregledom situacije v praksi preverili in dopolnili. Ob zaključku dela lahko rečemo, da je oglaševanje preko FB enostavnejše, cenejše, dostopnejše, omogoča nam ažurnost in samo komunikacijo z naslovniki, ki so potencialni kupci naših ponudb. Množični mediji nam omogočajo mnogotero obliko oglaševanja. Izbrana oblika ponuja...

Computational geometry algorithms and applications

CERN Document Server

de Berg, Mark; Overmars, Mark; Schwarzkopf, Otfried

1997-01-01

Computational geometry emerged from the field of algorithms design and anal­ ysis in the late 1970s. It has grown into a recognized discipline with its own journals, conferences, and a large community of active researchers. The suc­ cess of the field as a research discipline can on the one hand be explained from the beauty of the problems studied and the solutions obtained, and, on the other hand, by the many application domains--computer graphics, geographic in­ formation systems (GIS), robotics, and others-in which geometric algorithms play a fundamental role. For many geometric problems the early algorithmic solutions were either slow or difficult to understand and implement. In recent years a number of new algorithmic techniques have been developed that improved and simplified many of the previous approaches. In this textbook we have tried to make these modem algorithmic solutions accessible to a large audience. The book has been written as a textbook for a course in computational geometry, but it can ...

Comparing Online Algorithms for Bin Packing Problems

DEFF Research Database (Denmark)

Epstein, Leah; Favrholdt, Lene Monrad; Kohrt, Jens Svalgaard

2012-01-01

The relative worst-order ratio is a measure of the quality of online algorithms. In contrast to the competitive ratio, this measure compares two online algorithms directly instead of using an intermediate comparison with an optimal offline algorithm. In this paper, we apply the relative worst-ord......-order ratio to online algorithms for several common variants of the bin packing problem. We mainly consider pairs of algorithms that are not distinguished by the competitive ratio and show that the relative worst-order ratio prefers the intuitively better algorithm of each pair....

Laser-induced ionization of Na vapor

International Nuclear Information System (INIS)

Wu, R.C.Y.; Judge, D.L.; Roussel, F.; Carre, B.; Breger, P.; Spiess, G.

1982-01-01

The production of Na 2 + ions by off-resonant laser excitation in the 5800-6200A region mainly results from two-photon absorption by the Na 2 molecule to highly excited gerade states followed by (a) direct ionization by absorbing a third photon or (b) coupling to the molecular Na 2 D 1 PIμ Rydberg state which is subsequently ionized by absorbing a third photon. This mechanism, i.e., a two-photon resonance three photon ionization process, explains a recent experimental observation of Roussel et al. It is suggested that the very same mechanism is also responsible for a similar observation reported by Polak-Dingels et al in their work using two crossed Na beams. In the latter two studies the laser-induced associative ionization processes were reported to be responsible for producing the Na 2 + ion. From the ratio of molecular to atomic concentration in the crossed beam experiment of Polak-Dingels et al we estimate that the cross section for producing Na 2 + through laser-induced associative ionization is at least four orders of magnitude smaller than ionization through the two-photon resonance three photon ionization process in Na 2 molecules

Characterization and antibacterial activity of silver exchanged regenerated NaY zeolite from surfactant-modified NaY zeolite

Energy Technology Data Exchange (ETDEWEB)

Salim, Mashitah Mad; Malek, Nik Ahmad Nizam Nik, E-mail: niknizam@fbb.utm.my

2016-02-01

The antibacterial activity of regenerated NaY zeolite (thermal treatment from cetyltrimethyl ammonium bromide (CTAB)-modified NaY zeolite and pretreatment with Na ions) loaded with silver ions were examined using the broth dilution minimum inhibitory concentration (MIC) method against Escherichia coli (E. coli ATCC 11229) and Staphylococcus aureus (S. aureus ATCC 6538). X-ray diffraction (XRD), attenuated total reflectance–Fourier transform infrared (ATR–FTIR) spectroscopy, field emission scanning electron microscopy (FESEM), energy dispersive X-ray (EDX) and chemical elemental analyses were used to characterize the regenerated NaY and AgY zeolites. The XRD patterns indicated that the calcination and addition of silver ions on regenerated NaY zeolite did not affect the structure of the regenerated NaY zeolite as the characteristic peaks of the NaY zeolite were retained, and no new peaks were observed. The regenerated AgY zeolite showed good antibacterial activity against both bacteria strains in distilled water, and the antibacterial activity of the samples increased with increasing Ag loaded on the regenerated AgY zeolite; the regenerated AgY zeolite was more effective against E. coli than S. aureus. However, the antibacterial activity of the regenerated AgY was not effective in saline solution for both bacteria. The study showed that CTAB-modified NaY zeolite materials could be regenerated to NaY zeolite using thermal treatment (550 °C, 5 h) and this material has excellent performance as an antibacterial agent after silver ions loading. - Highlights: • Thermal treatment was used to regenerate surfactant modified zeolite. • The regenerated NaY zeolite formed was added with different silver loadings. • Regenerated AgY zeolite was tested for antibacterial activity on E. coli and S. aureus. • The antibacterial activity increased with increased of the amount of silver loadings. • The zeolite structure did not change with thermal and modification

Characterization and antibacterial activity of silver exchanged regenerated NaY zeolite from surfactant-modified NaY zeolite

International Nuclear Information System (INIS)

Salim, Mashitah Mad; Malek, Nik Ahmad Nizam Nik

2016-01-01

The antibacterial activity of regenerated NaY zeolite (thermal treatment from cetyltrimethyl ammonium bromide (CTAB)-modified NaY zeolite and pretreatment with Na ions) loaded with silver ions were examined using the broth dilution minimum inhibitory concentration (MIC) method against Escherichia coli (E. coli ATCC 11229) and Staphylococcus aureus (S. aureus ATCC 6538). X-ray diffraction (XRD), attenuated total reflectance–Fourier transform infrared (ATR–FTIR) spectroscopy, field emission scanning electron microscopy (FESEM), energy dispersive X-ray (EDX) and chemical elemental analyses were used to characterize the regenerated NaY and AgY zeolites. The XRD patterns indicated that the calcination and addition of silver ions on regenerated NaY zeolite did not affect the structure of the regenerated NaY zeolite as the characteristic peaks of the NaY zeolite were retained, and no new peaks were observed. The regenerated AgY zeolite showed good antibacterial activity against both bacteria strains in distilled water, and the antibacterial activity of the samples increased with increasing Ag loaded on the regenerated AgY zeolite; the regenerated AgY zeolite was more effective against E. coli than S. aureus. However, the antibacterial activity of the regenerated AgY was not effective in saline solution for both bacteria. The study showed that CTAB-modified NaY zeolite materials could be regenerated to NaY zeolite using thermal treatment (550 °C, 5 h) and this material has excellent performance as an antibacterial agent after silver ions loading. - Highlights: • Thermal treatment was used to regenerate surfactant modified zeolite. • The regenerated NaY zeolite formed was added with different silver loadings. • Regenerated AgY zeolite was tested for antibacterial activity on E. coli and S. aureus. • The antibacterial activity increased with increased of the amount of silver loadings. • The zeolite structure did not change with thermal and modification

Carbon dioxide sequestration using NaHSO4 and NaOH: A dissolution and carbonation optimisation study.

Science.gov (United States)

Sanna, Aimaro; Steel, Luc; Maroto-Valer, M Mercedes

2017-03-15

The use of NaHSO 4 to leach out Mg fromlizardite-rich serpentinite (in form of MgSO 4 ) and the carbonation of CO 2 (captured in form of Na 2 CO 3 using NaOH) to form MgCO 3 and Na 2 SO 4 was investigated. Unlike ammonium sulphate, sodium sulphate can be separated via precipitation during the recycling step avoiding energy intensive evaporation process required in NH 4 -based processes. To determine the effectiveness of the NaHSO 4 /NaOH process when applied to lizardite, the optimisation of the dissolution and carbonation steps were performed using a UK lizardite-rich serpentine. Temperature, solid/liquid ratio, particle size, concentration and molar ratio were evaluated. An optimal dissolution efficiency of 69.6% was achieved over 3 h at 100 °C using 1.4 M sodium bisulphate and 50 g/l serpentine with particle size 75-150 μm. An optimal carbonation efficiency of 95.4% was achieved over 30 min at 90 °C and 1:1 magnesium:sodium carbonate molar ratio using non-synthesised solution. The CO 2 sequestration capacity was 223.6 g carbon dioxide/kg serpentine (66.4% in terms of Mg bonded to hydromagnesite), which is comparable with those obtained using ammonium based processes. Therefore, lizardite-rich serpentinites represent a valuable resource for the NaHSO 4 /NaOH based pH swing mineralisation process. Copyright © 2016 Elsevier Ltd. All rights reserved.

Characterization and antibacterial activity of silver exchanged regenerated NaY zeolite from surfactant-modified NaY zeolite.

Science.gov (United States)

Salim, Mashitah Mad; Malek, Nik Ahmad Nizam Nik

2016-02-01

The antibacterial activity of regenerated NaY zeolite (thermal treatment from cetyltrimethyl ammonium bromide (CTAB)-modified NaY zeolite and pretreatment with Na ions) loaded with silver ions were examined using the broth dilution minimum inhibitory concentration (MIC) method against Escherichia coli (E. coli ATCC 11229) and Staphylococcus aureus (S. aureus ATCC 6538). X-ray diffraction (XRD), attenuated total reflectance-Fourier transform infrared (ATR-FTIR) spectroscopy, field emission scanning electron microscopy (FESEM), energy dispersive X-ray (EDX) and chemical elemental analyses were used to characterize the regenerated NaY and AgY zeolites. The XRD patterns indicated that the calcination and addition of silver ions on regenerated NaY zeolite did not affect the structure of the regenerated NaY zeolite as the characteristic peaks of the NaY zeolite were retained, and no new peaks were observed. The regenerated AgY zeolite showed good antibacterial activity against both bacteria strains in distilled water, and the antibacterial activity of the samples increased with increasing Ag loaded on the regenerated AgY zeolite; the regenerated AgY zeolite was more effective against E. coli than S. aureus. However, the antibacterial activity of the regenerated AgY was not effective in saline solution for both bacteria. The study showed that CTAB-modified NaY zeolite materials could be regenerated to NaY zeolite using thermal treatment (550°C, 5h) and this material has excellent performance as an antibacterial agent after silver ions loading. Copyright © 2015 Elsevier B.V. All rights reserved.

Composition and thermochemistry of the equilibrium vapour of the systems NaI-FeI2 and NaI-PbI2

International Nuclear Information System (INIS)

Hilpert, K.; Gerads, H.; Koberts, D.; Miller, M.

1987-01-01

The vaporization of NaI/FeI 2 and NaI/PbI 2 samples of equimolar composition was investigated was investigated in the temperature ranges between 574 to 683 K and 562 to 669 K, respectively, by using the mass spectrometric Knudsen effusion method. The gaseous species I, I 2 , NaI, (NaI) 2 , FeI 2 , (FeI 2 ) 2 , FeI 3 , NaFeI 3 , and Na 2 FeI 4 (NaI-FeI 2 system) as well as NaI, (NaI) 2 , PbI 2 , (PbI 2 ) 2 , and NaPbI 3 (NaI-PbI 2 system) are present in the equilibrium vapours. The equilibrium partial pressures of these species were determined with the exception of I, I 2 , and FeI 3 . Enthalpies and entropies of dissociation resulted for the reactions NaFeI 3 (g) ↔ NaI(g)+FeI 2 (g) (1), Na 2 FeI 4 (g) ↔ 2NaI(g)+FeI 2 (g) and (2) NaPbI 3 (g) ↔ NaI(g)+PbI 2 (g) (3) as Δ d H 298 0 (Eq. (1)) = 184±5 kJ mol -1 , Δ d S 298 0 (Eq. (1)) = 143±8 J mol -1 K -1 ; Δ d H 298 0 (Eq. (2)) = 333±9 kJ mol -1 , Δ d S 298 0 (Eq. (2)) = 274±14 J mol -1 K -1 ; and Δ d H 298 0 (Eq. (3)) = 168±5 kJ mol -1 , Δ d S 298 0 (Eq. (3)) = 151±9 J mol -1 K -1 . Equilibrium constants for these reactions are additionally given. The pressures of NaFeI 3 (g) and NaPbI 3 (g) as all as their enthalpies of dissociation are discussed with respect to their significance of semi empirical rules. (orig.)

Adsorption and Formation of Small Na Clusters on Pristine and Double-Vacancy Graphene for Anodes of Na-Ion Batteries.

Science.gov (United States)

Liang, Zhicong; Fan, Xiaofeng; Zheng, Weitao; Singh, David J

2017-05-24

Layered carbon is a likely anode material for Na-ion batteries (NIBs). Graphitic carbon has a low capacity of approximately 35 (mA h)/g due to the formation of NaC 64 . Using first-principles methods including van der Waals interactions, we analyze the adsorption of Na ions and clusters on graphene in the context of anodes. The interaction between Na ions and graphene is found to be weak. Small Na clusters are not stable on the surface of pristine graphene in the electrochemical environment of NIBs. However, we find that Na ions and clusters can be stored effectively on defected graphene that has double vacancies. In addition, the adsorption energy of small Na clusters near a double vacancy is found to decrease with increasing cluster size. With high concentrations of vacancies the capacity of Na on defective graphene is found to be as much as 10-30 times higher than that of graphitic carbon.

Algorithms

Indian Academy of Sciences (India)

algorithm that it is implicitly understood that we know how to generate the next natural ..... Explicit comparisons are made in line (1) where maximum and minimum is ... It can be shown that the function T(n) = 3/2n -2 is the solution to the above ...

Empirical tests of the Gradual Learning Algorithm

NARCIS (Netherlands)

Boersma, P.; Hayes, B.

1999-01-01

The Gradual Learning Algorithm (Boersma 1997) is a constraint ranking algorithm for learning Optimality-theoretic grammars. The purpose of this article is to assess the capabilities of the Gradual Learning Algorithm, particularly in comparison with the Constraint Demotion algorithm of Tesar and

Empirical tests of the Gradual Learning Algorithm

NARCIS (Netherlands)

Boersma, P.; Hayes, B.

2001-01-01

The Gradual Learning Algorithm (Boersma 1997) is a constraint-ranking algorithm for learning optimality-theoretic grammars. The purpose of this article is to assess the capabilities of the Gradual Learning Algorithm, particularly in comparison with the Constraint Demotion algorithm of Tesar and

Deterministic algorithms for multi-criteria Max-TSP

NARCIS (Netherlands)

Manthey, Bodo

2012-01-01

We present deterministic approximation algorithms for the multi-criteria maximum traveling salesman problem (Max-TSP). Our algorithms are faster and simpler than the existing randomized algorithms. We devise algorithms for the symmetric and asymmetric multi-criteria Max-TSP that achieve ratios of

Verification-Based Interval-Passing Algorithm for Compressed Sensing

OpenAIRE

Wu, Xiaofu; Yang, Zhen

2013-01-01

We propose a verification-based Interval-Passing (IP) algorithm for iteratively reconstruction of nonnegative sparse signals using parity check matrices of low-density parity check (LDPC) codes as measurement matrices. The proposed algorithm can be considered as an improved IP algorithm by further incorporation of the mechanism of verification algorithm. It is proved that the proposed algorithm performs always better than either the IP algorithm or the verification algorithm. Simulation resul...

Multimodal Estimation of Distribution Algorithms.

Science.gov (United States)

Yang, Qiang; Chen, Wei-Neng; Li, Yun; Chen, C L Philip; Xu, Xiang-Min; Zhang, Jun

2016-02-15

Taking the advantage of estimation of distribution algorithms (EDAs) in preserving high diversity, this paper proposes a multimodal EDA. Integrated with clustering strategies for crowding and speciation, two versions of this algorithm are developed, which operate at the niche level. Then these two algorithms are equipped with three distinctive techniques: 1) a dynamic cluster sizing strategy; 2) an alternative utilization of Gaussian and Cauchy distributions to generate offspring; and 3) an adaptive local search. The dynamic cluster sizing affords a potential balance between exploration and exploitation and reduces the sensitivity to the cluster size in the niching methods. Taking advantages of Gaussian and Cauchy distributions, we generate the offspring at the niche level through alternatively using these two distributions. Such utilization can also potentially offer a balance between exploration and exploitation. Further, solution accuracy is enhanced through a new local search scheme probabilistically conducted around seeds of niches with probabilities determined self-adaptively according to fitness values of these seeds. Extensive experiments conducted on 20 benchmark multimodal problems confirm that both algorithms can achieve competitive performance compared with several state-of-the-art multimodal algorithms, which is supported by nonparametric tests. Especially, the proposed algorithms are very promising for complex problems with many local optima.

Algorithms and Their Explanations

NARCIS (Netherlands)

Benini, M.; Gobbo, F.; Beckmann, A.; Csuhaj-Varjú, E.; Meer, K.

2014-01-01

By analysing the explanation of the classical heapsort algorithm via the method of levels of abstraction mainly due to Floridi, we give a concrete and precise example of how to deal with algorithmic knowledge. To do so, we introduce a concept already implicit in the method, the ‘gradient of

Engineering a Cache-Oblivious Sorting Algorithm

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf; Vinther, Kristoffer

2007-01-01

This paper is an algorithmic engineering study of cache-oblivious sorting. We investigate by empirical methods a number of implementation issues and parameter choices for the cache-oblivious sorting algorithm Lazy Funnelsort, and compare the final algorithm with Quicksort, the established standard...

Novel regulation of cardiac Na pump via phospholemman.

Science.gov (United States)

Pavlovic, Davor; Fuller, William; Shattock, Michael J

2013-08-01

As the only quantitatively significant Na efflux pathway from cardiac cells, the Na/K ATPase (Na pump) is the primary regulator of intracellular Na. The transmembrane Na gradient it establishes is essential for normal electrical excitability, numerous coupled-transport processes and, as the driving force for Na/Ca exchange, thus setting cardiac Ca load and contractility. As Na influx varies with electrical excitation, heart rate and pathology, the dynamic regulation of Na efflux is essential. It is now widely recognized that phospholemman, a 72 amino acid accessory protein which forms part of the Na pump complex, is the key nexus linking cellular signaling to pump regulation. Phospholemman is the target of a variety of post-translational modifications (including phosphorylation, palmitoylation and glutathionation) and these can dynamically alter the activity of the Na pump. This review summarizes our current understanding of the multiple regulatory mechanisms that converge on phospholemman and govern NA pump activity in the heart. The corrected Fig. 4 is reproduced below. The publisher would like to apologize for any inconvenience caused. [corrected]. Copyright © 2013. Published by Elsevier Ltd.

PROPOSAL OF ALGORITHM FOR ROUTE OPTIMIZATION

OpenAIRE

Robert Ramon de Carvalho Sousa; Abimael de Jesus Barros Costa; Eliezé Bulhões de Carvalho; Adriano de Carvalho Paranaíba; Daylyne Maerla Gomes Lima Sandoval

2016-01-01

This article uses “Six Sigma” methodology for the elaboration of an algorithm for routing problems which is able to obtain more efficient results than those from Clarke and Wright´s (CW) algorithm (1964) in situations of random increase of product delivery demands, facing the incapability of service level increase . In some situations, the algorithm proposed obtained more efficient results than the CW algorithm. The key factor was a reduction in the number of mistakes (on...

Genetic algorithms and fuzzy multiobjective optimization

CERN Document Server

Sakawa, Masatoshi

2002-01-01

Since the introduction of genetic algorithms in the 1970s, an enormous number of articles together with several significant monographs and books have been published on this methodology. As a result, genetic algorithms have made a major contribution to optimization, adaptation, and learning in a wide variety of unexpected fields. Over the years, many excellent books in genetic algorithm optimization have been published; however, they focus mainly on single-objective discrete or other hard optimization problems under certainty. There appears to be no book that is designed to present genetic algorithms for solving not only single-objective but also fuzzy and multiobjective optimization problems in a unified way. Genetic Algorithms And Fuzzy Multiobjective Optimization introduces the latest advances in the field of genetic algorithm optimization for 0-1 programming, integer programming, nonconvex programming, and job-shop scheduling problems under multiobjectiveness and fuzziness. In addition, the book treats a w...

Principal component analysis networks and algorithms

CERN Document Server

Kong, Xiangyu; Duan, Zhansheng

2017-01-01

This book not only provides a comprehensive introduction to neural-based PCA methods in control science, but also presents many novel PCA algorithms and their extensions and generalizations, e.g., dual purpose, coupled PCA, GED, neural based SVD algorithms, etc. It also discusses in detail various analysis methods for the convergence, stabilizing, self-stabilizing property of algorithms, and introduces the deterministic discrete-time systems method to analyze the convergence of PCA/MCA algorithms. Readers should be familiar with numerical analysis and the fundamentals of statistics, such as the basics of least squares and stochastic algorithms. Although it focuses on neural networks, the book only presents their learning law, which is simply an iterative algorithm. Therefore, no a priori knowledge of neural networks is required. This book will be of interest and serve as a reference source to researchers and students in applied mathematics, statistics, engineering, and other related fields.

FIREWORKS ALGORITHM FOR UNCONSTRAINED FUNCTION OPTIMIZATION PROBLEMS

Directory of Open Access Journals (Sweden)

Evans BAIDOO

2017-03-01

Full Text Available Modern real world science and engineering problems can be classified as multi-objective optimisation problems which demand for expedient and efficient stochastic algorithms to respond to the optimization needs. This paper presents an object-oriented software application that implements a firework optimization algorithm for function optimization problems. The algorithm, a kind of parallel diffuse optimization algorithm is based on the explosive phenomenon of fireworks. The algorithm presented promising results when compared to other population or iterative based meta-heuristic algorithm after it was experimented on five standard benchmark problems. The software application was implemented in Java with interactive interface which allow for easy modification and extended experimentation. Additionally, this paper validates the effect of runtime on the algorithm performance.

A Cavity QED Implementation of Deutsch-Jozsa Algorithm

OpenAIRE

Guerra, E. S.

2004-01-01

The Deutsch-Jozsa algorithm is a generalization of the Deutsch algorithm which was the first algorithm written. We present schemes to implement the Deutsch algorithm and the Deutsch-Jozsa algorithm via cavity QED.

A pipelined FPGA implementation of an encryption algorithm based on genetic algorithm

Science.gov (United States)

Thirer, Nonel

2013-05-01

With the evolution of digital data storage and exchange, it is essential to protect the confidential information from every unauthorized access. High performance encryption algorithms were developed and implemented by software and hardware. Also many methods to attack the cipher text were developed. In the last years, the genetic algorithm has gained much interest in cryptanalysis of cipher texts and also in encryption ciphers. This paper analyses the possibility to use the genetic algorithm as a multiple key sequence generator for an AES (Advanced Encryption Standard) cryptographic system, and also to use a three stages pipeline (with four main blocks: Input data, AES Core, Key generator, Output data) to provide a fast encryption and storage/transmission of a large amount of data.

A Parallel Butterfly Algorithm

KAUST Repository

Poulson, Jack; Demanet, Laurent; Maxwell, Nicholas; Ying, Lexing

2014-01-01

The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.

A Parallel Butterfly Algorithm

KAUST Repository

Poulson, Jack

2014-02-04

The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.

One improved LSB steganography algorithm

Science.gov (United States)

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.

Graph Algorithm Animation with Grrr

OpenAIRE

Rodgers, Peter; Vidal, Natalia

2000-01-01

We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and profiling of Grrr code, but recently it has been extended for the purpose of teaching algorithms to undergraduate students. The animation is restricted to graph based algorithms such as graph drawing, list manipulation or more traditional gra...

Algorithms over partially ordered sets

DEFF Research Database (Denmark)

Baer, Robert M.; Østerby, Ole

1969-01-01

in partially ordered sets, answer the combinatorial question of how many maximal chains might exist in a partially ordered set withn elements, and we give an algorithm for enumerating all maximal chains. We give (in § 3) algorithms which decide whether a partially ordered set is a (lower or upper) semi......-lattice, and whether a lattice has distributive, modular, and Boolean properties. Finally (in § 4) we give Algol realizations of the various algorithms....

A generalization of Takane's algorithm for DEDICOM

NARCIS (Netherlands)

Kiers, Henk A.L.; ten Berge, Jos M.F.; Takane, Yoshio; de Leeuw, Jan

An algorithm is described for fitting the DEDICOM model for the analysis of asymmetric data matrices. This algorithm generalizes an algorithm suggested by Takane in that it uses a damping parameter in the iterative process. Takane's algorithm does not always converge monotonically. Based on the

Integrating Algorithm Visualization Video into a First-Year Algorithm and Data Structure Course

Science.gov (United States)

Crescenzi, Pilu; Malizia, Alessio; Verri, M. Cecilia; Diaz, Paloma; Aedo, Ignacio

2012-01-01

In this paper we describe the results that we have obtained while integrating algorithm visualization (AV) movies (strongly tightened with the other teaching material), within a first-year undergraduate course on algorithms and data structures. Our experimental results seem to support the hypothesis that making these movies available significantly…

Power of automated algorithms for combining time-line follow-back and urine drug screening test results in stimulant-abuse clinical trials.

Science.gov (United States)

Oden, Neal L; VanVeldhuisen, Paul C; Wakim, Paul G; Trivedi, Madhukar H; Somoza, Eugene; Lewis, Daniel

2011-09-01

In clinical trials of treatment for stimulant abuse, researchers commonly record both Time-Line Follow-Back (TLFB) self-reports and urine drug screen (UDS) results. To compare the power of self-report, qualitative (use vs. no use) UDS assessment, and various algorithms to generate self-report-UDS composite measures to detect treatment differences via t-test in simulated clinical trial data. We performed Monte Carlo simulations patterned in part on real data to model self-report reliability, UDS errors, dropout, informatively missing UDS reports, incomplete adherence to a urine donation schedule, temporal correlation of drug use, number of days in the study period, number of patients per arm, and distribution of drug-use probabilities. Investigated algorithms include maximum likelihood and Bayesian estimates, self-report alone, UDS alone, and several simple modifications of self-report (referred to here as ELCON algorithms) which eliminate perceived contradictions between it and UDS. Among the algorithms investigated, simple ELCON algorithms gave rise to the most powerful t-tests to detect mean group differences in stimulant drug use. Further investigation is needed to determine if simple, naïve procedures such as the ELCON algorithms are optimal for comparing clinical study treatment arms. But researchers who currently require an automated algorithm in scenarios similar to those simulated for combining TLFB and UDS to test group differences in stimulant use should consider one of the ELCON algorithms. This analysis continues a line of inquiry which could determine how best to measure outpatient stimulant use in clinical trials (NIDA. NIDA Monograph-57: Self-Report Methods of Estimating Drug Abuse: Meeting Current Challenges to Validity. NTIS PB 88248083. Bethesda, MD: National Institutes of Health, 1985; NIDA. NIDA Research Monograph 73: Urine Testing for Drugs of Abuse. NTIS PB 89151971. Bethesda, MD: National Institutes of Health, 1987; NIDA. NIDA Research

The Algorithm of Link Prediction on Social Network

Directory of Open Access Journals (Sweden)

Liyan Dong

2013-01-01

Full Text Available At present, most link prediction algorithms are based on the similarity between two entities. Social network topology information is one of the main sources to design the similarity function between entities. But the existing link prediction algorithms do not apply the network topology information sufficiently. For lack of traditional link prediction algorithms, we propose two improved algorithms: CNGF algorithm based on local information and KatzGF algorithm based on global information network. For the defect of the stationary of social network, we also provide the link prediction algorithm based on nodes multiple attributes information. Finally, we verified these algorithms on DBLP data set, and the experimental results show that the performance of the improved algorithm is superior to that of the traditional link prediction algorithm.

Algorithmic Self

DEFF Research Database (Denmark)

Markham, Annette

This paper takes an actor network theory approach to explore some of the ways that algorithms co-construct identity and relational meaning in contemporary use of social media. Based on intensive interviews with participants as well as activity logging and data tracking, the author presents a richly...... layered set of accounts to help build our understanding of how individuals relate to their devices, search systems, and social network sites. This work extends critical analyses of the power of algorithms in implicating the social self by offering narrative accounts from multiple perspectives. It also...... contributes an innovative method for blending actor network theory with symbolic interaction to grapple with the complexity of everyday sensemaking practices within networked global information flows....

All new for NA62

CERN Multimedia

Antonella Del Rosso

2012-01-01

This week sees the start of the first run of the new NA62 experiment. This will be a unique opportunity for the collaboration to test its new beam, new detectors and new data acquisition system before the physics run in 2014. Speaking to the Bulletin, the NA62 technical coordinator Ferdinand Hahn shares the many challenges that the various teams faced to be on time for beam. Ready, steady, start!   A Large Angle Veto detector (white) in place in the NA62 decay volume (blue). With components from almost all the detectors in place downstream of the decay point of the mother particles – the kaons – and of the KTAG detector that tags the kaons before they decay, NA62 is ready for its first technical run. This unique run will test all the equipment as well as the trigger and the data acquisition systems. “This year, we will have about five weeks of beam from the SPS before the long shutdown of all the CERN machines,” says Ferdinand Hahn, NA62 Technical Co-...

Discrete Riccati equation solutions: Distributed algorithms

Directory of Open Access Journals (Sweden)

D. G. Lainiotis

1996-01-01

Full Text Available In this paper new distributed algorithms for the solution of the discrete Riccati equation are introduced. The algorithms are used to provide robust and computational efficient solutions to the discrete Riccati equation. The proposed distributed algorithms are theoretically interesting and computationally attractive.

Effect of chloride substitution on the order–disorder transition in NaBH4 and Na11BD4

International Nuclear Information System (INIS)

Olsen, Jørn Eirik; Karen, Pavel; Sørby, Magnus H.; Hauback, Bjørn C.

2014-01-01

Graphical abstract: Interactions that order the BD 4 - tetrahedra below the order–disorder transition became increasingly frustrated by the solute in the Na( 11 BD 4 ) 1−x Cl x solid solutions, and the order disappears at x = 0.158. Highlights: • The order–disorder transition temperature for Na(BH 4 ) 1−x Cl x and Na( 11 BD 4 ) 1−x Cl x is highly dependent on the Cl-content, x. • The transition is characterized by DSC for Na( 11 BD 4 ) 1−x Cl x for x = 0, 0.10 and 0.15. • No transition is observed for x ⩾ 0.20 on cooling to 8 K. • The crystal structures are reported for Na 11 BD 4 at room temperature and 8 K and Na( 11 BD 4 ) 1−x Cl x (x = 0.10, 0.15, 0.20 and 0.25) at 8 K from powder neutron diffraction. -- Abstract: Phase transition associated with anion disordering over two orientations in Na 11 BD 4 (NaBH 4 ) and its solid solutions with NaCl, Na( 11 BD 4 ) 1−x Cl x , is investigated with powder diffraction (neutron and synchrotron radiation), differential scanning calorimetry and Raman spectroscopy. Upon heating, the transition temperature extrapolated to zero rate of heating is 192.2 K for Na 11 BD 4 , ΔS = 4.41 J/mol K, hysteresis 1.7 K and the volume increase 0.43%. Thermal parameters of the transition in Na( 11 BD 4 ) 1−x Cl x follow a colligative-property model of an ideal solution, with x = 0.158(1) as the critical concentration at which the ordering interactions and the transition itself are eliminated. On approaching this limit, the tetragonal distortion of the ordered structure decreases somewhat towards the cubic average, and this is associated with a partial disorder of the tetrahedral anions seen by diffraction methods. In fact, a 3% disorder is already present in the pure solvent of the solid solution (Na 11 BD 4 ) at 8 K

Comparison of machine-learning algorithms to build a predictive model for detecting undiagnosed diabetes - ELSA-Brasil: accuracy study.

Science.gov (United States)

Olivera, André Rodrigues; Roesler, Valter; Iochpe, Cirano; Schmidt, Maria Inês; Vigo, Álvaro; Barreto, Sandhi Maria; Duncan, Bruce Bartholow

2017-01-01

Type 2 diabetes is a chronic disease associated with a wide range of serious health complications that have a major impact on overall health. The aims here were to develop and validate predictive models for detecting undiagnosed diabetes using data from the Longitudinal Study of Adult Health (ELSA-Brasil) and to compare the performance of different machine-learning algorithms in this task. Comparison of machine-learning algorithms to develop predictive models using data from ELSA-Brasil. After selecting a subset of 27 candidate variables from the literature, models were built and validated in four sequential steps: (i) parameter tuning with tenfold cross-validation, repeated three times; (ii) automatic variable selection using forward selection, a wrapper strategy with four different machine-learning algorithms and tenfold cross-validation (repeated three times), to evaluate each subset of variables; (iii) error estimation of model parameters with tenfold cross-validation, repeated ten times; and (iv) generalization testing on an independent dataset. The models were created with the following machine-learning algorithms: logistic regression, artificial neural network, naïve Bayes, K-nearest neighbor and random forest. The best models were created using artificial neural networks and logistic regression. -These achieved mean areas under the curve of, respectively, 75.24% and 74.98% in the error estimation step and 74.17% and 74.41% in the generalization testing step. Most of the predictive models produced similar results, and demonstrated the feasibility of identifying individuals with highest probability of having undiagnosed diabetes, through easily-obtained clinical data.

A Hybrid Algorithm for Optimizing Multi- Modal Functions

Institute of Scientific and Technical Information of China (English)

Li Qinghua; Yang Shida; Ruan Youlin

2006-01-01

A new genetic algorithm is presented based on the musical performance. The novelty of this algorithm is that a new genetic algorithm, mimicking the musical process of searching for a perfect state of harmony, which increases the robustness of it greatly and gives a new meaning of it in the meantime, has been developed. Combining the advantages of the new genetic algorithm, simplex algorithm and tabu search, a hybrid algorithm is proposed. In order to verify the effectiveness of the hybrid algorithm, it is applied to solving some typical numerical function optimization problems which are poorly solved by traditional genetic algorithms. The experimental results show that the hybrid algorithm is fast and reliable.

Fast algorithm of adaptive Fourier series

Science.gov (United States)

Gao, You; Ku, Min; Qian, Tao

2018-05-01

Adaptive Fourier decomposition (AFD, precisely 1-D AFD or Core-AFD) was originated for the goal of positive frequency representations of signals. It achieved the goal and at the same time offered fast decompositions of signals. There then arose several types of AFDs. AFD merged with the greedy algorithm idea, and in particular, motivated the so-called pre-orthogonal greedy algorithm (Pre-OGA) that was proven to be the most efficient greedy algorithm. The cost of the advantages of the AFD type decompositions is, however, the high computational complexity due to the involvement of maximal selections of the dictionary parameters. The present paper offers one formulation of the 1-D AFD algorithm by building the FFT algorithm into it. Accordingly, the algorithm complexity is reduced, from the original $\\mathcal{O}(M N^2)$ to $\\mathcal{O}(M N\\log_2 N)$, where $N$ denotes the number of the discretization points on the unit circle and $M$ denotes the number of points in $[0,1)$. This greatly enhances the applicability of AFD. Experiments are carried out to show the high efficiency of the proposed algorithm.

Modified Decoding Algorithm of LLR-SPA

Directory of Open Access Journals (Sweden)

Zhongxun Wang

2014-09-01

Full Text Available In wireless sensor networks, the energy consumption is mainly occurred in the stage of information transmission. The Low Density Parity Check code can make full use of the channel information to save energy. Because of the widely used decoding algorithm of the Low Density Parity Check code, this paper proposes a new decoding algorithm which is based on the LLR-SPA (Sum-Product Algorithm in Log-Likelihood-domain to improve the accuracy of the decoding algorithm. In the modified algorithm, a piecewise linear function is used to approximate the complicated Jacobi correction term in LLR-SPA decoding algorithm. Construct the tangent by the tangency point to the function of Jacobi correction term, which is based on the first order Taylor Series. In this way, the proposed piecewise linear approximation offers almost a perfect match to the function of Jacobi correction term. Meanwhile, the proposed piecewise linear approximation could avoid the operation of logarithmic which is more suitable for practical application. The simulation results show that the proposed algorithm could improve the decoding accuracy greatly without noticeable variation of the computational complexity.

Neutron diffraction studies of the Na-ion battery electrode materials NaCoCr{sub 2}(PO{sub 4}){sub 3}, NaNiCr{sub 2}(PO{sub 4}){sub 3}, and Na{sub 2}Ni{sub 2}Cr(PO{sub 4}){sub 3}

Energy Technology Data Exchange (ETDEWEB)

Yahia, H. Ben [Qatar Environment and Energy Research Institute, Hamad Bin Khalifa University, Qatar Foundation, P.O. Box 5825 Doha (Qatar); Essehli, R., E-mail: ressehli@qf.org.qa [Qatar Environment and Energy Research Institute, Hamad Bin Khalifa University, Qatar Foundation, P.O. Box 5825 Doha (Qatar); Avdeev, M. [Australian Nuclear Science and Technology Organisation, New Illawarra Road, Lucas Heights NSW 2234 (Australia); Park, J-B.; Sun, Y-K. [Department of Energy Engineering Hanyang University, 17 Haengdang-dong, Seongdong-gu, Seoul 133-791 (Korea, Republic of); Al-Maadeed, M.A. [Center for Advanced Materials (CAM), Qatar University, 2713 Doha (Qatar); Belharouak, I., E-mail: ibelharouak@qf.org.qa [Qatar Environment and Energy Research Institute, Hamad Bin Khalifa University, Qatar Foundation, P.O. Box 5825 Doha (Qatar)

2016-06-15

The new compounds NaCoCr{sub 2}(PO{sub 4}){sub 3}, NaNiCr{sub 2}(PO{sub 4}){sub 3}, and Na{sub 2}Ni{sub 2}Cr(PO{sub 4}){sub 3} were synthesized by sol-gel method and their crystal structures were determined by using neutron powder diffraction data. These compounds were characterized by galvanometric cycling and cyclic voltammetry. NaCoCr{sub 2}(PO{sub 4}){sub 3}, NaNiCr{sub 2}(PO{sub 4}){sub 3}, and Na{sub 2}Ni{sub 2}Cr(PO{sub 4}){sub 3} crystallize with a stuffed α-CrPO{sub 4}-type structure. The structure consists of a 3D-framework made of octahedra and tetrahedra that are sharing corners and/or edges generating channels along [100] and [010], in which the sodium atoms are located. Of significance, in the structures of NaNiCr{sub 2}(PO{sub 4}){sub 3}, and Na{sub 2}Ni{sub 2}Cr(PO{sub 4}){sub 3} a statistical disorder Ni{sup 2+}/Cr{sup 3+} was observed on both the 8g and 4a atomic positions, whereas in NaCoCr{sub 2}(PO{sub 4}){sub 3} the statistical disorder Co{sup 2+}/Cr{sup 3+} was only observed on the 8g atomic position. When tested as negative electrode materials, NaCoCr{sub 2}(PO{sub 4}){sub 3}, NaNiCr{sub 2}(PO{sub 4}){sub 3}, and Na{sub 2}Ni{sub 2}Cr(PO{sub 4}){sub 3} delivered specific capacities of 352, 385, and 368 mA h g{sup −1}, respectively, which attests to the electrochemical activity of sodium in these compounds. - Highlights: • NaCoCr{sub 2}(PO{sub 4}){sub 3}, NaNiCr{sub 2}(PO{sub 4}){sub 3}, and Na{sub 2}Ni{sub 2}Cr(PO{sub 4}){sub 3} were synthesized by sol-gel method. • The crystal structures were determined by using neutron powder diffraction data. • The three compounds crystallize with a stuffed α-CrPO{sub 4}-type structure. • The three compounds were tested as anodes in sodium-ion batteries. • Relatively high specific capacities were obtained for these compounds.

Comparison between iterative wavefront control algorithm and direct gradient wavefront control algorithm for adaptive optics system

Science.gov (United States)

Cheng, Sheng-Yi; Liu, Wen-Jin; Chen, Shan-Qiu; Dong, Li-Zhi; Yang, Ping; Xu, Bing

2015-08-01

Among all kinds of wavefront control algorithms in adaptive optics systems, the direct gradient wavefront control algorithm is the most widespread and common method. This control algorithm obtains the actuator voltages directly from wavefront slopes through pre-measuring the relational matrix between deformable mirror actuators and Hartmann wavefront sensor with perfect real-time characteristic and stability. However, with increasing the number of sub-apertures in wavefront sensor and deformable mirror actuators of adaptive optics systems, the matrix operation in direct gradient algorithm takes too much time, which becomes a major factor influencing control effect of adaptive optics systems. In this paper we apply an iterative wavefront control algorithm to high-resolution adaptive optics systems, in which the voltages of each actuator are obtained through iteration arithmetic, which gains great advantage in calculation and storage. For AO system with thousands of actuators, the computational complexity estimate is about O(n2) ˜ O(n3) in direct gradient wavefront control algorithm, while the computational complexity estimate in iterative wavefront control algorithm is about O(n) ˜ (O(n)3/2), in which n is the number of actuators of AO system. And the more the numbers of sub-apertures and deformable mirror actuators, the more significant advantage the iterative wavefront control algorithm exhibits. Project supported by the National Key Scientific and Research Equipment Development Project of China (Grant No. ZDYZ2013-2), the National Natural Science Foundation of China (Grant No. 11173008), and the Sichuan Provincial Outstanding Youth Academic Technology Leaders Program, China (Grant No. 2012JQ0012).

Evaluation of NaX and NaY packed beds for chromium uptake from multicomponent solution

Directory of Open Access Journals (Sweden)

Maria Angélica Simões Dornellas de Barros

2014-04-01

Full Text Available In this paper the removal of chromium from Cr/Ca/Mg/K and Cr/Ca/Mg/K/Na solutions was investigated in NaX and NaY packed beds. The breakthrough curves presented some overshooting phenomena where chromium ions displaced the previous exchanged cations. Length of unused bed, overall mass transfer coefficient, operational ratio and dimensionless variance were obtained. According to such mass transfer parameters it was concluded that the chromium uptake is influenced by the competition and interaction of the entering ions. Such influences were verified through some differences in the dynamic selectivity obtained for each system. NaY seemed to have a higher affinity towards Cr3+ and its sites were more efficiently used in the ion exchange process.

Water transport by the renal Na(+)-dicarboxylate cotransporter

DEFF Research Database (Denmark)

Meinild, A K; Loo, D D; Pajor, A M

2000-01-01

. This solute-coupled influx of water took place in the absence of, and even against, osmotic gradients. There was a strict stoichiometric relationship between Na(+), substrate, and water transport of 3 Na(+), 1 dicarboxylate, and 176 water molecules/transport cycle. These results indicate that the renal Na......This study investigated the ability of the renal Na(+)-dicarboxylate cotransporter, NaDC-1, to transport water. Rabbit NaDC-1 was expressed in Xenopus laevis oocytes, cotransporter activity was measured as the inward current generated by substrate (citrate or succinate), and water transport...... was monitored by the changes in oocyte volume. In the absence of substrates, oocytes expressing NaDC-1 showed an increase in osmotic water permeability, which was directly correlated with the expression level of NaDC-1. When NaDC-1 was transporting substrates, there was a concomitant increase in oocyte volume...

Pioneering instrumentation aspects of NA60

International Nuclear Information System (INIS)

David, Andre

2004-01-01

NA60 is taking data with proton and heavy-ion beams at the CERN SPS. Although building up on previous experiments, the dimuon physics programme of NA60 places very demanding requirements on its new detectors, in terms of radiation tolerance, granularity and read-out electronics speed. We start by comparing dimuon detection strategies in NA60 with those of previous experiments. We then describe the new detectors used in NA60, placing particular emphasis on their technological pioneering aspects as well as on their contributions to the overall physics performance of the experiment

Planar graphs theory and algorithms

CERN Document Server

Nishizeki, T

1988-01-01

Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.

Comprehensive asynchronous symmetric rendezvous algorithm in ...

Indian Academy of Sciences (India)

Meenu Chawla

2017-11-10

Nov 10, 2017 ... Simulation results affirm that CASR algorithm performs better in terms of average time-to-rendezvous as compared ... process; neighbour discovery; symmetric rendezvous algorithm. 1. .... dezvous in finite time under the symmetric model. The CH ..... CASR algorithm in Matlab 7.11 and performed several.

Occlusion of 22Na+ and 86Rb+ in membrane-bound and soluble protomeric alpha beta-units of Na,K-ATPase

International Nuclear Information System (INIS)

Vilsen, B.; Andersen, J.P.; Petersen, J.; Jorgensen, P.L.

1987-01-01

In this work, we examined occlusion of 22 Na+ and 86 Rb+ in membranous and detergent-solubilized Na,K-ATPase from outer renal medulla. Optimum conditions for occlusion of 22 Na+ were provided by formation of the phosphorylated complex from the beta,gamma-bidentate complex of chromium (III) with ATP (CrATP). Release of occluded cations occurred at equally slow rates in soluble and membrane-bound Na,K-ATPase. Values of 22 Na+ occlusion as high as 11 nmol/mg of protein were measured, corresponding to 1.8-2.7 mol of Na+/mol of phosphorylated Na,K-ATPase as determined by 32 P incorporation from [gamma- 32 P]CrATP. Maximum capacity for phosphorylation from [gamma- 32 P]CrATP was 6 nmol/mg of protein and equal to capacities for binding of [48V]vanadate and [ 3 H]ouabain. The stoichiometry for occlusion of Rb+ was close to 2 Rb+ ions/phosphorylation site. In an analytical ultracentrifuge, the soluble Na+- or Rb+-occluded complexes showed sedimentation velocities (S20,w = 6.8-7.4) consistent with monomeric alpha beta-units. The data show that soluble monomeric alpha beta-units of Na,K-ATPase can occlude Rb+ or Na+ with the same stoichiometry as the membrane-bound enzyme. The structural basis for occlusion of cations in Na,K-ATPase is suggested to be the formation of a cavity inside a monomeric alpha beta-unit constituting the minimum protein unit required for active Na,K-transport

Transcriptional regulators of Na, K-ATPase subunits

Directory of Open Access Journals (Sweden)

Zhiqin eLi

2015-10-01

Full Text Available The Na,K-ATPase classically serves as an ion pump creating an electrochemical gradient across the plasma membrane that is essential for transepithelial transport, nutrient uptake and membrane potential. In addition, Na,K-ATPase also functions as a receptor, a signal transducer and a cell adhesion molecule. With such diverse roles, it is understandable that the Na,K-ATPase subunits, the catalytic alpha-subunit, the beta-subunit and the FXYD proteins, are controlled extensively during development and to accommodate physiological needs. The spatial and temporal expression of Na,K-ATPase is partially regulated at the transcriptional level. Numerous transcription factors, hormones, growth factors, lipids and extracellular stimuli modulate the transcription of the Na,K-ATPase subunits. Moreover, epigenetic mechanisms also contribute to the regulation of Na,K-ATPase expression. With the ever growing knowledge about diseases associated with the malfunction of Na,K-ATPase, this review aims at summarizing the best-characterized transcription regulators that modulate Na,K-ATPase subunit levels. As abnormal expression of Na,K-ATPase subunits have been observed in many carcinoma, we will also discuss transcription factors that are associated with epithelial-to-mesenchymal transition, a crucial step in the progression of many tumors to malignant disease.

Learning algorithms and automatic processing of languages

International Nuclear Information System (INIS)

Fluhr, Christian Yves Andre

1977-01-01

This research thesis concerns the field of artificial intelligence. It addresses learning algorithms applied to automatic processing of languages. The author first briefly describes some mechanisms of human intelligence in order to describe how these mechanisms are simulated on a computer. He outlines the specific role of learning in various manifestations of intelligence. Then, based on the Markov's algorithm theory, the author discusses the notion of learning algorithm. Two main types of learning algorithms are then addressed: firstly, an 'algorithm-teacher dialogue' type sanction-based algorithm which aims at learning how to solve grammatical ambiguities in submitted texts; secondly, an algorithm related to a document system which structures semantic data automatically obtained from a set of texts in order to be able to understand by references to any question on the content of these texts

Using Alternative Multiplication Algorithms to "Offload" Cognition

Science.gov (United States)

Jazby, Dan; Pearn, Cath

2015-01-01

When viewed through a lens of embedded cognition, algorithms may enable aspects of the cognitive work of multi-digit multiplication to be "offloaded" to the environmental structure created by an algorithm. This study analyses four multiplication algorithms by viewing different algorithms as enabling cognitive work to be distributed…

Sepsis does not alter red blood cell glucose metabolism or Na+ concentration: A 2H-, 23Na-NMR study

International Nuclear Information System (INIS)

Hotchkiss, R.S.; Song, S.K.; Ling, C.S.; Ackerman, J.J.; Karl, I.E.

1990-01-01

The effects of sepsis on intracellular Na+ concentration ([Na+]i) and glucose metabolism were examined in rat red blood cells (RBCs) by using 23Na- and 2H-nuclear magnetic resonance (NMR) spectroscopy. Sepsis was induced in 15 halothane-anesthetized female Sprague-Dawley rats by using the cecal ligation and perforation technique; 14 control rats underwent cecal manipulation without ligation. The animals were fasted for 36 h, but allowed free access to water. At 36 h postsurgery, RBCs were examined by 23Na-NMR by using dysprosium tripolyphosphate as a chemical shift reagent. Human RBCs from 17 critically ill nonseptic patients and from 7 patients who were diagnosed as septic were also examined for [Na+]i. Five rat RBC specimens had [Na+]i determined by both 23Na-NMR and inductively coupled plasma-atomic emission spectroscopy (ICP-AES). For glucose metabolism studies, RBCs from septic and control rats were suspended in modified Krebs-Henseleit buffer containing [6,6-2H2]glucose and examined by 2H-NMR. No significant differences in [Na+]i or glucose utilization were found in RBCs from control or septic rats. There were no differences in [Na+]i in the two groups of patients. The [Na+]i determined by NMR spectroscopy agreed closely with measurements using ICP-AES and establish that 100% of the [Na+]i of the RBC is visible by NMR. Glucose measurements determined by 2H-NMR correlated closely (correlation coefficient = 0.93) with enzymatic analysis. These studies showed no evidence that sepsis disturbed RBC membrane function or metabolism

SPOLNO NADLEGOVANJE NA DELOVNEM MESTU

OpenAIRE

Rubič, Gašper

2016-01-01

V diplomskem delu smo v uvodu predstavili problem spolnega nadlegovanja na delovnem mestu in predstavili podjetje TEKSTIL d.d. V nadaljevanju smo z anketo raziskali, ali problem spolnega nadlegovanja na delovnem mestu v obravnavanem podjetju obstaja in če, kako se nanj odziva okolje. V teoretičnem delu smo nadaljevali in predstavili definicijo spolnega nadlegovanja, ki je kakršna koli oblika nezaželenega verbalnega in neverbalnega ali fizičnega ravnanja spolne narave z učinkom ali nameno...

Named Entity Linking Algorithm

Directory of Open Access Journals (Sweden)

M. F. Panteleev

2017-01-01

Full Text Available In the tasks of processing text in natural language, Named Entity Linking (NEL represents the task to define and link some entity, which is found in the text, with some entity in the knowledge base (for example, Dbpedia. Currently, there is a diversity of approaches to solve this problem, but two main classes can be identified: graph-based approaches and machine learning-based ones. Graph and Machine Learning approaches-based algorithm is proposed accordingly to the stated assumptions about the interrelations of named entities in a sentence and in general.In the case of graph-based approaches, it is necessary to solve the problem of identifying an optimal set of the related entities according to some metric that characterizes the distance between these entities in a graph built on some knowledge base. Due to limitations in processing power, to solve this task directly is impossible. Therefore, its modification is proposed. Based on the algorithms of machine learning, an independent solution cannot be built due to small volumes of training datasets relevant to NEL task. However, their use can contribute to improving the quality of the algorithm. The adaptation of the Latent Dirichlet Allocation model is proposed in order to obtain a measure of the compatibility of attributes of various entities encountered in one context.The efficiency of the proposed algorithm was experimentally tested. A test dataset was independently generated. On its basis the performance of the model was compared using the proposed algorithm with the open source product DBpedia Spotlight, which solves the NEL problem.The mockup, based on the proposed algorithm, showed a low speed as compared to DBpedia Spotlight. However, the fact that it has shown higher accuracy, stipulates the prospects for work in this direction.The main directions of development were proposed in order to increase the accuracy of the system and its productivity.

Algorithm 426 : Merge sort algorithm [M1

NARCIS (Netherlands)

Bron, C.

1972-01-01

Sorting by means of a two-way merge has a reputation of requiring a clerically complicated and cumbersome program. This ALGOL 60 procedure demonstrates that, using recursion, an elegant and efficient algorithm can be designed, the correctness of which is easily proved [2]. Sorting n objects gives

Wavefront-ray grid FDTD algorithm

OpenAIRE

ÇİYDEM, MEHMET

2016-01-01

A finite difference time domain algorithm on a wavefront-ray grid (WRG-FDTD) is proposed in this study to reduce numerical dispersion of conventional FDTD methods. A FDTD algorithm conforming to a wavefront-ray grid can be useful to take into account anisotropy effects of numerical grids since it features directional energy flow along the rays. An explicit and second-order accurate WRG-FDTD algorithm is provided in generalized curvilinear coordinates for an inhomogeneous isotropic medium. Num...

Unsupervised Classification Using Immune Algorithm

OpenAIRE

Al-Muallim, M. T.; El-Kouatly, R.

2012-01-01

Unsupervised classification algorithm based on clonal selection principle named Unsupervised Clonal Selection Classification (UCSC) is proposed in this paper. The new proposed algorithm is data driven and self-adaptive, it adjusts its parameters to the data to make the classification operation as fast as possible. The performance of UCSC is evaluated by comparing it with the well known K-means algorithm using several artificial and real-life data sets. The experiments show that the proposed U...

Photodesorption of Na atoms from rough Na surfaces

DEFF Research Database (Denmark)

Balzer, Frank; Gerlach, R.; Manson, J.R.

1997-01-01

We investigate the desorption of Na atoms from large Na clusters deposited on dielectric surfaces. High-resolution translational energy distributions of the desorbing atoms are determined by three independent methods, two-photon laser-induced fluorescence, as well as single-photon and resonance......-enhanced two-photon ionization techniques. Upon variation of surface temperature and for different substrates (mica vs lithium fluoride) clear non-Maxwellian time-of-flight distributions are observed with a cos θ angular dependence and most probable kinetic energies below that expected of atoms desorbing from...... atoms are scattered by surface vibrations. Recent experiments providing time constants for the decay of the optical excitations in the clusters support this model. The excellent agreement between experiment and theory indicates the importance of both absorption of the laser photons via direct excitation...

Evaluation of {sup 23}Na(n,2n){sup 22}Na reaction cross-sections

Energy Technology Data Exchange (ETDEWEB)

Manokhin, V N [Institute of Physics and Power Engineering, Obninsk (Russian Federation)

1997-06-01

Using available experimental data and (n,2n) excitation function systematics {sup 23}Na(n,2n){sup 22}Na reaction cross-sections were evaluated for energies ranging from the reaction threshold to 20 MeV. (author). 21 refs, 1 fig., 2 tabs.

Formation of hydroxyl groups and exchange with deuterium on NaHX and NaHY zeolites

International Nuclear Information System (INIS)

Kubelkova, L.; Novakova, J.

1976-01-01

Deammoniation and dehydroxylation of Na(NH 4 )X and Na(NH 4 )Y zeolites were compared. With the X type, both processes overlapped and proceeded more easily than with the Y type. Both H forms contained structural OH groups and hydroxyls denoted as SiOH, to which the 3740 cm -1 band in the IR spectrum was assigned. In addition, the NaHX zeolite contained OH groups characterized by the 3700 and 3600 cm -1 bands. Certain differences in the behaviour of NaHX and NaHY zeolites during deammoniation and dehydroxylation might be attributed to the presence of ''non-localizable'' H atoms. The active sites for the D 2 -OH exchange were probably formed during dehydroxylation. Hydrogen in SiOH groups was replaced by deuterium in both zeolite types more slowly than H atoms in other OH groups, which influenced the kinetic variations in the gaseous phase. The presence of water in the gaseous phase affected the kinetics and could distort the determination of the number of H atoms bound in the zeolites. (author)

Hybrid employment recommendation algorithm based on Spark

Science.gov (United States)

Li, Zuoquan; Lin, Yubei; Zhang, Xingming

2017-08-01

Aiming at the real-time application of collaborative filtering employment recommendation algorithm (CF), a clustering collaborative filtering recommendation algorithm (CCF) is developed, which applies hierarchical clustering to CF and narrows the query range of neighbour items. In addition, to solve the cold-start problem of content-based recommendation algorithm (CB), a content-based algorithm with users’ information (CBUI) is introduced for job recommendation. Furthermore, a hybrid recommendation algorithm (HRA) which combines CCF and CBUI algorithms is proposed, and implemented on Spark platform. The experimental results show that HRA can overcome the problems of cold start and data sparsity, and achieve good recommendation accuracy and scalability for employment recommendation.

Evaluation Of Algorithms Of Anti- HIV Antibody Tests

Directory of Open Access Journals (Sweden)

Paranjape R.S

1997-01-01

Full Text Available Research question: Can alternate algorithms be used in place of conventional algorithm for epidemiological studies of HIV infection with less expenses? Objective: To compare the results of HIV sero- prevalence as determined by test algorithms combining three kits with conventional test algorithm. Study design: Cross â€" sectional. Participants: 282 truck drivers. Statistical analysis: Sensitivity and specificity analysis and predictive values. Results: Three different algorithms that do not include Western Blot (WB were compared with the conventional algorithm, in a truck driver population with 5.6% prevalence of HIV â€"I infection. Algorithms with one EIA (Genetic Systems or Biotest and a rapid test (immunocomb or with two EIAs showed 100% positive predictive value in relation to the conventional algorithm. Using an algorithm with EIA as screening test and a rapid test as a confirmatory test was 50 to 70% less expensive than the conventional algorithm per positive scrum sample. These algorithms obviate the interpretation of indeterminate results and also give differential diagnosis of HIV-2 infection. Alternate algorithms are ideally suited for community based control programme in developing countries. Application of these algorithms in population with low prevalence should also be studied in order to evaluate universal applicability.

High resolution laser spectroscopy of the D lines of on-line produced 21Na, 22Na, 24Na, 25Na using a new high sensitivity method of detection of optical resonances

International Nuclear Information System (INIS)

Huber, G.; Thibault, G.; Klapisch, R.; Duong, H.T.; Vialle, J.L.; Pinard, I.; Juncar, P.; Jacquinot, P.

1975-01-01

A polyisotopic sodium beam of 21 - 25 Na, produced by spallation of Al, was illuminated by a tunable dye laser. The atomic beam, analyzed by a sixpole magnet is then ionized and detected after a mass spectrometer. The results are the isotope shifts, nuclear magnetic moment and quadrupole moment of 25 Na [fr

Categorizing Variations of Student-Implemented Sorting Algorithms

Science.gov (United States)

Taherkhani, Ahmad; Korhonen, Ari; Malmi, Lauri

2012-01-01

In this study, we examined freshmen students' sorting algorithm implementations in data structures and algorithms' course in two phases: at the beginning of the course before the students received any instruction on sorting algorithms, and after taking a lecture on sorting algorithms. The analysis revealed that many students have insufficient…

Decoding Hermitian Codes with Sudan's Algorithm

DEFF Research Database (Denmark)

Høholdt, Tom; Nielsen, Rasmus Refslund

1999-01-01

We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q-polynomial, and a reduct......We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q...

Decoding algorithm for vortex communications receiver

Science.gov (United States)

Kupferman, Judy; Arnon, Shlomi

2018-01-01

Vortex light beams can provide a tremendous alphabet for encoding information. We derive a symbol decoding algorithm for a direct detection matrix detector vortex beam receiver using Laguerre Gauss (LG) modes, and develop a mathematical model of symbol error rate (SER) for this receiver. We compare SER as a function of signal to noise ratio (SNR) for our algorithm and for the Pearson correlation algorithm. To our knowledge, this is the first comprehensive treatment of a decoding algorithm of a matrix detector for an LG receiver.