Relevant bibliographies by topics / Iteratie

Contents

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

Academic literature on the topic 'Iteratie'

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 'Iteratie.'

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 "Iteratie"

1

Barakat, Saman A., and Qusay I. Sarhan. "Performance evaluation of list iteration methods in Java: an empirical study." Innovaciencia Facultad de Ciencias Exactas, Físicas y Naturales 6, no. 1 (2018): 1–6. http://dx.doi.org/10.15649/2346075x.467.

Full text
Abstract:
Introduction: Lists are used in various software applications including web applications, desktop applications, and Internet of Things (IoT) applications to store different types of items (e.g. country name, product model, and device category). Users can select one or more of these items to perform specific tasks such as filling forms, ordering products, reading device data, etc. In some software applications, lists store a huge number of items to be iterated over in order to know what users have selected. From a software development perspective, there are a number of methods to iterate over list items. Materials and Methods: In this paper, five list iteration methods: Classic For, Enhanced For, Iterator, List Iterator, and For Each have been compared experimentally with each other with regard to their performance (execution time required to iterate over list items). Thus, a number of experimental test scenarios have been conducted to obtain comparable results. Results and Discussion: The experimental results of this study have been presented in Table 4. Conclusions: Overall performance evaluation showed that Iterator and List Iterator methods outperformed other list iteration methods in all test scenarios. However, List Iterator outperformed Iterator when the list size was small. On the other hand, Iterator outperformed List Iterator when the list size was large.
APA, Harvard, Vancouver, ISO, and other styles
2

Kelly, Terence, and Kai Nagel. "Relaxation Criteria for Iterated Traffic Simulations." International Journal of Modern Physics C 09, no. 01 (1998): 113–32. http://dx.doi.org/10.1142/s0129183198000108.

Full text
Abstract:
Iterative transportation microsimulations adjust traveler route plans by iterating between a microsimulation and a route planner. At each iteration, the route planner adjusts individuals' route choices based on the preceding microsimulations. Empirically, this process yields good results, but it is usually unclear when to stop the iterative process when modeling real-world traffic. This paper investigates several criteria to judge relaxation of the iterative process, emphasizing criteria related to traveler decision-making.
APA, Harvard, Vancouver, ISO, and other styles
3

Liu, Xiao-hua. "Iteration and Iterative Roots of Fractional Polynomial Function." International Journal of Mathematics and Mathematical Sciences 2012 (2012): 1–10. http://dx.doi.org/10.1155/2012/365956.

Full text
Abstract:
Iteration is involved in the fields of dynamical systems and numerical computation and so forth. The computation of iteration is difficult for general functions (even for some simple functions such as linear fractional functions). In this paper, we discuss fractional polynomial function and use the method of conjugate similitude to obtain its expression of general iterate of ordernunder two different conditions. Furthermore, we also give iterative roots of ordernfor the function under two different conditions.
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Feng, Jianping Zhang, Guiling Sun, and Tianyu Geng. "Iterative Forward-Backward Pursuit Algorithm for Compressed Sensing." Journal of Electrical and Computer Engineering 2016 (2016): 1–7. http://dx.doi.org/10.1155/2016/5940371.

Full text
Abstract:
It has been shown that iterative reweighted strategies will often improve the performance of many sparse reconstruction algorithms. Iterative Framework for Sparse Reconstruction Algorithms (IFSRA) is a recently proposed method which iteratively enhances the performance of any given arbitrary sparse reconstruction algorithm. However, IFSRA assumes that the sparsity level is known. Forward-Backward Pursuit (FBP) algorithm is an iterative approach where each iteration consists of consecutive forward and backward stages. Based on the IFSRA, this paper proposes the Iterative Forward-Backward Pursuit (IFBP) algorithm, which applies the iterative reweighted strategies to FBP without the need for the sparsity level. By using an approximate iteration strategy, IFBP gradually iterates to approach the unknown signal. Finally, this paper demonstrates that IFBP significantly improves the reconstruction capability of the FBP algorithm, via simulations including recovery of random sparse signals with different nonzero coefficient distributions in addition to the recovery of a sparse image.
APA, Harvard, Vancouver, ISO, and other styles
5

Kheirfam, Behrouz. "Simplified analysis of a full Nesterov–Todd step infeasible interior-point method for symmetric optimization." Asian-European Journal of Mathematics 08, no. 04 (2015): 1550071. http://dx.doi.org/10.1142/s1793557115500710.

Full text
Abstract:
We give a simplified analysis and an improved iteration bound of a full Nesterov–Todd (NT) step infeasible interior-point method for solving symmetric optimization. This method shares the features as, it (i) requires strictly feasible iterates on the central path of a perturbed problem, (ii) uses the feasibility steps to find strictly feasible iterates for the next perturbed problem, (iii) uses the centering steps to obtain a strictly feasible iterate close enough to the central path of the new perturbed problem, and (iv) reduces the size of the residual vectors with the same speed as the duality gap. Furthermore, the complexity bound coincides with the currently best-known iteration bound for full NT step infeasible interior-point methods.
APA, Harvard, Vancouver, ISO, and other styles
6

Titaley, Jullia, Tohap Manurung, and Henriette D. Titaley. "CUBIC AND QUADRATIC POLYNOMIAL ON JULIA SET WITH TRIGONOMETRIC FUNCTION." JURNAL ILMIAH SAINS 18, no. 2 (2018): 103. http://dx.doi.org/10.35799/jis.18.2.2018.21555.

