Relevant bibliographies by topics / Von Neumann, Algoritmo de

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Von Neumann, Algoritmo de'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 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 'Von Neumann, Algoritmo de.'

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 "Von Neumann, Algoritmo de"

1

Urquhart, Alasdair. "Von Neumann, Gödel and Complexity Theory." Bulletin of Symbolic Logic 16, no. 4 (December 2010): 516–30. http://dx.doi.org/10.2178/bsl/1294171130.

Full text
Abstract:
AbstractAround 1989, a striking letter written in March 1956 from Kurt Gödel to John von Neumann came to light. It poses some problems about the complexity of algorithms; in particular, it asks a question that can be seen as the first formulation of the P = ? NP question. This paper discusses some of the background to this letter, including von Neumann's own ideas on complexity theory. Von Neumann had already raised explicit questions about the complexity of Tarski's decision procedure for elementary algebra and geometry in a letter of 1949 to J. C. C. McKinsey. The paper concludes with a discussion of why theoretical computer science did not emerge as a separate discipline until the 1960s.
APA, Harvard, Vancouver, ISO, and other styles
2

Braga, Henrique Costa, Gray Farias Moita, and Paulo Eduardo Maciel de Almeida. "Comparação entre os Algoritmos de Busca pela Vizinhança de Von Neumann ou de Moore para Geração do Mapa de Distâncias em um Ambiente Construído." Abakós 4, no. 2 (May 19, 2016): 20. http://dx.doi.org/10.5752/p.2316-9451.2016v4n2p20.

Full text
Abstract:
Existem vários algoritmos de busca na literatura, mas os poucos dedicados a simulações de grandes edificações geralmente carecem de maior detalhamento, e também de uma análise quantitativa dos erros gerados pela sua utilização na obtenção dos mapas de distância. Assim, este trabalho apresenta o passo-a-passo de um algoritmo de busca <em>pathfinder</em> especificamente apropriado para simulações em ambientes construídos, considerando duas variações do mesmo em função da vizinhança pesquisada: Von Neumann ou Moore. As duas variações do algoritmo apresentado foram computacionalmente implementadas e diversos experimentos realizados de modo a se conhecer melhor várias de suas características como o mapa de distâncias gerado e os erros inerentes. Verificou-se que o algoritmo aqui apresentado possui diversas características importantes como simplicidade lógica, funcionamento automático, independência tanto do tamanho, quanto do leiaute interno ou externo da edificação a ser pesquisada, e baixo custo computacional para uma aplicação não dinâmica. Entretanto, a variação considerando a vizinhança de Moore forneceu os melhores resultados pelo menor erro na determinação das distâncias (erro médio de + 5.8% e pontual máximo de + 7.9% nos exemplos estudados).
APA, Harvard, Vancouver, ISO, and other styles
3

Haney, Matthew M. "Generalization of von Neumann analysis for a model of two discrete half-spaces: The acoustic case." GEOPHYSICS 72, no. 5 (September 2007): SM35—SM46. http://dx.doi.org/10.1190/1.2750639.

Full text
Abstract:
Evaluating the performance of finite-difference algorithms typically uses a technique known as von Neumann analysis. For a given algorithm, application of the technique yields both a dispersion relation valid for the discrete time-space grid and a mathematical condition for stability. In practice, a major shortcoming of conventional von Neumann analysis is that it can be applied only to an idealized numerical model — that of an infinite, homogeneous whole space. Experience has shown that numerical instabilities often arise in finite-difference simulations of wave propagation at interfaces with strong material contrasts. These interface instabilities occur even though the conventional von Neumann stability criterion may be satisfied at each point of the numerical model. To address this issue, I generalize von Neumann analysis for a model of two half-spaces. I perform the analysis for the case of acoustic wave propagation using a standard staggered-grid finite-difference numerical scheme. By deriving expressions for the discrete reflection and transmission coefficients, I study under what conditions the discrete reflection and transmission coefficients become unbounded. I find that instabilities encountered in numerical modeling near interfaces with strong material contrasts are linked to these cases and develop a modified stability criterion that takes into account the resulting instabilities. I test and verify the stability criterion by executing a finite-difference algorithm under conditions predicted to be stable and unstable.
APA, Harvard, Vancouver, ISO, and other styles
4

