Search results for: hard problem
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 8100

Search results for: hard problem

8010 A Method for Solving a Bi-Objective Transportation Problem under Fuzzy Environment

Authors: Sukhveer Singh, Sandeep Singh

Abstract:

A bi-objective fuzzy transportation problem with the objectives to minimize the total fuzzy cost and fuzzy time of transportation without according priorities to them is considered. To the best of our knowledge, there is no method in the literature to find efficient solutions of the bi-objective transportation problem under uncertainty. In this paper, a bi-objective transportation problem in an uncertain environment has been formulated. An algorithm has been proposed to find efficient solutions of the bi-objective transportation problem under uncertainty. The proposed algorithm avoids the degeneracy and gives the optimal solution faster than other existing algorithms for the given uncertain transportation problem.

Keywords: uncertain transportation problem, efficient solution, ranking function, fuzzy transportation problem

Procedia PDF Downloads 530
8009 A Model for Helicopter Routing Problem

Authors: Aydin Sipahioglu, Gokhan Celik

Abstract:

Helicopter routing problem (HRP) is finding good tours for helicopter so as to pick up and deliver personnel or material among specified nodes, mutually. It can be encountered in case of being lots of supply and demand points for different commodities and requiring delivering commodities with helicopter. For instance, to deliver personnel or material from shore to oil rig is a good example. In fact, HRP is a branch of vehicle routing problem with pickup and delivery (VRPPD). However, it has additional constraints such that fuel capacity, performance of helicopter in different altitude and temperature, and the number of maximum takeoff and landing allowed. This kind of pickup and delivery problems can be classified into 3 groups, basically. 1-1 (one to one), M-M (many to many) and 1-M-1 (one to many to one). 1-1 means each commodity has only one supply and one demand point. M-M means there can be more than one supply and demand points for each kind of commodity. 1-M-1 means commodities at depot are delivered to demand points and commodities at customers are delivered to depot. In this case helicopter takes off from its own base, complete its tour and return to its own base. In this study, we define 1-M-M-1 type HRP. That means helicopter takes off from its home base, deliver commodities among the nodes as well as between depot and customers and return to its home base. These problems have NP-hard nature. Therefore, obtaining a good solution in a reasonable time is not easy. In this study, a model is offered for 1-M-M-1 type HRP. It is shown on small scale test instances that the model can find the optimal solution.

Keywords: helicopter routing problem, vehicle routing with pickup and delivery, integer programming

Procedia PDF Downloads 434
8008 Hybrid Precoder Design Based on Iterative Hard Thresholding Algorithm for Millimeter Wave Multiple-Input-Multiple-Output Systems

Authors: Ameni Mejri, Moufida Hajjaj, Salem Hasnaoui, Ridha Bouallegue

Abstract:

The technology advances have most lately made the millimeter wave (mmWave) communication possible. Due to the huge amount of spectrum that is available in MmWave frequency bands, this promising candidate is considered as a key technology for the deployment of 5G cellular networks. In order to enhance system capacity and achieve spectral efficiency, very large antenna arrays are employed at mmWave systems by exploiting array gain. However, it has been shown that conventional beamforming strategies are not suitable for mmWave hardware implementation. Therefore, new features are required for mmWave cellular applications. Unlike traditional multiple-input-multiple-output (MIMO) systems for which only digital precoders are essential to accomplish precoding, MIMO technology seems to be different at mmWave because of digital precoding limitations. Moreover, precoding implements a greater number of radio frequency (RF) chains supporting more signal mixers and analog-to-digital converters. As RF chain cost and power consumption is increasing, we need to resort to another alternative. Although the hybrid precoding architecture has been regarded as the best solution based on a combination between a baseband precoder and an RF precoder, we still do not get the optimal design of hybrid precoders. According to the mapping strategies from RF chains to the different antenna elements, there are two main categories of hybrid precoding architecture. Given as a hybrid precoding sub-array architecture, the partially-connected structure reduces hardware complexity by using a less number of phase shifters, whereas it sacrifices some beamforming gain. In this paper, we treat the hybrid precoder design in mmWave MIMO systems as a problem of matrix factorization. Thus, we adopt the alternating minimization principle in order to solve the design problem. Further, we present our proposed algorithm for the partially-connected structure, which is based on the iterative hard thresholding method. Through simulation results, we show that our hybrid precoding algorithm provides significant performance gains over existing algorithms. We also show that the proposed approach reduces significantly the computational complexity. Furthermore, valuable design insights are provided when we use the proposed algorithm to make simulation comparisons between the hybrid precoding partially-connected structure and the fully-connected structure.

Keywords: alternating minimization, hybrid precoding, iterative hard thresholding, low-complexity, millimeter wave communication, partially-connected structure

Procedia PDF Downloads 326
8007 Comparative Study of the Effect of Three Fungicides: Tilt and Artea Amistarxtra about Growing Wheat, Hard, and Soft and Their Impact on Grain Yield and Its Components in the Semi-Arid Zone of Setif

Authors: Cheniti Khalissa, Dekhili Mohamed

Abstract:

Several fungal diseases may infect hard and soft wheat, which directly affect the yield and thus the economy of the homeland. So, a treatment fungicide is one of means of diseases control. In this context, we studied two varieties of wheat; Waha for soft wheat and Hidhab for hard wheat, at the level of the Technical Institute of crops (ITGC) in the wilaya of Setif under semi-arid conditions. This study consists of a successive application of three fungicides (Tilt, Artea, and Armistarxtra) according to three treatments (T1, T2, and T3) in addition to the witness (T0) at different stages of plant development (respectively, Montaison, earing and after flowering) whose purpose is to test and determine the effectiveness of these products used sequentially. The study showed good efficacy when we use the sum of these pesticides The comparison between these different treatments indicates that the T3 treatment reduced yield losses significantly; which is evident in the main yield components such as fertility, grain yield and weight of 1000 grains. The various components of yield and final yield are all parameters to be taken into account in such a study. In general, the fungal treatment is an effective way of improving profitability. In general, the fungal treatment is an effective way of improving profitability and positioning interventions in time is one of the requirements for an appreciable efficiency.

Keywords: hard wheat, soft wheat, diseases, fungicide treatment, fertility, 1000-grain weight, semi-arid zone

Procedia PDF Downloads 406
8006 Assignment of Airlines Technical Members under Disruption

Authors: Walid Moudani

Abstract:

The Crew Reserve Assignment Problem (CRAP) considers the assignment of the crew members to a set of reserve activities covering all the scheduled flights in order to ensure a continuous plan so that operations costs are minimized while its solution must meet hard constraints resulting from the safety regulations of Civil Aviation as well as from the airlines internal agreements. The problem considered in this study is of highest interest for airlines and may have important consequences on the service quality and on the economic return of the operations. In this communication, a new mathematical formulation for the CRAP is proposed which takes into account the regulations and the internal agreements. While current solutions make use of Artificial Intelligence techniques run on main frame computers, a low cost approach is proposed to provide on-line efficient solutions to face perturbed operating conditions. The proposed solution method uses a dynamic programming approach for the duties scheduling problem and when applied to the case of a medium airline while providing efficient solutions, shows good potential acceptability by the operations staff. This optimization scheme can then be considered as the core of an on-line Decision Support System for crew reserve assignment operations management.

Keywords: airlines operations management, combinatorial optimization, dynamic programming, crew scheduling

Procedia PDF Downloads 360
8005 Evaluation of the Matching Optimization of Human-Machine Interface Matching in the Cab

Authors: Yanhua Ma, Lu Zhai, Xinchen Wang, Hongyu Liang

Abstract:

In this paper, by understanding the development status of the human-machine interface in today's automobile cab, a subjective and objective evaluation system for evaluating the optimization of human-machine interface matching in automobile cab was established. The man-machine interface of the car cab was divided into a software interface and a hard interface. Objective evaluation method of software human factor analysis is used to evaluate the hard interface matching; The analytic hierarchy process is used to establish the evaluation index system for the software interface matching optimization, and the multi-level fuzzy comprehensive evaluation method is used to evaluate hard interface machine. This article takes Dongfeng Sokon (DFSK) C37 model automobile as an example. The evaluation method given in the paper is used to carry out relevant analysis and evaluation, and corresponding optimization suggestions are given, which have certain reference value for designers.

Keywords: analytic hierarchy process, fuzzy comprehension evaluation method, human-machine interface, matching optimization, software human factor analysis

Procedia PDF Downloads 161
8004 Cooperative Coevolution for Neuro-Evolution of Feed Forward Networks for Time Series Prediction Using Hidden Neuron Connections

Authors: Ravneil Nand

Abstract:

Cooperative coevolution uses problem decomposition methods to solve a larger problem. The problem decomposition deals with breaking down the larger problem into a number of smaller sub-problems depending on their method. Different problem decomposition methods have their own strengths and limitations depending on the neural network used and application problem. In this paper we are introducing a new problem decomposition method known as Hidden-Neuron Level Decomposition (HNL). The HNL method is competing with established problem decomposition method in time series prediction. The results show that the proposed approach has improved the results in some benchmark data sets when compared to the standalone method and has competitive results when compared to methods from literature.

Keywords: cooperative coevaluation, feed forward network, problem decomposition, neuron, synapse

Procedia PDF Downloads 343
8003 Route Planning for Optimization Approach PSO_GA Sharing System (Scooter Sharing-Public Transportation) with Hybrid Optimization Approach PSO_GA

Authors: Mohammad Ali Farrokhpour

Abstract:

In the current decade and sustainable transportation systems, scooter sharing has attracted widespread attention as an environmentally-friendly means of public transportation which can help develop public transportation. The combination of scooters and subway in the area of sustainable transportation systems can provide a great many opportunities for developing access to public transportation. Of the challenges which have arisen and initiated discussions of interest about the implementation of a scooter-subway system to replace personal vehicles is the issue of routing in the aforementioned system. This has been chosen as the main subject of the present paper. Thus, the present paper provides an account for routing in this system. Because the issue of routing includes multiple factors such as time, costs, traffic, green spaces, etc., the above-mentioned problem is considered to be a multi-objective NP-hard optimization problem. For this purpose, the hybrid optimization approach of PSO-GA has been put forward in the present paper for the provided answers to be of higher accuracy and validity than those of normal optimization methods. The results obtained from modeling and problem solving for the case study in the MATLAB software are indicative of the efficiency and desirability of the model and the proposed approach for solving the model

Keywords: route planning, scooter sharing, public transportation, sharing system

Procedia PDF Downloads 89
8002 Heuristics for Optimizing Power Consumption in the Smart Grid

Authors: Zaid Jamal Saeed Almahmoud

Abstract:

Our increasing reliance on electricity, with inefficient consumption trends, has resulted in several economical and environmental threats. These threats include wasting billions of dollars, draining limited resources, and elevating the impact of climate change. As a solution, the smart grid is emerging as the future power grid, with smart techniques to optimize power consumption and electricity generation. Minimizing the peak power consumption under a fixed delay requirement is a significant problem in the smart grid. In addition, matching demand to supply is a key requirement for the success of the future electricity. In this work, we consider the problem of minimizing the peak demand under appliances constraints by scheduling power jobs with uniform release dates and deadlines. As the problem is known to be NP-Hard, we propose two versions of a heuristic algorithm for solving this problem. Our theoretical analysis and experimental results show that our proposed heuristics outperform existing methods by providing a better approximation to the optimal solution. In addition, we consider dynamic pricing methods to minimize the peak load and match demand to supply in the smart grid. Our contribution is the proposal of generic, as well as customized pricing heuristics to minimize the peak demand and match demand with supply. In addition, we propose optimal pricing algorithms that can be used when the maximum deadline period of the power jobs is relatively small. Finally, we provide theoretical analysis and conduct several experiments to evaluate the performance of the proposed algorithms.

Keywords: heuristics, optimization, smart grid, peak demand, power supply

Procedia PDF Downloads 92
8001 A New Multi-Target, Multi-Agent Search and Rescue Path Planning Approach

Authors: Jean Berger, Nassirou Lo, Martin Noel

Abstract:

Perfectly suited for natural or man-made emergency and disaster management situations such as flood, earthquakes, tornadoes, or tsunami, multi-target search path planning for a team of rescue agents is known to be computationally hard, and most techniques developed so far come short to successfully estimate optimality gap. A novel mixed-integer linear programming (MIP) formulation is proposed to optimally solve the multi-target multi-agent discrete search and rescue (SAR) path planning problem. Aimed at maximizing cumulative probability of successful target detection, it captures anticipated feedback information associated with possible observation outcomes resulting from projected path execution, while modeling agent discrete actions over all possible moving directions. Problem modeling further takes advantage of network representation to encompass decision variables, expedite compact constraint specification, and lead to substantial problem-solving speed-up. The proposed MIP approach uses CPLEX optimization machinery, efficiently computing near-optimal solutions for practical size problems, while giving a robust upper bound obtained from Lagrangean integrality constraint relaxation. Should eventually a target be positively detected during plan execution, a new problem instance would simply be reformulated from the current state, and then solved over the next decision cycle. A computational experiment shows the feasibility and the value of the proposed approach.

Keywords: search path planning, search and rescue, multi-agent, mixed-integer linear programming, optimization

Procedia PDF Downloads 376
8000 Overview on Sustainable Coastal Protection Structures

Authors: Suresh Reddi, Mathew Leslie, Vishnu S. Das

Abstract:

Sustainable design is a prominent concept across all sectors of engineering and its importance is widely recognized within the Arabian Gulf region. Despite that sustainable or soft engineering options are not widely deployed in coastal engineering projects and a preference for utilizing ‘hard engineering’ solutions remain. The concept of soft engineering lies in “working together” with the nature to manage the coastline. This approach allows hard engineering options, such as breakwaters or sea walls, to be minimized or even eliminated altogether. Hard structures provide a firm barrier to wave energy or flooding, but in doing so they often have a significant impact on the natural processes of the coastline. This may affect the area locally or impact on neighboring zones. In addition, they often have a negative environmental impact and may create a sense of disconnect between the marine environment and local users. Soft engineering options, seek to protect the coastline by working in harmony with the natural process of sediment transport/budget. They often consider new habitat creation and creating usable spaces that will increase the sense of connection with nature. Often soft engineering options, where appropriately deployed can provide a low-maintenance, aesthetically valued, natural line of coastal protection. This paper deals with an overview of the following: The widely accepted soft engineering practices across the world; How this approach has been considered by Ramboll in some recent projects in Middle East and Asia; Challenges and barriers to use in using soft engineering options in the region; Way forward towards more widespread adoption.

Keywords: coastline, hard engineering, low maintenance, soft engineering options

Procedia PDF Downloads 141
7999 Aggregation Scheduling Algorithms in Wireless Sensor Networks

Authors: Min Kyung An

Abstract:

In Wireless Sensor Networks which consist of tiny wireless sensor nodes with limited battery power, one of the most fundamental applications is data aggregation which collects nearby environmental conditions and aggregates the data to a designated destination, called a sink node. Important issues concerning the data aggregation are time efficiency and energy consumption due to its limited energy, and therefore, the related problem, named Minimum Latency Aggregation Scheduling (MLAS), has been the focus of many researchers. Its objective is to compute the minimum latency schedule, that is, to compute a schedule with the minimum number of timeslots, such that the sink node can receive the aggregated data from all the other nodes without any collision or interference. For the problem, the two interference models, the graph model and the more realistic physical interference model known as Signal-to-Interference-Noise-Ratio (SINR), have been adopted with different power models, uniform-power and non-uniform power (with power control or without power control), and different antenna models, omni-directional antenna and directional antenna models. In this survey article, as the problem has proven to be NP-hard, we present and compare several state-of-the-art approximation algorithms in various models on the basis of latency as its performance measure.

Keywords: data aggregation, convergecast, gathering, approximation, interference, omni-directional, directional

Procedia PDF Downloads 234
7998 Repository Blockchain for Collaborative Blockchain Ecosystem

Authors: Razwan Ahmed Tanvir, Greg Speegle

Abstract:

Collaborative blockchain ecosystems allow diverse groups to cooperate on tasks while providing properties such as decentralization and transaction security. We provide a model that uses a repository blockchain to manage hard forks within a collaborative system such that a single process (assuming that it has knowledge of the requirements of each fork) can access all of the blocks within the system. The repository blockchain replaces the need for Inter Blockchain Communication (IBC) within the ecosystem by navigating the networks. The resulting construction resembles a tree instead of a chain. A proof-of-concept implementation performs a depth-first search on the new structure.

Keywords: hard fork, shared governance, inter blockchain communication, blockchain ecosystem, regular research paper

Procedia PDF Downloads 26
7997 Solution of Nonlinear Fractional Programming Problem with Bounded Parameters

Authors: Mrinal Jana, Geetanjali Panda

Abstract:

In this paper a methodology is developed to solve a nonlinear fractional programming problem in which the coefficients of the objective function and constraints are interval parameters. This model is transformed into a general optimization problem and relation between the original problem and the transformed problem is established. Finally the proposed methodology is illustrated through a numerical example.

Keywords: fractional programming, interval valued function, interval inequalities, partial order relation

Procedia PDF Downloads 523
7996 Variation in the Morphology of Soft Palate

Authors: Hema Lattupalli

Abstract:

Introduction: The palate forms a partition between the oral cavity and nasal cavity. The palate is made up of two parts hard palate and soft palate. The Hard palate forms the anterior part of the palate, the soft palate forms a movable muscular fold covered by mucous membrane that is suspended from the posterior border of a hard palate. Aim and Objectives: Soft palate morphological variations have a great paucity in the literature. It’s also believed that the soft palate has no such important anatomical variations. There is a variable presentation of the soft palate morphology in the lateral cephalograms. The aim of this study is to identify the velar morphology. Materials and Methods: 100 normal subjects between the age group of 20 – 35 were taken for the study. Method: Lateral Cephalogram (radiologic study). Results: Different shapes of the soft palate were observed in the lateral cephalograms. The morphology of soft palate was classified into six types 1.Leaf like (50 cases) most common type, 2.Straight line (20 cases), 3.S shaped (4 cases) very rare, 4.Butt like (10 cases), 5. Rat tail (6 cases), 6. Hook shaped (10 cases). Conclusion: This classification helps us to understand the better diversity of the velar morphology in mid-sagittal plane. These findings help us to understand the etiology of OSAS.

Keywords: soft palate, cephalometric radiographs, morphology, cleft palate, obstructive sleep apnoea syndrome

Procedia PDF Downloads 367
7995 Comprehensive Study of X-Ray Emission by APF Plasma Focus Device

Authors: M. Habibi

Abstract:

The time-resolved studies of soft and hard X-ray were carried out over a wide range of argon pressures by employing an array of eight filtered photo PIN diodes and a scintillation detector, simultaneously. In 50% of the discharges, the soft X-ray is seen to be emitted in short multiple pulses corresponding to different compression, whereas it is a single pulse for hard X-rays corresponding to only the first strong compression. It should be stated that multiple compressions dominantly occur at low pressures and high pressures are mostly in the single compression regime. In 43% of the discharges, at all pressures except for optimum pressure, the first period is characterized by two or more sharp peaks.The X–ray signal intensity during the second and subsequent compressions is much smaller than the first compression.

Keywords: plasma focus device, SXR, HXR, Pin-diode, argon plasma

Procedia PDF Downloads 410
7994 Exhaustive Study of Essential Constraint Satisfaction Problem Techniques Based on N-Queens Problem

Authors: Md. Ahsan Ayub, Kazi A. Kalpoma, Humaira Tasnim Proma, Syed Mehrab Kabir, Rakib Ibna Hamid Chowdhury

Abstract:

Constraint Satisfaction Problem (CSP) is observed in various applications, i.e., scheduling problems, timetabling problems, assignment problems, etc. Researchers adopt a CSP technique to tackle a certain problem; however, each technique follows different approaches and ways to solve a problem network. In our exhaustive study, it has been possible to visualize the processes of essential CSP algorithms from a very concrete constraint satisfaction example, NQueens Problem, in order to possess a deep understanding about how a particular constraint satisfaction problem will be dealt with by our studied and implemented techniques. Besides, benchmark results - time vs. value of N in N-Queens - have been generated from our implemented approaches, which help understand at what factor each algorithm produces solutions; especially, in N-Queens puzzle. Thus, extended decisions can be made to instantiate a real life problem within CSP’s framework.

Keywords: arc consistency (AC), backjumping algorithm (BJ), backtracking algorithm (BT), constraint satisfaction problem (CSP), forward checking (FC), least constrained values (LCV), maintaining arc consistency (MAC), minimum remaining values (MRV), N-Queens problem

Procedia PDF Downloads 369
7993 The Integration of Geographical Information Systems and Capacitated Vehicle Routing Problem with Simulated Demand for Humanitarian Logistics in Tsunami-Prone Area: A Case Study of Phuket, Thailand

Authors: Kiatkulchai Jitt-Aer, Graham Wall, Dylan Jones

Abstract:

As a result of the Indian Ocean tsunami in 2004, logistics applied to disaster relief operations has received great attention in the humanitarian sector. As learned from such disaster, preparing and responding to the aspect of delivering essential items from distribution centres to affected locations are of the importance for relief operations as the nature of disasters is uncertain especially in suffering figures, which are normally proportional to quantity of supplies. Thus, this study proposes a spatial decision support system (SDSS) for humanitarian logistics by integrating Geographical Information Systems (GIS) and the capacitated vehicle routing problem (CVRP). The GIS is utilised for acquiring demands simulated from the tsunami flooding model of the affected area in the first stage, and visualising the simulation solutions in the last stage. While CVRP in this study encompasses designing the relief routes of a set of homogeneous vehicles from a relief centre to a set of geographically distributed evacuation points in which their demands are estimated by using both simulation and randomisation techniques. The CVRP is modeled as a multi-objective optimization problem where both total travelling distance and total transport resources used are minimized, while demand-cost efficiency of each route is maximized in order to determine route priority. As the model is a NP-hard combinatorial optimization problem, the Clarke and Wright Saving heuristics is proposed to solve the problem for the near-optimal solutions. The real-case instances in the coastal area of Phuket, Thailand are studied to perform the SDSS that allows a decision maker to visually analyse the simulation scenarios through different decision factors.

Keywords: demand simulation, humanitarian logistics, geographical information systems, relief operations, capacitated vehicle routing problem

Procedia PDF Downloads 252
7992 A Location-Allocation-Routing Model for a Home Health Care Supply Chain Problem

Authors: Amir Mohammad Fathollahi Fard, Mostafa Hajiaghaei-Keshteli, Mohammad Mahdi Paydar

Abstract:

With increasing life expectancy in developed countries, the role of home care services is highlighted by both academia and industrial contributors in Home Health Care Supply Chain (HHCSC) companies. The main decisions in such supply chain systems are the location of pharmacies, the allocation of patients to these pharmacies and also the routing and scheduling decisions of nurses to visit their patients. In this study, for the first time, an integrated model is proposed to consist of all preliminary and necessary decisions in these companies, namely, location-allocation-routing model. This model is a type of NP-hard one. Therefore, an Imperialist Competitive Algorithm (ICA) is utilized to solve the model, especially in large sizes. Results confirm the efficiency of the developed model for HHCSC companies as well as the performance of employed ICA.

Keywords: home health care supply chain, location-allocation-routing problem, imperialist competitive algorithm, optimization

Procedia PDF Downloads 399
7991 Investigation of Nd-Al-Fe Added Nd-Fe-B Alloy Produced by Arc Melting

Authors: Gülten Sadullahoğlu, Baki Altuncevahir

Abstract:

The scope of this study, to investigate the magnetic properties and microstructure of Nd₂Fe₁₄B₁ by alloying with Nd₃₃.₄Fe₆₂.₆Al₄, and heat treating it at different temperatures. The stoichiometric Nd₂Fe₁₄B hard magnetic alloy and Nd₃₃.₄Fe₆₂.₆Al₄ composition was produced by arc melting under argon atmosphere. The Nd₃₃.₄Fe₆₂.₆Al₄ alloy has added to the 2:14:1 hard magnetic alloy with 48% by weight, and melted again by arc melting. Then, it was heat treated at 600, 700 and 800˚C for 3h under vacuum. In AC magnetic susceptibility measurements, for the as-cast sample, the signals decreased sharply at 101 ˚C and 313 ˚C corresponding to the Curie temperatures of the two ferromagnetic phases in addition to Fe phase. For the sample annealed at 600 ˚C, two Curie points were observed at about 257˚C and at 313˚C. However, the phase corresponding to the Curie temperature of 101 ˚C was disappeared. According to the magnetization measurements, the saturation magnetization has the highest value of 99.8 emu/g for the sample annealed at 600 ˚C, and decreased to 57.66 and 28.6 emu/g for the samples annealed at 700˚ and 800 ˚C respectively. Heat treatment resulted in an evolution of the new phase that caused changes in magnetic properties of the alloys. In order to have a clear picture, the identification of these phases are being under the investigation by XRD and SEM–EDX analysis.

Keywords: NdFeB hard magnets, bulk magnetic materials, arc melting, Curie temperature, heat treatment

Procedia PDF Downloads 287
7990 A Model-Reference Sliding Mode for Dual-Stage Actuator Servo Control in HDD

Authors: S. Sonkham, U. Pinsopon, W. Chatlatanagulchai

Abstract:

This paper presents a method of sliding mode control (SMC) designing and developing for the servo system in a dual-stage actuator (DSA) hard disk drive. Mathematical modelling of hard disk drive actuators is obtained, extracted from measuring frequency response of the voice-coil motor (VCM) and PZT micro-actuator separately. Matlab software tools are used for mathematical model estimation and also for controller design and simulation. A model-reference approach for tracking requirement is selected as a proposed technique. The simulation results show that performance of a model-reference SMC controller design in DSA servo control can be satisfied in the tracking error, as well as keeping the positioning of the head within the boundary of +/-5% of track width under the presence of internal and external disturbance. The overall results of model-reference SMC design in DSA are met per requirement specifications and significant reduction in %off track is found when compared to the single-state actuator (SSA).

Keywords: hard disk drive, dual-stage actuator, track following, hdd servo control, sliding mode control, model-reference, tracking control

Procedia PDF Downloads 369
7989 Robust Control of a Parallel 3-RRR Robotic Manipulator via μ-Synthesis Method

Authors: A. Abbasi Moshaii, M. Soltan Rezaee, M. Mohammadi Moghaddam

Abstract:

Control of some mechanisms is hard because of their complex dynamic equations. If part of the complexity is resulting from uncertainties, an efficient way for solving that is robust control. By this way, the control procedure could be simple and fast and finally, a simple controller can be designed. One kind of these mechanisms is 3-RRR which is a parallel mechanism and has three revolute joints. This paper aims to robust control a 3-RRR planner mechanism and it presents that this could be used for other mechanisms. So, a significant problem in mechanisms control could be solved. The relevant diagrams are drawn and they show the correctness of control process.

Keywords: 3-RRR, dynamic equations, mechanisms control, structural uncertainty

Procedia PDF Downloads 560
7988 Explicit Iterative Scheme for Approximating a Common Solution of Generalized Mixed Equilibrium Problem and Fixed Point Problem for a Nonexpansive Semigroup in Hilbert Space

Authors: Mohammad Farid

Abstract:

In this paper, we introduce and study an explicit iterative method based on hybrid extragradient method to approximate a common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup in Hilbert space. Further, we prove that the sequence generated by the proposed iterative scheme converge strongly to the common solution of generalized mixed equilibrium problem and fixed point problem for a nonexpansive semigroup. This common solution is the unique solution of a variational inequality problem and is the optimality condition for a minimization problem. The results presented in this paper are the supplement, extension and generalization of the previously known results in this area.

Keywords: generalized mixed equilibrium problem, fixed-point problem, nonexpansive semigroup, variational inequality problem, iterative algorithms, hybrid extragradient method

Procedia PDF Downloads 476
7987 Regret-Regression for Multi-Armed Bandit Problem

Authors: Deyadeen Ali Alshibani

Abstract:

In the literature, the multi-armed bandit problem as a statistical decision model of an agent trying to optimize his decisions while improving his information at the same time. There are several different algorithms models and their applications on this problem. In this paper, we evaluate the Regret-regression through comparing with Q-learning method. A simulation on determination of optimal treatment regime is presented in detail.

Keywords: optimal, bandit problem, optimization, dynamic programming

Procedia PDF Downloads 456
7986 The Social Area Disclosure to Reduce Conflicts between Community and the State: A Case of Mahakan Fortress, Bangkok

Authors: Saowapa Phaithayawat

Abstract:

The purposes of this study are 1) to study the over 20-year attempt of Mahakan fort community to negotiate with Bangkok Metropolitan Administration (BMA) to remain in their residential area belonging to the state, and 2) to apply the new social and cultural dimension between the state and the community as an alternative for local participation in keeping their residential area. This is a qualitative research, and the findings reveal that the community claimed their ancestors’ right as owners of this piece of land for over 200 years. The community, therefore, requested to take part in the preservation of land, culture and local intellect and the area management in terms of being a learning resource on the cultural road in Rattanakosin Island. However, BMA imposed the law concerning the community area relocation in Rattanakosin Island. The result of law enforcement led to the failure of the area relocation, and the hard hit on physical structure of the area including the overall deterioration of the cultural road renovated in the year 1982, the 200 years’ celebration of Bangkok. The enforcement of law by the state required the move of the community, and the landscape improvement based on the capital city plan. However, this enforcement resulted in the unending conflicts between the community and the state, and the solution of this problem was unclear. At the same time the community has spent a long time opposing the state’s action, and preparing themselves by administrating the community behind Mahakan fortress with community administrative committee under the suggestion of external organization by registering all community members, providing funds for community administration. At the meantime the state lacked the continuation of the enforcement due to political problem and BMA’s administration problem. It is, therefore, suggested that an alternative solution to this problem lie at the negotiation between the state and the community with the purpose of the collaboration between the two to develop the area under the protective law of each side.

Keywords: Pom-Mahakan community, reduction of conflicts, social area disclosure, residential area

Procedia PDF Downloads 317
7985 A Fuzzy Programming Approach for Solving Intuitionistic Fuzzy Linear Fractional Programming Problem

Authors: Sujeet Kumar Singh, Shiv Prasad Yadav

Abstract:

This paper develops an approach for solving intuitionistic fuzzy linear fractional programming (IFLFP) problem where the cost of the objective function, the resources, and the technological coefficients are triangular intuitionistic fuzzy numbers. Here, the IFLFP problem is transformed into an equivalent crisp multi-objective linear fractional programming (MOLFP) problem. By using fuzzy mathematical programming approach the transformed MOLFP problem is reduced into a single objective linear programming (LP) problem. The proposed procedure is illustrated through a numerical example.

Keywords: triangular intuitionistic fuzzy number, linear programming problem, multi objective linear programming problem, fuzzy mathematical programming, membership function

Procedia PDF Downloads 571
7984 Factors Affecting Access to Education: The Experiences of Parents of Children Who Are Deaf or Hard of Hearing

Authors: Hanh Thi My Nguyen

Abstract:

The purpose of this research is to examine the experiences of parents of children who are deaf or hard of hearing in supporting their children to access education in Vietnam. Parents play a crucial role in supporting their children to gain full access to education. It was widely reported that parents of those children confronted a range of problems to support their children to access education. To author’s best knowledge, there has been a lack of research exploring the experiences of those parents in literature. This research examines factors affecting those parents in supporting their children to access education. To conduct the study, qualitative approach using a phenomenological research design was chosen to explore the central phenomena. Ten parents of children who were diagnosed as deaf or hard of hearing and aged 6-9 years were recruited through the support of the Association of Parents of Children with Hearing Impairment. Participants were interviewed via telephone with a mix of open and closed questions; interviews were audio recorded, transcribed and thematically analysed. The research results show that there are nine main factors that affected the parents in this study in making decisions relating to education for their children including: lack of information resources, perspectives of those parents on communication approaches, the families’ financial capacity, the psychological impact on the participants after their children’ diagnosis, the attitude of family members, attitude of school administrators, lack of local schools and qualified teachers, and current education system for the deaf in Vietnam. Apart from those factors, the lack of knowledge of the participants’ partners about deaf education and the partners’ employment are barriers to educational access and successful communication with their child.

Keywords: access to education, deaf, hard of hearing, parents experience

Procedia PDF Downloads 137
7983 The Algorithm to Solve the Extend General Malfatti’s Problem in a Convex Circular Triangle

Authors: Ching-Shoei Chiang

Abstract:

The Malfatti’s Problem solves the problem of fitting 3 circles into a right triangle such that these 3 circles are tangent to each other, and each circle is also tangent to a pair of the triangle’s sides. This problem has been extended to any triangle (called general Malfatti’s Problem). Furthermore, the problem has been extended to have 1+2+…+n circles inside the triangle with special tangency properties among circles and triangle sides; we call it extended general Malfatti’s problem. In the extended general Malfatti’s problem, call it Tri(Tn), where Tn is the triangle number, there are closed-form solutions for Tri(T₁) (inscribed circle) problem and Tri(T₂) (3 Malfatti’s circles) problem. These problems become more complex when n is greater than 2. In solving Tri(Tn) problem, n>2, algorithms have been proposed to solve these problems numerically. With a similar idea, this paper proposed an algorithm to find the radii of circles with the same tangency properties. Instead of the boundary of the triangle being a straight line, we use a convex circular arc as the boundary and try to find Tn circles inside this convex circular triangle with the same tangency properties among circles and boundary Carc. We call these problems the Carc(Tn) problems. The CPU time it takes for Carc(T16) problem, which finds 136 circles inside a convex circular triangle with specified tangency properties, is less than one second.

Keywords: circle packing, computer-aided geometric design, geometric constraint solver, Malfatti’s problem

Procedia PDF Downloads 114
7982 Model of Obstacle Avoidance on Hard Disk Drive Manufacturing with Distance Constraint

Authors: Rawinun Praserttaweelap, Somyot Kiatwanidvilai

Abstract:

Obstacle avoidance is the one key for the robot system in unknown environment. The robots should be able to know their position and safety region. This research starts on the path planning which are SLAM and AMCL in ROS system. In addition, the best parameters of the obstacle avoidance function are required. In situation on Hard Disk Drive Manufacturing, the distance between robots and obstacles are very serious due to the manufacturing constraint. The simulations are accomplished by the SLAM and AMCL with adaptive velocity and safety region calculation.

Keywords: obstacle avoidance, OA, Simultaneous Localization and Mapping, SLAM, Adaptive Monte Carlo Localization, AMCL, KLD sampling, KLD

Procedia PDF Downloads 204
7981 Micro-CT Imaging Of Hard Tissues

Authors: Amir Davood Elmi

Abstract:

From the earliest light microscope to the most innovative X-ray imaging techniques, all of them have refined and improved our knowledge about the organization and composition of living tissues. The old techniques are time consuming and ultimately destructive to the tissues under the examination. In recent few decades, thanks to the boost of technology, non-destructive visualization techniques, such as X-ray computed tomography (CT), magnetic resonance imaging (MRI), selective plane illumination microscopy (SPIM), and optical projection tomography (OPT), have come to the forefront. Among these techniques, CT is excellent for mineralized tissues such as bone or dentine. In addition, CT it is faster than other aforementioned techniques and the sample remains intact. In this article, applications, advantages, and limitations of micro-CT is discussed, in addition to some information about micro-CT of soft tissue.

Keywords: Micro-CT, hard tissue, bone, attenuation coefficient, rapid prototyping

Procedia PDF Downloads 146