Search results for: modified backtracking search algorithm

Authors: Ameen Jameel Alawneh

Abstract:

A Mobile ad-hoc network (MANET) is a collection of wireless mobile hosts that dynamically form a temporary network without the aid of a system administrator. It has neither fixed infrastructure nor wireless ad hoc sessions. It inherently reaches several nodes with a single transmission, and each node functions as both a host and a router. The network maybe represented as a set of clusters each managed by clusterhead. The cluster size is not fixed and it depends on the movement of nodes. We proposed a clusterhead size algorithm (CHSize). This clustering algorithm can be used by several routing algorithms for ad hoc networks. An elected clusterhead is assigned for communication with all other clusters. Analysis and simulation of the algorithm has been implemented using GloMoSim networks simulator, MATLAB and MAPL11 proved that the proposed algorithm achieves the goals.

Keywords: simulation, MANET, Ad-hoc, cluster head size, linked cluster algorithm, loss and dropped packets

Procedia PDF Downloads 392

Authors: Cesar Hernández, Diego Giral, Ingrid Páez

Abstract:

This article proposes a hybrid algorithm for spectrum allocation in cognitive radio networks based on the algorithms Analytical Hierarchical Process (AHP) and Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) to improve the performance of the spectrum mobility of secondary users in cognitive radio networks. To calculate the level of performance of the proposed algorithm a comparative analysis between the proposed AHP-TOPSIS, Grey Relational Analysis (GRA) and Multiplicative Exponent Weighting (MEW) algorithm is performed. Four evaluation metrics is used. These metrics are the accumulative average of failed handoffs, the accumulative average of handoffs performed, the accumulative average of transmission bandwidth, and the accumulative average of the transmission delay. The results of the comparison show that AHP-TOPSIS Algorithm provides 2.4 times better performance compared to a GRA Algorithm and, 1.5 times better than the MEW Algorithm.

Keywords: cognitive radio, decision making, hybrid algorithm, spectrum handoff, wireless networks

Procedia PDF Downloads 541

Authors: Vincent Ballola, Raymund Dilan, Thelma Palaoag

Abstract:

The Smart Online Library Catalog System with Query Expansion seeks to address the low usage of the library because of the emergence of the Internet. Library users are not accustomed to catalog systems that need a query to have the exact words without any mistakes for decent results to appear. The graphical user interface of the current system has a rather skewed learning curve for users to adapt with. With a simple graphical user interface inspired by Google, users can search quickly just by inputting their query and hitting the search button. Because of the query expansion techniques incorporated into the new system such as stemming, thesaurus search, and weighted search, users can have more efficient results from their query. The system will be adding the root words of the user's query to the query itself which will then be cross-referenced to a thesaurus database to search for any synonyms that will be added to the query. The results will then be arranged by the number of times the word has been searched. Online queries will also be added to the results for additional references. Users showed notable increases in efficiency and usability due to the familiar interface and query expansion techniques incorporated in the system. The simple yet familiar design led to a better user experience. Users also said that they would be more inclined in using the library because of the new system. The incorporation of query expansion techniques gives a notable increase of results to users that in turn gives them a wider range of resources found in the library. Used books mean more knowledge imparted to the users.

Keywords: query expansion, catalog system, stemming, weighted search, usability, thesaurus search

Procedia PDF Downloads 388

Authors: F. Onyango, Salim R. Wanjala, M. Ndege, L. Masu

Abstract:

Asphalt concrete pavements have a short life cycle, failing mainly due to temperature changes, traffic loading and ageing. Modified asphalt mixtures provide the technology to produce a bituminous binder with improved viscoelastic properties which remain in balance over a wider temperature range and loading conditions. In this research, 60/70 penetration grade asphalt binder was modified by adding 2, 4, 6, 8, and 10 percent by weight of asphalt binder following the wet process and the mineral aggregate was modified by adding 1, 2, 3, 4, and 5 percent crumb rubber by volume of the mineral aggregate following the dry process. The LDPE modified asphalt binder Rheological properties were evaluated. The laboratory results showed an increase in viscosity, softening point and stiffness of the binder. The modified asphalt was then used in preparing asphalt mixtures by Marshall Mix design procedure. The Marshall stability values for mixes containing 2% crumb rubber and 4% LDPE were found to be 30% higher than the conventional asphalt concrete mix.

Keywords: crumb rubber, dry process, hot mix asphalt, wet process

Procedia PDF Downloads 367

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 126

Authors: Z. N. Ali, O. A. Babatunde, S. Garba, H. M. S. Haruna

Abstract:

The potency of modified and unmodified activated carbons prepared from shells of Cocos nucifera (coconut shell), straws of Pennisetum glaucum (millet) and Sorghum bicolor (sorghum) for adsorption of hydrogen sulphide gas were investigated using an adsorption apparatus (stainless steel cylinder) at constant temperature (ambient temperature). The adsorption equilibria states were obtained when the pressure indicated on the pressure gauge remained constant. After modification with nitric acid, results of the scanning electron microscopy of the unmodified and modified activated carbons showed that HNO3 greatly improved the formation of micropores and mesopores on the activated carbon surface. The adsorption of H2S gas was found to be highest in modified Cocos nucifera activated carbon with maximum monolayer coverage of 28.17 mg/g, and the adsorption processes were both physical and chemical with the physical process being predominant. The adsorption data were well fitted into the Langmuir isotherm model with the adsorption capacities of the activated carbons in the order modified Cocos nucifera > modified Pennisetum glaucum > modified Sorghum bicolor > unmodified Cocos nucifera > unmodified Pennisetum glaucum > unmodified Sorghum bicolour.

Keywords: activated carbon adsorption, hydrogen sulphide, nitric acid, modification, stainless steel cylinder

Procedia PDF Downloads 138

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 249

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 614

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 376

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 560

Authors: Shih-Ting Yang, Chih-Yun Lin, Ming-Yu Li, Jhong-Ting Syue, Wei-Ming Huang

Abstract:

Global positioning system (GPS) has become increasing precise in recent years, and the location-based service (LBS) has developed rapidly. Take the example of finding a parking lot (such as Parking apps). The location-based service can offer immediate information about a nearby parking lot, including the information about remaining parking spaces. However, it cannot provide expected search results according to the requirement situations of users. For that reason, this paper develops a “Location-based Search Approach according to Users’ Application Scenario” according to the location-based search and demand determination to help users obtain the information consistent with their requirements. The “Location-based Search Approach based on Users’ Application Scenario” of this paper consists of one mechanism and three kernel modules. First, in the Information Pre-processing Mechanism (IPM), this paper uses the cosine theorem to categorize the locations of users. Then, in the Information Category Evaluation Module (ICEM), the kNN (k-Nearest Neighbor) is employed to classify the browsing records of users. After that, in the Information Volume Level Determination Module (IVLDM), this paper makes a comparison between the number of users’ clicking the information at different locations and the average number of users’ clicking the information at a specific location, so as to evaluate the urgency of demand; then, the two-dimensional space is used to estimate the application situations of users. For the last step, in the Location-based Search Module (LBSM), this paper compares all search results and the average number of characters of the search results, categorizes the search results with the Manhattan Distance, and selects the results according to the application scenario of users. Additionally, this paper develops a Web-based system according to the methodology to demonstrate practical application of this paper. The application scenario-based estimate and the location-based search are used to evaluate the type and abundance of the information expected by the public at specific location, so that information demanders can obtain the information consistent with their application situations at specific location.

Keywords: data mining, knowledge management, location-based service, user application scenario

Procedia PDF Downloads 123

Authors: Howaidi M. Al-Otaibi, Abdulrahman S. Al-Suhaibani, Hamad A. Alsoliman

Abstract:

Fibers are extensively used in civil engineering applications for many years. In this study, empty fruit bunch of date palm trees were used to produce cellulose fiber that were used as additives in the asphalt binder. Two sizes (coarse and fine) of cellulose fibers were pre-blended in PG64-22 binder with various contents of 1.5%, 3%, 4.5%, 6%, and 7.5% by weight of asphalt binder. The physical and rheological properties of fiber modified asphalt binders were tested by using conventional tests such as penetration, softening point and viscosity; and SHRP test such as dynamic shear rheometer. The results indicated that the fiber modified asphalt binders were higher in softening point, viscosity, and complex shear modulus, and lower in penetration compared to pure asphalt. The fiber modified binders showed an improvement in rheological properties since it was possible to raise the control binder (pure asphalt) PG from 64 to 70 by adding 6% (by weight) of either fine or coarse fibers. Such improvement in stiffness of fiber modified binder is expected to improve pavement resistance to rutting.

Keywords: cellulose date palm fiber, fiber modified asphalt, physical properties, rheological properties

Procedia PDF Downloads 333

Authors: Tarek Aboueldahab, Hanan Farag

Abstract:

Cost minimization of Multiple Vehicle Routing Problem becomes a critical issue in the field of transportation because it is NP-hard optimization problem and the search space is complex. Many researches use the hybridization of artificial intelligence (AI) models to solve this problem; however, it can not guarantee to reach the best solution due to the difficulty of searching the whole search space. To overcome this problem, we introduce the hybrid model of Discrete Particle Swarm Optimization (DPSO) with a passive congregation which enable searching the whole search space to compromise between both local and global search. The practical experiment shows that our model obviously outperforms other hybrid models in cost minimization.

Keywords: cost minimization, multi-vehicle routing problem, passive congregation, discrete swarm, passive congregation

Procedia PDF Downloads 98

Authors: Gunasekaran Raja, Kottilingam Kottursamy, Rajakumar Arul, Ramkumar Jayaraman, Krithika Sairam, Lakshmi Ravi

Abstract:

The synchronization server maintains a dynamically changing cache, which contains the data items which were requested and collected by the mobile node from the server. The order and presence of tuples in the cache changes dynamically according to the frequency of updates performed on the data, by the server and client. To synchronize, the data which has been modified by client and the server at an instant are collected, batched together by the type of modification (insert/ update/ delete), and sorted according to their update frequencies. This ensures that the DCASH (Dynamic Cache Synchronization Algorithm for Heterogeneous Reverse Y synchronizing Mobile Database Systems) gives priority to the frequently accessed data with high usage. The optimal memory management algorithm is proposed to manage data items according to their frequency, theorems were written to show the current mobile data activity is reverse Y in nature and the experiments were tested with 2g and 3g networks for various mobile devices to show the reduced response time and energy consumption.

Keywords: mobile databases, synchronization, cache, response time

Procedia PDF Downloads 405

Authors: M. O. Olayiwola

Abstract:

Numerical solutions of the generalized Burger-Fisher are obtained using a Modified Variational Iteration Method (MVIM) with minimal computational efforts. The computed results with this technique have been compared with other results. The present method is seen to be a very reliable alternative method to some existing techniques for such nonlinear problems.

Keywords: burger-fisher, modified variational iteration method, lagrange multiplier, Taylor’s series, partial differential equation

Procedia PDF Downloads 430

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 485

Authors: González A. Julio, Ramírez L. Leonardo, Puerta A. Gabriel

Abstract:

Telemedicine services use a large amount of data, most of which are diagnostic images in Digital Imaging and Communications in Medicine (DICOM) and Health Level Seven (HL7) formats. Metadata is generated from each related image to support their identification. This study presents the use of decision trees for the optimization of information search processes for diagnostic images, hosted on the cloud server. To analyze the performance in the server, the following quality of service (QoS) metrics are evaluated: delay, bandwidth, jitter, latency and throughput in five test scenarios for a total of 26 experiments during the loading and downloading of DICOM images, hosted by the telemedicine group server of the Universidad Militar Nueva Granada, Bogotá, Colombia. By applying decision trees as a data mining technique and comparing it with the sequential search, it was possible to evaluate the search times of diagnostic images in the server. The results show that by using the metadata in decision trees, the search times are substantially improved, the computational resources are optimized and the request management of the telemedicine image service is improved. Based on the experiments carried out, search efficiency increased by 45% in relation to the sequential search, given that, when downloading a diagnostic image, false positives are avoided in management and acquisition processes of said information. It is concluded that, for the diagnostic images services in telemedicine, the technique of decision trees guarantees the accessibility and robustness in the acquisition and manipulation of medical images, in improvement of the diagnoses and medical procedures in patients.

Keywords: cloud storage, decision trees, diagnostic image, search, telemedicine

Procedia PDF Downloads 204

Authors: Piyush Pal, Rahul Dev

Abstract:

Water is essential for life and fresh water is a finite resource that is becoming scarce day by day even though it is recycled by hydrological cycle. The fresh water reserves are being polluted due to expanding irrigation, industries, urban population and its development. Contaminated water leads to several health problems. With the increasing demand of fresh water, solar distillation is an alternate solution which uses solar energy to evaporate water and then to condense it, thereby collecting distilled water within or outside the same system to use it as potable water. The structure that houses the process is known as a 'solar still'. In this paper, ‘Modified double slope solar still (MDSSS)’ & 'Modified double slope basin type multiwick solar still (MDSBMSS)' have been designed to convert saline, brackish water into drinking water. In this work two different modified solar stills are fabricated to study the performance of these solar stills. For modification of solar stills, Fibre Reinforced Plastic (FRP) and Acrylic sheets are used. The experiments in MDSBMSS and MDSSS was carried on 10 September 2015 & 5 November 2015 respectively. Performances of the stills were investigated. The amount of distillate has been found 3624 Ml/day in MDSBMSS on 10 September 2015 and 2400 Ml/day in MDSSS on 5 November 2015.

Keywords: contaminated water, conventional solar still, modified solar still, wick

Procedia PDF Downloads 432

Authors: Shin-Yi Mao, Jiashing Yu

Abstract:

Decellularized adipose tissue (DAT) has received lots of attention as biological scaffolds recently. DAT that extracted from the extracellular matrix (ECM) of adipose tissues holds great promise as a xenogeneic biomaterial for tissue engineering and regenerative medicine. In our study, 2-D DATsol film was fabricated to enhance cell adhesion, proliferation, and differentiation of ASCs in vitro. DAT was also used to modify alginate for improvement of cell adhesion. Alginate microspheres modified with DAT were prepared by Nisco. These microspheres could provide a highly supportive 3-D environment for ASCs. In our works, ASCs were immobilized in alginate microspheres modified with DAT to promoted cell adhesion and adipogenic differentiation. Accordingly, we hypothesize that tissue regeneration in vivo could be promoted with the aid of modified microspheres in future.

Keywords: adipose stem cells, decellularize adipose tissue, Alginate, microcarries

Procedia PDF Downloads 444

Authors: Takahiro Nishigaki, Takashi Onoda

Abstract:

In recent years, the number of document data has been increasing since the spread of the Internet. Many methods have been studied for extracting topics from large document data. We proposed Independent Topic Analysis (ITA) to extract topics independent of each other from large document data such as newspaper data. ITA is a method for extracting the independent topics from the document data by using the Independent Component Analysis. The topic represented by ITA is represented by a set of words. However, the set of words is quite different from the topics the user imagines. For example, the top five words with high independence of a topic are as follows. Topic1 = {"scor", "game", "lead", "quarter", "rebound"}. This Topic 1 is considered to represent the topic of "SPORTS". This topic name "SPORTS" has to be attached by the user. ITA cannot name topics. Therefore, in this research, we propose a method to obtain topics easy for people to understand by using the web search engine, topics given by the set of words given by independent topic analysis. In particular, we search a set of topical words, and the title of the homepage of the search result is taken as the topic name. And we also use the proposed method for some data and verify its effectiveness.

Keywords: independent topic analysis, topic extraction, topic naming, web search engine

Procedia PDF Downloads 119

Authors: Nouf M. Al-Ourfi, A. S. Bashammakh, M. S. El-Shahawi

Abstract:

The redox behavior of dianabol steroid (DS) on Nafion Multiwalled Carbon nano -tubes (MWCNT) composite film modified glassy carbon electrode (GCE) in various buffer solutions was studied using cyclic voltammetry (CV) and differential pulse- adsorptive cathodic stripping voltammetry (DP-CSV) and successfully compared with the results at non modified bare GCE. The Nafion-MWCNT composite film modified GCE exhibited the best electrochemical response among the two electrodes for the electro reduction of DS that was inferred from the EIS, CV and DP-CSV. The modified sensor showed a sensitive, stable and linear response in the concentration range of 5 – 100 nM with a detection limit of 0.08 nM. The selectivity of the proposed sensor was assessed in the presence of high concentration of major interfering species. The analytical application of the sensor for the quantification of DS in pharmaceutical formulations and biological fluids (urine) was determined and the results demonstrated acceptable recovery and RSD of 5%. Statistical treatment of the results of the proposed method revealed no significant differences in the accuracy and precision. The relative standard deviations for five measurements of 50 and 300 ng mL−1 of DS were 3.9 % and 1.0 %, respectively.

Keywords: dianabol steroid, determination, modified GCE, urine

Procedia PDF Downloads 284

Authors: Guenther Schuh, Christina Koenig, Nico Schoen, Markus Wellensiek

Abstract:

Identification and selection of appropriate product and manufacturing technologies are key factors for competitiveness and market success of technology-based companies. Therefore many companies perform technology intelligence (TI) activities to ensure the identification of evolving technologies at the right time. Technology monitoring is one of the three base activities of TI, besides scanning and scouting. As the technological progress is accelerating, more and more technologies are being developed. Against the background of limited resources it is therefore necessary to focus TI activities. In this paper, we propose a concept for defining appropriate search fields for technology monitoring. This limitation of search space leads to more concentrated monitoring activities. The concept will be introduced and demonstrated through an anonymized case study conducted within an industry project at the Fraunhofer Institute for Production Technology. The described concept provides a customized monitoring approach, which is suitable for use in technology-oriented companies especially those that have not yet defined an explicit technology strategy. It is shown in this paper that the definition of search fields and search tasks are suitable methods to define topics of interest and thus to direct monitoring activities. Current as well as planned product, production and material technologies as well as existing skills, capabilities and resources form the basis of the described derivation of relevant search areas. To further improve the concept of technology monitoring the proposed concept should be extended during future research e.g. by the definition of relevant monitoring parameters.

Keywords: monitoring radar, search field, technology intelligence, technology monitoring

Procedia PDF Downloads 474

Authors: Prativa Das, Lay Poh Tan

Abstract:

Three-dimensional microenvironment is a need to study the event cascades of liver fibrosis in vitro. Electrospun nanofibers modified with essential extracellular matrix proteins can closely mimic the random fibrous structure of native liver extracellular matrix (ECM). In this study, we fabricate a series of 3D electrospun scaffolds by wet electrospinning process modified with different ratios of collagen-I to fibronectin to achieve optimized distribution of these two ECM proteins on the fiber surface. A ratio of 3:1 of collagen-I to fibronectin was found to be optimum for surface modification of electrospun poly(lactic-co-glycolic acid) (PLGA) fibers by chemisorption process. In 3:1 collagen-I to fibronectin modified scaffolds the total protein content increased by ~2 fold compared to collagen-I modified and ~1.5 fold compared to 1:1/9:1 collagen-I to fibronectin modified scaffolds. We have cultured LX-2 cells on this scaffold over 14 days and found that LX-2 cells acquired more quiescent phenotype throughout the culture period and shown significantly lower expression of alpha smooth muscle actin and collagen-I. Thus, this system can be used as a model to study liver fibrosis by using different fibrogenic mediators in vitro.

Keywords: electrospinning, collagen-I and fibronectin, surface modification of fiber, LX-2 cells, liver fibrosis

Procedia PDF Downloads 127

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 299

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 540

Authors: Abdolsalam Ghaderi

Abstract:

In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve the customers when the parameters may change under different circumstances. This problem has many applications, especially in the area of supply chain management and distribution systems. To get closer to real-world situations, travel time of vehicles, the fixed cost of vehicles usage and customers’ demand are considered as a source of uncertainty. A combined approach including robust optimization and stochastic programming was presented to deal with the uncertainty in the problem at hand. For this purpose, a mixed integer programming model is developed and a heuristic algorithm based on Variable Neighborhood Search(VNS) is presented to solve the model. Finally, the computational results are presented and future research directions are discussed.

Keywords: location-routing problem, robust optimization, stochastic programming, variable neighborhood search

Procedia PDF Downloads 270

Authors: Santhosh Srinivasan, Vipul Garhiya, Shahul Hamid Khan

Abstract:

Environmental performance along with social performance is becoming vital factors for industries to achieve global standards. With a good environmental policy global industries are differentiating them from their competitors. This paper concentrates on multi stage, multi product and multi period manufacturing network. Single objective mathematical models for a total cost for the entire forward supply chain and reverse chain are considered. Here five different problems are considered by varying the number of facilities for illustration. M-MOGA, Shuffle Frog Leaping algorithm (SFLA) and CPLEX are used for finding the optimal solution for the mathematical model.

Keywords: closed loop supply chain, genetic algorithm, random search, multi period, green supply chain

Procedia PDF Downloads 391

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 132

Authors: T. Giansetto, E. Pierrot, P. Picavet, M. Lefebvre, S. Claeys, M. Balligand

Abstract:

Objective: To test the low sensitivity of the Allberg and Miles index to the stifle opening angle, to evaluate the displacement of the patella after a Modified Maquet Technique using this index, and to assess the incidence of patella luxation post-Modified Maquet Technique in dogs. Materials and methods: Medical records were reviewed from 2012 to 2017. Allberg Miles index was determined for each stifle pre and post-operatively, as well as the stifle joint opening of each case. The occurrence of patella luxation was recorded. Results: 137 stifles on 116 dogs were reviewed. The stifle opening angle did not influence the Allberg Miles index (p=0.41). Pre and post-operative index showed a distal displacement of the patella after a Modified Maquet Procedure, especially at a 90° of stifle opening angle. Only 1/137 cases demonstrated patella luxation after the surgery. Conclusion: The Allberg Miles radiographic index is largely independent of the stifle opening angle and can be used to assess the proximo-distal position of the patella in relation to the femoral trochlear groove. If patella baja is clearly induced by the Modified Maquet Technique, the latter does not seem to predispose patients to post-operative patella luxation in a large variety of dog breeds.

Keywords: rlca, modified Maquet technique, patella luxation, orthopedic

Procedia PDF Downloads 129

Authors: M. H. Hussain, I. Musirin, A. F. Abidin, S. R. A. Rahim

Abstract:

This paper presents the implementation of Artificial Bees Colony (ABC) algorithm in solving Directional OverCurrent Relays (DOCRs) coordination problem for near-end faults occurring in fixed network topology. The coordination optimization of DOCRs is formulated as linear programming (LP) problem. The objective function is introduced to minimize the operating time of the associated relay which depends on the time multiplier setting. The proposed technique is to taken as a technique for comparison purpose in order to highlight its superiority. The proposed algorithms have been tested successfully on 8 bus test system. The simulation results demonstrated that the ABC algorithm which has been proved to have good search ability is capable in dealing with constraint optimization problems.

Keywords: artificial bees colony, directional overcurrent relay coordination problem, relay settings, time multiplier setting

Procedia PDF Downloads 330