Wu, Xiu Mei, Tao Zi Si, and Lei Jiang. "Stable Computer Control Algorithm of Von Neumann Model." Advanced Materials Research 634-638 (January 2013): 4026–29. http://dx.doi.org/10.4028/www.scientific.net/amr.634-638.4026.

Full text
Abstract:
The problem of computer control algorithm for the singular Von Neumann input-output model is researched. A kind of new mathematic method is applied to study the singular systems without converting them into general systems. A kind of stability condition under which the singular input-output model is admissible is proved with the form of linear matrix inequality. Based on this, a new state feedback stability criterion is established. Then the formula of a desired state feedback controller is derived.
APA, Harvard, Vancouver, ISO, and other styles
5

Franchetti, C., and S. M. Holland. "Two extensions of the alternating algorithm of von Neumann." Annali di Matematica Pura ed Applicata 139, no. 1 (December 1985): i. http://dx.doi.org/10.1007/bf01766864.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Franchetti, C., and W. Light. "On the von Neumann alternating algorithm in Hilbert space." Journal of Mathematical Analysis and Applications 114, no. 2 (March 1986): 305–14. http://dx.doi.org/10.1016/0022-247x(86)90085-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gonçalves, João P. M., Robert H. Storer, and Jacek Gondzio. "A family of linear programming algorithms based on an algorithm by von Neumann." Optimization Methods and Software 24, no. 3 (June 2009): 461–78. http://dx.doi.org/10.1080/10556780902797236.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, J., and N. Ansari. "Enhanced Birkhoff–von Neumann decomposition algorithm for input queued switches." IEE Proceedings - Communications 148, no. 6 (2001): 339. http://dx.doi.org/10.1049/ip-com:20010618.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Devroye, Luc, and Claude Gravel. "The expected bit complexity of the von Neumann rejection algorithm." Statistics and Computing 27, no. 3 (March 26, 2016): 699–710. http://dx.doi.org/10.1007/s11222-016-9648-z.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

LOU, YIJUN, FANGYUE CHEN, and JUNBIAO GUAN. "FINGERPRINT FEATURE EXTRACTION VIA CNN WITH VON NEUMANN NEIGHBORHOOD." International Journal of Bifurcation and Chaos 17, no. 11 (November 2007): 4145–51. http://dx.doi.org/10.1142/s0218127407019676.

Full text
Abstract:
In this paper, we study fingerprint feature extraction via CNN with Von Neumann neighborhood. The extraction was implemented by using CNN with nine input variables, and we find that the process could also be implemented with only five variables, and an easier algorithm without compromising the effectiveness. According to the CNN model with five input variables and the corresponding CNN gene bank done by Chen et al. [2006, Http1], we can determine the CNN gene easily. Simultaneously, we also find some results in one of the references are incorrect.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Von Neumann, Algoritmo de"

1

Silva, Jair da. "Uma familia de algoritmos para programação linear baseada no algoritmo de Von Neumann." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/306741.