Full text
Abstract:
CUBIC AND QUADRATIC POLYNOMIAL ON JULIA SET WITH TRIGONOMETRIC FUNCTIONABSTRACTJulia set are defined by iterating a function of a complex number and is generated from the iterated function . We investigate in this paper the complex dynamics of different functions and applied iteration function system to generate an entire new class of julia set. The purpose of this research is to make variation of Cubic and Quadratic polynomial on Julia Set and the two obvious to investigate from julia set are Sine and Cosine function. The results thus obtained are innovative and studies about different behavior of two basic trigonometry.Keywords : Julia Set, trigonometric function, polynomial function POLINOMIAL KUBIK DAN KUADRATIK PADA HIMPUNAN JULIA DENGAN FUNGSI TRIGONOMETRI ABSTRAKHimpunan Julia didefiniskan oleh fungsi iterasi dari bilangan kompleks dan dibangkitkan dari fungsi iterasi . Kami melakukan penelitian dalam penulisan ini tentang sistem dinamik kompleks dari fungsi yang berbeda dengan iterasi yang diterapkan untuk menghasilkan kelas baru dari himpunan Julia. Tujuan dari penelitian ini adalah untuk membuah kelas baru himpunan Julia dengan fungsi polinomial kubik dan kuadratik dengan fungsi sinus dan kosinus. Hasil akhir dari penelitian ini ada menemukan inovatif baru dari himpunan Julia dengan menggunakan dua fungsi trigonometri.Kata kunci: Julia set, fungsi trigonometri, fungsi polinomial
APA, Harvard, Vancouver, ISO, and other styles
7

Burkart, Uhland. "Orbit entropy in noninvertible mappings." Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 40, no. 1 (1986): 95–110. http://dx.doi.org/10.1017/s1446788700026537.

Full text
Abstract:
AbstractBassed on the intrinsic structure of a selfmapping T: S → S of an arbitrary set S, called the orbit-structure of T, a new entropy is defined. The idea is to use the number of preimages of an element x under the iterates of T to characterize the complexity of the transformation T and their orbit graphs. The fundamental properties of the orbit entropy related to iteration, iterative roots and iteration semigroups are studied. For continuous (differentiable) functions of Rn to Rn, the chaos of Li and Yorke is characterized by means of this entropy, mainly using the method of Straffingraphs.
APA, Harvard, Vancouver, ISO, and other styles
8

Abdeljawad, Thabet, and Arran Fernandez. "On a New Class of Fractional Difference-Sum Operators with Discrete Mittag-Leffler Kernels." Mathematics 7, no. 9 (2019): 772. http://dx.doi.org/10.3390/math7090772.

Full text
Abstract:
We formulate a new class of fractional difference and sum operators, study their fundamental properties, and find their discrete Laplace transforms. The method depends on iterating the fractional sum operators corresponding to fractional differences with discrete Mittag–Leffler kernels. The iteration process depends on the binomial theorem. We note in particular the fact that the iterated fractional sums have a certain semigroup property, and hence, the new introduced iterated fractional difference-sum operators have this semigroup property as well.
APA, Harvard, Vancouver, ISO, and other styles
9

SARGSYAN, GRIGOR, and RALF SCHINDLER. "VARSOVIAN MODELS I." Journal of Symbolic Logic 83, no. 2 (2018): 496–528. http://dx.doi.org/10.1017/jsl.2018.5.

Full text
Abstract:
AbstractLet Msw denote the least iterable inner model with a strong cardinal above a Woodin cardinal. By [11], Msw has a fully iterable core model, ${K^{{M_{{\rm{sw}}}}}}$, and Msw is thus the least iterable extender model which has an iterable core model with a Woodin cardinal. In V, ${K^{{M_{{\rm{sw}}}}}}$ is an iterate of Msw via its iteration strategy Σ.We here show that Msw has a bedrock which arises from ${K^{{M_{{\rm{sw}}}}}}$ by telling ${K^{{M_{{\rm{sw}}}}}}$ a specific fragment ${\rm{\bar{\Sigma }}}$ of its own iteration strategy, which in turn is a tail of Σ. Hence Msw is a generic extension of $L[{K^{{M_{{\rm{sw}}}}}},{\rm{\bar{\Sigma }}}]$, but the latter model is not a generic extension of any inner model properly contained in it.These results generalize to models of the form Ms (x) for a cone of reals x, where Ms (x) denotes the least iterable inner model with a strong cardinal containing x. In particular, the least iterable inner model with a strong cardinal above two (or seven, or boundedly many) Woodin cardinals has a 2-small core model K with a Woodin cardinal and its bedrock is again of the form $L[K,{\rm{\bar{\Sigma }}}]$.
APA, Harvard, Vancouver, ISO, and other styles
10

SALAHI, MAZIAR, and TAMÁS TERLAKY. "A HYBRID ADAPTIVE ALGORITHM FOR LINEAR OPTIMIZATION." Asia-Pacific Journal of Operational Research 26, no. 02 (2009): 235–56. http://dx.doi.org/10.1142/s0217595909002183.

