Relevant bibliographies by topics / Fractal computing

Academic literature on the topic 'Fractal computing'

Author: Grafiati
Published: 8 June 2024

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 'Fractal computing.'

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.

Contents

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

Journal articles on the topic "Fractal computing":

1

Semenov, A. S. "Fractal feedback control for Elastic computing based on the Container–Component model." Journal of Physics: Conference Series 2308, no. 1 (July 1, 2022): 012009. http://dx.doi.org/10.1088/1742-6596/2308/1/012009.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Abstract One of the most significant characteristics of cloud computing is elasticity, which refers to the autoscaling control of resources based on the demands of the application or service. The problem of setting parameters of elastic autoscaling is not trivial and its solution depends on the control model. The Container-Component model that exploits the properties of fractals is investigated for this purpose. The fractal dimension is proposed to characterize the auto-scalability of distributed computing, independent of the implementation. The control of the fractal complexity by means of fractal feedback is considered.
2

Zhao, Yongwei, Yunji Chen, and Zhiwei Xu. "Fractal Parallel Computing." Intelligent Computing 2022 (September 5, 2022): 1–10. http://dx.doi.org/10.34133/2022/9797623.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
As machine learning (ML) becomes the prominent technology for many emerging problems, dedicated ML computers are being developed at a variety of scales, from clouds to edge devices. However, the heterogeneous, parallel, and multilayer characteristics of conventional ML computers concentrate the cost of development on the software stack, namely, ML frameworks, compute libraries, and compilers, which limits the productivity of new ML computers. Fractal von Neumann architecture (FvNA) is proposed to address the programming productivity issue for ML computers. FvNA is scale-invariant to program, thus making the development of a family of scaled ML computers as easy as a single node. In this study, we generalize FvNA to the field of general-purpose parallel computing. We model FvNA as an abstract parallel computer, referred to as the fractal parallel machine (FPM), to demonstrate several representative general-purpose tasks that are efficiently programmable. FPM limits the entropy of programming by applying constraints on the control pattern of the parallel computing systems. However, FPM is still general-purpose and cost-optimal. We settle some preliminary results showing that FPM is as powerful as many fundamental parallel computing models such as BSP and alternating Turing machine. Therefore, FvNA is also generally applicable to various fields other than ML.
3

Naylor, Michael. "Exploring Fractals in the Classroom." Mathematics Teacher 92, no. 4 (April 1999): 360–66. http://dx.doi.org/10.5951/mt.92.4.0360.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
This article introduces students to fractals, allows them to study the properties of some famous fractals, and encourages them to create their own fractal artwork. Students will learn about iterative processes, exponential functions, limits, writing general formulas, creating and following algorithms, and computing areas and perimeters of increasingly complex figures.
4

Jahanmiri, Fatemeh, and Dawn Cassandra Parker. "An Overview of Fractal Geometry Applied to Urban Planning." Land 11, no. 4 (March 25, 2022): 475. http://dx.doi.org/10.3390/land11040475.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Since computing advances in the last 30 years have allowed automated calculation of fractal dimensions, fractals have been established as ubiquitous signatures of urban form and socioeconomic function. Yet, applications of fractal concepts in urban planning have lagged the evolution of technical analysis methods. Through a narrative literature review around a series of “big questions” and automated bibliometric analysis, we offer a primer on fractal applications in urban planning, targeted to urban scholars and participatory planners. We find that developing evidence demonstrates linkages between urban history, planning context, and urban form and between “ideal” fractal dimension values and urban aesthetics. However, we identify gaps in the literature around findings that directly link planning regulations to fractal patterns, from both positive and normative lenses. We also find an increasing trend of most literature on fractals in planning being published outside of planning. We hypothesize that this trend results from communication gaps between technical analysts and applied planners, and hope that our overview will help to bridge that gap.
5

LIU, SHUAI. "EDITORIAL." Fractals 25, no. 04 (July 25, 2017): 1702001. http://dx.doi.org/10.1142/s0218348x17020017.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Fractal represents a special feature of nature and functional objects. However, fractal based computing can be applied to many research domains because of its fixed property resisted deformation, variable parameters and many unpredictable changes. Theoretical research and practical application of fractal based computing have been hotspots for 30 years and will be continued. There are many pending issues awaiting solutions in this domain, thus this thematic issue containing 14 papers publishes the state-of-the-art developments in theorem and application of fractal based computing, including mathematical analysis and novel engineering applications. The topics contain fractal and multifractal features in application and solution of nonlinear odes and equation.
6