Full text
Abstract:
Orientador: Aurelio R. Leite Oliveira, Marta Ines Velazco
Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica
Made available in DSpace on 2018-08-13T08:57:24Z (GMT). No. of bitstreams: 1 Silva_Jairda1_D.pdf: 1755258 bytes, checksum: 2ecb493aab3646838f54c2df2012b5d9 (MD5) Previous issue date: 2009
Resumo: Neste trabalho apresentamos uma nova família de algoritmos para resolver problemas de programação linear. A vantagem desta família de algoritmos é a sua simplicidade, a possibilidade de explorar a esparsidade dos dados do problema original e geralmente possuir raio de convergência inicial rápido. Esta família de algoritmos surgiu da generalização da idéia apresentada por João Gonçalves, Robert Storer e Jacek Gondzio, para desenvolver o algoritmo de ajustamento pelo par ótimo. Este algoritmo foi desenvolvido por sua vez tendo como base o algoritmo de Von Neumann. O algoritmo de Von Neumann possui propriedades interessantes, como simplicidade e convergência inicial rápida, porém, ele não é muito prático para resolver problemas lineares, visto que sua convergência é muito lenta. Do ponto de vista computacional, nossa proposta não é utilizar a família de algoritmos para resolver os problemas de programação linear até encontrar uma solução e sim explorar a sua simplicidade e seu raio de convergência inicial geralmente rápido e usá-la em conjunto com um método primal-dual de pontos interiores infactível, para melhorar a eficiência deste. Experimentos numéricos revelam que ao usar esta família de algoritmos em conjunto com um método primal-dual de pontos interiores infactível melhoramos o seu desempenho na solução de algumas classes de problemas de programação linear de grande porte.
Abstract: In this work, we present a new family of algorithms to solve linear programming problems. The advantage of this family of algorithms relies in its simplicity, the possibility of exploiting the sparsity of the original problem data and usually to have fast initial ratio of convergence. This family of algorithms arose from the generalization of the idea presented by João Gonçalves, Robert Storer and Jacek Gondzio to develop the optimal pair adjustment algorithm. This algorithm was developed in its own turn based on the Von Neumann's algorithm. It has interesting properties, such as simplicity and fast initial convergence, but it is not very practical for solving linear problems, since its convergence is very slow. From the computational point of view, our suggestion is not to use the family of algorithms to solve problems of linear programming until optimality, but to exploit its simplicity and its fast initial ratio of convergence and use it together with a infeasible primal-dual interior point method to improve its efficiency. Numerical experiments show that using this family of algorithms with an infeasible primal-dual interior point method improves its performance in the solution of some classes of large-scale linear programming problems.
Doutorado
Doutor em Matemática Aplicada
APA, Harvard, Vancouver, ISO, and other styles
2

Karasenko, Vitali [Verfasser], and Johannes [Akademischer Betreuer] Schemmel. "Von Neumann bottlenecks in non-von Neumann computing architectures / Vitali Karasenko ; Betreuer: Johannes Schemmel." Heidelberg : Universitätsbibliothek Heidelberg, 2020. http://d-nb.info/1215187505/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bulfone, Lorenzo. "Von Neumann: non solo architetto." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2014. http://amslaurea.unibo.it/7909/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Garcia, João Nilton. "Álgebras de von Neumann - fatores." reponame:Repositório Institucional da UFSC, 2011. http://repositorio.ufsc.br/xmlui/handle/123456789/95659.

Full text
Abstract:
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro de Ciências Físicas e Matemáticas, Programa de Pós-Graduação em Matemática e Computação Científica, Florianópolis, 2011
Made available in DSpace on 2012-10-26T04:34:42Z (GMT). No. of bitstreams: 1 288163.pdf: 615320 bytes, checksum: d391efa36179aa1a4f050342d8209628 (MD5)
Dada uma álgebra de von Neumann M em L(H), onde L(H) é o espaço dos operadores lineares e limitados sobre um espaço de Hilbert H, dizemos que M é um fator se seu centro consiste somente por múltiplos escalares do operador identidade de L(H). Quando M é um fator, podemos classificá-lo em tipo I, II e III. Além disso, o tipo II pode ser dividido em dois sub-tipos. O objetivo dessa dissertação é exibir exemplos de fatores, bem como exemplos dos tipos I, II e seus sub-tipos.
APA, Harvard, Vancouver, ISO, and other styles
5

Rochon, Céline. "Correspondences of von Neumann algebras." Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/10323.

Full text
Abstract:
In the early 1980's, Alain Connes introduced a morphism between von Neumann algebras in order to define a property formerly defined only for groups and extending Kazhdan's property T. This morphism is called a correspondence. Let ${\cal M}$ and ${\cal N}$ be von Neumann algebras. A correspondence from ${\cal M}$ to ${\cal N}$ is a Hilbert space ${\cal H}$ which is an ${\cal N} - {\cal M}$ bimodule. Equivalently, a correspondence from ${\cal M}$ to ${\cal N}$ is a unital $\sp*$-representation of the algebraic tensor product ${\cal N} \odot\ {\cal M}\sp{o}$ which is normal when restricted to ${\cal N} \odot$ 1 and 1 $\odot\ {\cal M}\sp{o}$. In this thesis, we show that a correspondence is indeed a morphism between von Neumann algebras and we show its link to two other morphisms between von Neumann algebras: normal involutive algebra homomorphisms and completely positive normal linear maps. To achieve this objective, we study some important examples of von Neumann algebras and the Tomita-Takesaki theory.
APA, Harvard, Vancouver, ISO, and other styles
6

