Log in

Relevant bibliographies by topics / Simon's algorithm

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Simon's algorithm'

Author: Grafiati

Published: 4 June 2021

Last updated: 18 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Simon's algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Simon's algorithm"

1

Hao, Xuexuan, Fengrong Zhang, Yongzhuang Wei, and Yong Zhou. "Quantum period finding based on the Bernstein-Vazirani algorithm." Quantum Information and Computation 20, no. 1&2 (2020): 65–84. http://dx.doi.org/10.26421/qic20.1-2-4.

Full text

Abstract:

Quantum period finding algorithms have been used to analyze symmetric cryptography. For instance, the 3-round Feistel construction and the Even-Mansour construction could be broken in polynomial time by using quantum period finding algorithms. In this paper, we firstly provide a new algorithm for finding the nonzero period of a vectorial function with O(n) quantum queries, which uses the Bernstein-Vazirani algorithm as one step of the subroutine. Afterwards, we compare our algorithm with Simon's algorithm. In some scenarios, such as the Even-Mansour construction and the function satisfying Sim

APA, Harvard, Vancouver, ISO, and other styles

2

Hancart, Christophe. "On Simon's string searching algorithm." Information Processing Letters 47, no. 2 (1993): 95–99. http://dx.doi.org/10.1016/0020-0190(93)90231-w.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bub, J. "Quantum computaton from a quantum logical perspective." Quantum Information and Computation 7, no. 4 (2007): 281–96. http://dx.doi.org/10.26421/qic7.4-1.

Full text

Abstract:

It is well-known that Shor's factorization algorithm, Simon's period-finding algorithm, and Deutsch's original XOR algorithm can all be formulated as solutions to a hidden subgroup problem. Here the salient features of the information-processing in the three algorithms are presented from a different perspective, in terms of the way in which the algorithms exploit the non-Boolean quantum logic represented by the projective geometry of Hilbert space. From this quantum logical perspective, the XOR algorithm appears directly as a special case of Simon's algorithm, and all three algorithms can be s

APA, Harvard, Vancouver, ISO, and other styles

4

Kenigsberg, D., A. Mor, and G. Ratsaby. "Quantum advantage without entanglement." Quantum Information and Computation 6, no. 7 (2006): 606–15. http://dx.doi.org/10.26421/qic6.7-4.

Full text

Abstract:

We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the \emph{maximal} subproblem that can be solved without entanglement, and show that the algorithm still has an advantage over the classical ones. We further show that this subproblem is of greater significance, by proving that it contains all the Boolean functions whose quantum phase-oracle is non-entangling. For Simon's and Grover's algorithms we provide simple proofs that no non-trivial subproblems can be solved by these algorithms without enta

APA, Harvard, Vancouver, ISO, and other styles

5

Santoli, Thomas, and Christian Schaffner. "Using Simon's algorithm to attack symmetric-key cryptographic primitives." Quantum Information and Computation 17, no. 1&2 (2017): 65–78. http://dx.doi.org/10.26421/qic17.1-2-4.

Full text

Abstract:

We present new connections between quantum information and the field of classical cryptography. In particular, we provide examples where Simon’s algorithm can be used to show insecurity of commonly used cryptographic symmetric-key primitives. Specifically, these examples consist of a quantum distinguisher for the 3-round Feistel network and a forgery attack on CBC-MAC which forges a tag for a chosen-prefix message querying only other messages (of the same length). We assume that an adversary has quantum-oracle access to the respective classical primitives. Similar results have been achieved re

APA, Harvard, Vancouver, ISO, and other styles

6

LI, HONGWEI, and LI YANG. "A quantum algorithm to approximate the linear structures of Boolean functions." Mathematical Structures in Computer Science 28, no. 1 (2016): 1–13. http://dx.doi.org/10.1017/s0960129516000013.

Full text

Abstract:

A quantum algorithm to determine approximations of linear structures of Boolean functions is presented and analysed. Similar results have already been published (see Simon's algorithm) but only for some promise versions of the problem, and it has been shown that no exponential quantum speedup can be obtained for the general (no promise) version of the problem. In this paper, no additional promise assumptions are made. The approach presented is based on the method used in the Bernstein–Vazirani algorithm to identify linear Boolean functions and on ideas from Simon's period finding algorithm. A

APA, Harvard, Vancouver, ISO, and other styles

7

FISCHER, KURT, HANS-GEORG MATUTTIS, NOBUYASU ITO, and MASAMICHI ISHIKAWA. "QUANTUM-STATISTICAL SIMULATIONS FOR QUANTUM CIRCUITS." International Journal of Modern Physics C 13, no. 07 (2002): 931–45. http://dx.doi.org/10.1142/s012918310200367x.

Full text

Abstract:

Using a Hubbard–Stratonovich like decomposition technique, we implemented simulations for the quantum circuits of Simon's algorithm for the detection of the periodicity of a function and Shor's algorithm for the factoring of prime numbers on a classical computer. Our approach has the advantage that the dimension of the problem does not grow exponentially with the number of qubits.

APA, Harvard, Vancouver, ISO, and other styles

8

MATUTTIS, HANS-GEORG, KURT FISCHER, NOBUYASU ITO, and MASAMICHI ISHIKAWA. "AUXILIARY FIELD METHODS FOR THE SIMULATION OF QUANTUM COMPUTATION CIRCUITS." International Journal of Modern Physics C 13, no. 07 (2002): 917–29. http://dx.doi.org/10.1142/s0129183102003681.

Full text

Abstract:

One obstacle in the simulation of quantum circuits is the high dimension of the Hilbert space. Using auxiliary field decompositions known from many-particle simulation, we can transform the mathematical description of the quantum circuit into a combination low-dimensional product states which can be sampled using Monte Carlo techniques. We demonstrate the method using Simon's algorithm for the detection of the period of a function.

APA, Harvard, Vancouver, ISO, and other styles

9

Van den Nest, Maarten. "Simulating quantum computers with probabilistic methods." Quantum Information and Computation 11, no. 9&10 (2011): 784–812. http://dx.doi.org/10.26421/qic11.9-10-5.

Full text

Abstract:

We investigate the boundary between classical and quantum computational power. This work consists of two parts. First we develop new classical simulation algorithms that are centered on sampling methods. Using these techniques we generate new classes of classically simulatable quantum circuits where standard techniques relying on the exact computation of measurement probabilities fail to provide efficient simulations. For example, we show how various concatenations of matchgate, Toffoli, Clifford, bounded-depth, Fourier transform and other circuits are classically simulatable. We also prove th

APA, Harvard, Vancouver, ISO, and other styles

10

Mihai Dorian, Stancu, and Popa Emil Marin. "Developing A Quantum Circuit Simulator API." ACTA Universitatis Cibiniensis 67, no. 1 (2015): 168–73. http://dx.doi.org/10.1515/aucts-2015-0084.

Full text

Abstract:

Abstract In this paper we propose the design and implementation of a quantum circuit simulator API. Currently the API allows users to implement, debug and test the following two quantum algorithms: Bernstein-Vazirani’s algorithm and Simon’s Algorithm. The goal is to create a framework that will allow quantum computer scientists to easily develop new quantum algorithms.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Simon's algorithm"

1

Nyman, Peter. "Representation of Quantum Algorithms with Symbolic Language and Simulation on Classical Computer." Licentiate thesis, Växjö University, School of Mathematics and Systems Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:vxu:diva-2329.

Full text

Abstract:

<p>Utvecklandet av kvantdatorn är ett ytterst lovande projekt som kombinerar teoretisk och experimental kvantfysik, matematik, teori om kvantinformation och datalogi. Under första steget i utvecklandet av kvantdatorn låg huvudintresset på att skapa några algoritmer med framtida tillämpningar, klargöra grundläggande frågor och utveckla en experimentell teknologi för en leksakskvantdator som verkar på några kvantbitar. Då dominerade förväntningarna om snabba framsteg bland kvantforskare. Men det verkar som om dessa stora förväntningar inte har besannats helt. Många grundläggande och tekniska pro

APA, Harvard, Vancouver, ISO, and other styles

2

Colledan, Andrea. "On the Hidden Subgroup Problem as a Pivot in Quantum Complexity Theory." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2018. http://amslaurea.unibo.it/16112/.

Full text

Abstract:

Quantum computing has opened the way to new algorithms that can efficiently solve problems that have always been deemed intractable. However, since quantum algorithms are hard to design, the necessity to find a generalization of these problems arises. Such necessity is satisfied by the hidden subgroup problem (HSP), an abstract problem of group theory which successfully generalizes a large number of intractable problems. The HSP plays a significant role in quantum complexity theory, as efficient algorithms that solve it can be employed to efficiently solve other valuable problems, such as inte

APA, Harvard, Vancouver, ISO, and other styles

3

Nyman, Peter. "On relations between classical and quantum theories of information and probability." Doctoral thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-13830.

Full text

Abstract:

In this thesis we study quantum-like representation and simulation of quantum algorithms by using classical computers.The quantum--like representation algorithm (QLRA) was introduced by A. Khrennikov (1997) to solve the ``inverse Born's rule problem'', i.e. to construct a representation of probabilistic data-- measured in any context of science-- and represent this data by a complex or more general probability amplitude which matches a generalization of Born's rule.The outcome from QLRA matches the formula of total probability with an additional trigonometric, hyperbolic or hyper-trigonometri

APA, Harvard, Vancouver, ISO, and other styles

4

Keicher, Simon [Verfasser], and Jürgen [Akademischer Betreuer] Hausen. "Algorithms for Mori Dream Spaces / Simon Keicher ; Betreuer: Jürgen Hausen." Tübingen : Universitätsbibliothek Tübingen, 2014. http://d-nb.info/1162971371/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Guther, Kai-Simon [Verfasser], and Ali [Akademischer Betreuer] Alavi. "A real-time algorithm for FCIQMC / Kai-Simon Guther ; Betreuer: Ali Alavi." Stuttgart : Universitätsbibliothek der Universität Stuttgart, 2020. http://d-nb.info/1220289477/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Hampe, Simon [Verfasser], and Andreas [Akademischer Betreuer] Gathmann. "Algorithmic aspects of tropical intersection theory / Simon Hampe. Betreuer: Andreas Gathmann." Kaiserslautern : Technische Universität Kaiserslautern, 2014. http://d-nb.info/1053326181/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Pettersson, Kristoffer. "Metodutveckling för generering av prioriteringsordning för förnyelse av vatten- och avloppsledningar : En kombination av TOPSIS algoritm och Simos metod med implementering i Open Source GIS." Thesis, Karlstads universitet, Fakulteten för hälsa, natur- och teknikvetenskap (from 2013), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-72789.

Full text

Abstract:

I Sverige är underhåll och förnyelse av vatten- och avloppsledningsnätet i huvudsak ett kommunalt ansvar. Då ledningarna försämras över tid är förnyelseplaneringen en av de viktigaste frågorna för den framtida VA-försörjningen. I dagsläget är underhållsarbetet mycket eftersatt trots att det läggs stora summor pengar på förnyelse av ledningsnäten. Detta beror till stor del på att effektiva metoder saknas för prioritering av ledningar utifrån förnyelsebehov. I denna studie presenteras en metod baserad på multikriterieanalys och geografiska informationssystem (GIS) för att skapa en prioriteringso

APA, Harvard, Vancouver, ISO, and other styles

8

Lutter, Matthias [Verfasser], Rüdiger [Akademischer Betreuer] Reischuk, and Hans [Gutachter] Simon. "Algorithmic learning of DNF formulas, finite automata, and distributions / Matthias Lutter ; Gutachter: Hans Simon ; Akademischer Betreuer: Rüdiger Reischuk." Lübeck : Zentrale Hochschulbibliothek Lübeck, 2020. http://d-nb.info/120909066X/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Steinberg, Simon Johannes [Verfasser], Rudibert [Akademischer Betreuer] King, Rudibert [Gutachter] King, and Dave R. [Gutachter] Williams. "Learning control algorithms for an unsteady stator vane flow field / Simon Johannes Steinberg ; Gutachter: Rudibert King, Dave R. Williams ; Betreuer: Rudibert King." Berlin : Technische Universität Berlin, 2018. http://d-nb.info/1156274222/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Herkenrath, Simon Dominik [Verfasser], Winfried J. [Gutachter] Randerath, and Alexander [Gutachter] Mathes. "Erweiterte Evaluation der Effektivität eines proaktiven forcierten Oszillationstechnik-basierten Auto-CPAP-Algorithmus / Simon Dominik Herkenrath ; Gutachter: Winfried J. Randerath, Alexander Mathes." Köln : Deutsche Zentralbibliothek für Medizin, 2020. http://d-nb.info/1219515973/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Simon's algorithm"

1

Schäfer, Andreas, and David Meiering, eds. (Ent-)Politisierung? Nomos Verlagsgesellschaft mbH & Co. KG, 2020. http://dx.doi.org/10.5771/9783748904076.

Full text

Abstract:

Contradictory trends of depoliticisation and (re-)politicisation seem to characterise current democratic society. Protest movements and populism polarise opinions on both the streets and social media, while anonymous algorithms or scientific expertise threaten to technocratise political decision-making. At the same time, these phenomena raise the question of democratic theoretical standards of evaluation. This special volume provides a conceptual framework for the analysis and interpretation of these processes and relates previously unconnected fields of research. Theoretical perspectives and

APA, Harvard, Vancouver, ISO, and other styles

2

Ravetto-Biagioli, Kriss. Digital Uncanny. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780190853990.001.0001.

Full text

Abstract:

We are confronted with a new type of uncanny experience, an uncanny evoked by parallel processing, aggregate data, and cloud-computing. The digital uncanny does not erase the uncanny feeling we experience as déjà vu or when confronted with robots that are too lifelike. Today’s uncanny refers to how nonhuman devices (surveillance technologies, algorithms, feedback, and data flows) anticipate human gestures, emotions, actions, and interactions, intimating we are machines and our behavior is predicable because we are machinic. It adds another dimension to those feelings we get when we question wh

APA, Harvard, Vancouver, ISO, and other styles

3

Fink, Robert, Melinda Latour, and Zachary Wallmark, eds. The Relentless Pursuit of Tone. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780199985227.001.0001.

Full text

Abstract:

The Relentless Pursuit of Tone: Timbre in Popular Music assembles a wide spectrum of contemporary perspectives on how sound functions in an equally wide array of popular music. With subjects ranging from the twang of country banjos and the sheen of hip-hop strings to the crunch of amplified guitars and the thump of subwoofers on the dance floor, this volume attempts to bridge the gap between timbre, the purely acoustic characteristics of sound waves, and tone, an emergent musical construct that straddles the borderline between the perceptual and the political. The book’s chapters engage with t

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Simon's algorithm"

1

SAPV, Tharrmashastha, Debajyoti Bera, Arpita Maitra, and Subhamoy Maitra. "Simon’s Algorithm and Autocorrelation Spectrum." In Quantum Algorithms for Cryptographically Significant Boolean Functions. Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-3061-3_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Mihara, Takashi, and Shao Chin Sung. "A Quantum Polynomial Time Algorithm in Worst Case for Simon’s Problem." In Algorithms and Computation. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-49381-6_25.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bonnetain, Xavier, Akinori Hosoyamada, María Naya-Plasencia, Yu Sasaki, and André Schrottenloher. "Quantum Attacks Without Superposition Queries: The Offline Simon’s Algorithm." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34578-5_20.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Alexander, Gorbunov, Sergey Gushanskiy, and Viktor Potapov. "Development of a Method for Modeling Entangled Quantum Computations Applicable in the Simon’s Quantum Algorithm." In Intelligent Algorithms in Software Engineering. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-51965-0_44.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Velupillai, Kumaraswamy Vela. "Heuristics 1 versus algorithms." In Models of Simon. Routledge, 2017. http://dx.doi.org/10.4324/9780203462447-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Alassaf, Norah, and Adnan Gutub. "Simulating Light-Weight-Cryptography Implementation for IoT Healthcare Data Security Applications." In Research Anthology on Blockchain Technology in Business, Healthcare, Education, and Government. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-5351-0.ch081.

Full text

Abstract:

Short period monitoring and emergency notification of healthcare signals is becoming affordable with existence of internet of things (IoT) support. However, IoT does not prevent challenges that may hinder the appropriate safe spread of medical solutions. Confidentiality of data is vital, making a real fear requesting cryptography. The limitations in memory, computations processing, power consumptions, and small-size devices contradict the robust encryption process asking for help of low-weight-cryptography to handle practically. This article presents a comparative analysis of performance evaluation of three trusted candidate encryption algorithms, namely AES, SPECK and SIMON, which are simulated and compared in details to distinguish who has the best behaviour to be nominated for a medical application. These encryption algorithms are implemented and evaluated in regard to the execution time, power consumption, memory occupation and speed. The implementation is carried out using the Cooja simulator running on Contiki operating system showing interesting attractive results.

APA, Harvard, Vancouver, ISO, and other styles

7

Dash, Sujata, and Bichitrananda Patra. "Feature Selection Algorithms for Classification and Clustering in Bioinformatics." In Global Trends in Intelligent Computing Research and Development. IGI Global, 2014. http://dx.doi.org/10.4018/978-1-4666-4936-1.ch005.

Full text

Abstract:

This chapter discusses some important issues such as pre-processing of gene expression data, curse of dimensionality, feature extraction/selection, and measuring or estimating classifier performance. Although these concepts are relatively well understood among the technical people such as statisticians, electrical engineers, and computer scientists, they are relatively new to biologists and bioinformaticians. As such, it was observed that there are still some misconceptions about the use of classification methods. For instance, in most classifier design strategies, the gene or feature selection is an integral part of the classifier, and as such, it must be a part of the cross-validation process that is used to estimate the classifier prediction performance. Simon (2003) discussed several studies that appeared in prestigious journals where this important issue is overlooked, and optimistically biased prediction performances were reported. Furthermore, the authors have also discuss important properties such as generalizability or sensitivity to overtraining, built-in feature selection, ability to report prediction strength, and transparency of different approaches to provide a quick and concise reference. The classifier design and clustering methods are relatively well established; however, the complexity of the problems rooted in the microarray technology hinders the applicability of the classification methods as diagnostic and prognostic predictors or class-discovery tools in medicine.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Simon's algorithm"

1

Sihare, Shyam, and V. V. Nath. "Multiple Entities Search through Simon's Quantum Algorithm." In 2017 IEEE 7th International Advance Computing Conference (IACC). IEEE, 2017. http://dx.doi.org/10.1109/iacc.2017.0162.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Feizi, Soheil, Arash Ahmadi, and Ali Nemati. "A hardware implementation of Simon cryptography algorithm." In 2014 4th International eConference on Computer and Knowledge Engineering (ICCKE). IEEE, 2014. http://dx.doi.org/10.1109/iccke.2014.6993386.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Alkamil, Arkan, and Darshika G. Perera. "Efficient FPGA-Based Reconfigurable Accelerators for SIMON Cryptographic Algorithm on Embedded Platforms." In 2019 International Conference on ReConFigurable Computing and FPGAs (ReConFig). IEEE, 2019. http://dx.doi.org/10.1109/reconfig48160.2019.8994803.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Vora, Mehul, Wingyan Chung, Cagri Toraman, and Yifan Huang. "SimON-Feedback: An Iterative Algorithm for Performance Tuning in Online Social Simulation." In 2019 IEEE International Conference on Intelligence and Security Informatics (ISI). IEEE, 2019. http://dx.doi.org/10.1109/isi.2019.8823438.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Carberry, Josiah. "The importance of good examples." In Crossref LIVE18. Crossref, 2018. http://dx.doi.org/10.32013/aubagie.

Full text

Abstract:

The implications of ambimorphic archetypes have been far-reaching and pervasive. After years of natural research into consistent hashing, we argue the simulation of public-private key pairs, which embodies the confirmed principles of theory. Such a hypothesis might seem perverse but is derived from known results. Our focus in this paper is not on whether the well-known knowledge-based algorithm for the emulation of checksums by Herbert Simon runs in θ( n ) time, but rather on exploring a semantic tool for harnessing telephony.

APA, Harvard, Vancouver, ISO, and other styles

6

Carberry, Josiah. "The importance of good examples." In Crossref LIVE18. Crossref, 2018. http://dx.doi.org/10.32013/aubxxagie.

Full text

Abstract:

The implications of ambimorphic archetypes have been far-reaching and pervasive. After years of natural research into consistent hashing, we argue the simulation of public-private key pairs, which embodies the confirmed principles of theory. Such a hypothesis might seem perverse but is derived from known results. Our focus in this paper is not on whether the well-known knowledge-based algorithm for the emulation of checksums by Herbert Simon runs in θ( n ) time, but rather on exploring a semantic tool for harnessing telephony.

APA, Harvard, Vancouver, ISO, and other styles

7

Roehl, C., and H. Simon. "Adaptive Unstructured Grids for Simulating Transsonic Flows in Turbomachinery." In ASME 1999 International Gas Turbine and Aeroengine Congress and Exhibition. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/99-gt-213.

Full text

Abstract:

A method for simulations of the two-dimensional compressible flow in aerodynamically highly loaded turbomachinery on unstructured adaptive grids is presented in this paper. The discretization of the conservative laws in space is executed by the finite volume method. For high efficiency an implicit solution procedure is used. The flux vector of the inviscid flow is calculated by a modified difference splitting method described by Reichert and Simon (1994). To predict the turbulent flow an explicit algebraic stress model in conjunction with k and ε equations is used (Lenke and Simon, 1997). Both

APA, Harvard, Vancouver, ISO, and other styles

8

González-Acuña, R., P. Pieretti, and F. Malpica. "Solar Collector Exergetic Optimization for a Multi Effect Humidification Desalination Prototype." In ASME 2012 6th International Conference on Energy Sustainability collocated with the ASME 2012 10th International Conference on Fuel Cell Science, Engineering and Technology. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/es2012-91117.

Full text

Abstract:

Venezuela is a country with a great deal of water sources, as a consequence of its location in the Amazon Basin. In spite of this, about 1.6 million inhabitants are dispersed in remote regions throughout the nation, where water distribution is problematic due to the lack of this resource. Since 2007, The Institute of Energy of the Simon Bolivar University has been focused on the development of a 25 liters per day single stage solar Multi-effect Humidification (MEH) desalination plant using a flat plate solar collector. Once the construction of the prototype plant was completed, the characteriz

APA, Harvard, Vancouver, ISO, and other styles

9

Gonza´lez, R., P. Pieretti, and H. Diaz. "Design Algorithm of a Multi-Effect Humidification–Dehumidification Solar Distillation System." In ASME 2009 International Mechanical Engineering Congress and Exposition. ASMEDC, 2009. http://dx.doi.org/10.1115/imece2009-13051.

Full text

Abstract:

Water is an abundant resource; however, there is an upcoming water shortage. In order to face this situation, conventional desalination plants have been built; nevertheless, these plants contribute to the emission of greenhouse gases. A way to stop this trend is to use renewable sources, especially in coastal areas where solar irradiation is abundant. Due to the large coastal line of Venezuela, and the particular troubles with water distribution in these areas, the Energy Institute of the Simon Bolivar University proposed to develop and test a solar humidification–dehumidification (MEH) distil

APA, Harvard, Vancouver, ISO, and other styles

10

Villedieu, Philippe, and Olivier Simonin. "Kinetic Modeling and Monte-Carlo Simulations of Droplet Coalescence in a Turbulent Gas Flow." In ASME 2002 Joint U.S.-European Fluids Engineering Division Conference. ASMEDC, 2002. http://dx.doi.org/10.1115/fedsm2002-31385.

Full text

Abstract:

Two-phase gas-droplet flows are involved in a lot of industrial applications, especially in the combustion field (Diesel engine, turbomachinery, rocket engine,…). Among all the characteristics of the spray, the droplet size distribution generally has a major influence on the global performances of the system and must be accurately taken into account in a numerical simulation code. This is a difficult task because the carrier gas flow is very often turbulent. Hence, droplets located in the vicinity of the same point may have different velocities and coalesce, leading at the end to a strong modi

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!