Craus, Mitică, Vlad-Sergiu Bîrlescu, and Maricel Agop. "Fractal Aspects in Classical Parallel Computing." Computers 5, no. 3 (September 12, 2016): 19. http://dx.doi.org/10.3390/computers5030019.

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

SUGINO, Toshiki, Taisuke KOBAYASHI, and 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.

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

Liu, Si Ping. "Research on Cloud Computing Strategy Based on Security Model." Applied Mechanics and Materials 644-650 (September 2014): 1835–39. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.1835.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Based on the threats of cloud computing security, combined with the principle of private cloud computing, this paper introduces the variable dimension fractal theory into the cloud computing and security policy model, and puts forwards multidimensional data model C2MDSM of the cloud computation. The model can protect 2D and 3D protection of user information in a private cloud space. Through the 3D fractal it greatly improves the user use of cloud resources, and improves the security of information, which realizes the true sense of the reasonable distribution for cloud resources. In order to verify the validity of the mathematical model and the algorithm designed in this paper, we use the MATLAB software to draw 2D and 3D fractal, and obtain the number of cloud users, security level and calculation residual results. It provides the technical reference for the research on cloud computing.
9

Levin, I. I., and M. D. Chekina. "THE PARALLEL-PIPELINED IMPLEMENTATION OF THE FRACTAL IMAGE COMPRESSION FOR RECONFIGURABLE COMPUTING SYSTEMS." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 202 (April 2021): 37–44. http://dx.doi.org/10.14489/vkit.2021.04.pp.037-044.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The developed fractal image compression method, implemented for reconfigurable computing systems is described. The main idea parallel fractal image compression based on parallel execution pairwise comparison of domain and rank blocks. Achievement high performance occurs at the expense of simultaneously comparing maximum number of pairs. Implementation fractal image compression for reconfigurable computing systems has two critical resources, as number of input channels and FPGA Look-up Table (LUT). The main critical resource for fractal image compression is data channels, and implementation this task for reconfigurable computing systems requires parallel-pipeline computations organization replace parallel, preliminarily produced performance reduction parallel computational structure. The main critical resource for fractal image compression is data channels, and implementation this task for reconfigurable computing systems requires parallel-pipeline computations organization replace parallel computations organiation. For using parallel-pipeline computations organization, preliminarily have produce performance reduction parallel computational structure. Each operator has routed to computational structure sequentially (bit by bit) to save computational resources and reduces equipment downtime. Storing iterated functions system coefficients for image encoding has been introduced in data structure, which correlates between corresponding parameters the numbers of rank and domain blocks. Applying this approach for parallel-pipeline programs allows scaling computing structure to plurality programmable logic arrays (FPGAs). Task implementation on the reconfigurable computer system Tertius-2 containing eight FPGAs 15 000 times provides performed acceleration relatively with universal multi-core processor, and 18 – 25 times whit to existing solutions for FPGAs.
10

PRASAD, SRIJANANI ANURAG, and G. P. KAPOOR. "FRACTAL DIMENSION OF COALESCENCE HIDDEN-VARIABLE FRACTAL INTERPOLATION SURFACE." Fractals 19, no. 02 (June 2011): 195–201. http://dx.doi.org/10.1142/s0218348x11005336.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
In the present paper, the bounds on fractal dimension of Coalescence Hidden-variable Fractal Interpolation Surface (CHFIS) in ℝ3 on a equispaced mesh are found. These bounds determine the conditions on the free parameters for fractal dimension of the constructed CHFIS to become close to 3. The results derived here are tested on a tsunami wave surface by computing the lower and upper bounds of the fractal dimension of its CHFIS simulation.
More sources
You might also be interested in the extended bibliographies on the topic 'Fractal computing' for particular source types:
Journal articles Books

Dissertations / Theses on the topic "Fractal computing":

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
CONSELHO 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.
2

Osanlou, Ardeshir. "Soft computing and fractal geometry in signal processing and pattern recognition." Thesis, De Montfort University, 2000. http://hdl.handle.net/2086/4242.

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

