Improving Information Retrieval System Security via an Optimal Maximal Coding Scheme
|
|
- Shonda Griffith
- 6 years ago
- Views:
Transcription
1 Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk Departmet of Computer Sciece, Zhogsha Uiversity, Guagzhou 5075, PRC dylog500@yahoo.com Abstract. Novel maximal codig compressio techiques for the most importat file-the text file of ay full-text retrieval system are discussed i this paper. As a cotiuatio of our previous work, we show that the optimal maximal codig schemes coicide with the optimal uiquely decodable codig schemes. A efficiet algorithm geeratig a optimal maximal code (or a optimal uiquely decodable code) is also give. Similar to the Huffma codes, from the computatioal difficulty ad the iformatio-theoretic impossibility poit of view, the problem of breakig a optimal maximal code is further ivestigated. Due to the Huffma code beig a proper subclass of the optimal maximal code, which is good at applyig to a large iformatio retrieval system ad cosequetly improvig the system security. Itroductio The Huffma codig [9] has bee widely used i data, image, ad video compressio [-6,-5]. The ideal of usig data compressio schemes for ecryptio is very old, datig back at least to Roger Baco i the th cetury [5]. The field of data compressio has grow vigorously sice Huffma s algorithm that is published i 95. Rubi [] ad Joes [] preset the ways i which data compressio algorithms may be used as ecryptio techiques. Klei et al. [6] have discussed the cryptographic properties of Huffma codes i the cotext of a large, compressed atural laguage database o CD-ROM. Based o the same problem, Fraekel ad Klei [4] have prove that, give a atural laguage cleartext ad a ciphertext obtaied by Huffma codig, the complexity of guessig the Huffma code is NPcomplete. Gillma et al. [5] have also cosidered the problem of decipherig a file that has bee Huffma coded but ot otherwise ecrypted, from the iformatiotheoretic impossibility but ot the computatioal difficulty poit of view. They fid This work was partially sposored by the 00 Ope Project of the State Key Laboratory of Iformatio Security (SKLOIS) (project No. 0-0), the Natioal Natural Sciece Foudatio of Chia (project No ) ad the Guagdog Provicial Natural Sciece Foudatio (project No. 0074).
2 Dogyag Log that a Huffma code ca be surprisigly difficult to cryptaalyze. The authors [7-8] have itroduced ovel optimal uiquely decodable, prefix, maximal prefix, ad maximal codig schemes. We have show that all Huffma codes have to be optimal uiquely decodable, prefix, maximal prefix, ad maximal codes. Coversely, oe of the optimal uiquely decodable, prefix, maximal prefix, ad maximal codes is ecessarily the Huffma code. To see differece betwee four types of the optimal codes above ad Huffma codes, we first cosider the followig example. Example. Let a iformatio source I = S = { s, s, s, s s, }, ( 4, 5 s6 P = {0.6,0.4,0.4,0.,0.,0.}) ad iput alphabet Σ = {0, }. The followig Table. shows two Huffma codes ad a o-huffma code. Accordig to the Huffma s algorithm, we kow that the codes of source alphabets s ad s must start with differet bits, but i C they both start with 0. This code C is therefore impossible to geerate by ay re-labelig of the odes of the Huffma trees. That is, C caot be geerated by the Huffma method! We easily verify that C is a optimal uiquely decodable, prefix, maximal prefix, ad maximal code. Ad the code C 4 is clearly ot a prefix code ad cosequetly it caot be the optimal prefix or maximal prefix code. But, We easily calculate l(00) l(0) l(00) l (0) l (0) + = = Table. Two Huffma ad a o-huffma codes l() Source letter Probability Huffma Huffma Code C Code C Code C Code C 4 s s s s s s Thus, by Theorem.4. i [4], C 4 is a maximal code. Sice C 4 has the same average code word legth as the Huffma code C, C 4 is ot oly a optimal maximal code but also a optimal uiquely decodable code (by Theorem i [7] ad Theorem i [8]). Example. shows that the class of Huffma codes is a proper subclass of the above four types of optimal codes ad that the optimal uiquely decodable code (maximal code) is differet from the optimal prefix code (maximal prefix code). Motivated by the same problem as breakig a Huffma code [4-5], the problem of breakig a optimal uiquely decodable code (maximal code) will be preseted. Because there is a quite differece betwee the uiquely decodable code ad the
3 Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme prefix code, breakig a optimal prefix code (maximal prefix code) will be ivestigated i a separate paper. Additioally, although the terms ad otios such as Huffma codig (ecodig), Huffma code, optimal code, ad optimal prefix code are easily foud i may literatures [,,4], relatioships of these cocepts has bee rather vague ad have ot detailed yet. Optimal Uiquely Decodable, Optimal Maximal, ad Huffma Codes I geeral, the class of maximal codes is much less tha the class of uiquely decodable codes [,0]. For optimal uiquely decodable ad optimal maximal codes, however, they are strog coected. Further relatio betwee them is give below. First, we have the followig Theorem.. Theorem. Every optimal maximal code has to be a optimal uiquely decodable code. Proof: The details of proof of the theorem are omitted here. # Coversely, the followig result is give. Theorem. Every optimal uiquely decodable code has to be maximal. Proof: We first show that Theorem. is true for the alphabet { 0.}. Suppose that ( S, P) is a fiite iformatio source. Let C = c, c,..., c } be a optimal { l c ) = l, l( c ) = l,..., l( c ) = l ( l... l. Without loss of geerality, suppose that C is a optimal prefix uiquely decodable code. Ad, ad l code. I fact, for the uiquely decodable code C there exists a prefix code D such that D has the same sequece of code word legths as C. By defiitios, it is easy to verify that D is optimal. Assume that P = p, p,..., p } with p { p... p. We will show that C is a maximal prefix code by reductio to absurdity. Suppose that C is ot a maximal prefix code. By defiitios, there exists + at least a code word c { 0,} C such that C {c} is still a prefix code. Whe l ( c) < l( c i ) = l i for some i, we easily costruct a prefix code C = ( C { ci }) { } = c, c,..., c,..., c } such that the average code word c { C is less tha the oe of the optimal prefix code C. legth of the prefix code Therefore, this is impossible. Thus we have that l l... l l( ). Accordig c l = l(c. to the choice of the code word c, we ca take the code word c satisfyig ) Otherwise, we easily get the code word c by replacig c with ay prefix ' c, which is
4 4 Dogyag Log l, of the word c. Now, let c = d0 or c = d of the legth prefix of c ad of the legth, where d is the proper l. If c = d0 ad the word d is ot i C, by C {c} beig a prefix code, the C {d} is a prefix code ad cosequetly C = c, c,..., c, } is also a prefix code. Clearly, the average code word legth of ( d C is less tha the oe of the optimal prefix code C. This is the prefix code impossible too. Similarly, whe c = d ad the word d 0 is ot i C, we will get a cotradictio too. Therefore, without loss of geerality, assume that c = d0 C ad the word d C. Sice C is a prefix code, the set C = ( C { d}) { } is also a prefix code. By l = l(c) = l (d0) = l (d) d, the average code word legth of the prefix code C = ( C { d}) { d} is p l + pl p l + p ( l ). Clearly, p l + pl p l + p ( l ) < p l + pl p l + pl which is the average code word legth of the optimal prefix code C. This cotradicts with C beig a optimal prefix code. Combiig the above discussio, we have that C is a maximal prefix code. That is, a optimal prefix code has to be maximal. Next, cosider the umber of the alphabet beig greater tha. The details of proof are omitted here. Combiig the above discussio, we have that C is a maximal code. # Therefore, by Theorems. ad. we immediately get Corollary. below. Corollary. Optimal uiquely decodable codes coicide with optimal maximal codes. Remark. It is very iterestig that the word optimal cocers the ecoomy of a code. As see i [0], if C is a maximal code the every code word occurs as part of a message, hece o part of all words over the alphabet is wasted. Every optimal uiquely decodable code has to be a maximal code. However, this particular property does ot belog to geeral codig schemes. Note that i all the followig sectios, optimal code, optimal uiquely decodable code, ad optimal maximal code are oly differet ames for the same thig. Although Huffma codes are a proper subclass of maximal codes, Theorem., which follows, shows early relatio betwee Huffma codes ad maximal codes. We will omit the details of proof of Theorem.. Theorem. If iformatio source ) + C is ay maximal code, the there exist some suitable Σ I = ( Σ, P ad a Huffma code H for I such that C has the
5 Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme 5 same average code word legth as H. Ad cosequetly C is a optimal code for I = ( Σ, P). Remark. By Theorem i [7], we have that a Huffma code has to be a maximal code. Coversely, makig use of Theorem., for ay maximal code H, we are able to costruct a suitable probability distributio H (i.e., a suitable iformatio source I = ( Σ, P), because of the alphabet Σ determied by P ) such that H is exactly a I = ( Σ, P. Therefore, whe takig out all probability Huffma code for ) distributios P, a maximal code ca be cosidered as a Huffma code. I other words, the maximal codig schemes are very ear to the Huffma codig schemes. I additioal, for a special iformatio source with a dyadic [6] probability distributio, we easily costruct a optimal maximal code, i.e., we have Theorem.4 below. Proof of the theorem is also omitted. I Theorem.4 Let = Σ, ) be a fiite iformatio source with a dyadic probability P ( P distributio { l, l =,..., l } with.... The ay maximal code C = c, c,..., c } satisfyig the coditios l c ) = l, l( c ) =,..., ad { l ( c ) = l is the optimal maximal code for I ( Σ, P) l l =. l ( l Applicatio to Data Compressio As the simplest example, cosider a special file A B 4 A 90 B over the alphabet {A, B}. Regardless of the probabilities, Huffma codig will assig a sigle bit to each of the letters A ad B, givig o compressio, thus the file is 00 bits. But i dictioary methods but ot traditioal statistical modelig, we take a maximal codig such that A B 4 A 89, AB 0, ad BB 00, where {, 0, 00} is clearly a maximal code. Ad the file 00 is 5 bits. Therefore, we get a compressio ratio of 00/.. For example, we will ecode the file M: STATUS REPORT ON THE FIRST ROUND OF THE DEVELOPMENT OF THE ADVANCED ENCRYPTION STANDARD. By makig use of Table., i traditioal statistical modelig, we easily calculate that the average code word legth of the block code C is 5 bits/symbol, ad that the average code word legth of a Huffma code C is 4/87 bits/symbol. Furthermore, the ecoded file by the block code C ad the Huffma code C will take up 87 5 = 45 bits ad 87 4/87 = 4 bits, respectively. Thus the compressio ratio is 45/4 =.7:. We cosider the code D i Table.. It is easy to verify that the code D is a optimal code without the Huffma code. I fact, sice the word 0 is a proper prefix of the word 0, D is ot a Huffma code (by Theorem 5..). Clearly, the code D has the same average code word legth as the Huffma code C, thus D is a optimal
6 6 Dogyag Log code. By the results of Sectio 5.5, D has the same compressio ratio 45/4 =.7: as the Huffma code C. By Table., we directly follow that the two codes D ad D 4 are ot prefix codes. Ad D 4 is a optimal code without the Huffma code. By directly calculatig, we kow that D ad D 4 have the compressio ratio 45/90 4.8: ad 45/ :, respectively (comparig with the block code C i Table.). Ad they have the compressio ratio 7 4/90.: ad 7 4/74.46:, respectively (comparig with the block code C 5 i Table.). Table. A optimal codig Source Letter Probability Block Code C Optimal Code D Huffma code C (Space) / T 0/ E 9/ N 7/ O 7/ D 6/ R 6/ A 4/ S 4/ C / F / H / P / I / U / V / L / M / Y / Table. Codig schemes based o source words Source Word Probability Code D Optimal Code D 4 Huffma Code C 4 Block Code C 5 (Space) / THE / ON / ENCRYPTION / STANDARD /7 0 ADVANCED / STATUS / REPORT / FIRST / ROUND / DEVELOPMENT / ON /
7 Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme 7 4 Breakig a Optimal Maximal Code As see from [4], from the issue of computatioal difficulty, it easily follows the followig theorem 4.. Theorem 4. Give a origial file ad a correspodig ecoded file by the optimal codig, the complexity of guessig the optimal code is NP-complete. We further have the followig Theorem 4. ([8], Theorem 4.). Theorem 4. Let M be the ecoded file by the uiquely decodable codig (the maximal codig) ad the legth of M be m. The M is ecoded by at most uiquely decodable codes (maximal codes). m Note that Theorem 4. is a immediately corollary of Theorem 4.. Moreover, i the proof of Theorem 4. we assume that it is simple to verify that a give set of words is a uiquely decodable code. But, i fact, it is very difficult to decide whether a fiite set of words is a uiquely decodable code [], eve if there has bee the Sardias ad Patterso algorithm ([], p.8). Therefore, from the computatioal complexity poit of view, breakig a optimal maximal code is much more difficult tha the complexity provided by Theorem 4.. Next, from the iformatio-theoretic impossibility poit of view [5], we will discuss the problem of breakig a optimal uiquely decodable code. First, a efficiet algorithm geeratig a optimal maximal code is give below. Theorem 4. For a give fiite iformatio source there exists a efficiet algorithm costructig a optimal uiquely decodable code. Proof: The details of proof of the theorem are omitted here. # Note that the optimal codes costructed by the way i the above theorem 4. are ot the Huffma codes i geeral. Additioally, as see [5], we easily verify that: Breakig the ecoded file by a optimal uiquely decodable code ca be surprisigly difficult. 5 Coclusio As we have see from [6], the Huffma codes are good at usig i a large iformatio retrieval system. Importat for a large iformatio retrieval system is the issue of the cryptographic security of storig the text i compressed form, as might be required for copyrighted material. Ad i the usual approach to full-text retrieval, the processig of queries does ot directly ivolve the origial text files (i which key words may be located usig some patter matchig techique), but rather the auxiliary dictioary ad cocordace files. A optimal maximal codig scheme based o the words of the origial file is suitable for storig these auxiliary dictioary ad cocordace files.
8 8 Dogyag Log O the other had, although the adaptive Huffma codig [,5] ad the Lempel- Ziv codig [] are preferred i some real-time applicatios ad for commuicatio, they are ot suitable for storig a large body of static text. Fially, we have kow that the Huffma code is a proper subclass of the uiquely decodable code. From Theorem 4. ad 4., it easily follows that breakig a optimal uiquely decodable code is much more difficult tha breakig a Huffma code. Therefore, the issue of the cryptographic security of a large iformatio retrieval system will be further improved by a optimal uiquely decodable code compressed. Refereces. Berstel, J., Perri, D.: Theory of Codes. Academic Press, Orlado (985). Bell, T.C., Cleary, J.G., Witte, I.H.: Text Compressio. Pretice Hall. Eglewood Cliffs, NJ (990). Cover, T, Thomas, J.: Elemets of Iformatio Theory. New York, Wiley (99) 4. Fraekel, A.S., Klei, S.T.: Complexity Aspects of Guessig Prefix Codes. Algorithmica, Vol.(994), Gillma, David, W., Mohtashemi, M., Rivest, R.L.: O Breakig a Huffma Code. IEEE Tras. Iform. Theory, IT- 4(996), Klei, S.T., Bookstei, A., Deerwester, S.: Storig Text-Retrieval Systems o CD-ROM: Compressio ad Ecryptio Cosideratios. ACM Tras. Iform. Syst., Vol.7(989), Log, D., Jia, W.: Optimal Maximal Ecodig Differet From Huffma Ecodig. Proc. of Iteratioal Coferece o Iformatio Techology: Codig ad Computig (ITCC 00), Las Vegas, IEEE Computer Society (00) Log, D., Jia, W.: O the Optimal Codig. Advaces i Multimedia Iformatio Processig, Lecture Notes i Computer Sciece 95, Spriger-Verlag, Berli (00) Huffma, D.A.: A Method for the Costructio of Miimum-Redudacy Codes. Proc. IRE, Vol.40(95), Jürgese, H., Kostatiidis, S.: Codes. i: G. Rozeberg, A. Salomaa (editors), Hadbook of Formal Laguages, Vol. Spriger-Verlag Berli Heidelberg (997) Joes, D.W.: Applicatios of Splay Trees to Data Compressio. Commuicatio of ACM, Vol.(988), Lider, T., Tarokh, V., Zeger, K.: Existece of Optimal Prefix Codes for Ifiite Source Alphabets. IEEE Tras. Iform. Theory, 4(997)6, Rubi, F.: Cryptographic Aspects of Data Compressio Codes. Cryptologia, Vol.(979), Roma, S.: Itroductio to Codig ad Iformatio Theory. Spriger-Verlag New York (996) 5. Vitter, J.S.: Desig ad Aalysis of Dyamic Huffma Codes. Joural of the Associatio for Computig Machiery, 4(987)4,
BASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationSum-connectivity indices of trees and unicyclic graphs of fixed maximum degree
1 Sum-coectivity idices of trees ad uicyclic graphs of fixed maximum degree Zhibi Du a, Bo Zhou a *, Nead Triajstić b a Departmet of Mathematics, South Chia Normal Uiversity, uagzhou 510631, Chia email:
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationCombination Labelings Of Graphs
Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is
More informationA study on Interior Domination in Graphs
IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationRelationship between augmented eccentric connectivity index and some other graph invariants
Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats
More informationThe Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationSome New Results on Prime Graphs
Ope Joural of Discrete Mathematics, 202, 2, 99-04 http://dxdoiorg/0426/ojdm202209 Published Olie July 202 (http://wwwscirporg/joural/ojdm) Some New Results o Prime Graphs Samir Vaidya, Udaya M Prajapati
More informationPETRI NETS GENERATING KOLAM PATTERNS
. Lalitha et al / Idia Joural of omputer Sciece ad Egieerig (IJSE) PETRI NETS GENERATING KOLAM PATTERNS. Lalitha epartmet of Mathematics Sathyabama Uiversity, heai-119, Idia lalkrish_24@yahoo.co.i K. Ragaraja
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationStrong Complementary Acyclic Domination of a Graph
Aals of Pure ad Applied Mathematics Vol 8, No, 04, 83-89 ISSN: 79-087X (P), 79-0888(olie) Published o 7 December 04 wwwresearchmathsciorg Aals of Strog Complemetary Acyclic Domiatio of a Graph NSaradha
More informationA Note on Chromatic Transversal Weak Domination in Graphs
Iteratioal Joural of Mathematics Treds ad Techology Volume 17 Number 2 Ja 2015 A Note o Chromatic Trasversal Weak Domiatio i Graphs S Balamuruga 1, P Selvalakshmi 2 ad A Arivalaga 1 Assistat Professor,
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationLecture 2: Spectra of Graphs
Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad
More informationPrime Cordial Labeling on Graphs
World Academy of Sciece, Egieerig ad Techology Iteratioal Joural of Mathematical ad Computatioal Scieces Vol:7, No:5, 013 Prime Cordial Labelig o Graphs S. Babitha ad J. Baskar Babujee, Iteratioal Sciece
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationPruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c
Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules
More informationRedundancy Allocation for Series Parallel Systems with Multiple Constraints and Sensitivity Analysis
IOSR Joural of Egieerig Redudacy Allocatio for Series Parallel Systems with Multiple Costraits ad Sesitivity Aalysis S. V. Suresh Babu, D.Maheswar 2, G. Ragaath 3 Y.Viaya Kumar d G.Sakaraiah e (Mechaical
More informationA RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH
J. Appl. Math. & Computig Vol. 21(2006), No. 1-2, pp. 233-238 Website: http://jamc.et A RELATIONSHIP BETWEEN BOUNDS ON THE SUM OF SQUARES OF DEGREES OF A GRAPH YEON SOO YOON AND JU KYUNG KIM Abstract.
More informationMatrix Partitions of Split Graphs
Matrix Partitios of Split Graphs Tomás Feder, Pavol Hell, Ore Shklarsky Abstract arxiv:1306.1967v2 [cs.dm] 20 Ju 2013 Matrix partitio problems geeralize a umber of atural graph partitio problems, ad have
More informationLecture 6. Lecturer: Ronitt Rubinfeld Scribes: Chen Ziv, Eliav Buchnik, Ophir Arie, Jonathan Gradstein
068.670 Subliear Time Algorithms November, 0 Lecture 6 Lecturer: Roitt Rubifeld Scribes: Che Ziv, Eliav Buchik, Ophir Arie, Joatha Gradstei Lesso overview. Usig the oracle reductio framework for approximatig
More informationCompactness of Fuzzy Sets
Compactess of uzzy Sets Amai E. Kadhm Departmet of Egieerig Programs, Uiversity College of Madeat Al-Elem, Baghdad, Iraq. Abstract The objective of this paper is to study the compactess of fuzzy sets i
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationMAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS
Fura Uiversity Electroic Joural of Udergraduate Matheatics Volue 00, 1996 6-16 MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS DAVID SITTON Abstract. How ay edges ca there be i a axiu atchig i a coplete
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationFREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS
FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y
More informationA Parallel DFA Minimization Algorithm
A Parallel DFA Miimizatio Algorithm Ambuj Tewari, Utkarsh Srivastava, ad P. Gupta Departmet of Computer Sciece & Egieerig Idia Istitute of Techology Kapur Kapur 208 016,INDIA pg@iitk.ac.i Abstract. I this
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More information4-Prime cordiality of some cycle related graphs
Available at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 193-9466 Vol. 1, Issue 1 (Jue 017), pp. 30 40 Applicatios ad Applied Mathematics: A Iteratioal Joural (AAM) 4-Prime cordiality of some cycle related
More informationVisualization of Gauss-Bonnet Theorem
Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationTheory of Fuzzy Soft Matrix and its Multi Criteria in Decision Making Based on Three Basic t-norm Operators
Theory of Fuzzy Soft Matrix ad its Multi Criteria i Decisio Makig Based o Three Basic t-norm Operators Md. Jalilul Islam Modal 1, Dr. Tapa Kumar Roy 2 Research Scholar, Dept. of Mathematics, BESUS, Howrah-711103,
More informationNovel Encryption Schemes Based on Catalan Numbers
D. Sravaa Kumar, H. Sueetha, A. hadrasekhar / Iteratioal Joural of Egieerig Research ad Applicatios (IJERA) ISSN: 48-96 www.iera.com Novel Ecryptio Schemes Based o atala Numbers 1 D. Sravaa Kumar H. Sueetha
More informationModule 8-7: Pascal s Triangle and the Binomial Theorem
Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced
More informationCOSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1
COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,
More informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationABOUT A CONSTRUCTION PROBLEM
INTERNATIONAL JOURNAL OF GEOMETRY Vol 3 (014), No, 14 19 ABOUT A CONSTRUCTION PROBLEM OVIDIU T POP ad SÁNDOR N KISS Abstract I this paper, we study the costructio of a polygo if we kow the midpoits of
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationare two specific neighboring points, F( x, y)
$33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'
More informationA Comparative Study of Positive and Negative Factorials
A Comparative Study of Positive ad Negative Factorials A. M. Ibrahim, A. E. Ezugwu, M. Isa Departmet of Mathematics, Ahmadu Bello Uiversity, Zaria Abstract. This paper preset a comparative study of the
More informationMean cordiality of some snake graphs
Palestie Joural of Mathematics Vol. 4() (015), 49 445 Palestie Polytechic Uiversity-PPU 015 Mea cordiality of some sake graphs R. Poraj ad S. Sathish Narayaa Commuicated by Ayma Badawi MSC 010 Classificatios:
More informationRandom Graphs and Complex Networks T
Radom Graphs ad Complex Networks T-79.7003 Charalampos E. Tsourakakis Aalto Uiversity Lecture 3 7 September 013 Aoucemet Homework 1 is out, due i two weeks from ow. Exercises: Probabilistic iequalities
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationThroughput-Delay Scaling in Wireless Networks with Constant-Size Packets
Throughput-Delay Scalig i Wireless Networks with Costat-Size Packets Abbas El Gamal, James Mamme, Balaji Prabhakar, Devavrat Shah Departmets of EE ad CS Staford Uiversity, CA 94305 Email: {abbas, jmamme,
More informationHigher-order iterative methods free from second derivative for solving nonlinear equations
Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationLow Complexity H.265/HEVC Coding Unit Size Decision for a Videoconferencing System
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 6 Special Issue o Logistics, Iformatics ad Service Sciece Sofia 2015 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI:
More informationImproved Random Graph Isomorphism
Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such
More informationΣ P(i) ( depth T (K i ) + 1),
EECS 3101 York Uiversity Istructor: Ady Mirzaia DYNAMIC PROGRAMMING: OPIMAL SAIC BINARY SEARCH REES his lecture ote describes a applicatio of the dyamic programmig paradigm o computig the optimal static
More informationPerhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where
ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex
More informationRESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE
RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE Z.G. Zhou, S. Zhao, ad Z.G. A School of Mechaical Egieerig ad Automatio, Beijig Uiversity of Aeroautics ad Astroautics,
More informationConvergence results for conditional expectations
Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,
More informationOn Spectral Theory Of K-n- Arithmetic Mean Idempotent Matrices On Posets
Iteratioal Joural of Sciece, Egieerig ad echology Research (IJSER), Volume 5, Issue, February 016 O Spectral heory Of -- Arithmetic Mea Idempotet Matrices O Posets 1 Dr N Elumalai, ProfRMaikada, 3 Sythiya
More informationA Polynomial Interval Shortest-Route Algorithm for Acyclic Network
A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted
More informationSuper Vertex Magic and E-Super Vertex Magic. Total Labelling
Proceedigs of the Iteratioal Coferece o Applied Mathematics ad Theoretical Computer Sciece - 03 6 Super Vertex Magic ad E-Super Vertex Magic Total Labellig C.J. Deei ad D. Atoy Xavier Abstract--- For a
More informationA New Bit Wise Technique for 3-Partitioning Algorithm
Special Issue of Iteratioal Joural of Computer Applicatios (0975 8887) o Optimizatio ad O-chip Commuicatio, No.1. Feb.2012, ww.ijcaolie.org A New Bit Wise Techique for 3-Partitioig Algorithm Rajumar Jai
More informationMapping Publishing and Mapping Adaptation in the Middleware of Railway Information Grid System
Mappig Publishig ad Mappig Adaptatio i the Middleware of Railway Iformatio Grid ystem You Gamei, Liao Huamig, u Yuzhog Istitute of Computig Techology, Chiese Academy of cieces, Beijig 00080 gameiu@ict.ac.c
More informationAn Improvement of the Basic El-Gamal Public Key Cryptosystem
Iteratioal Joural of Computer Applicatios Techology ad Research A Improvemet of the Basic El-Gamal Public Key Cryptosystem W.D.M.G.M. Dissaayake (PG/MPhil/2015/09 Departmet of Computer Egieerig Faculty
More informationParallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware
Parallel Polygo Approximatio Algorithm Targeted at Recofigurable Multi-Rig Hardware M. Arif Wai* ad Hamid R. Arabia** *Califoria State Uiversity Bakersfield, Califoria, USA **Uiversity of Georgia, Georgia,
More informationAssignment 5; Due Friday, February 10
Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors
More informationSome non-existence results on Leech trees
Some o-existece results o Leech trees László A.Székely Hua Wag Yog Zhag Uiversity of South Carolia This paper is dedicated to the memory of Domiique de Cae, who itroduced LAS to Leech trees.. Abstract
More informationA Generalized Set Theoretic Approach for Time and Space Complexity Analysis of Algorithms and Functions
Proceedigs of the 10th WSEAS Iteratioal Coferece o APPLIED MATHEMATICS, Dallas, Texas, USA, November 1-3, 2006 316 A Geeralized Set Theoretic Approach for Time ad Space Complexity Aalysis of Algorithms
More informationc-dominating Sets for Families of Graphs
c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the
More informationAverage Connectivity and Average Edge-connectivity in Graphs
Average Coectivity ad Average Edge-coectivity i Graphs Jaehoo Kim, Suil O July 1, 01 Abstract Coectivity ad edge-coectivity of a graph measure the difficulty of breakig the graph apart, but they are very
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationRainbow Vertex Coloring for Line, Middle, Central, Total Graph of Comb Graph
Idia Joural of Sciece ad Techology, Vol 9(S, DOI: 0.7485/ijst/206/v9iS/97463, December 206 ISSN (Prit : 0974-6846 ISSN (Olie : 0974-5645 Raibow Vertex Colorig for Lie, Middle, Cetral, Total Graph of Comb
More informationGraphs. Minimum Spanning Trees. Slides by Rose Hoberman (CMU)
Graphs Miimum Spaig Trees Slides by Rose Hoberma (CMU) Problem: Layig Telephoe Wire Cetral office 2 Wirig: Naïve Approach Cetral office Expesive! 3 Wirig: Better Approach Cetral office Miimize the total
More informationSome cycle and path related strongly -graphs
Some cycle ad path related strogly -graphs I. I. Jadav, G. V. Ghodasara Research Scholar, R. K. Uiversity, Rajkot, Idia. H. & H. B. Kotak Istitute of Sciece,Rajkot, Idia. jadaviram@gmail.com gaurag ejoy@yahoo.co.i
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationSymmetric Class 0 subgraphs of complete graphs
DIMACS Techical Report 0-0 November 0 Symmetric Class 0 subgraphs of complete graphs Vi de Silva Departmet of Mathematics Pomoa College Claremot, CA, USA Chaig Verbec, Jr. Becer Friedma Istitute Booth
More informationHashing Functions Performance in Packet Classification
Hashig Fuctios Performace i Packet Classificatio Mahmood Ahmadi ad Stepha Wog Computer Egieerig Laboratory Faculty of Electrical Egieerig, Mathematics ad Computer Sciece Delft Uiversity of Techology {mahmadi,
More informationEFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS
Iteratioal Joural o Natural Laguage Computig (IJNLC) Vol. 2, No., February 203 EFFECT OF QUERY FORMATION ON WEB SEARCH ENGINE RESULTS Raj Kishor Bisht ad Ila Pat Bisht 2 Departmet of Computer Sciece &
More informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationOn Nonblocking Folded-Clos Networks in Computer Communication Environments
O Noblockig Folded-Clos Networks i Computer Commuicatio Eviromets Xi Yua Departmet of Computer Sciece, Florida State Uiversity, Tallahassee, FL 3306 xyua@cs.fsu.edu Abstract Folded-Clos etworks, also referred
More informationA Modified Multiband U Shaped and Microcontroller Shaped Fractal Antenna
al Joural o Recet ad Iovatio Treds i Computig ad Commuicatio ISSN: 221-8169 A Modified Multibad U Shaped ad Microcotroller Shaped Fractal Atea Shweta Goyal 1, Yogedra Kumar Katiyar 2 1 M.tech Scholar,
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More information