Full text
Abstract:
Recently, using the framework of self-regularity, Salahi in his Ph.D. thesis proposed an adaptive single step algorithm which takes advantage of the current iterate information to find an appropriate barrier parameter rather than using a fixed fraction of the current duality gap. However, his algorithm might do at most one bad step after each good step in order to keep the iterate in a certain neighborhood of the central path. In this paper, using the same framework, we propose a hybrid adaptive algorithm. Depending on the position of the current iterate, our new algorithm uses either the classical Newton search direction or a self-regular search direction. The larger the distance from the central path, the larger the barrier degree of the self-regular search direction is. Unlike the classical approach, here we control the iterates by guaranteeing certain reduction of the proximity measure. This itself leads to a one dimensional equation which determines the target barrier parameter at each iteration. This allows us to have a large update algorithm without any need for safeguard or special steps. Finally, we prove that our hybrid adaptive algorithm has an [Formula: see text] worst case iteration complexity.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Iteratie"

1

Kindermann, Lars. "Neuronale Netze zur Berechnung Iterativer Wurzeln und Fraktionaler Iterationen." Doctoral thesis, Universitätsbibliothek Chemnitz, 2002. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200201544.

Full text
Abstract:
Diese Arbeit entwickelt eine Methode, Funktionalgleichungen der Art g(g(x))=f(x) bzw. g^n(x)=f(x) mit Hilfe neuronaler Netze zu lösen. Gesucht ist eine Funktion g(x), die mehrfach hintereinandergeschaltet genau einer gegebenen Funktion f(x) entspricht. Man nennt g=f^1/n eine iterative Wurzel oder fraktionale Iteration von f. Lösungen für g zu finden, stellt das inverse Problem der Iteration dar oder die Erweiterung der Wurzel- bzw. Potenzoperation auf die Funktionsalgebra. Geschlossene Ausdrücke für Funktionswurzeln einer gegebenen Funktion zu finden, ist in der Regel nicht möglich oder sehr schwer. Numerische Verfahren sind nicht in allgemeiner Form beschrieben oder als Software vorhanden. Ausgehend von der Fähigkeit eines neuronalen Netzes, speziell des mehrschichtigen Perzeptrons, durch Training eine gegebene Funktion f(x) zu approximieren, erlaubt eine spezielle Topologie des Netzes auch die Berechnung von fraktionalen Iterationen von f. Ein solches Netz besteht aus n identischen, hintereinandergeschalteten Teilnetzen, die, wenn das Gesamtnetz f approximiert, jedes für sich g = f^1/n annähern. Es ist lediglich beim Training des Netzes darauf zu achten, dass die korrespondierenden Gewichte aller Teilnetze den gleichen Wert annehmen. Dazu werden mehrere Verfahren entwickelt: Lernen nur im letzten Teilnetz und Kopieren der Gewichte auf die anderen Teile, Angleichen der Teilnetze durch Kopplungsfaktoren oder Einführung eines Fehlerterms, der Unterschiede in den Teilnetzen bestraft. Als weitere Näherungslösung wird ein iteriertes lineares Modell entwickelt, das durch ein herkömmliches neuronales Netz mit hoher Approximationsgüte für nichtlineare Zusammenhänge korrigiert wird. Als Anwendung ist konkret die Modellierung der Bandprofilentwicklung beim Warmwalzen von Stahlblech gegeben. Einige Zentimeter dicke Stahlblöcke werden in einer Walzstraße von mehreren gleichartigen, hintereinanderliegenden Walzgerüsten zu Blechen von wenigen Millimetern Dicke gewalzt. Neben der Dicke ist das Profil - der Dickenunterschied zwischen Bandmitte und Rand - eine wichtige Qualitätsgröße. Sie kann vor und hinter der Fertigstraße gemessen werden, aus technischen Gründen aber nicht zwischen den Walzgerüsten. Eine genaue Kenntnis ist jedoch aus produktionstechnischen Gründen wichtig. Der Stand der Technik ist die Berechnung dieser Zwischenprofile durch das wiederholte Durchrechnen eines mathematischen Modells des Walzvorganges für jedes Gerüst und eine ständige Anpassung von adaptiven Termen dieses Modells an die Messdaten. Es wurde gezeigt, dass mit einem adaptiven neuronalen Netz, das mit Eingangs- und Ausgangsprofil sowie allen vorhandenen Kenn- und Stellgrößen trainiert wird, die Vorausberechnung des Endprofils mit deutlich höherer Genauigkeit vorgenommen werden kann. Das Problem ist, dass dieses Netz die Übertragungsfunktion der gesamten Straße repräsentiert, Zwischenprofile können nicht ausgegeben werden. Daher wird der Versuch gemacht, beide Eigenschaften zu verbinden: Die genaue Endprofilmodellierung eines neuronalen Netzes wird kombiniert mit der Fähigkeit des iterierten Modells, Zwischenprofile zu berechnen. Dabei wird der in Form von Messdaten bekannte gesamte Prozess als iterierte Verknüpfung von technisch identischen Teilprozessen angesehen. Die Gewinnung eines Modells des Einzelprozesses entspricht damit der Berechnung der iterativen Wurzel des Gesamtprozesses.
APA, Harvard, Vancouver, ISO, and other styles
2

Winqvist, David. "Augmenting communication channels toward the evolution of autonomous construction sites." Thesis, Blekinge Tekniska Högskola, Institutionen för maskinteknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-12752.

