Journal articles: 'Iterative change'

1

Song, Ahram, Jaewan Choi, Anjin Chang, and Yongil Kim. "Change Detection Using Spectral Unmixing and IEA(Iterative Error Analysis) for Hyperspectral Images." Korean Journal of Remote Sensing 31, no. 5 (October 30, 2015): 361–70. http://dx.doi.org/10.7780/kjrs.2015.31.5.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Fasola, Salvatore, Vito M. R. Muggeo, and Helmut Küchenhoff. "A heuristic, iterative algorithm for change-point detection in abrupt change models." Computational Statistics 33, no. 2 (June 10, 2017): 997–1015. http://dx.doi.org/10.1007/s00180-017-0740-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Lu, Yu Song, and Wu Sheng Wang. "Two Iterative Discrete Inequalities." Advanced Materials Research 889-890 (February 2014): 579–82. http://dx.doi.org/10.4028/www.scientific.net/amr.889-890.579.

Full text

Abstract:

In this paper, two discrete inequalities with iterative summation are discussed. By technique of change of variable, comparison principle, amplification method, difference and summation, upper bound estimations of unknown functions are given. The derived results can be applied in the study of solutions of difference equations.

APA, Harvard, Vancouver, ISO, and other styles

4

Cao, Wei, Jinjie Qiao, and Ming Sun. "Iterative Learning Control for Switched Systems with Sensor Saturation Constraints." Journal of Sensors 2021 (June 4, 2021): 1–11. http://dx.doi.org/10.1155/2021/6670048.

Full text

Abstract:

To solve trajectory tracking problem of switched system with sensor saturation, an iterative learning control algorithm is proposed. The method uses actual measurement error to modify the control variable of system on the premise that switched rule does not change along iteration axis, but it randomly changes along time axis. Moreover, by dealing with the saturation via diagonal matrix method, the convergence of the algorithm is strictly proved in the sense of λ-norm, and the convergence condition is derived. The algorithm can achieve complete tracking of desired trajectory in the finite time interval under the random switched rule, as iterations increase. The simulation example verifies the validity of the proposed algorithm.

APA, Harvard, Vancouver, ISO, and other styles

5

Xu, Shuwen, Yan Liao, Xueying Yan, and Gang Zhang. "Change detection in SAR images based on iterative Otsu." European Journal of Remote Sensing 53, no. 1 (January 1, 2020): 331–39. http://dx.doi.org/10.1080/22797254.2020.1852606.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kasibhatla, R. R., and D. Brüggemann. "Smoothed iterative enthalpy approach for solid-liquid phase change." International Journal of Thermal Sciences 152 (June 2020): 106187. http://dx.doi.org/10.1016/j.ijthermalsci.2019.106187.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Showstack, Randy. "Climate change report calls for iterative risk management framework." Eos, Transactions American Geophysical Union 92, no. 21 (May 24, 2011): 178–79. http://dx.doi.org/10.1029/2011eo210002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Liu, Shaozhe, Zuojun Liu, Jie Zhang, and Dong Hu. "An Experience Transfer Approach for the Initial Data of Iterative Learning Control." Applied Sciences 11, no. 4 (February 11, 2021): 1631. http://dx.doi.org/10.3390/app11041631.

Full text

Abstract:

Iterative learning control (ILC) requires that the operating conditions of the controlled system must remain unchanged in the repetitive learning process. If the parameters of system change, the former control experience of ILC would not be effective anymore. A new process of iterative learning has to restart, which will exhaust more time and resource. Compared with learning from zero experience, appropriate initial data for the first iteration could reduce the turns of iterations to achieve the target tracking accuracy. When the parameters of a linear system change, its structure and nature are still intrinsically related to the original system. So, if the experience obtained from original ILC could be correspondingly adjusted according to the difference of new and original system, and use the adjusted experience as the initial data in the new iterative learning process, it would reduce the time and save the resource in the new ILC. Based on the idea of experience inheritance and transform, an experience transfer approach for the initial data of ILC is proposed in reference to the relation between the new and original systems. In this paper, via the method of recombining, translational and amplitude adjusting, the experience of former ILC is transferred as the initial control data of new ILC. Simulation shows that the convergence iteration of ILC with experience transfer approach reduces 55–75%, which demonstrates the effectiveness and advantages of the approach proposed in this paper. Both the deviation of the first iteration in ILC and the turns of iterations for achieving desired accuracy are reduced greatly.

APA, Harvard, Vancouver, ISO, and other styles

9

Collignon, TP, and MB van Gijzen. "Fast iterative solution of large sparse linear systems on geographically separated clusters." International Journal of High Performance Computing Applications 25, no. 4 (January 31, 2011): 440–50. http://dx.doi.org/10.1177/1094342010388541.

Full text

Abstract:

Parallel asynchronous iterative algorithms exhibit features that are extremely well-suited for Grid computing, such as lack of synchronization points. Unfortunately, they also suffer from slow convergence rates. In this paper we propose using asynchronous methods as a coarse-grained preconditioner in a flexible iterative method, where the preconditioner is allowed to change in each iteration step. A full implementation of the algorithm is presented using Grid middleware that allows for both synchronous and asynchronous communication. Advantages and disadvantages of the approach are discussed. Numerical experiments on heterogeneous computing hardware demonstrate the effectiveness of the proposed algorithm on Grid computers, with application to large 2D and 3D bubbly flow problems.

APA, Harvard, Vancouver, ISO, and other styles

10

Stahovich, Thomas F. "LearnIT: An Instance-Based Approach to Learning and Reusing Design Strategies." Journal of Mechanical Design 122, no. 3 (September 1, 1999): 249–56. http://dx.doi.org/10.1115/1.1288216.

