Search

The following paper presents work on the Heat Recovery System (HRS) which have been used constructively in modern industries to recover heat from the flue gases. The HRS are analysed and outcomes of various factors such as its permeability, length, D/dp ratio, and porosity of the model are studied. Various CFD simulations are shown for the results of thermal trait of model. It is hence implied that for thermal and flow simulations the modelled geometry in fluent is to be used. The CFD analysis starts with heating cycle by allowing the flue gases to enter the regenerator at the higher temperature (200 ℃) through the inlet of the regenerator bed for a cycle time of 10 mins thus charging the glass particle bed. Once the heating cycle is completed then the cooling cycle starts with the entry of air at ambient temperature at 27 ℃ for the cycle time of 10 mins regenerator entering in the counter flow direction. The simulations deduce that with the aid of Fluent software, various contours of velocity, pressure, turbulent kinetic energy and temperature are studied for regenerators of fixed bed length. The thermal efficiency of heat recovery form the fixed matrix regenerator with glass particles and D/dp ratio of 10 is calculated as 15%. This 15% increase in the thermal efficiency will improve the overall efficiency of the plant where these type of regenerators are used by 5–8% and decrease the total required heat input by 10–15%.

The evolution of image retargeting technique demands the exploitation of multi-operators since they are capable of preserving the structure and salient objects of the image. However, these multi-operators are mostly based on seam carving with scaling or cropping operators which lead to significant distortions in the retargeted image. This study proposes a new multi-operator scheme which has improved seam carving, through the proposed seam diversion based image retargeting algorithm, integrated with the cropping and warping operator. A total of six different multi-operator schemes have been proposed out of which the MO6 technique gave remarkable results in terms of image quality, least distortion, and lowest run-time. To simplify image retargeting operations, an optimised image distance function was used. The optimised image distance function was formulated which combines bidirectional image Euclidean distance, dominant colour descriptor, and an energy-based coefficient to bypass seams from the point where seams start clashing and hence the defined threshold violates. By integrating cropping and warping into the proposed algorithm, it preserves the salient features of the retargeted images. Typical results have been presented which demonstrates the effectiveness of the proposed methods. User-based subjective analysis has also been carried out which shows that image retargeted using the MO6 technique has high user preference.

The presence of a wide range of high- and low-resolution devices renders the images to experience changes in respect to aspect ratio and size for better adaptability. This paper proposes a novel and effective technique that vanquishes the problems encountered in the conventional seam carving method. To achieve minimum distortion in salient objects of the image, the proposed technique restricts intersection or overlapping of multiple seams in the horizontal and vertical direction and bypasses them to the neighboring low energy pixel. The proposed technique hinders the pixel selection from a single row or column beyond the defined threshold so as to save the image information and reduce distortion at a single location. To justify the effectiveness of the proposed technique, results have been presented in comparison with the five state-of-the-art image retargeting techniques. Compared with the conventional techniques, this technique shows remarkable results in terms of low distortion percentage. The proposed technique also produces excellent results for shrinkage and enlargement of a single image multiple times.

In this study, we have proposed and validated that histogram of a good-quality bone scan image can enhance a poor-quality bone scan image. The histograms of two good-quality technetium-99m methyl diphosphonate bone scan images IAand IBrecommended by nuclear medicine physicians (NMPs) were used to enhance 87 poor-quality bone scan images. Processed images and their corresponding input images were compared visually by two NMPs with scoring and also quantitatively using entropy, Structural similarity index measure, edge-based contrast measure, and absolute brightness mean error. Barnard's unconditional test was applied with a null hypothesis that the histogram of both IAand IBproduces similar output image at α =0.05. The mean values of quantitative metrices of the processed images obtained using IAand IBwere compared using Kolmogorov—Smirnov test. Histogram of a good-quality bone scan image can enhance a poor-quality bone scan image. Visually, histogram of IBimproved statistically significantly higher proportion (P < 0.0001) of images (86/87) as compared to histogram of IA(51/87). Quantitatively, IBperformed better than IA,and the Chi-square distance of input and IBwas smaller than that of IA. In addition, a statistically significant (P < 0.05) difference in all the quantitative metrics among the outputs obtained using IAand IBwas observed. In our study, reference histogram of good-quality bone scan images transformed the majority of poor-quality bone scan images (98.85%) into visually good-quality images acceptable by NMPs.