Iannucci, Robert A. "A dataflow/von Neumann hybrid architecture." Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/14778.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Mattox, Wade. "Homology of Group Von Neumann Algebras." Diss., Virginia Tech, 2012. http://hdl.handle.net/10919/28397.

Full text
Abstract:
In this paper the following conjecture is studied: the group von Neumann algebra N(G) is a flat CG-module if and only if the group G is locally virtually cyclic. This paper proves that if G is locally virtually cyclic, then N(G) is flat as a CG-module. The converse is proved for the class of all elementary amenable groups without infinite locally finite subgroups. Foundational cases for which the conjecture is shown to be true are the groups G=Z, G=ZxZ, G=Z*Z, Baumslag-Solitar groups, and some infinitely-presented variations of Baumslag-Solitar groups. Modules other than N(G), such as L^p-spaces and group C*-algebras, are considered as well. The primary tool that is used to achieve many of these results is group homology.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
8

Lalgudi, Subramanian N. "Transient simulation of power-supply noise in irregular on-chip power distribution networks using latency insertion method, and causal transient simulation of interconnects characterized by band-limited data and terminated by arbitrary terminations." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/22561.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Azamov, Nurulla, and azam0001@infoeng flinders edu au. "Spectral shift function in von Neumann algebras." Flinders University. Informatics and Engineering, 2008. http://catalogue.flinders.edu.au./local/adt/public/adt-SFU20080129.121422.

Full text
Abstract:
The main subsect of this thesis is the theory of Lifshits-Krein spectral shift function in semifinite von Neumann algebras and its connection with the theory of spectral flow. Main results are an analogue of the Krein trace formula for semifinite von Neumann algebras, the semifinite analogue of the Birman-Solomyak spectral averaging formula, a connection between the spectral shift function and the spectral flow and a Lidskii type formula for Dixmier traces. In particular, it is established that in the case of operators with compact resolvent, the spectral shift function and the spectral flow are identical notions.
APA, Harvard, Vancouver, ISO, and other styles
10

Skripka, Anna. "Trace formulae in finite von Neumann algebras." Diss., Columbia, Mo. : University of Missouri-Columbia, 2007. http://hdl.handle.net/10355/4740.

Full text
Abstract:
Thesis (Ph. D.)--University of Missouri-Columbia, 2007.
The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on October 9, 2007) Vita. Includes bibliographical references.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Von Neumann, Algoritmo de"

1

John von Neumann. New York: Pantheon Books, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Macrae, Norman. John von Neumann. Basel: Birkhäuser Basel, 1994. http://dx.doi.org/10.1007/978-3-0348-6064-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Goodearl, K. R. Von Neumann regular rings. 2nd ed. Malabar, Fla: Krieger Pub. Co., 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Neumann, John Von. John von Neumann selected letters. Edited by Rédei Miklós. Providence, R.I: American Mathematical Society, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Alfred, Neumann. Ulbrichts Favorit: Auskünfte von Alfred Neumann. Berlin: Edition Ost, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sinclair, Allan M. Hochschild cohomology of von Neumann algebras. Cambridge: Cambridge University Press, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Siegfried, Prokop, Wolff Friedrich 1922-, and Most Edgar, eds. Ulbrichts Favorit: Auskünfte von Alfred Neumann. Berlin: Edition Ost, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Neumann, Max. Max Neumann: Bilder von 1981-1985. [Berlin]: Overbeck-Gesellschaft, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

R, Smith Roger, ed. Finite von Neumann algebras and masas. New York: Cambridge University Press, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

József, Móczár. Reducible Von Neumann models and uniqueness. Ibaraki, Osaka, Japan: Institute of Social and Economic Research, Osaka University, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Von Neumann, Algoritmo de"

1