Full text

Abstract:

We describe LearnIT, a computer program that can observe an iterative solution to a parametric design problem and learn the design strategy employed. When the design requirements change, the program uses the learned strategy to automatically generate a new solution in the “style” of the original. The program uses a specialized instance-based learning method based on the observation that iterative design is often a form of debugging—each iteration is an attempt to repair a particular flaw in the design. Thus, the program learns the design strategy by observing what actions are taken in response to each kind of flaw. [S1050-0472(00)01203-4]

APA, Harvard, Vancouver, ISO, and other styles

11

Irsal, Muhammad, Nurbaiti Nurbaiti, Aulia Narendra Mukhtar, Shinta Gunawati, and Wahyu Hidayat. "Pengaruh Tegangan Tabung terhadap Kualitas Citra pada Pemeriksaan Computed Tomography Kepala menggunakan Iterative Reconstruction." Jurnal Teori dan Aplikasi Fisika 9, no. 1 (January 31, 2021): 103–10. http://dx.doi.org/10.23960/jtaf.v9i1.2715.

Full text

Abstract:

Iterative reconstruction can optimize radiation dose and improve image quality on CT scan. This research method is quantitative analytic with the analysis of the results of the head CT examination parameters associated with image quality to changes in variations of 80 kV, 100 kV, 120 kV with the use of iterative reconstruction. Image quality measurements are the Hounsfield Unit (HU) value, standard deviation, and Signal to Noise Ratio (SNR) using Radiant Viewers. Effective dose measurement using the Dose Length Product (DLP). Then perform the Kruskal Wallis test to find out whether there is an effect of tube voltage and Iterative Reconstruction on the SNR value using IBM SPSS version 24. The results image quality of the HU value increase due to changes in the kV value, but the value does not change significantly when the iDose changes, for the standard The deviation has decreased due to changes in kV, but the value of the value does not experience a significant change at the time of change in iDose, while SNR increases due to changes in kV value and changes in iDose. The percentage ratio of the effective dose in the use of standard kV with 80 kV decreased radiation dose by 62%, while at 100 kV there was a decrease of 25%, and the use of 120 kV experienced an increase of 25%. The results of the Kruskal Wallis test p-value <0.001, therefore it can be concluded that there is a difference in the SNR image quality at each change in iDose and kV parameters.

APA, Harvard, Vancouver, ISO, and other styles

12

Hosseiny and Smith. "Two Dimensional Model for Backwater Geomorphology: Darby Creek, PA." Water 11, no. 11 (October 23, 2019): 2204. http://dx.doi.org/10.3390/w11112204.

Full text

Abstract:

Predicting morphological alterations in backwater zones has substantial merit as it potentially influences the life of millions of people by the change in flood dynamics and land topography. While there is no two-dimensional river model available for predicting morphological alterations in backwater zones, there is an absolute need for such models. This study presents an integrated iterative two-dimensional fluvial morphological model to quantify spatio-temporal fluvial morphological alterations in normal flow to backwater conditions. The integrated model works through the following steps iteratively to derive geomorphic change: (1) iRIC model is used to generate a 2D normal water surface; (2) a 1D water surface is developed for the backwater; (3) the normal and backwater surfaces are integrated; (4) an analytical 2D model is established to estimate shear stresses and morphological alterations in the normal, transitional, and backwater zones. The integrated model generates a new digital elevation model based on the estimated erosion and deposition. The resultant topography then serves as the starting point for the next iteration of flow, ultimately modeling geomorphic changes through time. This model was tested on Darby Creek in Metro-Philadelphia, one of the most flood-prone urban areas in the US and the largest freshwater marsh in Pennsylvania.

APA, Harvard, Vancouver, ISO, and other styles

13

Lee, SangHyun, and Feniosky Peña-Mora. "Understanding and managing iterative error and change cycles in construction." System Dynamics Review 23, no. 1 (2007): 35–60. http://dx.doi.org/10.1002/sdr.359.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Carr *, Shirley, and M. R. Mathews †. "Accounting curriculum change and iterative programme development: a case study." Accounting Education 13, sup1 (December 2004): 91–116. http://dx.doi.org/10.1080/0963928042000310814.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Orben, Amy, Netta Weinstein, and Andrew K. Przybylski. "Only Holistic and Iterative Change Will Fix Digital Technology Research." Psychological Inquiry 31, no. 3 (July 2, 2020): 235–41. http://dx.doi.org/10.1080/1047840x.2020.1820221.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Jacobs, Megan A., and Amanda L. Graham. "Iterative development and evaluation methods of mHealth behavior change interventions." Current Opinion in Psychology 9 (June 2016): 33–37. http://dx.doi.org/10.1016/j.copsyc.2015.09.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Lev, Omer, and Jeffrey S. Rosenschein. "Convergence of Iterative Scoring Rules." Journal of Artificial Intelligence Research 57 (December 11, 2016): 573–91. http://dx.doi.org/10.1613/jair.5187.

Full text

Abstract:

In multiagent systems, social choice functions can help aggregate the distinct preferences that agents have over alternatives, enabling them to settle on a single choice. Despite the basic manipulability of all reasonable voting systems, it would still be desirable to find ways to reach plausible outcomes, which are stable states, i.e., a situation where no agent would wish to change its vote. One possibility is an iterative process in which, after everyone initially votes, participants may change their votes, one voter at a time. This technique, explored in previous work, converges to a Nash equilibrium when Plurality voting is used, along with a tie-breaking rule that chooses a winner according to a linear order of preferences over candidates. In this paper, we both consider limitations of the iterative voting method, as well as expanding upon it. We demonstrate the significance of tie-breaking rules, showing that no iterative scoring rule converges for all tie-breaking. However, using a restricted tie-breaking rule (such as the linear order rule used in previous work) does not by itself ensure convergence. We prove that in addition to plurality, the veto voting rule converges as well using a linear order tie-breaking rule. However, we show that these two voting rules are the only scoring rules that converge, regardless of tie-breaking mechanism.