Breast cancer is one of the main health issues for women. This disease can be cured only if detected at early stages. Digital mammography is used to detect the malignant cells at an early stage. This article designs a methodology to detect the malignant tumors. The methodology is comprised of preprocessing feature extraction by Gabor and Law's feature extraction, and feature reduction by ant-lion optimization as well as a classification step using a SVM classifier which is implemented on the live dataset prepared through the Rajindra Hospital Patiala along with MIAS and DDSM datasets. The results of proposed techniques have been compared with three states of art techniques SVM based classification without feature reduction, PSOWNN i.e. PSO based reduction with a neural network as a classifier and binary gray wolf-based feature reduction with SVM classifier. The performance analysis proves the significance of the technique.

The aim of the present study was to design and evaluate two MeVisLab networks, one for co-registration of positron emission tomography/computed tomography (PET/CT) images and second for cropping the co-registered PET/CT images.Two MeVisLab networks, one to co-register and export PET/CT DICOM images and second for cropping the co-registered PET/CT images were designed using different modules of registration toolkit MERIT. One hundred and twenty-five PET/CT studies were exported from Siemens and GE scanners in DICOM format. These images were co-registered and cropped with our designed networks. The images co-registered with our network were compared visually with the co-registered images of same PET/CT studies on vendor provided workstations by an experienced nuclear medicine physician (NMP). The perfection of the cropping of co-registered images was also assessed visually.Visually, NMP found all 125 images co-registered using the network designed in our study similar to the co-registered images of vendor provided workstations. Furthermore, the cropping of all co-registered images was perfectly done by our network.Two MeVisLab networks designed and evaluated in the present study can be used for co-registration of PET/CT DICOM images and cropping the co-registered PET/CT images.

In this application of a machine learning performance, for the forecast of the time, the vehicle will be spent among to the different positions in a near about section. The foundation of guess will be knowledge process which highlighted on the past data about the actions of vehicles in deliberation, a set of semantic variables to acquire approximate time exactly. According to researcher propose a city broad and synchronized model for the judgment of journey period of some street (Represent as a series of linked road segment) in the authentic instance in a city base on the Global Positioning System trajectory of vehicle arriving in present moment of period and more than a period of the past and map data source. In this research, we apply support vector regression (SVR) for travel time predictions and evaluate the result to different techniques of travel time prediction method by means of real road traffic information. In this paper, we relate support vector regression (SVR) for travel time forecast and contrast the result to former baseline travel time prediction method by factual highway traffic information. Our aim of is to use SVR analyst to can decrease appreciably both relation mean bugs and root mean square bugs of predict journey period.

The next generation of emerging wireless technology is dealing with spectrum shortage. For appropriate and practical implementation of latest wireless technologies, the sufficient amount of frequency is needed. Cognitive radio (CR) is introduced as a proficient nominee to manage spectral undersupply problem, as it rapidly increases the use of underutilize spectrum via spectrum sensing. This chapter introduces brief start about spectrum holes in addition to spectrum sensing framework. Further, the chapter explains the issues in spectrum sensing and how the cooperative sensing technique is fit to overcome these issues like shadow fading and receiver uncertainty. Consequently, the various non-cooperative sensing techniques are also discussed including their test statics. The advantages and disadvantages of different sensing techniques is exhibited at the end.