Full text
Abstract:
Context In the last centuries, we have been generating and building infrastructure at a faster pace than ever before. Simultaneously the costs for labor and construction sectors as road and house building is increasing. This provides room for autonomous machines. The development of infrastructure is accomplished through highly efficient and productive construction machinery that progressively modernizes to form the society. In order to increase the pace of development, both cars and industry are getting more and more automated. Volvo Construction Equipment is exploring the autonomous vehicle space. The new machines complement and perfect the human work with efficiency, reliability, and durability. There is however, a question of trust between the human workers and the autonomous machines, I will in this thesis investigate methods on how to develop trust through communication systems with autonomous machines.   Objectives To create recommendations and solutions for products that build trust between human and automated machines on a construction site.   Method Outcome is reached through a case study exploration with validated learning, meaning that it will incorporate learnings through prototype iterations.   Results The result evaluates how trust could be developed between humans and autonomous machinery at a construction site and how communication methods between these parties could be implemented while maintaining high levels of efficiency and safety.   Conclusion Findings in this thesis indicates that trust is developed over time with reliable systems that provide colleagues with updated information available at any time. The results can be introduced in both today’s and tomorrow’s construction sites at various levels of advanced technology.<br>Sammanhang De senaste hundra åren har vi gett upphov till att bygga infrastruktur i en snabbare takt än någonsin tidigare. Samtidigt ökar kostnaderna för både arbetskraft och byggsektorer som väg- och bostadsbyggnader. Denna situation ger utrymme för autonoma maskiner. Utvecklingen av infrastruktur sker genom effektiva och produktiva konstruktionsmaskiner som successivt moderniseras för att forma samhället. För att öka utvecklingstakten moderniseras både bilar och industri för att möta en mer automatiserad vardag.  Volvo Construction Equipment undersöker det autonoma fordonsutrymmet för nästa generations maskiner. Automationen kompletterar de nya maskinerna och fulländar det mänskliga arbetet med effektivitet, tillförlitlighet och hållbarhet.   Det finns dock en fråga om relationen mellan mänskliga arbetare och autonoma maskiner, jag kommer i denna avhandling undersöka metoder för hur man kan utveckla tillit genom kommunikationssystem mellan arbetare och autonoma maskiner.   Mål Att skapa rekommendationer och lösningar för produkter som bygger tillit mellan mänskliga och automatiserade maskiner på en byggarbetsplats.   Metod Resultatet uppnås genom användandet av fallstudie forskning kombinerat med validerande lärande. Detta innebär lärdomar med hjälp av en iterativ process utav prototyper som testas och valideras.   Resultat Resultatet utvärderar hur förtroende kan utvecklas mellan människor och autonoma maskiner på en byggarbetsplats. Hur kommunikationsmetoder mellan dessa parter skulle kunna genomföras samtidigt som hög effektivitet och säkerhet upprätthålls .   Slutsats Lärandet i denna avhandling tyder på att förtroendet utvecklas över tid med tillförlitliga system som ger medarbetare uppdaterad nödvändig information tillgänglig när som helst. Resultaten kan införas i både dagens och framtidens anläggningsplatser på olika nivåer av avancerad teknik.<br><p>Vissa delar är borttagan på grund av konfidentialitet.</p><br>ME310 Design Innovation at Stanford University
APA, Harvard, Vancouver, ISO, and other styles
3

Laaksonen, Tobias. "Värdet av iterativa designprocesser i teknikundervisning i grundskolan." Thesis, Uppsala universitet, Institutionen för teknikvetenskaper, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-266973.

Full text
Abstract:
This thesis aims to test whether students learn more technology, and become more interested in technology, by designing in iterative processes versus linear ones. The thesis has been conducted as a five-week field study, in which technology teachers have been provided with a teacher’s manual, lesson plans and teaching material especially adapted to a school project with iterative design as working method. Students and teachers have evaluated the project afterwards through an online survey. In total, seven teachers and approximately 300 students have participated in the field study. The thesis’ results can be summarized in the following conclusions; Students learn more, and become more interested in technology, if the education is conducted as team assignments in which the students use iterative design There is a difference between how much boys and girls perceive having learned from the iterative way of designing. Boys, to a higher degree than girls, think that they learn more from iterative design than from linear. There are also interesting results worth discussing further; The study suggests that it is important for students’ learning that the teacher is having fun teaching. There are no differences between boys and girls or different ages regarding how much fun the students had designing iteratively.
APA, Harvard, Vancouver, ISO, and other styles
4

Hanus, Pawel Grzegorz. "Examples and Applications of Infinite Iterated Function Systems." Thesis, University of North Texas, 2000. https://digital.library.unt.edu/ark:/67531/metadc2642/.

Full text
Abstract:
The aim of this work is the study of infinite conformal iterated function systems. More specifically, we investigate some properties of a limit set J associated to such system, its Hausdorff and packing measure and Hausdorff dimension. We provide necessary and sufficient conditions for such systems to be bi-Lipschitz equivalent. We use the concept of scaling functions to obtain some result about 1-dimensional systems. We discuss particular examples of infinite iterated function systems derived from complex continued fraction expansions with restricted entries. Each system is obtained from an infinite number of contractions. We show that under certain conditions the limit sets of such systems possess zero Hausdorff measure and positive finite packing measure. We include an algorithm for an approximation of the Hausdorff dimension of limit sets. One numerical result is presented. In this thesis we also explore the concept of positively recurrent function. We use iterated function systems to construct a natural, wide class of such functions that have strong ergodic properties.
APA, Harvard, Vancouver, ISO, and other styles
5

Kindermann, Lars. "Neuronale Netze zur Berechnung Iterativer Wurzeln und Fraktionaler Iterationen." [S.l. : s.n.], 2001. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10424174.

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