APA, Harvard, Vancouver, ISO, and other styles

18

YEE, H. C., and P. K. SWEBY. "GLOBAL ASYMPTOTIC BEHAVIOR OF ITERATIVE IMPLICIT SCHEMES." International Journal of Bifurcation and Chaos 04, no. 06 (December 1994): 1579–611. http://dx.doi.org/10.1142/s0218127494001210.

Full text

Abstract:

The global asymptotic nonlinear behavior of some standard iterative procedures in solving nonlinear systems of algebraic equations arising from four implicit linear multistep methods (LMMs) in discretizing three models of 2×2 systems of first-order autonomous nonlinear ordinary differential equations (ODEs) is analyzed using the theory of dynamical systems. The iterative procedures include simple iteration and full and modified Newton iterations. The results are compared with standard Runge-Kutta explicit methods, a noniterative implicit procedure, and the Newton method of solving the steady part of the ODEs. Studies showed that aside from exhibiting spurious asymptotes, all of the four implicit LMMs can change the type and stability of the steady states of the differential equations (DEs). They also exhibit a drastic distortion but less shrinkage of the basin of attraction of the true solution than standard nonLMM explicit methods. The simple iteration procedure exhibits behavior which is similar to standard nonLMM explicit methods except that spurious steady-state numerical solutions cannot occur. The numerical basins of attraction of the noniterative implicit procedure mimic more closely the basins of attraction of the DEs and are more efficient than the three iterative implicit procedures for the four implicit LMMs. Contrary to popular belief, the initial data using the Newton method of solving the steady part of the DEs may not have to be close to the exact steady state for convergence. These results can be used as an explanation for possible causes and cures of slow convergence and nonconvergence of steady-state numerical solutions when using an implicit LMM time-dependent approach in computational fluid dynamics.

APA, Harvard, Vancouver, ISO, and other styles

19

Dietze, Michael C., Andrew Fox, Lindsay M. Beck-Johnson, Julio L. Betancourt, Mevin B. Hooten, Catherine S. Jarnevich, Timothy H. Keitt, et al. "Iterative near-term ecological forecasting: Needs, opportunities, and challenges." Proceedings of the National Academy of Sciences 115, no. 7 (January 30, 2018): 1424–32. http://dx.doi.org/10.1073/pnas.1710231115.

Full text

Abstract:

Two foundational questions about sustainability are “How are ecosystems and the services they provide going to change in the future?” and “How do human decisions affect these trajectories?” Answering these questions requires an ability to forecast ecological processes. Unfortunately, most ecological forecasts focus on centennial-scale climate responses, therefore neither meeting the needs of near-term (daily to decadal) environmental decision-making nor allowing comparison of specific, quantitative predictions to new observational data, one of the strongest tests of scientific theory. Near-term forecasts provide the opportunity to iteratively cycle between performing analyses and updating predictions in light of new evidence. This iterative process of gaining feedback, building experience, and correcting models and methods is critical for improving forecasts. Iterative, near-term forecasting will accelerate ecological research, make it more relevant to society, and inform sustainable decision-making under high uncertainty and adaptive management. Here, we identify the immediate scientific and societal needs, opportunities, and challenges for iterative near-term ecological forecasting. Over the past decade, data volume, variety, and accessibility have greatly increased, but challenges remain in interoperability, latency, and uncertainty quantification. Similarly, ecologists have made considerable advances in applying computational, informatic, and statistical methods, but opportunities exist for improving forecast-specific theory, methods, and cyberinfrastructure. Effective forecasting will also require changes in scientific training, culture, and institutions. The need to start forecasting is now; the time for making ecology more predictive is here, and learning by doing is the fastest route to drive the science forward.

APA, Harvard, Vancouver, ISO, and other styles

20

Wilkerson, Jerod W. "A Source Code Change Impact Analysis Algorithm for Iterative Software Development." International Journal of Decision Support System Technology 4, no. 4 (October 2012): 60–75. http://dx.doi.org/10.4018/jdsst.2012100104.

Full text

Abstract:

CHA-AS is a source code change impact analysis algorithm for Java programs. CHA-AS differs from other algorithms in that it does not require the program versions it compares to be whole programs with a well-defined program entry point. The need for such an algorithm is evident in iterative software development projects and projects involving the development of code libraries and frameworks—all of which may not have a well-defined program entry point at the time when change impact analysis needs to be performed. The CHA-AS algorithm supports the development of Decision Support Systems for software development managers and programmers working on iterative software development projects, or projects to develop source code libraries and frameworks. This paper describes the CHA-AS algorithm and demonstrates it to be efficient and effective in calculating source code change impact.

APA, Harvard, Vancouver, ISO, and other styles

21

Geary, Dana H., Andrew W. Staley, Pál Müller, and Imre Magyar. "Iterative changes in Lake Pannon Melanopsis reflect a recurrent theme in gastropod morphological evolution." Paleobiology 28, no. 2 (2002): 208–21. http://dx.doi.org/10.1666/0094-8373(2002)028<0208:icilpm>2.0.co;2.

Full text

Abstract:

Iterative evolutionary changes are of special interest because they imply that the recurring morphological changes had a cause that also repeated itself and might therefore be possible to uncover. We describe a set of iterative morphological changes in melanopsid gastropods from the ancient, long-lived Lake Pannon. First in the Pannonian Age, and again in the Pontian Age approximately three million years later, a smooth-shelled ancestor gave rise to a shouldered descendant. In both cases, the morphological change was probably coincident with a shift from habitats just outside the lake (e.g., rivers and streams) to habitats within the lake itself. Many other convergent examples exist in which a smooth-shelled river dweller is closely related to a shouldered and/or ribbed lacustrine snail. The frequency of this type of morphological change suggests that it has an adaptive basis; response to differing predators or hydrodynamic conditions seem the most plausible explanations, but the functional nature of these morphological changes remains unknown.

APA, Harvard, Vancouver, ISO, and other styles

22

Williams, M. A., and D. G. Wilson. "Iterative Solution of a Nonlinear System Arising in Phase-Change Problems." SIAM Journal on Scientific and Statistical Computing 11, no. 6 (November 1990): 1087–101. http://dx.doi.org/10.1137/0911061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Schuh, G., J. P. Prote, M. Luckert, F. Basse, V. Thomson, and W. Mazurek. "Adaptive Design of Engineering Change Management in Highly Iterative Product Development." Procedia CIRP 70 (2018): 72–77. http://dx.doi.org/10.1016/j.procir.2018.02.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Hedjam, Rachid, Margaret Kalacska, Max Mignotte, Hossein Ziaei Nafchi, and Mohamed Cheriet. "Iterative Classifiers Combination Model for Change Detection in Remote Sensing Imagery." IEEE Transactions on Geoscience and Remote Sensing 54, no. 12 (December 2016): 6997–7008. http://dx.doi.org/10.1109/tgrs.2016.2593982.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Marolla, Filippo, John‐André Henden, Eva Fuglei, Åshild Ø. Pedersen, Mikhail Itkin, and Rolf A. Ims. "Iterative model predictions for wildlife populations impacted by rapid climate change." Global Change Biology 27, no. 8 (January 28, 2021): 1547–59. http://dx.doi.org/10.1111/gcb.15518.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Queller, Sarah. "Stereotype Change in a Recurrent Network." Personality and Social Psychology Review 6, no. 4 (November 2002): 295–303. http://dx.doi.org/10.1207/s15327957pspr0604_04.

Full text

Abstract:

Stereotype change is simulated in a distributed recurrent network. Although it operates using iterative application of simple learning rules as each new group member is presented, the network can nonetheless mimic both bookkeeping (Rothbart, 1981) and subtyping (Brewer, 1981; Taylor, 1981) patterns of results. It produces these effects through learning of reliable covariations between counterstereotypic units. Advantages and disadvantages of using a distributed recurrent network to model the representation of stereotypes are discussed. Key among the advantages are those relevant to the dynamic nature of these models.

APA, Harvard, Vancouver, ISO, and other styles

27

Shin, Changsoo, Kurt J. Marfurt, Kwon Gyu Park, Dong‐Joo Min, Kwangjin Yoon, Dongwoo Yang, Taeyoung Ha, Seungwon Ko, Wonsik Kim, and Soonduk Hong. "Traveltime and amplitude calculation using a perturbation approach." GEOPHYSICS 67, no. 5 (September 2002): 1648–55. http://dx.doi.org/10.1190/1.1512812.

Full text

Abstract:

Accurate amplitudes and correct traveltimes are critical factors that govern the quality of prestack migration images. Because we never know the correct velocity initially, recomputing traveltimes and amplitudes of updated velocity models can dominate the iterative prestack migration procedure. Most tomographic velocity updating techniques require the calculation of the change of traveltime due to local changes in velocity. For such locally updated velocity models, perturbation techniques can be a significantly more economic way of calculating traveltimes and amplitudes than recalculating the entire solutions from scratch. In this paper, we implement an iterative Born perturbation theory applied to the damped wave equation algorithm. Our iterative Born perturbation algorithm yields stable solutions for models having velocity contrasts of 30% about the initial velocity estimate, which is significantly more economic than recalculating the entire solution.

APA, Harvard, Vancouver, ISO, and other styles

28

Taqwiym, Akhsani. "PENERAPAN METODE ITERATIVE PADA PERANCANGAN SISTEM PEMBUKUAN PENJUALAN PT.XYZ." Jurnal Sisfokom (Sistem Informasi dan Komputer) 9, no. 2 (July 28, 2020): 254. http://dx.doi.org/10.32736/sisfokom.v9i2.895.

Full text

Abstract:

Bookkeeping is an activity carried out by entrepreneurs and businesspeople whose purpose is to record, document transaction activities that occur in business and business processes which then from bookkeeping results are one of the factors in decision making. Recording manually for the time being is felt to be ineffective due to the difficulty of finding transaction data, there is the possibility of human error, lack of efficient storage of documentation, and lack of management in the use of time so that interfere with performance in making bookkeeping. The solution to this problem is to change the manual method to computerized. The method used is the iteration method, application design that is designed is a database-based websitebased application. By using the iterative method, the results are in accordance with the needs and the resolution of problems that occur at PT. XYZ The purpose of designing bookkeeping sales is to be a solution to the problems that occur at PT. XYZ, helps in making notes and bookkeeping automatically, helps store data to be more time efficient and neat. The benefit of iterative reengineering is the change of the manual recording system to a new system by not disrupting the system user in carrying out the sales recordkeeping process. One of the advantages of using iterative methods is the shorter operational time and costs incurred in designing small systems when converted into requirements. From the application of the interactive method, it is obtained that the application designed can help in making notes faster and the data will be stored automatically and correctly. Data storage will be entered into books which can then be accessed by leaders and parties who need the information as needed.

APA, Harvard, Vancouver, ISO, and other styles

