Fuzzy soft -ring. E Blok Esenler, Istanbul, Turkey 2 Department of Mathematics, Marmara University, Istanbul, Turkey
|
|
- Winifred Morrison
- 5 years ago
- Views:
Transcription
1 IJST (202) A4: Irnn Journl of Scence & Technology Fuzzy soft -rng S Onr, B A Ersoy * nd U Tekr 2 Deprtment of Mthemtcs, Yıldız Techncl Unversty Dvutpş Kmpüsü E Blok Esenler, Istnbul, Turkey 2 Deprtment of Mthemtcs, Mrmr Unversty, Istnbul, Turkey E-mls: serkn0r@gmlcom, ersoy@yldzedutr & utekr@mrmredutr Abstrct The concept of fuzzy soft Γ-rng s ntroduced; nd some propertes of fuzzy soft Γ-rngs re gven Then the defntons of fuzzy soft Γ-dels re proposed nd some of ther theores re consdered Keywords: rng; fuzzy soft rng; soft rng Introducton Snce the concept of soft sets ws ntroduced by Molodtsov [] n 999, soft sets theory hs been extensvely studed by mny uthors Ths theory hs been ppled to mny dfferent felds, such s functon smoothness, emnn nd Perron ntegrton, mesurement nd gme theory, decson mkng M et l [2, 3] ponted out severl drectons or pplctons of soft sets They lso studed severl opertons on the theory of soft sets Chen et l [4] ntroduced new defnton of soft set prmeterztons reducton, nd compred ths defnton to the relted concept of ttrbutes reducton n rough set theory Akts et l[5] studed the bsc concept of soft set theory, nd compred soft sets to fuzzy nd rough sets, provdng some exmples to clrfy ther dfferences The lgebrc structure of set theores delng wth uncertntes hs been studed by some uthors Akts et l [5] ppled the noton of set to the theory groups Jun [6] ntroduced the notons of soft BCK/BCI-lgebrs, nd then nvestgted ther bsc propertes [7] Öztürk et l [8] dscussed new vew of fuzzy Gmm rngs It s well known tht the concept of fuzzy sets, ntroduced by Zdeh [9], hs been extensvely ppled to mny scentfc felds In 97, osenfeld [0] ppled the concept to the theory of groupods nd groups In 982, Lu [] defned nd studed fuzzy subrngs s well s fuzzy dels Snce then mny ppers concernng vrous fuzzy lgebrc structures hve ppered n the lterture The vrous constructons of fuzzy quotents rngs nd fuzzy somorphsm hve been nvestgted respectvely by severl reserchers (see eg [2, 3, nd 4]) Also, M et l presented the defnton of fuzzy soft set, nd oy et l presented some pplctons of ths noton to the decson- mkng problems n [2] Inn et l hve lredy ntroduced the defnton of fuzzy soft rngs nd studed some of ther bsc propertes In ths pper, we ttempt to study fuzzy soft rng theory by usng fuzzy soft sets We frst ntroduce fuzzy soft rngs generted by fuzzy soft sets, nd gve ther propertes Consequently we study the defnton of fuzzy soft del nd derve some results from them, respectvely 2 Prelmnres In ths secton, for the ske of completeness, we frst cte some useful defntons nd results Defnton 2 [9] A fuzzy subset n set X s : X 0, functon Defnton 22 [] Let U be n ntl unverse E set of prmeters nd A E Let PU denote the fuzzy power set of U A pr F, A s clled fuzzy soft set over U, where F s mppng F: A P U gven by *Correspondng uthor eceved: 3 Februry 202 / Accepted: 0 Mrch 202
2 IJST (202) A4: F, A nd GB, be two fuzzy soft sets over U Then F, A s sd to be fuzzy soft subset of GB, f A B Fx s fuzzy subset of x A Defnton 23 [] Let Gx for ll We denote the bove ncluson reltonshp by F, A G, B Smlrly,, fuzzy soft superset of GB, f, soft subset of, be denoted by F, A G, B F A s clled GB s fuzzy F A The bove reltonshp cn Defnton 24 [5] The ntersecton of two fuzzy soft sets F, A nd GB, over U s the soft set H, C, where C A B nd for ll x C, ether H x F x or H x G x Ths ntersecton s denoted by ( F, A) ( G, B) ( H, C) Defnton 25 [5] The unon of two fuzzy soft sets, GB, over U s the soft set F A nd H, C, where C A B nd for ll x C, defne by: F( x) f x A -B H ( x) G( x) f x B -A F( x) G( x) Otherwse The bove reltonshp s denoted by F, AG, BH, C Defnton 26 [5] Let F, A nd GB, be two fuzzy soft sets Then we denote F, A AND G, B by F, A G, B The soft set F, A G, B s defned by ( H, A B), where H(, ) F( ) G( ), for ll (, ) A B Defnton 27 [5] Let F, A nd GB, be two fuzzy soft sets Then F, A O G, B denoted by F, A G, B s defned by ( H, A B), where H(, ) F( ) G( ), for ll (, ) A B Now, we show the defnton nd del of rng nd of rng Defnton 28 [5] Let S nd be two ddtve beln groups S s clled rng f there exst mppng SS S by,, b b stsfyng the followng condtons: ( b) cc bc, 2 ( b c) b c, 3 ( ) bb b, 4 ( bc) ( b) c for ll bc,, S nd for ll, A left (resp rght) del of rng S s subset A of S whch s n ddtve subgroup of S nd SA A (resp, SA A) where, SAxy x, ys, If A s both left nd rght del, then A s clled gmm del of S Defnton 28 [6] Let S nd K be two rngs, nd f be mppng of S nto K Then f s clled homomorphsm f f b f f b f b nd for ll b, S nd f f b Defnton 28 [5] A fuzzy set n rng S s clled fuzzy del of S, f for ll x y S, the followng requrements re stsfed: x y mn x, y 2 xy mx x, y 3 Fuzzy soft rng nd In wht follows let A be rng nd nonempty set nd wll refer to n rbtrry ternry relton mong one element of A, n element of nd n element of A, tht s, s subset of A A, unless otherwse specfed A set vlued functon f : N P A cn be defned f { baû b ; } s for ll
3 47 IJST (202) A4: -2 N The pr f, N s then soft set over A Defnton 3 Let f, N be soft set over rng A Then f, N s clled soft rng over A ff f s sub rng of A, for ll N A Defnton 32 Let,, be rng nd E be prmeter set nd A E Let f be mppng gven by f : AA 0,, where 0, denotes the collecton of ll fuzzy subsets of, f : AA 0,,, b f( b) f b f f : 0, { b} b s clled fuzzy soft rng over f nd only f for ech b, And the correspondng fuzzy subset f of f s fuzzy soft subrng of, e x, y f( x f( x) f( f( x) f( x) f ( x f ( x) f ( Theorem 33 Let ( f, N ) be fuzzy soft set over, then ( f, N ) be fuzzy soft rng over ff for ech N nd x, y the followng condtons hold f( x f( x) f( f ( x f ( x) f ( Proof: Frst we suppose tht ( f, N ) be fuzzy soft rng over Then for ech N nd x, y f( x f( x( ) f( x) f( f ( x) f ( conversely, suppose tht the gven condtons hold Then for ech N, x, y f(0) f( x x) f( x) f( x) f ( x) where 0 s the ddtve dentty of f( x) f(0 x) f(0) f( x) f( x) f( x) f ( x) Now, f( x f( x( ) f( x) f( f( x) f( f ( x f ( x) f ( so ths completes proof Exmple 34 Z 6 0,, 2, 3, 4, 5 defne x y x y for ll x, y, Then s rng nd let N A A f : N P( ) be set vlued functon defned 0,08,,02, 2,0,4, by f 3,02,4,0,4,5,02 0,0,9,,05, 2,05, f b 3,0,, 4,05, 5,05 nd 0,0,7,,03, 2,03, f c 3,0,3, 4,03, 5,03 Obvously ( f, N ) s fuzzy soft set over Also, we see tht f s fuzzy del of for ll N, thus ( f, N ) s fuzzy soft rng over Defnton 35 Let ( f, N ) nd ( g, M ) be two fuzzy soft rngs over "( f, N) AND( g, M )", denoted by ( f, N) ( g, M), s defned by ( f, N) ( g, M) ( h, S) where S N M, hs fs gs for ll s S
4 IJST (202) A4: Theorem 36 If ( f, N ) nd ( gm, ) be two fuzzy soft rngs over, then ( f, N) ( g, M) s fuzzy soft rng over where Proof: ( f, N) ( g, M) ( h, S) S N M, for ll ss, hs fs gs x, y nd, hs( x fs( x gs( x ( fs( x) fs( ) ( gs( x) gs( ) ( fs( x) gs( x)) ( fs( gs( ) ( fs gs)( x) ( fs gs)( hs( x) hs( hs( x hs( x) hs( hs( x fs( x gs( x fs( x) fs( ) ( gs( x) gs( ) ( fs( x) gs( x)) ( fs( gs( ) ( fs gs)( x) ( fs gs)( hs( x) hs( h ( x h ( x) h ( s s s Thus h s s fuzzy soft sub rng of for ll ss N M nd so ( f, N) ( g, M) s fuzzy soft rng over Defnton 37 Let ( f, N) nd ( g, M ) be two fuzzy soft rngs over "( f, NOgM ) (, )", denoted by ( f, N) ( g, M), s defned by ( f, N) ( g, M) ( h, S) where S N M, hs fs gs for ll s S Theorem 38 If ( f, N ) nd ( gm, ) be two fuzzy soft rngs over, Then ( f, N) ( g, M) s fuzzy soft rng over Proof: It cn be smlr proof of Theorem 36 nd for ll S, ether f h or g h Ths ntersecton s denoted by ( f, N) ( g, M) ( h, S) Theorem 30 Let ( f, N ) nd ( gm, ) be two fuzzy soft rngs over Then ( f, N) ( g, M) s fuzzy soft rng over Proof: Let ( f, N) ( g, M) ( h, S), where S N M, S, then xy,, h( x f( x g( x f( x) f( g( x) g( ( f( x) g( x)) ( f( g( ) ( f g)( x) ( f g)( h( x) h( where f, g, h re the fuzzy soft subsets of correspondng to the prmeter S h( x f( x g( x f( x) f( g( x) g( ( f( x) g( x)) ( f( g( ) ( f g)( x) ( f g)( h ( x) h ( ths completes the proof Defnton 3 The unon of two fuzzy soft rngs ( f, N ) nd ( g, M ) over be denoted by ( f, N) ( g, M), we defne ( f, N) ( g, M) ( h, C), where C N M nd c C fc, f c N - M hc gc, f c M - N f g, f cn M for ll, c c x y nd Theorem 32 Let ( f, N ) nd ( gm, ) be two fuzzy soft rngs over Then ( f, N) ( g, M) s fuzzy soft rng over, f N M Defnton 39 The ntersecton of two fuzzy soft rngs ( f, N ) nd ( gm, ) over s the fuzzy soft rng ( hs, ), where S N M,
5 473 IJST (202) A4: -2 Proof: We know tht ( f, N) ( g, M) ( h, C), where C N M nd cc fc, f c N - M hc gc, f c M - N f g, f cn M c c for ll x, y nd For cn M, hc( x fc( x fc( x) fc( Snce cn M, we sy tht hc( x) fc( x) nd hc( fc( hc( x hc( x) hc( hc( x fc( x fc( x) fc( hc( x) hc( hc( x hc( x) hc( for cm N hc( x gc( x gc( x) gc( hc( x) hc( hc( x hc( x) hc( hc( x gc( x gc( x) gc( hc( x) hc( h ( x h ( x) h ( c c c Defnton 33 Let ( f, N) nd ( g, M ) be two fuzzy soft rngs over The fuzzy soft rng ( g, M ) s clled fuzzy soft sub rng of ( f, N ), f t stsfes: M N g s sub rng of f, for ll M Defnton 34 Let ( f, N) I be fuzzy soft rngs over Then the ntersecton of these fuzzy soft rngs s defned s beng the fuzzy soft rng ( g, M ) stsfyng the followng condtons: M A I 2 For ll M, there exst n 0 I such tht g f ( ) In ths cse, we wrte 0 ( f, N ) ( g, M) I Defnton 35 Let ( f, N) ı be fuzzy soft rngs over Then, ( gm, ) ( f, N) s fuzzy soft rng such tht I M N nd g f, I I I M for ll ( ) 2 ( gm, ) ( f, N) s fuzzy soft rng such tht I M N nd g f, I I I M ll ( ) for Theorem 36 Let ( f, N ) be fuzzy soft rng over If ( f, N) I s nonempty fmly of fuzzy soft sub rng of ( f, N ), where I s n ndex set, then, s fuzzy soft sub rng of ( f, N ) I ( f, N ) 2 ( f, N ) I s fuzzy soft sub rng of ( f, N ) 3 ( f, N ) I s fuzzy soft sub rng of ( f, N ), where N N for ll, I Proof: Usng Defnton 34 nd snce ( f, N ) s fuzzy soft sub rng of ( f, N ) for ll I, we hve g : M P( ) by g f, for ll M N N nd I In ths cse,, I f s sub rng of for ll M nd I, so f, s sub rng of Thus I ( g, M ) s fuzzy soft rng over Hence ( gm, ) ( f, N) s fuzzy soft sub rng I of ( f, N ) by Defnton 34 The proofs of 2 nd 3 cn be wrtten smlrly
6 IJST (202) A4: Defnton 37 Let ( f, N ) be fuzzy soft rng over Then ( f, N ) be fuzzy soft del over ff for ech N nd xy,, the followng condtons hold: f ( x f ( x) f ( f( x f( x) f( defned by ( f, N) Theorem 38 For ny fuzzy soft dels ( f, N) nd ( g, M ) over, where N M, we hve ( f, N) ( g, M) Proof: Usng Defnton 39 we cn wrte ( f, N) ( g, M) ( h, S), where S N M nd for ll ss NM, hs fs gs x, y, hs( x fs( x gs( x ( fs( x) fs( ) ( gs( x) gs( ) ( fs( x) gs( x)) ( fs( gs( ) snce ( f, N) nd ( gm, ), we know tht ll f s nd g s re fuzzy soft del of for s S Therefore, hs( x hs( x) hs( And, hs( x fs( x gs( x ( fs( x) fs( ) ( gs( x) gs( ) ( fs( x) ( gs( x)) ( fs( gs( ) fs gs( x) fs gs( hs( x) hs( Hence ( hs, ) s fuzzy soft del nd therefore ( f, N) ( g, M) ( h, S) Theorem 39 For ny fuzzy soft dels ( f, I ) nd ( gj, ) over, n whch I nd J re dsont, we hve ( f, I) ( g, J) nd Proof: Assume tht ( f, I) ( gj, ) ( f, I) ( g, J) ( h, K) where K I J By mens of defnton we cn wrte nd for every K f, f c I - J h() c g, f cj - I f g, f ci J snce I J s ether ci J or c J I for ll c K If ci J, then h f s the del of snce ( f, I) If c J I, then h g s the del of snce ( gj, ) Thus h s the del of for ll c K, nd so ( f, I) ( g, J) ( h, K) Theorem 320 Let ( f, N ) be fuzzy soft del over If ( f, I ) J s nonempty fmly of fuzzy soft dels of ( f, N ), where J s n ndex set, then, ( f, I ) J 2 ( f, I ) J 3 ( f, I ) J where I I 0 ll, k J k for Defnton 32 Let ( f, N) nd ( g, M ) be two fuzzy soft rngs over A nd B, respectvely Let F : A B nd G: N M be two functons Then the pr ( FG, ) s clled fuzzy soft rng homomorphsm f t stsfes the followng condtons: F s n onto rng homomorphsm G s n onto rng homomorphsm F( f) ( g) G for ll N If there exst fuzzy soft rng homomorphsm between ( f, N) nd ( gm, ), we sy tht ( f, N ) s fuzzy soft homomorphc to ( gm, ), nd s denoted by ( f, N)~ ( g, M) Moreover, F s n somorphsm nd ( f, N ) s fuzzy soft homomorphc to ( g, M ), whch s denoted by ( f, N) ( g, M) Now, we show tht the homomorphc mge nd premge of fuzzy soft rng re lso fuzzy soft rng
7 475 IJST (202) A4: -2 Defnton 322 Let : X Y nd : N M be two functons, where N nd M re prmeter sets for fuzzy soft sets X nd Y, respectvely Then the pr (, ) s clled fuzzy soft functon from X to Y Defnton 323 Let ( f, N) nd ( g, M ) be two fuzzy soft rngs over X nd Y Let (, ) be fuzzy soft functon from X to Y The mge of ( f, N ) under the fuzzy soft functon (, ) denoted by (, )( f, N) s the fuzzy soft rng over Y defned by (, )( f, N) ( ( f), ( N)) where, - f( x), f x ( ( x) y( ) k ( f) k ( 0, otherwse k( N), y Y 2 The premge of ( g, M ) under the fuzzy soft functon (, ) (, ) ( gm, ) denoted by s the fuzzy soft rng over X defned by (, ) ( gm, ) ( ( g), ( M)) where, x X ( g) ( x) g ( ) ( ( x)) ( M) If nd re nectve (surectve), then (, ) s sd to be nectve (surectve) Defnton 324 Let (, ) be fuzzy soft functon from X to Y If s homomorphsm functon from X to Y, then (, ) s sd to be fuzzy soft homomorphsm If s somorphsm functon from X to Y nd s one to one mppng from N onto M, then (, ) s sd to be fuzzy soft somorphsm Theorem 325 Let ( f, N ) be fuzzy soft rng over nd (, ) be fuzzy soft homomorphsm from to S Then (, )( f, N) s fuzzy soft rng over S Proof: Let k ( N) ( y ) or ( y ) nd y, y2 2 Y If the proof s cler ( x ) y, ( x2) y2 Let us ssume tht ( f) ( y y ) f ( k) k 2 ( xx2) yy2 ( ) k f ( x x ) ( ) k ( ) k 2 ( f ( x ) f ( x )) 2 f ( x ) f ( x ) 2 ( ) k ( ) k ths nequlty s stsfed for ech x, x 2 X, where ( x) y, s stsfed ( x2) y2 Then we hve: ( f) ( y y ) k 2 f( x) f( x2) ( x ) y ( ) k ( x ) y ( ) k 2 2 ( f) ( y ) ( f) ( y ) k k 2 nd smlrly we hve ( f ) ( yy ) ( f) ( y ) ( f) ( y ) k 2 k k 2 Theorem 326 Let ( g, M ) be fuzzy soft rng over S nd (, ) be fuzzy soft homomorphsm from to S Then (, ) ( gm, ) s fuzzy soft rng over Proof: Let ( B) nd x, x2 X, ( g) ( xx2 ) g ( ) ( ( xx2)) g ( ) ( ( x) ( x2)) g ( ( x ) g ( ( x ) ( ) ( ) 2 g x g x2 ( ) ( ) ( ) ( ) nd smlrly we hve ( g) ( x x ) ( g) ( x ) ( g) ( x ) 4 Concluson 2 2 In ths work the theoretcl pont of vew of fuzzy sets n rng nd del re dscussed The work s focused on fuzzy soft rngs nd fuzzy soft dels These concepts re bsc structures for mprovement of soft set theory One cn extend ths work by studyng other lgebrc structures eferences [] Molodtsov, D (999) Soft set theory-frst results Comput Mth Appl, 37, 9-37
8 IJST (202) A4: [2] M, P K, oy, A & Bsws, (2002) An pplcton of soft sets n decson mkng problem Comput Mth Appl, 44, [3] M, P K & oy, A (2003) Bsws, Soft set theory Comput Mth Appl, 45, [4] Chen, D, Tsng, E C C, Yeung, D S & Wng, X (2005) The prmeterzton reducton of soft sets nd ts pplctons Comput Mth Appl, 49, [5] Akts, H, Cğmn, N (2007) Soft sets nd soft groups Inform Sc, 77, [6] Jun, Y B (2008) Soft BCK/BCI-lgebrs Comput Mth Appl, 56, [7] Jun, Y B & Prk, C H (2008) Applctons of soft sets n del theory of BCK/BCI-lgebrs Inform Sc, 78, [8] Öztürk, M A, Jun, Y B & Yzrlı, H (200) A new vew of fuzzy Γ-rngs Hcettepe J Mth Sttstcs, 39, [9] Zdeh, L A (965) Fuzzy sets Inform Control, 8, [0] osenfeld, A (97) Fuzzy groups J Mth Anl Appl 35, [] Lu, W (982) Fuzzy nvrnt subgroups nd fuzzy dels Fuzzy Sets Syst, 8, [2] Fng, J X (994) Fuzzy Homomorphsm nd fuzzy somorphsm Fuzzy Sets Syst, 63, [3] Lu, Y, Lu, S (2004) Fuzzy somorphsm theorems of groups Fr Est J Appl Mth, 6, [4] Lu, Y L, Meng, J & Xn, X L (200) Quotent rngs nduced v fuzzy dels Koren J Comput Appl Mth, 8, [5] Dutt, T K & Chnd, T (2005) Structures of fuzzy dels of Γ-rng, Bull Mlys Mth Sc Soc, 28, 9-8 [6] Dutt, T K & Chnd, T (2007) Fuzzy prme dels n Γ-rngs, Bull Mlys Mth Sc Soc, 30, 65-73
World Journal of Engineering Research and Technology WJERT
wjert 207 Vol. 3 Issue 5 284-293. Orgnl Artcle IN 2454-695X World Journl of ngneerng Reserch nd Technology hndrmouleeswrn et l. World Journl of ngneerng Reserch nd Technology WJRT www.wjert.org JIF Impct
More information: X 0,1 and the compliment of, denoted by
RPN Journal of Systems Software 2009-2012 JSS Journal. ll rghts reserved Characterzng -Semgroups by Intutonstc Fuzzy Ponts Muhammad kram Department of Informaton Technology, Hgher College of Technology,
More informationA NOTE ON FUZZY CLOSURE OF A FUZZY SET
(JPMNT) Journal of Process Management New Technologes, Internatonal A NOTE ON FUZZY CLOSURE OF A FUZZY SET Bhmraj Basumatary Department of Mathematcal Scences, Bodoland Unversty, Kokrajhar, Assam, Inda,
More informationb * -Open Sets in Bispaces
Internatonal Journal of Mathematcs and Statstcs Inventon (IJMSI) E-ISSN: 2321 4767 P-ISSN: 2321-4759 wwwjmsorg Volume 4 Issue 6 August 2016 PP- 39-43 b * -Open Sets n Bspaces Amar Kumar Banerjee 1 and
More informationSemi - - Connectedness in Bitopological Spaces
Journal of AL-Qadsyah for computer scence an mathematcs A specal Issue Researches of the fourth Internatonal scentfc Conference/Second صفحة 45-53 Sem - - Connectedness n Btopologcal Spaces By Qays Hatem
More informationRegionalization Method for Nonlinear Differential Equation Systems In a Cartesian Plan
Journl of Mthemtcs nd Sttstcs 4: 464-468 6 ISSN 549-3644 6 Scence Pulctons Regonlzton Method for Nonlner Dfferentl Euton Systems In Crtesn Pln Bel Lekhmss Deprtment of Mthemtcs Fculty of Scences Unversty
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationALEKSANDROV URYSOHN COMPACTNESS CRITERION ON INTUITIONISTIC FUZZY S * STRUCTURE SPACE
mercan Journal of Mathematcs and cences Vol. 5, No., (January-December, 206) Copyrght Mnd Reader Publcatons IN No: 2250-302 www.journalshub.com LEKNDROV URYOHN COMPCTNE CRITERION ON INTUITIONITIC FUZZY
More informationCOMPUTATIONAL INTELLIGENCE
COMPUTATIONAL INTELLIGENCE LABORATORY CLASSES Immentton smplstc verson of the network for some nference resons Adrn Horzyk IMPLEMENTATION OF THE SIMPLISTIC OR AANG Imment the smplstc verson of n structure
More informationMath Homotopy Theory Additional notes
Math 527 - Homotopy Theory Addtonal notes Martn Frankland February 4, 2013 The category Top s not Cartesan closed. problem. In these notes, we explan how to remedy that 1 Compactly generated spaces Ths
More informationPROPERTIES OF BIPOLAR FUZZY GRAPHS
Internatonal ournal of Mechancal Engneerng and Technology (IMET) Volume 9, Issue 1, December 018, pp. 57 56, rtcle ID: IMET_09_1_056 valable onlne at http://www.a aeme.com/jmet/ssues.asp?typeimet&vtype
More informationBridges and cut-vertices of Intuitionistic Fuzzy Graph Structure
Internatonal Journal of Engneerng, Scence and Mathematcs (UGC Approved) Journal Homepage: http://www.jesm.co.n, Emal: jesmj@gmal.com Double-Blnd Peer Revewed Refereed Open Access Internatonal Journal -
More informationCOMPUTATIONAL INTELLIGENCE
COMPUTATIONAL INTELLIGENCE LABORATORY CLASSES Immentton smplstc verson of the or AANG network for some nference resons Adrn Horzyk IMPLEMENTATION OF THE SIMPLISTIC OR AANG Imment the smplstc verson of
More informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
More information1.4 Circuit Theorems
. Crcut Theorems. v,? (C)V, 5 6 (D) V, 6 5. A smple equvlent crcut of the termnl 6 v, network shown n fg. P.. s Fg. P... (A)V, (B)V, v (C)V,5 (D)V,5 Fg. P....,? 5 V, v (A) (B) Fg. P... (A)A, 0 (B) 0 A,
More informationCHAPTER 2 DECOMPOSITION OF GRAPHS
CHAPTER DECOMPOSITION OF GRAPHS. INTRODUCTION A graph H s called a Supersubdvson of a graph G f H s obtaned from G by replacng every edge uv of G by a bpartte graph,m (m may vary for each edge by dentfyng
More informationCompilers. Chapter 4: Syntactic Analyser. 3 er course Spring Term. Precedence grammars. Precedence grammars
Complers Chpter 4: yntt Anlyser er ourse prng erm Prt 4g: mple Preedene Grmmrs Alfonso Orteg: lfonso.orteg@um.es nrque Alfonse: enrque.lfonse@um.es Introduton A preedene grmmr ses the nlyss n the preedene
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationBASIC DIFFERENTIABLE MANIFOLDS AND APPLICATIONS MAPS WITH TRANSLATORS TANGENT AND COTANGENT SPACES
IJMMS, Vol., No. -2, (January-December 205): 25-36 Serals Publcatons ISSN: 0973-3329 BASIC DIFFERENTIABLE MANIFOLDS AND APPLICATIONS MAPS WITH TRANSLATORS TANGENT AND COTANGENT SPACES Mohamed M. Osman*
More informationSome kinds of fuzzy connected and fuzzy continuous functions
Journal of Babylon Unversty/Pure and Appled Scences/ No(9)/ Vol(): 4 Some knds of fuzzy connected and fuzzy contnuous functons Hanan Al Hussen Deptof Math College of Educaton for Grls Kufa Unversty Hananahussen@uokafaq
More informationArrays as functions. Types. Multidimensional Arrays (row major, column major form) Java arrays
Louden Chpters 6,9 Types Dt Types nd Abstrct Dt Types 1 Arrys s functons f: U -> V (f U s ordnl type) f() rry C rrys types cn be wthout szes rry vrbles must hve fxed sze rry_mx( [], sze) // prmeters re
More informationConsumer 2 (wants to go down first, then left)
ECO 70, Problem Set en Cbrer. Suose two consumers hve lecogrhc references where erson rnks bundles b the level of commodt nd onl consders the level of commodt two f bundles hve the sme mount of commodt.
More informationLecture 5: Probability Distributions. Random Variables
Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent
More informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationCordial and 3-Equitable Labeling for Some Star Related Graphs
Internatonal Mathematcal Forum, 4, 009, no. 31, 1543-1553 Cordal and 3-Equtable Labelng for Some Star Related Graphs S. K. Vadya Department of Mathematcs, Saurashtra Unversty Rajkot - 360005, Gujarat,
More informationConvex Fuzzy Set, Balanced Fuzzy Set, and Absolute Convex Fuzzy Set in a Fuzzy Vector Space
IOSR Journal of Mathematcs (IOSR-JM) e-issn: 2278-5728, p-issn: 239-765X. Volume 2, Issue 2 Ver. VI (Mar. - pr. 206), PP 7-24 www.osrjournals.org Conve Fuzzy Set, alanced Fuzzy Set, and bsolute Conve Fuzzy
More informationInternational Journal of Mathematical Archive-3(11), 2012, Available online through ISSN
Internatonal Journal of Mathematcal rchve-(), 0, 477-474 valable onlne through www.jma.nfo ISSN 9 5046 FUZZY CRITICL PTH METHOD (FCPM) BSED ON SNGUNST ND CHEN RNKING METHOD ND CENTROID METHOD Dr. S. Narayanamoorthy*
More informationCURVE FITTING AND DATA REGRESSION
Numercl Methods Process Sstems Engneerng CURVE FIING AND DAA REGRESSION Numercl methods n chemcl engneerng Dr. Edwn Zondervn Numercl Methods Process Sstems Engneerng Dngerous curves!!! hs s not ectl wht
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationA Note on Quasi-coincidence for Fuzzy Points of Fuzzy Topology on the Basis of Reference Function
I.J. Mathematcal Scences and Computng, 2016, 3, 49-57 Publshed Onlne July 2016 n MECS (http://www.mecs-press.net) DOI: 10.5815/jmsc.2016.03.05 Avalable onlne at http://www.mecs-press.net/jmsc A Note on
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationCS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig
CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of
More informationMesh and Node Equations: Circuits Containing Dependent Sources
Mesh nd Node Equtons: Crcuts Contnng Dependent Sources Introducton The crcuts n ths set of problems re smll crcuts tht contn sngle dependent source. These crcuts cn be nlyzed usng mesh equton or usng node
More informationInternational Journal of Scientific & Engineering Research, Volume 7, Issue 5, May ISSN Some Polygonal Sum Labeling of Bistar
Internatonal Journal of Scentfc & Engneerng Research Volume 7 Issue 5 May-6 34 Some Polygonal Sum Labelng of Bstar DrKAmuthavall SDneshkumar ABSTRACT- A (p q) graph G s sad to admt a polygonal sum labelng
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationLily Yen and Mogens Hansen
SKOLID / SKOLID No. 8 Lily Yen nd Mogens Hnsen Skolid hs joined Mthemticl Myhem which is eing reformtted s stnd-lone mthemtics journl for high school students. Solutions to prolems tht ppered in the lst
More informationResearch Announcement: MAXIMAL CONNECTED HAUSDORFF TOPOLOGIES
Volume 2, 1977 Pges 349 353 http://topology.uburn.edu/tp/ Reserch Announcement: MAXIMAL CONNECTED HAUSDORFF TOPOLOGIES by J. A. Guthrie, H. E. Stone, nd M. L. Wge Topology Proceedings Web: http://topology.uburn.edu/tp/
More informationUNIT 2 : INEQUALITIES AND CONVEX SETS
UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces
More informationA new paradigm of fuzzy control point in space curve
MATEMATIKA, 2016, Volume 32, Number 2, 153 159 c Penerbt UTM Press All rghts reserved A new paradgm of fuzzy control pont n space curve 1 Abd Fatah Wahab, 2 Mohd Sallehuddn Husan and 3 Mohammad Izat Emr
More informationON SOME GRÜSS TYPE INEQUALITY IN 2-INNER PRODUCT SPACES AND APPLICATIONS. S.S. Kim, S.S. Dragomir, A. White and Y.J. Cho. 1.
ON SOME GRÜSS TYPE INEQUALITY IN 2-INNER PRODUCT SPACES AND APPLICATIONS S.S. Kim, S.S. Drgomir, A. White nd Y.J. Cho Abstrct. In this pper, we shll give generliztion of the Grüss type inequlity nd obtin
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationMA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationPointwise convergence need not behave well with respect to standard properties such as continuity.
Chpter 3 Uniform Convergence Lecture 9 Sequences of functions re of gret importnce in mny res of pure nd pplied mthemtics, nd their properties cn often be studied in the context of metric spces, s in Exmples
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationthe nber of vertces n the graph. spannng tree T beng part of a par of maxmally dstant trees s called extremal. Extremal trees are useful n the mxed an
On Central Spannng Trees of a Graph S. Bezrukov Unverstat-GH Paderborn FB Mathematk/Informatk Furstenallee 11 D{33102 Paderborn F. Kaderal, W. Poguntke FernUnverstat Hagen LG Kommunkatonssysteme Bergscher
More informationAn Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane
An Approach n Colorng Sem-Regular Tlngs on the Hyperbolc Plane Ma Louse Antonette N De Las Peñas, mlp@mathscmathadmueduph Glenn R Lago, glago@yahoocom Math Department, Ateneo de Manla Unversty, Loyola
More informationA METHOD FOR RANKING OF FUZZY NUMBERS USING NEW WEIGHTED DISTANCE
Mathematcal and omputatonal pplcatons, Vol 6, No, pp 359-369, ssocaton for Scentfc Research METHOD FOR RNKING OF FUZZY NUMERS USING NEW WEIGHTED DISTNE T llahvranloo, S bbasbandy, R Sanefard Department
More informationA Fixed Point Approach of Quadratic Functional Equations
Int. Journl of Mth. Anlysis, Vol. 7, 03, no. 30, 47-477 HIKARI Ltd, www.m-hikri.com http://dx.doi.org/0.988/ijm.03.86 A Fixed Point Approch of Qudrtic Functionl Equtions Mudh Almhlebi Deprtment of Mthemtics,
More information1.5 Extrema and the Mean Value Theorem
.5 Extrem nd the Men Vlue Theorem.5. Mximum nd Minimum Vlues Definition.5. (Glol Mximum). Let f : D! R e function with domin D. Then f hs n glol mximum vlue t point c, iff(c) f(x) for ll x D. The vlue
More informationData Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach
Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer
More informationTries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries
Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationMATH 25 CLASS 5 NOTES, SEP
MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid
More informationF. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.
Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,
More informationMath 464 Fall 2012 Notes on Marginal and Conditional Densities October 18, 2012
Mth 464 Fll 2012 Notes on Mrginl nd Conditionl Densities klin@mth.rizon.edu October 18, 2012 Mrginl densities. Suppose you hve 3 continuous rndom vribles X, Y, nd Z, with joint density f(x,y,z. The mrginl
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationRecap: rigid motions. [L7] Robotics (ME671): Forward Kinematics. Recap: homogeneous transforms. Robot Kinematics Suril Shah IIT Jodhpur
--6 Rep: rgd motons [L7] Robots (ME67): Forwrd Knemts Rgd moton s ombnton of rotton nd trnslton It n be represented usng homogeneous trnsform R d H Surl Shh IIT Jodhpur Inverse trnsforms: T T R R d H Rep:
More informationIntroduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2
Introducton to Geometrcal Optcs - a D ra tracng Ecel model for sphercal mrrors - Part b George ungu - Ths s a tutoral eplanng the creaton of an eact D ra tracng model for both sphercal concave and sphercal
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationA Transportation Problem Analysed by a New Ranking Method
(IJIRSE) Interntionl Journl of Innovtive Reserch in Science & Engineering ISSN (Online) 7-07 A Trnsporttion Problem Anlysed by New Rnking Method Dr. A. Shy Sudh P. Chinthiy Associte Professor PG Scholr
More informationMetric Characteristics. Matrix Representations of Graphs.
Graph Theory Metrc Characterstcs. Matrx Representatons of Graphs. Lecturer: PhD, Assocate Professor Zarpova Elvra Rnatovna, Department of Appled Probablty and Informatcs, RUDN Unversty ezarp@mal.ru Translated
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationSUPPORT VECTOR CLUSTERING FOR WEB USAGE MINING
1 SUPPOT VECTO CUSTEING FO WEB USAGE MINING WEI SHUNG CHUNG School of Computer Scence The Unversty of Oklhom Normn Oklhom E GUENWAD School of Computer Scence The Unversty of Oklhom Normn Oklhom THEODOE
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationOn Reduced Zagreb Indices of Polycyclic Aromatic Hydrocarbons and Benzenoid Systems
Annls of Pure nd Applied Mthemtics Vol. 8, No., 08, 73-78 ISSN: 79-087X (P), 79-0888(online) Published on 0 August 08 www.reserchmthsci.org DOI: http://dx.doi.org/0.457/pm.v8n0 Annls of On Reduced Zgreb
More informationRough Neutrosophic Multisets Relation with Application in Marketing Strategy
Neutrosophc Sets and Systems, Vol. 21, 2018 Unversty of New Mexco 36 Rough Neutrosophc Multsets Relaton wth Applcaton n Marketng Strategy Surana Alas 1, Daud Mohamad 2, and Adbah Shub 3 1 Faculty of Computer
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More informationComputers and Mathematics with Applications. Discrete schemes for Gaussian curvature and their convergence
Computers and Mathematcs wth Applcatons 57 (009) 87 95 Contents lsts avalable at ScenceDrect Computers and Mathematcs wth Applcatons journal homepage: www.elsever.com/locate/camwa Dscrete schemes for Gaussan
More information4452 Mathematical Modeling Lecture 4: Lagrange Multipliers
Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl
More informationOn Correctness of Nonserializable Executions
Journal of Computer and System Scences 56, 688 (1998) Artcle No. SS971536 On Correctness of Nonseralzable Executons Rajeev Rastog,* Sharad Mehrotra, - Yur Bretbart, [,1 Henry F. Korth,* and Av Slberschatz*
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationDistance based similarity measures of fuzzy sets
Johanyák, Z. C., Kovács S.: Dstance based smlarty measures of fuzzy sets, SAMI 2005, 3 rd Slovakan-Hungaran Jont Symposum on Appled Machne Intellgence, Herl'any, Slovaka, January 2-22 2005, ISBN 963 75
More informationIntroduction. Leslie Lamports Time, Clocks & the Ordering of Events in a Distributed System. Overview. Introduction Concepts: Time
Lesle Laports e, locks & the Orderng of Events n a Dstrbuted Syste Joseph Sprng Departent of oputer Scence Dstrbuted Systes and Securty Overvew Introducton he artal Orderng Logcal locks Orderng the Events
More informationFuzzy Critical Path with Various Measures
Interntonl Journl of themtcs Trens n Technology IJTT Volume 5 umer 5- Ferury 08 Fuzzy Crtcl Pth wth Vrous esures V.nusuy n P.lsownr. ssocte Professor PG n eserch Deprtment of themtcs Seethlkshm mswm college
More informationAvailable at ISSN: Vol. 4, Issue 2 (December 2009) pp (Previously Vol. 4, No.
Avilble t http://pvmu.edu.edu/pges/398.sp ISSN: 93-9466 Vol. 4, Issue December 009 pp. 434 444 Previously Vol. 4, No. Applictions nd Applied Mthemtics: An Interntionl Journl AAM On -ry Subdivision for
More informationHarmonic Coordinates for Character Articulation PIXAR
Harmonc Coordnates for Character Artculaton PIXAR Pushkar Josh Mark Meyer Tony DeRose Bran Green Tom Sanock We have a complex source mesh nsde of a smpler cage mesh We want vertex deformatons appled to
More informationCHAPTER 3 BACKGROUND AND RELATED WORK
CHAPTER 3 BACKGROUND AND RELATED WORK Ths chpter wll provde the ckground knowledge requred for the rest of ths thess. It wll strt wth the defnton of the nput sgnl functon nd termnology relted to the trngulton
More informationPolyhedral Compilation Foundations
Polyhedral Complaton Foundatons Lous-Noël Pouchet pouchet@cse.oho-state.edu Dept. of Computer Scence and Engneerng, the Oho State Unversty Feb 8, 200 888., Class # Introducton: Polyhedral Complaton Foundatons
More informationSpecifications in 2001
Specfcatons n 200 MISTY (updated : May 3, 2002) September 27, 200 Mtsubsh Electrc Corporaton Block Cpher Algorthm MISTY Ths document shows a complete descrpton of encrypton algorthm MISTY, whch are secret-key
More informationMENSURATION-IV
MENSURATION-IV Theory: A solid is figure bounded by one or more surfce. Hence solid hs length, bredth nd height. The plne surfces tht bind solid re clled its fces. The fundmentl difference between plne
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationSpecifying Database Updates Using A Subschema
Specfyng Database Updates Usng A Subschema Sona Rstć, Pavle Mogn 2, Ivan Luovć 3 Busness College, V. Perća 4, 2000 Nov Sad, Yugoslava sdrstc@uns.ns.ac.yu 2 Vctora Unversty of Wellngton, School of Mathematcal
More informationClustering on antimatroids and convex geometries
Clusterng on antmatrods and convex geometres YULIA KEMPNER 1, ILYA MUCNIK 2 1 Department of Computer cence olon Academc Insttute of Technology 52 Golomb tr., P.O. Box 305, olon 58102 IRAEL 2 Department
More informationA CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN. Department of Statistics, Islamia College, Peshawar, Pakistan 2
Pa. J. Statst. 5 Vol. 3(4), 353-36 A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN Sajjad Ahmad Khan, Hameed Al, Sadaf Manzoor and Alamgr Department of Statstcs, Islama College,
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More information1 The Definite Integral
The Definite Integrl Definition. Let f be function defined on the intervl [, b] where
More informationDynamic wetting property investigation of AFM tips in micro/nanoscale
Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen
More information