Emmanuel, Aurélien. "Courbes d'accumulations des machines à signaux." Electronic Thesis or Diss., Orléans, 2023. http://www.theses.fr/2023ORLE1079.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Cette thèse s'inscrit dans l'étude d'un modèle de calcul géométrique : les machines à signaux. Nous y montrons comment tracer des graphes de fonctions à l'aide d'arbres unaire-binaires. Dans le monde des automates cellulaires, il est souvent question de particules ou signaux : des structures périodiques dans le temps et l'espace, autrement dit des structures qui se déplacent à vitesse constante. Lorsque plusieurs signaux se rencontrent, une collision a lieu, et les signaux entrant peuvent continuer, disparaître ou laisser place à d'autres signaux, en fonctions des règles de l'automate cellulaire. Les machines à signaux sont un modèle de calcul qui reprend ces signaux comme briques de base. Visualisées dans un diagramme espace-temps, l'espace en axe horizontal et le temps vertical s'écoulant vers le haut, ce modèle revient à calculer par le dessin de segments et demi-droites colorés. On trace, de bas en haut, des segments jusqu'à ce que deux ou plus s'intersectent, et l'on démarre alors de nouveau segments, en fonctions de règles prédéfinies. Par rapport aux automates cellulaires, les machines à signaux permettent l'émergence d'un nouveau phénomène : la densité des signaux peut être arbitrairement grande et même infinie, y compris en partant d'une configuration initiale de densité finie. De tels points du diagramme espace-temps, des points au voisinage desquels se trouvent une infinité de signaux, sont appelés points d'accumulation. Ce nouveau phénomène permet de définir de nouveau problèmes, géométriquement. Par exemple : quels sont les points d'accumulations isolés possibles en utilisant des positions initiales et des vitesses rationnelles ? Peut-on faire en sorte que l'ensemble des points d'accumulation forment un segment ? un ensemble de Cantor ? Dans cette thèse, nous nous attelons à caractériser des graphes de fonctions qu'il est possible de dessiner par un ensemble d'accumulation. Elle s'inscrit dans l'exploration de la puissance de calcul des machines à signaux, qui s'inscrit plus généralement dans l'étude de la puissance de calcul de modèles non standards. Nous y montrons que les fonctions d'un segment compact de la droite réelle dont le graphe coïncide avec l'ensemble d'accumulation d'une machine à signaux sont exactement les fonctions continues. Nous montrons plus généralement comment les machines à signaux peuvent dessiner n'importe quel fonction semi-continue inférieurement. Nous étudions aussi la question sous des contraintes de calculabilité, avec le résultat suivant : si un diagramme de machine à signaux calculable coïncide avec le graphe d'un fonction suffisamment lipschitzienne, cette fonction est limite calculable d'une suite croissante de fonctions en escalier rationnelles
This 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
4

LeBien, John. "Automated Species Classification Methods for Passive Acoustic Monitoring of Beaked Whales." ScholarWorks@UNO, 2017. https://scholarworks.uno.edu/td/2417.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The Littoral Acoustic Demonstration Center has collected passive acoustic monitoring data in the northern Gulf of Mexico since 2001. Recordings were made in 2007 near the Deepwater Horizon oil spill that provide a baseline for an extensive study of regional marine mammal populations in response to the disaster. Animal density estimates can be derived from detections of echolocation signals in the acoustic data. Beaked whales are of particular interest as they remain one of the least understood groups of marine mammals, and relatively few abundance estimates exist. Efficient methods for classifying detected echolocation transients are essential for mining long-term passive acoustic data. In this study, three data clustering routines using k-means, self-organizing maps, and spectral clustering were tested with various features of detected echolocation transients. Several methods effectively isolated the echolocation signals of regional beaked whales at the species level. Feedforward neural network classifiers were also evaluated, and performed with high accuracy under various noise conditions. The waveform fractal dimension was tested as a feature for marine biosonar classification and improved the accuracy of the classifiers. [This research was made possible by a grant from The Gulf of Mexico Research Initiative. Data are publicly available through the Gulf of Mexico Research Initiative Information & Data Cooperative (GRIIDC) at https://data.gulfresearchinitiative.org.] [DOIs: 10.7266/N7W094CG, 10.7266/N7QF8R9K]
5