29

Zhao, Jianping, Yanren Hou, Haibiao Zheng, and Bo Tang. "A New Iterative Method for Linear Systems from XFEM." Mathematical Problems in Engineering 2014 (2014): 1–8. http://dx.doi.org/10.1155/2014/367802.

Full text

Abstract:

The extend finite element method (XFEM) is popular in structural mechanics when dealing with the problem of the cracked domains. XFEM ends up with a linear system. However, XFEM usually leads to nonsymmetric and ill-conditioned stiff matrix. In this paper, we take the linear elastostatics governing equations as the model problem. We propose a new iterative method to solve the linear equations. Here we separate two variablesUand Enr, so that we change the problems into solving the smaller scale equations iteratively. The new program can be easily applied. Finally, numerical examples show that the proposed method is more efficient than common methods; we compare theL2-error and the CPU time in whole process. Furthermore, the new XFEM can be applied and optimized in many other problems.

APA, Harvard, Vancouver, ISO, and other styles

30

Vasilyeva, Maria, Dmitry Ammosov, and Vasily Vasil’ev. "Finite Element Simulation of Thermo-Mechanical Model with Phase Change." Computation 9, no. 1 (January 15, 2021): 5. http://dx.doi.org/10.3390/computation9010005.

Full text

Abstract:

In this work, we consider a mathematical model and finite element implementation of heat transfer and mechanics of soils with phase change. We present the construction of the simplified mathematical model based on the definition of water and ice fraction volumes as functions of temperature. In the presented mathematical model, the soil deformations occur due to the porosity growth followed by the difference between ice and water density. We consider a finite element discretization of the presented thermoelastic model with implicit time approximation. Implementation of the presented basic mathematical model is performed using FEniCS finite element library and openly available to download. The results of the numerical investigation are presented for the two-dimensional and three-dimensional model problems for two test cases in three different geometries. We consider algorithms with linearization from the previous time layer (one Picard iteration) and the Picard iterative method. Computational time is presented with the total number of nonlinear iterations. A numerical investigation with results of the convergence of the nonlinear iteration is presented for different time step sizes, where we calculate relative errors for temperature and displacements between current solution and reference solution with the largest number of the time layers. Numerical results illustrate the influence of the porosity change due to the phase-change of pore water into ice on the deformation of the soils. We observed a good numerical convergence of the presented implementation with the small number of nonlinear iterations, that depends on time step size.

APA, Harvard, Vancouver, ISO, and other styles

31

Papazian, John M. "Tools of Change." Mechanical Engineering 124, no. 02 (February 1, 2002): 52–55. http://dx.doi.org/10.1115/1.2002-feb-4.

Full text

Abstract:

This article discusses reconfigurable forming dies that increases the efficiency of small-lot production. Manufacturers have long desired single universal tools that could make many different shapes. Patents for reconfigurable “discrete-die” tooling—dies composed of movable elements such as pins or plates—date back nearly to the inception of the patent office. In forming large sheet metal parts, elastic springback can cause unacceptable part shape errors if the part is formed on a tool whose shape mirrors that of the finished part. Two approaches to tool shape correction have been developed for use with the reconfigurable tool. In one, an iterative technique calculates the correct die shape based on two initial guesses. In the other, a predictive technique uses finite element analysis to model and correct for elastic springback. Cost and benefit analysis has shown the attractiveness of reconfigurable tooling based on the initial investment alone. An even greater benefit could be realized through lowered assembly costs and shortened turnaround time for small production lots. Small-lot production shops are likely to profit by replacing fixed-shape forming tools with reconfigurable tools.

APA, Harvard, Vancouver, ISO, and other styles

32

Gelman, V. Ya. "On using an iterative learning approach." Alma mater. Vestnik Vysshey Shkoly, no. 10 (October 2020): 41–45. http://dx.doi.org/10.20339/am.10-20.041.

Full text

Abstract:

Investigated are possibilities and features of using the iterative approach, when teaching at university. The article reviews and analyzes data of scientific publications and generalized practical experience. It is shown, that the iterative approach naturally follows from modern teaching concept: “self-study — solution — check — correction”. The importance of closing feedback loop and multiple attempts to obtain correct solution in an iterative approach is noted. Considered is change in the role of teacher in the context of the iterative approach; features of self-study by students of educational material, organization of checking correctness of the task, problems of creating necessary motivation for learning and possibility of transition to distance learning. It is shown, that the iterative approach contributes to individualization of teaching, improving degree of understanding of educational material and development of students’ thinking. In addition, the iterative approach facilitates formation of skills and abilities to rationally organize educational activities and self-master knowledge. The conclusion is made about effectiveness of using the iterative approach in university educational process.

APA, Harvard, Vancouver, ISO, and other styles

33

Imai, Atsufumi, Daisuke Kushida, Fumiaki Takemori, and Akira Kitamura. "Proposal of Adaptive Type Iterative Learning Control for System with Characteristic Change." IEEJ Transactions on Electronics, Information and Systems 131, no. 7 (2011): 1303–8. http://dx.doi.org/10.1541/ieejeiss.131.1303.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Windisch, Georg, and Stefano Brusoni. "Iterative Multilevel Learning: Enabling Business Model Change in the Capital Goods Industries." Academy of Management Proceedings 2019, no. 1 (August 1, 2019): 11705. http://dx.doi.org/10.5465/ambpp.2019.11705abstract.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Sun, Yuli, Lin Lei, Dongdong Guan, and Gangyao Kuang. "Iterative Robust Graph for Unsupervised Change Detection of Heterogeneous Remote Sensing Images." IEEE Transactions on Image Processing 30 (2021): 6277–91. http://dx.doi.org/10.1109/tip.2021.3093766.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Geng, Guoqing, Binyuan Wei, Chen Duan, Haobin Jiang, and Yiding Hua. "A strong robust observer of distributed drive electric vehicle states based on strong tracking-iterative central difference Kalman filter algorithm." Advances in Mechanical Engineering 10, no. 6 (June 2018): 168781401877968. http://dx.doi.org/10.1177/1687814018779682.

