Search results for: modified simplex algorithm

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 487

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 745

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: 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 300

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: 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 131

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: Yemane Hailu Fissuh, Zhongzhan Zhang

Abstract:

An estimating equation technique is an alternative method of the widely used maximum likelihood methods, which enables us to ease some complexity due to the complex characteristics of time-varying covariates. In the situations, when both the time-varying covariates and left-truncation are considered in the model, the maximum likelihood estimation procedures become much more burdensome and complex. To ease the complexity, in this study, the modified estimating equations those have been given high attention and considerations in many researchers under semiparametric transformation model was proposed. The purpose of this article was to develop the modified estimating equation under flexible and general class of semiparametric transformation models for left-truncated and right censored survival data with time-varying covariates. Besides the commonly applied Cox proportional hazards model, such kind of problems can be also analyzed with a general class of semiparametric transformation models to estimate the effect of treatment given possibly time-varying covariates on the survival time. The consistency and asymptotic properties of the estimators were intuitively derived via the expectation-maximization (EM) algorithm. The characteristics of the estimators in the finite sample performance for the proposed model were illustrated via simulation studies and Stanford heart transplant real data examples. To sum up the study, the bias for covariates has been adjusted by estimating density function for the truncation time variable. Then the effect of possibly time-varying covariates was evaluated in some special semiparametric transformation models.

Keywords: EM algorithm, estimating equation, semiparametric transformation models, time-to-event outcomes, time varying covariate

Procedia PDF Downloads 155

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 241

Authors: Hyeon-Seung Kim, Young-Hwan Kim, Sang-Mi Park, Min-Seo Kim, Jong-Myeung Shin, Leen-Seok Kang

Abstract:

The project budget at the planned stage might be changed by the insufficient government budget or the design change. There are many cases more especially in the case of a project performed for a long period of time. If the actual construction budget is insufficient comparing with the planned budget, the construction schedule should also be changed to match the changed budget. In that case, most project managers change the planned construction schedule by a heuristic approach without a reasonable consideration on the work priority. This study suggests an optimized methodology to modify the construction schedule according to the changed budget. The genetic algorithm was used to optimize the modified construction schedule within the changed budget. And a simulation system of construction cost histogram in accordance with the construction schedule was developed in the BIM (Building Information Modeling) environment.

Keywords: 5D, BIM, GA, cost optimization

Procedia PDF Downloads 588

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 376

Authors: Mustafa Akpolat, Baha Vural Kök

Abstract:

Using a waste material such as crumb rubber (CR) obtained by waste tires has become an important issue in respect to sustainability. However, the CR modified mixture also requires high manufacture temperature as a polymer modified mixture. For this reason in this study, it is intended to produce a CR modified mixture with warm mix asphalt additives in the same mixture. Asphalt mixtures produced by pure, 10%CR, 10%CR+3% Sasobit and 10%CR+0.7% Evotherm were subjected to aging procedure in the laboratory and the field. The indirect tensile repeated tests were applied to aged and original specimens. It was concluded that the fatigue life of the mixtures increased significantly with the increase of aging time. CR+Sasobit modified mixture aged at the both field and laboratory gave the highest load cycle among the mixtures.

Keywords: crumb rubber, warm mix asphalt, aging, fatigue

Procedia PDF Downloads 404

Authors: S. Jalaja, A. M. Vijaya Prakash

Abstract:

Recursive combination of an algorithm based on Karatsuba multiplication is exploited to design a generalized transpose and parallel Finite Impulse Response (FIR) Filter. Mid-range Karatsuba multiplication and Carry Save adder based on Karatsuba multiplication reduce time complexity for higher order multiplication implemented up to n-bit. As a result, we design modified N-tap Transpose and Parallel Symmetric FIR Filter Structure using Karatsuba algorithm. The mathematical formulation of the FFA Filter is derived. The proposed architecture involves significantly less area delay product (APD) then the existing block implementation. By adopting retiming technique, hardware cost is reduced further. The filter architecture is designed by using 90 nm technology library and is implemented by using cadence EDA Tool. The synthesized result shows better performance for different word length and block size. The design achieves switching activity reduction and low power consumption by applying with and without retiming for different combination of the circuit. The proposed structure achieves more than a half of the power reduction by adopting with and without retiming techniques compared to the earlier design structure. As a proof of the concept for block size 16 and filter length 64 for CKA method, it achieves a 51% as well as 70% less power by applying retiming technique, and for CSA method it achieves a 57% as well as 77% less power by applying retiming technique compared to the previously proposed design.

Keywords: carry save adder Karatsuba multiplication, mid range Karatsuba multiplication, modified FFA and transposed filter, retiming

Procedia PDF Downloads 235

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 235

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 549

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 628

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 511

Authors: H. Namazi, H. T. N. Kuan

Abstract:

Fick's first law relates the diffusive flux to the concentration field, by postulating that the flux goes from regions of high concentration to regions of low concentration, with a magnitude that is proportional to the concentration gradient (spatial derivative). It is clear that the diffusion of flux cannot be instantaneous and should be some time delay in this propagation. But Fick’s first law doesn’t consider this delay which results in some errors especially when there is a considerable time delay in the process. In this paper, we introduce a time delay to Fick’s first law. By this modification, we consider that the diffusion of flux cannot be instantaneous. In order to verify this claim an application sample in fluid diffusion is discussed and the results of modified Fick’s first law, Fick’s first law and the experimental results are compared. The results of this comparison stand for the accuracy of the modified model. The modified model can be used in any application where the time delay has considerable value and neglecting its effect reflects in undesirable results.

Keywords: Fick's first law, flux, diffusion, time delay, modified Fick’s first law

Procedia PDF Downloads 409

Authors: Nikol Žižková

Abstract:

The aim of this study was to observe the behavior of polymer-modified cement mortars with regard to the use of a pozzolanic admixture. Polymer-modified mortars (PMMs) containing various types of waste glass (waste packing glass and fluorescent tube glass) were produced always with 20% of cement substituted with a pozzolanic-active material. Ethylene/vinyl acetate copolymer (EVA) was used for polymeric modification. The findings confirm the possibility of using the waste glass examined herein as a partial substitute for cement in the production of PMM, which contributes to the preservation of non-renewable raw material resources and to the efficiency of waste glass material reuse.

Keywords: recycled waste glass, polymer-modified mortars, pozzolanic admixture, ethylene/vinyl acetate copolymer

Procedia PDF Downloads 255

Authors: Maanav M. Patel, Aarsh S. Mistry, Yash A. Dhaduk

Abstract:

Nowadays, only a small percentage of waste tyres are being land-filled. The Recycled Tyres Rubber is being used in new tyres, in tyre-derived fuel, in civil engineering applications and products, in molded rubber products, in agricultural uses, recreational and sports applications and in rubber modified asphalt applications. The benefits of using rubber modified asphalts are being more widely experienced and recognized, and the incorporation of tyres into asphalt is likely to increase. The technology with much different evidence of success demonstrated by roads built in the last 40 years is the rubberised asphalt mixture obtained through the so-called ‘‘wet process’’ which involves the utilisation of the Recycled Tyre Rubber Modified Bitumen (RTR-MBs). Since 1960s, asphalt mixtures produced with RTRMBs have been used in different parts of the world as solutions for different quality problems and, despite some downsides, in the majority of the cases they have demonstrated to enhance performance of road’s pavement. The present study aims in investigating the experimental performance of the bitumen modified with 15% by weight of crumb rubber varying its sizes. Four different categories of size of crumb rubber will be used, which are coarse (1 mm - 600 μm); medium size (600 μm - 300 μm); fine (300 μm150 μm); and superfine (150 μm - 75 μm). Common laboratory tests will be performed on the modified bitumen using various sizes of crumb rubber and thus analyzed. Marshall Stability method is adopted for mix design.

Keywords: Bitumen, CRMB, Marshall Stability Test, Pavement

Procedia PDF Downloads 144

Authors: Mousaab Alrhmoun, Magali Casellas, Michel Baudu, Christophe Dagot

Abstract:

The aim of the study is to improve removal of trace organic contaminants dissolved in activated sludge by the process of filtration with membrane bioreactor combined with modified activated carbon, for a maximum removal of organic compounds characterized by low molecular weight. Special treatment was conducted in laboratory on activated carbon. Tow reaction parameters: The pH of aqueous middle and the type of granular activated carbon were very important to improve the removal and to motivate the electrostatic Interactions of organic compounds with modified activated carbon in addition to physical adsorption, ligand exchange or complexation on the surface activated carbon. The results indicate that modified activated carbon has a strong impact in removal 21 of organic contaminants and in percentage of 100% of the process.

Keywords: activated carbon, organic micropolluants, membrane bioreactor, carbon

Procedia PDF Downloads 323

Authors: Elham Kazemi

Abstract:

Quadratic Assignment Problem (QAP) is one the combinatorial optimization problems about which research has been done in many companies for allocating some facilities to some locations. The issue of particular importance in this process is the costs of this allocation and the attempt in this problem is to minimize this group of costs. Since the QAP’s are from NP-hard problem, they cannot be solved by exact solution methods. Cuckoo Optimization Algorithm is a Meta-heuristicmethod which has higher capability to find the global optimal points. It is an algorithm which is basically raised to search a continuous space. The Quadratic Assignment Problem is the issue which can be solved in the discrete space, thus the standard arithmetic operators of Cuckoo Optimization Algorithm need to be redefined on the discrete space in order to apply the Cuckoo Optimization Algorithm on the discrete searching space. This paper represents the way of discretizing the Cuckoo optimization algorithm for solving the quadratic assignment problem.

Keywords: Quadratic Assignment Problem (QAP), Discrete Cuckoo Optimization Algorithm (DCOA), meta-heuristic algorithms, optimization algorithms

Procedia PDF Downloads 517

Authors: Linh Nguyen Tung, Anh Truong Viet, Nghien Nguyen Ba, Chuong Trinh Trong

Abstract:

This paper proposes a reconfiguration methodology based on a continuous genetic algorithm (CGA) and particle swarm optimization (PSO) for minimizing active power loss and minimizing voltage deviation. Both algorithms are adapted using graph theory to generate feasible individuals, and the modified crossover is used for continuous variable of CGA. To demonstrate the performance and effectiveness of the proposed methods, a comparative analysis of CGA with PSO for network reconfiguration, on 33-node and 119-bus radial distribution system is presented. The simulation results have shown that both CGA and PSO can be used in the distribution network reconfiguration and CGA outperformed PSO with significant success rate in finding optimal distribution network configuration.

Keywords: distribution network reconfiguration, particle swarm optimization, continuous genetic algorithm, power loss reduction, voltage deviation

Procedia PDF Downloads 190

Authors: S. H. Nasseri, A. Ebrahimnejad

Abstract:

Fuzzy set theory has been applied to many fields, such as operations research, control theory, and management sciences. In this paper, we consider two classes of fuzzy linear programming (FLP) problems: Fuzzy number linear programming and linear programming with trapezoidal fuzzy variables problems. We state our recently established results and develop fuzzy primal simplex algorithms for solving these problems. Finally, we give illustrative examples.

Keywords: fuzzy linear programming, fuzzy numbers, duality, sensitivity analysis

Procedia PDF Downloads 567

Authors: Ali Zain Ul Abadeen, Arshad Hussain

Abstract:

Roads are considered as the national capital, and huge developmental budget is spent on its construction, maintenance, and rehabilitation. Due to proliferating traffic volume, heavier loads and challenging environmental factors, the need for high-performance asphalt pavement is increased. In this research, the asphalt mixture was modified with carbon nanotubes ranging from 0.2% to 2% of binder to study the effect of CNT modification on rutting potential and fatigue life of asphalt mixtures. During this study, the conventional and modified asphalt mixture was subjected to a uni-axial dynamic creep test and dry Hamburg wheel tracking test to study rutting resistance. Fatigue behavior of asphalt mixture was studied using a four-point bending test apparatus. The plateau value of asphalt mixture was taken as a measure of fatigue performance according to the ratio of dissipated energy approach. Results of these experiments showed that CNT modified asphalt mixtures had reduced rut depth and increased rutting and fatigue resistance at higher percentages of carbon nanotubes.

Keywords: carbon nanotubes, fatigue, four point bending test, modified asphalt, rutting

Procedia PDF Downloads 147

Authors: Chaghoub Soraya, Zhang Xiaoyan

Abstract:

This research presents the first constant approximation algorithm to the p-median network design problem with multiple cable types. This problem was addressed with a single cable type and there is a bifactor approximation algorithm for the problem. To the best of our knowledge, the algorithm proposed in this paper is the first constant approximation algorithm for the p-median network design with multiple cable types. The addressed problem is a combination of two well studied problems which are p-median problem and network design problem. The introduced algorithm is a random sampling approximation algorithm of constant factor which is conceived by using some random sampling techniques form the literature. It is based on a redistribution Lemma from the literature and a steiner tree problem as a subproblem. This algorithm is simple, and it relies on the notions of random sampling and probability. The proposed approach gives an approximation solution with one constant ratio without violating any of the constraints, in contrast to the one proposed in the literature. This paper provides a (21 + 2)-approximation algorithm for the p-median network design problem with multiple cable types using random sampling techniques.

Keywords: approximation algorithms, buy-at-bulk, combinatorial optimization, network design, p-median

Procedia PDF Downloads 204

Authors: Song Xinze, Cai Kejian

Abstract:

To further explore the application of waste plastics in asphalt pavement, this paper begins with the classification and characteristics of waste plastics. It then provides a state-of-the-art review of the preparation methods and processes of waste plastic modifiers, waste plastic-modified asphalt, and waste plastic-modified asphalt mixtures. The paper also analyzes the factors influencing the compatibility between waste plastics and asphalt and summarizes the performance evaluation indicators for waste plastic-modified asphalt and its mixtures. It explores the research approaches and findings of domestic and international scholars and presents examples of waste plastics applications in pavement engineering. The author believes that there is a basic consensus that waste plastics can improve the high-temperature performance of asphalt. The use of cracking processes to solve the storage stability of waste plastic polymer-modified asphalt is the key to promoting its application. Additionally, the author anticipates that future research will concentrate on optimizing the recycling, processing, screening, and preparation of waste plastics, along with developing composite plastic modifiers to improve their compatibility and long-term performance in asphalt pavements.

Keywords: waste plastics, asphalt pavement, asphalt performance, asphalt modification

Procedia PDF Downloads 39

Authors: J. Yang, Y. Ma, X. Zhang, S. Li, Y. Zhang

Abstract:

The traditional k-means algorithm has been widely used as a simple and efficient clustering method. However, the algorithm often converges to local minima for the reason that it is sensitive to the initial cluster centers. In this paper, an algorithm for selecting initial cluster centers on the basis of minimum spanning tree (MST) is presented. The set of vertices in MST with same degree are regarded as a whole which is used to find the skeleton data points. Furthermore, a distance measure between the skeleton data points with consideration of degree and Euclidean distance is presented. Finally, MST-based initialization method for the k-means algorithm is presented, and the corresponding time complexity is analyzed as well. The presented algorithm is tested on five data sets from the UCI Machine Learning Repository. The experimental results illustrate the effectiveness of the presented algorithm compared to three existing initialization methods.

Keywords: degree, initial cluster center, k-means, minimum spanning tree

Procedia PDF Downloads 411

Authors: Olukunle C. Olawole, Dilip Kumar De

Abstract:

We have modified Richardson-Dushman equation considering thermal expansion of lattice and change of chemical potential with temperature in material. The corresponding modified Richardson-Dushman (MRDE) equation fits quite well the experimental data of thermoelectronic current density (J) vs T from carbon nanotubes. It provides a unique technique for accurate determination of W0 Fermi energy, EF0 at 0 K and linear thermal expansion coefficient of carbon nano-tube in good agreement with experiment. From the value of EF0 we obtain the charge carrier density in excellent agreement with experiment. We describe application of the equations for the evaluation of performance of concentrated solar thermionic energy converter (STEC) with emitter made of carbon nanotube for future applications.

Keywords: carbon nanotube, modified Richardson-Dushman equation, fermi energy at 0 K, charge carrier density

Procedia PDF Downloads 378