Готові списки джерел за темами / DNA computing experiment

Зміст

Статті в журналах
Дисертації
Книги
Частини книг
Тези доповідей конференцій

Добірка наукової літератури з теми "DNA computing experiment"

Автор: Grafiati

Опубліковано: 11 березня 2023

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями

Оберіть тип джерела:

Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "DNA computing experiment".

Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.

Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.

Статті в журналах з теми "DNA computing experiment"

Nakajima, T., Y. Sakai, and A. Suyama. "Experiment of DNA computing with robot." Seibutsu Butsuri 40, supplement (2000): S152. http://dx.doi.org/10.2142/biophys.40.s152_3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Stoschek, E., M. Sturm, and T. Hinze. "DNA-Computing – ein funktionales Modell im laborpraktischen Experiment." Informatik Forschung und Entwicklung 16, no. 1 (February 2001): 35–52. http://dx.doi.org/10.1007/pl00009141.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

YAMAMOTO, MASAHITO, YUMI KAWAZOE, AZUMA OHUCHI, ATSUSHI KAMEDA, NOBUO MATSUURA, and TOSHIKAZU SHIBA. "LOCAL SEARCH BY CONCENTRATION-CONTROLLED DNA COMPUTING." International Journal of Computational Intelligence and Applications 02, no. 04 (December 2002): 447–55. http://dx.doi.org/10.1142/s1469026802000750.

Повний текст джерела

Анотація:

Concentration-controlled DNA computing is presented for accomplishing a local search for the solution of a shortest path problem. In this method, the concentrations of DNA representing edges are determined according to the costs on edges, and then the hybridization process is performed. Since the concentrations of hopeless candidate solutions tend to be small after the hybridization process, a local search by concentration-controlled DNA computing is a promising approach. In order to discuss about the relationship between given costs on edges in the graph and concentrations of generated DNA paths, a simulation model of the hybridization process is used and the results of a laboratory experiment are shown.

Стилі APA, Harvard, Vancouver, ISO та ін.

Huang, You Rui, Jing Wang, and Xiao Min Tian. "DNA Addition Algorithm Based on Molecular Beacon." Advanced Materials Research 424-425 (January 2012): 1164–69. http://dx.doi.org/10.4028/www.scientific.net/amr.424-425.1164.

Повний текст джерела

Анотація:

A new DNA computing model to realize binary integer additions based on molecular beacon is described in this paper. The binary 0 and 1 are represented by two different fluorescent states of a molecular beacon since its two different structures. By designing sequences of molecular beacons skillfully, and using the relationship between each two corresponding bits and their result and carry bit of two operational numbers, the computing process to compute each two corresponding bits of the binary numbers is simulated in the test tube. Finally, the results can be read only by detecting whether the fluorescence in tube emits. The result of the experiment shows that the algorithm is simple and convenient, and the algorithm provides a new idea for DNA computing to realize arithmetic operations

Стилі APA, Harvard, Vancouver, ISO та ін.

Tian, Xiang, Xiyu Liu, Hongyan Zhang, Minghe Sun, and Yuzhen Zhao. "A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model." PLOS ONE 15, no. 12 (December 2, 2020): e0242083. http://dx.doi.org/10.1371/journal.pone.0242083.

Повний текст джерела

Анотація:

A DNA (DeoxyriboNucleic Acid) algorithm is proposed to solve the job shop scheduling problem. An encoding scheme for the problem is developed and DNA computing operations are proposed for the algorithm. After an initial solution is constructed, all possible solutions are generated. DNA computing operations are then used to find an optimal schedule. The DNA algorithm is proved to have an O(n2) complexity and the length of the final strand of the optimal schedule is within appropriate range. Experiment with 58 benchmark instances show that the proposed DNA algorithm outperforms other comparative heuristics.

Стилі APA, Harvard, Vancouver, ISO та ін.

Huang, Chun, Ying-Jie Han, Jun-Wei Sun, Wei-Jun Zhu, Yan-Feng Wang, and Qing-Lei Zhou. "The Design and Application of Exclusive OR Logical Computation Based on DNA 3-Arm Sub-Tile Self-Assembly." Journal of Nanoelectronics and Optoelectronics 15, no. 11 (November 1, 2020): 1327–34. http://dx.doi.org/10.1166/jno.2020.2853.

Повний текст джерела

Анотація:

DNA algorithmic self-assembly plays a vital role in DNA computing, which is applied to create new DNA tiles and then guides these tiles into an algorithmic lattice. However, the larger the logical calculation scale is, the more tile sets will be needed, so that computing model design and experiment will be increasingly difficult. This paper presents a new DNA ‘3-arm sub-tile strategy’ that constructs XOR and half-adder logical circuits. The types of DNA tile corresponding to the logical values is unified in DNA XOR and half-adder logical circuits, which have only three kinds of DNA tiles: logic ‘0’, logic ‘1’ and fixation tile. Compared with the previous references, the amount of DNA tile types has been greatly reduced. Moreover, the half-adder molecular circuit has a distinctive feature, which is an application of the expansion of the XOR logic circuit. Meanwhile, a set of DNA 3-arm sub-tiles suitable for half-adder logical computation is designed on the NUPACK online server. The simulated experiments show that the correct rate of base pairing of the designed DNA encoding is high and the structures are stable. The DNA 3-arm sub-tile self-assembly methods provide a new way to form DNA logical circuits, and has a great potential in the expansion of the integrated circuits.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ma, Jingjing. "Molecular Logic Gate Based on DNA Strand Displacement Reaction." Journal of Nanoelectronics and Optoelectronics 16, no. 6 (June 1, 2021): 974–77. http://dx.doi.org/10.1166/jno.2021.3037.

Повний текст джерела

Анотація:

In this paper, I construct an XOR logic gate based on DNA strand displacement reaction, and verify our design through corresponding biochemical experiment. I designed several different DNA strands. Based on two basic DNA strand displacement reaction mechanisms, by adding different input strands and taking the signal of FAM fluorescent group as the output, the XOR logic gate is realized. The result shows that DNA strand displacement technology has important application value in DNA computing, especially in the construction of DNA molecular logic gates.

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhou, Shihua, Bin Wang, Xuedong Zheng, and Changjun Zhou. "An Image Encryption Scheme Based on DNA Computing and Cellular Automata." Discrete Dynamics in Nature and Society 2016 (2016): 1–9. http://dx.doi.org/10.1155/2016/5408529.

Повний текст джерела

Анотація:

Networks have developed very quickly, allowing the speedy transfer of image information through Internet. However, the openness of these networks poses a serious threat to the security of image information. The field of image encryption has drawn attention for this reason. In this paper, the concepts of 1-dimensional DNA cellular automata and T-DNA cellular automata are defined, and the concept of reversible T-DNA cellular automata is introduced. An efficient approach to encryption involving reversible T-DNA cellular automata as an encryption tool and natural DNA sequences as the main keys is here proposed. The results of a simulation experiment, performance analysis, and comparison to other encryption algorithms showed this algorithm to be capable of resisting brute force attacks, statistical attacks, and differential attacks. It also enlarged the key space enormously. It meets the criteria for one-time pad and resolves the problem that one-time pad is difficult to save.

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhang, Xinxin, Nan Zhao, and Jing Yang. "Operation of Queue and Stack by DNA Tiles." E3S Web of Conferences 218 (2020): 03051. http://dx.doi.org/10.1051/e3sconf/202021803051.

Повний текст джерела

Анотація:

DNA is used as self-nanomaterials to assemble into specific structures. DNA tile provides a new idea for the application of DNA tile in the field of computing. Recent years, Queue and Stack are important linear data structures which are used in various software systems widely. The implementation of DNA based queue and stack has been studied continuously for many years. In the traditional DNA computing, queue and stack are mostly realized by DNA strands displacement, restriction endonuclease and ligase were used. However, as an active material, it has a high requirement for enzyme experimental conditions. The purpose of this paper is to implement queue and stack structures using non-enzyme systems. The rule of Queue is characterized by FIFO (first in first out), which allows for insertion at one end of the list and deletion at the other. The rule of Stack is characterized by FILO(first in last out), which allows for insertion and deletion at one end of the list. We are aimed to implement Queue and Stack using self-assembly and disassembly via DNA Tiles. No enzymes are needed for the whole experiment. As an enzyme-free system, it provides a new method to implement stack and queue.

Стилі APA, Harvard, Vancouver, ISO та ін.

Shan, Jing Yi, Zhi Xiang Yin, Xin Yu Tang, and Jing Jing Tang. "A DNA Computing Model for the AND Gate in Three-Valued Logical Circuit." Applied Mechanics and Materials 610 (August 2014): 764–68. http://dx.doi.org/10.4028/www.scientific.net/amm.610.764.