Al-Qaysi, Ibrahim, and Yonas Ghidei. "Tre-stegsmetod för att kvantifiera komplexitet för IT-förslag." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-188920.

Full text
Abstract:
Moderna företag är under ständig förändring. Företagen behöver således förändra, bygga ut och modifiera de applikationer som stödjer verksamheten. Att göra ändringar i arkitekturer på stora IT-system är inte heltbekymmerfritt. Det är ofta väldigt dyrt och tidskrävande. Problemet är att det inte finns några enkla metoder för att kvantifiera komplexitet på IT-förslag i tidigt skede av en implementation. Många verksamheter har således behov avatt kvantifiera komplexiteten på IT-förslag i deras beslutsprocess för att avgöra vilka system som är dyra och tidskrävande att implementera. Ett av dem är Sveriges militära försvarsorganisation, Försvarsmakten. Syftet förstudien blir sålunda att presentera en metod för att kvantifiera komplexitet och optimera implementation för IT-förslag. Målet för studien är därmed att presentera en modell som gör det möjligt för verksamheter att identifiera komplexa förslag som kan medföra onödiga projektrisker. Denna studie använder sig utav en kombination av kvalitativ och kvantitativ forskningsmetod med en induktiv forskningsansats. Studien evaluerar vilka olika sätt Försvarsmaktens mobilapplikation, FMTK kan implementeras på och vilken av implementationerna som är mest optimal beträffande komplexitet. Därefter presenteras resultatet för studien, Tre-stegsmetoden som inkorporerar den bästa implementationen. Slutligen drar studien slutsatsen, med hjälp av analyser och utvärderingar, att Tre-stegsmetoden är överlägsen andra metoder.<br>Modern enterprises are under constant change. Therefore, enterprises need to change, extend and modify the applications that support their businesses. Making changes in the architectures of large IT-systems however, are not straightforward. It is often very costly and time consuming. The problem is that there are no easy methods to quantify complexity and optimize an implementation in early phases of an application construction. Thus, many companies are in need of a method to quanitfy complexity of their IT-businessproposals in order to facilitate their decision-making process. One of them is the Swedish Armed Forces (sv. Försvarsmakten). The purpose of this study is therefore to present a simple method to quantify complexity and optimize implementation for IT-proposals. The purpose aligns with the goal, which is to present a model, which forms the basis for IT-proposals, for companies to consider in their process. This study uses a combination of a qualitative and quantitative research with an inductive research approach. Furthermore, this study evaluates in which ways Swedish Armed Forces application FMTK can be implemented and which implementations that are most optimal in terms of complexity. A method which incorporates the implementation is thereafter presented as a result of the study. Conclusively, the study shows with the help of analyses and evaluations that the presented method, namely the Three-stepmethod is superior to other methods.
APA, Harvard, Vancouver, ISO, and other styles
7

Ayob, Kibret. "Varumärkesstrategi på webben : Tillämpning av användarcentrerad design för positionering på webben." Thesis, Linnéuniversitetet, Institutionen för informatik (IK), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-48519.

Full text
Abstract:
Syfte: Företag har svårt att positionera sig på webben då de misslyckas att utveckla sina webbsidor för att stödja dess varumärkesstrategi. Syftet med denna studie är att undersöka hur ett företag kan tillämpa designstrategi ur ett användarcentrerat designperspektiv för att stödja företagets övergripande varumärkesstrategi på webben. Kunskapslucka: Denna studie har identifierat en kunskapslucka vad gäller hur företag fastställer och verkställer designstrategi för att stödja övergripande varumärkesstrategi på webben. Metod: Studien avser att undersöka tillämpning av designstrategi genom att ta fram ett designförslag som baserats på en användarcentrerad designprocess. För att göra detta har intervjuer med experter samt expertutvärdering av webbsidor utförts för att kartlägga en billeverantörs återförsäljares domän, baserat på motsvarande strategi för köpresa som är avsedd för att leda besökaren till billeverantörens produkt- och tjänsteutbud som representeras av återförsäljare och dess webbsidor. Denna datainsamling ligger till grund för persona och kontextscenarion som översätts till identifierade krav som motsvarar produktens designstrategi. Designstrategin ligger sedan till grund för det skapande momentet i den användarcentrerade designprocessen, där iterativ design leder till förädlande av framtagna ramverksskisser till interaktiv prototyp. Resultat och slutsats: Resultatet av studien som var en framtagen interaktiv prototyp visar att användarcentrerad design som tillämpar designstrategi, genom att fastställa företagets och användarens mål och behov samt innehålls- och funktionalitetskrav, är ett alternativ som tillåter strukturerad förädling av en webbsida till den punkt att webbsidan uppfyller sin designstrategi. Resultatet visar också att beroende på hur grundlig en kartläggning är och hur välformulerad designstrategin är påverkar hur väl framtagen webbsida, vare sig det är en prototyp eller slutprodukt, uppfyller sitt syfte.<br>Purpose: Corporations experience difficulties positioning themselves on the web as a result of not developing their websites in a way that is inline with their overall business strategy. The purpose of this study is to explore how corporations should apply design strategy, based on a user-centered design perspective, to support their overall business strategy on the web. Originality/value: This study has identified a knowledge gap in terms of how corporations define and apply design strategy in order to support their overall business strategy on the web. Methodology: This study aims to research the application of design strategy by creating a prototype through the use of a user-centered design process. This was done by interviewing experts as well as evaluating websites, in order to explore the domain of a car manufacturers retailers, which was based on the corresponding strategy of leading the visitor to the car manufacturers offerings that are represented by the retailers and their websites. This data collection was the foundation in the creation of a persona and context scenarios that was translated into identified needs that represented the products design strategy. The design strategy in turn was the foundation for the creating phase of the user-centered design process, where iterative design lead to refining framework sketches and an interactive prototype. Findings and conclusion: The study which resulted in an interactive prototype shows that user-centered design, which applies design strategy by defining the corporations and the users goals and needs, is an alternative that allows for structured refinement to the point that the website fulfills its design strategy. The results also show that depending on how well the domain exploration is executed as well as how well the design strategy is defined will affect the resulting website and to what extent it fulfills its purpose, whether it’s is still a prototype or if it’s the end result.
APA, Harvard, Vancouver, ISO, and other styles
8

