ÿþ<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:x="urn:schemas-microsoft-com:office:excel" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns:st="&#1;" xmlns="http://www.w3.org/TR/REC-html40" xmlns:ns0="http://macVmlSchemaUri" xmlns:ns1="urn:schemas-microsoft-com:office:smarttags"> <head> <meta http-equiv=Content-Type content="text/html; charset=unicode"> <meta name=ProgId content=Word.Document> <meta name=Generator content="Microsoft Word 14"> <meta name=Originator content="Microsoft Word 14"> <link rel=File-List href="default2_files/filelist.xml"> <title>Publications and Projects of George Kesidis</title> <!--[if gte mso 9]><xml> <o:DocumentProperties> <o:Author>Electrical Engineering</o:Author> <o:Template>Normal</o:Template> <o:LastAuthor>George</o:LastAuthor> <o:Revision>48</o:Revision> <o:TotalTime>769</o:TotalTime> <o:Created>2004-09-14T17:47:00Z</o:Created> <o:LastSaved>2012-01-25T00:23:00Z</o:LastSaved> <o:Pages>4</o:Pages> <o:Words>2295</o:Words> <o:Characters>13085</o:Characters> <o:Company>Penn State University</o:Company> <o:Lines>109</o:Lines> <o:Paragraphs>30</o:Paragraphs> <o:CharactersWithSpaces>15350</o:CharactersWithSpaces> <o:Version>14.00</o:Version> </o:DocumentProperties> <o:OfficeDocumentSettings> <o:AllowPNG/> </o:OfficeDocumentSettings> </xml><![endif]--> <link rel=themeData href="default2_files/themedata.thmx"> <link rel=colorSchemeMapping href="default2_files/colorschememapping.xml"> <!--[if gte mso 9]><xml> <w:WordDocument> <w:SpellingState>Clean</w:SpellingState> <w:GrammarState>Clean</w:GrammarState> <w:TrackMoves>false</w:TrackMoves> <w:TrackFormatting/> <w:ValidateAgainstSchemas/> <w:SaveIfXMLInvalid>false</w:SaveIfXMLInvalid> <w:IgnoreMixedContent>false</w:IgnoreMixedContent> <w:AlwaysShowPlaceholderText>false</w:AlwaysShowPlaceholderText> <w:DoNotPromoteQF/> <w:LidThemeOther>EN-US</w:LidThemeOther> <w:LidThemeAsian>X-NONE</w:LidThemeAsian> <w:LidThemeComplexScript>X-NONE</w:LidThemeComplexScript> <w:Compatibility> <w:BreakWrappedTables/> <w:SnapToGridInCell/> <w:WrapTextWithPunct/> <w:UseAsianBreakRules/> <w:DontGrowAutofit/> <w:SplitPgBreakAndParaMark/> <w:DontVertAlignCellWithSp/> <w:DontBreakConstrainedForcedTables/> <w:DontVertAlignInTxbx/> <w:Word11KerningPairs/> <w:CachedColBalance/> </w:Compatibility> <w:BrowserLevel>MicrosoftInternetExplorer4</w:BrowserLevel> <m:mathPr> <m:mathFont m:val="Cambria Math"/> <m:brkBin m:val="before"/> <m:brkBinSub m:val="&#45;-"/> <m:smallFrac m:val="off"/> <m:dispDef/> <m:lMargin m:val="0"/> <m:rMargin m:val="0"/> <m:defJc m:val="centerGroup"/> <m:wrapIndent m:val="1440"/> <m:intLim m:val="subSup"/> <m:naryLim m:val="undOvr"/> </m:mathPr> <u1:mathPr> <u1:mathFont u1:val="Cambria Math"/> <u1:brkBin u1:val="before"/> <u1:brkBinSub u1:val="--"/> <u1:smallFrac u1:val="off"/> <u1:dispDef/> <u1:lMargin u1:val="0"/> <u1:rMargin u1:val="0"/> <u1:defJc u1:val="centerGroup"/> <u1:wrapIndent u1:val="1440"/> <u1:intLim u1:val="subSup"/> <u1:naryLim u1:val="undOvr"/> </u1:mathPr> </w:WordDocument> </xml><![endif]--><!--[if gte mso 9]><xml> <w:LatentStyles DefLockedState="false" DefUnhideWhenUsed="false" DefSemiHidden="false" DefQFormat="false" LatentStyleCount="267"> <w:LsdException Locked="false" Priority="1" Name="Default Paragraph Font"/> <w:LsdException Locked="false" QFormat="true" Name="Emphasis"/> <w:LsdException Locked="false" Priority="99" Name="No List"/> <w:LsdException Locked="false" Priority="99" SemiHidden="true" Name="Placeholder Text"/> <w:LsdException Locked="false" Priority="1" QFormat="true" Name="No Spacing"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading"/> <w:LsdException Locked="false" Priority="61" Name="Light List"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3"/> <w:LsdException Locked="false" Priority="70" Name="Dark List"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading Accent 1"/> <w:LsdException Locked="false" Priority="61" Name="Light List Accent 1"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid Accent 1"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1 Accent 1"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2 Accent 1"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1 Accent 1"/> <w:LsdException Locked="false" Priority="99" SemiHidden="true" Name="Revision"/> <w:LsdException Locked="false" Priority="34" QFormat="true" Name="List Paragraph"/> <w:LsdException Locked="false" Priority="29" QFormat="true" Name="Quote"/> <w:LsdException Locked="false" Priority="30" QFormat="true" Name="Intense Quote"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2 Accent 1"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1 Accent 1"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2 Accent 1"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3 Accent 1"/> <w:LsdException Locked="false" Priority="70" Name="Dark List Accent 1"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading Accent 1"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List Accent 1"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid Accent 1"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading Accent 2"/> <w:LsdException Locked="false" Priority="61" Name="Light List Accent 2"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid Accent 2"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1 Accent 2"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2 Accent 2"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1 Accent 2"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2 Accent 2"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1 Accent 2"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2 Accent 2"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3 Accent 2"/> <w:LsdException Locked="false" Priority="70" Name="Dark List Accent 2"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading Accent 2"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List Accent 2"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid Accent 2"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading Accent 3"/> <w:LsdException Locked="false" Priority="61" Name="Light List Accent 3"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid Accent 3"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1 Accent 3"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2 Accent 3"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1 Accent 3"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2 Accent 3"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1 Accent 3"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2 Accent 3"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3 Accent 3"/> <w:LsdException Locked="false" Priority="70" Name="Dark List Accent 3"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading Accent 3"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List Accent 3"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid Accent 3"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading Accent 4"/> <w:LsdException Locked="false" Priority="61" Name="Light List Accent 4"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid Accent 4"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1 Accent 4"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2 Accent 4"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1 Accent 4"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2 Accent 4"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1 Accent 4"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2 Accent 4"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3 Accent 4"/> <w:LsdException Locked="false" Priority="70" Name="Dark List Accent 4"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading Accent 4"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List Accent 4"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid Accent 4"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading Accent 5"/> <w:LsdException Locked="false" Priority="61" Name="Light List Accent 5"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid Accent 5"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1 Accent 5"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2 Accent 5"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1 Accent 5"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2 Accent 5"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1 Accent 5"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2 Accent 5"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3 Accent 5"/> <w:LsdException Locked="false" Priority="70" Name="Dark List Accent 5"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading Accent 5"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List Accent 5"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid Accent 5"/> <w:LsdException Locked="false" Priority="60" Name="Light Shading Accent 6"/> <w:LsdException Locked="false" Priority="61" Name="Light List Accent 6"/> <w:LsdException Locked="false" Priority="62" Name="Light Grid Accent 6"/> <w:LsdException Locked="false" Priority="63" Name="Medium Shading 1 Accent 6"/> <w:LsdException Locked="false" Priority="64" Name="Medium Shading 2 Accent 6"/> <w:LsdException Locked="false" Priority="65" Name="Medium List 1 Accent 6"/> <w:LsdException Locked="false" Priority="66" Name="Medium List 2 Accent 6"/> <w:LsdException Locked="false" Priority="67" Name="Medium Grid 1 Accent 6"/> <w:LsdException Locked="false" Priority="68" Name="Medium Grid 2 Accent 6"/> <w:LsdException Locked="false" Priority="69" Name="Medium Grid 3 Accent 6"/> <w:LsdException Locked="false" Priority="70" Name="Dark List Accent 6"/> <w:LsdException Locked="false" Priority="71" Name="Colorful Shading Accent 6"/> <w:LsdException Locked="false" Priority="72" Name="Colorful List Accent 6"/> <w:LsdException Locked="false" Priority="73" Name="Colorful Grid Accent 6"/> <w:LsdException Locked="false" Priority="19" QFormat="true" Name="Subtle Emphasis"/> <w:LsdException Locked="false" Priority="21" QFormat="true" Name="Intense Emphasis"/> <w:LsdException Locked="false" Priority="31" QFormat="true" Name="Subtle Reference"/> <w:LsdException Locked="false" Priority="32" QFormat="true" Name="Intense Reference"/> <w:LsdException Locked="false" Priority="33" QFormat="true" Name="Book Title"/> <w:LsdException Locked="false" Priority="37" SemiHidden="true" UnhideWhenUsed="true" Name="Bibliography"/> <w:LsdException Locked="false" Priority="39" SemiHidden="true" UnhideWhenUsed="true" QFormat="true" Name="TOC Heading"/> </w:LatentStyles> </xml><![endif]--> <style> <!-- /* Font Definitions */ @font-face {font-family:Batang; panose-1:2 3 6 0 0 1 1 1 1 1; mso-font-alt:¼ÕÐ; mso-font-charset:129; mso-generic-font-family:roman; mso-font-pitch:variable; mso-font-signature:-1342176593 1775729915 48 0 524447 0;} @font-face {font-family:Batang; panose-1:2 3 6 0 0 1 1 1 1 1; mso-font-alt:¼ÕÐ; mso-font-charset:129; mso-generic-font-family:roman; mso-font-pitch:variable; mso-font-signature:-1342176593 1775729915 48 0 524447 0;} @font-face {font-family:Cambria; panose-1:2 4 5 3 5 4 6 3 2 4; mso-font-charset:0; mso-generic-font-family:roman; mso-font-pitch:variable; mso-font-signature:-536870145 1073743103 0 0 415 0;} @font-face {font-family:"\@Batang"; panose-1:2 3 6 0 0 1 1 1 1 1; mso-font-charset:129; mso-generic-font-family:roman; mso-font-pitch:variable; mso-font-signature:-1342176593 1775729915 48 0 524447 0;} /* Style Definitions */ p.MsoNormal, li.MsoNormal, div.MsoNormal {mso-style-unhide:no; mso-style-qformat:yes; mso-style-parent:""; margin:0in; margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman","serif"; mso-fareast-font-family:"Times New Roman"; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} h1 {mso-style-unhide:no; mso-style-qformat:yes; mso-style-link:"Heading 1 Char"; mso-style-next:Normal; margin:0in; margin-bottom:.0001pt; text-align:center; mso-pagination:widow-orphan; page-break-after:avoid; mso-outline-level:1; font-size:16.0pt; mso-bidi-font-size:12.0pt; font-family:"Times New Roman","serif"; mso-fareast-font-family:Batang; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi; mso-font-kerning:0pt; font-weight:bold;} a:link, span.MsoHyperlink {mso-style-unhide:no; color:blue; text-decoration:underline; text-underline:single;} a:visited, span.MsoHyperlinkFollowed {mso-style-unhide:no; color:blue; text-decoration:underline; text-underline:single;} p {mso-style-unhide:no; mso-margin-top-alt:auto; margin-right:0in; mso-margin-bottom-alt:auto; margin-left:0in; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman","serif"; mso-fareast-font-family:"Times New Roman";} p.MsoListParagraph, li.MsoListParagraph, div.MsoListParagraph {mso-style-priority:34; mso-style-unhide:no; mso-style-qformat:yes; margin-top:0in; margin-right:0in; margin-bottom:0in; margin-left:.5in; margin-bottom:.0001pt; mso-add-space:auto; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman","serif"; mso-fareast-font-family:"Times New Roman"; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} p.MsoListParagraphCxSpFirst, li.MsoListParagraphCxSpFirst, div.MsoListParagraphCxSpFirst {mso-style-priority:34; mso-style-unhide:no; mso-style-qformat:yes; mso-style-type:export-only; margin-top:0in; margin-right:0in; margin-bottom:0in; margin-left:.5in; margin-bottom:.0001pt; mso-add-space:auto; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman","serif"; mso-fareast-font-family:"Times New Roman"; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} p.MsoListParagraphCxSpMiddle, li.MsoListParagraphCxSpMiddle, div.MsoListParagraphCxSpMiddle {mso-style-priority:34; mso-style-unhide:no; mso-style-qformat:yes; mso-style-type:export-only; margin-top:0in; margin-right:0in; margin-bottom:0in; margin-left:.5in; margin-bottom:.0001pt; mso-add-space:auto; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman","serif"; mso-fareast-font-family:"Times New Roman"; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} p.MsoListParagraphCxSpLast, li.MsoListParagraphCxSpLast, div.MsoListParagraphCxSpLast {mso-style-priority:34; mso-style-unhide:no; mso-style-qformat:yes; mso-style-type:export-only; margin-top:0in; margin-right:0in; margin-bottom:0in; margin-left:.5in; margin-bottom:.0001pt; mso-add-space:auto; mso-pagination:widow-orphan; font-size:12.0pt; font-family:"Times New Roman","serif"; mso-fareast-font-family:"Times New Roman"; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} span.Heading1Char {mso-style-name:"Heading 1 Char"; mso-style-unhide:no; mso-style-locked:yes; mso-style-link:"Heading 1"; mso-ansi-font-size:14.0pt; mso-bidi-font-size:14.0pt; font-family:"Cambria","serif"; mso-ascii-font-family:Cambria; mso-fareast-font-family:"Times New Roman"; mso-hansi-font-family:Cambria; mso-bidi-font-family:"Times New Roman"; color:#365F91; font-weight:bold;} span.spelle {mso-style-name:spelle; mso-style-unhide:no;} span.grame {mso-style-name:grame; mso-style-unhide:no;} span.SpellE {mso-style-name:""; mso-spl-e:yes;} span.GramE {mso-style-name:""; mso-gram-e:yes;} .MsoChpDefault {mso-style-type:export-only; mso-default-props:yes; font-size:10.0pt; mso-ansi-font-size:10.0pt; mso-bidi-font-size:10.0pt;} @page WordSection1 {size:8.5in 11.0in; margin:1.0in 1.25in 1.0in 1.25in; mso-header-margin:.5in; mso-footer-margin:.5in; mso-paper-source:0;} div.WordSection1 {page:WordSection1;} --> </style> <!--[if gte mso 10]> <style> /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-parent:""; mso-padding-alt:0in 5.4pt 0in 5.4pt; mso-para-margin:0in; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:10.0pt; font-family:"Times New Roman","serif";} </style> <![endif]--> <meta name=Title content="Publications and Projects of George Kesidis"> <meta name=Keywords content=""> <!--[if gte mso 9]><xml> <o:shapedefaults v:ext="edit" spidmax="1026"/> </xml><![endif]--><!--[if gte mso 9]><xml> <o:shapelayout v:ext="edit"> <o:idmap v:ext="edit" data="1"/> </o:shapelayout></xml><![endif]--> </head> <body bgcolor=white lang=EN-ZW link=blue vlink=blue style='tab-interval:.5in'> <div class=WordSection1> <h1 style='mso-line-height-alt:1.0pt'>Selected Publications of George <span class=SpellE>Kesidis</span> <o:p></o:p></h1> <u1:p></u1:p> <h1 style='mso-line-height-alt:1.0pt'><span class=SpellE>Prof.</span> of EE and CSE<o:p></o:p></h1> <u1:p></u1:p> <h1 style='mso-line-height-alt:1.0pt'><ns0:place><ns0:placename>Pennsylvania</ns0:placename> <ns0:placetype>State</ns0:placetype></ns0:place> <ns0:placetype>University</ns0:placetype> <u1:p></u1:p><o:p></o:p></h1> <h1 style='mso-line-height-alt:1.0pt'><span class=SpellE><span class=GramE><span class=spelle>kesidis</span></span></span> at <span class=SpellE><span class=spelle>engr</span></span> dot <span class=SpellE><span class=spelle>psu</span></span> dot <span class=SpellE><span class=spelle>edu<u1:p></u1:p></span></span><o:p></o:p></h1> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>Books:</span></b><o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>G. <span class=SpellE>Kesidis</span>. <span class=GramE><span class=grame><i style='mso-bidi-font-style:normal'>An Introduction to Models of Online Peer-to-Peer Social Networking</i>.</span></span> <span class=GramE><span class=grame>Morgan &amp; Claypool Publ., San Francisco, 2010.<u1:p></u1:p></span></span></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>G. <span class=SpellE>Kesidis</span>. <i style='mso-bidi-font-style:normal'><u><a href="http://www.cse.psu.edu/%7Ekesidis/book/icna.htm"><span class=GramE><span class=grame>Introduction to Analysis of Communication Networks.</span></span> <span class=GramE><span class=grame><span style='font-style:normal'>Wiley-</span></span><span class=SpellE><span class=spelle><span style='color:windowtext;font-style:normal; text-decoration:none;text-underline:none'>Interscience</span></span></span><span class=grame>, 2007.</span></span></a></u></i></span><o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>G. <span class=SpellE>Kesidis</span>. <span class=GramE><span class=grame><i style='mso-bidi-font-style:normal'>ATM Network Performance</i>, Second Edition, Kluwer Academic Publishers, Boston, MA, 1999.</span></span> <o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>-----------------------------------------------------------------------------------------------------------<u1:p></u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>Network Neutrality:<u1:p></u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>G. <span class=SpellE>Kesidis</span>. Demand response for non-neutral networks: Side-payment profitability and convexity <span class=SpellE>modeling</span> congestion-sensitive applications. In <i style='mso-bidi-font-style:normal'>Proc. IEEE ICC</i>, Ottawa, June 2012.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>E. Altman, P. Bernhard, S. Caron, G. <span class=SpellE>Kesidis</span>, J. Rojas-Mora, and S. Wong. <span class=GramE><span class=grame>A study of non-neutral networks under usage-based pricing.</span></span> <i style='mso-bidi-font-style:normal'>Telecommunication Systems Journal Special Issue on Socio-economic Issues of Next Generation Networks</i>, June 2011.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>E. Altman, S. Caron and G. <span class=SpellE>Kesidis</span>. <span class=GramE>Application Neutrality and a Paradox of Side Payments.</span> In <i style='mso-bidi-font-style:normal'>Proc. ACM Re-Architecting the Internet (<span class=SpellE><span class=spelle>ReArch</span></span>) Workshop</i>, Philadelphia, <span class=GramE><span class=grame>Nov</span></span>. 30, 2010.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>G. <span class=SpellE>Kesidis</span>. <span class=grame>Congestion control alternatives for residential broadband access by CMTS.</span> In <i style='mso-bidi-font-style:normal'>Proc. IEEE/IFIP NOMS</i>, Osaka, Japan, Apr. 2010.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'><u1:p>&nbsp;</u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>-----------------------------------------------------------------------------------------------------------<u1:p></u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>Peer-to-Peer Networking:<u1:p></u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'><u1:p>&nbsp;</u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>V. Shah, G. de <span class=SpellE><span class=spelle>Veciana</span></span> and G. <span class=SpellE>Kesidis</span>. Learning to route queries in unstructured P2P systems: Achieving throughput optimality subject to query resolution constraints. In <i style='mso-bidi-font-style:normal'>IEEE INFOCOM</i>, <span class=SpellE>Orlando</span>, Mar. 2012.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>C. Griffin, G. <span class=SpellE>Kesidis</span>, P. <span class=SpellE><span class=spelle>Antoniades</span></span>, S. <span class=SpellE><span class=spelle>Fdida</span></span>. <span class=GramE><span class=grame>An Epidemic Model of </span><span class=SpellE><span class=spelle>BitTorrent</span></span><span class=grame> for Acquisition Performance, Content Availability, and Cooperation Incentives.</span></span> In <i style='mso-bidi-font-style:normal'>Proc. IEEE ICC (Communication and Information System Security Symposium)</i>, Kyoto, June 2011.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>P. <span class=SpellE><span class=spelle>Patankar</span></span>, G. Nam, G. <span class=SpellE>Kesidis</span>, T. <span class=SpellE><span class=spelle>Konstantopoulos</span></span> and C. Das. <span class=GramE>Peer-to-peer unstructured search with learned correlations between communities of interest.</span><span style='mso-spacerun:yes'>  </span><span class=GramE>In <i style='mso-bidi-font-style: normal'>Proc. International <span class=SpellE><span class=spelle>Teletraffic</span></span> Congress (ITC)</i>, Paris, Sept. 2009.</span></span><o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>T. <span class=SpellE><span class=spelle>Konstantopoulos</span></span>, G. <span class=SpellE>Kesidis</span> and P. <span class=SpellE><span class=spelle>Sousi</span></span>,  A stochastic epidemiological model and deterministic limit for <span class=SpellE><span class=spelle>BitTorrent</span></span>-like peer-to-peer file-sharing networks. <span class=GramE>In <i style='mso-bidi-font-style: normal'>Workshop on Network Control and Optimization</i>, Paris, Sept. 2008 (Proceedings to appear in Springer LNCS).<u1:p></u1:p></span></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'><u1:p>&nbsp;</u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'><u1:p>&nbsp;</u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>-----------------------------------------------------------------------------------------------------------<u1:p></u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>Distributed networking games for medium access and flow control:<u1:p></u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>Y. Jin and G. <span class=SpellE>Kesidis</span>. A channel-aware MAC protocol in an ALOHA network with selfish users. <i style='mso-bidi-font-style: normal'>IEEE JSAC Special Issue on Game Theory in Wireless Communications</i>, Jan. 2012.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>G. <span class=SpellE>Kesidis</span>, Y. Jin, A. Amar and E. Altman. <span class=GramE>Stable Nash <span class=SpellE><span class=spelle>equilibria</span></span> of medium access games under symmetric, socially altruistic <span class=SpellE>behavior</span>.</span> In <i style='mso-bidi-font-style:normal'>Proc. IEEE CDC</i>, Atlanta, Dec. 15-17, 2010.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>G. <span class=SpellE>Kesidis</span>, G. de <span class=SpellE><span class=spelle>Veciana</span></span> and A. Das,  On flat-rate and usage-based pricing for tiered commodity Internet services&quot;, in Proc. CISS, <ns0:place>Princeton</ns0:place></span>, March 2008. <span style='mso-spacerun:yes'> </span><u1:p></u1:p><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>Y. Jin and G. <span class=SpellE>Kesidis</span>,  Distributed contention window control for selfish users in IEEE 802.11 wireless LANs , IEEE JSAC special issue on non-cooperative networks, Aug. 2007.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>Y. Jin and G. <span class=SpellE>Kesidis</span>,  Charge sensitive and incentive compatible end-to-end window-based control for selfish users&quot;, IEEE JSAC special issue on Network Economics and Pricing, May 2006.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>Y. Jin and G. <span class=SpellE>Kesidis</span>,  Dynamics of usage-priced communication networks: the case of a single bottleneck resource,&quot; IEEE Transactions on Networking (<span class=SpellE><span class=spelle>ToN</span></span>), Oct. 2005.</span><o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>Y. Jin and G. <span class=SpellE>Kesidis</span>, <span class=SpellE><span class=spelle>Equilibiria</span></span> of a <span class=SpellE><span class=spelle>noncooperative</span></span> game for heterogeneous users of an ALOHA network, <em><span style='mso-bidi-font-family: "Times New Roman";mso-bidi-theme-font:minor-bidi'>IEEE Comm. Letters, </span></em>Vol. 6, No. 7, pp. 282-284, 2002. <o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'><u1:p>&nbsp;</u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'><u1:p>&nbsp;</u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>-----------------------------------------------------------------------------------------------------<u1:p></u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>Network Security including Flow Classification, Anti-Spam and Identity Issues:<u1:p></u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>B. <span class=SpellE><span class=spelle>Celik</span></span>, J. <span class=SpellE><span class=spelle>Raghuram</span></span>, G. <span class=SpellE>Kesidis</span> and D.J. Miller. Salting public traces with attack traffic to test flow classifiers. In <i style='mso-bidi-font-style:normal'>Proc. USENIX Cyber Security Experimentation and Test (CSET) Workshop</i>, San Francisco, Aug. 8, 2011.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>G. <span class=SpellE><span class=spelle>Zou</span></span>, G. <span class=SpellE>Kesidis</span> and D.J. Miller. A Flow Classifier with Tamper-resistant Features and an Evaluation of Its Portability to New Domains. <span class=GramE><span class=grame><i style='mso-bidi-font-style:normal'>IEEE JSAC Special Issue on Advances in Digital Forensics for Communications and Networking</i>, Aug. 2011.<u1:p></u1:p></span></span></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>A. <span class=SpellE><span class=spelle>Kurve</span></span> and G. <span class=SpellE>Kesidis</span>. <span class=GramE><span class=grame>Sybil Detection via Distributed Sparse Cut Monitoring.</span></span> In <i style='mso-bidi-font-style:normal'>Proc. IEEE ICC (Next Generation Networking and Internet Symposium)</i>, Kyoto, June 2011.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>G. <span class=SpellE>Kesidis</span>, A. <span class=SpellE><span class=spelle>Tangpong</span></span> and C. Griffin. A <span class=SpellE><span class=spelle>sybil</span></span>-proof referral system based on multiplicative reputation chains. IEEE Comm. Letters, Nov. 2009. <span style='color:red'><a href="http://www.cse.psu.edu/%7Ekesidis/papers/sybilproof-errata.pdf">Errata</a><u1:p></u1:p></span></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>P. <span class=SpellE><span class=spelle>Patankar</span></span>, G. Nam, G. <span class=SpellE>Kesidis</span> and C. Das,  Exploring Anti-Spam Models in Large Scale VoIP Systems&quot;, in Proc. IEEE Int'l Conf. on Distributed Computing Systems (ICDCS), <ns0:place><ns0:city>Beijing</ns0:city></span></ns0:place>, June 2008.<u1:p></u1:p><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>G. <span class=SpellE>Kesidis</span>, M. <span class=SpellE><span class=spelle>Vojnovic</span></span>, I. <span class=SpellE><span class=spelle>Hamadeh</span></span>, Y. Jin, S. <span class=SpellE><span class=spelle>Jiwasurat</span></span>,  Model of the Spread of Randomly Scanning Internet Worms that Saturate Access Links,&quot; ACM TOMACS, May 2008.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-fareast-font-family: Batang'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-fareast-font-family: Batang'>S. Yi, X. Deng, G. <span class=SpellE>Kesidis</span> and C.R. Das,  A dynamic quarantine scheme for controlling unresponsive TCP sessions,&quot; Telecommunication Systems, 2008.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>Y.-C. <span class=SpellE><span class=spelle>Jhi</span></span>, L. Li, P. Liu, Q. Jin, and G. <span class=SpellE>Kesidis</span>,  PWC: A Proactive Worm Containment Solution for <ns0:place><ns0:city>Enterprise</ns0:city></span></ns0:place> Networks&quot;, in Proc. IEEE <span class=SpellE><span class=spelle>SecureComm</span></span>, Sept. 2007.<u1:p></u1:p><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>J. Wang, D.J. Miller and G. <span class=SpellE>Kesidis</span>,  New Directions in Covert Worm <span class=SpellE>Modeling</span> Exploiting White-Listing&quot; in Proc. IEEE Sarnoff Symposium on Communications, March 2007.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>J. Wang, D.J. Miller, and G. <span class=SpellE>Kesidis</span>,  Efficient <span class=GramE>Mining</span> of the Multidimensional Traffic Cluster Hierarchy for Digesting, Visualization, and <span class=SpellE>Modeling</span>,&quot; IEEE JSAC special issue on High-Speed Network Security, 2006.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>L. Li, P. Liu and G. <span class=SpellE>Kesidis</span>,  Visual Studio for Network Security Experiment Specification and Data Analysis, in Proc. ACM Workshop on Visualization for Computer Security (<span class=SpellE><span class=spelle>VizSec</span></span>), Nov. 3 2006.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>J. Wang, I. <span class=SpellE><span class=spelle>Hamadeh</span></span>, D.J. Miller and G. <span class=SpellE>Kesidis</span>,  Polymorphic Worm Detection and <span class=SpellE>Defense</span>: System Design, Experimental Methodology, and Data Resources&quot;, in Proc. ACM SIGCOMM Workshop on Large-Scale Attack <span class=SpellE>Defense</span> (LSAD), <ns0:place><ns0:city>Pisa</ns0:city>, <ns0:country-region>Italy</ns0:country-region></ns0:place></span>, Sept. 11, 2006.<u1:p></u1:p><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>I. <span class=SpellE><span class=spelle>Hamadeh</span></span>. <a href="http://etda.libraries.psu.edu/theses/approved/WorldWideIndex/ETD-1431/index.html">Attack Attribution for Distributed Denial-of-Service and Worm Attacks.</a> <span class=GramE>Ph.D. Thesis, CSE <span class=SpellE>Dept</span>, Penn State, 2006.</span> <u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>I. <span class=SpellE><span class=spelle>Hamadeh</span></span> and G. <span class=SpellE>Kesidis</span>. <span class=GramE><span class=grame>Real-time packet </span><span class=SpellE><span class=spelle>traceback</span></span><span class=grame> and associated packet marking strategies (the e-postmark).</span></span> US Patent No. 7,752,324, filed 2003, awarded 2010.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>G. Carl, R. Brooks, <ns0:place>S. <span class=SpellE><span class=spelle>Rai</ns0:place></span></span></span> and G. <span class=SpellE>Kesidis</span>,  <span class=SpellE><span class=spelle>DoS</span></span>/<span class=SpellE><span class=spelle>DDoS</span></span> attack detection techniques&quot;, IEEE Internet Computing, Jan/Feb 2006.<u1:p></u1:p><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>N. Weaver, I. <span class=SpellE><span class=spelle>Hamadeh</span></span>, G. <span class=SpellE>Kesidis</span> and V. <span class=SpellE><span class=spelle>Paxson</span></span>,  Preliminary results using scale-down to explore worm dynamics , in <em><span style='mso-bidi-font-family:"Times New Roman";mso-bidi-theme-font:minor-bidi'>Proc.&nbsp; ACM WORM</span></em>, <ns0:place><ns0:city>Washington</ns0:city>, <ns0:state>DC</ns0:state></ns0:place>, <ns0:date>Oct. 29, 2004</ns0:date>.<u1:p></u1:p><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'><u1:p>&nbsp;</u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span class=GramE><em><span style='mso-bidi-font-family:"Times New Roman";mso-bidi-theme-font:minor-bidi'>See also  discrete packet dropping in the wireless networking topic section below.</span></em></span><em><span style='mso-bidi-font-family:"Times New Roman";mso-bidi-theme-font:minor-bidi'> </span></em><o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'><u1:p>&nbsp;</u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>---------------------------------------------------------------------------------------------------------<u1:p></u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>Traffic Engineering including Traffic Shaping, Scheduling and Effective Bandwidths:<u1:p></u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-fareast-font-family: Batang'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-fareast-font-family: Batang'>S. <span class=SpellE><span class=spelle>Jiwasurat</span></span>, G. <span class=SpellE>Kesidis</span> and D.J. Miller,  Hierarchical Shaped Deficit Round-Robin (HSDRR) Scheduling&quot;, in Proc. IEEE GLOBECOM, <ns0:place><ns0:city>St. Louis</ns0:city></span></ns0:place>, Dec. 2005.<o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>S. Yi, X. Deng, G. <span class=SpellE>Kesidis</span> and C. Das, <span class=SpellE><span class=spelle>HaTCh</span></span>: A Two-level Caching Scheme for Estimating the Number of Active Flows, in <em><span style='mso-bidi-font-family:"Times New Roman";mso-bidi-theme-font:minor-bidi'>Proc. IEEE CDC,</span></em> <ns0:place>Maui</ns0:place>, Dec. 2003.<u1:p></u1:p><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>G. <span class=SpellE>Kesidis</span> and L. <span class=SpellE><span class=spelle>Tassiulas</span></span>, Traffic Shaping for a Loss <span class=GramE>System ,</span> <em><span style='mso-bidi-font-family:"Times New Roman";mso-bidi-theme-font:minor-bidi'>IEEE Communication </span></em><span class=grame><i>Letters </i>,</span> Dec. 2000, pp. 417-419.<o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>G. <span class=SpellE>Kesidis</span> and T. <span class=SpellE><span class=spelle>Konstantopoulos</span></span>, <a href="http://www.cse.psu.edu/%7Ekesidis/papers/fields.pdf"><span class=SpellE><span class=spelle><span style='color:windowtext;text-decoration:none;text-underline: none'>Extremal</span></span></span> Traffic and Worst-Case Performance for Queues with Shaped Arrivals </a>, <em><span style='mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi'>Analysis of Communication Networks: Call </span></em><span class=spelle><i>Centres</i></span><em><span style='mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi'>, Traffic and Performance, </span></em>edited by D.R. McDonald and S.R.E. Turner, Fields Institute Communications/AMS, 2000, ISBN 0-8218-1991-7. <span class=GramE>Originally presented at the Fields Institute, U. Toronto, Nov. 9-13, 1998, also IEEE <span class=SpellE><span class=spelle>T.Comm</span></span>.</span> <span class=GramE><span class=grame>paper</span></span> in 1998 and IEEE Comm. Lett. <span class=GramE><span class=grame>Paper in 2000.</span></span> <o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>G. de <span class=SpellE><span class=spelle>Veciana</span></span> and G. <span class=SpellE>Kesidis</span>, &quot;Bandwidth Allocation for Multiple Qualities of Service using Generalized Processor Sharing&quot;, <em><span style='mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi'>IEEE Trans. Information Theory, </span></em>Vol. 42, No. 1, Jan. 1996, pp. 268-271. <o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>A. Hung and G. <span class=SpellE>Kesidis</span>, Bandwidth Scheduling for Wide-Area ATM Networks Using Virtual Finishing Times, <em><span style='mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi'>IEEE/ACM Trans. Networking, </span></em>Vol. 4, No. 1, pp. 49-54, Feb. 1996. <o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>G. <span class=SpellE>Kesidis</span>, T. <span class=SpellE><span class=spelle>Konstantopoulos</span></span> and M. <span class=SpellE><span class=spelle>Zazanis</span></span>, Sensitivity Analysis for Discrete-Time Randomized Service Priority Queues, <em><span style='mso-bidi-font-family: "Times New Roman";mso-bidi-theme-font:minor-bidi'>Proc. IEEE CDC'94, </span></em><span class=SpellE>Orlando</span>, FL., pp. 2627-2630, Dec 1994. <o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>G. <span class=SpellE>Kesidis</span>, J. <span class=SpellE><span class=spelle>Walrand</span></span> and C.-S. Chang, Effective Bandwidths for Multiclass Markov Fluids and Other ATM Sources, <em><span style='mso-bidi-font-family:"Times New Roman";mso-bidi-theme-font:minor-bidi'>IEEE/ACM Trans. Networking, </span></em>Vol. 1, No. 4, pp. 424-428, 1993. <o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'><u1:p>&nbsp;</u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>-------------------------------------------------------------------------------------------------------<u1:p></u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>Performance Evaluation including Simulation:<u1:p></u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>A. <span class=SpellE><span class=spelle>Kurve</span></span>, C. Griffin and G. <span class=SpellE>Kesidis</span>. <span class=GramE><span class=grame>Iterative Partitioning Scheme for Distributed Simulation of Dynamic Networks.</span></span> In <i style='mso-bidi-font-style:normal'>Proc. IEEE Computer Aided <span class=SpellE>Modeling</span> and Design (CAMAD)</i>, Kyoto, June 2011.<u1:p></u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>G. Carl and G. <span class=SpellE>Kesidis</span>. <span class=SpellE><span class=GramE>Modeling</span></span><span class=GramE> a Policy-Capable Path-Vector Routing Protocol using Jacobi Iteration over <span class=grame>a Path</span> Algebra.</span> <span class=GramE><i style='mso-bidi-font-style: normal'>Computer Networks (COMNET) Journal</i>, to appear.<u1:p></u1:p></span></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'><u1:p>&nbsp;</u1:p></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>G. Carl and G. <span class=SpellE>Kesidis</span>. <span class=GramE> Large-scale testing of the Internet s Border Gateway Protocol via Topological Scale-Down , ACM TOMACS, July 2008.<u1:p></u1:p></span></span><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'><u1:p>&nbsp;</u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span style='mso-bidi-font-weight: bold'>I. <span class=SpellE><span class=spelle>Hamadeh</span></span>, J. Hart, G. <span class=SpellE>Kesidis</span> and V. <span class=SpellE><span class=spelle>Pothamsetty</span></span>,  A preliminary simulation of the effect of scanning worm activity on multicast , in <i style='mso-bidi-font-style:normal'>Proc. IEEE PADS, </i><ns0:place><ns0:city>Monterey</ns0:city>, <ns0:state>CA</ns0:state></ns0:place></span>, June 2005.<o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>N. <span class=SpellE><span class=spelle>Milidrag</span></span>, G. <span class=SpellE>Kesidis</span> and M. <span class=SpellE><span class=spelle>Devetsikiotis</span></span>, An overview of fluid-based quick simulation techniques for large packet-switched communication networks, in <em><span style='mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi'>Proc. SPIE </span></em><span class=SpellE><span class=spelle><i>ITCom</i></span></span><em><span style='mso-bidi-font-family: "Times New Roman";mso-bidi-theme-font:minor-bidi'>, <ns0:place></span></em><ns0:city>Denver</ns0:city></ns0:place>, Aug. 2001.<u1:p></u1:p><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>G. <span class=SpellE>Kesidis</span>, A. Singh, D. Cheung and W.W. Kwok, Feasibility of Fluid Event-Driven Simulation for ATM Networks, <em><span style='mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi'>in Proc. IEEE </span></em><span class=SpellE><span class=spelle><i>Globecom</i></span></span><em><span style='mso-bidi-font-family: "Times New Roman";mso-bidi-theme-font:minor-bidi'>, London </span></em>, Nov. 1996. <o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>G. <span class=SpellE>Kesidis</span> and A. Singh, An Overview of Cell-Level ATM Network Simulation, <span class=GramE><span class=grame>in<span style='mso-spacerun:yes'>  </span></span><em><span style='mso-bidi-font-family:"Times New Roman";mso-bidi-theme-font:minor-bidi'>Proc</span></em></span><em><span style='mso-bidi-font-family:"Times New Roman";mso-bidi-theme-font:minor-bidi'>. ACM HPCS, <ns0:place></span></em><ns0:city>Montreal</ns0:city>, <ns0:country-region>Canada</ns0:country-region></ns0:place>, 1995. <u1:p></u1:p><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><u1:p>&nbsp;<o:p></o:p></p> </u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'>G. <span class=SpellE>Kesidis</span> and J. <span class=SpellE><span class=spelle>Walrand</span></span>, Quick Simulation of ATM Buffers with On-off Multiclass Markov Fluid Sources, <em><span style='mso-bidi-font-family:"Times New Roman";mso-bidi-theme-font:minor-bidi'>ACM TOMACS, </span></em>Vol. 3, No. 3, pp. 267-276, July 1993. <o:p></o:p></p> <u1:p></u1:p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'><u1:p>&nbsp;</u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'><u1:p>&nbsp;</u1:p></span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span style='font-size: 14.0pt'>------------------------------------------------------------------------------------------------</span></b><o:p></o:p></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'>A. <span class=SpellE>Neishaboori</span> and G. <span class=SpellE>Kesidis</span>,  Wireless Mesh Networks Based on CDMA&quot;, Computer Communications special issue on WMNs, vol. 31, 2008.<o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'>A. Das, V. <span class=SpellE>Pothamsetty</span> and G. <span class=SpellE>Kesidis</span>, ``Assessing discreet packet-dropping attacks using nearest-neighbor and path-vector attribution&quot;, in Proc. IEEE BROADNETS (Symposium on Wireless Networking), Raleigh, NC, Sept. 2007.<o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'><o:p>&nbsp;</o:p></span></p> <div style='mso-element:para-border-div;border:none;border-top:dotted #C2C2C2 1.0pt; mso-border-top-alt:dotted #C2C2C2 .75pt;padding:6.0pt 0in 0in 0in;background: white'> <p class=MsoNormal style='mso-line-height-alt:1.0pt;mso-outline-level:4; background:white;border:none;mso-border-top-alt:dotted #C2C2C2 .75pt; padding:0in;mso-padding-alt:6.0pt 0in 0in 0in'><span class=GramE><span lang=EN style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN;mso-bidi-font-weight: bold'>R.N. <span class=SpellE>Rao</span> and G. <span class=SpellE>Kesidis</span>.</span></span><span lang=EN style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN; mso-bidi-font-weight:bold'> </span><span lang=EN style='font-size:10.5pt; mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN;mso-bidi-font-weight: bold'><a href="http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1318592"><span class=GramE><span style='color:windowtext;text-decoration:none;text-underline: none'>Purposeful mobility for relaying and surveillance in mobile ad hoc sensor networks</span></span></a><span class=GramE>.</span> <span class=GramE><i style='mso-bidi-font-style:normal'>IEEE Transactions on Mobile </i><i style='mso-bidi-font-style:normal'><span style='font-size:12.0pt'>Computing</span></i><span style='font-size:12.0pt'> <b>3</b>(3), 2004.</span></span></span><span lang=EN style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN;mso-bidi-font-weight: bold'> <span style='color:#C00000'>Errata: <span class=SpellE>P<sub>x<span class=GramE>,y</span></sub></span><sup> </sup>and \hat{P}<span class=SpellE><sub>x,y</sub></span><sub> </sub>should have a negative sign in the exponent, <i style='mso-bidi-font-style: normal'>i.e.</i>, ² should be  ². Also, the proof covers the case of multiple global <span class=SpellE>extrema</span> for the case when direct transitions between them are excluded, i.e., each global <span class=SpellE>extrema</span> is a<u> strict </u>local <span class=SpellE>extrema</span>.</span><o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt;mso-outline-level:4; background:white;border:none;mso-border-top-alt:dotted #C2C2C2 .75pt; padding:0in;mso-padding-alt:6.0pt 0in 0in 0in'><span lang=EN style='font-size: 10.5pt;mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN;mso-bidi-font-weight: bold'><o:p>&nbsp;</o:p></span></p> </div> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'>P.B. <span class=SpellE>Jeon</span>. </span><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language: EN-US'><a href="http://etda.libraries.psu.edu/theses/approved/WorldWideIndex/ETD-1247/index.html"><span class=GramE>A pheromone-aided multipath <span class=SpellE>QoS</span> routing protocol and its application in MANETs</span></a><span class=GramE>.</span> <span class=GramE>Ph.D. thesis, EE <span class=SpellE>Dept</span>, Penn State, 2006.</span><span style='mso-bidi-font-weight:bold'><o:p></o:p></span></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'>G. <span class=SpellE>Kesidis</span>, T. <span class=SpellE>Konstantopoulos</span> and S. <span class=SpellE>Phoha</span><span class=GramE>,<span style='mso-spacerun:yes'>  </span>Surveillance</span> coverage of sensor networks under a random mobility strategy<u> </u>, in <em>Proc. IEEE Sensors, </em><ns1:place><ns1:City>Toronto</ns1:City></ns1:place>, Oct. 2003.<o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'>V. <span class=SpellE>Bhatnagar</span> and G. <span class=SpellE>Kesidis</span>, Bluetooth <span class=SpellE>scatternet</span> formation, in <em>Proc. joint 2nd IEEE International Conference on Networking and IEEE International Conference on Wireless LANs and Home Networks (ICN'02 and ICWLHN'02), </em>Atlanta, August 26-29, 2002. <o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'>A. Hung, M-J <span class=SpellE>Montpetit</span>, and G. <span class=SpellE>Kesidis</span>, ATM via Satellite: A Framework and Implementation, <em>ACM Wireless Networks</em>, Vol. 4, No. 2, Feb. 1998, pp. 141-154. <o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span lang=EN-US style='font-size:14.0pt;mso-bidi-font-family:"Times New Roman";mso-ansi-language: EN-US'>-------------------------------------------------------------------------------------------------------<o:p></o:p></span></b></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span lang=EN-US style='font-size:14.0pt;mso-bidi-font-family:"Times New Roman";mso-ansi-language: EN-US'>Machine Learning and Optimization including Applications to <span class=SpellE>BioMed</span> and Energy Systems:<o:p></o:p></span></b></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><b><span lang=EN-US style='font-size:14.0pt;mso-bidi-font-family:"Times New Roman";mso-ansi-language: EN-US'><o:p>&nbsp;</o:p></span></b></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'>G. <span class=SpellE>Kesidis</span> and A. <span class=SpellE>Kurve</span>. <span class=GramE>A study of unsupervised adaptive crowdsourcing.</span> In <i style='mso-bidi-font-style:normal'>Proc. IEEE ICC</i>, Ottawa, June 2012. <o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span class=GramE><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language: EN-US;mso-bidi-font-weight:bold'>Also http://arxiv.org/abs/1110.1781, Oct. 9, 2011.</span></span><span lang=EN-US style='mso-bidi-font-family:"Times New Roman"; mso-ansi-language:EN-US;mso-bidi-font-weight:bold'><o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'>G. Pang, G. <span class=SpellE>Kesidis</span> and T. <span class=SpellE>Konstantopoulos</span>. <span class=GramE>Avoiding Overages by Deferred Aggregate Demand for PEV Charging on the Smart Grid.</span><o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'>In <i style='mso-bidi-font-style:normal'>Proc. IEEE ICC</i>, Ottawa, June 2012.<o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'>S. Caron and G. <span class=SpellE>Kesidis</span>. <span class=GramE>Incentive-based energy consumption scheduling algorithms for the Smart Grid.</span> In <i style='mso-bidi-font-style:normal'>Proc. IEEE <span class=SpellE>SmartGridComm</span></i>, Gaithersburg, MD, Oct. 4-6, 2010. <a href="http://www.cse.psu.edu/~kesidis/papers/smartgridcomm10-extended.pdf"><span class=GramE>Extended version</span></a><span class=GramE>.</span><o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span class=GramE><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language: EN-US;mso-bidi-font-weight:bold'>D.J. Miller, C.-F.</span></span><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language: EN-US;mso-bidi-font-weight:bold'> Lin<span class=GramE>,<span style='mso-spacerun:yes'>  </span>G</span>. <span class=SpellE>Kesidis</span> and C. Collins. <span class=GramE>Improved Fine-Grained Component-Conditional Class Labeling with Active Learning.</span> In <i style='mso-bidi-font-style: normal'>Proc. IEEE Int'l Conf. on Machine Learning and Applications (ICMLA)</i>, Bethesda, MD, Dec. 12-14, 2010.<o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'>Y. <span class=SpellE>Aksu</span>, D.J. Miller, G. <span class=SpellE>Kesidis</span> and Q.X Yang. <span class=GramE> Margin-Maximizing Feature Elimination Methods for Linear and Nonlinear Kernel SVMs , to appear in <i style='mso-bidi-font-style:normal'>IEEE Trans. Neural Networks</i>, 2010.</span><o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=IT style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:IT;mso-bidi-font-weight: bold'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=IT style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:IT;mso-bidi-font-weight: bold'>G. Kesidis. A Quantum Diffusion Network. </span><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'>Technical Report, Aug. 2009: </span><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language: EN-US'><a href="https://mail.engr.psu.edu/owa/redir.aspx?C=974082a2d81e4017bf27fa4238b0ed1b&amp;URL=http%3a%2f%2farxiv1.library.cornell.edu%2fabs%2f0908.1597" target="_blank">http://arxiv1.library.cornell.edu/abs/0908.1597</a><span style='mso-bidi-font-weight:bold'><o:p></o:p></span></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span class=GramE><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language: EN-US;mso-bidi-font-weight:bold'>D.J. Miller, C.-F.</span></span><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language: EN-US;mso-bidi-font-weight:bold'> <span class=GramE>Lin, G. <span class=SpellE>Kesidis</span> and C. Collins.</span> <span class=GramE>Semi-supervised mixture modeling with fine-grained component-conditional class labeling and <span class=SpellE>transductive</span> inference.</span> <span class=GramE>In <i style='mso-bidi-font-style:normal'>Proc. IEEE Machine Learning in Signal Processing (MLSP),</i> Grenoble, France, Sept. 2009.</span> (<span class=GramE>best</span> paper award)<o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'>Y. Zhang, D.J. Miller and G. <span class=SpellE>Kesidis</span>. <span class=GramE>Hierarchical maximum entropy modeling for regression.</span> <span class=GramE>In <i style='mso-bidi-font-style:normal'>Proc. IEEE Machine Learning in Signal Processing (MLSP),</i> Grenoble, France, Sept. 2009.</span><o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'>Y. Zhang, Y. <span class=SpellE>Aksu</span>, G. <span class=SpellE>Kesidis</span> and D.J. Miller,  SVM feature-selection applications to microarray data ,<span style='mso-spacerun:yes'>  </span>in Proc. IEEE Workshop on Machine Learning in Signal Processing (MLSP), Cancun, Mexico, Oct. 2008.<o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'>D.J. Miller, Y. Zhang, and G. <span class=SpellE>Kesidis</span>,  A <span class=SpellE>Transductive</span> Extension of Maximum Entropy/Iterative Scaling for Decision Aggregation in Distributed Classification&quot;, in Proc. IEEE ICASSP, <ns1:place><ns1:City>Las Vegas</ns1:City></ns1:place>, March 2008.<o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US; mso-bidi-font-weight:bold'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span class=GramE><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language: EN-US;mso-bidi-font-weight:bold'>D.J. Miller, Y. Wang and G. <span class=SpellE>Kesidis</span>,  Emergent unsupervised clustering paradigms with potential applications to bioinformatics , Frontiers in Bioscience, Jan. 2008.</span></span><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language: EN-US;mso-bidi-font-weight:bold'><o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'>G. <span class=SpellE>Kesidis</span> and J. <span class=SpellE>Walrand</span>, Relative Entropy Between Markov Transition Rate <span class=GramE>Matrices ,</span> <em>IEEE Trans. Info. Th., </em>Vol. 39, No. 3, pp. 1056-1057, May 1993. <o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'>G. <span class=SpellE>Kesidis</span>, Analog Optimization with Wong's Stochastic Neural Network, <em>IEEE Trans. Neural Networks, </em>Vol. 6, No. 1, pp. 258-260, 1995. <o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'><o:p>&nbsp;</o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'>G. <span class=SpellE>Kesidis</span> and E. Wong, Optimal Acceptance Probability for Simulated Annealing, <span class=SpellE><em>Stochastics</em></span><em> and <span class=SpellE>Stochastics</span> Reports, </em>Vol. 29, pp. 221-226, 1990. <span style='color:red;mso-bidi-font-weight:bold'><a href="http://www.cse.psu.edu/~kesidis/papers/annealing-errata.pdf">Errata</a></span><o:p></o:p></span></p> <p class=MsoNormal style='mso-line-height-alt:1.0pt'><span lang=EN-US style='mso-bidi-font-family:"Times New Roman";mso-ansi-language:EN-US'><o:p>&nbsp;</o:p></span></p> </div> </body> </html>