Calculation of the blocking factor in heliostat fields
|
|
- Amelia Lee
- 6 years ago
- Views:
Transcription
1 Available online at ScienceDirect Energy Procedia 57 (014 ) ISES Solar World Congress Calculation of the blocking factor in heliostat fields Mustafa E. Elayeb a *, Rajab A. Haan a and Fuad M.F. Siala b a Faculty of engineering,misurata university,misurata P.O.Box 104, Libya b Center for Solar Energy Studies, Tripoli, Libya Abstract This paper presents a ethod for the calculation of the blocking losses of a heliostat, in ters of a blocking factor, arising due to neighboring heliostats in a heliostat field. The proposed ethod is general in the sense that it is valid for any type of heliostat array and orientation. In the ethod the individual blocking eleents are projected on the plane of the heliostat under consideration. The heliostat plane is defined in the heliostat coordinate syste. An analytical expression for the geoetry of the projection is presented, and a nuerical iterative technique is developed for the solution. The solution procedure involves the subdivision of the heliostat surface into a suitable grid. An overlap test is developed to deterine whether a particular sub-area is blocked. In a straightforward anner, all blocked sub-areas are subtracted once fro the overall heliostat area. A progra was written by using MATLAB to test the ethod. In initial runs on lap-top (Intel(R) Core(TM) i3 M GHz), typical rectangular heliostats (9.8x10.7 eters) were subdivided into 5x5 grids. Results for the instantaneous blocking factors for each of 99 such neighboring heliostats, were obtained in an average run tie of less than 3.5 seconds. 014 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license ( 013 The Authors. Published Elsevier Ltd. Selection and/or peer-review under responsibility under responsibility of ISES. of ISES Keywords: CRS; CSP; STE; Heliostat fields; Optical losses; Blocking factor. 1. Introduction The perforance of heliostat field is defined in ters of the optical efficiency. The optical efficiency is defined as the ratio of the net power intercepted by receiver to the direct insolation ties the total irror area. The optical losses include the cosine effect, shading and blocking losses, iperfect irror reflectivity, atospheric attenuation, and receiver spillage losses [1]. Soe authors [1,] think that while both shadowing and blocking increase if the heliostats are closer together, blocking has ore pronounced effect on the layout of heliostat field. Several researchers introduced ethods to deterine the usefulness efficiency of a heliostat surface. Biggs and Vittitoe [3] presented an idea based on projecting the outline of the aligned heliostats that * Corresponding author. Tel.: ; fax: E-ail address: elayeb@yahoo.co The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license ( Selection and/or peer-review under responsibility of ISES. doi: /j.egypro
2 9 Mustafa E. Elayeb et al. / Energy Procedia 57 ( 014 ) ight block reflected light onto a unit sphere centered about the ai point. Blocked portions of any heliostat will appear in overlapped regions on this projection. The ain objections to this procedure are that it ay not be accurate in the case of ultiple blocks and for late tie. Also, that it is questionable whether the area ratio in the projection plane is equal to the actual area ratio by which the reflected flux is actually reduced. Sassi [4] derived a cobined analytical/discrete ethod for the calculation of the usefulness efficiency caused by a single heliostat. His idea was based on the projection of a blocking heliostat onto the plane of the heliostat under exaination. He assued that heliostat and projection had the sae geoetry and orientation, which is a siple case selected because it is ore recurrent and because its atheatical developent is siple. By no eans it is a general case. Collado and Turegano [] derived an expression to predict the usefulness efficiency due to the twoshoulder heliostats in a radial aziuth staggered array. This expression is accurate only when the solar aziuth angle, heliostat aziuth angle and heliostat position aziuth angle are the sae. Elsayed et al. [5] developed an analytical expression for the usefulness efficiency of heliostat surfaces when considering all neighboring heliostats in any type of heliostat arrays. Their idea is based on deterining the diensions of the shadow on the plane of the heliostat under testing, and their ain assuption is that both heliostats have approxiately the sae orientation. Again, this assuption is not valid for all cases. Sànchez and Roero [6] calculated the Noralized Blocking using a siplified odel. Aong all the possible tracking positions it is assued that the noral to the heliostat surface points at the aiing point since this represents the worst case. In addition, a grid of neighbors is created to calculate the effect at different positions. Although this approach has been useful for north field configurations, other approaches need to be forulated to generate in a better way surround fields, since the noral of the heliostats located south of the tower would never point at the receiver. The ethod proposed in this paper overcoes the shortcoings of the cited procedures. The blocking losses are due to the interception of part of the reflected sunlight fro heliostat by the backside of another heliostat. The blocking factor defined by Equation (1). F b 1 A A b tr (1) where A b is the blocked area of the heliostat surface and A tr is the total reflecting area of the heliostat. In this paper, a previous ethod to calculate shading factor [7] has been developed to pair with blocking factor calculation. As long as shadow is related to the incidence solar radiation, the blocking loss is related with the reflected sun beas. It ay be possible to calculate a blocking factor by considering that the blocking heliostat acts as if it was a shading heliostat for rays traveling in a reverse direction to the reflected radiation. Starting fro this idea, a vector has been iagined to apply on the reflected sun bea, but on the opposite direction. In other words, it is in the direction fro the receiver to the Heliostat, foring a "virtual shadow" which represents the actual blocked area fro the reflective Heliostat surface by neighboring Heliostat. The effect of blocking is calculated by projecting the outline of the blocking heliostats onto the plane of the blocked heliostat using the heliostat coordinate syste, O. The ain assuptions are: an infinitesial size of the sun, plane surfaces of the heliostats and no tracking errors. Hennet, as cited in
3 Mustafa E. Elayeb et al. / Energy Procedia 57 ( 014 ) Collado and Toregano [], established that the axiu relative error caused by these assuptions is less that 5%. Noenclature blocking factor F b A b A tr a blocked area total reflecting area heliostat aziuth angle inclination angle P position vector of point j on heliostat i Q vector joining the center of the blocked heliostat and point j on the blocking heliostat i B cc g vector fro the blocked heliostat to the receiver in the direction of the reflected rays. agnitude of B cc U cc r o 1 N u, N v l,w unit vector, in coordinate syste O, towards the receiver. reflection angle axiu nuber of cells in the u and v directions, respectively length and width of heliostat. Projection of the Blocking Heliostat In Figure 1 let i = 1 be a blocked heliostat and i =, 3 be the blocking heliostats. In our ethod no restrictions are ade on the locations or the orientations of the heliostats. Two coordinate systes, O 1 and O, are utilized. O 1 has its origin at the base of the tower and its X, Y and Z axes are as shown in Figure 1, with unit vectors i, j, and k. O has its origin at the center of the heliostat. Its u-axis is parallel to the horizontal edge of the heliostat and the v-axis is perpendicular to it. The w-axis is parallel to the noral to the heliostat and the unit vectors are u, v and w. In what follows the superscript on the left of any vector indicates the coordinate syste in which it is defined. The transforation of a vector v 1 to v is 1 accoplished through the relation v T v. The atrix T1is defined by [7]: 1 cosa cos si n a si n si n a T1 si n a cos cosa si n cosa () 0 si n a cos
4 94 Mustafa E. Elayeb et al. / Energy Procedia 57 ( 014 ) where, a and are the heliostat aziuth and inclination angles respectively. Z heliostat i = 1 v u O r r 1 heliostat i = Q 1 3 P 51 w 5 L Y (north) 4 P 5 1 W P 1 O 1 X (east) Fig. 1. Coordinate systes and vector definition. P is the position vector of point j on heliostat i. The nubering schee is always as shown in Figure 1. The location of any heliostat in the field is defined in ters of its center's position vector: 1 P5 i xii yi j zik (3) L, W, r1 1 In O 1 the vectors and r i i i ay be defined in ters of the length, width and the i aziuth and inclination angles of the heliostat. Then, the position vectors of the corner points of the heliostat are given by the following equations: (4) P1 i P5 i r1i P i P5 i ri P3 i P5 i r1i P4 i P5 i ri (5) (6) (7)
5 Mustafa E. Elayeb et al. / Energy Procedia 57 ( 014 ) The vector Q joining the center of the blocked heliostat and point j on the blocking heliostat i can now be defined. Thus, in Figure 1, where i > 1, we have: 1 1 Q P P 1 51 In Figure, a point j' on the plane of the blocked heliostat (i = 1) is the virtual shadow of corner j of heliostat i (> 1). Therefore, B cc is a vector fro the blocked heliostat to the receiver in the direction of the reflected rays, pointing to the receiver center and connecting points j' and j. If g is the agnitude of B cc, then the vector can be expressed as follows: (8) Bcc where g U cc U cc is the unit vector, in coordinate syste O, towards the receiver. (9) In Figure, j'' on the plane of the blocked heliostat is the projection of corner j of heliostat i (> 1). Therefore, (see Figure -b) the following relation is true: g jj Q, cos ro cos r 1 w o1 where, Q, w is the w-coponent of Q and angle) on heliostat 1. (10) r o 1 is the reflection angle (which equal to incidence The virtual shadow of any heliostat on the plane of the blocked heliostat is an area bounded by the four straight lines connecting the points j' belonging to the blocking heliostat. These points are defined by their position vectors, given by the following equation: Q i cc (11) j Q B 3. The Blocking Test A b of the heliostat under consideration is deterined by area of the heliostat intersecting, possibly, with the virtual shadows of all heliostats in the field. Aongst these heliostats, only those located in front of the heliostat under testing ay cast virtual shadow on it, i.e., those for which Q 0. Having deterined the blocking heliostats ; i.e. the active heliostats, A b ay be coputed. This is achieved discretely by generating a rectangular grid on the heliostat under testing. The diensions of the N u x N v cells are given by: 5i, w
6 96 Mustafa E. Elayeb et al. / Energy Procedia 57 ( 014 ) (a) (b) Fig.. virtual shadow coordinates on plane of blocked heliostat w u N u and l v N v (1) where N u and N v are the axiu nuber of cells in the u and v directions, respectively. The coordinates of a cell's center are given by C n, k u n, vk for n = 1, N u and k = 1, N v, where, u n 0.5 un u w for n 1 0.5l v and vk 1 u for n 1 vk 1 v for k 1 for k 1 (13) The center of each cell in the grid is tested with respect to the virtual shadows of active heliostats. If a center is found within a virtual shadow, then its associated area, A u v, is added to A b. This center will not be tested again with respect to other virtual shadows, thereby excluding the possibility of virtual shadow overlap. If a cell is not blocked, the process continues, until its center is found to lie within a virtual shadow, or the test is copleted. To accoplish that values are assigned to a variable, p, in the following anner: 0 if Cn, k is on the outline of the virtual shadow p 1 if Cn, k is inside thevirtualshadow (14) if Cn, k is outside thevirtualshadow
7 Mustafa E. Elayeb et al. / Energy Procedia 57 ( 014 ) In general, the equation of the (straight line) follows: v v u u j1 j1 v u j j v u j1 j1 j side of the virtual shadow can be written as 1 j (15) The results of substituting the coordinates of the cell's center under testing in Equation (15) can be tabulated in two cases as follows. Case I (sides1 and 3 4 ) Substitute v k for v in Equation (15) applied to each of the two sides in turn and copare the result with u n. In view of Equation (14), the values of p are assigned as shown in Table (1), where: u u u u j j1 j1 vk v j1 v j v j1 Case II (sides 3 and 4 1 ) Here, substitute u n for u in Equation (15) applied to each of the two sides in turn and copare the result with v k. The values of p are assigned as shown in Table (1), where: v v v v j j1 j1 un u j1 u j u j1 If p = for any of the four sides, then the test need not be carried further, because that eans that the cell's center is outside the virtual shadow. Finally, the instantaneous value of the blocking factor for the heliostat under testing ay now be coputed using Equation (1), where A b is found by suing up all the contributing cells. Table 1: p values for case I and case II u n u n State u u u u n P, case I P, case II Side 1 Side 1 State Side 3 Side v k v v k v v v k 4. Perforance To verify the ethod, the heliostats were laid out in a radial staggered arrangeent using procedures forulated by the authors [8] and Collado and Turegano []. These ethods guarantee prevention the blocking loss. The siulation had been applied for a whole year, every single hour a day, which eans
8 98 Mustafa E. Elayeb et al. / Energy Procedia 57 ( 014 ) of tie step. The result had confired the nonexistence of any blockage for any heliostat existed in one of the fields. That eans the blocking factor always used to be equal to one, as a proof for the successfulness of the proposed ethod. As an exaple, the proposed ethod was prograed by using MATLAB and applied to two hypothetical heliostat fields located at Misurata (3.4 N, 15.1 E) with 55 tower height. The fields consisted of 9.8x10.7 heliostats were laid out in N-S cornfield and radial stagger arrangeents with separation distance ratio, ds = 0.05, as shown in Figure 3. (a) (b) Fig. 3 the layout of two fields tested; (a) N-S cornfield (b) radial stagger On a Intel(R) Core(TM)i3 M380.53GHz laptop with GB Ra and using a 5x5 grid, the instantaneous results for each heliostats in the field were obtained in a run tie of less than 3.5 seconds for all heliostats, table 3. The distribution of the yearly average blocking factor in the both fields are shown in Figure 4. The figure shows the blocking factor would be in a better state if it was in the situation of radial stagger arrangeents. We can notice decrease in the value of blocking factor as long as we go towards the north away fro the tower. This can be explained by increasing the tilt angle of the heliostat toward the sae direction of the north that goes hand in hand with increasing in the nuber of the heliostats in the first rows which leads to a greater chance of occurrence of blockage loss. Table the results for both fields at solar noon on February 17. Ite cornfield radial stagger No. of heliostats Instantaneous average field blocking factor Run tie (seconds) To test the effect of the grid size results for the annual average of a heliostat blocking factor were obtained for a field containing 99 heliostats in N-S cornfield layout. For grid sizes fro 10x10 to 00x00 the value of the annual average of the heliostat blocking factor, to two significant digits, was 0.83 in all cases except the first case, table 3. We found that only very arginal changes in the value of the blocking factor occur with grids finer than 50x50. Clearly the user has to carefully select the grid size in order to balance the requireents of speed and accuracy.
9 Mustafa E. Elayeb et al. / Energy Procedia 57 ( 014 ) (a) (b) Fig. 4. distribution of the yearly average blocking factor in the field; (a) N-S cornfield (b) radial stagger Table 3 the effect of the grid size on run tie and annual average heliostat blocking factor Grid size Run tie (s) Yearly average F b for Heliostat (0,170,5) 10x x x x x Figure 5 shows the relationship between the heliostats nuber and CPU tie required to calculate the annual average blocking factor for all heliostats in the N-S cornfield layout for grid sizes 5x5. Fig. 5 the relationship between the heliostats nuber and CPU tie
10 300 Mustafa E. Elayeb et al. / Energy Procedia 57 ( 014 ) Conclusions We proposed a ethod that allows fast calculation of the blocking factor in heliostat fields. The ethod is not restricted to any particular arrangeent or orientation of heliostats. Although the ethod is nuerical in nature, it sees that accurate results are obtainable with little effort. Further coparisons of the proposed ethod with existing ethods are planned. The proposed ethod relies on tracing the virtual shadows of points on the perieter of the heliostat so that straight lines enclosing the area of the virtual shadow can connect the. The ethod can also be applied to circular heliostats or facets by replacing these by equivalent circuscribing polygons. Obviously, as one increases the nuber of the polygon sides ore accurate results are obtained. References [1] Falcone P.K., A Handbook for Solar Central Receiver Design, Sandia National Laboratories,1986. [] Collado F.J., Turegano J.A., Calculation of the annual theral energy supplied by heliostat field, Solar Energy, 4(1989), p [3] F. Biggs, C. N. Vittitoe, (1979). The Helios Model for The Optical Behavior of Reflecting Solar Concentrators: SANDIA National Laboratories. [4] G. Sassi, Soe notes on shadow and blockage effects, Solar Energy, 31(1983) [5] M.M. Elsayed, M.B. Habeebuallah, O.M. Al-Rabghi, Yearly-Averaged Daily Usefulness Efficiency of Heliostat Surfaces, Solar Energy, 49(199) [6] Marcelino Sànchez, Manuel Roero. Methodology for generation of heliostat field layout in central receiver systes based on yearly noralized energy surfaces, Solar Energy, 80 (006) [7] Siala F.M, Elayeb M.E., Calculation of the shading Factor in Heliostat Fields, EuroSun01, Rijeka, Croatia, 18-0 Septeber 01. [8] Siala F.M, Elayeb M.E., Matheatical forulation of a graphical ethodfor a no-blocking heliostat field layout, Renewable Energy, 3(001),p 77-9.
Module Contact: Dr Rudy Lapeer (CMP) Copyright of the University of East Anglia Version 1
UNIVERSITY OF EAST ANGLIA School of Coputing Sciences Main Series UG Exaination 2016-17 GRAPHICS 1 CMP-5010B Tie allowed: 2 hours Answer THREE questions. Notes are not peritted in this exaination Do not
More informationMedical Biophysics 302E/335G/ st1-07 page 1
Medical Biophysics 302E/335G/500 20070109 st1-07 page 1 STEREOLOGICAL METHODS - CONCEPTS Upon copletion of this lesson, the student should be able to: -define the ter stereology -distinguish between quantitative
More informationClustering. Cluster Analysis of Microarray Data. Microarray Data for Clustering. Data for Clustering
Clustering Cluster Analysis of Microarray Data 4/3/009 Copyright 009 Dan Nettleton Group obects that are siilar to one another together in a cluster. Separate obects that are dissiilar fro each other into
More informationCassia County School District #151. Expected Performance Assessment Students will: Instructional Strategies. Performance Standards
Unit 1 Congruence, Proof, and Constructions Doain: Congruence (CO) Essential Question: How do properties of congruence help define and prove geoetric relationships? Matheatical Practices: 1. Make sense
More informationAvailable online at ScienceDirect. Procedia Engineering 102 (2015 )
Available online at www.sciencedirect.co ScienceDirect Procedia Engineering 10 (015 ) 1643 1649 The 7th World Congress on Particle Technology (WCPT7) Three-diensional Porosity Model Based on Volue Solver
More informationAvailable online at ScienceDirect. Energy Procedia 93 (2016 ) Ciudad de la Innovación, , Sarriguren, Spain.
Available online at www.sciencedirect.com ScienceDirect Energy Procedia 93 (2016 ) 31 38 Africa-EU Renewable Energy Research and Innovation Symposium, RERIS 2016, 8-10 March 2016, Tlemcen, Algeria State-of-the-art
More informationComputer Aided Drafting, Design and Manufacturing Volume 26, Number 2, June 2016, Page 13
Coputer Aided Drafting, Design and Manufacturing Volue 26, uber 2, June 2016, Page 13 CADDM 3D reconstruction of coplex curved objects fro line drawings Sun Yanling, Dong Lijun Institute of Mechanical
More informationThe optimization design of microphone array layout for wideband noise sources
PROCEEDINGS of the 22 nd International Congress on Acoustics Acoustic Array Systes: Paper ICA2016-903 The optiization design of icrophone array layout for wideband noise sources Pengxiao Teng (a), Jun
More informationAn Integrated Processing Method for Multiple Large-scale Point-Clouds Captured from Different Viewpoints
519 An Integrated Processing Method for Multiple Large-scale Point-Clouds Captured fro Different Viewpoints Yousuke Kawauchi 1, Shin Usuki, Kenjiro T. Miura 3, Hiroshi Masuda 4 and Ichiro Tanaka 5 1 Shizuoka
More informationColorado School of Mines. Computer Vision. Professor William Hoff Dept of Electrical Engineering &Computer Science.
Professor Willia Hoff Dept of Electrical Engineering &Coputer Science http://inside.ines.edu/~whoff/ 1 Caera Calibration 2 Caera Calibration Needed for ost achine vision and photograetry tasks (object
More informationSmarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math
Sarter Balanced Assessent Consortiu s, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents
More informationWeeks 1 3 Weeks 4 6 Unit/Topic Number and Operations in Base 10
Weeks 1 3 Weeks 4 6 Unit/Topic Nuber and Operations in Base 10 FLOYD COUNTY SCHOOLS CURRICULUM RESOURCES Building a Better Future for Every Child - Every Day! Suer 2013 Subject Content: Math Grade 3rd
More informationA Novel Fast Constructive Algorithm for Neural Classifier
A Novel Fast Constructive Algorith for Neural Classifier Xudong Jiang Centre for Signal Processing, School of Electrical and Electronic Engineering Nanyang Technological University Nanyang Avenue, Singapore
More informationGeometry. The Method of the Center of Mass (mass points): Solving problems using the Law of Lever (mass points). Menelaus theorem. Pappus theorem.
Noveber 13, 2016 Geoetry. The Method of the enter of Mass (ass points): Solving probles using the Law of Lever (ass points). Menelaus theore. Pappus theore. M d Theore (Law of Lever). Masses (weights)
More informationSolving the Damage Localization Problem in Structural Health Monitoring Using Techniques in Pattern Classification
Solving the Daage Localization Proble in Structural Health Monitoring Using Techniques in Pattern Classification CS 9 Final Project Due Dec. 4, 007 Hae Young Noh, Allen Cheung, Daxia Ge Introduction Structural
More informationPerformance Analysis of RAID in Different Workload
Send Orders for Reprints to reprints@benthascience.ae 324 The Open Cybernetics & Systeics Journal, 2015, 9, 324-328 Perforance Analysis of RAID in Different Workload Open Access Zhang Dule *, Ji Xiaoyun,
More informationPERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/m QUEUEING MODEL
IJRET: International Journal of Research in Engineering and Technology ISSN: 239-63 PERFORMANCE MEASURES FOR INTERNET SERVER BY USING M/M/ QUEUEING MODEL Raghunath Y. T. N. V, A. S. Sravani 2 Assistant
More informationSet Theoretic Estimation for Problems in Subtractive Color
Set Theoretic Estiation for Probles in Subtractive Color Gaurav Shara Digital Iaging Technology Center, Xerox Corporation, MS0128-27E, 800 Phillips Rd, Webster, NY 14580 Received 25 March 1999; accepted
More informationA simplified approach to merging partial plane images
A siplified approach to erging partial plane iages Mária Kruláková 1 This paper introduces a ethod of iage recognition based on the gradual generating and analysis of data structure consisting of the 2D
More informationThe Internal Conflict of a Belief Function
The Internal Conflict of a Belief Function Johan Schubert Abstract In this paper we define and derive an internal conflict of a belief function We decopose the belief function in question into a set of
More informationFlucs: Artificial Lighting & Daylighting. IES Virtual Environment
Flucs: Artificial Lighting & Daylighting IES Virtual Environent Contents 1. General Description of the FLUCS Interface... 6 1.1. Coon Controls... 6 1.2. Main Application Window... 6 1.3. Other Windows...
More informationEE 364B Convex Optimization An ADMM Solution to the Sparse Coding Problem. Sonia Bhaskar, Will Zou Final Project Spring 2011
EE 364B Convex Optiization An ADMM Solution to the Sparse Coding Proble Sonia Bhaskar, Will Zou Final Project Spring 20 I. INTRODUCTION For our project, we apply the ethod of the alternating direction
More informationReal Time Displacement Measurement of an image in a 2D Plane
International Journal of Scientific Research Engineering & Technology (IJSRET), ISSN 2278 0882 Volue 5, Issue 3, March 2016 176 Real Tie Displaceent Measureent of an iage in a 2D Plane Abstract Prashant
More informationλ-harmonious Graph Colouring Lauren DeDieu
λ-haronious Graph Colouring Lauren DeDieu June 12, 2012 ABSTRACT In 198, Hopcroft and Krishnaoorthy defined a new type of graph colouring called haronious colouring. Haronious colouring is a proper vertex
More informationELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH
ELEVATION SURFACE INTERPOLATION OF POINT DATA USING DIFFERENT TECHNIQUES A GIS APPROACH Kulapraote Prathuchai Geoinforatics Center, Asian Institute of Technology, 58 Moo9, Klong Luang, Pathuthani, Thailand.
More informationG045 3D Multiple Attenuation and Depth Imaging of Ocean Bottom Seismic Data
G045 3D Multiple Attenuation and Depth Iaging of Ocean Botto Seisic Data J. Mispel* (StatoilHydro ASA), B. Arntsen (StatoilHydro ASA), A. Kritski (StatoilHydro ASA), L. Aundsen (StatoilHydro ASA), M. Thopson
More informationOperation principles of the curvature gauge
Operation principles of the curvature gauge Y.Z. HE AND A. DJODJEVICH Departent of Manufacturing Engineering and Engineering Manageent City University of Hong Kong Tat Chee Avenue, Kowloon HONG KONG (CHINA)
More informationHeliostat Field Layout Design for Solar Tower Power Plant Based on GPU
Preprints of the 19th World Congress The International Federation of Automatic Control Heliostat Field Layout Design for Solar Tower Power Plant Based on GPU Yiyi Zhou, Yuhong Zhao Department of Control
More informationA Beam Search Method to Solve the Problem of Assignment Cells to Switches in a Cellular Mobile Network
A Bea Search Method to Solve the Proble of Assignent Cells to Switches in a Cellular Mobile Networ Cassilda Maria Ribeiro Faculdade de Engenharia de Guaratinguetá - DMA UNESP - São Paulo State University
More informationGenerating Mechanisms for Evolving Software Mirror Graph
Journal of Modern Physics, 2012, 3, 1050-1059 http://dx.doi.org/10.4236/jp.2012.39139 Published Online Septeber 2012 (http://www.scirp.org/journal/jp) Generating Mechaniss for Evolving Software Mirror
More information(Geometric) Camera Calibration
(Geoetric) Caera Calibration CS635 Spring 217 Daniel G. Aliaga Departent of Coputer Science Purdue University Caera Calibration Caeras and CCDs Aberrations Perspective Projection Calibration Caeras First
More informationAvailable online at ScienceDirect. Energy Procedia 69 (2015 )
Available online at www.sciencedirect.com ScienceDirect Energy Procedia 69 (2015 ) 1885 1894 International Conference on Concentrating Solar Power and Chemical Energy Systems, SolarPACES 2014 Heliostat
More informationAN APPROACH FOR THE SEMANTICALLY CORRECT INTEGRATION OF A DTM AND 2D GIS VECTOR DATA
AN APPROACH FOR THE SEMANTICALLY CORRECT INTEGRATION OF A DTM AND 2D GIS VECTOR DATA A. Koch Institute of Photograetry and GeoInforation (IPI), University of Hannover, Gerany Nienburger Straße 1, 30167
More informationDetection of Outliers and Reduction of their Undesirable Effects for Improving the Accuracy of K-means Clustering Algorithm
Detection of Outliers and Reduction of their Undesirable Effects for Iproving the Accuracy of K-eans Clustering Algorith Bahan Askari Departent of Coputer Science and Research Branch, Islaic Azad University,
More informationDifferent criteria of dynamic routing
Procedia Coputer Science Volue 66, 2015, Pages 166 173 YSC 2015. 4th International Young Scientists Conference on Coputational Science Different criteria of dynaic routing Kurochkin 1*, Grinberg 1 1 Kharkevich
More informationSmarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math
Sarter Balanced Assessent Consortiu s, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents
More informationTensorFlow and Keras-based Convolutional Neural Network in CAT Image Recognition Ang LI 1,*, Yi-xiang LI 2 and Xue-hui LI 3
2017 2nd International Conference on Coputational Modeling, Siulation and Applied Matheatics (CMSAM 2017) ISBN: 978-1-60595-499-8 TensorFlow and Keras-based Convolutional Neural Network in CAT Iage Recognition
More informationTALLINN UNIVERSITY OF TECHNOLOGY, INSTITUTE OF PHYSICS 17. FRESNEL DIFFRACTION ON A ROUND APERTURE
7. FRESNEL DIFFRACTION ON A ROUND APERTURE. Objective Exaining diffraction pattern on a round aperture, deterining wavelength of light source.. Equipent needed Optical workbench, light source, color filters,
More informationGeo-activity Recommendations by using Improved Feature Combination
Geo-activity Recoendations by using Iproved Feature Cobination Masoud Sattari Middle East Technical University Ankara, Turkey e76326@ceng.etu.edu.tr Murat Manguoglu Middle East Technical University Ankara,
More informationSmarter Balanced Assessment Consortium Claims, Targets, and Standard Alignment for Math
Sarter Balanced Assessent Consortiu Clais, s, Stard Alignent for Math The Sarter Balanced Assessent Consortiu (SBAC) has created a hierarchy coprised of clais targets that together can be used to ake stateents
More informationAscending order sort Descending order sort
Scalable Binary Sorting Architecture Based on Rank Ordering With Linear Area-Tie Coplexity. Hatrnaz and Y. Leblebici Departent of Electrical and Coputer Engineering Worcester Polytechnic Institute Abstract
More informationConstruction of a regular hendecagon by two-fold origami
J. C. LUCERO /207 Construction of a regular hendecagon by two-fold origai Jorge C. Lucero 1 Introduction Single-fold origai refers to geoetric constructions on a sheet of paper by perforing a sequence
More informationEnergy-Efficient Disk Replacement and File Placement Techniques for Mobile Systems with Hard Disks
Energy-Efficient Disk Replaceent and File Placeent Techniques for Mobile Systes with Hard Disks Young-Jin Ki School of Coputer Science & Engineering Seoul National University Seoul 151-742, KOREA youngjk@davinci.snu.ac.kr
More informationTransformations. Prof. George Wolberg Dept. of Computer Science City College of New York
Transforations Prof. George Wolberg Dept. of Coputer Science City College of New York Objectives Introduce standard transforations - Rotations - Translation - Scaling - Shear Derive hoogeneous coordinate
More informationSemi-Passive Solar Tracking Concentrator
Available online at www.sciencedirect.com ScienceDirect Energy Procedia 57 (2014 ) 275 284 2013 ISES Solar World Congress Semi-Passive Solar Tracking Concentrator Noel León a, Héctor García a, Carlos Ramírez
More informationGromov-Hausdorff Distance Between Metric Graphs
Groov-Hausdorff Distance Between Metric Graphs Jiwon Choi St Mark s School January, 019 Abstract In this paper we study the Groov-Hausdorff distance between two etric graphs We copute the precise value
More informationImage Filter Using with Gaussian Curvature and Total Variation Model
IJECT Vo l. 7, Is s u e 3, Ju l y - Se p t 016 ISSN : 30-7109 (Online) ISSN : 30-9543 (Print) Iage Using with Gaussian Curvature and Total Variation Model 1 Deepak Kuar Gour, Sanjay Kuar Shara 1, Dept.
More informationEvaluation of a multi-frame blind deconvolution algorithm using Cramér-Rao bounds
Evaluation of a ulti-frae blind deconvolution algorith using Craér-Rao bounds Charles C. Beckner, Jr. Air Force Research Laboratory, 3550 Aberdeen Ave SE, Kirtland AFB, New Mexico, USA 87117-5776 Charles
More informationCOLLABORATIVE BEAMFORMING FOR WIRELESS AD-HOC NETWORKS
International Journal of Coputer Science and Counication Vol. 3, No. 1, January-June 2012, pp. 181-185 COLLABORATIVE BEAMFORMING FOR WIRELESS AD-HOC NETWORKS A.H. Karode 1, S.R. Suralkar 2, Manoj Bagde
More informationEffects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed
Effects of Desingularization and Collocation-Point Shift on Steady Waves with Forward Speed Yonghwan Ki* & Dick K.P. Yue** Massachusetts Institute of Technology, Departent of Ocean Engineering, Cabridge,
More informationA.S. Pidaparthi and J.E. Hoffmann
1 Optical characterization of radial-staggered heliostat fields: Model validation with SolarPILOT A.S. Pidaparthi and J.E. Hoffmann a Solar Thermal Energy Research Group (STERG), University of Stellenbosch
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 10, October ISSN
International Journal of Scientific & Engineering Research, Volue 4, Issue 0, October-203 483 Design an Encoding Technique Using Forbidden Transition free Algorith to Reduce Cross-Talk for On-Chip VLSI
More information1 Extended Boolean Model
1 EXTENDED BOOLEAN MODEL It has been well-known that the Boolean odel is too inflexible, requiring skilful use of Boolean operators to obtain good results. On the other hand, the vector space odel is flexible
More informationHIGH PERFORMANCE PRE-SEGMENTATION ALGORITHM FOR SONAR IMAGES
HIGH PERFORMANCE PRE-SEGMENTATION ALGORITHM FOR SONAR IMAGES Benjain Lehann*, Konstantinos Siantidis*, Dieter Kraus** *ATLAS ELEKTRONIK GbH Sebaldsbrücker Heerstraße 235 D-28309 Breen, GERMANY Eail: benjain.lehann@atlas-elektronik.co
More informationThe Horizontal Deformation Analysis of High-rise Buildings
Environental Engineering 10th International Conference eissn 2029-7092 / eisbn 978-609-476-044-0 Vilnius Gediinas Technical University Lithuania, 27 28 April 2017 Article ID: enviro.2017.194 http://enviro.vgtu.lt
More informationDerivation of an Analytical Model for Evaluating the Performance of a Multi- Queue Nodes Network Router
Derivation of an Analytical Model for Evaluating the Perforance of a Multi- Queue Nodes Network Router 1 Hussein Al-Bahadili, 1 Jafar Ababneh, and 2 Fadi Thabtah 1 Coputer Inforation Systes Faculty of
More informationResearch Article A Comparison of Standard One-Step DDA Circular Interpolators with a New Cheap Two-Step Algorithm
Modelling and Siulation in Engineering, Article ID 916539, 6 pages http://dx.doi.org/10.1155/2014/916539 Research Article A Coparison of Standard One-Step DDA Circular Interpolators with a New Cheap Two-Step
More informationHeterogeneous Radial Basis Function Networks
Proceedings of the International Conference on Neural Networks (ICNN ), vol. 2, pp. 23-2, June. Heterogeneous Radial Basis Function Networks D. Randall Wilson, Tony R. Martinez e-ail: randy@axon.cs.byu.edu,
More informationDesigning High Performance Web-Based Computing Services to Promote Telemedicine Database Management System
Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh 1, Issa Khalil 2, and Abdallah Khreishah 3 1: Coputer Engineering & Inforation Technology,
More informationOPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS
Key words SOA, optial, coplex service, coposition, Quality of Service Piotr RYGIELSKI*, Paweł ŚWIĄTEK* OPTIMAL COMPLEX SERVICES COMPOSITION IN SOA SYSTEMS One of the ost iportant tasks in service oriented
More informationSurvivability Function A Measure of Disaster-Based Routing Performance
Survivability Function A Measure of Disaster-Based Routing Perforance Journal Club Presentation on W. Molisz. Survivability function-a easure of disaster-based routing perforance. IEEE Journal on Selected
More informationCOLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL
COLOR HISTOGRAM AND DISCRETE COSINE TRANSFORM FOR COLOR IMAGE RETRIEVAL 1 Te-Wei Chiang ( 蔣德威 ), 2 Tienwei Tsai ( 蔡殿偉 ), 3 Jeng-Ping Lin ( 林正平 ) 1 Dept. of Accounting Inforation Systes, Chilee Institute
More informationProblem Solving of graph correspondence using Genetics Algorithm and ACO Algorithm
Proble Solving of graph correspondence using Genetics Algorith and ACO Algorith Alireza Rezaee, 1, Azizeh Ajalli 2 Assistant professor,departent of Mechatronics Engineering, Faculty of New Sciences and
More informationA Hybrid Network Architecture for File Transfers
JOURNAL OF IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 6, NO., JANUARY 9 A Hybrid Network Architecture for File Transfers Xiuduan Fang, Meber, IEEE, Malathi Veeraraghavan, Senior Meber,
More informationUsing Imperialist Competitive Algorithm in Optimization of Nonlinear Multiple Responses
International Journal of Industrial Engineering & Production Research Septeber 03, Volue 4, Nuber 3 pp. 9-35 ISSN: 008-4889 http://ijiepr.iust.ac.ir/ Using Iperialist Copetitive Algorith in Optiization
More informationGuillotine subdivisions approximate polygonal subdivisions: Part III { Faster polynomial-time approximation schemes for
Guillotine subdivisions approxiate polygonal subdivisions: Part III { Faster polynoial-tie approxiation schees for geoetric network optiization Joseph S. B. Mitchell y April 19, 1997; Last revision: May
More informationKS3 Maths Progress Delta 2-year Scheme of Work
KS3 Maths Progress Delta 2-year Schee of Work See the spreadsheet for the detail. Essentially this is an express route through our higher-ability KS3 Maths Progress student books Delta 1, 2 and 3 as follows:
More informationTHE rapid growth and continuous change of the real
IEEE TRANSACTIONS ON SERVICES COMPUTING, VOL. 8, NO. 1, JANUARY/FEBRUARY 2015 47 Designing High Perforance Web-Based Coputing Services to Proote Teleedicine Database Manageent Syste Isail Hababeh, Issa
More informationStructural Balance in Networks. An Optimizational Approach. Andrej Mrvar. Faculty of Social Sciences. University of Ljubljana. Kardeljeva pl.
Structural Balance in Networks An Optiizational Approach Andrej Mrvar Faculty of Social Sciences University of Ljubljana Kardeljeva pl. 5 61109 Ljubljana March 23 1994 Contents 1 Balanced and clusterable
More informationDepth Estimation of 2-D Magnetic Anomalous Sources by Using Euler Deconvolution Method
Aerican Journal of Applied Sciences 1 (3): 209-214, 2004 ISSN 1546-9239 Science Publications, 2004 Depth Estiation of 2-D Magnetic Anoalous Sources by Using Euler Deconvolution Method 1,3 M.G. El Dawi,
More informationWe will now take a closer look at the ideas behind the different types of symmetries that we have discussed by studying four different rigid motions.
hapter 11: The Matheatics of Syetry Sections 1-3: Rigid Motions Tuesday, pril 3, 2012 We will now take a closer look at the ideas behind the different types of syetries that we have discussed by studying
More informationAn Efficient Approach for Content Delivery in Overlay Networks
An Efficient Approach for Content Delivery in Overlay Networks Mohaad Malli, Chadi Barakat, Walid Dabbous Projet Planète, INRIA-Sophia Antipolis, France E-ail:{alli, cbarakat, dabbous}@sophia.inria.fr
More informationData pre-processing framework in SPM. Bogdan Draganski
Data pre-processing fraework in SPM Bogdan Draganski Outline Why do we need pre-processing? Overview Structural MRI pre-processing fmri pre-processing Why do we need pre-processing? What do we want? Reason
More informationGearing Up for Honors Geometry!
Gearing Up for Honors Geoetr! Honors Geoetr is right around the corner and ou need to ake sure ou are read! Man of the concepts ou learned in Algebra I will be used in Geoetr and ou will be epected to
More informationELEN : Project Progress Report. Second Order Delay Computation for RC networks with Non-Tree Topology
ELEN 689-603: Project Progress eport Second Order Delay Coputation for C networks wi Non-Tree Topology ajeshwary Tayade 000 07 573 //003 PDF created wi pdffactory trial version www.pdffactory.co : Introduction
More informationGalois Homomorphic Fractal Approach for the Recognition of Emotion
Galois Hooorphic Fractal Approach for the Recognition of Eotion T. G. Grace Elizabeth Rani 1, G. Jayalalitha 1 Research Scholar, Bharathiar University, India, Associate Professor, Departent of Matheatics,
More informationInvestigation of The Time-Offset-Based QoS Support with Optical Burst Switching in WDM Networks
Investigation of The Tie-Offset-Based QoS Support with Optical Burst Switching in WDM Networks Pingyi Fan, Chongxi Feng,Yichao Wang, Ning Ge State Key Laboratory on Microwave and Digital Counications,
More informationWavelets for Computer Graphics: A Primer Part 1
Wavelets for Coputer Graphics: A Prier Part Eric J. Stollnitz Tony D. DeRose David H. Salesin University of Washington Introduction Wavelets are a atheatical tool for hierarchically decoposing functions.
More informationGeometric Constraint Solver using Multivariate Rational Spline Functions
Geoetric onstraint Solver using Multivariate ational Spline Functions Gershon Elber Departent of oputer Science Technion srael nstitute of Technology Haifa 3000 srael E-ail: gershon@cstechnionacil Myung-Soo
More informationProve Theorems about Lines and Angles
GEOMETRY Prove Theores about Lines and Angles OJECTIVE #: G.CO.9 OJECTIVE Prove theores about lines and angles. Theores include: vertical angles are congruent; when a transversal crosses parallel lines,
More informationI-0 Introduction. I-1 Introduction. Objectives: Quote:
I-0 Introduction Objectives: Explain necessity of parallel/ultithreaded algoriths Describe different fors of parallel processing Present coonly used architectures Introduce a few basic ters Coents: Try
More informationOPTIMIZATION OF HELIOSTAT FIELDS FOR SOLAR TOWER SYSTEMS
OPTIMIZATION OF HELIOSTAT FIELDS FOR SOLAR TOWER SYSTEMS L. Pisani 1, E. Leonardi 2, M. Cogoni 2 and B. D'Aguanno 2 1 PHD, Senior researcher. CRS4, PST Polaris, Edificio 1, 09010 Pula, Italy. Tel.: +39
More informationA Discrete Spring Model to Generate Fair Curves and Surfaces
A Discrete Spring Model to Generate Fair Curves and Surfaces Atsushi Yaada Kenji Shiada 2 Tootake Furuhata and Ko-Hsiu Hou 2 Tokyo Research Laboratory IBM Japan Ltd. LAB-S73 623-4 Shiotsurua Yaato Kanagawa
More informationOn the Computation and Application of Prototype Point Patterns
On the Coputation and Application of Prototype Point Patterns Katherine E. Tranbarger Freier 1 and Frederic Paik Schoenberg 2 Abstract This work addresses coputational probles related to the ipleentation
More informationAGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM
International Journal of Software Engineering & Applications (IJSEA), Vol.6, No.5, Septeber 205 AGV PATH PLANNING BASED ON SMOOTHING A* ALGORITHM Xie Yang and Cheng Wushan College of Mechanical Engineering,
More information( ) ( ) ( ) = ( ) Summary
Where is the center of a ulti-depth arine source arra? Jon-Fredrik Hopperstad*, Robert Laws, and Ed Kragh, Schluberger Cabridge Research Suar In previous work, we discussed how to design a arine source
More informationAutomatic Graph Drawing Algorithms
Autoatic Graph Drawing Algoriths Susan Si sisuz@turing.utoronto.ca Deceber 7, 996. Ebeddings of graphs have been of interest to theoreticians for soe tie, in particular those of planar graphs and graphs
More information3D Building Detection and Reconstruction from Aerial Images Using Perceptual Organization and Fast Graph Search
436 Journal of Electrical Engineering & Technology, Vol. 3, No. 3, pp. 436~443, 008 3D Building Detection and Reconstruction fro Aerial Iages Using Perceptual Organization and Fast Graph Search Dong-Min
More informationIdentifying Converging Pairs of Nodes on a Budget
Identifying Converging Pairs of Nodes on a Budget Konstantina Lazaridou Departent of Inforatics Aristotle University, Thessaloniki, Greece konlaznik@csd.auth.gr Evaggelia Pitoura Coputer Science and Engineering
More informationBrian Noguchi CS 229 (Fall 05) Project Final Writeup A Hierarchical Application of ICA-based Feature Extraction to Image Classification Brian Noguchi
A Hierarchical Application of ICA-based Feature Etraction to Iage Classification Introduction Iage classification poses one of the greatest challenges in the achine vision and achine learning counities.
More informationAbstract. for L1VPNs [2, 3] and the standardization work at the Internet Engineering Task Force (IETF) is in progress [4].
Traffic Deand Modeling for Dynaic Layer 1 VPN Serices * Joachi Scharf, Martin Köhn Uniersity of Stuttgart, Institute of Counication Networks and Coputer Engineering (IKR), Pfaffenwaldring 47, 70569 Stuttgart,
More informationMATRIX CALCULATION BACKWARD CHAINING IN RULE BASED EXPERT SYSTEM
4 th Research/Expert Conference with International Participation QUAITY 5, Fojnica, B&H, Noveber 9 -, 5 ATRIX CACUATION BACKWARD CHAINING IN RUE BASED EXPERT SYSTE sc aro Hell Universit of Split, Facult
More informationCOMPUTER GENERATED HOLOGRAMS Optical Sciences 627 W.J. Dallas (Monday, August 23, 2004, 12:38 PM) PART III: CHAPTER ONE DIFFUSERS FOR CGH S
COPUTER GEERATED HOLOGRAS Optical Sciences 67 W.J. Dallas (onday, August 3, 004, 1:38 P) PART III: CHAPTER OE DIFFUSERS FOR CGH S Part III: Chapter One Page 1 of 8 Introduction Hologras for display purposes
More informationShape Optimization of Quad Mesh Elements
Shape Optiization of Quad Mesh Eleents Yufei Li 1, Wenping Wang 1, Ruotian Ling 1, and Changhe Tu 2 1 The University of Hong Kong 2 Shandong University Abstract We study the proble of optiizing the face
More informationShortest Path Determination in a Wireless Packet Switch Network System in University of Calabar Using a Modified Dijkstra s Algorithm
International Journal of Engineering and Technical Research (IJETR) ISSN: 31-869 (O) 454-4698 (P), Volue-5, Issue-1, May 16 Shortest Path Deterination in a Wireless Packet Switch Network Syste in University
More informationIMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE. Rafael García, Xevi Cufí and Lluís Pacheco
IMAGE MOSAICKING FOR ESTIMATING THE MOTION OF AN UNDERWATER VEHICLE Rafael García, Xevi Cufí and Lluís Pacheco Coputer Vision and Robotics Group Institute of Inforatics and Applications, University of
More informationOblivious Routing for Fat-Tree Based System Area Networks with Uncertain Traffic Demands
Oblivious Routing for Fat-Tree Based Syste Area Networks with Uncertain Traffic Deands Xin Yuan Wickus Nienaber Zhenhai Duan Departent of Coputer Science Florida State University Tallahassee, FL 3306 {xyuan,nienaber,duan}@cs.fsu.edu
More informationQuantitative Comparison of Sinc-Approximating Kernels for Medical Image Interpolation
Quantitative Coparison of Sinc-Approxiating Kernels for Medical Iage Interpolation Erik H. W. Meijering, Wiro J. Niessen, Josien P. W. Plui, Max A. Viergever Iage Sciences Institute, Utrecht University
More informationMing-Wei Lee 1, Wei-Tso Lin 1, Yu-Ching Ni 2, Meei-Ling Jan 2, Yi-Chun Chen 1 * National Central University
Rapid Constructions of Circular-Orbit Pinhole SPECT Iaging Syste Matrices by Gaussian Interpolation Method Cobined with Geoetric Paraeter Estiations (GIMGPE Ming-Wei Lee, Wei-Tso Lin, Yu-Ching Ni, Meei-Ling
More informationModelling and simulation of a solar tower power plant
Modelling and simulation of a solar tower power plant M. Ewert 1, O. Navarro Fuentes 1 Master student of computer science at RWTH Aachen University, Aachen, Germany, matthias.ewert@rwth-aachen.de. Master
More information