Snyder, Jason Edward. "The Global Structure of Iterated Function Systems." Thesis, University of North Texas, 2009. https://digital.library.unt.edu/ark:/67531/metadc9917/.

Full text
Abstract:
I study sets of attractors and non-attractors of finite iterated function systems. I provide examples of compact sets which are attractors of iterated function systems as well as compact sets which are not attractors of any iterated function system. I show that the set of all attractors is a dense Fs set and the space of all non-attractors is a dense Gd set it the space of all non-empty compact subsets of a space X. I also investigate the small trans-finite inductive dimension of the space of all attractors of iterated function systems generated by similarity maps on [0,1].
APA, Harvard, Vancouver, ISO, and other styles
9

Reid, James Edward. "Numerical Values of the Hausdorff and Packing Measures for Limit Sets of Iterated Function Systems." Thesis, University of North Texas, 2017. https://digital.library.unt.edu/ark:/67531/metadc1011825/.

Full text
Abstract:
In the context of fractal geometry, the natural extension of volume in Euclidean space is given by Hausdorff and packing measures. These measures arise naturally in the context of iterated function systems (IFS). For example, if the IFS is finite and conformal, then the Hausdorff and packing dimensions of the limit sets agree and the corresponding Hausdorff and packing measures are positive and finite. Moreover, the map which takes the IFS to its dimension is continuous. Developing on previous work, we show that the map which takes a finite conformal IFS to the numerical value of its packing measure is continuous. In the context of self-similar sets, we introduce the super separation condition. We then combine this condition with known density theorems to get a better handle on finding balls of maximum density. This allows us to extend the work of others and give exact formulas for the numerical value of packing measure for classes of Cantor sets, Sierpinski N-gons, and Sierpinski simplexes.
APA, Harvard, Vancouver, ISO, and other styles
10

Lindström, Edvard, and Andréas Isaksson. "Hör-Ser-Gör : En utforskning inom ljudbaserade rörelsespel." Thesis, Blekinge Tekniska Högskola, Institutionen för teknik och estetik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-18284.

Full text
Abstract:
Detta kandidatarbete handlar om utforskningen inom alternativa ljudspelsformer. Vi ville utforska vilken ny kunskap som kan hämtas från spelljudsteori när den applicerades i ett ljudbaserat rörelsespel. Vi försöker uppnå detta genom en iterativ och experimentell designprocess. Vi skapade två olika ljudbaserade spelprototyper där vi applicerade olika spelljudsteorier. Genom att designa prototyper och analysera dem, genom induktivt resonemang och deltagande observation, kunde vi observera att spelaren kunde använda icke-visuella gränssnitt i ett ljudbaserat rörelsespel. Som resultat presenterar vi processens mest avgörande designproblem. Utmaningen med att utveckla icke-visuella gränssnitten var att instruera spelaren i att använda dem genom icke-vokala ljud. Vi presenterar även ett nytt sätt att förstå akusmatiska ljud i icke-visuella ljudbaserade spel. Som avslutande del så diskuteras undersökningens relevans och framtida undersökningsområden föreslås.<br>This bachelor thesis is about exploration within alternative forms of audio game. We wanted to explore what new knowledge could be extracted from game audio theory when it is applied to a movement based audio game. We aim to do this through an iterative and experimental design process. We created two different audio game prototypes where different game audio theories were applied. By designing prototypes and analyzing them, through inductive reasoning and participant observation, we could observe that players were able to use non-visual interfaces in an non-visual audio game. As our results we present the process’s most critical design problems. The challenge in creating these non-visual interfaces was instructing the player on how to use them through non-vocal audio. We also present a new way of understanding acousmatic sound in non-visual audio games. Lastly the study’s relevance is discussed and future research areas are suggested.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Iteratie"

1

1951-, Ésik Zoltán, ed. Iteration theories: The equational logic of iterative processes. Springer-Verlag, 1993.

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

Bloom, Stephen L. Iteration Theories: The Equational Logic of Iterative Processes. Springer Berlin Heidelberg, 1993.

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

Shen, Dong, and Xuefang Li. Iterative Learning Control for Systems with Iteration-Varying Trial Lengths. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6136-4.

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

LeVeque, Randall J. Fourier analysis of the SOR iteration. ICASE, 1986.

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

Chugg, Keith M., Achilleas Anastasopoulos, and Xiaopeng Chen. Iterative Detection. Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-1699-6.

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

Varga, Richard S. Matrix Iterative Analysis. Springer-Verlag Berlin Heidelberg, 2009.

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

