There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

다중혈관 관상동맥 환자에서 y-문합을 이용하여 양쪽 내흉동맥만을 사용한 우회술의 조기 성적

In recent algorithmic family simulates different biological processes observed in Nature in order to efficiently address complex optimization problems. In the last years the number of bio-inspired optimization approaches in literature has grown considerably, reaching unprecedented levels that dark the future prospects of this field of research. This paper addresses this problem by proposing two comprehensive, principle-based taxonomies that allow researchers to organize existing and future algorithmic developments into well-defined categories, considering two different criteria: the source of inspiration and the behavior of each algorithm. Using these taxonomies we review more than three hundred publications dealing with nature-inspired and bio-inspired algorithms, and proposals falling within each of these categories are examined, leading to a critical summary of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper. From our analysis we conclude that a poor relationship is often found between the natural inspiration of an algorithm and its behavior. Furthermore, similarities in terms of behavior between different algorithms are greater than what is claimed in their public disclosure: specifically, we show that more than one-third of the reviewed bio-inspired solvers are versions of classical algorithms. Grounded on the conclusions of our critical analysis, we give several recommendations and points of improvement for better methodological practices in this active and growing research field.

Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration Versus Algorithmic Behavior, Critical Analysis Recommendations

In the field of image processing, there are several problems where the efficient search has to be performed in complex search domain to find an optimal solution Image enhancement which improves the quality of an image for visual analysis and/or machine understanding is one of these problems There is no unique image enhancement technique and it’s measurement criterion which satisfies all the necessity and quantitatively judge the quality of a given image respectively Thus sometimes proper image enhancement problem becomes hard and takes large computational time In order to overcome that problem, researchers formulated the image enhancement as optimization problems and solved using Nature-Inspired Optimization Algorithms (NIOAs) which starts a new era in image enhancement field This study presents an up-to-date review over the application of NIOAs in image enhancement domain The key issues which are involved in the formulation of NIOAs based image enhancement models are also discussed here

A Survey on Nature-Inspired Optimization Algorithms and Their Application in Image Enhancement Domain

Research in metaheuristics for global optimization problems are currently experiencing an overload of wide range of available metaheuristic-based solution approaches. Since the commencement of the first set of classical metaheuristic algorithms namely genetic, particle swarm optimization, ant colony optimization, simulated annealing and tabu search in the early 70s to late 90s, several new advancements have been recorded with an exponential growth in the novel proposals of new generation metaheuristic algorithms. Because these algorithms are neither entirely judged based on their performance values nor according to the useful insight they may provide, but rather the attention is given to the novelty of the processes they purportedly models, these area of study will continue to periodically see the arrival of several new similar techniques in the future. However, there is an obvious reason to keep track of the progressions of these algorithms by collating their general algorithmic profiles in terms of design inspirational source, classification based on swarm or evolutionary search concept, existing variation from the original design, and application areas. In this paper, we present a relatively new taxonomic classification list of both classical and new generation sets of metaheuristic algorithms available in the literature, with the aim of providing an easily accessible collection of popular optimization tools for the global optimization research community who are at the forefront in utilizing these tools for solving complex and difficult real-world problems. Furthermore, we also examined the bibliometric analysis of this field of metaheuristic for the last 30 years.

Metaheuristics: a comprehensive overview and classification along with bibliometric analysis

This paper proposes an optimization algorithm based on human fight and learn from each duelist. The proposed algorithm starts with an initial set of duelists. The duel is to determine the winner and loser. The loser learns from the winner, while the winner try their new skill or technique that may improve their fighting capabilities. A few duelists with highest fighting capabilities are called as champion. The champion train a new duelist such as their capabilities. The new duelist will join the tournament as a representative of each champion. All duelist are re-evaluated, and the duelists with worst fighting capabilities is eliminated to maintain the amount of duelists. Several benchmark functions is used in this work. The results shows that Duelist Algorithm outperform other algorithms in several functions.

Duelist Algorithm: An Algorithm Inspired by How Duelist Improve Their Capabilities in a Duel

/pdf/body-design-concept-of-remotely-operated-vehicle-rov-of-4v8qbjeif7.pdf

Body Design Concept of Remotely Operated Vehicle (ROV) of Observation Class with the Method of Concept Screening and Concept Scoring

The flyover development today is very much at all to do because it is one solution as degrading congestion and lifter segment flyover is one important tool in the construction of flyovers. This final project offers an example of the calculation and planning lifter segment fly over the beam structure for lifting can be separated pairs which can later be changed in accordance with the specification segment flyover to be lifted. The final project is expected to be one of the references manufacture segments lifter fly over. This design uses Pahl and Beitz method and the results of this research. Specifications lifter segment fly over with beam structure for lifting to be loose tide is Lifting Equipment; Wire rope with two types of options on each drum are strands left and right torsion. Mechanism trolley; Can move on the path along the 3,019 mm, diameter the wheel trolley 381 mm, Trolley the wheel shaft diameter: 12 cm or 120 mm with material JIS S45C. Struktur lifter ; Beam lifting using a beam with a weight per unit length of 1.97 N / mm with JIS G3101 SS540 material along the 4900 mm and a surface area of retaining cylindrical pedestal A of 5024 mm2 with material JIS G3101 SS540. The mechanism of motion lifter can move on the path along the 4000 mm. Wheel lifter diameter 533.4 mm. Hydraulic of lifters driver using a double acting hydraulic with a maximum

https://jurnal.untirta.ac.id/index.php/vanos/article/download/9123/6711

Design of Lifter Flyover Segment with a Structure of Lifting Beam can Escape Pairs

Use of NACA 0012 at the Sultan Wind Turbine prototype provide value coefficient power turbine at wind speed 5.5 m / s by 0017 , wind speed 6.1 m / s at 0.015 , wind speed 7.7 m / s at 0.016 , wind speed 6.5 m / s for 0018 and wind speed 6.2 m / s by 0017 . Where the value of the highest efficiency obtained at a speed of 6.5 m / s at 0.018 . This result is not as expected to generate sufficient energy.The next development carried out investigations on some kind of airfoil, from investigations obtained by using Qblade software that NACA 6612 has a value of 1.78 CL at 15 degrees angle of attack is the largest of all the airfoil .In this research, NACA 6612 will be simulated with a variable chord length, angle of attack, and wind speed, of these three variables will be created which will map graphics 3d sliding value of the ratio of the 3 variables, this graph will give recommendations most optimum combination of variables to types are mapped wind speed throughout the year, to produce optimum power.Optimum combination of NACA 6612 with wind speed varied from 2-7 m/s is chord length 30 cm and angle of attack 7 degree.

Development of the Third Darrieus Blade of Sultan Wind Turbine for Low Wind Speed

https://iopscience.iop.org/article/10.1088/1757-899X/645/1/012014/pdf

Erny Listijorini

Papers

Duelist Algorithm: An Algorithm Inspired by How Duelist Improve Their Capabilities in a Duel

Body Design Concept of Remotely Operated Vehicle (ROV) of Observation Class with the Method of Concept Screening and Concept Scoring

Design of Lifter Flyover Segment with a Structure of Lifting Beam can Escape Pairs

Development of the Third Darrieus Blade of Sultan Wind Turbine for Low Wind Speed

Hydrodynamic analysis of Remotely Operated Vehicle (ROV) Observation Class using CFD