Full text

Abstract:

This article proposed a strong robust observer of distributed drive electric vehicle states, including yaw rate, sideslip angle, and longitudinal velocity. Based on strong tracking filter algorithm framework, the proposed observer realized a strong tracking-iterative central difference Kalman filter by introducing a time-varying fade factor into iterative central difference Kalman filter. The introducing of time-varying fade factor assigns approximate orthogonality to residual error, which improves robustness of the observer at mutation conditions. Calculation efficiency and accuracy are improved by applying central difference transformation to approach posterior mean and posterior co-variance. By correcting variance and co-variance with combination of states updating and Gauss–Newton iteration, the observer also achieves high estimation accuracy and convergence rate. Finally, the observer was simulated in vehicle dynamics simulator veDYNA at slalom test and double lane change test with high and low road friction coefficients, respectively. Simulation results have verified that the observer has higher estimation accuracy as well as robustness comparing to extended Kalman filter.

APA, Harvard, Vancouver, ISO, and other styles

37

Hewett, Thomas T. "Towards a Generic Strategy for Empirical Evaluation of Interactive Computing Systems." Proceedings of the Human Factors Society Annual Meeting 33, no. 5 (October 1989): 259–63. http://dx.doi.org/10.1177/154193128903300505.

Full text

Abstract:

Increasingly, the design of interactive computing systems appears to be a process of iterative design and re-design. One important factor in successful iterative design is iterative evaluation-evaluation as part of each design cycle. This paper argues that different evaluation-design cycles may require different types of methodologies and different types of questions or measures to fully satisfy differing evaluation goals. Furthermore, evaluation procedures and measures themselves need to be designed and re-designed, a process more easily accomplished during system development. Examples based upon design projects illustrate some of the ways in which the nature and uses of evaluation procedures and information may change in different cycles of iterative evaluation.

APA, Harvard, Vancouver, ISO, and other styles

38

Torres-Jimenez, Jose, and Idelfonso Izquierdo-Marquez. "A low spatial complexity algorithm to generate combinations with the strong minimal change property." Discrete Mathematics, Algorithms and Applications 11, no. 05 (October 2019): 1950060. http://dx.doi.org/10.1142/s1793830919500605.

Full text

Abstract:

This work introduces an algorithm that generates all combinations of size [Formula: see text] ([Formula: see text]) of the set [Formula: see text] satisfying the strong minimal change property (SMCP) and requires [Formula: see text] memory space. The algorithm was implemented both iteratively and recursively; the iterative version has the advantage of processing the current combination in only one place of the algorithm, and the recursive version has the advantage of performing few operations to generate the next combination. The recursive version is similar to the algorithm of Eades and McKay because both algorithms have two functions that recursively call each other to generate the combinations; however, in the algorithm of Eades and McKay the depth of the recursion is [Formula: see text], while in our algorithm is [Formula: see text]. Performance comparison against three algorithms having the SMCP show that the recursive version of our algorithm performs better than the other algorithms when [Formula: see text] is large.

APA, Harvard, Vancouver, ISO, and other styles

39

Hasan, Syed M., and Satya Shah. "An Overview of Change Management within Manufacturing Environment." Advanced Materials Research 816-817 (September 2013): 1205–9. http://dx.doi.org/10.4028/www.scientific.net/amr.816-817.1205.

Full text

Abstract:

In this competitive world, where features like time to market, new technology and change management are the features that can affect the performance of New Product Development (NPD). Companies tend to use a conventional approach to NPD by assigning representatives from support functions to review and recommend changes as projects evolve. This approach has, in recent years, been questioned since it is a costly and time-consuming approach due to its iterative nature. It is argued that the change management process can reduced the negative effect and has the ability to support the functions of a supply chain to a greater extent and also earlier in the NPD process. This paper focuses on different change management techniques to support the required changes by management to integrate the NPD within supply chain (SC).

APA, Harvard, Vancouver, ISO, and other styles

40

Pawar, Rupali Pravinkumar, and Kirti Nilesh Mahajan. "Implementation of Change Management in Software Development by using Scrum Framework." International Journal of Advanced Research in Computer Science and Software Engineering 7, no. 7 (July 30, 2017): 400. http://dx.doi.org/10.23956/ijarcsse.v7i7.164.

Full text

Abstract:

This paper will focus on implementation of change management in Scrum software development framework . Scrum is one of the mostly used software development framework from the Agile software development methodology. Scrum is based on iterative and incremental process. It is suitable for unstable requirements. The use of Scrum proved to be beneficial due to tight schedule and loosely defined user requirements that often changed during the development. The aim of the paper to study implementation process of change management in Scrum . First part of paper gives detailed information of Scrum framework. The middle of the paper presented the organizational process of agile software development using Scrum. Finally, the paper point out key points for managing changes in Scrum implementation. The primary data collection method was interviews of the industry expertise. The secondary source of data is reference books and Internet articles. This paper will help to understand basics of Scrum software development framework and process of change management in developing projects by using Scrum framework.

APA, Harvard, Vancouver, ISO, and other styles

41

Ji, Jun. "CGG method for robust inversion and its application to velocity-stack inversion." GEOPHYSICS 71, no. 4 (July 2006): R59—R67. http://dx.doi.org/10.1190/1.2209547.

Full text

Abstract:

The modified conjugate gradient (CG) method, called the conjugate guided gradient (CGG) method, is a robust iterative inversion method producing a parsimonious model estimation. The CG method for solving least-squares (LS) (i.e., [Formula: see text]-norm minimization) problems is modified to solve for different norms or different minimization criteria by guiding the gradient vector appropriately during iteration steps. Guiding is achieved by iteratively reweighting either the residual vector or the gradient vector during iteration steps like the iteratively reweighted least-squares IRLS method does. Robustness is achieved by weighting the residual vector and parsimonious model estimation is obtained by weighting the gradient vector. Unlike the IRLS method, however, the CGG method doesn’t change the corresponding forward operator of the problem and is implemented in a linear inversion template. Therefore, the CGG method requires less computation than the IRLS method. Since the solution in the CGG method is found in a least-squares sense along the gradient direction guided by the weights, this solution can be interpreted as the LS solution located in the guided gradient direction. Guiding the gradient gives us more flexibility in the choice of weighting parameters than the IRLS method. I applied the CGG method to velocity-stack inversion, and the results show that the CGG method gives a far more robust and parsimonious model estimation than the standard [Formula: see text]-norm solution, with results comparable to the [Formula: see text]-norm IRLS solution.

APA, Harvard, Vancouver, ISO, and other styles

42

Yao, S. C., and N. D. Sylvester. "An Improved Model for Predicting Heat Losses and Pressure Changes in Steam Injection Wells—Part 1: Model Development." Journal of Energy Resources Technology 109, no. 4 (December 1, 1987): 218–24. http://dx.doi.org/10.1115/1.3231350.

Full text

Abstract:

An improved model for predicting heat losses and pressure changes in steam injection wells is presented. The model incorporates a new two-phase, annular-mist flow pressure change model with heat transfer to the surroundings during wet steam injection. The model requires an iterative procedure which is solved numerically using a fourth-order Runge-Kutta method.

APA, Harvard, Vancouver, ISO, and other styles

43

Leite, Lucilia Rezende, Luis Marcelo Tavares de Carvalho, and Fortunato Menezes da Silva. "CHANGE DETECTION IN FORESTS AND SAVANNAS USING STATISTICAL ANALYSIS BASED ON GEOGRAPHICAL OBJECTS." Boletim de Ciências Geodésicas 23, no. 2 (June 2017): 284–95. http://dx.doi.org/10.1590/s1982-21702017000200018.

Full text

Abstract:

The aim of this work was to assess techniques of land cover change detection in areas of Brazilian Forest and Savanna, using Landsat 5/TM images, and two iterative statistical methodologies based on geographical objects. The sensitivity of the methodologies was assessed in relation to the heterogeneity of the input data, the use of reflectance data and vegetation indices, and the use of different levels of confidence. The periods analyzed were from 2000 to 2006, and from 2006 to 2010. After the segmentation of images, the descriptive statistics average and standard deviation of each object were extracted. The determination of change objects was realized in an iterative way based on the Mahalanobis Distance and the chi-square distribution. The results were validated with an early visual detection and analyzed according to Receiver Operating Characteristic (ROC) Curve. Significant gains were obtained by using vegetation masks and bands 3 and 4 for both areas tested with 94,67% and 95,02% of the objects correctly detected as changes, respectively for the areas of Forest and Savanna. The use of the NDVI and different images were not satisfactory in this study.

APA, Harvard, Vancouver, ISO, and other styles

44

Zhang, Xinzheng, Guo Liu, Ce Zhang, Peter M. Atkinson, Xiaoheng Tan, Xin Jian, Xichuan Zhou, and Yongming Li. "Two-Phase Object-Based Deep Learning for Multi-Temporal SAR Image Change Detection." Remote Sensing 12, no. 3 (February 7, 2020): 548. http://dx.doi.org/10.3390/rs12030548.

Full text

Abstract:

Change detection is one of the fundamental applications of synthetic aperture radar (SAR) images. However, speckle noise presented in SAR images has a negative effect on change detection, leading to frequent false alarms in the mapping products. In this research, a novel two-phase object-based deep learning approach is proposed for multi-temporal SAR image change detection. Compared with traditional methods, the proposed approach brings two main innovations. One is to classify all pixels into three categories rather than two categories: unchanged pixels, changed pixels caused by strong speckle (false changes), and changed pixels formed by real terrain variation (real changes). The other is to group neighbouring pixels into superpixel objects such as to exploit local spatial context. Two phases are designed in the methodology: (1) Generate objects based on the simple linear iterative clustering (SLIC) algorithm, and discriminate these objects into changed and unchanged classes using fuzzy c-means (FCM) clustering and a deep PCANet. The prediction of this Phase is the set of changed and unchanged superpixels. (2) Deep learning on the pixel sets over the changed superpixels only, obtained in the first phase, to discriminate real changes from false changes. SLIC is employed again to achieve new superpixels in the second phase. Low rank and sparse decomposition are applied to these new superpixels to suppress speckle noise significantly. A further clustering step is applied to these new superpixels via FCM. A new PCANet is then trained to classify two kinds of changed superpixels to achieve the final change maps. Numerical experiments demonstrate that, compared with benchmark methods, the proposed approach can distinguish real changes from false changes effectively with significantly reduced false alarm rates, and achieve up to 99.71% change detection accuracy using multi-temporal SAR imagery.

APA, Harvard, Vancouver, ISO, and other styles

45

Eyvindson, Kyle, Jussi Rasinmäki, and Annika Kangas. "Evaluating a hierarchical approach to landscape-level harvest scheduling." Canadian Journal of Forest Research 48, no. 2 (February 2018): 208–15. http://dx.doi.org/10.1139/cjfr-2017-0298.