Повний текст джерела

Анотація:

Multiple-valued logic is an extended form of Boolean logic. In daily life, people often encounter the problem about the multiple-valued logic. With further study on Boolean logic, multiple-valued logic has been paid more and more attention by researchers. This paper achieves the operation of AND gate in three-valued logic by using the DNA hairpin structure. The experiment makes the DNA hairpin structure as the basic structure, and the molecular beacon as the input signal, and at last judges the logical results according to the intensity of fluorescence and gel electrophoresis. This method has the advantages that it has high sensitivity, good feasibility, and it is easy to observe. In addition, this method reduces the hybrid competition to a certain extent, and it is a new attempt to the research on multiple-valued logic.

Стилі APA, Harvard, Vancouver, ISO та ін.

Більше джерел

Дисертації з теми "DNA computing experiment"

Fiala, Jan. "DNA výpočty a jejich aplikace." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2014. http://www.nusl.cz/ntk/nusl-412902.

Повний текст джерела

Анотація:

This thesis focuses on the design and implementation of an application involving the principles of DNA computing simulation for solving some selected problems. DNA computing represents an unconventional computing paradigm that is totally different from the concept of electronic computers. The main idea of DNA computing is to interpret the DNA as a medium for performing computation. Despite the fact, that DNA reactions are slower than operations performed on computers, they may provide some promising features in the future. The DNA operations are based on two important aspects: massive parallelism and principle of complementarity. There are many important problems for which there is no algorithm that would be able to solve the problem in a polynomial time using conventional computers. Therefore, the solutions of such problems are searched by exploring the entire state space. In this case the massive parallelism of the DNA operations becomes very important in order to reduce the complexity of finding a solution.

Стилі APA, Harvard, Vancouver, ISO та ін.

Hinze, Thomas, and Monika Sturm. "A universal functional approach to DNA computing and its experimental practicability." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-100882.

Повний текст джерела

Анотація:

The rapid developments in the field of DNA computing reflects two substantial questions: 1. Which models for DNA based computation are really universal? 2. Which model fulfills the requirements to a universal lab-practicable programmable DNA computer that is based on one of these models? This paper introduces the functional model DNA-HASKELL focussing its lab-practicability. This aim could be reached by specifying the DNA based operations in accordiance to an analysis of molecular biological processes. The specification is determined by an abstraction level that includes nucleotides and strand end labels like 5'-phosphate. Our model is able to describe DNA algorithms for any NP-complete problem - here exemplified by the knapsacik problem - as well as it is able to simulate some established mathematical models for computation. We point out the splicing operation as an example. The computational completeness of DNA-HASKELL can be supposed. This paper is based on discussions about the potenzial and limits of DNA computing, in particular the practicability of a universal DNA computer.

Стилі APA, Harvard, Vancouver, ISO та ін.

Hinze, Thomas, and Monika Sturm. "A universal functional approach to DNA computing and its experimental practicability." Technische Universität Dresden, 2000. https://tud.qucosa.de/id/qucosa%3A26319.

Повний текст джерела

Анотація:

Стилі APA, Harvard, Vancouver, ISO та ін.

FRANCO, Giuditta. "Biomolecular Computing – Combinatorial Algorithms and Laboratory Experiments (Doctoral Thesis)." Doctoral thesis, 2006. http://hdl.handle.net/11562/477608.

Повний текст джерела

Анотація:

Questa tesi raccoglie i risultati della ricerca dell'autrice nell'ambito del calcolo molecolare, e li presenta in un ordine che rispetta quello cronologico in cui sono stati conseguiti. La tesi presenta sia modelli teorici di computazioni molecolari che nuovi algoritmi DNA, corrispondenti a procedure di una certa rilevanza biologica. In particolare, sono stati individuati specifici metodi di estrazione DNA, di ricombinazione DNA, e di mutagenesi. Segue una lista dei principali risultati conseguiti, per la maggior parte proposti nei sei capitoli centrali. Nel contesto dei modelli teorici, e soprattutto come frutto di collaborazioni internazionali, si sono trovati i) un modello a membrana per il reclutamento selettivo dei leucociti, ii) una macchina a registri DNA, e iii) un insieme di vincoli di tipo ``forbidding-enforcing'' su grafi, che descrivono processi di self-assembly. Nel contesto delle speculazioni combinatoriche e algoritmiche su nuovi metodi di manipolazione DNA, principalmente sviluppate a Verona, sono stati proposti due nuovi algoritmi basati su XPCR, di estrazione e mutagenesi DNA. Un lavoro principalmente autonomo ha portato invece a formulare un nuovo algoritmo di ricombinazione basato su XPCR e un algoritmo di estrazione basato su operazioni enzimatiche. Infine, sono stati condotti tre tipi di esperimenti di laboratorio per testare tutti gli algoritmi basati su XPCR. Un aspetto saliente della tesi puo' essere ricercato nel lavoro di interazione, filtraggio, e traduzione, tra il lato teorico e quello sperimentale della ricerca presentata. Sebbene non la si possa considerare ricerca informatica ``ortodossa'', si direbbe un lavoro prezioso dal punto di vista scientifico, senz'altro esaltante, in quanto mette in luce una natura sperimentale delle stringhe (biologiche, modellate da quelle formali) e degli algoritmi. Il capitolo 4, centrale nella tesi, e' un semplice esempio di come speculazioni del tutto teoriche, quali dei specifici risultati di combinatorica, possano essere da un lato motivati e ispirati da, ma dall'altro anche molto utili e significativi per, un esperimento di calcolo col DNA in un laboratorio di biologia molecolare.
The idea of unconventional computing has fired many imaginations, and many researchers regard it as a revolution in information processing. In this respect, several directions are addressed in the first chapter of this thesis. An overview about molecular computing is given, in terms of state of the art and main problems faced, and conclusive notes are proposed along with bibliographical references and curiosities provoked by a few questions. The middle chapters are essentially the core of the thesis. A variant of the Polymerase Chain Reaction, called XPCR, is introduced to implement null context splicing rules on DNA strings. This was experimentally tested in different situations, as implementation basis for algorithms of generation, extraction, and mutagenesis, and the laboratory experiments are reported in a chapter of experimental results. The simple technology of this approach is interesting in itself, and it has different applications in biological contexts, beyond the DNA computing problems that have motivated it. It takes the advantages and the efficiency of an enzymatic elongation technique, and, it proves convenient with respect to the standard methods in terms of speed and feasibility. XPCR-based algorithms turned out to be easy-to-implement methods supported by interesting mathematical facts. An analysis of the PCR process is presented as well, with a novel extraction method based on XPCR procedure. This was successfully tested by experiments, and its performance has been then improved, at least at a theoretical level by a biotechnology, where a variant avoiding formations of chimers was introduced, together with the XPCR based mutagenesis algorithm.

Стилі APA, Harvard, Vancouver, ISO та ін.

Книги з теми "DNA computing experiment"

Amos, Martyn. Theoretical and Experimental DNA Computation (Natural Computing Series). Springer, 2006.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Theoretical and Experimental DNA Computation (Natural Computing Series). Springer, 2005.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Modeling Doseresponse Microarray Data In Early Drug Development Experiments Using R. Springer, 2012.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Lin, Dan, Ziv Shkedy, and Daniel Yekutieli. Modeling Dose-Response Microarray Data in Early Drug Development Experiments Using R: Order-Restricted Analysis of Microarray Data. Springer, 2012.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Modeling Dose-Response Microarray Data in Early Drug Development Experiments Using R: Order-Restricted Analysis of Microarray Data. Springer London, Limited, 2012.

Знайти повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hilgurt, S. Ya, and O. A. Chemerys. Reconfigurable signature-based information security tools of computer systems. PH “Akademperiodyka”, 2022. http://dx.doi.org/10.15407/akademperiodyka.458.297.

Повний текст джерела

Анотація:

The book is devoted to the research and development of methods for combining computational structures for reconfigurable signature-based information protection tools for computer systems and networks in order to increase their efficiency. Network security tools based, among others, on such AI-based approaches as deep neural networking, despite the great progress shown in recent years, still suffer from nonzero recognition error probability. Even a low probability of such an error in a critical infrastructure can be disastrous. Therefore, signature-based recognition methods with their theoretically exact matching feature are still relevant when creating information security systems such as network intrusion detection systems, antivirus, anti-spam, and wormcontainment systems. The real time multi-pattern string matching task has been a major performance bottleneck in such systems. To speed up the recognition process, developers use a reconfigurable hardware platform based on FPGA devices. Such platform provides almost software flexibility and near-ASIC performance. The most important component of a signature-based information security system in terms of efficiency is the recognition module, in which the multipattern matching task is directly solved. It must not only check each byte of input data at speeds of tens and hundreds of gigabits/sec against hundreds of thousand or even millions patterns of signature database, but also change its structure every time a new signature appears or the operating conditions of the protected system change. As a result of the analysis of numerous examples of the development of reconfigurable information security systems, three most promising approaches to the construction of hardware circuits of recognition modules were identified, namely, content-addressable memory based on digital comparators, Bloom filter and Aho–Corasick finite automata. A method for fast quantification of components of recognition module and the entire system was proposed. The method makes it possible to exclude resource-intensive procedures for synthesizing digital circuits on FPGAs when building complex reconfigurable information security systems and their components. To improve the efficiency of the systems under study, structural-level combinational methods are proposed, which allow combining into single recognition device several matching schemes built on different approaches and their modifications, in such a way that their advantages are enhanced and disadvantages are eliminated. In order to achieve the maximum efficiency of combining methods, optimization methods are used. The methods of: parallel combining, sequential cascading and vertical junction have been formulated and investigated. The principle of multi-level combining of combining methods is also considered and researched. Algorithms for the implementation of the proposed combining methods have been developed. Software has been created that allows to conduct experiments with the developed methods and tools. Quantitative estimates are obtained for increasing the efficiency of constructing recognition modules as a result of using combination methods. The issue of optimization of reconfigurable devices presented in hardware description languages is considered. A modification of the method of affine transformations, which allows parallelizing such cycles that cannot be optimized by other methods, was presented. In order to facilitate the practical application of the developed methods and tools, a web service using high-performance computer technologies of grid and cloud computing was considered. The proposed methods to increase efficiency of matching procedure can also be used to solve important problems in other fields of science as data mining, analysis of DNA molecules, etc. Keywords: information security, signature, multi-pattern matching, FPGA, structural combining, efficiency, optimization, hardware description language.

Стилі APA, Harvard, Vancouver, ISO та ін.

Частини книг з теми "DNA computing experiment"

Yamamoto, Masahito, Yutaka Kita, Satoshi Kashiwamura, Atsushi Kameda, and Azuma Ohuchi. "Development of DNA Relational Database and Data Manipulation Experiments." In DNA Computing, 418–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11925903_33.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Rose, John A., Ken Komiya, Satsuki Yaegashi, and Masami Hagiya. "Displacement Whiplash PCR: Optimized Architecture and Experimental Validation." In DNA Computing, 393–403. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11925903_31.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Komiya, Ken, Masayuki Yamamura, and John A. Rose. "Experimental Validation of Signal Dependent Operation in Whiplash PCR." In DNA Computing, 1–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03076-5_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Khodor, Yevgenia, Julia Khodor, and Thomas F. Knight. "Experimental Confirmation of the Basic Principles of Length-only Discrimination." In DNA Computing, 223–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-48017-x_21.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Kuramochi, Junna, and Yasubumi Sakakibara. "Intensive In Vitro Experiments of Implementing and Executing Finite Automata in Test Tube." In DNA Computing, 193–202. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11753681_15.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Reif, John H., Thomas H. LaBean, Michael Pirrung, Vipul S. Rana, Bo Guo, Carl Kingsford, and Gene S. Wickham. "Experimental Construction of Very Large Scale DNA Databases with Associative Search Capability." In DNA Computing, 231–47. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-48017-x_22.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Pogozelski, Wendy K., Matthew P. Bernard, Salvatore F. Priore, and Anthony J. Macula. "Experimental Validation of DNA Sequences for DNA Computing: Use of a SYBR Green I Assay." In DNA Computing, 248–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11753681_20.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Hinze, Thomas, Uwe Hatnik, and Monika Sturm. "An Object Oriented Simulation of Real Occurring Molecular Biological Processes for DNA Computing and Its Experimental Verification." In DNA Computing, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-48017-x_1.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Komiya, Ken, Satsuki Yaegashi, Masami Hagiya, Akira Suyama, and John A. Rose. "Experimental Validation of the Statistical Thermodynamic Model for Prediction of the Behavior of Autonomous Molecular Computers Based on DNA Hairpin Formation." In DNA Computing, 428–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11925903_34.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Trajdos, Pawel, Adam Kamizelich, and Marek Kurzynski. "Three-Step Framework of Feature Selection for Data of DNA Microarray Experiments." In Advances in Intelligent Systems and Computing, 409–20. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-06593-9_36.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Тези доповідей конференцій з теми "DNA computing experiment"