Siriyala, Kodhanda Karthik. "Determining Level of Cognitive Impairment via Computing Fractals using a Computer." Scholar Commons, 2018. https://scholarcommons.usf.edu/etd/7364.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Mild Cognitive Impairment is a condition that affects an individual's thinking and decision making capabilities. Specifically, it is one where an individual's capabilities of memorizing, thinking and decision making are less efficient when compared to others. In order to diagnose this condition, a conventional method is to provide the subject with a small challenge they should be completed using pen and paper. This thesis focuses on how this method can be converted to a computer based test. A data visualization tool named Processing has been used to develop a system that runs a game-like test, which is completed by individuals using a mouse. The system then saves the individual's mouse movements in the form of a CSV file. This files are used for further analyzed using JMP Pro on how this data can be used for determining cognitive abilities via computing a metric called Fractal, and what conclusions can be drawn. In order to achieve comparable results, readings from two diverse age groups have been collected. The results using a total of 12 subjects are convincing in that the tool can be used to as a marker for detecting cognitive impairment.
6

Senot, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Les modèles géométriques de calcul permettent d'effectuer des calculs à l'aide de primitives géométriques. Parmi eux, le modèle des machines à signaux se distingue par sa simplicité, ainsi que par sa puissance à réaliser efficacement de nombreux calculs. Nous nous proposons ici d'illustrer et de démontrer cette aptitude, en particulier dans le cas de processus massivement parallèles. Nous montrons d'abord à travers l'étude de fractales que les machines à signaux sont capables d'une utilisation massive et parallèle de l'espace. Une méthode de programmation géométrique modulaire est ensuite proposée pour construire des machines à partir de composants géométriques de base -- les modules -- munis de certaines fonctionnalités. Cette méthode est particulièrement adaptée pour la conception de calculs géométriques parallèles. Enfin, l'application de cette méthode et l'utilisation de certaines des structures fractales résultent en une résolution géométrique de problèmes difficiles comme les problèmes de satisfaisabilité booléenne SAT et Q-SAT. Ceux-ci, ainsi que plusieurs de leurs variantes, sont résolus par machines à signaux avec une complexité en temps intrinsèque au modèle, appelée profondeur de collisions, qui est polynomiale, illustrant ainsi l'efficacité et le pouvoir de calcul parallèle des machines à signaux.
7

Amorim, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
Orientador: Ricardo de Oliveira Anido
Dissertaçã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
8

Hsu, Shuoli, and 徐碩利. "Soft Computing Methods For Fractal Image Compression." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/68517142581776579452.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
博士
義守大學
資訊工程學系
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.
9

Horng-HannChien and 簡宏翰. "Computing the Fractal Dimension of Coastlines via Google Maps." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/g2h9xa.

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

Chou, Shu-Yuan, and 周淑媛. "A Creation of Computing Design for Interactive Fractal Dynamic Shape." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/05727040787048507246.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
碩士
中原大學
商業設計研究所
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.

Books on the topic "Fractal computing":

1

Castillo, Oscar, and 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.

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

Oliver, Dick. Fractal graphics for Windows. Indianapolis: Sams, 1994.

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

Osanlou, Ardeshir. Soft computing and fractal geometry in signal processing and pattern recognition. Leicester: De Montfort University, 2000.

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

Melin, Patricia. Modelling, simulation and control of non-linear dynamical systems: An intelligent approach using soft computing and fractal theory. London: Taylor & Francis, 2002.

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

Eglash, Ron. African fractals: Modern computing and indigenous design. New Brunswick, N.J: Rutgers University Press, 1999.

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

Peitgen, Heinz-Otto. Chaos and fractals: New frontiers of science. New York: Springer-Verlag, 1992.

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

Peitgen, Heinz-Otto. Chaos and fractals: New frontiers of science. 2nd ed. New York: Springer, 2004.

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

Peitgen, Heinz-Otto. Chaos and fractals: New frontiers of science. New York: Springer-Verlag, 1992.

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

Braverman, Mark. Computability of Julia Sets. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.

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

Castillo, Oscar. Soft Computing and Fractal Theory for Intelligent Manufacturing. Castillo Oscar, 2012.

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

Book chapters on the topic "Fractal computing":

1

Rosenberg, Eric. "Computing the Correlation Dimension." In Fractal Dimensions of Networks, 195–219. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43169-3_10.

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

Rosenberg, Eric. "Computing the Box Counting Dimension." In Fractal Dimensions of Networks, 107–29. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43169-3_6.

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

Hunt, Fern, and Francis Sullivan. "Methods of computing fractal dimensions." In Lecture Notes in Mathematics, 83–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/bfb0086754.

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

Zmeskal, Oldrich. "Entropy of Fractal Systems." In 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.

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

Yao, JingTao, Oladunni A. Oladimeji, and Yan Zhang. "Fractal Analysis Approaches to Granular Computing." In Rough Sets, 215–22. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-60837-2_18.

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

Hunt, F., and F. Sullivan. "Efficient Algorithms for Computing Fractal Dimensions." In Springer Series in Synergetics, 74–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 1986. http://dx.doi.org/10.1007/978-3-642-71001-8_10.

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

Moniz, Ryan D., and Christian Jacob. "Fractal Evolver: Interactive Evolutionary Design of Fractals with Grid Computing." In 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.

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

Fujiwara, Takanori, Ryo Matsushita, Masaki Iwamaru, Manabu Tange, Satoshi Someya, and Koji Okamoto. "Fractal Map: Fractal-Based 2D Expansion Method for Multi-scale High-Dimensional Data Visualization." In Advances in Visual Computing, 306–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-17289-2_30.

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

Venneri, Francesca, Sandra Costanzo, and Giuseppe Di Massa. "Multi-band Fractal Microwave Absorbers." In 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.

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

Nayak, Soumya Ranjan, Jibitesh Mishra, and Pyari Mohan Jena. "Fractal Dimension of GrayScale Images." In Advances in Intelligent Systems and Computing, 225–34. Singapore: Springer Singapore, 2018. http://dx.doi.org/10.1007/978-981-10-7871-2_22.

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

Conference papers on the topic "Fractal computing":

1

Paramonova, E., A. Kudinov, S. Mikheev, V. Tsvetkov, and I. Tsvetkov. "FRACTAL THERMODYNAMICS, BIG DATA AND ITS 3D VISUALIZATION." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
The article proposes to use fractal thermodynamics to analyze big data with fractal structure. The need for big data analysis arises in many areas of science and technology when creating databases in economics, medicine, geophysics, astronomy, particle physics and many others. This task is greatly simplified if big data has structural patterns. In this talk, we considered the case when big data forming a set A with a high degree of accuracy are multifractals. The analysis of the fractal structure of the set A was carried out on the basis of the fractal thermodynamics model. Its main methods and approaches are described. As a specific example of the set A, we consider the quantum phase spaces of the instantaneous heart rate Sq, built on the basis of big data on the RR-intervals of daily Holter monitoring of patients from the Tver Regional Clinical Hospital. It is shown that the sets Sq are fractals with a high degree of accuracy and, therefore, the method of fractal thermodynamics is quite applicable for studying their structure.
2

Liu, Runjie, and Hongji Yang. "Chaos and Fractal for Creative Computing." In 2014 IEEE 8th International Symposium on Service Oriented System Engineering (SOSE). IEEE, 2014. http://dx.doi.org/10.1109/sose.2014.83.

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

Pink, David, Arun S. Moorthy, and Fernanda Peyronel. "Computing the Fractal Dimensions of Aggregates." In Virtual 2020 AOCS Annual Meeting & Expo. American Oil Chemists’ Society (AOCS), 2020. http://dx.doi.org/10.21748/am20.43.

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