Full text

Abstract:

Forest planning at the landscape level has the potential to become a large intractable problem. In Finland, Metsähallitus (the state enterprise that manages federally owned land) creates strategic plans to determine the appropriate harvest level. While these plans are feasible, they are not implementable in practice as the harvests are scattered temporally and spatially. Requiring that harvests be organized both temporally and spatially for practical implementation can result in an intractable problem. Through a hierarchical approach, the problem can be organized into steps in which the intractable problem is broken down into smaller easily solvable parts. As an approximation technique, the hierarchical approach may not find a solution close to optimality. To meet this challenge, we combine the top hierarchical level problems with a limited selection of lower hierarchical level problems into a single optimization problem. An iterative process is then used to improve the link between the hierarchical levels. We evaluate the landscape-level management plans developed by the iterative approach with a solution to the complete problem. The iterative process dramatically improves the strategic solution, performing near the global optimum. This suggests that the process can be applied to more computationally challenging problems such as spatial planning and stochastic programming.

APA, Harvard, Vancouver, ISO, and other styles

46

Suyoto, Suyoto, Iskandar Iskandar, Sugihartono Sugihartono, and Adit Kurniawan. "Improved Timing Estimation Using Iterative Normalization Technique for OFDM Systems." International Journal of Electrical and Computer Engineering (IJECE) 7, no. 2 (April 1, 2017): 905. http://dx.doi.org/10.11591/ijece.v7i2.pp905-911.

Full text

Abstract:

<p>Conventional timing estimation schemes based on autocorrelation experience performance degradation in the multipath channel environment with high delay spread. To overcome this problem, we proposed an improvement of the timing estimation for the OFDM system based on statistical change of symmetrical correlator. The new method uses iterative normalization technique to the correlator output before the detection based on statistical change of symmetric correlator is applied. Thus, it increases the detection probability and achieves better performance than previously published methods in the multipath environment. Computer simulation shows that our method is very robust in the fading multipath channel</p>

APA, Harvard, Vancouver, ISO, and other styles

47

Laursen, Sandra L., and Kristine De Welde. "The changer and the changed." Equality, Diversity and Inclusion: An International Journal 38, no. 2 (March 11, 2019): 140–59. http://dx.doi.org/10.1108/edi-09-2017-0192.

Full text

Abstract:

PurposeThe purpose of this paper is to examine the evolving theories of change of the US National Science Foundation’s (NSF) ADVANCE program to increase the representation of women on academic faculties in science, technology, engineering and mathematics (STEM). ADVANCE supports efforts to transform the cultures and structures of US institutions of higher education by removing gendered barriers to STEM faculty women’s employment, advancement and success, and by developing change strategies that others may adopt.Design/methodology/approachThe empirical study is based on qualitative, longitudinal analysis of nine requests for proposals (RfPs) for the ADVANCE program (2001–2016), complemented by historical analysis of funded ADVANCE projects using public records.FindingsThe analysis identifies changes over time that suggest shifts in NSF’s rationale and theory of change for ADVANCE. Increased guidance directs how institutions should best undertake change, document outcomes and share best practices. The RfPs reveal growing attention to equity, rather than simply to representation, and to intersectionality – how gender, race, social class and other identities intersect to produce disparate experiences and outcomes for individuals differently positioned in social systems. Gendered organizations theory helps to place these experiences and outcomes in a structural context. Iterative processes of organizational learning are postulated to account for these changes over time.Originality/valueWhile many studies have examined ADVANCE projects’ activities and outcomes, none have examined the premises and design of the ADVANCE program itself. This analysis offers insight into how the ADVANCE RfP has driven innovation and learning about transformative institutional change to advance gender equity in STEM.

APA, Harvard, Vancouver, ISO, and other styles

48

Zhang, Ling Xin, Ming Yi Hu, and Ping Chuan Wu. "Application Analysis of an Improved N-R Iterative Method about Finite Element Numerical Calculation." Key Engineering Materials 450 (November 2010): 518–21. http://dx.doi.org/10.4028/www.scientific.net/kem.450.518.

Full text

Abstract:

During the numerical calculation by FE (Finite Element) method, N-R (Newton-Raphson) iterative method will be used to solve the problem such that material performing with elasto-plastic character and geometric non-linearity. However, if the problem has macro scale DOFs (degree of freedom), the classical N-R method is shown to make a low efficiency on the whole process. For this reason, in this paper, an improved N-R iterative method is proposed by creating proper mandatory limiters to change the step size of displacement field increment. In this way, the size of single iterative step is enlarged in the new method with tangent stiffness matrix used as classical N-R iterative theory as well. Furthermore, to test stability of the new method, two models of structure are chosen to be calculated with this method. In the conclusion, the improved N-R iterative method is indicated to be an efficient and stable numerical method which could solve nonlinear problems, especially with macro scale DOFs.

APA, Harvard, Vancouver, ISO, and other styles

49

Zhao, Minda, Qiang Ling, and Feng Li. "An Iterative Feedback-Based Change Detection Algorithm for Flood Mapping in SAR Images." IEEE Geoscience and Remote Sensing Letters 16, no. 2 (February 2019): 231–35. http://dx.doi.org/10.1109/lgrs.2018.2871849.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Ritchi, Hamzah, and Ade Laide Debora. "On change management for enterprise accounting system: iterative content analysis for success factors." Jurnal Akuntansi & Auditing Indonesia 24, no. 2 (2020): 119–29. http://dx.doi.org/10.20885/jaai.vol24.iss2.art5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Journal articles on the topic 'Iterative change'

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