Varga, Richard S. Matrix iterative analysis. 2nd ed. Springer Verlag, 2000.

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

Duflo, Marie. Random Iterative Models. Springer Berlin Heidelberg, 1997.

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

Axelsson, O. Iterative solution methods. Cambridge University Press, 1994.

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

Byrne, C. L. Applied iterative methods. AK Peters, 2008.

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

Book chapters on the topic "Iteratie"

1

Dekhtyar, Michael, Alexander Dikovsky, and Boris Karlov. "Iterated Dependencies and Kleene Iteration." In Formal Grammar. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-32024-8_5.

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

Shen, Dong, and Xuefang Li. "Introduction." In Iterative Learning Control for Systems with Iteration-Varying Trial Lengths. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6136-4_1.

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

Shen, Dong, and Xuefang Li. "CEF Techniques for Parameterized Nonlinear Continuous-Time Systems." In Iterative Learning Control for Systems with Iteration-Varying Trial Lengths. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6136-4_10.

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

Shen, Dong, and Xuefang Li. "CEF Techniques for Nonparameterized Nonlinear Continuous-Time Systems." In Iterative Learning Control for Systems with Iteration-Varying Trial Lengths. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6136-4_11.

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

Shen, Dong, and Xuefang Li. "CEF Techniques for Uncertain Systems with Partial Structure Information." In Iterative Learning Control for Systems with Iteration-Varying Trial Lengths. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6136-4_12.

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

Shen, Dong, and Xuefang Li. "Averaging Techniques for Linear Discrete-Time Systems." In Iterative Learning Control for Systems with Iteration-Varying Trial Lengths. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6136-4_2.

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

Shen, Dong, and Xuefang Li. "Averaging and Lifting Techniques for Linear Discrete-Time Systems." In Iterative Learning Control for Systems with Iteration-Varying Trial Lengths. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6136-4_3.

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

Shen, Dong, and Xuefang Li. "Moving Averaging Techniques for Linear Discrete-Time Systems." In Iterative Learning Control for Systems with Iteration-Varying Trial Lengths. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6136-4_4.

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

Shen, Dong, and Xuefang Li. "Switching System Techniques for Linear Discrete-Time Systems." In Iterative Learning Control for Systems with Iteration-Varying Trial Lengths. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6136-4_5.

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

Shen, Dong, and Xuefang Li. "Two-Dimensional Techniques for Linear Discrete-Time Systems." In Iterative Learning Control for Systems with Iteration-Varying Trial Lengths. Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-13-6136-4_6.

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

Conference papers on the topic "Iteratie"

1

Gutfinger, Ron S., and Raj Abraham. "Subsmoothing: An Optimized Smoothing Method." In ASME 1993 International Computers in Engineering Conference and Exposition. American Society of Mechanical Engineers, 1993. http://dx.doi.org/10.1115/cie1993-0014.

Full text
Abstract:
Abstract Usually, a mesh created by an automatic mesh generator is of low quality. In order to improve the mesh quality, a smoothing algorithm is applied on the mesh. The result is a mesh ready for analysis. The smoothing is a CPU intensive iterative process. In some cases, smoothing may take longer than the initial mesh creation. In this work an optimized smoothing algorithm is presented. While iterating, the algorithm recognizes nodes that are sufficiently smoothed, and ignores them in subsequent iterations. Progressively, a smaller and smaller subset of nodes is smoothed. The result is less CPU time spent per iteration, and some decrease in the total number of iterations. This method, called subsmoothing, is applied on Laplacian smoothing of shell meshes. Examples show 30% CPU time savings and little change in mesh quality (¼%).
APA, Harvard, Vancouver, ISO, and other styles
2

Ebong, Idongesit E., and Pinaki Mazumder. "Iterative architecture for value iteration using memristors." In 2014 IEEE 14th International Conference on Nanotechnology (IEEE-NANO). IEEE, 2014. http://dx.doi.org/10.1109/nano.2014.6967997.

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

Cameron, T. M., and J. H. Griffin. "A New Method for Optimizing Friction Damping in Randomly Excited Systems." In ASME 1989 International Gas Turbine and Aeroengine Congress and Exposition. American Society of Mechanical Engineers, 1989. http://dx.doi.org/10.1115/89-gt-108.

Full text
Abstract:
A method is developed that can be used to calculate the stationary response of randomly excited nonlinear systems. The method iterates to obtain the fast Fourier transform of the system response, returning to the time domain at each iteration to take advantage of the ease in evaluating nonlinearities there. The updated estimates of the nonlinear terms are transformed back into the frequency domain in order to continue iterating on the frequency spectrum of the staionary response. This approach is used to calculate the response of a one degree of freedom system with friction damping that is subjected to random excitation. The one degree of freedom system provides a single mode approximation of systems (e.g. turbine blades) with friction damping. This study investigates various strategies that can be used to optimize the friction load so as to minimize the response of the system.
APA, Harvard, Vancouver, ISO, and other styles
4

Safoutin, Michael J., and Robert P. Smith. "Classification of Iteration in Engineering Design Processes." In ASME 1998 Design Engineering Technical Conferences. American Society of Mechanical Engineers, 1998. http://dx.doi.org/10.1115/detc98/dtm-5672.