Soheili, Negar, and Javier Peña. "A Primal–Dual Smooth Perceptron–von Neumann Algorithm." In Discrete Geometry and Optimization, 303–20. Heidelberg: Springer International Publishing, 2013. http://dx.doi.org/10.1007/978-3-319-00200-2_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Rossier, Joël, Enrico Petraglio, André Stauffer, and Gianluca Tempesti. "Tom Thumb Algorithm and von Neumann Universal Constructor." In Lecture Notes in Computer Science, 1–10. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30479-1_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Harvey, Inman. "The Microbial Genetic Algorithm." In Advances in Artificial Life. Darwin Meets von Neumann, 126–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21314-4_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Moeslinger, Christoph, Thomas Schmickl, and Karl Crailsheim. "A Minimalist Flocking Algorithm for Swarm Robots." In Advances in Artificial Life. Darwin Meets von Neumann, 375–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21314-4_47.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Özdemir, Burak, and Hürevren Kılıç. "A Local Behavior Identification Algorithm for Generative Network Automata Configurations." In Advances in Artificial Life. Darwin Meets von Neumann, 191–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21314-4_24.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Speroni di Fenizio, Pietro, and Chris Anderson. "Using Pareto Front for a Consensus Building, Human Based, Genetic Algorithm." In Advances in Artificial Life. Darwin Meets von Neumann, 175–82. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21314-4_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tonelli, Paul, Jean-Baptiste Mouret, and Stéphane Doncieux. "Influence of Promoter Length on Network Convergence in GRN-Based Evolutionary Algorithms." In Advances in Artificial Life. Darwin Meets von Neumann, 302–9. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21314-4_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Dan, and Tamás Terlaky. "The Duality Between the Perceptron Algorithm and the von Neumann Algorithm." In Modeling and Optimization: Theory and Applications, 113–36. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-8987-0_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Prieto, Abraham, Francisco Bellas, Pilar Caamaño, and Richard J. Duro. "Solving a Heterogeneous Fleet Vehicle Routing Problem with Time Windows through the Asynchronous Situated Coevolution Algorithm." In Advances in Artificial Life. Darwin Meets von Neumann, 200–207. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-21314-4_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sabelfeld, Karl. "Stochastic Algorithms in Linear Algebra - beyond the Markov Chains and von Neumann - Ulam Scheme." In Numerical Methods and Applications, 14–28. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-18466-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Von Neumann, Algoritmo de"

1

Zhu, Jing, Yong Zhang, and Pu Sun. "An Improved Biology Migration Algorithm with Von Neumann Structure." In 2020 39th Chinese Control Conference (CCC). IEEE, 2020. http://dx.doi.org/10.23919/ccc50068.2020.9189416.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Huang, Yong, and Dan Qin. "Von Neumann structure-based particle swarm optimization algorithm in resource leveling." In 2013 International Conference of Information Science and Management Engineering. Southampton, UK: WIT Press, 2013. http://dx.doi.org/10.2495/isme132733.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Peng, Cheng, Gregor Bochmann, and Trevor Hall. "Quick Birkhoff-von Neumann Decomposition Algorithm for Agile All-Photonic Network Cores." In 2006 IEEE International Conference on Communications. IEEE, 2006. http://dx.doi.org/10.1109/icc.2006.255170.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rocha, Felipe, and Pedro Paulo Balbi. "Exploração do Espaço de Regras Conservativas Binárias com Vizinhança de Moore." In Seminário Integrado de Software e Hardware. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/semish.2020.11333.

Full text
Abstract:
Este estudo visa analisar o espaço de regras conservativas de autômatos celulares bidimensionais binários com vizinhança de Moore. A abordagem utilizada foi valer-se de alguns conceitos já descritos em vizinhança de von Neumann e do espaço elementar dos autômatos celulares unidimensionais e empregando-os no espaço proposto pelo tema, realizando as adaptações necessárias, com o objetivo de verificar se a conceituação elucidada pela literatura aplica-se, observando-se os resultados obtidos e validando o nível de aderência que se tem com o espaço de regras proposto pelo tema. Foi implementado um algoritmo verificador de regras conservativas de autômatos celulares bidimensionais com vizinhança de Moore de tamanho arbitrário e executado para regras 2x2 e 3x3, além do uso de noções de equivalência dinâmica e composição de regras para revelar regras e comportamentos ainda não descritos. Como resultados, evidenciou-se a existência de 313 regras conservativas, contudo somente 32 delas são dinamicamente diferentes entre si. Por fim, são discutidos os resultados e é feita uma análise acerca do dinamismo das regras obtidas.
APA, Harvard, Vancouver, ISO, and other styles
5