Todoran, Eneia Nicolae, and Nikolaos Papaspyrou. "Experiments with continuation semantics for DNA computing." In 2013 IEEE International Conference on Intelligent Computer Communication and Processing (ICCP). IEEE, 2013. http://dx.doi.org/10.1109/iccp.2013.6646117.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Romaniuk, Ryszard S. "Biomedical, Artificial Intelligence, and DNA Computing Photonics Applications and Web Engineering, Wilga, May 2012." In Photonics Applications in Astronomy, Communications, Industry, and High-Energy Physics Experiments 2012, edited by Ryszard S. Romaniuk. SPIE, 2012. http://dx.doi.org/10.1117/12.2005979.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Cunha, Hugo Gustavo Valin Oliveira da, Rodrigo Moreira, and Flávio de Oliveira Silva. "Uma Arquitetura para Gerenciamento e Pesquisa Experimental de Funções Virtualizadas para Computação em Borda." In Workshop de Pesquisa Experimental da Internet do Futuro. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/wpeif.2021.17199.

Повний текст джерела

Анотація:

Edge Computing foi proposto para resolver problemas como gerenciamento de largura de banda, dispersão geográfica, permitindo o processamento de dados próximo aos usuários finais. O objetivo de Network Functions Virtualization (NFV) é simplificar o ﬂuxo de trabalho para criação de serviços computacionais. Este trabalho avança o estado da arte ao propor uma arquitetura gerenciamento unificado de Virtualized Everything Functions (VxFs) em Edge Computing. Essa arquitetura é capaz de implantar e monitorar continuamente VxFs, independentemente do hardware e a plataforma virtualização. A arquitetura proposta contribui para a realização dos mais diversos cenários de pesquisa experimental na borda, contribuindo para avançar o conhecimento nesta área.

Стилі APA, Harvard, Vancouver, ISO та ін.

Zhang, Ao, Ming Dai, Maosong Cheng, and Jingen Chen. "Molten Salt Reactor Experiment Simulation Using ThorMOC." In 2022 29th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/icone29-90510.

Повний текст джерела

Анотація:

Abstract High fidelity modeling and simulation of nuclear reactors with direct whole core transport calculation has become an important state of art for development of reactor computational tools with the rapidly improvement of computing power. In this work, a quasi-2D delayed neutron precursor (DNP) drift model has been implemented in a GPU-based whole core transport code ThorMOC to achieve high fidelity modeling and simulation of liquid-fueled molten salt reactors (MSRs). A rasterized coarse mesh finite difference (RCMFD) method is applied in ThorMOC to improve the convergence rate, and to handle complex MSR models with arbitrary boundaries by combining with long characteristics method. OpenMC is used to generate a multi-group cross section library and to provide reference results for stationary state calculations. The results including eigenvalue and power distributions from ThorMOC agree well with those from OpenMC for stationary state calculations of the Molten Salt Reactor Experiment (MSRE) model. The reactivity loss due to DNP drift is computed and is in a good agreement with the measured value in experiment.

Стилі APA, Harvard, Vancouver, ISO та ін.

Ibrahim, Zuwairie, Mohd Muhammad, Yusei Tsuboi, Osamu Ono, and Marzuki Khalid. "Experimental Comparison of Initial Pool Generation for Direct-Proportional Length-Based DNA Computing." In TENCON 2005 - 2005 IEEE Region 10 Conference. IEEE, 2005. http://dx.doi.org/10.1109/tencon.2005.301238.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Liang, Bin, Hongcheng Li, Miaoqiang Su, Pan Bian, Xirong Li, and Wenchang Shi. "Deep Text Classification Can be Fooled." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/585.

Повний текст джерела

Анотація:

In this paper, we present an effective method to craft text adversarial samples, revealing one important yet underestimated fact that DNN-based text classifiers are also prone to adversarial sample attack. Specifically, confronted with different adversarial scenarios, the text items that are important for classification are identified by computing the cost gradients of the input (white-box attack) or generating a series of occluded test samples (black-box attack). Based on these items, we design three perturbation strategies, namely insertion, modification, and removal, to generate adversarial samples. The experiment results show that the adversarial samples generated by our method can successfully fool both state-of-the-art character-level and word-level DNN-based text classifiers. The adversarial samples can be perturbed to any desirable classes without compromising their utilities. At the same time, the introduced perturbation is difficult to be perceived.

Стилі APA, Harvard, Vancouver, ISO та ін.

Conti, Carlo, Umberto Morbiducci, Matteo Nobili, Giuseppe Passoni, Costantino Del Gaudio, Antonio Balducci, Mauro Grigioni, and Alberto Redaelli. "Evaluation of the Dynamics of a Bileaflet Heart Valve: Physical and Numerical Experiments." In ASME 2007 Summer Bioengineering Conference. American Society of Mechanical Engineers, 2007. http://dx.doi.org/10.1115/sbc2007-176315.

Повний текст джерела

Анотація:

Clinical reports indicate that mechanical heart valves are still unable to eliminate problems mainly related to a non physiological fluid dynamics like thrombosis and coagulation complications [1]. Advanced experimental technique such as laser doppler anemometry (LDA) and particle image velocimetry (PIV), used to investigate the fluid dynamics of these devices, suffer from some intrinsic limitations (eg. access difficulties, light reflection, low resolution) [2]. In parallel with the increased performance at computing, the use of computational fluid dynamics has gained relevance as a powerful tool able to provide meaningful information of clinical and design aspects [3]. Key parameters in the assessment of blood damage potency (velocity patterns and turbulence, among them) are related to the behaviour of the valve in the flow field. The application of fluid structure interaction (FSI) models moves in the direction of greater accuracy in the reproduction of realistic flow condition in order to reach more in-depth insight into the hemodynamic of the virtual prototypes. The aim of this study is the investigation, in silico, of the bileaflet mechanical valve dynamics during the whole systolic phase. A 3D direct numerical simulation (DNS) was performed and an implicit fluid structure interaction model was used [4,5]. The results of the dynamics of the valve were validated with an experimental counterpart.

Стилі APA, Harvard, Vancouver, ISO та ін.

Huillca, Jose Luis, and Leandro A. F. Fernandes. "Computing Vessel Velocity from Single Perspective Projection Images." In Anais Estendidos da Conference on Graphics, Patterns and Images. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/sibgrapi.est.2021.20017.

Повний текст джерела

Анотація:

The Master’s Thesis presented an image-based approach to estimate the speed of moving vessels from their traces on the water surface. Vessels moving at constant heading and speed display a familiar V-shaped pattern which only differs from one to another by the wavelength of their transverse and divergent components. Such wavelength is related to vessel speed. We use planar homography and natural constraints on the geometry of ships’ wake troughs to compute vessel speed from single optical images acquired by conventional cameras. Experiments show that our approach produces compelling results, which are in accordance with true data available for the observed vessels.

Стилі APA, Harvard, Vancouver, ISO та ін.

da Silva, Giovanni R., Daniel F. Macedo, and Aldri L. dos Santos. "Zero Trust Access Control with Context-Aware and Behavior-Based Continuous Authentication for Smart Homes." In Simpósio Brasileiro de Segurança da Informação e de Sistemas Computacionais. Sociedade Brasileira de Computação - SBC, 2021. http://dx.doi.org/10.5753/sbseg.2021.17305.

Повний текст джерела

Анотація:

Generally, approaches to build the security of Smart Home Systems (SHS) require big amount of data to implement Access Control and Intrusion Detection Systems, with storage in cloud, for instance, being a vulnerability to inhabitants privacy. Besides, most works rely on cloud computing or resources in the cloud to perform security tasks, what can be exploited by attackers. This work presents the ZASH (Zero-Aware Smart Home System), an Access Control for SHS. ZASH uses Continuous Authentication with Zero Trust, supported by real-time context and activity information, enabled by Edge Computing and Markov Chain, to prevent and mitigate impersonation attacks that aim to invade inhabitants privacy. An experimental evaluation demonstrated the system capability to dynamically adapt to new inhabitants behaviors withal blocking impersonation attacks.

Стилі APA, Harvard, Vancouver, ISO та ін.

Повний текст джерела

Анотація:

Стилі APA, Harvard, Vancouver, ISO та ін.

Ми пропонуємо знижки на всі преміум-плани для авторів, чиї праці увійшли до тематичних добірок літератури. Зв'яжіться з нами, щоб отримати унікальний промокод!