In this paper, premature head lump recognition along with analysis is dangerous to clinic. Therefore, segmentation of paying attention to growth neighborhood desires near subsists precise, efficient, and robust. Convolution system is authoritative illustration model with the purpose of capitulate skin tone. Researchers explain to intricacy complex with taught continuous pixels and top condition and image in semantic. According to research contribution approaching, the make completely convolution system with the intention obtain participation of random dimension and manufacture correspondingly sized production with resourceful supposition and knowledge. We describe and element the breathing liberty and entirely convolution system clarify describe function toward special impenetrable estimate everyday jobs in addition rough copy family member and preceding reproduction. We are acclimatizing fashionable arrangement network which is keen on fully convolution networks with relocating their knowledgeable representation by modification to the segmentation assignment. We describe a bounce structural chart to facilitate collect semantic requirement starting with a profound uncouth deposit through exterior in sequence following low, well coating toward construct precise in addition and thorough segmentation. This is the FCN attain circumstance of the segmentation and 36% similar development toward 66.6% indicate lying 2015 NYUD with pass through a filter present although deduction take a smaller amount single fifth and succeeding on behalf of the characteristic picture. According to researches, they designed a three-dimensional fully convolution neural network for brain tumor segmentation. During training, researchers optimized our network alongside beating purpose based on gamble achieve results and researchers also used to assess the superiority of prediction twisted in this representation. In order to accommodate the massive memory requirements of three-dimensional convolutions, we cropped the images we fed into our network, and we used a UNET architecture that allowed us to achieve good results even with a relatively narrow and shallow neural network. Finally, we used post-processing in order to smooth out the segmentations produced by our model.

Charismatic timbre Imaging be the favorite picture modality intended meant pro assess brains tumor plus segmentation be essential designed on behalf of analysis plus action preparation. Consequently vigorous routine segmentation method is requisite. Mechanism education proposal anywhere the representation be educated as of information be pretty victorious. Hierarchical segmentation approach first section the complete brain tumor follows through intra growth hankie classification. Currently fully convolutional networks approaches for segmentation are very efficient. Exact growth segmentation is necessary plus vital pace intended for mainframe aid brain tumor analysis plus surgical arrangement. They are motionless opposite a few challenge such because inferior segmentation correctness demanding priori information otherwise require the being meddling. Subsequent plan the sorting effect to double picture the placement dispensation is implementing through morphological strain toward acquire the concluding segmentation. During organize near appraise the future technique the research be practical in the direction of section the brain tumor used for the authentic tolerant dataset. The ending presentation show to the future brain tumor segmentation technique be additional precise plus competent.

This paper addresses the area of image compression as it is applicable to various fields of image processing. On the basis of evaluating and analyzing the current image compression techniques this paper presents the Adaptive byte compression and decompression technique an approach applied to fractal image compression. It also includes various benefits of using image compression techniques

Modeling of hot gas ingestion in a gas turbine engine is critical because its accuracy directly affects performance as well as turbine durability. In this paper, ASU ingestion test rig data accompanied by its published ingress/egress discharge coefficients (Cdi and Cde , formulation) are used to propose a simplified 1D ingestion model embedded in the secondary air system software (Network). The proposed externally induced ingress model includes separate boundary nodes with equal static pressure in the annulus hub, and distinct circumferential pressure variation in the form of normalized annulus pressure at the hub (P1 – P1avg)/(P1max – P1min). The corresponding Cdi and Cde for the engine conditions are scaled based on rig-to-engine non-dimensional minimum purge, Cwmin where engine Cwmin uses the actual (P1 – P1avg)/(P1max – P1min) derived from previously published CFD data along with the effective rim-seal overlap clearance. The vane pitch integrated driving pressure difference at the hub for the ingestion used in the orifice model comes from an embedded saw-tooth assumption on the circumferential pressure profile. Recirculation of ingested hot gas from the upper rim cavity to the lower wheel space is considered by comparing the supplied purge flow to the rotating disc entrainment requirement. The proposed model is compared with another model based on constant Cdi / Cde ratio of 0.14 published by the University of Bath. Engine test data from a previously published engine configuration is used to assess the appropriate model for engine. The probability of failure in violating the lower rim cavity sealing effectiveness limit based on analysis of variation (AOV) was conducted under both formulations and the results are presented.

The generation of fractals and study of the dynamics of polynomials is one of the emerging and interesting field of research nowadays. We introduce in this paper the dynamics of polynomials z n z + c = 0 for n 2 and applied Jungck Ishikawa Iteration to generate new Relative Superior Mandelbrot sets and Relative Superior Julia sets. In order to solve this function by Jungck –type iterative schemes, we write it in the form of Sz = Tz, where the function T, S are defined as Tz = z n + c and Sz = z. Only mathematical explanations are derived by applying Jungck Ishikawa Iteration for polynomials in the literature but in this paper we have generated Relative Mandelbrot sets and Relative Julia sets.