Full text
Abstract:
Abstract As engineering design is subjected to increasingly formal study, an informal attitude continues to surround the topic of iteration. Today there is no standard definition or typology of iteration, no grounding theory, few metrics, and a poor understanding of its role in the design process. Existing literature provides little guidance in investigating issues of design that might be best approached in terms of iteration. We review contributions of existing literature toward the understanding of iteration in design, develop a classification of design iteration, compare iterative aspects of human and automated design, and draw some conclusions concerning management of iteration and approaches to design automation.
APA, Harvard, Vancouver, ISO, and other styles
5

Eckert, Claudia M., Ola Isaksson, and Chris F. Earl. "Design Margins as a Key to Understanding Design Iteration." In ASME 2014 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2014. http://dx.doi.org/10.1115/detc2014-34275.

Full text
Abstract:
Design processes are subject to many uncertainties. Changes resulting from the need to respond to external uncertainties are one of the main drivers of engineering change and therefore for iteration in design processes. Another important cause of iteration in design processes arises from the dependencies in design information which is being generated as part of the design process itself. At the beginning of the design process engineers need to make an informed guess about the values of parameters that they need and can achieve. These values are passed on to others, who base their decisions on them. Design decisions are distributed and iterative among design teams, customers and suppliers. Communicated parameter values are uncertain in two different but related ways. First, there is the confidence, precision and commitment that the designers have in the values they specify. Second there are uncertainties in the values that can be achieved with the technology the new design employs. These issues become particularly challenging when they span design teams, customers and suppliers as they iterate to converge on a mutually effective solution. This paper looks at this type of convergent iteration through an example from the aerospace industry, which illustrates how uncertainty in operating temperature at the beginning of the design process requires a thorough understanding of the temperature ranges that solution alternatives, at different degrees of maturity, can operate under. This paper argues that the key to managing convergent iterations lies in communicating the available ranges of parameter values and in understanding how design margins have arisen in existing technologies. These margins on product parameters provide potential performance which exceeds immediate functional requirements. The paper develops and formalizes the concept of design margins and argues that margins are included into products for a variety of reasons that are not always transparent to different team members. Analysis of margins enables design companies to reason in terms of ranges of values describing the scope for design change in meeting customer and supplier requirements without being forced into unplanned iteration loops.
APA, Harvard, Vancouver, ISO, and other styles
6

Kim, Byung-Hak, Arvind Yedla, and Henry D. Pfister. "IMP: A message-passing algorithm for matrix completion." In Iterative Information Processing (ISTC). IEEE, 2010. http://dx.doi.org/10.1109/istc.2010.5613803.

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

Geldmacher, Jan, Klaus Hueske, Juergen Goetze, and Sascha Bialas. "Adaptive low complexity MAP decoding for turbo equalization." In Iterative Information Processing (ISTC). IEEE, 2010. http://dx.doi.org/10.1109/istc.2010.5613804.

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

Duyck, Dieter, Marc Moeneclaey, Marwan H. Azmi, Jinhong Yuan, and Joseph J. Boutros. "Universal LDPC codes for cooperative communications." In Iterative Information Processing (ISTC). IEEE, 2010. http://dx.doi.org/10.1109/istc.2010.5613805.

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

Marinoni, Andrea, Pietro Savazzi, and Richard D. Wesel. "Protograph-based q-ary LDPC codes for higher-order modulation." In Iterative Information Processing (ISTC). IEEE, 2010. http://dx.doi.org/10.1109/istc.2010.5613806.

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

Ravazzi, Chiara, and Fabio Fagnani. "Minimum distance properties of multiple-serially concatenated codes." In Iterative Information Processing (ISTC). IEEE, 2010. http://dx.doi.org/10.1109/istc.2010.5613807.

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

Reports on the topic "Iteratie"

1

Pearson, Darren L., Jeffry S. Schumm, Jr Jones, Tour LeRoy, and James M. Potential Molecular Wires by an Iterative Divergent/Convergent Approach. Doubling of Molecular Length at Each Iteration. Defense Technical Information Center, 1994. http://dx.doi.org/10.21236/ada281292.

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

Shimeall, Timothy J., and Stephen C. Shimeall. Iterative Software Testing. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada255953.

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

Makarov, Yuri V., Bharat Vyakaranam, Zhangshuan Hou, et al. Non-iterative Voltage Stability. Office of Scientific and Technical Information (OSTI), 2014. http://dx.doi.org/10.2172/1179145.

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

Tseng, Lewis, and Nitin Vaidya. Parameter-independent Iterative Approximate Byzantine Consensus. Defense Technical Information Center, 2012. http://dx.doi.org/10.21236/ada564307.

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

Charest Jr., Michael R., and Peyman Milanfar. On Iterative Regularization and Its Application. Defense Technical Information Center, 2007. http://dx.doi.org/10.21236/ada469424.

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

Muscettola, Nicola. Scheduling by Iterative Partition of Bottleneck Conflicts. Defense Technical Information Center, 1992. http://dx.doi.org/10.21236/ada255839.

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

Chow, Edmond. Asynchronous Iterative Solvers for Extreme-Scale Computing. Office of Scientific and Technical Information (OSTI), 2021. http://dx.doi.org/10.2172/1756100.

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

Cai, X.-C. Scalable nonlinear iterative methods for partial differential equations. Office of Scientific and Technical Information (OSTI), 2000. http://dx.doi.org/10.2172/15013129.

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

Foulser, David E. Highly Parallel Iterative Methods for Massively Parallel Multiprocessors. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada206305.

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

Shiau, Tzong H. Iterative Methods for Linear Complementary and Related Problems. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada212848.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography