Search results for: AI algorithm internal audit

Authors: Sait Ali Uymaz, Gülay Tezel

Abstract:

This paper presents the comparison results on the performance of the Cuckoo Search (CS) algorithm for constrained optimization problems. For constraint handling, CS algorithm uses penalty method. CS algorithm is tested on thirteen well-known test problems and the results obtained are compared to Particle Swarm Optimization (PSO) algorithm. Mean, best, median and worst values were employed for the analyses of performance.

Keywords: cuckoo search, particle swarm optimization, constrained optimization problems, penalty method

Procedia PDF Downloads 523

Authors: Jamil Ahmed

Abstract:

Left to Right-Right Most (LR) parsing algorithm is a widely used algorithm of syntax analysis. It is contingent on a parsing table, whereas the parsing tables are extracted from the grammar. The parsing table specifies the actions to be taken during parsing. It requires that the parsing table should have no action conflicts for the same input symbol. This requirement imposes a condition on the class of grammars over which the LR algorithms work. However, there are grammars for which the parsing tables hold action conflicts. In such cases, the algorithm needs a capability of scanning (looking-ahead) next input symbols ahead of the current input symbol. In this paper, a ‘Left to Right’-‘Right Most’ parsing algorithm with lookahead capability is introduced. The 'look-ahead' capability in the LR parsing algorithm is the major contribution of this paper. The practicality of the proposed algorithm is substantiated by the parser implementation of the Context Free Grammar (CFG) of an already proposed programming language 'State Controlled Object Oriented Programming' (SCOOP). SCOOP’s Context Free Grammar has 125 productions and 192 item sets. This algorithm parses SCOOP while the grammar requires to ‘look ahead’ the input symbols due to action conflicts in its parsing table. Proposed LR parsing algorithm with lookahead capability can be viewed as an optimization of ‘Simple Left to Right’-‘Right Most’ (SLR) parsing algorithm.

Keywords: left to right-right most parsing, syntax analysis, bottom-up parsing algorithm

Procedia PDF Downloads 92

Authors: Waseem Al Talalwah, Shorok Ali Al Dorazi, Roger Soames

Abstract:

The inferior gluteal artery is a largest branch of the anterior division of internal iliac artery. It escapes from the pelvic cavity through the greater sciatic foramen below the lower edge of piriformis. In gluteal region, it provides several muscular branches to gluteal maximus and articular branch to hip joint. Further, it provides sciatic branch to sciatic nerve. Present study explores the origin of the inferior gluteal artery of 41 cadavers in Centre for Anatomy and Human Identification, University of Dundee, UK. It arose directly from the anterior division of internal iliac artery in 39% and 45.7% indirectly as with the internal pudendal artery. Further, it arose indirectly from anterior division with internal pudendal and obturator arteries in 1.5% referred as obturatogluteopudendal trunk in 1.5%. Therefore, it arose from the anterior division of the internal iliac artery in 86.2%. However, it found to be as a branch of the posterior division of internal iliac artery in 7.7% which is either a direct branch in 6.2% as or indirect branch (as from the sciatic artery) in 1.5%. It neither arose from anterior or posterior division in 1.5% as from gluteopudendal trunk arising from the internal iliac artery bifurcation site. In few cases, the inferior gluteal artery found to be congenital absence in 4.6% which is compensated by the persistent sciatic artery. Therefore, radiologists have to aware of the origin variability of the inferior gluteal artery to alert surgeons. Knowing the origin of the inferior gluteal artery may help the surgeons to avoid iatrogenic sciatic neuropathy or gluteal claudication due to prolonged ligation in pelvic procedures such as removing prostate or of uterine fibroid.

Keywords: inferior gluteal artery, internal pudendal, sciatic nerve, sciatic artery, gluteal claudication, sciatic neuopathy

Procedia PDF Downloads 643

Authors: Serges Mendomo Meye, Li Guowei, Shen Zhenzhong, Gan Lei, Xu Liqun

Abstract:

Given the limitations of the original whale optimization algorithm (WAO) in local optimum and low convergence accuracy in truss structure optimization problems, based on the fundamental whale algorithm, an improved whale optimization algorithm (SWAO) based on information entropy is proposed. The information entropy itself is an uncertain measure. It is used to control the range of whale searches in path selection. It can overcome the shortcomings of the basic whale optimization algorithm (WAO) and can improve the global convergence speed of the algorithm. Taking truss structure as the optimization research object, the mathematical model of truss structure optimization is established; the cross-sectional area of truss is taken as the design variable; the objective function is the weight of truss structure; and an improved whale optimization algorithm (SWAO) is used for optimization design, which provides a new idea and means for its application in large and complex engineering structure optimization design.

Keywords: information entropy, structural optimization, truss structure, whale algorithm

Procedia PDF Downloads 209

Authors: Abhishek Bhardwaj, Manish Kumar Bajpai

Abstract:

An image with its content and schema of colors presents an effective mode of information sharing and processing. By changing its color schema different visions and prospect are discovered by the users. This phenomenon of color transfer is being used by Social media and other channel of entertainment. Reinhard et al’s algorithm was the first one to solve this problem of color transfer. In this paper, we make this algorithm efficient by introducing domain parallelism among different processors. We also comment on the factors that affect the speedup of this problem. In the end by analyzing the experimental data we claim to propose a novel and efficient parallel Reinhard’s algorithm.

Keywords: Reinhard et al’s algorithm, color transferring, parallelism, speedup

Procedia PDF Downloads 583

Authors: Abdullah Eqal Al Mazrooei

Abstract:

Kalman filter is a famous algorithm that utilizes to estimate the state in the linear systems. It has numerous applications in technology and science. Since of the most of applications in real life can be described by nonlinear systems. So, Kalman filter does not work with the nonlinear systems because it is suitable to linear systems only. In this work, a nonlinear filtering algorithm is presented which is suitable to use with the special kinds of nonlinear systems. This filter generalizes the Kalman filter. This means that this filter also can be used for the linear systems. Our algorithm depends on a special linearization of the second degree. We introduced the nonlinear algorithm with a bilinear state-space model. A simulation example is presented to illustrate the efficiency of the algorithm.

Keywords: Kalman filter, filtering algorithm, nonlinear systems, state-space model

Procedia PDF Downloads 347

Authors: Li Ni, Pen ManMan, Li KenLi

Abstract:

Clustering is an intensive research for some years because of its multifaceted applications, such as biology, information retrieval, medicine, business and so on. The expectation maximization (EM) is a kind of algorithm framework in clustering methods, one of the ten algorithms of machine learning. Traditionally, optimization of objective function has been the standard approach in EM. Hence, research has investigated the utility of evolutionary computing and related techniques in the regard. Chemical Reaction Optimization (CRO) is a recently established method. So the property embedded in CRO is used to solve optimization problems. This paper presents an algorithm framework (EM-CRO) with modified CRO operators based on EM cluster problems. The hybrid algorithm is mainly to solve the problem of initial value sensitivity of the objective function optimization clustering algorithm. Our experiments mainly take the EM classic algorithm:k-means and fuzzy k-means as an example, through the CRO algorithm to optimize its initial value, get K-means-CRO and FKM-CRO algorithm. The experimental results of them show that there is improved efficiency for solving objective function optimization clustering problems.

Keywords: chemical reaction optimization, expection maimization, initia, objective function clustering

Procedia PDF Downloads 682

Authors: M. F. F. Ab Rashid, A. N. Mohd Rose, N. M. Z. Nik Mohamed, W. S. Wan Harun, S. A. Che Ghani

Abstract:

Traveling salesman problem with precedence constraint (TSPPC) is one of the most complex problems in combinatorial optimization. The existing algorithms to solve TSPPC cost large computational time to find the optimal solution. The purpose of this paper is to present an efficient genetic algorithm that guarantees optimal solution with less number of generations and iterations time. Unlike the existing algorithm that generates priority factor as chromosome, the proposed algorithm directly generates sequence of solution as chromosome. As a result, the proposed algorithm is capable of generating optimal solution with smaller number of generations and iteration time compare to existing algorithm.

Keywords: traveling salesman problem, sequencing, genetic algorithm, precedence constraint

Procedia PDF Downloads 534

Authors: Ademuyiwa Agbonyin, Stamatis Zoras, Mohammad Zandi

Abstract:

This paper investigates the extent to which building energy modelling can be informed based on preliminary information provided by infrared thermography using a thermal imaging camera in a walkthrough audit. The case-study building is the Sheffield Cathedral, built in the early 1400s. Based on an informative qualitative report generated from the thermal images taken at the site, the regions showing significant heat loss are input into a computer model of the cathedral within the integrated environmental solution (IES) virtual environment software which performs an energy simulation to determine quantitative heat losses through the building envelope. Building data such as material thermal properties and building plans are provided by the architects, Thomas Ford and Partners Ltd. The results of the modelling revealed the portions of the building with the highest heat loss and these aligned with those suggested by the thermal camera. Retrofit options for the building are also considered, however, may not see implementation due to a desire to conserve the architectural heritage of the building. Results show that thermal imaging in a walk-through audit serves as a useful guide for the energy modelling process. Hand calculations were also performed to serve as a 'control' to estimate losses, providing a second set of data points of comparison.

Keywords: historic buildings, energy retrofit, thermal comfort, software modelling, energy modelling

Procedia PDF Downloads 136

Authors: Elsayeda M. Elgaml, Dina M. Ibrahim, Elsayed A. Sallam

Abstract:

Association rule mining is one of the most important fields of data mining and knowledge discovery. In this paper, we propose an efficient multiple support frequent pattern growth algorithm which we called “MSFP-growth” that enhancing the FP-growth algorithm by making infrequent child node pruning step with multiple minimum support using maximum constrains. The algorithm is implemented, and it is compared with other common algorithms: Apriori-multiple minimum supports using maximum constraints and FP-growth. The experimental results show that the rule mining from the proposed algorithm are interesting and our algorithm achieved better performance than other algorithms without scarifying the accuracy.

Keywords: association rules, FP-growth, multiple minimum supports, Weka tool

Procedia PDF Downloads 449

Authors: Bassem Saleh, Hussam Nusair, Nariman Al Zubadi, Shams Al Shloul, Usama Saleh

Abstract:

The nursing round system (NRS) means checking patients on an hourly basis during the A (0700–2200 h) shift and once every 2 h during the B (2200–0700 h) by the assigned nursing staff. The overall goal of this prospective study is to implement an NRS in a major rehabilitation centre—Sultan Bin Abdulaziz Humanitarian City—in the Riyadh area of the Kingdom of Saudi Arabia. The purposes of this study are to measure the effect of the NRS on: (i) the use of patient call light; (ii) the number of incidences of patients’ fall; (iii) the number of incidences of hospital-acquired bed sores; and (iv) the level of patients’ satisfaction. All patients hospitalized in the male stroke unit will be involved in this study. For the period of 8 weeks (17 December 2009–17 February 2010) All Nursing staff on the unit will record each call light and the patient’s need. Implementation of the NRS would start on 18 February 2010 and last for 8 weeks, until 18 April 2010. Data collected throughout this period will be compared with data collected during the 8 weeks period immediately preceding the implementation of the NRS (17 December 2009–17 February 2010) in order to measure the impact of the call light use. The following information were collected on all subjects involved in the study: (i) the Demographic Information Form; (ii) authors’ developed NRS Audit Form; (iii) Patient Call Light Audit Form; (iv) Patient Fall Audit Record; (v) Hospital-Acquired Bed Sores Audit Form; and (vi) hospital developed Patient Satisfaction Records. The findings suggested that a significant reduction on the use of call bell (P < 0.001), a significant reduction of fall incidence (P < 0.01) while pressure ulcer reduced by 50% before and after the implementation of NRS. In addition, the implementation of NRS increased patient satisfaction by 7/5 (P < 0.05).