Complex graphics of dynamical system have been a subject of intense research nowadays. The fractal geometry is the base of these beautiful graphical images. Many researchers and authors have worked to study the complex nature of the two most popular sets in fractal geometry, the Julia set and the Mandelbrot set, and proposed their work in various forms using existing tools and techniques. The generation of fractals and study of the dynamics of transcendental function is one of the emerging and interesting fields of research nowadays. Recently, Ashish Negi, Rajeshri Rana and Yashwant S. Chauhan are among those researchers who have contributed a lot in the area of Fractal Geometry applications. In this paper we review the recently done work on sine and inverse tangent functions.

Today Fractal geometry is completely new area of research in the field of computer science and engineering. It has wide range of applications. Fractals in nature are so complicated and irregular that it is hopeless to model them by simply using classical geometry objects. Benoit Mandelbrot, the father of fractal geometry, from his book The Fractal Geometry of Nature, 1982. This paper present construction of famous fractal images- Mandelbrot set and Julia set using 3D iterated function system which gives real look and feel of complex natural fractal images.

Now a days most of the researchers are doing lots of work in the area of image compression. Fractal image compression requires lots of mathematical computation to compress an image. Fractal image compression is a recent technique based on the representation of an image by a contractive transform, on the space of images, for which the fixed point is close approximation to the original image. Main aim of fractal image compression algorithm is to reduce computation time required to compress image data. Fractal image compression is a lossy compression method for digital images, based on fractals. It is based on affine contractive transforms and utilizes the existence of self-symmetry in the image.This paper presents method for generating fractal images using iterated function system, method to partition image for compressing image using fractal image compression technique and various quality measures in fractal image compression.

Today Fractal geometry is completely new area of research in the field of computer science and engineering. It has wide range of applications. Fractals in nature are so complicated and irregular that it is hopeless to model them by simply using classical geometry objects. Benoit Mandelbrot, the father of fractal geometry, from his book The Fractal Geometry of Nature, 1982. This paper explor various concepts of fractal i.e. fractal dimension, various techniques to generate fractal, their characteristics and their application in real life.

The intent of this paper is to present a review of literature on perturbations of the Mandelbrot map in fractal analysis in the recent years. In this paper we have studied the work of various researchers in the field of effect of various noise on Mandelbrot set.

Objectives: Presently, various search engines are available in the web with huge database. Not only the available search engine but the query also plays important role for getting appropriate results from the search engines. Our objective is to show the importance of popular queries. Methods/Statistical Analysis: In this article, we have introduced two new categories of query the one is popular query and another one is non-popular query. We analyse the behaviour of search engines using popular queries in top three search engines and after that compared them with a traditional mathematical model for rank calculation along with user feedback method. Findings: By proposing new category of query we analyse how the behaviour of search engines changed. Here we are using three methods for calculating ranking in different types of search engines to give more strength to our results. Our findings are to show the importance of popular queries in different types of search engines. Application/Improvements: From this article, we conclude that the behaviour or search engine in popular query is different than a simple query; some of the search engine gives them more importance because of their popularities.

The Sierpinski triangle also known as Sierpinski gasket is one of the most interesting and the simplest fractal shapes in existence. There are many different and easy ways to generate a Sierpinski triangle. In this paper we have presented a new algorithm for generating the sierpinski gasket using complex variables.

Von Koch curves allow numerous variations and have inspired many researchers and fractal artists to produce amazing pieces of art. In this paper we present a new algorithm for plotting the Koch curve using complex variables. Further we have applied various coloring algorithms to generate complex Koch fractals.

Mandelbrot set with transcendental function presents an out of the ordinary field of research because of its magnificence and geometrical complexities. Earlier many researchers used feedback system to study it and reveal new concepts unexplored the geometry of transcendental Mandelbrot set with new iterative approach. The objective of the paper is to analyze the work done by several researchers to visualize beautiful fractal graphics of Mandelbar set with sine, cosine functions using Mann iteration method. Also the rate of convergence of function in the presence of transcendental function and conjugacy with Mandelbrot set and related complex structure of superior Julia set.

Carotid Kundalini function broadly known as C-K function was introduced by Gordon R.J.Cooper. It is given by the function 1 1 cos( cos ( )) n n n z Nz z c     where z,c andN are complex constants. Cooper presented interesting Julia sets by taking c=(0,0).Rani and Negi introduced a new process for generation of the C-K function and obtained interesting variants of Julia set generated by Cooper an some exciting figures for parameter 2 N  , for values of c other than (0, 0). In this paper we apply a different iteration process for generation of the Julia set for C-K function and will call them relative superiorC-K Julia sets. Further, different properties like trajectories and fixed point arealso discussed in the paper. We also obtain some exciting figures for the C-K function for values of c other than (0, 0). General Terms Your general terms must be any term which can be used for general classification of the submitted material such as Pattern Recognition, Security, Algorithms et. al.

In this paper we investigate the new Julia set and a new Tricorn and Multicorns of fractals. The beautiful and useful fractal images are generated using Ishikawa iteration to study many of their properties. The paper mainly emphasizes on reviewing the detailed study and generation of Relative Superior Tricorn and Multicorns along with Relative Superior Julia Set.

The object Mandelbrot set given by Mandelbrot in 1979 and its relative object Julia set have become a wide and elite area of research nowadays due to their beauty and complexity of their nature. Many researchers and authors have worked to study and reveal the new concepts unexplored in the complexities of these two most popular sets of fractal geometry. In this paper we review the recently done work on complex functions for producing beautiful fractal graphics, by few eminent researchers contributing a lot to the field of fractal geometry. The reviewed work mainly emphasizes on the complex functional dynamics of Ishikawa iterates for inverse and logarithmic function and existence of relative superior Mandel-bar set.

is a constant. This Fractal is particularly interesting, with beautiful shapes and lots of spirals. In this paper we have presented different characteristics of Multibrot function using superior iterates. Further, different properties like trajectories, fixed point, its complex dynamics and its behavior towards Julia set are also discussed in the paper. Keywordsdynamics, Multibrot. where n and c is a constant. The complex dynamics of Multibrot function, generally known as Multibrot fractal, is a modification of the classic Mandelbrot and Julia sets. The Multibrot (Julia) type is particularly interesting, with beautiful shapes and lots of spirals. In this paper we have presented different characteristics of Multibrot function using superior iterates and generated the superior Multibrot fractal. Further, different properties like trajectories, fixed point, its complex dynamics and its behaviour towards Julia set are also discussed in the paper.

Complex graphics of dynamical system have been a subject of intense research nowadays. The fractal geometry is the base of these beautiful graphical images. Many researchers and authors have worked to study the complex nature of the two most popular sets in fractal geometry, the Julia set and the Mandelbrot set, and proposed their work in various forms using existing tools and techniques. Still researches are being conducted to study and reveal the new concepts unexplored in the complexities of these two most popular sets of fractal geometry. Recently, Ashish Negi, Rajeshri Rana and Yashwant S. Chauhan are among those researchers who have contributed a lot in the area of Fractal Geometry applications. In this paper we review the recently done work on complex and inverse complex functions for producing beautiful fractal graphics. The reviewed work mainly emphasizes on the study of the nature of complex and inverse complex functional dynamics using Ishikawa iterates and existence of relative superior Mandel-bar set.

In this paper the dynamics of the complex logarithmic function is investigated using the Ishikawa iterates. The fractal images generated from the generalized transformation function z z c log( ) n , n 2 are analyzed. Keywords : . : Complex dynamics, Relative Superior Mandelbrot Set, Relative Superior Julia set, Ishikawa Iteration and Midgets. Equivalently, the Julia set is also closure of the set of the repelling periodic points. These two definitions clearly illustrates the chaotic 1. INTRODUCTION The fractals generated from the self-squared function, z z c 2 where z and c are complex quantities, have been studied extensively in the literature[2, 8, 9 & 10 ]. A multitude of interesting, intriguing and rich families of fractals are generated by changing the complex function Fz () . This paper explores the dynamics of a complex logarithmic function. In 1918, French mathematician Gaston Julia[12] investigated the iteration process of a complex function intensively and attained a Julia set, which is a landmark in the field of fractal theory. The object Mandelbrot set on the other hand was given by Benoit B. Mandelbrot [13 ] in 1979. Recently, R. L. Devaney [ 5], [6 ] and [7] studied widely the behavior of the exponential function and analyzed the Julia sets under different conditions. We briefly recall the well known result for the family of the quadratic polynomial