Blahova, Marta. "SECURING INFORMATION SYSTEMS USING FRACTAL GEOMETRY." In 22nd SGEM International Multidisciplinary Scientific GeoConference 2022. STEF92 Technology, 2022. http://dx.doi.org/10.5593/sgem2022/2.1/s07.11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
This article deals with the use of the principles of fractal geometry applicable in the field of cryptographic security of communication within information systems. The theory of the proposed solution is based on the field of iterative fractals created using the TEA (Time Escape Algorithm) algorithm. The introductory part deals with the issue of choosing a suitable category of fractals for the purpose of securing information systems. The next part deals with the issue of generation, analysis of fractal structures, which is a prerequisite for the implementation of the proposed encryption process. The outputs from the performed fractal analysis are also used for the decryption process. The methodology of testing the proposed solution against cryptanalytic methods is described here. In the final part, the individual elements of the proposed process were implemented using a programmed interface in C #. It continues by testing the resistance of the given encryption method to cryptanalytic methods. Statistical methods, analytical methods, and brute force attacks were used to investigate resilience. The acquired knowledge proved the usability of the proposed solution for the selected area of its use.aim of this research is to design a suitable design for a diagnosticdevice that will periodically monitor and record selected quantities in the device. The diagnostic equipment must be as flexible as possible, as the design will be applicable to all output electronic equipment of this project. This means that the diagnostic design can be applied to all control units, add-on modules or turnstile controllers. Each checked element contains different quantities that are valid for correct diagnostics. Therefore, there is a desire for a uniform design that can be customized based on the device. The main benefit is finding a way to secure data against unwanted retrieval of its content. The involvement of the branch of fractal geometry in the field of information security opens up new possibilities, given the different conception of fractals, in contrast to the objects of classical Euclidean or other geometry. The proposed system works with complex fractal structures, which can be described by relatively trivial equations, which allows using this system with high speed both for encoding the message and for its retrospective reconstruction. This fact opens the way to the use of the proposed system for information security even in devices with limited computing capacity. The system emphasizes resistance to cryptanalytic methods, such as brute force attack, statistical methods, or analytical methods.
5

Zhou, Tong, He Zhao, Nianzu Shen, Bin Yu, Xiaofeng Li, and Jinlin Xu. "Fractal Ledger." In CF '23: 20th ACM International Conference on Computing Frontiers. New York, NY, USA: ACM, 2023. http://dx.doi.org/10.1145/3587135.3592203.

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

Alwan, Younes, Khalid Al-badri, Ghazwan Alwan, and Marwah Majeed. "Fractal Generating Techniques." In First International Conference on Computing and Emerging Sciences (ICCES'). SCITEPRESS - Science and Technology Publications, 2020. http://dx.doi.org/10.5220/0010462400860094.

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

Tanida, Jun, Wataru Watanabe, and Yoshiki Ichioka. "High Accurate Optical Analog Computing Implemented on Optical Fractal Synthesizer." In Optical Computing. Washington, D.C.: Optica Publishing Group, 1995. http://dx.doi.org/10.1364/optcomp.1995.otue6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
Abstract:
In the course of exploring capabilities of optical computing, optical analog scheme is important field to be researched more actively. Optical analog computing has excellent advantages, i.e., large data capacity, large processing capability, flexibility in data representation, and so on. Various optical transforms such as conventional and fractional Fourier transforms and optical techniques including vector-matrix multiplier and matched filter are good examples of the field.
8

Psaltis, Demetri, Xiang-Guang Gu, and David Brady. "Fractal Sampling Grids For Holographic Interconnections." In Optical Computing '88, edited by Pierre H. Chavel, Joseph W. Goodman, and Gerard Roblin. SPIE, 1989. http://dx.doi.org/10.1117/12.947926.

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

Cofer, R. H., H. K. Brown, and S. Abdallah. "Impact of parallel computing on fractal image compression." In Proceedings of SOUTHCON '94. IEEE, 1994. http://dx.doi.org/10.1109/southc.1994.498127.

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

Parshin, Alexander, and Yuri Parshin. "Optimal detection of 2D fractal object based on model of fractal Brownian surface." In 2014 3rd Mediterranean Conference on Embedded Computing (MECO). IEEE, 2014. http://dx.doi.org/10.1109/meco.2014.6862674.

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

Reports on the topic "Fractal computing":

1

Hemmer, Philip, and Robert Armstrong. Fractal-Enhancement of Photon Band-Gap Cavities for Quantum Computing and Other Applications. Fort Belvoir, VA: Defense Technical Information Center, August 2005. http://dx.doi.org/10.21236/ada444845.

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

Aminzadeh, Fred, Charles Sammis, Mohammad Sahimi, and 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), April 2015. http://dx.doi.org/10.2172/1185274.

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

To the bibliography