Keywords: call light, patient-care management, patient safety, patient satisfaction, rounds

Procedia PDF Downloads 334

Authors: Li Dan, Zhao Junsuo, Zhang Wenjun

Abstract:

Aiming at the shortcomings of the Quantum Genetic Algorithm such as the multimodal function optimization problems easily falling into the local optimum, and vulnerable to premature convergence due to no closely relationship between individuals, the paper presents an Improved Many Worlds Quantum Genetic Algorithm (IMWQGA). The paper using the concept of Many Worlds; using the derivative way of parallel worlds’ parallel evolution; putting forward the thought which updating the population according to the main body; adopting the transition methods such as parallel transition, backtracking, travel forth. In addition, the algorithm in the paper also proposes the quantum training operator and the combinatorial optimization operator as new operators of quantum genetic algorithm.

Keywords: quantum genetic algorithm, many worlds, quantum training operator, combinatorial optimization operator

Procedia PDF Downloads 708

Authors: Kunal Tongaria, Abhishek Mangal, S. Mandal, Devendra Mohan

Abstract:

The carbonation of concrete is a phenomenon which is a function of various interdependent parameters. Therefore, in spite of numerous literature and database, the useful generalization is not an easy task. These interdependent parameters can be grouped under the category of internal and external factors. This paper focuses on the internal parameters which govern and increase the probability of the ingress of deleterious substances into concrete. The mechanism of effects of internal parameters such as microstructure for with and without supplementary cementing materials (SCM), water/binder ratio, the age of concrete etc. has been discussed. This is followed by the comparison of various proposed mathematical models for the deterioration of concrete. Based on existing laboratory experiments as well as field results, this paper concludes the present understanding of mechanism, modeling and future research needs in this field.

Keywords: carbonation, diffusion coefficient, microstructure of concrete, reinforced concrete

Procedia PDF Downloads 379

Authors: Peng Lu, Liu Ting

Abstract:

Because of the difficulty of financing from the external capital market, the reorganization and merger of private enterprises have formed a family group, seeking the help of the internal capital market to alleviate the capital demand. However, the inefficiency of the internal capital market can damage the effect it should have played, and even hinder the development of enterprises. This paper takes the "Tomorrow Group" as the research object to carry on the case analysis. After using the improved cash flow sensitivity coefficient to measure the efficiency of the internal capital market of Tomorrow Group, the inefficiency phenomenon is found. Then the analysis reveals that the reasons for its inefficiency include that the pyramidal equity structure is conducive to control, the separation of cash flow rights and control rights, the concentration of equity leads to poor balance, the abandonment of real industries and information asymmetry.

Keywords: tomorrow group, internal capital market, related-party transactions, Baotou tomorrow technology Co., LTD

Procedia PDF Downloads 97

Authors: Jihen Bennaceur, Wissem Zouaghi, Ali Mabrouk

Abstract:

The major aim of cyber threat intelligence (CTI) is to provide sophisticated knowledge about cybersecurity threats to ensure internal and external safeguards against modern cyberattacks. Inaccurate, incomplete, outdated, and invaluable threat intelligence is the main problem. Therefore, data analysis based on AI algorithms is one of the emergent solutions to overcome the threat of information-sharing issues. In this paper, we propose a supervised machine learning-based algorithm to improve threat information sharing by providing a sophisticated classification of cyber threats and data. Extensive simulations investigate the accuracy, precision, recall, f1-score, and support overall to validate the designed algorithm and to compare it with several supervised machine learning algorithms.

Keywords: threat information sharing, supervised learning, data classification, performance evaluation

Procedia PDF Downloads 114

Authors: Efrizal, Ferdiansyah, Noorlailie Soewarno, Bambang Tjahjadi

Abstract:

Tax revenue plays an important role in the State Budget of the Government of Indonesia (GOI). The GOI keeps raising tax revenue portion of the Budget from year to year. The low tax ratio of 11 percent in Indonesia shows a big opportunity to collect taxes in the future. The Directorate General of Taxation (DGT) is the institution mandated by the Law to collect tax revenue. This is a case study using quantitative and qualitative approaches. This study introduces contingent factors of taxpayers’ compliance as the mediating variable and internal business process as the independent variable. This study aims to empirically test the contingency theory, especially the mediating effect of taxpayers’ compliance on internal business process-tax revenue relationship. Internal business processes of the DGT include servicing, counseling, expanding, supervising, inspecting, and enforcing. The secondary data of 31 regional offices representing 293 tax offices in Indonesia was collected and analyzed using Partial Least Square. The result showed the following: (1) internal business process affected tax revenue; (2) taxpayers’ compliance did not mediate internal business processes - tax revenue relationship, and (3) taxpayers’ compliance affected tax revenue. In-depth interviews revealed that the DGT needs to make more innovations in business processes in the future.

Keywords: innovations, internal business process, taxpayers’ compliance, tax revenue

Procedia PDF Downloads 323

Authors: Nhat-To Huynh, Chen-Fu Chien

Abstract:

Textile batch dyeing scheduling problem is complicated which includes batch formation, batch assignment on machines, batch sequencing with sequence-dependent setup time. Most manufacturers schedule their orders manually that are time consuming and inefficient. More power methods are needed to improve the solution. Motivated by the real needs, this study aims to propose approaches in which genetic algorithm is developed with multi-subpopulation and hybridised with estimation of distribution algorithm to solve the constructed problem for minimising the makespan. A heuristic algorithm is designed and embedded into the proposed algorithms to improve the ability to get out of the local optima. In addition, an empirical study is conducted in a textile company in Taiwan to validate the proposed approaches. The results have showed that proposed approaches are more efficient than simulated annealing algorithm.

Keywords: estimation of distribution algorithm, genetic algorithm, multi-subpopulation, scheduling, textile dyeing

Procedia PDF Downloads 273

Authors: Paul Okonkwo, Howard Smith

Abstract:

A study to estimate the size of the cabin and major aircraft components as well as detect and avoid interference between internally placed components and the external surface, during the conceptual design synthesis and optimisation to explore the design space of a BWB, was conducted. Sizing of components follows the Bradley cabin sizing and rubber engine scaling procedures to size the cabin and engine respectively. The interference detection and avoidance algorithm relies on the ability of the Class Shape Transform parameterisation technique to generate polynomial functions of the surfaces of a BWB aircraft configuration from the sizes of the cabin and internal objects using few variables. Interference detection is essential in packaging of non-conventional configuration like the BWB because of the non-uniform airfoil-shaped sections and resultant varying internal space. The unique configuration increases the need for a methodology to prevent objects from being placed in locations that do not sufficiently enclose them within the geometry.

Keywords: packaging, optimisation, BWB, parameterisation, aircraft conceptual design

Procedia PDF Downloads 441

Authors: Keunhong Chae, Seokho Yoon

Abstract:

We propose a code acquisition scheme called improved multiple-shift (IMS) for optical code division multiple access systems, where the optical orthogonal code is used instead of the pseudo noise code. Although the IMS algorithm has a similar process to that of the conventional MS algorithm, it has a better code acquisition performance than the conventional MS algorithm. We analyze the code acquisition performance of the IMS algorithm and compare the code acquisition performances of the MS and the IMS algorithms in single-user and multi-user environments.

Keywords: code acquisition, optical CDMA, optical orthogonal code, serial algorithm

Procedia PDF Downloads 502

Authors: Tai Nguyen, Minh Bui, Huong Ninh, Tu Nguyen, Hai Tran

Abstract:

GraphCut algorithm has been widely utilized to solve various types of computer vision problems. Its expensive computational cost encouraged many researchers to improve the speed of the algorithm. Recent works proposed schemes that work on parallel computing platforms such as CUDA. However, the problem of low convergence speed prevents the usage of GraphCut for real time applications. In this paper, we propose global suppression heuristic to boost the conver-gence process of the algorithm. A parallel implementation of GraphCut algorithm on CUDA designed for the image stitching problem is introduced. Our method achieves up to 3× time boost on the graph of size 80 × 480 compared to the best sequential GraphCut algorithm while achieving satisfactory stitched images, suitable for panorama applications. Our source code will be soon available for further research.

Keywords: CUDA, graph cut, image stitching, texture synthesis, maxflow/mincut algorithm

Procedia PDF Downloads 94

Authors: Dalson Figueiredo, Enivaldo Rocha, Ranulfo Paranhos, José Alexandre

Abstract:

This paper analyzes the effects of institutional capacity on corruption. Methodologically, the research design combines both descriptive and multivariate statistics to examine two original datasets based on secondary data. In particular, we employ a principal component model to estimate an indicator of institutional capacity for both state audit institutions and subnational judiciary courts. Then, we estimate the effect of institutional capacity on two dependent variables: (1) incidence of administrative irregularities and (2) time elapsed to judge corruption cases. The preliminary results using ordinary least squares, negative binomial and Tobit models suggest the same conclusions: higher the institutional audit capacity, higher is the probability of detecting a corruption case. On the other hand, higher the institutional capacity of state judiciary, the lower is the time to judge corruption cases.

Keywords: institutional capacity, corruption, state level institutions, evidence from Brazil

Procedia PDF Downloads 324

Authors: M. Fernanda Salgado, Alfonso Tierra, Wilbert Aguilar

Abstract:

The present project consists in applying the informed search algorithm A star (A*) to solve traveler problems, applying it by urban public transportation routes. The digitization of the information allowed to identify 26% of the total of routes that are registered within the Metropolitan District of Quito. For the validation of this information, data were taken in field on the travel times and the difference with respect to the times estimated by the program, resulting in that the difference between them was not greater than 2:20 minutes. We validate A* algorithm with the Dijkstra algorithm, comparing nodes vectors based on the public transport stops, the validation was established through the student t-test hypothesis. Then we verified that the times estimated by the program using the A* algorithm are similar to those registered on field. Furthermore, we review the performance of the algorithm generating iterations in both algorithms. Finally, with these iterations, a hypothesis test was carried out again with student t-test where it was concluded that the iterations of the base algorithm Dijsktra are greater than those generated by the algorithm A*.

Keywords: algorithm A*, graph, mobility, public transport, travel planning, routes

Procedia PDF Downloads 209

Authors: Abdurrahim Dal, Tuncay Karaçay

Abstract:

Dynamics of a rotor supported by air bearings is strongly depends on the pressure distribution between the rotor and the bearing. In this study, internal pressure in air bearings is numerical and experimental analyzed for different radial clearances. Firstly the pressure distribution between rotor and bearing is modeled using Reynold's equation and this model is solved numerically. The rotor-bearing system is also modeled in four degree of freedom and it is simulated for different radial clearances. Then, in order to validate numerical results, a test rig is designed and the rotor bearing system is run under the same operational conditions. Pressure signals of left and right bearings are recorded. Internal pressure variations are compared for numerical and experimental results for different radial clearances.

Keywords: air bearing, internal pressure, Reynold’s equation, rotor

Procedia PDF Downloads 397

Authors: Waseem Al Talalwah, Shorok Al Dorazi, Roger Soames

Abstract:

The inferior gluteal artery is a prominent branch of the anterior trunk of internal iliac artery. It escapes from the pelvic cavity through the greater sciatic foramen below the lower edge of piriformis. In gluteal region, it provides several muscular branches to gluteal maximus and articular branch to hip joint. Further, it provides sciatic branch to sciatic nerve. Current study investigates the origin of the inferior gluteal artery of 41 cadavers in Centre for Anatomy and Human Identification, University of Dundee, UK. It arose from the anterior trunk in 37.5% independently and 45.7% dependently as with the internal pudendal artery. Therefore, it arose from the anterior trunk in 83.2%. However, it found to be as a branch of the posterior trunk of internal iliac artery in 7.7% which is either a direct branch in 6.2% as or indirect branch in 1.5%. Beside the inferior gluteal artery arose with internal pudendal artery as from GPT of anterior division in 45.7%, it arose from the GPT arising from the internal iliac artery bifurcation site in 1.5%. Further, the inferior gluteal artery arose from the trunk with internal pudendal and obturator arteries in 1.5% referred as obturatogluteopudendal trunk. Occasionally, it arose from the sciatic artery in 1.5%. In few cases, the inferior gluteal artery found to be congenital absence in 4.6% which is compensated by the persistent sciatic artery. Therefore, radiologists have to aware of the origin variability of the inferior gluteal artery to alert surgeons. Knowing the origin of the inferior gluteal artery may help the surgeons to avoid iatrogenic sciatic neuropathy in pelvic procedures such as removing prostate or of uterine fibroid. Further, it may also prevent avascular necrosis of femur neck as well as gluteal claudication.

Keywords: inferior gluteal artery, internal iliac artery, sciatic neuropathy, gluteal claudication

Procedia PDF Downloads 323

Authors: E. Behmanesh, J. Pannek

Abstract:

The distribution-allocation problem is known as one of the most comprehensive strategic decision. In real-world cases, it is impossible to solve a distribution-allocation problem in traditional ways with acceptable time. Hence researchers develop efficient non-traditional techniques for the large-term operation of the whole supply chain. These techniques provide near-optimal solutions particularly for large scales test problems. This paper, presents an integrated supply chain model which is flexible in the delivery path. As the solution methodology, we apply a memetic algorithm with a novelty in population presentation. To illustrate the performance of the proposed memetic algorithm, LINGO optimization software serves as a comparison basis for small size problems. In large size cases that we are dealing with in the real world, the Genetic algorithm as the second metaheuristic algorithm is considered to compare the results and show the efficiency of the memetic algorithm.

Keywords: integrated logistics network, flexible path, memetic algorithm, genetic algorithm

Procedia PDF Downloads 348

Authors: Daliyah S. Aljutaili, Redna A. Almutlaq, Suha A. Alharbi, Dina M. Ibrahim

Abstract:

All currencies around the world look very different from each other. For instance, the size, color, and pattern of the paper are different. With the development of modern banking services, automatic methods for paper currency recognition become important in many applications like vending machines. One of the currency recognition architecture’s phases is Feature detection and description. There are many algorithms that are used for this phase, but they still have some disadvantages. This paper proposes a feature detection algorithm, which merges the advantages given in the current SIFT and SURF algorithms, which we call, Speeded up Robust Scale-Invariant Feature Transform (SR-SIFT) algorithm. Our proposed SR-SIFT algorithm overcomes the problems of both the SIFT and SURF algorithms. The proposed algorithm aims to speed up the SIFT feature detection algorithm and keep it robust. Simulation results demonstrate that the proposed SR-SIFT algorithm decreases the average response time, especially in small and minimum number of best key points, increases the distribution of the number of best key points on the surface of the currency. Furthermore, the proposed algorithm increases the accuracy of the true best point distribution inside the currency edge than the other two algorithms.

Keywords: currency recognition, feature detection and description, SIFT algorithm, SURF algorithm, speeded up and robust features

Procedia PDF Downloads 209

Authors: P. Shrivastava, A. Shukla, K. Verma, S. Rungta

Abstract:

Parkinson's disease is a chronic neurological disorder that directly affects human gait. It leads to slowness of movement, causes muscle rigidity and tremors. Gait serve as a primary outcome measure for studies aiming at early recognition of disease. Using gait techniques, this paper implements efficient binary bat algorithm for an early detection of Parkinson's disease by selecting optimal features required for classification of affected patients from others. The data of 166 people, both fit and affected is collected and optimal feature selection is done using PSO and Bat algorithm. The reduced dataset is then classified using neural network. The experiments indicate that binary bat algorithm outperforms traditional PSO and genetic algorithm and gives a fairly good recognition rate even with the reduced dataset.

Keywords: parkinson, gait, feature selection, bat algorithm

Procedia PDF Downloads 512

Authors: Najmeh Mohsenifar, Narjes Mohsenifar, Abbas Kargar

Abstract:

In this paper, has been presented a stable method for predicting the ECG signals through the RBF neural networks, by the PSO algorithm. In spite of quasi-periodic ECG signal from a healthy person, there are distortions in electro cardiographic data for a patient. Therefore, there is no precise mathematical model for prediction. Here, we have exploited neural networks that are capable of complicated nonlinear mapping. Although the architecture and spread of RBF networks are usually selected through trial and error, the PSO algorithm has been used for choosing the best neural network. In this way, 2 second of a recorded ECG signal is employed to predict duration of 20 second in advance. Our simulations show that PSO algorithm can find the RBF neural network with minimum MSE and the accuracy of the predicted ECG signal is 97 %.

Keywords: electrocardiogram, RBF artificial neural network, PSO algorithm, predict, accuracy

Procedia PDF Downloads 591

Authors: Xiuqin Ma, Hongwu Qin

Abstract:

A new efficient normal parameter reduction algorithm of soft set in decision making was proposed. However, up to the present, few documents have focused on real-life applications of this algorithm. Accordingly, we apply a New Efficient Normal Parameter Reduction algorithm into real-life datasets of online shopping, such as Blackberry Mobile Phone Dataset. Experimental results show that this algorithm is not only suitable but feasible for dealing with the online shopping.

Keywords: soft sets, parameter reduction, normal parameter reduction, online shopping

Procedia PDF Downloads 485

Authors: Raid Hommady, Waseem Al-Talalwah, Shorok Al Dorazi, Roger Soames

Abstract:

The iliolumbar artery is a regular branch of posterior division of the internal iliac artery. The present study investigate 82 specimens to identify the origin of iliolumbar artery. The present study targets the sciatic nerve root supply from iliolumbar artery based on its origin and course. In present study, the ililumbar artery arose from the posterior division of internal iliac artery in 52.2%. In few cases, it arose from dorsomedial aspect of the internal iliac artery in 28.8%. In few cases, the iliolumbar artery arose from the dorsal aspects of the internal iliac artery as well as from the common and external iliac artery 1.7%. Also, the iliolumbar artery arose from the sciatic artery as well as from superior and inferior gluteal arteries in 5.1%. Conversely, it found to be congenital absent in 8.5%. Therefore, the posterior trunk of the internal iliac artery is the most common origin of the iliolumbar artery. With the origin variability of the iliolumbar artery, there is a vascular supply variability of the lumbosacral trunk and sacral root of sciatic nerve. The iliolumbar artery provides vascular supply for lumbosacral trunk 57.3% in whereas the sacral root in 5.1%. As a result, surgeons should pay attention to these variations to decrease iatrogenic fault.

Keywords: iliolumbar, sciatic artery, internal iliac, external iliac, posterior division

Procedia PDF Downloads 290