We introduce in this paper the dynamics of Relative Superior Mandel-bar sets of inverse complex function for Ishikawa iteration. The z plane fractal images generated from the generalized transformation function 1 () n

We explore in this paper the dynamics of the inverse complex function using the Ishikawa iterates. The z plane fractal images generated from the generalized transformation function

We explore in this paper the dynamics of the complex function for non integer values, using the Ishikawa iterates. The z plane fractal images are studied for positive powers of the complex function while c plane fractals are analyzed for negative powers of the complex function.

We investigate in this paper the dynamics and the method of generating fractal images for Ishikawa iteration procedure. The geometry of relative superior Julia sets are explored for Ishikawa iteration.

We introduce in this paper the dynamics of Relative Superior Tricorn and Multicorns for Ishikawa iteration.

We introduce in this paper the dynamics for Ishikawa iteration procedure. The geometry of Relative Superior Mandelbrot sets are explored for Ishikawa iterates. allowed to be complex numbers. In other words, i Keywords 2 Complex dynamics, Relative Superior Mandelbrot Set, Ishikawa Iteration.. 1. INTRODUCTION Complex graphics of nonlinear dynamical systems have been a subject of intense research nowadays. These graphics are generally obtained by “coloring” the escape speed of the seed points within the certain regions of the complex plane that give rise to the unbounded orbits. The complexity of the mathematical objects such as Julia sets and Mandelbrot sets, in spite of their deceitful simplicity of equations that generate them is truly overwhelming. Perhaps, the Mandelbrot set is the most popular object in the fractal theory. It is believed to be the most beautiful object not only in the real but also in the complex plane. This object was given by Benoit B. Mandelbrot in 1979 and has been the subject of intense research right from its advent. Mandelbrot set and its various extensions and variants have been extensively studied using Picard’s iterations. Recently M. Rani and V. Kumar[21] introduced the superior Mandelbrot sets using Mann iteration procedure. We introduce in this paper a new class of Mandelbrot sets named as Relative Superior Mandelbrot sets using Ishikawa iterations. Our study shows that Relative Superior Mandelbrot sets are exclusively elite and effectively different from other Mandelbrot sets existing in the present literature.

Inspired by the study of Julia sets using switched processes by Lakhtakia and generation of new fractals by composite functions by Shirriff, we study the effect of switched processes on superior Julia sets given by Rani and Kumar. Further, symmetry for such processes is also discussed in the paper.

Inspired by the study of noise of the Mandelbrot map in two parameter deformation family, we introduce a new noise criterion and analyze its effect on the usual and superior Mandelbrot maps.

The C–K function, generally called Carotid–Kundalini function, is given by z j +1 = cos ( N z j cos −1 ( z j )) + c . Taking c = (0, 0), Cooper has presented some interesting Julia sets for the C–K function. In this paper, we introduce a new process of generation for the C–K function, and obtain some interesting variants of Julia sets generated by Cooper.

High temperature performance of polymers depend mainly on their glass transition temperature Tg. Polymers with high Tg, however, often tend to have low toughness. In this work, a model polyethylene like polymer is analysed to understand the reason for this phenomenon. To this end, molecular dynamics simulations are performed to investigate the effect of various factors on glass transition and yielding. Two generic modifications to the model polymer are suggested for enhancing its Tg and the effect of these modifications on the stress–strain behaviour are studied. Results indicate that when non-bonded interactions govern the energetics of the deformation process, a polymer with a high energetic barrier to torsional changes will lead to a higher Tg without significantly compromising the toughness. On the other hand, strong non-bonded interactions also promote high Tg but lead to a brittle material.