Feng, Xiaochun, Yang Chen, Jian Zhang, Heejin Cho, and Xin Shi. "Rubik’s Cube Topology Based Particle Swarm Algorithm for Bilevel Building Energy Transaction." In ASME 2021 15th International Conference on Energy Sustainability collocated with the ASME 2021 Heat Transfer Summer Conference. American Society of Mechanical Engineers, 2021. http://dx.doi.org/10.1115/es2021-62982.

Full text
Abstract:
Abstract Following the rapid growth of distributed energy resources (e.g. renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as, reducing power loss, stabilizing the main power grid, etc. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. In addition, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush-Kuhn-Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubiks Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubiks Cube topology based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology based PSO and its scalability on larger scale applications.
APA, Harvard, Vancouver, ISO, and other styles
6

Cuciumita, Cleopatra Florentina, Tudor Cuciuc, and Ionut Porumbel. "Evaluation of the Cycle Averaged Performances of a Pulsed Detonation Engine Based on Thermodynamic Cycle Computations." In ASME Turbo Expo 2016: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2016. http://dx.doi.org/10.1115/gt2016-57310.

Full text
Abstract:
The paper presents a numerical algorithm for the theoretical calculation of the thermodynamic cycle of a pulsed detonation based engine, based on the Zeldovich – von Neumann – Doring detonation model, together with the algorithm employed to perform them, and a numerical application. The results are compared to numerical data obtained for the Chapman – Jouguet detonation thermodynamic parameters using the NASA – Glenn Chemical Equilibrium Program CEA2. As a reference, the thermodynamic cycle of a Brayton engine operating under the same conditions of compressor pressure ratio and fuel mass flow rate is computed and included in the paper. It is found that the CEA2 detonation model predicts a very low engine thermodynamic efficiency, while the ZND model yields a higher efficiency of the detonation based engine with respect to the Brayton cycle engine. The specific work of the detonation engine is higher than the Brayton engine, but the power remains lower.
APA, Harvard, Vancouver, ISO, and other styles
7

Araujo, Rodolfo, Igor Machado Coelho, and Leandro Marzulo. "Estratégias de exploração de vizinhança com GPU para problemas de otimização." In XX Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/wscad_estendido.2019.8712.

Full text
Abstract:
Problemas de otimização são de grande importância para diversos setores da indústria, desde o planejamento de produção até escoamento e transporte de produtos. Diversos problemas de interesse se enquadram na classe NP-Difícil, sendo desconhecidos algoritmos para resolvê-los de forma exata em tempo polinomial. Assim, estratégias heurísticas com capacidade de escapar de ótimos locais de baixa qualidade (meta-heurísticas) são geralmente empregadas. A busca local é, em geral, a etapa mais custosa, em termos de tempo computacional, do processo de uma meta-heurística. Desta forma torna-se muito importante fazer bom uso dos recursos nela utilizados. Esta dissertação estuda o emprego de múltiplas estratégias de vizinhança utilizadas paralelamente para explorar um espaço de vizinhança maior e com melhor aproveitamento dos recursos computacionais. O processamento paralelo das estratégias de vizinhança é implementado em nível de grão fino, através de processamento em GPU, e grão grosso, por meio de processamento multi core e processamento em rede, sendo os dois níveis combinados num ambiente heterogêneo, para arquiteturas von Neumann e Dataflow.
APA, Harvard, Vancouver, ISO, and other styles
8

Liao, Jun, Renwei Mei, and James F. Klausner. "A Study on Numerical Instability of Inviscid Two-Fluid Model Near Ill-Posedness Condition." In ASME 2005 Summer Heat Transfer Conference collocated with the ASME 2005 Pacific Rim Technical Conference and Exhibition on Integration and Packaging of MEMS, NEMS, and Electronic Systems. ASMEDC, 2005. http://dx.doi.org/10.1115/ht2005-72652.

Full text
Abstract:
The two-fluid model is widely used in studying gas-liquid flow inside pipelines because it can qualitatively predict the flow field at low computational cost. However, the two-fluid model becomes ill-posed when the slip velocity exceeds a critical value, and computations can be quite unstable before flow reaches the unstable condition. In this study computational stability of various convection schemes for the two-fluid model is analyzed. A pressure correction algorithm for inviscid flow is carefully implemented to minimize its effect on numerical stability. Von Neumann stability analysis for the wave growth rates by using the 1st order upwind, 2nd order upwind, QUICK, and the central difference schemes shows that the central difference scheme is more accurate and more stable than the other schemes. The 2nd order upwind scheme is much more susceptible to instability at long waves than the 1st order upwind and inaccurate for short waves. The instability associated with ill-posedness of the two-fluid model is significantly different from the instability of the discretized two-fluid model. Excellent agreement is obtained between the computed and predicted wave growth rates. The connection between the ill-posedness of the two-fluid model and the numerical stability of the algorithm used to implement the inviscid two-fluid model is elucidated.
APA, Harvard, Vancouver, ISO, and other styles
9

IOANA, ADRIAN. "RIGIDITY FOR VON NEUMANN ALGEBRAS." In International Congress of Mathematicians 2018. WORLD SCIENTIFIC, 2019. http://dx.doi.org/10.1142/9789813272880_0111.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Richards, Ryan S., Mikola Lysenko, Roshan M. D’Souza, and Gary An. "Data-Parallel Techniques for Agent-Based Tissue Modeling on Graphics Processing Units." In ASME 2008 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2008. http://dx.doi.org/10.1115/detc2008-49661.

Full text
Abstract:
Agent-Based Modeling has been recently recognized as a method for in-silico multi-scale modeling of biological cell systems. Agent-Based Models (ABMs) allow results from experimental studies of individual cell behaviors to be scaled into the macro-behavior of interacting cells in complex cell systems or tissues. Current generation ABM simulation toolkits are designed to work on serial von-Neumann architectures, which have poor scalability. The best systems can barely handle tens of thousands of agents in real-time. Considering that there are models for which mega-scale populations have significantly different emergent behaviors than smaller population sizes, it is important to have the ability to model such large scale models in real-time. In this paper we present a new framework for simulating ABMs on programmable graphics processing units (GPUs). Novel algorithms and data-structures have been developed for agent-state representation, agent motion, and replication. As a test case, we have implemented an abstracted version of the Systematic Inflammatory Response System (SIRS) ABM. Compared to the original implementation on the NetLogo system, our implementation can handle an agent population that is over three orders of magnitude larger with close to 40 updates/sec. We believe that our system is the only one of its kind that is capable of efficiently handling realistic problem sizes in biological simulations.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Von Neumann, Algoritmo de"

1

Iannucci, Robert A. A Dataflow/Von Neumann Hybrid Architecture. Fort Belvoir, VA: Defense Technical Information Center, July 1988. http://dx.doi.org/10.21236/ada200987.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lightfoot, Chris, Doug Sakal, Tim Busse, Jerry Shelton, and Ralph Duncan. Software Techniques for Non-Von Neumann Architectures. Fort Belvoir, VA: Defense Technical Information Center, January 1990. http://dx.doi.org/10.21236/ada220390.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ramamoorthy, C. V. Fault-Tolerant Secure System Evaluation for Non-Von Neumann Architecture. Fort Belvoir, VA: Defense Technical Information Center, August 1989. http://dx.doi.org/10.21236/ada211849.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Okandan, Murat. 2015 Neuro-Inspired Computational Elements (NICE) Workshop: Information Processing and Computation Systems beyond von Neumann/Turing Architecture and Moore’s Law Limits (Summary Report). Office of Scientific and Technical Information (OSTI), March 2015. http://dx.doi.org/10.2172/1177593.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Grubbs, Daniel. Summary Report from 2015 Neuro-Inspired Computational Elements (NICE) Workshop, February 23-25, 2015. Information Processing and Computation Systems beyond von Neumann/Turing Architecture and Moore’s Law Limits. Office of Scientific and Technical Information (OSTI), December 2015. http://dx.doi.org/10.2172/1470994.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Von Neumann, Algoritmo de' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography