Search results for: Convex lens
144 Voltage-Controllable Liquid Crystals Lens
Authors: Wen-Chi Hung, Tung-Kai Liu, Ming-Shan Tsai, Chun-Che Lee, I-Min Jiang
Abstract:
This study investigates a voltage-controllable liquid crystals lens with a Fresnel zone electrode. When applying a proper voltage on the liquid crystal cell, a Fresnel-zone-distributed electric field is induced to direct liquid crystals aligned in a concentric structure. Owing to the concentrically aligned liquid crystals, a Fresnel lens is formed. We probe the Fresnel liquid crystal lens using a polarized incident beam with a wavelength of 632.8 nm, finding that the diffraction efficiency depends on the applying voltage. A remarkable diffraction efficiency of ~39.5 % is measured at the voltage of 0.9V. Additionally, a dual focus lens is fabricated by attaching a plane-convex lens to the Fresnel liquid crystals cell. The Fresnel LC lens and the dual focus lens may be applied for DVD/CD pick-up head, confocal microscopy system, or electrically-controlling optical systems.
Keywords: Liquid Crystals Lens, Fresnel Lens, and Dual focus
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2294143 Characterizations of Star-Shaped, L-Convex, and Convex Polygons
Authors: Thomas Shermer, Godfried T. Toussaint
Abstract:
A chord of a simple polygon P is a line segment [xy] that intersects the boundary of P only at both endpoints x and y. A chord of P is called an interior chord provided the interior of [xy] lies in the interior of P. P is weakly visible from [xy] if for every point v in P there exists a point w in [xy] such that [vw] lies in P. In this paper star-shaped, L-convex, and convex polygons are characterized in terms of weak visibility properties from internal chords and starshaped subsets of P. A new Krasnoselskii-type characterization of isothetic star-shaped polygons is also presented.Keywords: Convex polygons, L-convex polygons, star-shaped polygons, chords, weak visibility, discrete and computational geometry
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2343142 Fiber Lens Structure for Large Distance Measurement
Authors: Jaemyoung Lee
Abstract:
We propose a new fiber lens structure for large distance measurement in which a polymer layer is added to a conventional fiber lens. The proposed fiber lens can adjust the working distance by properly choosing the refractive index and thickness of the polymer layer. In our numerical analysis for the fiber lens radius of 120 μm, the working distance of the proposed fiber lens is about 10 mm which is about 30 times larger than conventional fiber lens.Keywords: fiber lens, distance measurement, collimation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1485141 Using Divergent Nozzle with Aerodynamic Lens to Focus Nanoparticles
Authors: Hasan Jumaah Mrayeh, Fue-Sang Lien
Abstract:
ANSYS Fluent will be used to simulate Computational Fluid Dynamics (CFD) for an efficient lens and nozzle design which will be explained in this paper. We have designed and characterized an aerodynamic lens and a divergent nozzle for focusing flow that transmits sub 25 nm particles through the aerodynamic lens. The design of the lens and nozzle has been improved using CFD for particle trajectories. We obtained a case for calculating nanoparticles (25 nm) flowing through the aerodynamic lens and divergent nozzle. Nanoparticles are transported by air, which is pumped into the aerodynamic lens through the nozzle at 1 atmospheric pressure. We have also developed a computational methodology that can determine the exact focus characteristics of aerodynamic lens systems. Particle trajectories were traced using the Lagrange approach. The simulation shows the ability of the aerodynamic lens to focus on 25 nm particles after using a divergent nozzle.
Keywords: Aerodynamic lens AL, divergent nozzle DN, ANSYS Fluent, Lagrange approach.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1000140 Sparse-View CT Reconstruction Based on Nonconvex L1 − L2 Regularizations
Authors: Ali Pour Yazdanpanah, Farideh Foroozandeh Shahraki, Emma Regentova
Abstract:
The reconstruction from sparse-view projections is one of important problems in computed tomography (CT) limited by the availability or feasibility of obtaining of a large number of projections. Traditionally, convex regularizers have been exploited to improve the reconstruction quality in sparse-view CT, and the convex constraint in those problems leads to an easy optimization process. However, convex regularizers often result in a biased approximation and inaccurate reconstruction in CT problems. Here, we present a nonconvex, Lipschitz continuous and non-smooth regularization model. The CT reconstruction is formulated as a nonconvex constrained L1 − L2 minimization problem and solved through a difference of convex algorithm and alternating direction of multiplier method which generates a better result than L0 or L1 regularizers in the CT reconstruction. We compare our method with previously reported high performance methods which use convex regularizers such as TV, wavelet, curvelet, and curvelet+TV (CTV) on the test phantom images. The results show that there are benefits in using the nonconvex regularizer in the sparse-view CT reconstruction.Keywords: Computed tomography, sparse-view reconstruction, L1 −L2 minimization, non-convex, difference of convex functions.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2029139 On Constructing Approximate Convex Hull
Authors: M. Zahid Hossain, M. Ashraful Amin
Abstract:
The algorithms of convex hull have been extensively studied in literature, principally because of their wide range of applications in different areas. This article presents an efficient algorithm to construct approximate convex hull from a set of n points in the plane in O(n + k) time, where k is the approximation error control parameter. The proposed algorithm is suitable for applications preferred to reduce the computation time in exchange of accuracy level such as animation and interaction in computer graphics where rapid and real-time graphics rendering is indispensable.
Keywords: Convex hull, Approximation algorithm, Computational geometry, Linear time.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2300138 Ranking - Convex Risk Minimization
Authors: Wojciech Rejchel
Abstract:
The problem of ranking (rank regression) has become popular in the machine learning community. This theory relates to problems, in which one has to predict (guess) the order between objects on the basis of vectors describing their observed features. In many ranking algorithms a convex loss function is used instead of the 0-1 loss. It makes these procedures computationally efficient. Hence, convex risk minimizers and their statistical properties are investigated in this paper. Fast rates of convergence are obtained under conditions, that look similarly to the ones from the classification theory. Methods used in this paper come from the theory of U-processes as well as empirical processes.
Keywords: Convex loss function, empirical risk minimization, empirical process, U-process, boosting, euclidean family.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1414137 Neural Network in Fixed Time for Collision Detection between Two Convex Polyhedra
Authors: M. Khouil, N. Saber, M. Mestari
Abstract:
In this paper, a different architecture of a collision detection neural network (DCNN) is developed. This network, which has been particularly reviewed, has enabled us to solve with a new approach the problem of collision detection between two convex polyhedra in a fixed time (O (1) time). We used two types of neurons, linear and threshold logic, which simplified the actual implementation of all the networks proposed. The study of the collision detection is divided into two sections, the collision between a point and a polyhedron and then the collision between two convex polyhedra. The aim of this research is to determine through the AMAXNET network a mini maximum point in a fixed time, which allows us to detect the presence of a potential collision.
Keywords: Collision identification, fixed time, convex polyhedra, neural network, AMAXNET.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1816136 Certain Conditions for Strongly Starlike and Strongly Convex Functions
Authors: Sukhwinder Singh Billing, Sushma Gupta, Sukhjit Singh Dhaliwal
Abstract:
In the present paper, we investigate a differential subordination involving multiplier transformation related to a sector in the open unit disk E = {z : |z| < 1}. As special cases to our main result, certain sufficient conditions for strongly starlike and strongly convex functions are obtained.Keywords: Analytic function, Multiplier transformation, Strongly starlike function, Strongly convex function.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1176135 Comparative Analysis of Classical and Parallel Inpainting Algorithms Based on Affine Combinations of Projections on Convex Sets
Authors: Irina Maria Artinescu, Costin Radu Boldea, Eduard-Ionut Matei
Abstract:
The paper is a comparative study of two classical vari-ants of parallel projection methods for solving the convex feasibility problem with their equivalents that involve variable weights in the construction of the solutions. We used a graphical representation of these methods for inpainting a convex area of an image in order to investigate their effectiveness in image reconstruction applications. We also presented a numerical analysis of the convergence of these four algorithms in terms of the average number of steps and execution time, in classical CPU and, alternativaly, in parallel GPU implementation.
Keywords: convex feasibility problem, convergence analysis, ınpainting, parallel projection methods
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 448134 A Dual Method for Solving General Convex Quadratic Programs
Authors: Belkacem Brahmi, Mohand Ouamer Bibi
Abstract:
In this paper, we present a new method for solving quadratic programming problems, not strictly convex. Constraints of the problem are linear equalities and inequalities, with bounded variables. The suggested method combines the active-set strategies and support methods. The algorithm of the method and numerical experiments are presented, while comparing our approach with the active set method on randomly generated problems.
Keywords: Convex quadratic programming, dual support methods, active set methods.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1893133 Design of a Reduced Order Robust Convex Controller for Flight Control System
Authors: S. Swain, P. S. Khuntia
Abstract:
In this paper an optimal convex controller is designed to control the angle of attack of a FOXTROT aircraft. Then the order of the system model is reduced to a low-dimensional state space by using Balanced Truncation Model Reduction Technique and finally the robust stability of the reduced model of the system is tested graphically by using Kharitonov rectangle and Zero Exclusion Principle for a particular range of perturbation value. The same robust stability is tested theoretically by using Frequency Sweeping Function for robust stability.
Keywords: Convex Optimization, Kharitonov Stability Criterion, Model Reduction, Robust Stability.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1720132 Design and Simulation of a Concentrated Luneberg Antenna
Authors: Z. Briqech, M. Abousetta
Abstract:
Luneberg lens is a new generation of antennas that is developed in the last few years and inserts itself strongly in Microwaves, Communications and Telescopes area. The idea of this research is to improve the radiation pattern by decreasing the side lobes and increasing the main lobe. The new design is proposed to work in the X-band. The simulated result and analysis are presented.Keywords: Communications, Microwaves, lens Antenna, Lunberg Lens Antenna.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2822131 Parameters Influencing the Output Precision of a Lens-Lens Beam Generator Solar Concentrator
Authors: M. Tawfik, X. Tonnellier, C. Sansom
Abstract:
The Lens-Lens Beam Generator (LLBG) is a Fresnel-based optical concentrating technique which provides flexibility in selecting the solar receiver location compared to conventional techniques through generating a powerful concentrated collimated solar beam. In order to achieve that, two successive lenses are used and followed by a flat mirror. Hence the generated beam emerging from the LLBG has a high power flux which impinges on the target receiver, it is important to determine the precision of the system output. In this present work, mathematical investigation of different parameters affecting the precision of the output beam is carried out. These parameters include: Deflection in sun-facing lens and its holding arm, delay in updating the solar tracking system, and the flat mirror surface flatness. Moreover, relationships that describe the power lost due to the effect of each parameter are derived in this study.
Keywords: Fresnel lens, LLBG, solar concentrator, solar tracking.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1145130 Q-Learning with Eligibility Traces to Solve Non-Convex Economic Dispatch Problems
Authors: Mohammed I. Abouheaf, Sofie Haesaert, Wei-Jen Lee, Frank L. Lewis
Abstract:
Economic Dispatch is one of the most important power system management tools. It is used to allocate an amount of power generation to the generating units to meet the load demand. The Economic Dispatch problem is a large scale nonlinear constrained optimization problem. In general, heuristic optimization techniques are used to solve non-convex Economic Dispatch problem. In this paper, ideas from Reinforcement Learning are proposed to solve the non-convex Economic Dispatch problem. Q-Learning is a reinforcement learning techniques where each generating unit learn the optimal schedule of the generated power that minimizes the generation cost function. The eligibility traces are used to speed up the Q-Learning process. Q-Learning with eligibility traces is used to solve Economic Dispatch problems with valve point loading effect, multiple fuel options, and power transmission losses.
Keywords: Economic Dispatch, Non-Convex Cost Functions, Valve Point Loading Effect, Q-Learning, Eligibility Traces.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2087129 Extremal Properties of Generalized Class of Close-to-convex Functions
Authors: Norlyda Mohamed, Daud Mohamad, Shaharuddin Cik Soh
Abstract:
Let Gα ,β (γ ,δ ) denote the class of function f (z), f (0) = f ′(0)−1= 0 which satisfied e δ {αf ′(z)+ βzf ′′(z)}> γ i Re in the open unit disk D = {z ∈ı : z < 1} for some α ∈ı (α ≠ 0) , β ∈ı and γ ∈ı (0 ≤γ <α ) where δ ≤ π and α cosδ −γ > 0 . In this paper, we determine some extremal properties including distortion theorem and argument of f ′( z ) .Keywords: Argument of f ′(z) , Carathéodory Function, Closeto- convex Function, Distortion Theorem, Extremal Properties
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1354128 A Constructive Proof of the General Brouwer Fixed Point Theorem and Related Computational Results in General Non-Convex sets
Authors: Menglong Su, Shaoyun Shi, Qing Xu
Abstract:
In this paper, by introducing twice continuously differentiable mappings, we develop an interior path following following method, which enables us to give a constructive proof of the general Brouwer fixed point theorem and thus to solve fixed point problems in a class of non-convex sets. Under suitable conditions, a smooth path can be proven to exist. This can lead to an implementable globally convergent algorithm. Several numerical examples are given to illustrate the results of this paper.
Keywords: interior path following method, general Brouwer fixed point theorem, non-convex sets, globally convergent algorithm
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1446127 Laminar Impinging Jet Heat Transfer for Curved Plates
Authors: A. M. Tahsini, S. Tadayon Mousavi
Abstract:
The purpose of the present study is to analyze the effect of the target plate-s curvature on the heat transfer in laminar confined impinging jet flows. Numerical results from two dimensional compressible finite volume solver are compared between three different shapes of impinging plates: Flat, Concave and Convex plates. The remarkable result of this study proves that the stagnation Nusselt number in laminar range of Reynolds number based on the slot width is maximum in convex surface and is minimum in concave plate. These results refuse the previous data in literature stating the amount of the stagnation Nusselt number is greater in concave surface related to flat plate configuration.Keywords: Concave, Convex, Heat transfer, Impinging jet, Laminar flow.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3010126 A Numerical Algorithm for Positive Solutions of Concave and Convex Elliptic Equation on R2
Authors: Hailong Zhu, Zhaoxiang Li
Abstract:
In this paper we investigate numerically positive solutions of the equation -Δu = λuq+up with Dirichlet boundary condition in a boundary domain ╬® for λ > 0 and 0 < q < 1 < p < 2*, we will compute and visualize the range of λ, this problem achieves a numerical solution.
Keywords: positive solutions, concave-convex, sub-super solution method, pseudo arclength method.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1319125 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 three circles into a right triangle such that these three 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; it is called the 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 the 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 the 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 as in Tri(Tn) problems. We call these problems the Carc(Tn) problems. The algorithm is a mO(Tn) algorithm, where m is the number of iterations in the loop. It takes less than 1000 iterations and less than 1 second for the Carc(T16) problem, which finds 136 circles inside a convex circular triangle with specified tangency properties. This algorithm gives a solution for circle packing problem inside convex circular triangle with arbitrarily-sized circles. Many applications concerning circle packing may come from the result of the algorithm, such as logo design, architecture design, etc.
Keywords: Circle packing, computer-aided geometric design, geometric constraint solver, Malfatti’s problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 143124 A Novel Multiresolution based Optimization Scheme for Robust Affine Parameter Estimation
Authors: J.Dinesh Peter
Abstract:
This paper describes a new method for affine parameter estimation between image sequences. Usually, the parameter estimation techniques can be done by least squares in a quadratic way. However, this technique can be sensitive to the presence of outliers. Therefore, parameter estimation techniques for various image processing applications are robust enough to withstand the influence of outliers. Progressively, some robust estimation functions demanding non-quadratic and perhaps non-convex potentials adopted from statistics literature have been used for solving these. Addressing the optimization of the error function in a factual framework for finding a global optimal solution, the minimization can begin with the convex estimator at the coarser level and gradually introduce nonconvexity i.e., from soft to hard redescending non-convex estimators when the iteration reaches finer level of multiresolution pyramid. Comparison has been made to find the performance of the results of proposed method with the results found individually using two different estimators.Keywords: Image Processing, Affine parameter estimation, Outliers, Robust Statistics, Robust M-estimators
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1453123 Fracture Control of the Soda-Lime Glass in Laser Thermal Cleavage
Authors: Jehnming Lin
Abstract:
The effects of the contact ball-lens on the soda lime glass in laser thermal cleavage with a cw Nd-YAG laser were investigated in this study. A contact ball-lens was adopted to generate a bending force on the crack formation of the soda-lime glass in the laser cutting process. The Nd-YAG laser beam (wavelength of 1064 nm) was focused through the ball-lens and transmitted to the soda-lime glass, which was coated with a carbon film on the surface with a bending force from a ball-lens to generate a tensile stress state on the surface cracking. The fracture was controlled by the contact ball-lens and a straight cutting was tested to demonstrate the feasibility. Experimental observations on the crack propagation from the leading edge, main section and trailing edge of the glass sheet were compared with various mechanical and thermal loadings. Further analyses on the stress under various laser powers and contact ball loadings were made to characterize the innovative technology. The results show that the distributions of the side crack at the leading and trailing edges are mainly dependent on the boundary condition, contact force, cutting speed and laser power. With the increase of the mechanical and thermal loadings, the region of the side cracks might be dramatically reduced with proper selection of the geometrical constrains. Therefore the application of the contact ball-lens is a possible way to control the fracture in laser cleavage with improved cutting qualities.
Keywords: Laser cleavage, controlled fracture, contact ball lens.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2478122 Freshwater Lens Observation: Case Study of Laura Island, Majuro Atoll, Republic of the Marshall Islands
Authors: Kazuhisa Koda, Tsutomu Kobayashi, Rebecca Lorennji, Alington Robert, Halston DeBrum, Julious Lucky, Paul Paul
Abstract:
Atolls are low-lying small islands with highly permeable ground that does not allow rivers and lakes to develop. As the water resources on these atolls basically rely on precipitation, groundwater becomes a very important water resource during droughts. Freshwater lenses develop as groundwater on relatively large atoll islands and play a key role in the stable water supply. Atoll islands in the Pacific Ocean sometimes suffer from drought due to El Nino. The global warming effects are noticeable, particularly on atoll islands. The Republic of the Marshall Islands in Oceania is burdened with the problems common to atoll islands. About half of its population lives in the capital, Majuro, and securing water resources for these people is a crucial issue. There is a freshwater lens on the largest, Laura Island, which serves as a water source for the downtown area. A serious drought that occurred in 1998 resulted in excessive water intake from the freshwater lens on Laura Island causing up-coning. Up-coning mixes saltwater into groundwater pumped from water-intake wells. Because up-coning makes the freshwater lens unusable, there was a need to investigate the freshwater lens on Laura Island. In this study, we observed the electrical conductivities of the groundwater at different depths in existing monitoring wells to determine the total storage volume of the freshwater lens on Laura Island from 2010 to 2013. Our results indicated that most of the groundwater that seeped into the freshwater lens had flowed out into the sea.
Keywords: Atoll islands, drought, El-Nino, freshwater lens, groundwater observation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1433121 Combination Scheme of Affine Projection Algorithm Filters with Complementary Order
Authors: Young-Seok Choi
Abstract:
This paper proposes a complementary combination scheme of affine projection algorithm (APA) filters with different order of input regressors. A convex combination provides an interesting way to keep the advantage of APA having different order of input regressors. Consequently, a novel APA which has the rapid convergence and the reduced steady-state error is derived. Experimental results show the good properties of the proposed algorithm.
Keywords: Adaptive filter, affine projection algorithm, convex combination, input order.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1664120 Enhanced Interference Management Technique for Multi-Cell Multi-Antenna System
Authors: Simon E. Uguru, Victor E. Idigo, Obinna S. Oguejiofor, Naveed Nawaz
Abstract:
As the deployment of the Fifth Generation (5G) mobile communication networks take shape all over the world, achieving spectral efficiency, energy efficiency, and dealing with interference are among the greatest challenges encountered so far. The aim of this study is to mitigate inter-cell interference (ICI) in a multi-cell multi-antenna system while maximizing the spectral efficiency of the system. In this study, a system model was devised that showed a miniature representation of a multi-cell multi-antenna system. Based on this system model, a convex optimization problem was formulated to maximize the spectral efficiency of the system while mitigating the ICI. This optimization problem was solved using CVX, which is a modeling system for constructing and solving discipline convex programs. The solutions to the optimization problem are sub-optimal coordinated beamformers. These coordinated beamformers direct each data to the served user equipments (UEs) in each cell without interference during downlink transmission, thereby maximizing the system-wide spectral efficiency.
Keywords: coordinated beamforming, convex optimization, inter-cell interference, multi-antenna, multi-cell, spectral efficiency
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 448119 Sustainable Use of Laura Lens during Drought
Authors: Kazuhisa Koda, Tsutomu Kobayashi
Abstract:
Laura Island, which is located about 50 km away from downtown, is a source of water supply in Majuro atoll, which is the capital of the Republic of the Marshall Islands. Low and flat Majuro atoll has neither river nor lake. It is very important for Majuro atoll to ensure the conservation of its water resources. However, upconing, which is the process of partial rising of the freshwater-saltwater boundary near the water-supply well, was caused by the excess pumping from it during the severe drought in 1998. Upconing will make the water usage of the freshwater lens difficult. Thus, appropriate water usage is required to prevent up coning in the freshwater lens because there is no other water source during drought. Numerical simulation of water usage applying SEAWAT model was conducted at the central part of Laura Island, including the water supply well, which was affected by upconing. The freshwater lens was created as a result of infiltration of consistent average rainfall. The lens shape was almost the same as the one in 1985. 0 of monthly rainfall and variable daily pump discharge were used to calculate the sustainable pump discharge from the water supply well. Consequently, the total amount of pump discharge was increased as the daily pump discharge was increased, indicating that it needs more time to recover from upconing. Thus, a pump standard to reduce the pump intensity is being proposed, which is based on numerical simulation concerning the occurrence of the up-coning phenomenon in Laura Island during the drought.Keywords: Freshwater lens, islands, numerical simulation, sustainable water use.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1917118 On a New Numerical Analysis for the Symmetric Shortest Queue Problem
Authors: Tayeb Lardjane, Rabah Messaci
Abstract:
We consider a network of two M/M/1 parallel queues having the same poisonnian arrival stream with rate λ. Upon his arrival to the system a customer heads to the shortest queue and stays until being served. If the two queues have the same length, an arriving customer chooses one of the two queues with the same probability. Each duration of service in the two queues is an exponential random variable with rate μ and no jockeying is permitted between the two queues. A new numerical method, based on linear programming and convex optimization, is performed for the computation of the steady state solution of the system.
Keywords: Steady state solution, matrix formulation, convex set, shortest queue, linear programming.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1486117 The Possibility of Solving a 3x3 Rubik’s Cube under 3 Seconds
Authors: Chung To Kong, Siu Ming Yiu
Abstract:
Rubik's cube was invented in 1974. Since then, speedcubers all over the world try their best to break the world record again and again. The newest record is 3.47 seconds. There are many factors that affect the timing including turns per second (tps), algorithm, finger trick, and hardware of the cube. In this paper, the lower bound of the cube solving time will be discussed using convex optimization. Extended analysis of the world records will be used to understand how to improve the timing. With the understanding of each part of the solving step, the paper suggests a list of speed improvement technique. Based on the analysis of the world record, there is a high possibility that the 3 seconds mark will be broken soon.
Keywords: Rubik’s cube, convex optimization, speed cubing, CFOP.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 845116 Panoramic Sensor Based Blind Spot Accident Prevention System
Authors: Rajendra Prasad Mahapatra, K. Vimal Kumar
Abstract:
There are many automotive accidents due to blind spots and driver inattentiveness. Blind spot is the area that is invisible to the driver's viewpoint without head rotation. Several methods are available for assisting the drivers. Simplest methods are — rear mirrors and wide-angle lenses. But, these methods have a disadvantage of the requirement for human assistance. So, the accuracy of these devices depends on driver. Another approach called an automated approach that makes use of sensors such as sonar or radar. These sensors are used to gather range information. The range information will be processed and used for detecting the collision. The disadvantage of this system is — low angular resolution and limited sensing volumes. This paper is a panoramic sensor based automotive vehicle monitoring..
Keywords: Panoramic sensors, Blind spot, Convex lens, Computer Vision, Sonar.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2115115 Improved Robust Stability Criteria of a Class of Neutral Lur’e Systems with Interval Time-Varying Delays
Authors: Longqiao Zhou, Zixin Liu, Shu Lü
Abstract:
This paper addresses the robust stability problem of a class of delayed neutral Lur’e systems. Combined with the property of convex function and double integral Jensen inequality, a new tripe integral Lyapunov functional is constructed to derive some new stability criteria. Compared with some related results, the new criteria established in this paper are less conservative. Finally, two numerical examples are presented to illustrate the validity of the main results.
Keywords: Lur’e system, Convex function, Jensen integral inequality, Triple-integral method, Exponential stability.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1517