Littérature scientifique sur le sujet « Fractal computing »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Fractal computing ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Fractal computing"
Semenov, A. S. « Fractal feedback control for Elastic computing based on the Container–Component model ». Journal of Physics : Conference Series 2308, no 1 (1 juillet 2022) : 012009. http://dx.doi.org/10.1088/1742-6596/2308/1/012009.
Texte intégralZhao, Yongwei, Yunji Chen et Zhiwei Xu. « Fractal Parallel Computing ». Intelligent Computing 2022 (5 septembre 2022) : 1–10. http://dx.doi.org/10.34133/2022/9797623.
Texte intégralNaylor, Michael. « Exploring Fractals in the Classroom ». Mathematics Teacher 92, no 4 (avril 1999) : 360–66. http://dx.doi.org/10.5951/mt.92.4.0360.
Texte intégralJahanmiri, Fatemeh, et Dawn Cassandra Parker. « An Overview of Fractal Geometry Applied to Urban Planning ». Land 11, no 4 (25 mars 2022) : 475. http://dx.doi.org/10.3390/land11040475.
Texte intégralLIU, SHUAI. « EDITORIAL ». Fractals 25, no 04 (25 juillet 2017) : 1702001. http://dx.doi.org/10.1142/s0218348x17020017.
Texte intégralCraus, Mitică, Vlad-Sergiu Bîrlescu et Maricel Agop. « Fractal Aspects in Classical Parallel Computing ». Computers 5, no 3 (12 septembre 2016) : 19. http://dx.doi.org/10.3390/computers5030019.
Texte intégralSUGINO, Toshiki, Taisuke KOBAYASHI et Kenji SUGIMOTO. « Continuous Learning using Fractal Reservoir Computing ». Proceedings of JSME annual Conference on Robotics and Mechatronics (Robomec) 2018 (2018) : 1A1—D13. http://dx.doi.org/10.1299/jsmermd.2018.1a1-d13.
Texte intégralLiu, Si Ping. « Research on Cloud Computing Strategy Based on Security Model ». Applied Mechanics and Materials 644-650 (septembre 2014) : 1835–39. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.1835.
Texte intégralLevin, I. I., et M. D. Chekina. « THE PARALLEL-PIPELINED IMPLEMENTATION OF THE FRACTAL IMAGE COMPRESSION FOR RECONFIGURABLE COMPUTING SYSTEMS ». Vestnik komp'iuternykh i informatsionnykh tekhnologii, no 202 (avril 2021) : 37–44. http://dx.doi.org/10.14489/vkit.2021.04.pp.037-044.
Texte intégralPRASAD, SRIJANANI ANURAG, et G. P. KAPOOR. « FRACTAL DIMENSION OF COALESCENCE HIDDEN-VARIABLE FRACTAL INTERPOLATION SURFACE ». Fractals 19, no 02 (juin 2011) : 195–201. http://dx.doi.org/10.1142/s0218348x11005336.
Texte intégralThèses sur le sujet "Fractal computing"
CAMPOS, CLAUDENIZE FRANCISCA JAPIASSU. « AN ALGORITHM FOR COMPUTING IMAGE FRACTAL DIMENSION ». PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1996. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=19751@1.
Texte intégralCONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
Neste trabalho, é apresentado um algoritmo eficiente de cálculo da Dimensão Fractal (DF) de imagens digitais. Este algoritmo fornece valores em toda a região teoricamente admissível (DF E [2,3]). É investigada a possibilidade de utilização deste método como uma ferramenta para identificação de falhas em tecidos. A DF caracteriza o grau de complexidade de um objeto. Esta característica têm sido usada recentemente na segmentação e classificação de texturas, na análise de formas e outros problemas. Este trabalho apresenta uma nova possibilidade de uso deste parâmetro, ainda não observado em outro trabalho. Foram realizados experimentos para verificar a eficiência do algoritmo desenvolvido: em imagens reais e sintéticas; na identificação de parâmetros de variação do cálculo; e verificação da influência da posição e da rotação do padrão da imagem na estimativa da imperfeição.
In this work an efficient algorithm for estimation of the Fractal Dimension (FD) of images is presented. At first, the approach is tested on the synthetic images. It is expected that the PD range is 2.0 – 3.0. A good method, as this approach, should reflect this desirable feature. The utilization of such algorithm on textile imperfection identification is investigated. The FD is a feature proposed recently to characterize roughness, self-similiarity and the complexity degree in a picture. This characteristic has been used in textures segmentation and classification, shape analysis and other problems. However, its utilization on image change characterization is a new feacture. Experiments has been done, not only on synthetic images, but also on real textile. The relation of a picture scanned at various different orientation and relative rotation of digital images are also discussed.
Osanlou, Ardeshir. « Soft computing and fractal geometry in signal processing and pattern recognition ». Thesis, De Montfort University, 2000. http://hdl.handle.net/2086/4242.
Texte intégralEmmanuel, Aurélien. « Courbes d'accumulations des machines à signaux ». Electronic Thesis or Diss., Orléans, 2023. http://www.theses.fr/2023ORLE1079.
Texte intégralThis thesis studies a geometric computational model: signal machines. We show how to draw function graphs using-binary trees. In the world of cellular automata, we often consider particles or signals: structures that are periodic in time and space, that is, structures that move at constant speed. When several signals meet, a collision occurs, and the incoming signals can continue, disappear, or give rise to new signals, depending on the rules of the cellular automaton. Signal-machines are a computational model that takes these signals as basic building blocks. Visualized in a space-time diagram, with space on the horizontal axis and time running upwards, this model consists of calculating by drawing segments and half-lines. We draw segments upwards until two or more intersect, and then start new segments, according to predefined rules. Compared to cellular automata, signal-machines allow for the emergence of a new phenomenon: the density of signals can be arbitrarily large, even infinite, even when starting from a finite initial configuration. Such points in the space-time diagram, whose neighborhoods contain an infinity of signals, are called accumulation points.This new phenomenon allows us to define new problems geometrically. For example, what are the isolated accumulation points that can be achieved using rational initial positions and rational velocities? Can we make so the set of accumulation points is a segment? A Cantor set? In this thesis, we tackle the problem of characterizing the function graphs that can be drawn using an accumulation set. This work fits into the exploration of the computational power of signal-machines, which in turn fits into the study of the computational power of non-standard models. We show that the functions from a compact segment of the line of Real numbers whose graph coincides with the accumulation set of a signal machine are exactly the continuous functions. More generally, we show how signal machines can draw any lower semicontinuous function. We also study the question under computational constraints, with the following result: if a computable signal-machine diagram coincides with the graph of a Lipschitz-function of sufficiently small Lipschitz coefficient, then that function is the limit of a growing and computable sequence of rational step functions
LeBien, John. « Automated Species Classification Methods for Passive Acoustic Monitoring of Beaked Whales ». ScholarWorks@UNO, 2017. https://scholarworks.uno.edu/td/2417.
Texte intégralSiriyala, Kodhanda Karthik. « Determining Level of Cognitive Impairment via Computing Fractals using a Computer ». Scholar Commons, 2018. https://scholarcommons.usf.edu/etd/7364.
Texte intégralSenot, Maxime. « Modèle géométrique de calcul : fractales et barrières de complexité ». Phd thesis, Université d'Orléans, 2013. http://tel.archives-ouvertes.fr/tel-00870600.
Texte intégralAmorim, Vicente José Peixoto de. « Um estudo para o problema de ordenação total de mensagens aplicado a redes Bluetooth com restrições fracas de tempo real ». [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275801.
Texte intégralDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-16T15:08:23Z (GMT). No. of bitstreams: 1 Amorim_VicenteJosePeixotode_M.pdf: 4964887 bytes, checksum: bfab031069f938f7f502f1bc4f0d5d13 (MD5) Previous issue date: 2010
Resumo: O estudo crítico apresentado discute o problema de ordenação de mensagens, típico da área de sistemas distribuídos, contextualizado em um ambiente de comunicação Bluetooth. Por ainda serem poucos os trabalhos com tal foco na bibliografia atual, este provê uma visão geral do comportamento de uma classe específica de protocolos distribuídos, quando executados no ambiente citado. Partindo desse contexto, o trabalho utiliza uma análise comparativa de alguns dos diversos algoritmos existentes, como forma de se obter informações sobre determinadas variáveis, e se caracterizar o melhor a ser utilizado em um ambiente de comunicação sem-fio com restrições de tempo real (real time). Ao se demonstrar a viabilidade de utilização deste(s) dentro de um ambiente de comunicação Bluetooth (com características real time), automaticamente surgem novas oportunidades de aplicações, principalmente para redes móveis onde a topologia predominante é ad- hoc, ou ainda, qualquer outro tipo de aplicação em que seja necessário se garantir a entrega em ordem das informações compartilhadas dentro de um limite de tempo. Como resultado desta análise, propõe-se um protocolo para o problema de ordenação total de mensagens aplicado a redes Bluetooth, onde se garante que, no ambiente de comunicação, todas as informações trocadas pelos nós (sites) serão enviadas e recebidas na mesma ordem.
Abstract: The presented work discuss the messages ordering problem, a common subject associated to distributed systems area which was here contextualized against Bluetooth network environment. The main target of this work is focused on distributed algorithms not so commonly considered until now, specially when they are applied to this related environment. As a way to obtain enough information about some systems variables and behavior, a comparative analysis was made between the already proposed protocols and algorithms. It generates a large set of information that makes possible to identify the better approach to be aplied at real time environments. Once the protocol viability is demonstrated, a large set of new applications can arise, specifically to this case: mobile applications using Bluetooth networks. This is mainly due to the mobile ad-hoc network topology which allows the use of distributed applications. However, it can also bring another class of problems as message ordering, which must ensure that all network shared data will keep a local and global sending order.
Mestrado
Computação Distribuída
Mestre em Ciência da Computação
Hsu, Shuoli, et 徐碩利. « Soft Computing Methods For Fractal Image Compression ». Thesis, 2011. http://ndltd.ncl.edu.tw/handle/68517142581776579452.
Texte intégral義守大學
資訊工程學系
100
Fractal image compression (FIC) makes use of the self-similarity inside a natural image to achieve high compression ratio and maintain good image quality. In FIC, the most important factor affecting the compression ratio and the image quality is the quantization of the contrast scaling and brightness offset coefficients. Most quantization methods treat the two coefficients independently and quantize them separately. However, the two coefficients are highly correlated and scattered around a line. An improved FIC is possible by taking this correlation into consideration. Another important problem with FIC is its low encoding speed because of the large amount of time it takes to search exhaustively for the best match when generating fractal codes. Most attempts to speedup the encoder work on different classification schemes to reduce the search space. Alternatively, nature inspired intelligence incorporated with stochastic selections can also be used to reduce the search space. This dissertation is organized into three parts to discuss the application of soft computing on image process problems. In the first part, an application of artificial neural network to multi-sensor image fusion problem is proposed. The basic idea is to segment far infrared image only and to add information of each region from segmented image to visual image. Because the relationship between fused parameters and image features are nonlinear, we adopt artificial neural network to deal with variations caused by conditions such as time or weather. The fused parameters for different regions can be produced automatically by the artificial neural network. The experimental results show that the method we proposed indeed has good adaptive capacity with automatically determined fused parameters. In the second part, a joint coefficient quantization method is proposed that considers the two coefficients together and thereby achieves better compression ratio and image quality. A pair of translation matrix and axis rotation matrix are used to transform the contrast scaling and brightness offset coefficients to another space. Then we perform linear quantization on the coefficients in the transformed space and inverse-transform them back to the original space. The proposed method is especially effective under parsimonious conditions. For example, using only 3 bits each to represent the contrast and brightness coefficients of Lena, the proposed method yields quality of 27.04 dB, which is significantly better than the 22.87 dB obtained from the traditional linear quantization method. In the third part, we discuss the speeded-up of fractal image encoding. Because of the large search space, the traditional full search method is time consuming, rendering the fractal image compression unsuitable for real-time applications. Ant colony optimization (ACO), a powerful algorithm belonging to a class called swamp intelligence algorithms, is used to speedup FIC. Although ACO has been applied to many difficult optimization problems, it is directly applicable only to problems of specific forms such as traveling as traveling salesman problem (TPS). The most interesting part of this research, therefore, is the novel remodeling technique that converts the FIC problem to a graphical form, making it ready to be solved by ACO. Experimental results show that, in comparison to the full search method, the proposed method can achieve a speedup ratio of 43.3 while keeping the image quality decays within 1.25 dB.
Horng-HannChien et 簡宏翰. « Computing the Fractal Dimension of Coastlines via Google Maps ». Thesis, 2019. http://ndltd.ncl.edu.tw/handle/g2h9xa.
Texte intégralChou, Shu-Yuan, et 周淑媛. « A Creation of Computing Design for Interactive Fractal Dynamic Shape ». Thesis, 2006. http://ndltd.ncl.edu.tw/handle/05727040787048507246.
Texte intégral中原大學
商業設計研究所
94
Fractal theory is a new developing science at the recent 30 years. Because appearance of computer let us experience the beauty of fractal in early time. It brings us another kind of vision pleasantly surprised, different from symmetry, rule, and stiff feeling of Euclid geometry. The fractal is developed on complex variable space. It is self-similar, can extend by oneself limitlessly, and has the property of Fractal dimension lets the shape of fractal have the sense difficult to fathom. As fractal meets computing designs that excites out the peculiar aesthetic view of this era. Adam Finkelstein(1998) thinks: “Computer design is an art with foundation rules and is often used in the computer auxiliary. Algorithmic art is rule-based art, usually made with the aid of a computer. Algorithmic visual art sits somewhere between mathematical art and computer graphics. Algorithmic artists focus on process, the sequence of steps used to create the work. Programs are used as tool. The concept is come out by way of logic and structure. Thus thinking can be transmitted thinking through computer screen. ” When computer didn’t yet enter personalize and evolve to be able to process the multimedia (Combine static image, sound, text and computer animation, etc.), people want to achieve the “interactive” is a very luxurious idea. In order to reach the interactive result, there should be cooperation of software and hardware, none of the two can be dispensed with. Appearance of interactive art, it is unable to cause a lot of positive responses for the moment, because it is totally different from visual art way that everybody is used to. The exhibition field is from the originally quiet to noisy and from individual appreciation to many people to participate. Such a change has really subverted the traditional artistic expression way. This creation hopes to present the dynamic fractal shape by the way of interactive, let viewers find out fractal in most natural cases. Find out fractal contains two meaning, one is the representation fractal (Can be seen in exhibition field), and another is the inherent fractal (Inspire the body, mind and spirit). In physical it is implemented by to combine on the method: Combine fractal, computing design, electronic circuit, program and interactive interface. In concept it is by means of the daily behavior, for example: Walk, heartbeat, hand dance and foot step, of “human” as interactive condition to clear show the relation between scientific technology and people's natural interactive.
Livres sur le sujet "Fractal computing"
Castillo, Oscar, et Patricia Melin. Soft Computing and Fractal Theory for Intelligent Manufacturing. Heidelberg : Physica-Verlag HD, 2003. http://dx.doi.org/10.1007/978-3-7908-1766-9.
Texte intégralOliver, Dick. Fractal graphics for Windows. Indianapolis : Sams, 1994.
Trouver le texte intégralOsanlou, Ardeshir. Soft computing and fractal geometry in signal processing and pattern recognition. Leicester : De Montfort University, 2000.
Trouver le texte intégralMelin, Patricia. Modelling, simulation and control of non-linear dynamical systems : An intelligent approach using soft computing and fractal theory. London : Taylor & Francis, 2002.
Trouver le texte intégralEglash, Ron. African fractals : Modern computing and indigenous design. New Brunswick, N.J : Rutgers University Press, 1999.
Trouver le texte intégralPeitgen, Heinz-Otto. Chaos and fractals : New frontiers of science. New York : Springer-Verlag, 1992.
Trouver le texte intégralPeitgen, Heinz-Otto. Chaos and fractals : New frontiers of science. 2e éd. New York : Springer, 2004.
Trouver le texte intégralPeitgen, Heinz-Otto. Chaos and fractals : New frontiers of science. New York : Springer-Verlag, 1992.
Trouver le texte intégralBraverman, Mark. Computability of Julia Sets. Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
Trouver le texte intégralCastillo, Oscar. Soft Computing and Fractal Theory for Intelligent Manufacturing. Castillo Oscar, 2012.
Trouver le texte intégralChapitres de livres sur le sujet "Fractal computing"
Rosenberg, Eric. « Computing the Correlation Dimension ». Dans Fractal Dimensions of Networks, 195–219. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43169-3_10.
Texte intégralRosenberg, Eric. « Computing the Box Counting Dimension ». Dans Fractal Dimensions of Networks, 107–29. Cham : Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43169-3_6.
Texte intégralHunt, Fern, et Francis Sullivan. « Methods of computing fractal dimensions ». Dans Lecture Notes in Mathematics, 83–95. Berlin, Heidelberg : Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/bfb0086754.
Texte intégralZmeskal, Oldrich. « Entropy of Fractal Systems ». Dans Advances in Intelligent Systems and Computing, 25–26. Berlin, Heidelberg : Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-33227-2_4.
Texte intégralYao, JingTao, Oladunni A. Oladimeji et Yan Zhang. « Fractal Analysis Approaches to Granular Computing ». Dans Rough Sets, 215–22. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-60837-2_18.
Texte intégralHunt, F., et F. Sullivan. « Efficient Algorithms for Computing Fractal Dimensions ». Dans Springer Series in Synergetics, 74–81. Berlin, Heidelberg : Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/978-3-642-71001-8_10.
Texte intégralMoniz, Ryan D., et Christian Jacob. « Fractal Evolver : Interactive Evolutionary Design of Fractals with Grid Computing ». Dans Lecture Notes in Computer Science, 442–51. Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01129-0_50.
Texte intégralFujiwara, Takanori, Ryo Matsushita, Masaki Iwamaru, Manabu Tange, Satoshi Someya et Koji Okamoto. « Fractal Map : Fractal-Based 2D Expansion Method for Multi-scale High-Dimensional Data Visualization ». Dans Advances in Visual Computing, 306–15. Berlin, Heidelberg : Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17289-2_30.
Texte intégralVenneri, Francesca, Sandra Costanzo et Giuseppe Di Massa. « Multi-band Fractal Microwave Absorbers ». Dans Advances in Intelligent Systems and Computing, 1488–93. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77712-2_144.
Texte intégralNayak, Soumya Ranjan, Jibitesh Mishra et Pyari Mohan Jena. « Fractal Dimension of GrayScale Images ». Dans Advances in Intelligent Systems and Computing, 225–34. Singapore : Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-7871-2_22.
Texte intégralActes de conférences sur le sujet "Fractal computing"
Paramonova, E., A. Kudinov, S. Mikheev, V. Tsvetkov et I. Tsvetkov. « FRACTAL THERMODYNAMICS, BIG DATA AND ITS 3D VISUALIZATION ». Dans 9th International Conference "Distributed Computing and Grid Technologies in Science and Education". Crossref, 2021. http://dx.doi.org/10.54546/mlit.2021.82.15.001.
Texte intégralLiu, Runjie, et Hongji Yang. « Chaos and Fractal for Creative Computing ». Dans 2014 IEEE 8th International Symposium on Service Oriented System Engineering (SOSE). IEEE, 2014. http://dx.doi.org/10.1109/sose.2014.83.
Texte intégralPink, David, Arun S. Moorthy et Fernanda Peyronel. « Computing the Fractal Dimensions of Aggregates ». Dans Virtual 2020 AOCS Annual Meeting & Expo. American Oil Chemists’ Society (AOCS), 2020. http://dx.doi.org/10.21748/am20.43.
Texte intégralBlahova, Marta. « SECURING INFORMATION SYSTEMS USING FRACTAL GEOMETRY ». Dans 22nd SGEM International Multidisciplinary Scientific GeoConference 2022. STEF92 Technology, 2022. http://dx.doi.org/10.5593/sgem2022/2.1/s07.11.
Texte intégralZhou, Tong, He Zhao, Nianzu Shen, Bin Yu, Xiaofeng Li et Jinlin Xu. « Fractal Ledger ». Dans CF '23 : 20th ACM International Conference on Computing Frontiers. New York, NY, USA : ACM, 2023. http://dx.doi.org/10.1145/3587135.3592203.
Texte intégralAlwan, Younes, Khalid Al-badri, Ghazwan Alwan et Marwah Majeed. « Fractal Generating Techniques ». Dans First International Conference on Computing and Emerging Sciences (ICCES'). SCITEPRESS - Science and Technology Publications, 2020. http://dx.doi.org/10.5220/0010462400860094.
Texte intégralTanida, Jun, Wataru Watanabe et Yoshiki Ichioka. « High Accurate Optical Analog Computing Implemented on Optical Fractal Synthesizer ». Dans Optical Computing. Washington, D.C. : Optica Publishing Group, 1995. http://dx.doi.org/10.1364/optcomp.1995.otue6.
Texte intégralPsaltis, Demetri, Xiang-Guang Gu et David Brady. « Fractal Sampling Grids For Holographic Interconnections ». Dans Optical Computing '88, sous la direction de Pierre H. Chavel, Joseph W. Goodman et Gerard Roblin. SPIE, 1989. http://dx.doi.org/10.1117/12.947926.
Texte intégralCofer, R. H., H. K. Brown et S. Abdallah. « Impact of parallel computing on fractal image compression ». Dans Proceedings of SOUTHCON '94. IEEE, 1994. http://dx.doi.org/10.1109/southc.1994.498127.
Texte intégralParshin, Alexander, et Yuri Parshin. « Optimal detection of 2D fractal object based on model of fractal Brownian surface ». Dans 2014 3rd Mediterranean Conference on Embedded Computing (MECO). IEEE, 2014. http://dx.doi.org/10.1109/meco.2014.6862674.
Texte intégralRapports d'organisations sur le sujet "Fractal computing"
Hemmer, Philip, et Robert Armstrong. Fractal-Enhancement of Photon Band-Gap Cavities for Quantum Computing and Other Applications. Fort Belvoir, VA : Defense Technical Information Center, août 2005. http://dx.doi.org/10.21236/ada444845.
Texte intégralAminzadeh, Fred, Charles Sammis, Mohammad Sahimi et David Okaya. Characterizing Fractures in Geysers Geothermal Field by Micro-seismic Data, Using Soft Computing, Fractals, and Shear Wave Anisotropy. Office of Scientific and Technical Information (OSTI), avril 2015. http://dx.doi.org/10.2172/1185274.
Texte intégral