diff --git "a/valid.txt" "b/valid.txt"
new file mode 100644--- /dev/null
+++ "b/valid.txt"
@@ -0,0 +1,66791 @@
+Mobile	B-KEY
+commerce	I-KEY
+:	O
+transforming	O
+the	O
+vision	O
+into	O
+reality	O
+This	O
+editorial	O
+preface	O
+investigates	O
+current	O
+developments	O
+in	O
+mobile	B-KEY
+commerce	I-KEY
+-LRB-	O
+M-commerce	B-KEY
+-RRB-	O
+and	O
+proposes	O
+an	O
+integrated	B-KEY
+architecture	I-KEY
+that	O
+supports	O
+business	O
+and	O
+consumer	B-KEY
+needs	I-KEY
+in	O
+an	O
+optimal	O
+way	O
+to	O
+successfully	O
+implement	O
+M-commerce	B-KEY
+business	O
+processes	O
+.	O
+The	O
+key	O
+line	O
+of	O
+thought	O
+is	O
+based	O
+on	O
+the	O
+heuristic	O
+observation	O
+that	O
+customers	O
+will	O
+not	O
+want	O
+to	O
+receive	O
+M-commerce	B-KEY
+offerings	O
+to	O
+their	O
+mobile	B-KEY
+telephones	I-KEY
+.	O
+As	O
+a	O
+result	O
+,	O
+a	O
+pull	O
+as	O
+opposed	O
+to	O
+a	O
+push	O
+approach	O
+becomes	O
+a	O
+necessary	O
+requirement	O
+to	O
+conduct	O
+M-commerce	B-KEY
+.	O
+In	O
+addition	O
+,	O
+M-commerce	B-KEY
+has	O
+to	O
+rely	O
+on	O
+local	O
+,	O
+regional	O
+,	O
+demographic	O
+and	O
+many	O
+other	O
+variables	O
+to	O
+be	O
+truly	O
+effective	O
+.	O
+Both	O
+observations	O
+necessitate	O
+an	O
+M-commerce	B-KEY
+architecture	O
+that	O
+allows	O
+the	O
+coherent	O
+integration	O
+of	O
+enterprise-level	O
+systems	O
+as	O
+well	O
+as	O
+the	O
+aggregation	O
+of	O
+product	O
+and	O
+service	O
+offerings	O
+from	O
+many	O
+different	O
+and	O
+partially	O
+competing	O
+parties	O
+into	O
+a	O
+collaborative	O
+M-commerce	B-KEY
+platform	O
+.	O
+The	O
+key	O
+software	O
+component	O
+within	O
+this	O
+integrated	B-KEY
+architecture	I-KEY
+is	O
+an	O
+event	B-KEY
+management	I-KEY
+engine	I-KEY
+to	O
+monitor	O
+,	O
+detect	O
+,	O
+store	O
+,	O
+process	O
+and	O
+measure	O
+information	O
+about	O
+outside	O
+events	O
+that	O
+are	O
+relevant	O
+to	O
+all	O
+participants	O
+in	O
+M-commerce	B-KEY
+
+Single-phase	B-KEY
+shunt	I-KEY
+active	I-KEY
+power	I-KEY
+filter	I-KEY
+with	O
+harmonic	B-KEY
+detection	I-KEY
+An	O
+advanced	O
+active	O
+power	O
+filter	O
+for	O
+the	O
+compensation	O
+of	O
+instantaneous	O
+harmonic	O
+current	O
+components	O
+in	O
+nonlinear	B-KEY
+current	I-KEY
+loads	I-KEY
+is	O
+presented	O
+.	O
+A	O
+signal	B-KEY
+processing	I-KEY
+technique	I-KEY
+using	O
+an	O
+adaptive	B-KEY
+neural	I-KEY
+network	I-KEY
+algorithm	I-KEY
+is	O
+applied	O
+for	O
+the	O
+detection	O
+of	O
+harmonic	O
+components	O
+generated	O
+by	O
+nonlinear	B-KEY
+current	I-KEY
+loads	I-KEY
+and	O
+it	O
+can	O
+efficiently	O
+determine	O
+the	O
+instantaneous	B-KEY
+harmonic	I-KEY
+components	I-KEY
+in	O
+real	O
+time	O
+.	O
+The	O
+validity	O
+of	O
+this	O
+active	O
+filtering	O
+processing	O
+system	O
+to	O
+compensate	O
+current	O
+harmonics	O
+is	O
+substantiated	O
+by	O
+simulation	B-KEY
+results	O
+
+Self-reproduction	B-KEY
+in	O
+three-dimensional	B-KEY
+reversible	I-KEY
+cellular	I-KEY
+space	I-KEY
+Due	O
+to	O
+inevitable	O
+power	B-KEY
+dissipation	I-KEY
+,	O
+it	O
+is	O
+said	O
+that	O
+nano-scaled	B-KEY
+computing	I-KEY
+devices	I-KEY
+should	O
+perform	O
+their	O
+computing	O
+processes	O
+in	O
+a	O
+reversible	O
+manner	O
+.	O
+This	O
+will	O
+be	O
+a	O
+large	O
+problem	O
+in	O
+constructing	O
+three-dimensional	O
+nano-scaled	O
+functional	O
+objects	O
+.	O
+Reversible	B-KEY
+cellular	I-KEY
+automata	I-KEY
+-LRB-	O
+RCA	O
+-RRB-	O
+are	O
+used	O
+for	O
+modeling	O
+physical	O
+phenomena	O
+such	O
+as	O
+power	B-KEY
+dissipation	I-KEY
+,	O
+by	O
+studying	O
+the	O
+dissipation	O
+of	O
+garbage	O
+signals	O
+.	O
+We	O
+construct	O
+a	O
+three-dimensional	O
+self-inspective	O
+self-reproducing	O
+reversible	O
+cellular	O
+automaton	O
+by	O
+extending	O
+the	O
+two-dimensional	O
+version	O
+SR/sub	O
+8	O
+/	O
+.	O
+It	O
+can	O
+self-reproduce	O
+various	O
+patterns	O
+in	O
+three-dimensional	B-KEY
+reversible	I-KEY
+cellular	I-KEY
+space	I-KEY
+without	O
+dissipating	O
+garbage	O
+signals	O
+
+Using	O
+DEVS	B-KEY
+formalism	O
+to	O
+operationalize	O
+ELP	B-KEY
+models	I-KEY
+for	O
+diagnosis	O
+in	O
+SACHEM	B-KEY
+This	O
+paper	O
+describes	O
+an	O
+original	O
+approach	O
+to	O
+discrete	B-KEY
+event	I-KEY
+control	I-KEY
+of	O
+continuous	B-KEY
+processes	I-KEY
+by	O
+means	O
+of	O
+expert	B-KEY
+knowledge	I-KEY
+.	O
+We	O
+present	O
+an	O
+application	O
+of	O
+this	O
+approach	O
+on	O
+the	O
+SACHEM	B-KEY
+diagnosis	O
+subsystem	O
+.	O
+The	O
+SACHEM	B-KEY
+system	O
+is	O
+a	O
+large-scale	O
+knowledge-based	O
+system	O
+that	O
+aims	O
+in	O
+helping	O
+a	O
+set	O
+of	O
+operators	O
+to	O
+control	O
+the	O
+dynamics	O
+of	O
+complex	O
+continuous	O
+systems	O
+-LRB-	O
+e.g.	O
+,	O
+blast	O
+furnaces	O
+-RRB-	O
+.	O
+The	O
+proposed	O
+method	O
+is	O
+based	O
+on	O
+:	O
+-LRB-	O
+i	O
+-RRB-	O
+The	O
+definition	O
+of	O
+a	O
+language	O
+facilitating	O
+the	O
+acquisition	O
+and	O
+representation	O
+of	O
+expert	B-KEY
+knowledge	I-KEY
+,	O
+called	O
+ELP	O
+-LRB-	O
+Expert	O
+Language	O
+Process	O
+-RRB-	O
+;	O
+-LRB-	O
+ii	O
+-RRB-	O
+The	O
+use	O
+of	O
+the	O
+DEVS	B-KEY
+formalism	O
+to	O
+make	O
+ELP	B-KEY
+models	I-KEY
+operational	O
+;	O
+-LRB-	O
+iii	O
+-RRB-	O
+Algorithms	O
+for	O
+exploiting	O
+operational	O
+models	O
+
+E	O
+-	O
+a	O
+brainiac	B-KEY
+theorem	I-KEY
+prover	I-KEY
+We	O
+describe	O
+the	O
+superposition-based	B-KEY
+theorem	I-KEY
+prover	I-KEY
+E.	O
+E	O
+is	O
+a	O
+sound	B-KEY
+and	O
+complete	B-KEY
+prover	O
+for	O
+clausal	B-KEY
+first	I-KEY
+order	I-KEY
+logic	I-KEY
+with	O
+equality	B-KEY
+.	O
+Important	O
+properties	O
+of	O
+the	O
+prover	O
+include	O
+strong	B-KEY
+redundancy	I-KEY
+elimination	I-KEY
+criteria	I-KEY
+,	O
+the	O
+DISCOUNT	B-KEY
+loop	B-KEY
+proof	I-KEY
+procedure	I-KEY
+,	O
+a	O
+very	O
+flexible	O
+interface	O
+for	O
+specifying	O
+search	B-KEY
+control	I-KEY
+heuristics	I-KEY
+,	O
+and	O
+an	O
+efficient	O
+inference	B-KEY
+engine	I-KEY
+.	O
+We	O
+also	O
+discuss	O
+the	O
+strengths	O
+and	O
+weaknesses	O
+of	O
+the	O
+system	O
+
+Non-linear	O
+analysis	O
+of	O
+nearly	B-KEY
+saturated	I-KEY
+porous	I-KEY
+media	I-KEY
+:	O
+theoretical	O
+and	O
+numerical	O
+formulation	O
+A	O
+formulation	O
+for	O
+a	O
+porous	O
+medium	O
+saturated	O
+with	O
+a	O
+compressible	B-KEY
+fluid	I-KEY
+undergoing	O
+large	O
+elastic	O
+and	O
+plastic	O
+deformations	O
+is	O
+presented	O
+.	O
+A	O
+consistent	B-KEY
+thermodynamic	I-KEY
+formulation	I-KEY
+is	O
+proposed	O
+for	O
+the	O
+two-phase	B-KEY
+mixture	I-KEY
+problem	I-KEY
+;	O
+thus	O
+preserving	O
+a	O
+straightforward	O
+and	O
+robust	B-KEY
+numerical	I-KEY
+scheme	I-KEY
+.	O
+A	O
+novel	O
+feature	O
+is	O
+the	O
+specification	O
+of	O
+the	O
+fluid	B-KEY
+compressibility	I-KEY
+in	O
+terms	O
+of	O
+a	O
+volumetric	B-KEY
+logarithmic	I-KEY
+strain	I-KEY
+,	O
+which	O
+is	O
+energy	O
+conjugated	O
+to	O
+the	O
+fluid	B-KEY
+pressure	I-KEY
+in	O
+the	O
+entropy	B-KEY
+inequality	I-KEY
+.	O
+As	O
+a	O
+result	O
+,	O
+the	O
+entropy	B-KEY
+inequality	I-KEY
+is	O
+used	O
+to	O
+separate	O
+three	O
+different	O
+mechanisms	O
+representing	O
+the	O
+response	O
+:	O
+effective	B-KEY
+stress	I-KEY
+response	I-KEY
+according	O
+to	O
+Terzaghi	O
+in	O
+the	O
+solid	B-KEY
+skeleton	I-KEY
+,	O
+fluid	B-KEY
+pressure	I-KEY
+response	O
+to	O
+compressibility	O
+of	O
+the	O
+fluid	O
+,	O
+and	O
+dissipative	O
+Darcy	O
+flow	O
+representing	O
+the	O
+interaction	O
+between	O
+the	O
+two	O
+phases	O
+.	O
+The	O
+paper	O
+is	O
+concluded	O
+with	O
+a	O
+couple	O
+of	O
+numerical	O
+examples	O
+that	O
+display	O
+the	O
+predictive	B-KEY
+capabilities	I-KEY
+of	O
+the	O
+proposed	O
+formulation	O
+.	O
+In	O
+particular	O
+,	O
+we	O
+consider	O
+results	O
+for	O
+the	O
+kinematically	B-KEY
+linear	I-KEY
+theory	I-KEY
+as	O
+compared	O
+to	O
+the	O
+kinematically	O
+non-linear	O
+theory	O
+
+Optimal	B-KEY
+learning	I-KEY
+for	O
+patterns	B-KEY
+classification	I-KEY
+in	O
+RBF	B-KEY
+networks	I-KEY
+The	O
+proposed	O
+modifying	O
+of	O
+the	O
+structure	O
+of	O
+the	O
+radial	O
+basis	O
+function	O
+-LRB-	O
+RBF	O
+-RRB-	O
+network	O
+by	O
+introducing	O
+the	O
+weight	O
+matrix	O
+to	O
+the	O
+input	B-KEY
+layer	I-KEY
+-LRB-	O
+in	O
+contrast	O
+to	O
+the	O
+direct	O
+connection	O
+of	O
+the	O
+input	O
+to	O
+the	O
+hidden	O
+layer	O
+of	O
+a	O
+conventional	O
+RBF	O
+-RRB-	O
+so	O
+that	O
+the	O
+training	B-KEY
+space	I-KEY
+in	O
+the	O
+RBF	B-KEY
+network	I-KEY
+is	O
+adaptively	O
+separated	O
+by	O
+the	O
+resultant	O
+decision	B-KEY
+boundaries	I-KEY
+and	O
+class	B-KEY
+regions	I-KEY
+is	O
+reported	O
+.	O
+The	O
+training	O
+of	O
+this	O
+weight	O
+matrix	O
+is	O
+carried	O
+out	O
+as	O
+for	O
+a	O
+single-layer	B-KEY
+perceptron	I-KEY
+together	O
+with	O
+the	O
+clustering	B-KEY
+process	I-KEY
+.	O
+In	O
+this	O
+way	O
+the	O
+network	O
+is	O
+capable	O
+of	O
+dealing	O
+with	O
+complicated	O
+problems	O
+,	O
+which	O
+have	O
+a	O
+high	O
+degree	O
+of	O
+interference	O
+in	O
+the	O
+training	O
+data	O
+,	O
+and	O
+achieves	O
+a	O
+higher	O
+classification	O
+rate	O
+over	O
+the	O
+current	O
+classifiers	O
+using	O
+RBF	O
+
+Global	O
+comparison	O
+of	O
+stages	O
+of	O
+growth	O
+based	O
+on	O
+critical	B-KEY
+success	I-KEY
+factors	I-KEY
+With	O
+increasing	O
+globalization	O
+of	O
+business	O
+,	O
+the	O
+management	O
+of	O
+IT	O
+in	O
+international	O
+organizations	O
+is	O
+faced	O
+with	O
+the	O
+complex	O
+task	O
+of	O
+dealing	O
+with	O
+the	O
+difference	O
+between	O
+local	O
+and	O
+international	B-KEY
+IT	I-KEY
+needs	I-KEY
+.	O
+This	O
+study	O
+evaluates	O
+,	O
+and	O
+compares	O
+,	O
+the	O
+level	O
+of	O
+IT	B-KEY
+maturity	I-KEY
+and	O
+the	O
+critical	B-KEY
+success	I-KEY
+factors	I-KEY
+-LRB-	O
+CSFs	O
+-RRB-	O
+in	O
+selected	O
+geographic	O
+regions	O
+,	O
+namely	O
+,	O
+Norway	B-KEY
+,	O
+Australia/New	O
+Zealand	O
+,	O
+North	O
+America	O
+,	O
+Europe	O
+,	O
+Asia/Pacific	O
+,	O
+and	O
+India	O
+.	O
+The	O
+results	O
+show	O
+that	O
+significant	O
+differences	O
+in	O
+the	O
+IT	B-KEY
+management	I-KEY
+needs	O
+in	O
+these	O
+geographic	O
+regions	O
+exist	O
+,	O
+and	O
+that	O
+the	O
+IT	B-KEY
+management	I-KEY
+operating	O
+in	O
+these	O
+regions	O
+must	O
+balance	O
+the	O
+multiple	O
+critical	B-KEY
+success	I-KEY
+factors	I-KEY
+for	O
+achieving	O
+an	O
+optimal	B-KEY
+local-global	I-KEY
+mix	I-KEY
+for	O
+business	B-KEY
+success	I-KEY
+
+Verifying	O
+concurrent	B-KEY
+systems	I-KEY
+with	O
+symbolic	B-KEY
+execution	I-KEY
+Current	O
+techniques	O
+for	O
+interactively	O
+proving	O
+temporal	B-KEY
+properties	I-KEY
+of	O
+concurrent	B-KEY
+systems	I-KEY
+translate	O
+transition	B-KEY
+systems	I-KEY
+into	O
+temporal	B-KEY
+formulas	I-KEY
+by	O
+introducing	O
+program	B-KEY
+counter	I-KEY
+variables	I-KEY
+.	O
+Proofs	O
+are	O
+not	O
+intuitive	O
+,	O
+because	O
+control	O
+flow	O
+is	O
+not	O
+explicitly	O
+considered	O
+.	O
+For	O
+sequential	B-KEY
+programs	I-KEY
+symbolic	B-KEY
+execution	I-KEY
+is	O
+a	O
+very	O
+intuitive	O
+,	O
+interactive	O
+proof	O
+strategy	O
+.	O
+In	O
+this	O
+paper	O
+we	O
+adopt	O
+this	O
+technique	O
+for	O
+parallel	B-KEY
+programs	I-KEY
+.	O
+Properties	O
+are	O
+formulated	O
+in	O
+interval	O
+temporal	O
+logic	O
+.	O
+An	O
+implementation	O
+in	O
+the	O
+interactive	B-KEY
+theorem	I-KEY
+prover	I-KEY
+KIV	I-KEY
+has	O
+shown	O
+that	O
+this	O
+technique	O
+offers	O
+a	O
+high	O
+degree	O
+of	O
+automation	O
+and	O
+allows	O
+simple	O
+,	O
+local	B-KEY
+invariants	I-KEY
+
+Average	O
+optimization	B-KEY
+of	O
+the	O
+approximate	O
+solution	O
+of	O
+operator	B-KEY
+equations	I-KEY
+and	O
+its	O
+application	O
+In	O
+this	O
+paper	O
+,	O
+a	O
+definition	O
+of	O
+the	O
+optimization	B-KEY
+of	O
+operator	B-KEY
+equations	I-KEY
+in	O
+the	O
+average	B-KEY
+case	I-KEY
+setting	I-KEY
+is	O
+given	O
+.	O
+And	O
+the	O
+general	O
+result	O
+about	O
+the	O
+relevant	O
+optimization	B-KEY
+problem	O
+is	O
+obtained	O
+.	O
+This	O
+result	O
+is	O
+applied	O
+to	O
+the	O
+optimization	B-KEY
+of	O
+approximate	O
+solution	O
+of	O
+some	O
+classes	O
+of	O
+integral	B-KEY
+equations	I-KEY
+
+Contrast	B-KEY
+sensitivity	I-KEY
+in	O
+a	O
+dynamic	B-KEY
+environment	I-KEY
+:	O
+effects	O
+of	O
+target	B-KEY
+conditions	I-KEY
+and	O
+visual	B-KEY
+impairment	I-KEY
+Contrast	B-KEY
+sensitivity	I-KEY
+was	O
+determined	O
+as	O
+a	O
+function	O
+of	O
+target	B-KEY
+velocity	I-KEY
+-LRB-	O
+0	O
+degrees	O
+-120	O
+degrees	O
+/	O
+s	O
+-RRB-	O
+over	O
+a	O
+variety	O
+of	O
+viewing	O
+conditions	O
+.	O
+In	O
+Experiment	O
+1	O
+,	O
+measurements	O
+of	O
+dynamic	B-KEY
+contrast	I-KEY
+sensitivity	I-KEY
+were	O
+determined	O
+for	O
+observers	O
+as	O
+a	O
+function	O
+of	O
+target	O
+velocity	O
+for	O
+letter	O
+stimuli	O
+.	O
+Significant	O
+main	O
+effects	O
+were	O
+found	O
+for	O
+target	B-KEY
+velocity	I-KEY
+,	O
+target	B-KEY
+size	I-KEY
+,	O
+and	O
+target	B-KEY
+duration	I-KEY
+,	O
+but	O
+significant	O
+interactions	O
+among	O
+the	O
+variables	O
+indicated	O
+especially	O
+pronounced	O
+adverse	O
+effects	O
+of	O
+increasing	O
+target	B-KEY
+velocity	I-KEY
+for	O
+small	O
+targets	O
+and	O
+brief	O
+durations	O
+.	O
+In	O
+Experiment	O
+2	O
+,	O
+the	O
+effects	O
+of	O
+simulated	O
+cataracts	O
+were	O
+determined	O
+.	O
+Although	O
+the	O
+simulated	O
+impairment	O
+had	O
+no	O
+effect	O
+on	O
+traditional	O
+acuity	B-KEY
+scores	I-KEY
+,	O
+dynamic	B-KEY
+contrast	I-KEY
+sensitivity	I-KEY
+was	O
+markedly	O
+reduced	O
+.	O
+Results	O
+are	O
+discussed	O
+in	O
+terms	O
+of	O
+dynamic	B-KEY
+contrast	I-KEY
+sensitivity	I-KEY
+as	O
+a	O
+useful	O
+composite	O
+measure	O
+of	O
+visual	O
+functioning	O
+that	O
+may	O
+provide	O
+a	O
+better	O
+overall	O
+picture	O
+of	O
+an	O
+individual	O
+'s	O
+visual	O
+functioning	O
+than	O
+does	O
+traditional	O
+static	O
+acuity	O
+,	O
+dynamic	O
+acuity	O
+,	O
+or	O
+contrast	O
+sensitivity	O
+alone	O
+.	O
+The	O
+measure	O
+of	O
+dynamic	B-KEY
+contrast	I-KEY
+sensitivity	I-KEY
+may	O
+increase	O
+understanding	O
+of	O
+the	O
+practical	O
+effects	O
+of	O
+various	O
+conditions	O
+,	O
+such	O
+as	O
+aging	O
+or	O
+disease	O
+,	O
+on	O
+the	O
+visual	O
+system	O
+,	O
+or	O
+it	O
+may	O
+allow	O
+improved	O
+prediction	O
+of	O
+individuals	O
+'	O
+performance	O
+in	O
+visually	O
+dynamic	O
+situations	O
+
+Optimal	B-KEY
+strategies	I-KEY
+for	O
+a	O
+semi-Markovian	B-KEY
+inventory	I-KEY
+system	I-KEY
+Control	O
+for	O
+a	O
+semi-Markovian	B-KEY
+inventory	I-KEY
+system	I-KEY
+is	O
+considered	O
+.	O
+Under	O
+general	O
+assumptions	O
+on	O
+system	B-KEY
+functioning	I-KEY
+,	O
+conditions	O
+for	O
+existence	O
+of	O
+an	O
+optimal	B-KEY
+nonrandomized	I-KEY
+Markovian	I-KEY
+strategy	I-KEY
+are	O
+found	O
+.	O
+It	O
+is	O
+shown	O
+that	O
+under	O
+some	O
+additional	O
+assumptions	O
+on	O
+storing	O
+conditions	O
+for	O
+the	O
+inventory	O
+,	O
+the	O
+optimal	B-KEY
+strategy	I-KEY
+has	O
+a	O
+threshold	O
+-LRB-	O
+s	O
+,	O
+S	O
+-RRB-	O
+-	O
+frame	O
+
+A	O
+numerical	O
+C/sup	O
+1	O
+/	O
+-	O
+shadowing	O
+result	O
+for	O
+retarded	B-KEY
+functional	I-KEY
+differential	I-KEY
+equations	I-KEY
+This	O
+paper	O
+gives	O
+a	O
+numerical	O
+C/sup	O
+1	O
+/	O
+-	O
+shadowing	O
+between	O
+the	O
+exact	B-KEY
+solutions	I-KEY
+of	O
+a	O
+functional	O
+differential	O
+equation	O
+and	O
+its	O
+numerical	B-KEY
+approximations	I-KEY
+.	O
+The	O
+shadowing	O
+result	O
+is	O
+obtained	O
+by	O
+comparing	O
+exact	B-KEY
+solutions	I-KEY
+with	O
+numerical	B-KEY
+approximation	I-KEY
+which	O
+do	O
+not	O
+share	O
+the	O
+same	O
+initial	O
+value	O
+.	O
+Behavior	O
+of	O
+stable	B-KEY
+manifolds	I-KEY
+of	O
+functional	O
+differential	O
+equations	O
+under	O
+numerics	O
+will	O
+follow	O
+from	O
+the	O
+shadowing	O
+result	O
+
+Establishing	O
+an	O
+urban	B-KEY
+digital	I-KEY
+cadastre	I-KEY
+:	O
+analytical	B-KEY
+reconstruction	I-KEY
+of	O
+parcel	B-KEY
+boundaries	I-KEY
+A	O
+new	O
+method	O
+for	O
+generating	O
+a	O
+spatially	O
+accurate	O
+,	O
+legally	O
+supportive	O
+and	O
+operationally	O
+efficient	O
+cadastral	O
+database	O
+of	O
+the	O
+urban	B-KEY
+cadastral	I-KEY
+reality	I-KEY
+is	O
+described	O
+.	O
+The	O
+definition	O
+and	O
+compilation	O
+of	O
+an	O
+accurate	O
+cadastral	O
+database	O
+-LRB-	O
+achieving	O
+a	O
+standard	B-KEY
+deviation	I-KEY
+smaller	O
+than	O
+0.1	O
+m	O
+-RRB-	O
+is	O
+based	O
+on	O
+an	O
+analytical	B-KEY
+reconstruction	I-KEY
+of	O
+cadastral	O
+boundaries	O
+rather	O
+than	O
+on	O
+the	O
+conventional	O
+field	B-KEY
+reconstruction	I-KEY
+process	I-KEY
+.	O
+The	O
+new	O
+method	O
+is	O
+based	O
+on	O
+GPS	B-KEY
+control	I-KEY
+points	I-KEY
+and	O
+traverse	B-KEY
+networks	I-KEY
+for	O
+providing	O
+the	O
+framework	O
+;	O
+the	O
+old	B-KEY
+field	I-KEY
+books	I-KEY
+for	O
+defining	O
+the	O
+links	O
+between	O
+the	O
+various	O
+original	O
+ground	B-KEY
+features	I-KEY
+;	O
+and	O
+a	O
+geometrical	O
+and	O
+cadastral	B-KEY
+adjustment	I-KEY
+process	I-KEY
+as	O
+the	O
+conceptual	O
+basis	O
+.	O
+A	O
+pilot	O
+project	O
+that	O
+was	O
+carried	O
+out	O
+in	O
+order	O
+to	O
+examine	O
+and	O
+evaluate	O
+the	O
+new	O
+method	O
+is	O
+described	O
+
+View	O
+from	O
+the	O
+top	O
+-LSB-	O
+workflow	O
+&	O
+content	B-KEY
+management	I-KEY
+-RSB-	O
+International	B-KEY
+law	I-KEY
+firm	I-KEY
+Linklaters	B-KEY
+has	O
+installed	O
+a	O
+global	O
+document	O
+and	O
+content	B-KEY
+management	I-KEY
+system	O
+that	O
+is	O
+accessible	O
+to	O
+clients	O
+and	O
+which	O
+has	O
+helped	O
+it	O
+move	O
+online	B-KEY
+
+Maple	O
+8	O
+keeps	O
+everyone	O
+happy	O
+The	O
+author	O
+is	O
+impressed	O
+with	O
+the	O
+upgrade	O
+to	O
+the	O
+mathematics	O
+package	O
+Maple	O
+8	O
+,	O
+finding	O
+it	O
+genuinely	O
+useful	O
+to	O
+scientists	O
+and	O
+educators	O
+.	O
+The	O
+developments	O
+Waterloo	O
+Maple	O
+class	O
+as	O
+revolutionary	O
+include	O
+a	O
+student	B-KEY
+calculus	I-KEY
+package	I-KEY
+,	O
+and	O
+Maplets	B-KEY
+.	O
+The	O
+first	O
+provides	O
+a	O
+high-level	B-KEY
+command	I-KEY
+set	I-KEY
+for	O
+calculus	B-KEY
+exploration	I-KEY
+and	O
+plotting	O
+-LRB-	O
+removing	O
+the	O
+need	O
+to	O
+work	O
+with	O
+,	O
+say	O
+,	O
+plot	O
+primitives	O
+-RRB-	O
+.	O
+The	O
+second	O
+is	O
+a	O
+package	O
+for	O
+hand-coding	O
+custom	O
+graphical	O
+user	O
+interfaces	O
+-LRB-	O
+GUIs	B-KEY
+-RRB-	O
+using	O
+elements	O
+such	O
+as	O
+check	O
+boxes	O
+,	O
+radio	O
+buttons	O
+,	O
+slider	O
+bars	O
+and	O
+pull-down	O
+menus	O
+.	O
+When	O
+called	O
+,	O
+a	O
+Maplet	B-KEY
+launches	O
+a	O
+runtime	B-KEY
+Java	I-KEY
+environment	I-KEY
+that	O
+pops	O
+up	O
+a	O
+window-analogous	O
+to	O
+a	O
+Java	O
+applet-to	O
+perform	O
+a	O
+programmed	O
+routine	O
+,	O
+if	O
+required	O
+passing	O
+the	O
+result	O
+back	O
+to	O
+the	O
+Maple	O
+worksheet	O
+
+Quadratic	B-KEY
+Gauss	I-KEY
+sums	I-KEY
+over	O
+finite	B-KEY
+commutative	I-KEY
+rings	I-KEY
+This	O
+article	O
+explicitly	O
+determines	O
+the	O
+quadratic	B-KEY
+Gauss	I-KEY
+sum	I-KEY
+over	O
+finite	B-KEY
+commutative	I-KEY
+rings	I-KEY
+
+A	O
+parallelized	B-KEY
+indexing	I-KEY
+method	I-KEY
+for	O
+large-scale	B-KEY
+case-based	I-KEY
+reasoning	I-KEY
+Case-based	O
+reasoning	O
+-LRB-	O
+CBR	O
+-RRB-	O
+is	O
+a	O
+problem	B-KEY
+solving	I-KEY
+methodology	I-KEY
+commonly	O
+seen	O
+in	O
+artificial	B-KEY
+intelligence	I-KEY
+.	O
+It	O
+can	O
+correctly	O
+take	O
+advantage	O
+of	O
+the	O
+situations	O
+and	O
+methods	O
+in	O
+former	O
+cases	O
+to	O
+find	O
+out	O
+suitable	O
+solutions	O
+for	O
+new	O
+problems	O
+.	O
+CBR	O
+must	O
+accurately	O
+retrieve	O
+similar	O
+prior	O
+cases	O
+for	O
+getting	O
+a	O
+good	O
+performance	B-KEY
+.	O
+In	O
+the	O
+past	O
+,	O
+many	O
+researchers	O
+proposed	O
+useful	O
+technologies	O
+to	O
+handle	O
+this	O
+problem	O
+.	O
+However	O
+,	O
+the	O
+performance	B-KEY
+of	O
+retrieving	O
+similar	O
+cases	O
+may	O
+be	O
+greatly	O
+influenced	O
+by	O
+the	O
+number	O
+of	O
+cases	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+the	O
+performance	B-KEY
+issue	O
+of	O
+large-scale	O
+CBR	O
+is	O
+discussed	O
+and	O
+a	O
+parallelized	O
+indexing	O
+architecture	O
+is	O
+then	O
+proposed	O
+for	O
+efficiently	O
+retrieving	O
+similar	O
+cases	O
+in	O
+large-scale	O
+CBR	O
+.	O
+Several	O
+algorithms	O
+for	O
+implementing	O
+the	O
+proposed	O
+architecture	O
+are	O
+also	O
+described	O
+.	O
+Some	O
+experiments	B-KEY
+are	O
+made	O
+and	O
+the	O
+results	O
+show	O
+the	O
+efficiency	O
+of	O
+the	O
+proposed	O
+method	O
+
+VSAT	B-KEY
+technology	O
+aids	O
+growth	O
+Choosing	O
+to	O
+migrate	O
+to	O
+IP-based	B-KEY
+applications	I-KEY
+also	O
+means	O
+deciding	O
+whether	O
+terrestrial	O
+technologies	O
+such	O
+as	O
+frame	O
+relay	O
+,	O
+DSL	O
+or	O
+``	O
+plain	O
+old	O
+telephone	O
+service	O
+''	O
+-LRB-	O
+POTS	O
+-RRB-	O
+can	O
+provide	O
+the	O
+scalability	O
+,	O
+flexibility	O
+and	O
+high	O
+bandwidth	O
+required	O
+to	O
+support	O
+those	O
+applications	O
+,	O
+and	O
+whether	O
+these	O
+technologies	O
+can	O
+do	O
+so	O
+affordably	O
+.	O
+Each	O
+option	O
+has	O
+its	O
+tradeoffs	O
+.	O
+Also	O
+,	O
+in	O
+each	O
+case	O
+,	O
+retailers	B-KEY
+with	O
+nationwide	O
+chains	O
+have	O
+to	O
+deal	O
+with	O
+multiple	O
+last-mile	O
+service	O
+providers	O
+for	O
+service	O
+installation	O
+and	O
+network	O
+maintenance	O
+.	O
+Because	O
+of	O
+this	O
+,	O
+many	O
+retailers	B-KEY
+are	O
+selecting	O
+two-way	O
+satellite	O
+networking	O
+technology	O
+-LRB-	O
+frequently	O
+referred	O
+to	O
+as	O
+VSAT	B-KEY
+-RRB-	O
+as	O
+the	O
+technology	O
+of	O
+choice	O
+for	O
+always-on	O
+,	O
+nationwide	O
+,	O
+high-speed	O
+connectivity	O
+coupled	O
+with	O
+end-to-end	O
+network	O
+ownership	O
+and	O
+favorable	O
+economics	O
+.	O
+Enterprises	O
+are	O
+adopting	O
+VSAT	B-KEY
+platforms	O
+not	O
+only	O
+for	O
+emerging	O
+IP	O
+and	O
+Web-based	O
+applications	O
+,	O
+but	O
+also	O
+for	O
+mission-critical	O
+,	O
+front-office	O
+functions	O
+such	O
+as	O
+credit	O
+authorization	O
+and	O
+point-of-sale	O
+polling	O
+
+Two-layer	O
+model	O
+for	O
+the	O
+formation	O
+of	O
+states	O
+of	O
+the	O
+hidden	O
+Markov	O
+chains	O
+Procedures	O
+for	O
+the	O
+formation	O
+of	O
+states	O
+of	O
+the	O
+hidden	B-KEY
+Markov	I-KEY
+models	I-KEY
+are	O
+described	O
+.	O
+Formant	B-KEY
+amplitudes	I-KEY
+and	O
+frequencies	O
+are	O
+used	O
+as	O
+state	B-KEY
+features	I-KEY
+.	O
+The	O
+training	O
+strategy	O
+is	O
+presented	O
+that	O
+allows	O
+one	O
+to	O
+calculate	O
+the	O
+parameters	O
+of	O
+conditional	B-KEY
+probabilities	I-KEY
+of	O
+the	O
+generation	O
+of	O
+a	O
+given	O
+formant	O
+set	O
+by	O
+a	O
+given	O
+hidden	B-KEY
+state	I-KEY
+with	O
+the	O
+help	O
+of	O
+the	O
+maximum	B-KEY
+likelihood	I-KEY
+method	I-KEY
+
+Structural	B-KEY
+interpretation	I-KEY
+of	O
+matched	B-KEY
+pole-zero	I-KEY
+discretisation	I-KEY
+Deals	O
+with	O
+matched	B-KEY
+pole-zero	I-KEY
+discretisation	I-KEY
+,	O
+which	O
+has	O
+been	O
+used	O
+in	O
+practice	O
+for	O
+hand	O
+calculations	O
+in	O
+the	O
+digital	O
+redesign	O
+of	O
+continuous-time	B-KEY
+systems	I-KEY
+but	O
+available	O
+only	O
+in	O
+the	O
+transfer-function	O
+form	O
+.	O
+Since	O
+this	O
+form	O
+is	O
+inconvenient	O
+for	O
+characterising	O
+the	O
+time-domain	B-KEY
+properties	I-KEY
+of	O
+sampled-data	B-KEY
+loops	I-KEY
+and	O
+for	O
+computerising	O
+the	O
+design	O
+of	O
+such	O
+systems	O
+,	O
+a	O
+state-space	B-KEY
+formulation	I-KEY
+is	O
+developed	O
+.	O
+Under	O
+the	O
+new	O
+interpretation	O
+,	O
+the	O
+matched	O
+pole-zero	O
+model	O
+is	O
+shown	O
+to	O
+be	O
+structurally	O
+identical	O
+to	O
+a	O
+hold-equivalent	B-KEY
+discrete-time	I-KEY
+model	I-KEY
+,	O
+where	O
+the	O
+generalised	O
+hold	O
+takes	O
+integral	O
+part	O
+,	O
+thus	O
+unifying	O
+the	O
+most	O
+widely	O
+used	O
+discretisation	O
+approaches	O
+.	O
+An	O
+algorithm	O
+for	O
+obtaining	O
+the	O
+generalised	O
+hold	O
+function	O
+is	O
+presented	O
+.	O
+The	O
+hold-equivalent	O
+structure	O
+of	O
+the	O
+matched	O
+pole-zero	O
+model	O
+clarifies	O
+several	O
+discrete-time	O
+system	O
+properties	O
+,	O
+such	O
+as	O
+controllability	B-KEY
+and	O
+observability	B-KEY
+,	O
+and	O
+their	O
+preservation	O
+or	O
+loss	O
+with	O
+a	O
+matched	B-KEY
+pole-zero	I-KEY
+discretisation	I-KEY
+.	O
+With	O
+the	O
+proposed	O
+formulation	O
+,	O
+the	O
+matched	O
+pole-zero	O
+,	O
+hold-equivalent	O
+,	O
+and	O
+mapping	O
+models	O
+can	O
+now	O
+all	O
+be	O
+constructed	O
+with	O
+a	O
+single	O
+schematic	O
+model	O
+
+An	O
+operations	B-KEY
+research	I-KEY
+approach	I-KEY
+to	O
+the	O
+problem	O
+of	O
+the	O
+sugar	B-KEY
+cane	I-KEY
+selection	I-KEY
+Selection	O
+for	O
+superior	B-KEY
+clones	I-KEY
+is	O
+the	O
+most	O
+important	O
+aspect	O
+of	O
+sugar	O
+cane	O
+improvement	B-KEY
+programs	I-KEY
+,	O
+and	O
+is	O
+a	O
+long	O
+and	O
+expensive	O
+process	O
+.	O
+While	O
+studies	O
+have	O
+investigated	O
+different	O
+components	O
+of	O
+selection	O
+independently	O
+,	O
+there	O
+has	O
+not	O
+been	O
+a	O
+whole	O
+system	O
+approach	O
+to	O
+improve	O
+the	O
+process	O
+.	O
+This	O
+study	O
+observes	O
+the	O
+problem	O
+as	O
+an	O
+integrated	O
+system	O
+,	O
+where	O
+if	O
+one	O
+parameter	O
+changes	O
+the	O
+state	O
+of	O
+the	O
+whole	O
+system	O
+changes	O
+.	O
+A	O
+computer	B-KEY
+based	I-KEY
+stochastic	I-KEY
+simulation	I-KEY
+model	I-KEY
+that	O
+accurately	O
+represents	O
+the	O
+selection	O
+was	O
+developed	O
+.	O
+The	O
+paper	O
+describes	O
+the	O
+simulation	O
+model	O
+,	O
+showing	O
+its	O
+accuracy	O
+as	O
+well	O
+as	O
+how	O
+a	O
+combination	O
+of	O
+dynamic	B-KEY
+programming	I-KEY
+and	O
+branch	B-KEY
+and	I-KEY
+bound	I-KEY
+can	O
+be	O
+applied	O
+to	O
+the	O
+model	O
+to	O
+optimise	O
+the	O
+selection	O
+system	O
+,	O
+giving	O
+a	O
+new	O
+application	O
+of	O
+these	O
+techniques	O
+.	O
+The	O
+model	O
+can	O
+be	O
+directly	O
+applied	O
+to	O
+any	O
+region	O
+targeted	O
+by	O
+sugar	O
+cane	O
+breeding	B-KEY
+programs	I-KEY
+or	O
+to	O
+other	O
+clonally	B-KEY
+propagated	I-KEY
+crops	I-KEY
+
+Meeting	O
+of	O
+minds	O
+Technical	B-KEY
+specialists	I-KEY
+need	O
+to	O
+think	O
+about	O
+their	O
+role	O
+in	O
+IT	B-KEY
+projects	I-KEY
+and	O
+how	O
+they	O
+communicate	B-KEY
+with	O
+end-users	B-KEY
+and	O
+other	O
+participants	O
+to	O
+ensure	O
+they	O
+contribute	O
+fully	O
+as	O
+team	O
+members	O
+.	O
+It	O
+is	O
+especially	O
+important	O
+to	O
+communicate	B-KEY
+and	O
+document	O
+trade-offs	O
+that	O
+may	O
+have	O
+to	O
+be	O
+made	O
+,	O
+including	O
+the	O
+rationale	O
+behind	O
+them	O
+,	O
+so	O
+that	O
+if	O
+requirements	O
+change	O
+,	O
+the	O
+impact	O
+and	O
+decisions	O
+can	O
+be	O
+readily	O
+communicated	B-KEY
+to	O
+the	O
+stakeholders	O
+
+Error	O
+resilient	O
+intra	O
+refresh	O
+scheme	O
+for	O
+H.	O
+26L	O
+stream	O
+Recently	O
+much	O
+attention	O
+has	O
+been	O
+focused	O
+on	O
+video	O
+streaming	O
+through	O
+IP-based	B-KEY
+networks	I-KEY
+.	O
+An	O
+error	O
+resilient	O
+RD	O
+intra	B-KEY
+macro-block	I-KEY
+refresh	I-KEY
+scheme	I-KEY
+for	O
+H.	O
+26L	O
+Internet	B-KEY
+video	O
+streaming	O
+is	O
+introduced	O
+.	O
+Various	O
+channel	B-KEY
+simulations	I-KEY
+have	O
+proved	O
+that	O
+this	O
+scheme	O
+is	O
+more	O
+effective	O
+than	O
+those	O
+currently	O
+adopted	O
+in	O
+H.	O
+26L	O
+
+Resolving	O
+Web	O
+user	O
+on	O
+the	O
+fly	O
+Identity	B-KEY
+authentication	I-KEY
+systems	I-KEY
+and	O
+procedures	O
+are	O
+rapidly	O
+becoming	O
+central	O
+issues	O
+in	O
+the	O
+practice	O
+and	O
+study	O
+of	O
+information	B-KEY
+systems	I-KEY
+development	I-KEY
+and	O
+security	O
+.	O
+Requirements	O
+for	O
+Web	B-KEY
+transaction	I-KEY
+security	I-KEY
+-LRB-	O
+WTS	O
+-RRB-	O
+include	O
+strong	O
+authentication	O
+of	O
+a	O
+user	O
+,	O
+non-repudiation	O
+and	O
+encryption	B-KEY
+of	O
+all	O
+traffic	B-KEY
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+present	O
+an	O
+effective	O
+mechanism	O
+involving	O
+two	O
+different	O
+channels	O
+,	O
+which	O
+addresses	O
+the	O
+prime	O
+concerns	O
+involved	O
+in	O
+the	O
+security	O
+of	O
+electronic	B-KEY
+commerce	I-KEY
+transactions	I-KEY
+-LRB-	O
+ECT	O
+-RRB-	O
+viz	O
+.	O
+user	O
+authentication	O
+and	O
+non-repudiation	O
+.	O
+Although	O
+the	O
+product	O
+is	O
+primarily	O
+targeted	O
+to	O
+provide	O
+a	O
+fillip	O
+to	O
+transactions	O
+carried	O
+out	O
+over	O
+the	O
+Web	O
+,	O
+this	O
+product	O
+can	O
+also	O
+be	O
+effectively	O
+used	O
+for	O
+non-Internet	O
+transactions	O
+that	O
+are	O
+carried	O
+out	O
+where	O
+user	O
+authentication	O
+is	O
+required	O
+
+Bivariate	B-KEY
+fractal	I-KEY
+interpolation	I-KEY
+functions	I-KEY
+on	O
+rectangular	B-KEY
+domains	I-KEY
+Non-tensor	O
+product	O
+bivariate	B-KEY
+fractal	I-KEY
+interpolation	I-KEY
+functions	I-KEY
+defined	O
+on	O
+gridded	B-KEY
+rectangular	I-KEY
+domains	I-KEY
+are	O
+constructed	O
+.	O
+Linear	B-KEY
+spaces	I-KEY
+consisting	O
+of	O
+these	O
+functions	O
+are	O
+introduced	O
+.	O
+The	O
+relevant	O
+Lagrange	B-KEY
+interpolation	I-KEY
+problem	I-KEY
+is	O
+discussed	O
+.	O
+A	O
+negative	O
+result	O
+about	O
+the	O
+existence	O
+of	O
+affine	B-KEY
+fractal	I-KEY
+interpolation	I-KEY
+functions	I-KEY
+defined	O
+on	O
+such	O
+domains	O
+is	O
+obtained	O
+
+Electromagnetics	B-KEY
+computations	I-KEY
+using	O
+the	O
+MPI	B-KEY
+parallel	I-KEY
+implementation	I-KEY
+of	O
+the	O
+steepest	B-KEY
+descent	I-KEY
+fast	I-KEY
+multipole	I-KEY
+method	I-KEY
+-LRB-	O
+SDFMM	O
+-RRB-	O
+The	O
+computational	O
+solution	O
+of	O
+large-scale	B-KEY
+linear	I-KEY
+systems	I-KEY
+of	O
+equations	O
+necessitates	O
+the	O
+use	O
+of	O
+fast	B-KEY
+algorithms	I-KEY
+but	O
+is	O
+also	O
+greatly	O
+enhanced	O
+by	O
+employing	O
+parallelization	O
+techniques	O
+.	O
+The	O
+objective	O
+of	O
+this	O
+work	O
+is	O
+to	O
+demonstrate	O
+the	O
+speedup	O
+achieved	O
+by	O
+the	O
+MPI	O
+-LRB-	O
+message	B-KEY
+passing	I-KEY
+interface	I-KEY
+-RRB-	O
+parallel	O
+implementation	O
+of	O
+the	O
+steepest	B-KEY
+descent	I-KEY
+fast	I-KEY
+multipole	I-KEY
+method	I-KEY
+-LRB-	O
+SDFMM	O
+-RRB-	O
+.	O
+Although	O
+this	O
+algorithm	O
+has	O
+already	O
+been	O
+optimized	O
+to	O
+take	O
+advantage	O
+of	O
+the	O
+structure	O
+of	O
+the	O
+physics	B-KEY
+of	O
+scattering	B-KEY
+problems	I-KEY
+,	O
+there	O
+is	O
+still	O
+the	O
+opportunity	O
+to	O
+speed	O
+up	O
+the	O
+calculation	O
+by	O
+dividing	O
+tasks	O
+into	O
+components	O
+using	O
+multiple	B-KEY
+processors	I-KEY
+and	O
+solve	O
+them	O
+in	O
+parallel	O
+.	O
+The	O
+SDFMM	O
+has	O
+three	O
+bottlenecks	O
+ordered	O
+as	O
+-LRB-	O
+1	O
+-RRB-	O
+filling	O
+the	O
+sparse	B-KEY
+impedance	I-KEY
+matrix	I-KEY
+associated	O
+with	O
+the	O
+near-field	O
+method	B-KEY
+of	I-KEY
+moments	I-KEY
+interactions	O
+-LRB-	O
+MoM	O
+-RRB-	O
+,	O
+-LRB-	O
+2	O
+-RRB-	O
+the	O
+matrix	B-KEY
+vector	I-KEY
+multiplications	I-KEY
+associated	O
+with	O
+this	O
+sparse	O
+matrix	O
+and	O
+-LRB-	O
+3	O
+-RRB-	O
+the	O
+far	O
+field	O
+interactions	O
+associated	O
+with	O
+the	O
+fast	O
+multipole	O
+method	O
+.	O
+The	O
+parallel	O
+implementation	O
+task	O
+is	O
+accomplished	O
+using	O
+a	O
+thirty-one	O
+node	O
+Intel	B-KEY
+Pentium	I-KEY
+Beowulf	I-KEY
+cluster	I-KEY
+and	O
+is	O
+also	O
+validated	O
+on	O
+a	O
+4-processor	B-KEY
+Alpha	I-KEY
+workstation	I-KEY
+.	O
+The	O
+Beowulf	O
+cluster	O
+consists	O
+of	O
+thirty-one	O
+nodes	O
+of	O
+350	B-KEY
+MHz	I-KEY
+Intel	B-KEY
+Pentium	I-KEY
+IIs	I-KEY
+with	O
+256	O
+MB	O
+of	O
+RAM	B-KEY
+and	O
+one	O
+node	O
+of	O
+a	O
+4	O
+*	O
+450	B-KEY
+MHz	I-KEY
+Intel	B-KEY
+Pentium	I-KEY
+II	I-KEY
+Xeon	B-KEY
+shared	I-KEY
+memory	I-KEY
+processor	I-KEY
+with	O
+2	O
+GB	O
+of	O
+RAM	B-KEY
+with	O
+all	O
+nodes	O
+connected	O
+to	O
+a	O
+100	B-KEY
+BaseTX	I-KEY
+Ethernet	I-KEY
+network	I-KEY
+.	O
+The	O
+Alpha	O
+workstation	O
+has	O
+a	O
+maximum	O
+of	O
+four	O
+667	B-KEY
+MHz	I-KEY
+processors	O
+.	O
+Our	O
+numerical	O
+results	O
+show	O
+significant	O
+linear	O
+speedup	O
+in	O
+filling	O
+the	O
+sparse	B-KEY
+impedance	I-KEY
+matrix	I-KEY
+.	O
+Using	O
+the	O
+32-processors	O
+on	O
+the	O
+Beowulf	O
+cluster	O
+lead	O
+to	O
+a	O
+7.2	O
+overall	O
+speedup	O
+while	O
+a	O
+2.5	O
+overall	O
+speedup	O
+is	O
+gained	O
+using	O
+the	O
+4-processors	O
+on	O
+the	O
+Alpha	O
+workstation	O
+
+Account	B-KEY
+aggregation	I-KEY
+:	O
+shaping	O
+up	O
+portfolios	O
+CPA	O
+providers	O
+of	O
+financial	B-KEY
+planning	I-KEY
+services	I-KEY
+are	O
+providing	O
+clients	O
+with	O
+a	O
+unified	O
+view	O
+of	O
+their	O
+investments	O
+
+Single	O
+and	O
+multi-interval	O
+Legendre	O
+tau	O
+-	O
+methods	O
+in	O
+time	O
+for	O
+parabolic	B-KEY
+equations	I-KEY
+In	O
+this	O
+paper	O
+,	O
+we	O
+take	O
+the	O
+parabolic	B-KEY
+equation	I-KEY
+with	O
+periodic	B-KEY
+boundary	I-KEY
+conditions	I-KEY
+as	O
+a	O
+model	O
+to	O
+present	O
+a	O
+spectral	O
+method	O
+with	O
+the	O
+Fourier	B-KEY
+approximation	I-KEY
+in	O
+spatial	O
+and	O
+single/multi-interval	O
+Legendre	B-KEY
+Petrov-Galerkin	I-KEY
+methods	I-KEY
+in	O
+time	O
+.	O
+For	O
+the	O
+single	O
+interval	B-KEY
+spectral	I-KEY
+method	I-KEY
+in	O
+time	O
+,	O
+we	O
+obtain	O
+the	O
+optimal	B-KEY
+error	I-KEY
+estimate	I-KEY
+in	O
+L/sup	O
+2	O
+/	O
+-	O
+norm	O
+.	O
+For	O
+the	O
+multi-interval	O
+spectral	O
+method	O
+in	O
+time	O
+,	O
+the	O
+L/sup	O
+2	O
+/	O
+-	O
+optimal	O
+error	O
+estimate	O
+is	O
+valid	O
+in	O
+spatial	O
+.	O
+Numerical	O
+results	O
+show	O
+the	O
+efficiency	O
+of	O
+the	O
+methods	O
+
+VONNA	O
+-LRB-	O
+HBP	O
+-RRB-	O
+:	O
+a	O
+multimedia	B-KEY
+learning	I-KEY
+package	I-KEY
+on	O
+hotel	B-KEY
+budget	I-KEY
+planning	I-KEY
+In	O
+this	O
+paper	O
+,	O
+a	O
+new	O
+learning	O
+package	O
+,	O
+VONNA	O
+-LRB-	O
+HBP	O
+-RRB-	O
+,	O
+which	O
+provides	O
+an	O
+interactive	O
+and	O
+online	O
+environment	O
+for	O
+novices	O
+to	O
+study	O
+and	O
+practice	O
+hotel	B-KEY
+budget	I-KEY
+planning	I-KEY
+,	O
+is	O
+introduced	O
+.	O
+Its	O
+design	O
+philosophy	O
+will	O
+be	O
+discussed	O
+thoughtfully	O
+with	O
+special	O
+focus	O
+on	O
+how	O
+to	O
+make	O
+use	O
+of	O
+the	O
+multimedia	O
+and	O
+Internet	B-KEY
+.	O
+According	O
+to	O
+literatures	O
+,	O
+learning	O
+packages	O
+are	O
+faced	O
+to	O
+be	O
+more	O
+effective	O
+in	O
+delivering	O
+teaching	O
+material	O
+.	O
+Researchers	O
+indicate	O
+that	O
+students	O
+using	O
+a	O
+self-paced	B-KEY
+learning	I-KEY
+package	I-KEY
+score	O
+higher	O
+than	O
+in	O
+a	O
+traditional	O
+classroom	O
+setting	O
+.	O
+Moreover	O
+,	O
+the	O
+learning	O
+package	O
+provides	O
+different	O
+scenarios	O
+for	O
+students	O
+to	O
+explore	O
+themselves	O
+in	O
+a	O
+practical	O
+environment	O
+and	O
+is	O
+more	O
+cost	O
+effective	O
+and	O
+systematic	O
+than	O
+lectures	O
+.	O
+Currently	O
+,	O
+most	O
+learning	O
+packages	O
+in	O
+hotel	B-KEY
+education	I-KEY
+are	O
+not	O
+implemented	O
+using	O
+multimedia	O
+with	O
+Internet	B-KEY
+access	O
+.	O
+Our	O
+paper	O
+describes	O
+a	O
+new	O
+learning	O
+package	O
+that	O
+fills	O
+the	O
+gaps	O
+.	O
+VONNA	O
+-LRB-	O
+HBP	O
+-RRB-	O
+requires	O
+participants	O
+to	O
+investigate	O
+operational	O
+budgets	O
+on	O
+various	O
+areas	O
+such	O
+as	O
+sales	B-KEY
+levels	O
+,	O
+payroll	B-KEY
+,	O
+inventory	B-KEY
+level	O
+,	O
+promotion	B-KEY
+strategies	I-KEY
+,	O
+and	O
+facilities	B-KEY
+planning	I-KEY
+,	O
+etc.	O
+.	O
+Eventually	O
+,	O
+the	O
+students/novices	O
+are	O
+required	O
+to	O
+practice	O
+their	O
+skills	O
+in	O
+a	O
+comprehensive	O
+case	O
+about	O
+a	O
+hypothetical	O
+hotel	O
+.	O
+They	O
+need	O
+to	O
+solve	O
+managerial	B-KEY
+problems	I-KEY
+by	O
+a	O
+combination	O
+of	O
+budgetary	O
+planning	O
+on	O
+human	B-KEY
+resources	I-KEY
+,	O
+staff	B-KEY
+training	I-KEY
+programmes	I-KEY
+,	O
+facilities	O
+'	O
+maintenance	O
+and	O
+replacement	O
+,	O
+or	O
+promotion	O
+schemes	O
+.	O
+Analytical	O
+tools	O
+are	O
+available	O
+for	O
+students/novices	O
+to	O
+judge	O
+an	O
+appropriate	O
+decision	O
+in	O
+handling	O
+constrained	O
+resources	O
+
+An	O
+empirical	O
+investigation	O
+of	O
+the	O
+influences	O
+of	O
+the	O
+degree	O
+of	O
+interactivity	B-KEY
+on	O
+user-outcomes	O
+in	O
+a	O
+multimedia	O
+environment	O
+The	O
+study	O
+reported	O
+here	O
+investigates	O
+the	O
+influence	O
+of	O
+``	O
+interactivity	B-KEY
+''	O
+on	O
+the	O
+learning	B-KEY
+outcomes	I-KEY
+of	O
+users	O
+in	O
+a	O
+multimedia	B-KEY
+systems	I-KEY
+environment	I-KEY
+.	O
+Drawing	O
+from	O
+past	O
+literature	O
+base	O
+and	O
+based	O
+on	O
+key	O
+tenets	O
+of	O
+three	O
+learning	O
+theories	O
+-	O
+behaviorist	O
+,	O
+cognitivist	O
+,	O
+and	O
+constructivist	O
+-	O
+the	O
+study	O
+first	O
+proposes	O
+a	O
+measurement	B-KEY
+scheme	I-KEY
+for	O
+``	O
+interactivity	B-KEY
+''	O
+and	O
+then	O
+hypothesizes	O
+that	O
+``	O
+interactivity	B-KEY
+''	O
+would	O
+influence	O
+the	O
+learning	B-KEY
+outcomes	I-KEY
+positively	O
+in	O
+terms	O
+of	O
+users	O
+'	O
+learning	O
+achievement	O
+and	O
+attitude	O
+.	O
+Three	O
+prototypes	O
+of	O
+a	O
+multimedia	O
+instructional/training	O
+system	O
+to	O
+represent	O
+high	O
+,	O
+low	O
+,	O
+and	O
+noninteractive	O
+modes	O
+of	O
+use	O
+were	O
+developed	O
+and	O
+implemented	O
+and	O
+the	O
+hypothesized	O
+influences	O
+were	O
+investigated	O
+using	O
+a	O
+controlled	O
+laboratory	O
+research	O
+design	O
+.	O
+Multiple	B-KEY
+analysis	I-KEY
+of	I-KEY
+variance	I-KEY
+-LRB-	O
+MANOVA	B-KEY
+-RRB-	O
+results	O
+indicate	O
+that	O
+while	O
+interactivity	B-KEY
+does	O
+not	O
+necessarily	O
+enable	O
+enhanced	O
+gain	O
+in	O
+user	O
+learning	O
+,	O
+it	O
+positively	O
+influences	O
+participants	O
+'	O
+attitude	O
+.	O
+The	O
+study	O
+finds	O
+no	O
+support	O
+for	O
+hypothesized	O
+moderating	O
+effects	O
+of	O
+learning	O
+styles	O
+-LRB-	O
+measured	O
+using	O
+Kolb	O
+'s	O
+Learning	O
+Style	O
+Inventory	O
+scale	O
+-RRB-	O
+on	O
+the	O
+relationship	O
+between	O
+interactivity	B-KEY
+and	O
+user	B-KEY
+outcomes	I-KEY
+.	O
+The	O
+results	O
+of	O
+this	O
+study	O
+have	O
+important	O
+implications	O
+for	O
+both	O
+education	B-KEY
+and	O
+corporations	B-KEY
+'	O
+training	O
+efforts	O
+and	O
+investments	O
+.	O
+Implications	O
+and	O
+future	O
+research	O
+directions	O
+are	O
+discussed	O
+
+Max	O
+and	O
+min	B-KEY
+limiters	I-KEY
+If	O
+A	O
+contained	O
+in	O
+omega	O
+,	O
+n	O
+>	O
+or	O
+=	O
+2	O
+,	O
+and	O
+the	O
+function	O
+max	O
+-LRB-	O
+-LCB-	O
+x/sub	O
+1	O
+/	O
+,	O
+...	O
+,	O
+x/sub	O
+n	O
+/	O
+-RCB-	O
+intersection	O
+A	O
+-RRB-	O
+is	O
+partial	O
+recursive	O
+,	O
+it	O
+is	O
+easily	O
+seen	O
+that	O
+A	O
+is	O
+recursive	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+weaken	O
+this	O
+hypothesis	O
+in	O
+various	O
+ways	O
+-LRB-	O
+and	O
+similarly	O
+for	O
+``	O
+min	O
+''	O
+in	O
+place	O
+of	O
+``	O
+max	O
+''	O
+-RRB-	O
+and	O
+investigate	O
+what	O
+effect	O
+this	O
+has	O
+on	O
+the	O
+complexity	B-KEY
+of	O
+A	O
+.	O
+We	O
+discover	O
+a	O
+sharp	O
+contrast	O
+between	O
+retraceable	O
+and	O
+co-retraceable	O
+sets	O
+,	O
+and	O
+we	O
+characterize	O
+sets	O
+which	O
+are	O
+the	O
+union	O
+of	O
+a	O
+recursive	O
+set	O
+and	O
+a	O
+co-r.e.	O
+,	O
+retraceable	O
+set	O
+.	O
+Most	O
+of	O
+our	O
+proofs	O
+are	O
+noneffective	O
+.	O
+Several	O
+open	O
+questions	O
+are	O
+raised	O
+
+Dual	O
+nature	O
+of	O
+mass	O
+multi-agent	O
+systems	O
+Dual	O
+nature	O
+of	O
+mass	O
+multi-agent	O
+systems	O
+-LRB-	O
+mMAS	O
+-RRB-	O
+emerging	O
+as	O
+an	O
+internal	O
+discord	O
+of	O
+two	O
+spheres	O
+-	O
+micro	O
+-LRB-	O
+virtual	O
+-RRB-	O
+consisting	O
+of	O
+agents	O
+and	O
+their	O
+internal	O
+phenomena	O
+,	O
+and	O
+macro	O
+arising	O
+at	O
+the	O
+interface	O
+to	O
+the	O
+real	O
+world	O
+$	O
+stems	O
+the	O
+necessity	O
+of	O
+a	O
+new	O
+approach	O
+to	O
+analysis	O
+,	O
+design	O
+and	O
+utilisation	O
+of	O
+such	O
+systems	O
+.	O
+Based	O
+on	O
+the	O
+concept	O
+of	O
+VR	B-KEY
+decomposition	I-KEY
+,	O
+the	O
+problem	O
+of	O
+management	O
+of	O
+such	O
+systems	O
+is	O
+discussed	O
+.	O
+As	O
+a	O
+sub-type	O
+that	O
+makes	O
+mMAS	O
+closer	O
+to	O
+the	O
+application	O
+sphere	O
+,	O
+an	O
+evolutionary	O
+multi-agent	O
+system	O
+-LRB-	O
+EMAS	O
+-RRB-	O
+is	O
+proposed	O
+.	O
+EMAS	O
+combines	O
+features	O
+of	O
+mMAS	O
+with	O
+advantages	O
+of	O
+an	O
+evolutionary	O
+model	O
+of	O
+computation	O
+.	O
+As	O
+an	O
+illustration	O
+of	O
+this	O
+consideration	O
+two	O
+particular	O
+EMAS	O
+are	O
+presented	O
+,	O
+which	O
+allow	O
+us	O
+to	O
+obtain	O
+promising	O
+results	O
+in	O
+the	O
+fields	O
+of	O
+multiobjective	B-KEY
+optimisation	I-KEY
+and	O
+time-series	B-KEY
+prediction	I-KEY
+,	O
+and	O
+thus	O
+justify	O
+the	O
+approach	O
+
+Impact	O
+of	O
+aviation	O
+highway-in-the-sky	B-KEY
+displays	I-KEY
+on	O
+pilot	B-KEY
+situation	B-KEY
+awareness	I-KEY
+Thirty-six	O
+pilots	B-KEY
+-LRB-	O
+31	O
+men	O
+,	O
+5	O
+women	O
+-RRB-	O
+were	O
+tested	O
+in	O
+a	O
+flight	B-KEY
+simulator	I-KEY
+on	O
+their	O
+ability	O
+to	O
+intercept	O
+a	O
+pathway	O
+depicted	O
+on	O
+a	O
+highway-in-the-sky	O
+-LRB-	O
+HITS	O
+-RRB-	O
+display	O
+.	O
+While	O
+intercepting	O
+and	O
+flying	O
+the	O
+pathway	O
+,	O
+pilots	B-KEY
+were	O
+required	O
+to	O
+watch	O
+for	O
+traffic	O
+outside	O
+the	O
+cockpit	B-KEY
+.	O
+Additionally	O
+,	O
+pilots	B-KEY
+were	O
+tested	O
+on	O
+their	O
+awareness	O
+of	O
+speed	O
+,	O
+altitude	O
+,	O
+and	O
+heading	O
+during	O
+the	O
+flight	O
+.	O
+Results	O
+indicated	O
+that	O
+the	O
+presence	O
+of	O
+a	O
+flight	B-KEY
+guidance	I-KEY
+cue	O
+significantly	O
+improved	O
+flight	B-KEY
+path	I-KEY
+awareness	I-KEY
+while	O
+intercepting	O
+the	O
+pathway	O
+,	O
+but	O
+significant	O
+practice	O
+effects	O
+suggest	O
+that	O
+a	O
+guidance	O
+cue	O
+might	O
+be	O
+unnecessary	O
+if	O
+pilots	B-KEY
+are	O
+given	O
+proper	O
+training	O
+.	O
+The	O
+amount	O
+of	O
+time	O
+spent	O
+looking	O
+outside	O
+the	O
+cockpit	B-KEY
+while	O
+using	O
+the	O
+HITS	O
+display	O
+was	O
+significantly	O
+less	O
+than	O
+when	O
+using	O
+conventional	O
+aircraft	O
+instruments	O
+.	O
+Additionally	O
+,	O
+awareness	O
+of	O
+flight	O
+information	O
+present	O
+on	O
+the	O
+HITS	O
+display	O
+was	O
+poor	O
+.	O
+Actual	O
+or	O
+potential	O
+applications	O
+of	O
+this	O
+research	O
+include	O
+guidance	O
+for	O
+the	O
+development	O
+of	O
+perspective	O
+flight	O
+display	O
+standards	O
+and	O
+as	O
+a	O
+basis	O
+for	O
+flight	O
+training	O
+requirements	O
+
+User-appropriate	O
+tyre-modelling	O
+for	O
+vehicle	B-KEY
+dynamics	I-KEY
+in	O
+standard	O
+and	O
+limit	B-KEY
+situations	I-KEY
+When	O
+modelling	O
+vehicles	O
+for	O
+the	O
+vehicle	B-KEY
+dynamic	I-KEY
+simulation	O
+,	O
+special	O
+attention	O
+must	O
+be	O
+paid	O
+to	O
+the	O
+modelling	O
+of	O
+tyre	O
+forces	O
+and	O
+-	O
+torques	O
+,	O
+according	O
+to	O
+their	O
+dominant	O
+influence	O
+on	O
+the	O
+results	O
+.	O
+This	O
+task	O
+is	O
+not	O
+only	O
+about	O
+sufficiently	O
+exact	O
+representation	O
+of	O
+the	O
+effective	O
+forces	O
+but	O
+also	O
+about	O
+user-friendly	O
+and	O
+practical	O
+relevant	O
+applicability	O
+,	O
+especially	O
+when	O
+the	O
+experimental	O
+tyre-input-data	O
+is	O
+incomplete	O
+or	O
+missing	O
+.	O
+This	O
+text	O
+firstly	O
+describes	O
+the	O
+basics	O
+of	O
+the	O
+vehicle	B-KEY
+dynamic	I-KEY
+tyre	B-KEY
+model	I-KEY
+,	O
+conceived	O
+to	O
+be	O
+a	O
+physically	O
+based	O
+,	O
+semi-empirical	B-KEY
+model	I-KEY
+for	O
+application	O
+in	O
+connection	O
+with	O
+multi-body-systems	B-KEY
+-LRB-	O
+MBS	O
+-RRB-	O
+.	O
+On	O
+the	O
+basis	O
+of	O
+tyres	O
+for	O
+a	O
+passenger	B-KEY
+car	I-KEY
+and	O
+a	O
+heavy	B-KEY
+truck	I-KEY
+the	O
+simulated	B-KEY
+steady	I-KEY
+state	I-KEY
+tyre	I-KEY
+characteristics	I-KEY
+are	O
+shown	O
+together	O
+and	O
+compared	O
+with	O
+the	O
+underlying	O
+experimental	O
+values	O
+.	O
+The	O
+possibility	O
+to	O
+link	O
+the	O
+tyre	B-KEY
+model	I-KEY
+TMeasy	B-KEY
+to	O
+any	O
+MBS-program	O
+is	O
+described	O
+,	O
+as	O
+far	O
+as	O
+it	O
+supports	O
+the	O
+`	O
+Standard	B-KEY
+Tyre	I-KEY
+Interface	I-KEY
+'	O
+.	O
+As	O
+an	O
+example	O
+,	O
+the	O
+simulated	O
+and	O
+experimental	O
+data	O
+of	O
+a	O
+heavy	B-KEY
+truck	I-KEY
+doing	O
+a	O
+standardized	B-KEY
+driving	I-KEY
+manoeuvre	I-KEY
+are	O
+compared	O
+
+On	O
+a	O
+general	B-KEY
+constitutive	I-KEY
+description	I-KEY
+for	O
+the	O
+inelastic	O
+and	O
+failure	B-KEY
+behavior	I-KEY
+of	O
+fibrous	B-KEY
+laminates	I-KEY
+.	O
+II	O
+.	O
+Laminate	B-KEY
+theory	I-KEY
+and	O
+applications	O
+For	O
+pt	O
+.	O
+I	O
+see	O
+ibid.	O
+,	O
+pp.	O
+1159-76	O
+.	O
+The	O
+two	O
+papers	O
+report	O
+systematically	O
+a	O
+constitutive	O
+description	O
+for	O
+the	O
+inelastic	O
+and	O
+strength	B-KEY
+behavior	I-KEY
+of	O
+laminated	O
+composites	B-KEY
+reinforced	O
+with	O
+various	O
+fiber	B-KEY
+preforms	I-KEY
+.	O
+The	O
+constitutive	O
+relationship	O
+is	O
+established	O
+micromechanically	B-KEY
+,	O
+through	O
+layer-by-layer	B-KEY
+analysis	I-KEY
+.	O
+Namely	O
+,	O
+only	O
+the	O
+properties	O
+of	O
+the	O
+constituent	O
+fiber	O
+and	O
+matrix	B-KEY
+materials	I-KEY
+of	O
+the	O
+composites	B-KEY
+are	O
+required	O
+as	O
+input	O
+data	O
+.	O
+In	O
+the	O
+previous	O
+part	O
+lamina	O
+theory	O
+was	O
+presented	O
+.	O
+Three	O
+fundamental	O
+quantities	O
+of	O
+the	O
+laminae	O
+,	O
+i.e.	O
+the	O
+internal	B-KEY
+stresses	I-KEY
+generated	O
+in	O
+the	O
+constituent	O
+fiber	O
+and	O
+matrix	B-KEY
+materials	I-KEY
+and	O
+the	O
+instantaneous	B-KEY
+compliance	I-KEY
+matrix	I-KEY
+,	O
+with	O
+different	O
+fiber	B-KEY
+preform	I-KEY
+-LRB-	O
+including	O
+woven	O
+,	O
+braided	O
+,	O
+and	O
+knitted	O
+fabric	O
+-RRB-	O
+reinforcements	O
+were	O
+explicitly	O
+obtained	O
+by	O
+virtue	O
+of	O
+the	O
+bridging	O
+micromechanics	B-KEY
+model	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+the	O
+laminate	O
+stress	B-KEY
+analysis	I-KEY
+is	O
+shown	O
+.	O
+The	O
+purpose	O
+of	O
+this	O
+analysis	O
+is	O
+to	O
+determine	O
+the	O
+load	B-KEY
+shared	O
+by	O
+each	O
+lamina	O
+in	O
+the	O
+laminate	O
+,	O
+so	O
+that	O
+the	O
+lamina	O
+theory	O
+can	O
+be	O
+applied	O
+.	O
+Incorporation	O
+of	O
+the	O
+constitutive	O
+equations	O
+into	O
+an	O
+FEM	B-KEY
+software	I-KEY
+package	I-KEY
+is	O
+illustrated	O
+.	O
+A	O
+number	O
+of	O
+application	O
+examples	O
+are	O
+given	O
+to	O
+demonstrate	O
+the	O
+efficiency	O
+of	O
+the	O
+constitutive	O
+theory	O
+.	O
+The	O
+predictions	O
+made	O
+include	O
+:	O
+failure	B-KEY
+envelopes	I-KEY
+of	O
+multidirectional	B-KEY
+laminates	I-KEY
+subjected	O
+to	O
+biaxial	B-KEY
+in-plane	I-KEY
+loads	I-KEY
+,	O
+thermomechanical	O
+cycling	O
+stress-strain	O
+curves	O
+of	O
+a	O
+titanium	O
+metal	O
+matrix	O
+composite	O
+laminate	O
+,	O
+S-N	O
+curves	O
+of	O
+multilayer	O
+knitted	O
+fabric	O
+reinforced	O
+laminates	O
+under	O
+tensile	O
+fatigue	O
+,	O
+and	O
+bending	O
+load-deflection	O
+plots	O
+and	O
+ultimate	O
+bending	O
+strengths	O
+of	O
+laminated	O
+braided	O
+fabric	O
+reinforced	O
+beams	O
+subjected	O
+to	O
+lateral	O
+loads	O
+
+An	O
+optimization	B-KEY
+approach	O
+to	O
+plan	O
+for	O
+reusable	B-KEY
+software	I-KEY
+components	I-KEY
+It	O
+is	O
+well	O
+acknowledged	O
+in	O
+software	B-KEY
+engineering	I-KEY
+that	O
+there	O
+is	O
+a	O
+great	O
+potential	O
+for	O
+accomplishing	O
+significant	O
+productivity	B-KEY
+improvements	I-KEY
+through	O
+the	O
+implementation	O
+of	O
+a	O
+successful	O
+software	B-KEY
+reuse	I-KEY
+program	I-KEY
+.	O
+On	O
+the	O
+other	O
+hand	O
+,	O
+such	O
+gains	O
+are	O
+attainable	O
+only	O
+by	O
+instituting	O
+detailed	O
+action	B-KEY
+plans	I-KEY
+at	O
+both	O
+the	O
+organizational	O
+and	O
+program	O
+level	O
+.	O
+Given	O
+this	O
+need	O
+,	O
+the	O
+paucity	O
+of	O
+research	O
+papers	O
+related	O
+to	O
+planning	O
+,	O
+and	O
+in	O
+particular	O
+,	O
+optimized	B-KEY
+planning	O
+is	O
+surprising	O
+.	O
+This	O
+research	O
+,	O
+which	O
+is	O
+aimed	O
+at	O
+this	O
+gap	O
+,	O
+brings	O
+out	O
+an	O
+application	O
+of	O
+optimization	B-KEY
+for	O
+the	O
+planning	O
+of	O
+reusable	B-KEY
+software	I-KEY
+components	I-KEY
+-LRB-	O
+SCs	O
+-RRB-	O
+.	O
+We	O
+present	O
+a	O
+model	O
+that	O
+selects	O
+a	O
+set	O
+of	O
+SCs	O
+that	O
+must	O
+be	O
+built	O
+,	O
+in	O
+order	O
+to	O
+lower	O
+development	O
+and	O
+adaptation	B-KEY
+costs	I-KEY
+.	O
+We	O
+also	O
+provide	O
+implications	O
+to	O
+project	B-KEY
+management	I-KEY
+based	O
+on	O
+simulation	B-KEY
+,	O
+an	O
+approach	O
+that	O
+has	O
+been	O
+adopted	O
+by	O
+other	O
+cost	O
+models	O
+in	O
+the	O
+software	B-KEY
+engineering	I-KEY
+literature	O
+.	O
+Such	O
+a	O
+prescriptive	O
+model	O
+does	O
+not	O
+exist	O
+in	O
+the	O
+literature	O
+
+Research	O
+challenges	O
+and	O
+perspectives	O
+of	O
+the	O
+Semantic	B-KEY
+Web	I-KEY
+Accessing	O
+documents	O
+and	O
+services	O
+on	O
+today	O
+'s	O
+Web	O
+requires	O
+human	O
+intelligence	O
+.	O
+The	O
+interface	O
+to	O
+these	O
+documents	O
+and	O
+services	O
+is	O
+the	O
+Web	B-KEY
+page	I-KEY
+,	O
+written	O
+in	O
+natural	B-KEY
+language	I-KEY
+,	O
+which	O
+humans	O
+must	O
+understand	O
+and	O
+act	O
+upon	O
+.	O
+The	O
+paper	O
+discusses	O
+the	O
+Semantic	B-KEY
+Web	I-KEY
+which	O
+will	O
+augment	O
+the	O
+current	O
+Web	O
+with	O
+formalized	B-KEY
+knowledge	I-KEY
+and	O
+data	O
+that	O
+computers	O
+can	O
+process	O
+.	O
+In	O
+the	O
+future	O
+,	O
+some	O
+services	O
+will	O
+mix	O
+human-readable	O
+and	O
+structured	O
+data	O
+so	O
+that	O
+both	O
+humans	O
+and	O
+computers	O
+can	O
+use	O
+them	O
+.	O
+Others	O
+will	O
+support	O
+formalized	B-KEY
+knowledge	I-KEY
+that	O
+only	O
+machines	O
+will	O
+use	O
+
+Neural	O
+and	O
+neuro-fuzzy	B-KEY
+integration	I-KEY
+in	O
+a	O
+knowledge-based	B-KEY
+system	I-KEY
+for	O
+air	B-KEY
+quality	I-KEY
+prediction	I-KEY
+We	O
+propose	O
+a	O
+unified	O
+approach	O
+for	O
+integrating	O
+implicit	O
+and	O
+explicit	O
+knowledge	O
+in	O
+neurosymbolic	B-KEY
+systems	I-KEY
+as	O
+a	O
+combination	O
+of	O
+neural	O
+and	O
+neuro-fuzzy	O
+modules	O
+.	O
+In	O
+the	O
+developed	O
+hybrid	B-KEY
+system	I-KEY
+,	O
+a	O
+training	B-KEY
+data	I-KEY
+set	I-KEY
+is	O
+used	O
+for	O
+building	O
+neuro-fuzzy	O
+modules	O
+,	O
+and	O
+represents	O
+implicit	O
+domain	O
+knowledge	O
+.	O
+The	O
+explicit	O
+domain	O
+knowledge	O
+on	O
+the	O
+other	O
+hand	O
+is	O
+represented	O
+by	O
+fuzzy	B-KEY
+rules	I-KEY
+,	O
+which	O
+are	O
+directly	O
+mapped	O
+into	O
+equivalent	O
+neural	O
+structures	O
+.	O
+The	O
+aim	O
+of	O
+this	O
+approach	O
+is	O
+to	O
+improve	O
+the	O
+abilities	O
+of	O
+modular	O
+neural	O
+structures	O
+,	O
+which	O
+are	O
+based	O
+on	O
+incomplete	B-KEY
+learning	I-KEY
+data	O
+sets	O
+,	O
+since	O
+the	O
+knowledge	O
+acquired	O
+from	O
+human	O
+experts	O
+is	O
+taken	O
+into	O
+account	O
+for	O
+adapting	O
+the	O
+general	O
+neural	B-KEY
+architecture	I-KEY
+.	O
+Three	O
+methods	O
+to	O
+combine	O
+the	O
+explicit	O
+and	O
+implicit	O
+knowledge	O
+modules	O
+are	O
+proposed	O
+.	O
+The	O
+techniques	O
+used	O
+to	O
+extract	O
+fuzzy	B-KEY
+rules	I-KEY
+from	O
+neural	O
+implicit	O
+knowledge	O
+modules	O
+are	O
+described	O
+.	O
+These	O
+techniques	O
+improve	O
+the	O
+structure	O
+and	O
+the	O
+behavior	O
+of	O
+the	O
+entire	O
+system	O
+.	O
+The	O
+proposed	O
+methodology	O
+has	O
+been	O
+applied	O
+in	O
+the	O
+field	O
+of	O
+air	B-KEY
+quality	I-KEY
+prediction	I-KEY
+with	O
+very	O
+encouraging	O
+results	O
+.	O
+These	O
+experiments	B-KEY
+show	O
+that	O
+the	O
+method	O
+is	O
+worth	O
+further	O
+investigation	O
+
+Stabilization	O
+of	O
+positive	B-KEY
+systems	I-KEY
+with	O
+first	B-KEY
+integrals	I-KEY
+Positive	B-KEY
+systems	I-KEY
+possessing	O
+first	B-KEY
+integrals	I-KEY
+are	O
+considered	O
+.	O
+These	O
+systems	O
+frequently	O
+occur	O
+in	O
+applications	O
+.	O
+The	O
+paper	O
+is	O
+devoted	O
+to	O
+two	O
+stabilization	O
+problems	O
+.	O
+The	O
+first	O
+is	O
+concerned	O
+with	O
+the	O
+design	O
+of	O
+feedbacks	O
+to	O
+stabilize	O
+a	O
+given	O
+level	O
+set	O
+.	O
+Secondly	O
+,	O
+it	O
+is	O
+shown	O
+that	O
+the	O
+same	O
+feedback	O
+allows	O
+us	O
+to	O
+globally	B-KEY
+stabilize	I-KEY
+an	O
+equilibrium	B-KEY
+point	I-KEY
+if	O
+it	O
+is	O
+asymptotically	O
+stable	O
+with	O
+respect	O
+to	O
+initial	O
+conditions	O
+in	O
+its	O
+level	O
+set	O
+.	O
+Two	O
+examples	O
+are	O
+provided	O
+and	O
+the	O
+results	O
+are	O
+compared	O
+with	O
+those	O
+in	O
+the	O
+literature	O
+
+The	O
+effects	O
+of	O
+work	O
+pace	O
+on	O
+within-participant	O
+and	O
+between-participant	O
+keying	B-KEY
+force	I-KEY
+,	O
+electromyography	O
+,	O
+and	O
+fatigue	O
+A	O
+laboratory	O
+study	O
+was	O
+conducted	O
+to	O
+determine	O
+the	O
+effects	O
+of	O
+work	O
+pace	O
+on	O
+typing	O
+force	O
+,	O
+electromyographic	O
+-LRB-	O
+EMG	O
+-RRB-	O
+activity	O
+,	O
+and	O
+subjective	B-KEY
+discomfort	I-KEY
+.	O
+We	O
+found	O
+that	O
+as	O
+participants	O
+typed	O
+faster	O
+,	O
+their	O
+typing	O
+force	O
+and	O
+finger	B-KEY
+flexor	I-KEY
+and	O
+extensor	O
+EMG	B-KEY
+activity	I-KEY
+increased	O
+linearly	O
+.	O
+There	O
+was	O
+also	O
+an	O
+increase	O
+in	O
+subjective	B-KEY
+discomfort	I-KEY
+,	O
+with	O
+a	O
+sharp	O
+threshold	O
+between	O
+participants	O
+'	O
+self-selected	O
+pace	O
+and	O
+their	O
+maximum	O
+typing	O
+speed	O
+.	O
+The	O
+results	O
+suggest	O
+that	O
+participants	O
+self-select	O
+a	O
+typing	O
+pace	O
+that	O
+maximizes	O
+typing	B-KEY
+speed	I-KEY
+and	O
+minimizes	O
+discomfort	B-KEY
+.	O
+The	O
+fastest	O
+typists	B-KEY
+did	O
+not	O
+produce	O
+significantly	O
+more	O
+finger	B-KEY
+flexor	I-KEY
+EMG	B-KEY
+activity	I-KEY
+but	O
+did	O
+produce	O
+proportionately	O
+less	O
+finger	O
+extensor	O
+EMG	B-KEY
+activity	I-KEY
+compared	O
+with	O
+the	O
+slower	O
+typists	B-KEY
+.	O
+We	O
+hypothesize	O
+that	O
+fast	O
+typists	B-KEY
+may	O
+use	O
+different	O
+muscle	B-KEY
+recruitment	I-KEY
+patterns	I-KEY
+that	O
+allow	O
+them	O
+to	O
+be	O
+more	O
+efficient	O
+than	O
+slower	O
+typists	B-KEY
+at	O
+striking	O
+the	O
+keys	O
+.	O
+In	O
+addition	O
+,	O
+faster	O
+typists	B-KEY
+do	O
+not	O
+experience	O
+more	O
+discomfort	B-KEY
+than	O
+slow	O
+typists	B-KEY
+.	O
+These	O
+findings	O
+show	O
+that	O
+the	O
+relative	O
+pace	O
+of	O
+typing	O
+is	O
+more	O
+important	O
+than	O
+actual	O
+typing	B-KEY
+speed	I-KEY
+with	O
+regard	O
+to	O
+discomfort	B-KEY
+and	O
+muscle	O
+activity	O
+.	O
+These	O
+results	O
+suggest	O
+that	O
+typists	B-KEY
+may	O
+benefit	O
+from	O
+skill	B-KEY
+training	I-KEY
+to	O
+increase	O
+maximum	O
+typing	B-KEY
+speed	I-KEY
+.	O
+Potential	O
+applications	O
+of	O
+this	O
+research	O
+includes	O
+skill	B-KEY
+training	I-KEY
+for	O
+typists	B-KEY
+
+An	O
+adaptive	B-KEY
+time	I-KEY
+step	I-KEY
+procedure	I-KEY
+for	O
+a	O
+parabolic	B-KEY
+problem	I-KEY
+with	O
+blow-up	O
+In	O
+this	O
+paper	O
+we	O
+introduce	O
+and	O
+analyze	O
+a	O
+fully	B-KEY
+discrete	I-KEY
+approximation	I-KEY
+for	O
+a	O
+parabolic	B-KEY
+problem	I-KEY
+with	O
+a	O
+nonlinear	B-KEY
+boundary	I-KEY
+condition	I-KEY
+which	O
+implies	O
+that	O
+the	O
+solutions	O
+blow	O
+up	O
+in	O
+finite	O
+time	O
+.	O
+We	O
+use	O
+standard	B-KEY
+linear	I-KEY
+elements	I-KEY
+with	O
+mass	O
+lumping	O
+for	O
+the	O
+space	O
+variable	O
+.	O
+For	O
+the	O
+time	O
+discretization	O
+we	O
+write	O
+the	O
+problem	O
+in	O
+an	O
+equivalent	O
+form	O
+which	O
+is	O
+obtained	O
+by	O
+introducing	O
+an	O
+appropriate	O
+time	O
+re-scaling	O
+and	O
+then	O
+,	O
+we	O
+use	O
+explicit	O
+Runge-Kutta	B-KEY
+methods	I-KEY
+for	O
+this	O
+equivalent	O
+problem	O
+.	O
+In	O
+order	O
+to	O
+motivate	O
+our	O
+procedure	O
+we	O
+present	O
+it	O
+first	O
+in	O
+the	O
+case	O
+of	O
+a	O
+simple	O
+ordinary	O
+differential	O
+equation	O
+and	O
+show	O
+how	O
+the	O
+blow	O
+up	O
+time	O
+is	O
+approximated	O
+in	O
+this	O
+case	O
+.	O
+We	O
+obtain	O
+necessary	O
+and	O
+sufficient	O
+conditions	O
+for	O
+the	O
+blowup	O
+of	O
+the	O
+numerical	O
+solution	O
+and	O
+prove	O
+that	O
+the	O
+numerical	O
+blow-up	O
+time	O
+converges	O
+to	O
+the	O
+continuous	O
+one	O
+.	O
+We	O
+also	O
+study	O
+,	O
+for	O
+the	O
+explicit	B-KEY
+Euler	I-KEY
+approximation	I-KEY
+,	O
+the	O
+localization	O
+of	O
+blow-up	O
+points	O
+for	O
+the	O
+numerical	O
+scheme	O
+
+A	O
+transmission	O
+line	O
+fault-location	O
+system	O
+using	O
+the	O
+wavelet	B-KEY
+transform	I-KEY
+This	O
+paper	O
+describes	O
+the	O
+locating	O
+system	O
+of	O
+line-to-ground	B-KEY
+faults	I-KEY
+on	O
+a	O
+power	O
+transmission	O
+line	O
+by	O
+using	O
+a	O
+wavelet	B-KEY
+transform	I-KEY
+.	O
+The	O
+possibility	O
+of	O
+the	O
+location	O
+with	O
+the	O
+surge	O
+generated	O
+by	O
+a	O
+fault	O
+has	O
+been	O
+theoretically	O
+proposed	O
+.	O
+In	O
+order	O
+to	O
+make	O
+the	O
+method	O
+practicable	O
+,	O
+the	O
+authors	O
+realize	O
+very	O
+fast	O
+processors	O
+.	O
+They	O
+design	O
+the	O
+wavelet	B-KEY
+transform	I-KEY
+and	O
+location	O
+chips	O
+,	O
+and	O
+construct	O
+a	O
+very	O
+fast	O
+fault	O
+location	O
+system	O
+by	O
+processing	O
+the	O
+measured	O
+data	O
+in	O
+parallel	O
+.	O
+This	O
+system	O
+is	O
+realized	O
+by	O
+a	O
+computer	O
+with	O
+three	O
+FPGA	B-KEY
+processor	I-KEY
+boards	I-KEY
+on	O
+a	O
+PCI	B-KEY
+bus	I-KEY
+.	O
+The	O
+processors	O
+are	O
+controlled	O
+by	O
+UNIX	B-KEY
+and	O
+the	O
+system	O
+has	O
+a	O
+graphical	B-KEY
+user	I-KEY
+interface	I-KEY
+with	O
+an	O
+X	B-KEY
+window	I-KEY
+system	I-KEY
+
+The	O
+dynamic	B-KEY
+aspect	I-KEY
+of	O
+land	O
+administration	O
+:	O
+an	O
+often-forgotten	O
+component	O
+in	O
+system	B-KEY
+design	I-KEY
+Although	O
+the	O
+establishment	O
+of	O
+a	O
+land	B-KEY
+administration	I-KEY
+system	I-KEY
+is	O
+enough	O
+of	O
+a	O
+challenge	O
+as	O
+it	O
+is	O
+,	O
+the	O
+task	O
+of	O
+keeping	O
+the	O
+system	O
+up	O
+to	O
+date	O
+with	O
+developments	O
+in	O
+society	O
+is	O
+even	O
+more	O
+challenging	O
+.	O
+Initial	O
+adjudication	B-KEY
+and	O
+cadastral	B-KEY
+mapping	I-KEY
+basically	O
+record	O
+land	B-KEY
+tenure	I-KEY
+as	O
+it	O
+exists	O
+at	O
+a	O
+given	O
+moment	O
+,	O
+i.e.	O
+the	O
+static	B-KEY
+situation	I-KEY
+.	O
+The	O
+paper	O
+aims	O
+to	O
+analyse	O
+the	O
+developments	O
+that	O
+might	O
+occur	O
+in	O
+a	O
+society	O
+with	O
+respect	O
+to	O
+tenure	O
+,	O
+value	O
+and	O
+use	O
+of	O
+land	O
+.	O
+These	O
+developments	O
+constitute	O
+a	O
+dynamic	B-KEY
+component	I-KEY
+of	O
+land	O
+administration	O
+.	O
+As	O
+land	B-KEY
+administration	I-KEY
+systems	I-KEY
+have	O
+to	O
+serve	O
+society	O
+on	O
+a	O
+long-term	O
+basis	O
+and	O
+normally	O
+have	O
+a	O
+long-term	O
+return	B-KEY
+on	I-KEY
+investment	I-KEY
+,	O
+the	O
+author	O
+recommends	O
+taking	O
+into	O
+account	O
+both	O
+the	O
+static	O
+and	O
+dynamic	B-KEY
+component	I-KEY
+when	O
+designing	O
+land	B-KEY
+administration	I-KEY
+systems	I-KEY
+
+Quantitative	O
+analysis	O
+of	O
+reconstructed	O
+3-D	O
+coronary	O
+arterial	O
+tree	O
+and	O
+intracoronary	O
+devices	O
+Traditional	O
+quantitative	O
+coronary	O
+angiography	O
+is	O
+performed	O
+on	O
+two-dimensional	O
+-LRB-	O
+2-D	O
+-RRB-	O
+projection	O
+views	O
+.	O
+These	O
+views	O
+are	O
+chosen	O
+by	O
+the	O
+angiographer	O
+to	O
+minimize	O
+vessel	O
+overlap	O
+and	O
+foreshortening	O
+.	O
+With	O
+2-D	O
+projection	O
+views	O
+that	O
+are	O
+acquired	O
+in	O
+this	O
+nonstandardized	O
+fashion	O
+,	O
+however	O
+,	O
+there	O
+is	O
+no	O
+way	O
+to	O
+know	O
+or	O
+estimate	O
+how	O
+much	O
+error	O
+occurs	O
+in	O
+the	O
+QCA	O
+process	O
+.	O
+Furthermore	O
+,	O
+coronary	O
+arteries	O
+possess	O
+a	O
+curvilinear	O
+shape	O
+and	O
+undergo	O
+a	O
+cyclical	B-KEY
+deformation	I-KEY
+due	O
+to	O
+their	O
+attachment	O
+to	O
+the	O
+myocardium	B-KEY
+.	O
+Therefore	O
+,	O
+it	O
+is	O
+necessary	O
+to	O
+obtain	O
+three-dimensional	O
+-LRB-	O
+3-D	O
+-RRB-	O
+information	O
+to	O
+best	O
+describe	O
+and	O
+quantify	O
+the	O
+dynamic	O
+curvilinear	O
+nature	O
+of	O
+the	O
+human	B-KEY
+coronary	I-KEY
+artery	I-KEY
+.	O
+Using	O
+a	O
+patient-specific	B-KEY
+3-D	I-KEY
+coronary	I-KEY
+reconstruction	I-KEY
+algorithm	I-KEY
+and	O
+routine	B-KEY
+angiographic	I-KEY
+images	I-KEY
+,	O
+a	O
+new	O
+technique	O
+is	O
+proposed	O
+to	O
+describe	O
+:	O
+-LRB-	O
+1	O
+-RRB-	O
+the	O
+curvilinear	O
+nature	O
+of	O
+3-D	O
+coronary	O
+arteries	O
+and	O
+intracoronary	O
+devices	O
+;	O
+-LRB-	O
+2	O
+-RRB-	O
+the	O
+magnitude	O
+of	O
+the	O
+arterial	O
+deformation	O
+caused	O
+by	O
+intracoronary	O
+devices	O
+and	O
+due	O
+to	O
+heart	O
+motion	O
+;	O
+and	O
+-LRB-	O
+3	O
+-RRB-	O
+optimal	O
+view	O
+-LRB-	O
+s	O
+-RRB-	O
+with	O
+respect	O
+to	O
+the	O
+desired	O
+``	O
+pathway	O
+''	O
+for	O
+delivering	O
+intracoronary	O
+devices	O
+
+Effectiveness	O
+of	O
+user	B-KEY
+testing	I-KEY
+and	O
+heuristic	B-KEY
+evaluation	I-KEY
+as	O
+a	O
+function	O
+of	O
+performance	B-KEY
+classification	I-KEY
+For	O
+different	O
+levels	O
+of	O
+user	B-KEY
+performance	I-KEY
+,	O
+different	O
+types	O
+of	O
+information	O
+are	O
+processed	O
+and	O
+users	O
+will	O
+make	O
+different	O
+types	O
+of	O
+errors	O
+.	O
+Based	O
+on	O
+the	O
+error	O
+'s	O
+immediate	O
+cause	O
+and	O
+the	O
+information	O
+being	O
+processed	O
+,	O
+usability	B-KEY
+problems	O
+can	O
+be	O
+classified	O
+into	O
+three	O
+categories	O
+.	O
+They	O
+are	O
+usability	B-KEY
+problems	O
+associated	O
+with	O
+skill-based	O
+,	O
+rule-based	O
+and	O
+knowledge-based	O
+levels	O
+of	O
+performance	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+a	O
+user	B-KEY
+interface	I-KEY
+for	O
+a	O
+Web-based	B-KEY
+software	I-KEY
+program	O
+was	O
+evaluated	O
+with	O
+two	O
+usability	B-KEY
+evaluation	O
+methods	O
+,	O
+user	B-KEY
+testing	I-KEY
+and	O
+heuristic	B-KEY
+evaluation	I-KEY
+.	O
+The	O
+experiment	B-KEY
+discovered	O
+that	O
+the	O
+heuristic	B-KEY
+evaluation	I-KEY
+with	O
+human	B-KEY
+factor	I-KEY
+experts	O
+is	O
+more	O
+effective	O
+than	O
+user	B-KEY
+testing	I-KEY
+in	O
+identifying	O
+usability	B-KEY
+problems	O
+associated	O
+with	O
+skill-based	O
+and	O
+rule-based	O
+levels	O
+of	O
+performance	O
+.	O
+User	B-KEY
+testing	I-KEY
+is	O
+more	O
+effective	O
+than	O
+heuristic	B-KEY
+evaluation	I-KEY
+in	O
+finding	O
+usability	B-KEY
+problems	O
+associated	O
+with	O
+the	O
+knowledge-based	O
+level	O
+of	O
+performance	O
+.	O
+The	O
+practical	O
+application	O
+of	O
+this	O
+research	O
+is	O
+also	O
+discussed	O
+in	O
+the	O
+paper	O
+
+Multiple	O
+comparison	O
+methods	O
+for	O
+means	O
+Multiple	O
+comparison	O
+methods	O
+-LRB-	O
+MCMs	O
+-RRB-	O
+are	O
+used	O
+to	O
+investigate	O
+differences	O
+between	O
+pairs	O
+of	O
+population	B-KEY
+means	I-KEY
+or	O
+,	O
+more	O
+generally	O
+,	O
+between	O
+subsets	O
+of	O
+population	B-KEY
+means	I-KEY
+using	O
+sample	O
+data	O
+.	O
+Although	O
+several	O
+such	O
+methods	O
+are	O
+commonly	O
+available	O
+in	O
+statistical	O
+software	O
+packages	O
+,	O
+users	O
+may	O
+be	O
+poorly	O
+informed	O
+about	O
+the	O
+appropriate	O
+method	O
+-LRB-	O
+s	O
+-RRB-	O
+to	O
+use	O
+and/or	O
+the	O
+correct	O
+way	O
+to	O
+interpret	O
+the	O
+results	O
+.	O
+This	O
+paper	O
+classifies	O
+the	O
+MCMs	O
+and	O
+presents	O
+the	O
+important	O
+methods	O
+for	O
+each	O
+class	O
+.	O
+Both	O
+simulated	O
+and	O
+real	O
+data	O
+are	O
+used	O
+to	O
+compare	O
+the	O
+methods	O
+,	O
+and	O
+emphasis	O
+is	O
+placed	O
+on	O
+a	O
+correct	O
+application	O
+and	O
+interpretation	O
+.	O
+We	O
+include	O
+suggestions	O
+for	O
+choosing	O
+the	O
+best	O
+method	O
+.	O
+Mathematica	O
+programs	O
+developed	O
+by	O
+the	O
+authors	O
+are	O
+used	O
+to	O
+compare	O
+MCMs	O
+.	O
+By	O
+taking	O
+the	O
+advantage	O
+of	O
+Mathematica	O
+'s	O
+notebook	O
+structure	O
+,	O
+all	O
+interested	O
+student	O
+can	O
+use	O
+these	O
+programs	O
+to	O
+explore	O
+the	O
+subject	O
+more	O
+deeply	O
+
+The	O
+role	O
+of	O
+B2B	B-KEY
+engines	I-KEY
+in	O
+B2B	O
+integration	O
+architectures	O
+Semantic	B-KEY
+B2B	I-KEY
+integration	I-KEY
+architectures	I-KEY
+must	O
+enable	O
+enterprises	O
+to	O
+communicate	O
+standards-based	O
+B2B	O
+events	O
+like	O
+purchase	B-KEY
+orders	I-KEY
+with	O
+any	O
+potential	O
+trading	B-KEY
+partner	I-KEY
+.	O
+This	O
+requires	O
+not	O
+only	O
+back	O
+end	O
+application	O
+integration	O
+capabilities	O
+to	O
+integrate	O
+with	O
+e.g.	O
+enterprise	O
+resource	O
+planning	O
+-LRB-	O
+ERP	O
+-RRB-	O
+systems	O
+as	O
+the	O
+company-internal	O
+source	O
+and	O
+destination	O
+of	O
+B2B	O
+events	O
+,	O
+but	O
+also	O
+a	O
+capability	O
+to	O
+implement	O
+every	O
+necessary	O
+B2B	O
+protocol	O
+like	O
+electronic	O
+data	O
+interchange	O
+-LRB-	O
+EDI	B-KEY
+-RRB-	O
+,	O
+RosettaNet	B-KEY
+as	O
+well	O
+as	O
+more	O
+generic	O
+capabilities	O
+like	O
+Web	B-KEY
+services	I-KEY
+-LRB-	O
+WS	O
+-RRB-	O
+.	O
+This	O
+paper	O
+shows	O
+the	O
+placement	O
+and	O
+functionality	O
+of	O
+B2B	B-KEY
+engines	I-KEY
+in	O
+semantic	B-KEY
+B2B	I-KEY
+integration	I-KEY
+architectures	I-KEY
+that	O
+implement	O
+a	O
+generic	O
+framework	O
+for	O
+modeling	B-KEY
+and	O
+executing	O
+any	O
+B2B	O
+protocol	O
+.	O
+A	O
+detailed	O
+discussion	O
+shows	O
+how	O
+a	O
+B2B	B-KEY
+engine	I-KEY
+can	O
+provide	O
+the	O
+necessary	O
+abstractions	O
+to	O
+implement	O
+any	O
+standard-based	O
+B2B	O
+protocol	O
+or	O
+any	O
+trading	B-KEY
+partner	I-KEY
+specific	O
+specialization	O
+
+The	O
+BIOGENES	B-KEY
+system	I-KEY
+for	O
+knowledge-based	B-KEY
+bioprocess	I-KEY
+control	I-KEY
+The	O
+application	O
+of	O
+knowledge-based	O
+control	O
+systems	O
+in	O
+the	O
+area	O
+of	O
+biotechnological	B-KEY
+processes	I-KEY
+has	O
+become	O
+increasingly	O
+popular	O
+over	O
+the	O
+past	O
+decade	O
+.	O
+This	O
+paper	O
+outlines	O
+the	O
+structure	O
+of	O
+the	O
+advanced	O
+knowledge-based	O
+part	O
+of	O
+the	O
+BIOGENES	O
+Copyright	O
+control	O
+system	O
+for	O
+the	O
+control	O
+of	O
+bioprocesses	O
+such	O
+as	O
+the	O
+fed-batch	B-KEY
+Saccharomyces	I-KEY
+cerevisiae	I-KEY
+cultivation	I-KEY
+.	O
+First	O
+,	O
+a	O
+brief	O
+overview	O
+of	O
+all	O
+the	O
+tasks	O
+implemented	O
+in	O
+the	O
+knowledge-based	O
+level	O
+including	O
+process	B-KEY
+data	I-KEY
+classification	I-KEY
+,	O
+qualitative	B-KEY
+process	I-KEY
+state	I-KEY
+identification	I-KEY
+and	O
+supervisory	B-KEY
+process	I-KEY
+control	I-KEY
+is	O
+given	O
+.	O
+The	O
+procedures	O
+performing	O
+the	O
+on-line	O
+identification	O
+of	O
+metabolic	B-KEY
+states	I-KEY
+and	O
+supervisory	B-KEY
+process	I-KEY
+control	I-KEY
+-LRB-	O
+setpoint	O
+calculation	O
+and	O
+control	O
+strategy	O
+selection	O
+-RRB-	O
+are	O
+described	O
+in	O
+more	O
+detail	O
+.	O
+Finally	O
+,	O
+the	O
+performance	O
+of	O
+the	O
+system	O
+is	O
+discussed	O
+using	O
+results	O
+obtained	O
+from	O
+a	O
+number	O
+of	O
+experimental	O
+cultivation	O
+runs	O
+in	O
+a	O
+laboratory	O
+unit	O
+
+Efficient	B-KEY
+algorithms	I-KEY
+for	O
+stiff	O
+elliptic	O
+problems	O
+with	O
+large	B-KEY
+parameters	I-KEY
+We	O
+consider	O
+a	O
+finite	B-KEY
+element	I-KEY
+approximation	I-KEY
+and	O
+iteration	B-KEY
+algorithms	I-KEY
+for	O
+solving	O
+stiff	B-KEY
+elliptic	I-KEY
+boundary	I-KEY
+value	I-KEY
+problems	I-KEY
+with	O
+large	B-KEY
+parameters	I-KEY
+in	O
+front	O
+of	O
+a	O
+higher	B-KEY
+derivative	I-KEY
+.	O
+The	O
+convergence	B-KEY
+rate	I-KEY
+of	O
+the	O
+algorithms	O
+is	O
+independent	O
+of	O
+the	O
+spread	O
+in	O
+coefficients	O
+and	O
+a	O
+discretization	O
+parameter	O
+
+The	O
+chemical	O
+brotherhood	O
+It	O
+has	O
+always	O
+been	O
+more	O
+difficult	O
+for	O
+chemistry	B-KEY
+to	O
+keep	O
+up	O
+in	O
+the	O
+Internet	B-KEY
+age	O
+but	O
+a	O
+new	O
+language	O
+could	O
+herald	O
+a	O
+new	O
+era	O
+for	O
+the	O
+discipline	O
+.	O
+The	O
+paper	O
+discusses	O
+CML	B-KEY
+,	O
+or	O
+chemical	B-KEY
+mark-up	I-KEY
+language	I-KEY
+.	O
+The	O
+eXtensible	B-KEY
+Mark-up	I-KEY
+Language	I-KEY
+provides	O
+a	O
+universal	O
+format	O
+for	O
+structured	O
+documents	O
+and	O
+data	O
+on	O
+the	O
+Web	O
+and	O
+so	O
+offers	O
+a	O
+way	O
+for	O
+scientists	O
+and	O
+others	O
+to	O
+carry	O
+a	O
+wide	O
+range	O
+of	O
+information	O
+types	O
+across	O
+the	O
+net	O
+in	O
+a	O
+transparent	O
+way	O
+.	O
+All	O
+that	O
+is	O
+needed	O
+is	O
+an	O
+XML	B-KEY
+browser	I-KEY
+
+Database	B-KEY
+technology	I-KEY
+in	O
+digital	B-KEY
+libraries	I-KEY
+Database	B-KEY
+technology	I-KEY
+advancements	O
+have	O
+provided	O
+many	O
+opportunities	O
+for	O
+libraries	O
+.	O
+These	O
+advancements	O
+can	O
+bring	O
+the	O
+world	O
+closer	O
+together	O
+through	O
+information	B-KEY
+accessibility	I-KEY
+.	O
+Digital	B-KEY
+library	I-KEY
+projects	O
+have	O
+been	O
+established	O
+worldwide	O
+to	O
+,	O
+ultimately	O
+,	O
+fulfil	O
+the	O
+needs	O
+of	O
+end	O
+users	O
+through	O
+more	O
+efficiency	O
+and	O
+convenience	O
+.	O
+Resource	B-KEY
+sharing	I-KEY
+will	O
+continue	O
+to	O
+be	O
+the	O
+trend	O
+for	O
+libraries	O
+.	O
+Changes	O
+often	O
+create	O
+issues	O
+which	O
+need	O
+to	O
+be	O
+addressed	O
+.	O
+Issues	O
+relating	O
+to	O
+database	B-KEY
+technology	I-KEY
+and	O
+digital	B-KEY
+libraries	I-KEY
+are	O
+reviewed	O
+.	O
+Some	O
+of	O
+the	O
+major	O
+challenges	O
+in	O
+digital	B-KEY
+libraries	I-KEY
+and	O
+managerial	B-KEY
+issues	I-KEY
+are	O
+identified	O
+as	O
+well	O
+
+Necessary	B-KEY
+conditions	I-KEY
+of	O
+optimality	B-KEY
+for	O
+impulsive	B-KEY
+systems	I-KEY
+on	O
+Banach	B-KEY
+spaces	I-KEY
+We	O
+present	O
+necessary	B-KEY
+conditions	I-KEY
+of	O
+optimality	B-KEY
+for	O
+optimal	B-KEY
+control	O
+problems	O
+arising	O
+in	O
+systems	O
+governed	O
+by	O
+impulsive	O
+evolution	O
+equations	O
+on	O
+Banach	O
+spaces	O
+.	O
+Basic	O
+notations	O
+and	O
+terminologies	O
+are	O
+first	O
+presented	O
+and	O
+necessary	B-KEY
+conditions	I-KEY
+of	O
+optimality	B-KEY
+are	O
+presented	O
+.	O
+Special	O
+cases	O
+are	O
+discussed	O
+and	O
+we	O
+present	O
+an	O
+application	O
+to	O
+the	O
+classical	O
+linear	B-KEY
+quadratic	I-KEY
+regulator	I-KEY
+problem	O
+
+Control	O
+of	O
+integral	B-KEY
+processes	I-KEY
+with	O
+dead-time	B-KEY
+.	O
+1	O
+.	O
+Disturbance	B-KEY
+observer-based	I-KEY
+2	I-KEY
+DOF	I-KEY
+control	I-KEY
+scheme	I-KEY
+A	O
+disturbance	O
+observer-based	O
+control	O
+scheme	O
+-LRB-	O
+a	O
+version	O
+of	O
+2	B-KEY
+DOF	I-KEY
+internal	I-KEY
+model	I-KEY
+control	I-KEY
+-RRB-	O
+which	O
+is	O
+very	O
+effective	O
+in	O
+controlling	O
+integral	B-KEY
+processes	I-KEY
+with	O
+dead	O
+time	O
+is	O
+presented	O
+.	O
+The	O
+controller	O
+can	O
+be	O
+designed	O
+to	O
+reject	O
+ramp	O
+disturbances	O
+as	O
+well	O
+as	O
+step	O
+disturbances	O
+and	O
+even	O
+arbitrary	O
+disturbances	O
+.	O
+When	O
+the	O
+plant	O
+model	O
+is	O
+available	O
+only	O
+two	O
+parameters	O
+are	O
+left	O
+to	O
+tune	O
+.	O
+One	O
+is	O
+the	O
+time	B-KEY
+constant	I-KEY
+of	O
+the	O
+set-point	B-KEY
+response	I-KEY
+and	O
+the	O
+other	O
+is	O
+the	O
+time	B-KEY
+constant	I-KEY
+of	O
+the	O
+disturbance	B-KEY
+response	I-KEY
+.	O
+The	O
+latter	O
+is	O
+tuned	O
+according	O
+to	O
+the	O
+compromise	O
+between	O
+disturbance	B-KEY
+response	I-KEY
+and	O
+robustness	B-KEY
+.	O
+This	O
+control	O
+scheme	O
+has	O
+a	O
+simple	O
+,	O
+clear	O
+,	O
+easy-to-design	O
+,	O
+easy-to-implement	O
+structure	O
+and	O
+good	O
+performance	O
+.	O
+It	O
+is	O
+compared	O
+to	O
+the	O
+best	O
+results	O
+-LRB-	O
+so	O
+far	O
+-RRB-	O
+using	O
+some	O
+simulation	O
+examples	O
+
+Minimizing	O
+weighted	O
+number	O
+of	O
+early	O
+and	O
+tardy	B-KEY
+jobs	I-KEY
+with	O
+a	O
+common	B-KEY
+due	I-KEY
+window	I-KEY
+involving	O
+location	B-KEY
+penalty	I-KEY
+Studies	O
+a	O
+single	B-KEY
+machine	I-KEY
+scheduling	I-KEY
+problem	I-KEY
+to	O
+minimize	O
+the	O
+weighted	O
+number	O
+of	O
+early	O
+and	O
+tardy	B-KEY
+jobs	I-KEY
+with	O
+a	O
+common	B-KEY
+due	I-KEY
+window	I-KEY
+.	O
+There	O
+are	O
+n	O
+non-preemptive	O
+and	O
+simultaneously	O
+available	O
+jobs	O
+.	O
+Each	O
+job	O
+will	O
+incur	O
+an	O
+early	O
+-LRB-	O
+tardy	O
+-RRB-	O
+penalty	O
+if	O
+it	O
+is	O
+early	O
+-LRB-	O
+tardy	O
+-RRB-	O
+with	O
+respect	O
+to	O
+the	O
+common	B-KEY
+due	I-KEY
+window	I-KEY
+under	O
+a	O
+given	O
+schedule	O
+.	O
+The	O
+window	O
+size	O
+is	O
+a	O
+given	O
+parameter	O
+but	O
+the	O
+window	O
+location	O
+is	O
+a	O
+decision	B-KEY
+variable	I-KEY
+.	O
+The	O
+objective	O
+of	O
+the	O
+problem	O
+is	O
+to	O
+find	O
+a	O
+schedule	O
+that	O
+minimizes	O
+the	O
+weighted	O
+number	O
+of	O
+early	O
+and	O
+tardy	B-KEY
+jobs	I-KEY
+and	O
+the	O
+location	B-KEY
+penalty	I-KEY
+.	O
+We	O
+show	O
+that	O
+the	O
+problem	O
+is	O
+NP-complete	O
+in	O
+the	O
+ordinary	O
+sense	O
+and	O
+develop	O
+a	O
+dynamic	B-KEY
+programming	I-KEY
+based	O
+pseudo-polynomial	B-KEY
+algorithm	I-KEY
+.	O
+We	O
+conduct	O
+computational	O
+experiments	O
+,	O
+the	O
+results	O
+of	O
+which	O
+show	O
+that	O
+the	O
+performance	O
+of	O
+the	O
+dynamic	O
+algorithm	O
+is	O
+very	O
+good	O
+in	O
+terms	O
+of	O
+memory	O
+requirement	O
+and	O
+CPU	O
+time	O
+.	O
+We	O
+also	O
+provide	O
+polynomial	O
+time	O
+algorithms	O
+for	O
+two	O
+special	O
+cases	O
+
+Linear	B-KEY
+complexity	I-KEY
+of	O
+polyphase	B-KEY
+power	I-KEY
+residue	I-KEY
+sequences	I-KEY
+The	O
+well	O
+known	O
+family	O
+of	O
+binary	O
+Legendre	O
+or	O
+quadratic	B-KEY
+residue	I-KEY
+sequences	I-KEY
+can	O
+be	O
+generalised	O
+to	O
+the	O
+multiple-valued	B-KEY
+case	I-KEY
+by	O
+employing	O
+a	O
+polyphase	O
+representation	O
+.	O
+These	O
+p-phase	B-KEY
+sequences	I-KEY
+,	O
+with	O
+p	O
+prime	O
+,	O
+also	O
+have	O
+prime	O
+length	O
+L	O
+,	O
+and	O
+can	O
+be	O
+constructed	O
+from	O
+the	O
+index	O
+sequence	O
+of	O
+length	O
+L	O
+or	O
+,	O
+equivalently	O
+,	O
+from	O
+the	O
+cosets	O
+of	O
+pth	O
+power	O
+residues	O
+and	O
+non-residues	O
+modulo-L	O
+.	O
+The	O
+linear	B-KEY
+complexity	I-KEY
+of	O
+these	O
+polyphase	O
+sequences	O
+is	O
+derived	O
+and	O
+shown	O
+to	O
+fall	O
+into	O
+four	O
+classes	O
+depending	O
+on	O
+the	O
+value	O
+assigned	O
+to	O
+b/sub	O
+0	O
+/	O
+,	O
+the	O
+initial	O
+digit	O
+of	O
+the	O
+sequence	O
+,	O
+and	O
+on	O
+whether	O
+p	O
+belongs	O
+to	O
+the	O
+set	O
+of	O
+pth	O
+power	O
+residues	O
+or	O
+not	O
+.	O
+The	O
+characteristic	O
+polynomials	B-KEY
+of	O
+the	O
+linear	B-KEY
+feedback	I-KEY
+shift	I-KEY
+registers	I-KEY
+that	O
+generate	O
+these	O
+sequences	O
+are	O
+also	O
+derived	O
+
+On	O
+the	O
+convergence	O
+of	O
+the	O
+Bermudez-Moreno	B-KEY
+algorithm	I-KEY
+with	O
+constant	B-KEY
+parameters	I-KEY
+A.	O
+Bermudez	O
+and	O
+C.	O
+Moreno	O
+-LRB-	O
+1981	O
+-RRB-	O
+presented	O
+a	O
+duality	B-KEY
+numerical	I-KEY
+algorithm	I-KEY
+for	O
+solving	O
+variational	B-KEY
+inequalities	I-KEY
+of	O
+the	O
+second	O
+kind	O
+.	O
+The	O
+performance	O
+of	O
+this	O
+algorithm	O
+strongly	O
+depends	O
+on	O
+the	O
+choice	O
+of	O
+two	O
+constant	B-KEY
+parameters	I-KEY
+.	O
+Assuming	O
+a	O
+further	O
+hypothesis	O
+of	O
+the	O
+inf-sup	O
+type	O
+,	O
+we	O
+present	O
+here	O
+a	O
+convergence	B-KEY
+theorem	I-KEY
+that	O
+improves	O
+on	O
+the	O
+one	O
+presented	O
+by	O
+A.	O
+Bermudez	O
+and	O
+C.	O
+Moreno	O
+.	O
+We	O
+prove	O
+that	O
+the	O
+convergence	O
+is	O
+linear	O
+,	O
+and	O
+we	O
+give	O
+the	O
+expression	O
+of	O
+the	O
+asymptotic	B-KEY
+error	I-KEY
+constant	I-KEY
+and	O
+the	O
+explicit	O
+form	O
+of	O
+the	O
+optimal	B-KEY
+parameters	I-KEY
+,	O
+as	O
+a	O
+function	O
+of	O
+some	O
+constants	O
+related	O
+to	O
+the	O
+variational	B-KEY
+inequality	I-KEY
+.	O
+Finally	O
+,	O
+we	O
+present	O
+some	O
+numerical	O
+examples	O
+that	O
+confirm	O
+the	O
+theoretical	O
+results	O
+
+Project	B-KEY
+scheduling	I-KEY
+under	O
+time	O
+dependent	O
+costs-a	O
+branch	B-KEY
+and	I-KEY
+bound	I-KEY
+algorithm	I-KEY
+In	O
+a	O
+given	O
+project	B-KEY
+network	I-KEY
+,	O
+execution	O
+of	O
+each	O
+activity	O
+in	O
+normal	O
+duration	O
+requires	O
+utilization	O
+of	O
+certain	O
+resources	O
+.	O
+If	O
+faster	O
+execution	O
+of	O
+an	O
+activity	O
+is	O
+desired	O
+then	O
+additional	O
+resources	O
+at	O
+extra	O
+cost	O
+would	O
+be	O
+required	O
+.	O
+Given	O
+a	O
+project	B-KEY
+network	I-KEY
+,	O
+the	O
+cost	O
+structure	O
+for	O
+each	O
+activity	O
+and	O
+a	O
+planning	B-KEY
+horizon	I-KEY
+,	O
+the	O
+project	B-KEY
+compression	I-KEY
+problem	I-KEY
+is	O
+concerned	O
+with	O
+the	O
+determination	O
+of	O
+optimal	B-KEY
+schedule	I-KEY
+of	O
+performing	O
+each	O
+activity	O
+while	O
+satisfying	O
+given	O
+restrictions	O
+and	O
+minimizing	O
+the	O
+total	O
+cost	O
+of	O
+project	O
+execution	O
+.	O
+The	O
+paper	O
+considers	O
+the	O
+project	B-KEY
+compression	I-KEY
+problem	I-KEY
+with	O
+time	B-KEY
+dependent	I-KEY
+cost	I-KEY
+structure	O
+for	O
+each	O
+activity	O
+.	O
+The	O
+planning	B-KEY
+horizon	I-KEY
+is	O
+divided	O
+into	O
+several	O
+regular	O
+time	O
+intervals	O
+over	O
+which	O
+the	O
+cost	O
+structure	O
+of	O
+an	O
+activity	O
+may	O
+vary	O
+.	O
+But	O
+the	O
+cost	O
+structure	O
+of	O
+the	O
+activities	O
+remains	O
+the	O
+same	O
+within	O
+a	O
+time	O
+interval	O
+.	O
+The	O
+objective	O
+is	O
+to	O
+find	O
+an	O
+optimal	O
+project	B-KEY
+schedule	I-KEY
+minimizing	O
+the	O
+total	O
+project	O
+cost	O
+.	O
+We	O
+present	O
+a	O
+mathematical	O
+model	O
+for	O
+this	O
+problem	O
+,	O
+develop	O
+some	O
+heuristics	B-KEY
+and	O
+an	O
+exact	O
+branch	B-KEY
+and	I-KEY
+bound	I-KEY
+algorithm	I-KEY
+.	O
+Using	O
+simulated	O
+problems	O
+we	O
+provide	O
+an	O
+insight	O
+into	O
+the	O
+computational	O
+performances	O
+of	O
+heuristics	B-KEY
+and	O
+the	O
+branch	B-KEY
+and	I-KEY
+bound	I-KEY
+algorithm	I-KEY
+
+Comments	O
+on	O
+``	O
+Frequency	B-KEY
+decomposition	I-KEY
+and	O
+computing	O
+of	O
+ultrasound	B-KEY
+medical	I-KEY
+images	I-KEY
+with	O
+wavelet	B-KEY
+packets	I-KEY
+''	O
+In	O
+this	O
+paper	O
+,	O
+errors	O
+and	O
+discrepancies	O
+in	O
+the	O
+subject	O
+paper	O
+-LSB-	O
+Cincotti	O
+et	O
+al.	O
+-LRB-	O
+2002	O
+-RRB-	O
+-RSB-	O
+are	O
+highlighted	O
+.	O
+A	O
+comment	O
+,	O
+concerning	O
+the	O
+axial	B-KEY
+resolution	I-KEY
+associated	O
+to	O
+the	O
+adopted	O
+processing	O
+procedure	O
+is	O
+also	O
+reported	O
+
+Pulmonary	B-KEY
+perfusion	I-KEY
+patterns	I-KEY
+and	O
+pulmonary	O
+arterial	O
+pressure	O
+Uses	O
+artificial	B-KEY
+intelligence	I-KEY
+methods	I-KEY
+to	O
+determine	O
+whether	O
+quantitative	B-KEY
+parameters	I-KEY
+describing	O
+the	O
+perfusion	B-KEY
+image	I-KEY
+can	O
+be	O
+synthesized	O
+to	O
+make	O
+a	O
+reasonable	O
+estimate	O
+of	O
+the	O
+pulmonary	O
+arterial	O
+-LRB-	O
+PA	O
+-RRB-	O
+pressure	O
+measured	O
+at	O
+angiography	B-KEY
+.	O
+Radionuclide	B-KEY
+perfusion	I-KEY
+images	I-KEY
+were	O
+obtained	O
+in	O
+120	O
+patients	O
+with	O
+normal	O
+chest	O
+radiographs	O
+who	O
+also	O
+underwent	O
+angiographic	O
+PA	O
+pressure	O
+measurement	O
+within	O
+3	O
+days	O
+of	O
+the	O
+radionuclide	O
+study	O
+.	O
+An	O
+artificial	O
+neural	O
+network	O
+-LRB-	O
+ANN	O
+-RRB-	O
+was	O
+constructed	O
+from	O
+several	O
+image	B-KEY
+parameters	I-KEY
+describing	O
+statistical	O
+and	O
+boundary	B-KEY
+characteristics	I-KEY
+of	O
+the	O
+perfusion	B-KEY
+images	I-KEY
+.	O
+With	O
+use	O
+of	O
+a	O
+leave-one-out	B-KEY
+cross-validation	I-KEY
+technique	I-KEY
+,	O
+this	O
+method	O
+was	O
+used	O
+to	O
+predict	O
+the	O
+PA	O
+systolic	O
+pressure	O
+in	O
+cases	O
+on	O
+which	O
+the	O
+ANN	O
+had	O
+not	O
+been	O
+trained	O
+.	O
+A	O
+Pearson	B-KEY
+correlation	I-KEY
+coefficient	I-KEY
+was	O
+determined	O
+between	O
+the	O
+predicted	O
+and	O
+measured	O
+PA	O
+systolic	O
+pressures	O
+.	O
+ANN	O
+predictions	O
+correlated	O
+with	O
+measured	O
+pulmonary	O
+systolic	O
+pressures	O
+-LRB-	O
+r	O
+=	O
+0.846	O
+,	O
+P	O
+<	O
+.001	O
+-RRB-	O
+.	O
+The	O
+accuracy	B-KEY
+of	O
+the	O
+predictions	O
+was	O
+not	O
+influenced	O
+by	O
+the	O
+presence	O
+of	O
+pulmonary	B-KEY
+embolism	I-KEY
+.	O
+None	O
+of	O
+the	O
+51	O
+patients	B-KEY
+with	O
+predicted	O
+PA	O
+pressures	O
+of	O
+less	O
+than	O
+29	O
+mm	O
+Hg	O
+had	O
+pulmonary	B-KEY
+hypertension	I-KEY
+at	O
+angiography	B-KEY
+.	O
+All	O
+13	O
+patients	B-KEY
+with	O
+predicted	O
+PA	O
+pressures	O
+greater	O
+than	O
+48	O
+mm	O
+Hg	O
+had	O
+pulmonary	B-KEY
+hypertension	I-KEY
+at	O
+angiography	B-KEY
+.	O
+Meaningful	O
+information	O
+regarding	O
+PA	O
+pressure	O
+can	O
+be	O
+derived	O
+from	O
+noninvasive	B-KEY
+radionuclide	I-KEY
+perfusion	I-KEY
+scanning	I-KEY
+.	O
+The	O
+use	O
+of	O
+image	B-KEY
+analysis	I-KEY
+in	O
+concert	O
+with	O
+artificial	B-KEY
+intelligence	I-KEY
+methods	I-KEY
+helps	O
+to	O
+reveal	O
+physiologic	B-KEY
+information	I-KEY
+not	O
+readily	O
+apparent	O
+at	O
+visual	B-KEY
+image	I-KEY
+inspection	I-KEY
+
+Ethnography	B-KEY
+,	O
+customers	O
+,	O
+and	O
+negotiated	B-KEY
+interactions	I-KEY
+at	O
+the	O
+airport	B-KEY
+In	O
+the	O
+late	O
+1990s	O
+,	O
+tightly	O
+coordinated	O
+airline	O
+schedules	O
+unraveled	O
+owing	O
+to	O
+massive	O
+delays	O
+resulting	O
+from	O
+inclement	O
+weather	O
+,	O
+overbooked	O
+flights	O
+,	O
+and	O
+airline	O
+operational	O
+difficulties	O
+.	O
+As	O
+schedules	O
+slipped	O
+,	O
+the	O
+delayed	O
+departures	O
+and	O
+late	O
+arrivals	O
+led	O
+to	O
+systemwide	O
+breakdowns	O
+,	O
+customers	O
+missed	O
+their	O
+connections	O
+,	O
+and	O
+airline	O
+work	O
+activities	O
+fell	O
+further	O
+out	O
+of	O
+sync	O
+.	O
+In	O
+offering	O
+possible	O
+answers	O
+,	O
+we	O
+emphasize	O
+the	O
+need	O
+to	O
+consider	O
+the	O
+customer	O
+as	O
+participant	O
+,	O
+following	O
+the	O
+human-centered	B-KEY
+computing	I-KEY
+model	I-KEY
+.	O
+Our	O
+study	O
+applied	O
+ethnographic	O
+methods	O
+to	O
+understand	O
+the	O
+airline	O
+system	O
+domain	O
+and	O
+the	O
+nature	O
+of	O
+airline	B-KEY
+delays	I-KEY
+,	O
+and	O
+it	O
+revealed	O
+the	O
+deficiencies	O
+of	O
+the	O
+airline	O
+production	O
+system	O
+model	O
+of	O
+operations	O
+.	O
+The	O
+research	O
+insights	O
+that	O
+led	O
+us	O
+to	O
+shift	O
+from	O
+a	O
+production	O
+and	O
+marketing	O
+system	O
+perspective	O
+to	O
+a	O
+customer-as-participant	B-KEY
+view	I-KEY
+might	O
+appear	O
+obvious	O
+to	O
+some	O
+readers	O
+.	O
+However	O
+,	O
+we	O
+do	O
+not	O
+know	O
+of	O
+any	O
+airline	O
+that	O
+designs	O
+its	O
+operations	O
+and	O
+technologies	O
+around	O
+any	O
+other	O
+model	O
+than	O
+the	O
+production	O
+and	O
+marketing	O
+system	O
+view	O
+.	O
+Our	O
+human-centered	O
+analysis	O
+used	O
+ethnographic	O
+methods	O
+to	O
+gather	O
+information	O
+,	O
+offering	O
+new	O
+insight	O
+into	O
+airline	B-KEY
+delays	I-KEY
+and	O
+suggesting	O
+effective	O
+ways	O
+to	O
+improve	O
+operations	B-KEY
+reliability	I-KEY
+
+International	B-KEY
+news	I-KEY
+sites	I-KEY
+in	O
+English	O
+Web	B-KEY
+access	I-KEY
+to	O
+news	O
+sites	O
+all	O
+over	O
+the	O
+world	O
+allows	O
+us	O
+the	O
+opportunity	O
+to	O
+have	O
+an	O
+electronic	O
+news	O
+stand	O
+readily	O
+available	O
+and	O
+stocked	O
+with	O
+a	O
+variety	O
+of	O
+foreign	O
+-LRB-	O
+to	O
+us	O
+-RRB-	O
+news	O
+sites	O
+.	O
+A	O
+large	O
+number	O
+of	O
+currently	O
+available	O
+foreign	O
+sites	O
+are	O
+English-language	B-KEY
+publications	I-KEY
+or	O
+English	O
+language	O
+versions	O
+of	O
+non-North	O
+American	O
+sites	O
+.	O
+These	O
+sites	O
+are	O
+quite	O
+varied	O
+in	O
+terms	O
+of	O
+quality	O
+,	O
+coverage	O
+,	O
+and	O
+style	O
+.	O
+Finding	O
+them	O
+can	O
+present	O
+a	O
+challenge	O
+.	O
+Using	O
+them	O
+effectively	O
+requires	O
+critical-thinking	B-KEY
+skills	I-KEY
+that	O
+are	O
+a	O
+part	O
+of	O
+media	B-KEY
+awareness	I-KEY
+or	O
+digital	B-KEY
+literacy	I-KEY
+
+Software	B-KEY
+Technology	I-KEY
+:	O
+looking	O
+for	O
+quality	O
+accountants	O
+Software	B-KEY
+Technology	I-KEY
+wants	O
+to	O
+turn	O
+23	O
+years	O
+of	O
+reselling	B-KEY
+experience	O
+in	O
+the	O
+legal	O
+business	O
+into	O
+an	O
+asset	O
+in	O
+the	O
+accounting	B-KEY
+market	I-KEY
+
+CyberEthics	B-KEY
+bibliography	I-KEY
+2002	O
+:	O
+a	O
+select	O
+list	O
+of	O
+recent	O
+works	O
+Included	O
+in	O
+the	O
+2002	B-KEY
+annual	I-KEY
+bibliography	I-KEY
+update	O
+is	O
+a	O
+select	O
+list	O
+of	O
+recent	B-KEY
+books	I-KEY
+and	O
+conference	B-KEY
+proceedings	I-KEY
+that	O
+have	O
+been	O
+published	O
+since	O
+2000	O
+.	O
+Also	O
+included	O
+is	O
+a	O
+select	O
+list	O
+of	O
+special	B-KEY
+issues	I-KEY
+of	O
+journals	B-KEY
+and	O
+periodicals	B-KEY
+that	O
+were	O
+recently	O
+published	O
+.	O
+For	O
+additional	O
+lists	O
+of	O
+recently	O
+published	O
+books	O
+and	O
+articles	O
+,	O
+see	O
+ibid	O
+.	O
+-LRB-	O
+June	O
+2000	O
+,	O
+June	O
+2001	O
+-RRB-	O
+
+The	O
+effect	O
+of	O
+a	O
+male-oriented	O
+computer	B-KEY
+gaming	I-KEY
+culture	O
+on	O
+careers	B-KEY
+in	O
+the	O
+computer	B-KEY
+industry	I-KEY
+If	O
+careers	B-KEY
+in	O
+the	O
+computer	B-KEY
+industry	I-KEY
+were	O
+viewed	O
+,	O
+it	O
+would	O
+be	O
+evident	O
+that	O
+there	O
+is	O
+a	O
+conspicuous	O
+gender	B-KEY
+gap	I-KEY
+between	O
+the	O
+number	O
+of	O
+male	O
+and	O
+female	B-KEY
+employees	I-KEY
+.	O
+The	O
+same	O
+gap	O
+can	O
+be	O
+observed	O
+at	O
+the	O
+college	O
+level	O
+where	O
+males	O
+are	O
+dominating	O
+females	O
+as	O
+to	O
+those	O
+who	O
+pursue	O
+and	O
+obtain	O
+a	O
+degree	O
+in	O
+computer	O
+science	O
+.	O
+The	O
+question	O
+that	O
+this	O
+research	O
+paper	O
+intends	O
+to	O
+show	O
+is	O
+:	O
+why	O
+are	O
+males	O
+so	O
+dominant	O
+when	O
+it	O
+comes	O
+to	O
+computer	O
+related	O
+matters	O
+?	O
+The	O
+author	O
+has	O
+traced	O
+this	O
+question	O
+back	O
+to	O
+the	O
+computer	B-KEY
+game	I-KEY
+.	O
+Computer	B-KEY
+games	I-KEY
+are	O
+a	O
+fun	O
+medium	O
+and	O
+provide	O
+the	O
+means	O
+for	O
+an	O
+individual	O
+to	O
+become	O
+computer	O
+literate	O
+through	O
+the	O
+engagement	O
+of	O
+spatial	B-KEY
+learning	I-KEY
+and	O
+cognitive	B-KEY
+processing	I-KEY
+abilities	O
+.	O
+Since	O
+such	O
+games	O
+are	O
+marketed	B-KEY
+almost	O
+exclusively	O
+to	O
+males	O
+,	O
+females	O
+have	O
+a	O
+distinct	O
+disadvantage	O
+.	O
+Males	O
+are	O
+more	O
+computer	O
+literate	O
+through	O
+the	O
+playing	O
+of	O
+computer	B-KEY
+games	I-KEY
+,	O
+and	O
+are	O
+provided	O
+with	O
+an	O
+easy	O
+lead-in	O
+to	O
+more	O
+advanced	O
+utilization	O
+of	O
+computers	O
+such	O
+as	O
+programming	O
+.	O
+Females	O
+tend	O
+to	O
+be	O
+turned	O
+off	O
+due	O
+to	O
+the	O
+male	B-KEY
+stereotypes	I-KEY
+and	O
+marketing	B-KEY
+associated	O
+with	O
+games	O
+and	O
+thus	O
+begins	O
+the	O
+gender	B-KEY
+gap	I-KEY
+
+Breast	B-KEY
+cancer	I-KEY
+:	O
+effectiveness	O
+of	O
+computer-aided	O
+diagnosis-observer	O
+study	O
+with	O
+independent	O
+database	O
+of	O
+mammograms	O
+Evaluates	O
+the	O
+effectiveness	O
+of	O
+a	O
+computerized	B-KEY
+classification	I-KEY
+method	I-KEY
+as	O
+an	O
+aid	O
+to	O
+radiologists	O
+reviewing	O
+clinical	B-KEY
+mammograms	I-KEY
+for	O
+which	O
+the	O
+diagnoses	O
+were	O
+unknown	O
+to	O
+both	O
+the	O
+radiologists	O
+and	O
+the	O
+computer	O
+.	O
+Six	O
+mammographers	B-KEY
+and	O
+six	O
+community	B-KEY
+radiologists	I-KEY
+participated	O
+in	O
+an	O
+observer	B-KEY
+study	I-KEY
+.	O
+These	O
+12	O
+radiologists	O
+interpreted	O
+,	O
+with	O
+and	O
+without	O
+the	O
+computer	B-KEY
+aid	I-KEY
+,	O
+110	O
+cases	O
+that	O
+were	O
+unknown	O
+to	O
+both	O
+the	O
+12	O
+radiologist	B-KEY
+observers	I-KEY
+and	O
+the	O
+trained	B-KEY
+computer	I-KEY
+classification	I-KEY
+scheme	I-KEY
+.	O
+The	O
+radiologists	O
+'	O
+performances	B-KEY
+in	O
+differentiating	O
+between	O
+benign	O
+and	O
+malignant	B-KEY
+masses	I-KEY
+without	O
+and	O
+with	O
+the	O
+computer	B-KEY
+aid	I-KEY
+were	O
+evaluated	O
+with	O
+receiver	O
+operating	O
+characteristic	O
+-LRB-	O
+ROC	O
+-RRB-	O
+analysis	O
+.	O
+Two-tailed	B-KEY
+P	I-KEY
+values	I-KEY
+were	O
+calculated	O
+for	O
+the	O
+Student	B-KEY
+t	I-KEY
+test	I-KEY
+to	O
+indicate	O
+the	O
+statistical	B-KEY
+significance	I-KEY
+of	O
+the	O
+differences	O
+in	O
+performances	B-KEY
+with	O
+and	O
+without	O
+the	O
+computer	B-KEY
+aid	I-KEY
+.	O
+When	O
+the	O
+computer	B-KEY
+aid	I-KEY
+was	O
+used	O
+,	O
+the	O
+average	B-KEY
+performance	I-KEY
+of	O
+the	O
+12	O
+radiologists	O
+improved	O
+,	O
+as	O
+indicated	O
+by	O
+an	O
+increase	O
+in	O
+the	O
+area	O
+under	O
+the	O
+ROC	O
+curve	O
+-LRB-	O
+A/sub	O
+z	O
+/	O
+-RRB-	O
+from	O
+0.93	O
+to	O
+0.96	O
+-LRB-	O
+P	O
+<	O
+.001	O
+-RRB-	O
+,	O
+by	O
+an	O
+increase	O
+in	O
+partial	O
+area	O
+under	O
+the	O
+ROC	O
+curve	O
+-LRB-	O
+/	O
+sub	O
+0.9	O
+/	O
+0A	O
+'	O
+/	O
+sub	O
+z	O
+/	O
+-RRB-	O
+from	O
+0.56	O
+to	O
+0.72	O
+-LRB-	O
+P	O
+<	O
+.001	O
+-RRB-	O
+,	O
+and	O
+by	O
+an	O
+increase	O
+in	O
+sensitivity	O
+from	O
+94	O
+%	O
+to	O
+98	O
+%	O
+-LRB-	O
+P	O
+=	O
+.022	O
+-RRB-	O
+.	O
+No	O
+statistically	B-KEY
+significant	I-KEY
+difference	O
+in	O
+specificity	O
+was	O
+found	O
+between	O
+readings	O
+with	O
+and	O
+those	O
+without	O
+computer	B-KEY
+aid	I-KEY
+-LRB-	O
+Delta	O
++	O
+-0.014	O
+;	O
+P	O
+=	O
+.46	O
+;	O
+95	O
+%	O
+Cl	O
+:	O
+-0.054	O
+,	O
+0.026	O
+-RRB-	O
+,	O
+where	O
+Delta	O
+is	O
+difference	O
+in	O
+specificity	O
+.	O
+When	O
+we	O
+analyzed	O
+results	O
+from	O
+the	O
+mammographers	B-KEY
+and	O
+community	B-KEY
+radiologists	I-KEY
+as	O
+separate	O
+groups	O
+,	O
+a	O
+larger	O
+improvement	O
+was	O
+demonstrated	O
+for	O
+the	O
+community	B-KEY
+radiologists	I-KEY
+.	O
+Computer-aided	B-KEY
+diagnosis	I-KEY
+can	O
+potentially	O
+help	O
+radiologists	O
+improve	O
+their	O
+diagnostic	B-KEY
+accuracy	I-KEY
+in	O
+the	O
+task	O
+of	O
+differentiating	O
+between	O
+benign	O
+and	O
+malignant	B-KEY
+masses	I-KEY
+seen	O
+on	O
+mammograms	O
+
+Intelligent	B-KEY
+control	I-KEY
+of	O
+life	B-KEY
+support	I-KEY
+for	O
+space	B-KEY
+missions	I-KEY
+Future	O
+manned	B-KEY
+space	I-KEY
+operations	I-KEY
+will	O
+include	O
+a	O
+greater	O
+use	O
+of	O
+automation	B-KEY
+than	O
+we	O
+currently	O
+see	O
+.	O
+For	O
+example	O
+,	O
+semiautonomous	B-KEY
+robots	I-KEY
+and	O
+software	B-KEY
+agents	I-KEY
+will	O
+perform	O
+difficult	O
+tasks	O
+while	O
+operating	O
+unattended	O
+most	O
+of	O
+the	O
+time	O
+.	O
+As	O
+these	O
+automated	B-KEY
+agents	O
+become	O
+more	O
+prevalent	O
+,	O
+human	O
+contact	O
+with	O
+them	O
+will	O
+occur	O
+more	O
+often	O
+and	O
+become	O
+more	O
+routine	O
+,	O
+so	O
+designing	O
+these	O
+automated	O
+agents	O
+according	O
+to	O
+the	O
+principles	O
+of	O
+human-centered	O
+computing	O
+is	O
+important	O
+.	O
+We	O
+describe	O
+two	O
+cases	O
+of	O
+semiautonomous	B-KEY
+control	I-KEY
+software	I-KEY
+developed	O
+and	O
+fielded	O
+in	O
+test	O
+environments	O
+at	O
+the	O
+NASA	B-KEY
+Johnson	I-KEY
+Space	I-KEY
+Center	I-KEY
+.	O
+This	O
+software	O
+operated	O
+continuously	O
+at	O
+the	O
+JSC	O
+and	O
+interacted	O
+closely	O
+with	O
+humans	O
+for	O
+months	O
+at	O
+a	O
+time	O
+
+Boolean	B-KEY
+operators	I-KEY
+and	O
+the	O
+naive	O
+end-user	O
+:	O
+moving	O
+to	O
+AND	O
+Since	O
+so	O
+few	O
+end-users	O
+make	O
+use	O
+of	O
+Boolean	B-KEY
+searching	I-KEY
+,	O
+it	O
+is	O
+obvious	O
+that	O
+any	O
+effective	O
+solution	O
+needs	O
+to	O
+take	O
+this	O
+reality	O
+into	O
+account	O
+.	O
+The	O
+most	O
+important	O
+aspect	O
+of	O
+a	O
+technical	O
+solution	O
+should	O
+be	O
+that	O
+it	O
+does	O
+not	O
+require	O
+any	O
+effort	O
+on	O
+the	O
+part	O
+of	O
+users	O
+.	O
+What	O
+is	O
+clearly	O
+needed	O
+is	O
+for	O
+search	B-KEY
+engine	I-KEY
+designers	I-KEY
+and	O
+programmers	O
+to	O
+take	O
+account	O
+of	O
+the	O
+information-seeking	B-KEY
+behavior	I-KEY
+of	O
+Internet	B-KEY
+users	O
+.	O
+Users	O
+must	O
+be	O
+able	O
+to	O
+enter	O
+a	O
+series	O
+of	O
+words	O
+at	O
+random	O
+and	O
+have	O
+those	O
+words	O
+automatically	O
+treated	O
+as	O
+a	O
+carefully	O
+constructed	O
+Boolean	O
+AND	O
+search	O
+statement	O
+
+Distribution	B-KEY
+software	O
+:	O
+ROI	O
+is	O
+king	O
+Middle-market	O
+accounting	B-KEY
+software	I-KEY
+vendors	O
+are	O
+taking	O
+to	O
+the	O
+open	O
+road	O
+,	O
+by	O
+way	O
+of	O
+souped-up	O
+distribution	B-KEY
+suites	O
+that	O
+can	O
+track	O
+product	O
+as	O
+it	O
+wends	O
+its	O
+way	O
+from	O
+warehouse	O
+floor	O
+to	O
+customer	O
+site	O
+.	O
+Integration	O
+provides	O
+efficiencies	O
+,	O
+and	O
+cost	O
+savings	O
+
+Parallel	B-KEY
+interior	I-KEY
+point	I-KEY
+schemes	I-KEY
+for	O
+solving	O
+multistage	B-KEY
+convex	I-KEY
+programming	I-KEY
+The	O
+predictor-corrector	B-KEY
+interior-point	I-KEY
+path-following	I-KEY
+algorithm	I-KEY
+is	O
+promising	O
+in	O
+solving	O
+multistage	B-KEY
+convex	I-KEY
+programming	I-KEY
+problems	O
+.	O
+Among	O
+many	O
+other	O
+general	O
+good	O
+features	O
+of	O
+this	O
+algorithm	O
+,	O
+especially	O
+attractive	O
+is	O
+that	O
+the	O
+algorithm	O
+allows	O
+the	O
+possibility	O
+to	O
+parallelise	O
+the	O
+major	O
+computations	O
+.	O
+The	O
+dynamic	B-KEY
+structure	I-KEY
+of	O
+the	O
+multistage	O
+problems	O
+specifies	O
+a	O
+block-tridiagonal	B-KEY
+system	I-KEY
+at	O
+each	O
+Newton	B-KEY
+step	I-KEY
+of	O
+the	O
+algorithm	O
+.	O
+A	O
+wrap-around	B-KEY
+permutation	I-KEY
+is	O
+then	O
+used	O
+to	O
+implement	O
+the	O
+parallel	B-KEY
+computation	I-KEY
+for	O
+this	O
+step	O
+
+Exact	O
+frequency-domain	B-KEY
+reconstruction	I-KEY
+for	O
+thermoacoustic	B-KEY
+tomography	I-KEY
+.	O
+II	O
+.	O
+Cylindrical	B-KEY
+geometry	I-KEY
+For	O
+pt	O
+.	O
+I	O
+see	O
+ibid.	O
+,	O
+vol	O
+.	O
+21	O
+,	O
+no.	O
+7	O
+,	O
+p.	O
+823-8	O
+-LRB-	O
+2002	O
+-RRB-	O
+.	O
+Microwave-induced	O
+thermoacoustic	B-KEY
+tomography	I-KEY
+-LRB-	O
+TAT	O
+-RRB-	O
+in	O
+a	O
+cylindrical	O
+configuration	O
+is	O
+developed	O
+to	O
+image	O
+biological	O
+tissue	O
+.	O
+Thermoacoustic	O
+signals	O
+are	O
+acquired	O
+by	O
+scanning	O
+a	O
+flat	B-KEY
+ultrasonic	I-KEY
+transducer	I-KEY
+.	O
+Using	O
+a	O
+new	O
+expansion	O
+of	O
+a	O
+spherical	O
+wave	O
+in	O
+cylindrical	O
+coordinates	O
+,	O
+we	O
+apply	O
+the	O
+Fourier	O
+and	O
+Hankel	B-KEY
+transforms	I-KEY
+to	O
+TAT	O
+and	O
+obtain	O
+an	O
+exact	O
+frequency-domain	B-KEY
+reconstruction	I-KEY
+method	O
+.	O
+The	O
+effect	O
+of	O
+discrete	O
+spatial	O
+sampling	O
+on	O
+image	O
+quality	O
+is	O
+analyzed	O
+.	O
+An	O
+aliasing-proof	B-KEY
+reconstruction	I-KEY
+method	I-KEY
+is	O
+proposed	O
+.	O
+Numerical	O
+and	O
+experimental	O
+results	O
+are	O
+included	O
+
+Novel	O
+TCP	B-KEY
+congestion	I-KEY
+control	I-KEY
+scheme	I-KEY
+and	O
+its	O
+performance	B-KEY
+evaluation	I-KEY
+A	O
+novel	O
+self-tuning	O
+proportional	O
+and	O
+derivative	O
+-LRB-	O
+ST-PD	O
+-RRB-	O
+control	O
+based	O
+TCP	B-KEY
+congestion	I-KEY
+control	I-KEY
+scheme	I-KEY
+is	O
+proposed	O
+.	O
+The	O
+new	O
+scheme	O
+approaches	O
+the	O
+congestion	O
+control	O
+problem	O
+from	O
+a	O
+control-theoretical	B-KEY
+perspective	I-KEY
+and	O
+overcomes	O
+several	O
+Important	O
+limitations	O
+associated	O
+with	O
+existing	O
+TCP	B-KEY
+congestion	I-KEY
+control	I-KEY
+schemes	I-KEY
+,	O
+which	O
+are	O
+heuristic	O
+based	O
+.	O
+In	O
+the	O
+proposed	O
+scheme	O
+,	O
+a	O
+PD	B-KEY
+controller	I-KEY
+is	O
+employed	O
+to	O
+keep	O
+the	O
+buffer	B-KEY
+occupancy	I-KEY
+of	O
+the	O
+bottleneck	B-KEY
+node	I-KEY
+on	O
+the	O
+connection	B-KEY
+path	I-KEY
+at	O
+an	O
+ideal	O
+operating	O
+level	O
+,	O
+and	O
+it	O
+adjusts	O
+the	O
+TCP	O
+window	O
+accordingly	O
+.	O
+The	O
+control	O
+gains	O
+of	O
+the	O
+PD	B-KEY
+controller	I-KEY
+are	O
+tuned	O
+online	O
+by	O
+a	O
+fuzzy	B-KEY
+logic	I-KEY
+controller	I-KEY
+based	O
+on	O
+the	O
+perceived	O
+bandwidth-delay	B-KEY
+product	I-KEY
+of	O
+the	O
+TCP	O
+connection	O
+.	O
+This	O
+scheme	O
+gives	O
+ST-PD	O
+TCP	O
+several	O
+advantages	O
+over	O
+current	O
+TCP	O
+implementations	O
+.	O
+These	O
+include	O
+rapid	O
+response	O
+to	O
+bandwidth	O
+variations	O
+,	O
+insensitivity	O
+to	O
+buffer	O
+sizes	O
+,	O
+and	O
+significant	O
+improvement	O
+of	O
+TCP	O
+throughput	O
+over	O
+lossy	B-KEY
+links	I-KEY
+by	O
+decoupling	O
+congestion	O
+control	O
+and	O
+error	O
+control	O
+functions	O
+of	O
+TCP	O
+
+The	O
+numerical	O
+solution	O
+of	O
+an	O
+evolution	B-KEY
+problem	I-KEY
+of	O
+second	O
+order	O
+in	O
+time	O
+on	O
+a	O
+closed	B-KEY
+smooth	I-KEY
+boundary	I-KEY
+We	O
+consider	O
+an	O
+initial	B-KEY
+value	I-KEY
+problem	I-KEY
+for	O
+the	O
+second-order	B-KEY
+differential	I-KEY
+equation	I-KEY
+with	O
+a	O
+Dirichlet-to-Neumann	O
+operator	O
+coefficient	O
+.	O
+For	O
+the	O
+numerical	O
+solution	O
+we	O
+carry	O
+out	O
+semi-discretization	O
+by	O
+the	O
+Laguerre	B-KEY
+transformation	I-KEY
+with	O
+respect	O
+to	O
+the	O
+time	O
+variable	O
+.	O
+Then	O
+an	O
+infinite	O
+system	O
+of	O
+the	O
+stationary	B-KEY
+operator	I-KEY
+equations	I-KEY
+is	O
+obtained	O
+.	O
+By	O
+potential	O
+theory	O
+,	O
+the	O
+operator	O
+equations	O
+are	O
+reduced	O
+to	O
+boundary	B-KEY
+integral	I-KEY
+equations	I-KEY
+of	O
+the	O
+second	O
+kind	O
+with	O
+logarithmic	O
+or	O
+hypersingular	B-KEY
+kernels	I-KEY
+.	O
+The	O
+full	O
+discretization	O
+is	O
+realized	O
+by	O
+Nystrom	O
+'s	O
+method	O
+which	O
+is	O
+based	O
+on	O
+the	O
+trigonometric	O
+quadrature	O
+rules	O
+.	O
+Numerical	O
+tests	O
+confirm	O
+the	O
+ability	O
+of	O
+the	O
+method	O
+to	O
+solve	O
+these	O
+types	O
+of	O
+nonstationary	O
+problems	O
+
+One	O
+and	O
+two	B-KEY
+facility	I-KEY
+network	I-KEY
+design	I-KEY
+revisited	O
+The	O
+one	B-KEY
+facility	I-KEY
+one	I-KEY
+commodity	I-KEY
+network	I-KEY
+design	I-KEY
+problem	I-KEY
+-LRB-	O
+OFOC	O
+-RRB-	O
+with	O
+nonnegative	B-KEY
+flow	I-KEY
+costs	I-KEY
+considers	O
+the	O
+problem	O
+of	O
+sending	O
+d	O
+units	O
+of	O
+flow	O
+from	O
+a	O
+source	O
+to	O
+a	O
+destination	O
+where	O
+arc	O
+capacity	O
+is	O
+purchased	O
+in	O
+batches	O
+of	O
+C	O
+units	O
+.	O
+The	O
+two	O
+facility	O
+problem	O
+-LRB-	O
+TFOC	O
+-RRB-	O
+is	O
+similar	O
+,	O
+but	O
+capacity	O
+can	O
+be	O
+purchased	O
+either	O
+in	O
+batches	O
+of	O
+C	O
+units	O
+or	O
+one	O
+unit	O
+.	O
+Flow	B-KEY
+costs	I-KEY
+are	O
+zero	O
+.	O
+These	O
+problems	O
+are	O
+known	O
+to	O
+be	O
+NP-hard	O
+.	O
+We	O
+describe	O
+an	O
+exact	O
+O	O
+-LRB-	O
+n/sup	O
+3/3/sup	O
+n	O
+/	O
+-RRB-	O
+algorithm	O
+for	O
+these	O
+problems	O
+based	O
+on	O
+the	O
+repeated	O
+use	O
+of	O
+a	O
+bipartite	B-KEY
+matching	I-KEY
+algorithm	I-KEY
+.	O
+We	O
+also	O
+present	O
+a	O
+better	O
+lower	B-KEY
+bound	I-KEY
+of	O
+Omega	O
+-LRB-	O
+n/sup	O
+2k	O
+*	O
+/	O
+-RRB-	O
+for	O
+an	O
+earlier	O
+Omega	O
+-LRB-	O
+n/sup	O
+2k	O
+/	O
+-RRB-	O
+algorithm	O
+described	O
+in	O
+the	O
+literature	O
+where	O
+k	O
+=	O
+-LSB-	O
+d/C	O
+-RSB-	O
+and	O
+k	O
+*	O
+=	O
+min	O
+-LCB-	O
+k	O
+,	O
+-LSB-	O
+-LRB-	O
+n	O
+2	O
+-RRB-	O
+/	O
+2	O
+-RSB-	O
+-RCB-	O
+.	O
+The	O
+matching	O
+algorithm	O
+is	O
+faster	O
+than	O
+this	O
+one	O
+for	O
+k	O
+>	O
+or	O
+=	O
+-LSB-	O
+-LRB-	O
+n	O
+-	O
+2	O
+-RRB-	O
+/	O
+2	O
+-RSB-	O
+.	O
+Finally	O
+,	O
+we	O
+provide	O
+another	O
+reformulation	O
+of	O
+the	O
+problem	O
+that	O
+is	O
+quasi	B-KEY
+integral	I-KEY
+.	O
+This	O
+property	O
+could	O
+be	O
+useful	O
+in	O
+designing	O
+a	O
+modified	O
+version	O
+of	O
+the	O
+simplex	O
+method	O
+to	O
+solve	O
+the	O
+problem	O
+using	O
+a	O
+sequence	O
+of	O
+pivots	B-KEY
+with	O
+integer	O
+extreme	O
+solutions	O
+,	O
+referred	O
+to	O
+as	O
+the	O
+integral	B-KEY
+simplex	I-KEY
+method	I-KEY
+in	O
+the	O
+literature	O
+
+New	O
+projection-type	B-KEY
+methods	I-KEY
+for	O
+monotone	B-KEY
+LCP	O
+with	O
+finite	O
+termination	O
+In	O
+this	O
+paper	O
+we	O
+establish	O
+two	O
+new	O
+projection-type	B-KEY
+methods	I-KEY
+for	O
+the	O
+solution	O
+of	O
+the	O
+monotone	B-KEY
+linear	O
+complementarity	O
+problem	O
+-LRB-	O
+LCP	O
+-RRB-	O
+.	O
+The	O
+methods	O
+are	O
+a	O
+combination	O
+of	O
+the	O
+extragradient	B-KEY
+method	I-KEY
+and	O
+the	O
+Newton	B-KEY
+method	I-KEY
+,	O
+in	O
+which	O
+the	O
+active	B-KEY
+set	I-KEY
+strategy	I-KEY
+is	O
+used	O
+and	O
+only	O
+one	O
+linear	B-KEY
+system	I-KEY
+of	I-KEY
+equations	I-KEY
+with	O
+lower	O
+dimension	O
+is	O
+solved	O
+at	O
+each	O
+iteration	B-KEY
+.	O
+It	O
+is	O
+shown	O
+that	O
+under	O
+the	O
+assumption	O
+of	O
+monotonicity	B-KEY
+,	O
+these	O
+two	O
+methods	O
+are	O
+globally	O
+and	O
+linearly	O
+convergent	B-KEY
+.	O
+Furthermore	O
+,	O
+under	O
+a	O
+nondegeneracy	B-KEY
+condition	I-KEY
+they	O
+have	O
+a	O
+finite	B-KEY
+termination	I-KEY
+property	O
+.	O
+Finally	O
+,	O
+the	O
+methods	O
+are	O
+extended	O
+to	O
+solving	O
+the	O
+monotone	B-KEY
+affine	O
+variational	O
+inequality	O
+problem	O
+
+Control	O
+of	O
+integral	B-KEY
+processes	I-KEY
+with	O
+dead-time	B-KEY
+.	O
+2	O
+.	O
+Quantitative	B-KEY
+analysis	I-KEY
+For	O
+part	O
+1	O
+,	O
+see	O
+ibid.	O
+,	O
+p.285-90	O
+,	O
+-LRB-	O
+2002	O
+-RRB-	O
+.	O
+Several	O
+different	O
+control	O
+schemes	O
+for	O
+integral	B-KEY
+processes	I-KEY
+with	O
+dead	O
+time	O
+resulted	O
+in	O
+the	O
+same	O
+disturbance	B-KEY
+response	I-KEY
+.	O
+It	O
+has	O
+already	O
+been	O
+shown	O
+that	O
+such	O
+a	O
+response	O
+is	O
+subideal	O
+.	O
+Hence	O
+,	O
+it	O
+is	O
+necessary	O
+to	O
+quantitatively	O
+analyse	O
+the	O
+achievable	O
+specifications	O
+and	O
+the	O
+robust	B-KEY
+stability	O
+regions	O
+.	O
+The	O
+control	O
+parameter	O
+can	O
+be	O
+quantitatively	O
+determined	O
+with	O
+a	O
+compromise	O
+between	O
+the	O
+disturbance	B-KEY
+response	I-KEY
+and	O
+the	O
+robustness	B-KEY
+.	O
+Four	O
+specifications	O
+:	O
+-LRB-	O
+normalised	O
+-RRB-	O
+maximum	B-KEY
+dynamic	I-KEY
+error	I-KEY
+,	O
+maximum	B-KEY
+decay	I-KEY
+rate	I-KEY
+,	O
+-LRB-	O
+normalised	O
+-RRB-	O
+control	B-KEY
+action	I-KEY
+bound	I-KEY
+and	O
+approximate	B-KEY
+recovery	I-KEY
+time	I-KEY
+are	O
+used	O
+to	O
+characterise	O
+the	O
+step-disturbance	B-KEY
+response	I-KEY
+.	O
+It	O
+is	O
+shown	O
+that	O
+any	O
+attempt	O
+to	O
+obtain	O
+a	O
+-LRB-	O
+normalised	O
+-RRB-	O
+dynamic	O
+error	O
+less	O
+than	O
+tau	O
+/	O
+sub	O
+m	O
+/	O
+is	O
+impossible	O
+and	O
+a	O
+sufficient	B-KEY
+condition	I-KEY
+on	O
+the	O
+-LRB-	O
+relative	O
+-RRB-	O
+gain-uncertainty	B-KEY
+bound	I-KEY
+is	O
+square	O
+root	O
+-LRB-	O
+3	O
+-RRB-	O
+/	O
+2	O
+
+New	O
+hub	O
+gears	O
+up	O
+for	O
+algorithmic	O
+exchange	O
+Warwick	O
+University	O
+in	O
+the	O
+UK	O
+is	O
+on	O
+the	O
+up	O
+and	O
+up	O
+.	O
+Sometimes	O
+considered	O
+a	O
+typical	O
+1960s	O
+,	O
+middle-of-the-road	O
+redbrick	O
+institution-not	O
+known	O
+for	O
+their	O
+distinction	O
+the	O
+2001	O
+UK	O
+Research	O
+Assessment	O
+Exercise	O
+-LRB-	O
+RAE	O
+-RRB-	O
+shows	O
+its	O
+research	O
+to	O
+be	O
+the	O
+fifth	O
+most	O
+highly-rated	O
+in	O
+the	O
+country	O
+,	O
+with	O
+outstanding	O
+standards	O
+in	O
+the	O
+sciences	O
+.	O
+This	O
+impressive	O
+performance	O
+has	O
+rightly	O
+given	O
+Warwick	O
+a	O
+certain	O
+amount	O
+of	O
+muscle	O
+,	O
+which	O
+it	O
+is	O
+flexing	O
+rather	O
+effectively	O
+,	O
+aided	O
+by	O
+a	O
+snappy	O
+approach	O
+to	O
+making	O
+things	O
+happen	O
+that	O
+leaves	O
+some	O
+older	O
+institutions	O
+standing	O
+.	O
+The	O
+result	O
+is	O
+a	O
+brand	O
+new	O
+Centre	O
+for	O
+Scientific	O
+Computing	O
+-LRB-	O
+CSC	O
+-RRB-	O
+,	O
+launched	O
+within	O
+a	O
+couple	O
+of	O
+years	O
+of	O
+its	O
+initial	O
+conception	O
+
+The	O
+paradigm	O
+of	O
+viral	O
+communication	O
+The	O
+IIW	O
+Institute	O
+of	O
+Information	O
+Management	O
+-LRB-	O
+www.IIW.de	O
+-RRB-	O
+is	O
+dealing	B-KEY
+with	I-KEY
+commercial	O
+applications	O
+of	O
+digital	O
+technologies	O
+,	O
+such	O
+as	B-KEY
+the	O
+Internet	O
+,	O
+digital	O
+printing	O
+,	O
+and	O
+many	O
+more	O
+.	O
+A	O
+study	O
+which	O
+has	O
+been	O
+carried	O
+out	O
+by	O
+the	O
+institute	O
+,	O
+identifies	O
+viral	B-KEY
+messages	I-KEY
+as	O
+a	O
+new	O
+paradigm	O
+of	O
+communication	O
+,	O
+mostly	O
+found	O
+in	O
+the	O
+area	O
+of	O
+Direct	B-KEY
+Marketing	I-KEY
+,	O
+and	O
+-	O
+who	O
+wonders	O
+-	O
+mainly	O
+within	O
+the	O
+USA	O
+.	O
+Viral	B-KEY
+messages	I-KEY
+underlie	O
+certain	O
+principles	O
+:	O
+-LRB-	O
+1	O
+-RRB-	O
+prospects	O
+and	O
+customers	O
+of	O
+the	O
+idea	O
+are	O
+offered	O
+a	O
+technology	O
+platform	O
+providing	O
+a	O
+possibility	O
+to	O
+send	O
+a	O
+message	O
+to	O
+a	O
+majority	O
+of	O
+persons	O
+;	O
+-LRB-	O
+2	O
+-RRB-	O
+there	O
+is	O
+an	O
+emotional	O
+or	O
+pecuniary	O
+incentive	O
+to	O
+participate	O
+.	O
+Ideally	O
+,	O
+niches	O
+of	O
+needs	O
+and	O
+market	O
+vacua	O
+are	O
+filled	O
+with	O
+funny	O
+ideas	O
+;	O
+-LRB-	O
+3	O
+-RRB-	O
+also	O
+,	O
+the	O
+recipients	O
+are	O
+facing	O
+emotional	O
+or	O
+pecuniary	O
+incentives	O
+to	O
+contact	O
+a	O
+majority	O
+of	O
+further	O
+recipients	O
+-	O
+this	O
+induces	O
+a	O
+snowball	O
+effect	O
+and	O
+the	O
+message	O
+is	O
+spread	O
+virally	O
+;	O
+and	O
+-LRB-	O
+4	O
+-RRB-	O
+the	O
+customer	O
+is	O
+activated	O
+as	O
+an	O
+``	O
+ambassador	O
+''	O
+of	O
+the	O
+piece	O
+of	O
+information	O
+,	O
+for	O
+instance	O
+promoting	O
+a	O
+product	O
+or	O
+a	O
+company	O
+.	O
+It	O
+is	O
+evident	O
+that	O
+there	O
+has	O
+been	O
+a	O
+long	O
+lasting	O
+history	O
+of	O
+what	O
+we	O
+call	O
+``	O
+word-of-mouth	O
+''	O
+ever	O
+since	O
+,	O
+however	O
+bundles	O
+of	O
+digital	O
+technologies	O
+empower	O
+the	O
+viral	B-KEY
+communication	I-KEY
+paradigm	I-KEY
+
+Integrated	B-KEY
+process	I-KEY
+control	I-KEY
+using	O
+an	O
+in	O
+situ	O
+sensor	O
+for	O
+etch	O
+The	O
+migration	O
+to	O
+tighter	O
+geometries	O
+and	O
+more	O
+complex	B-KEY
+process	I-KEY
+sequence	I-KEY
+integration	I-KEY
+schemes	I-KEY
+requires	O
+having	O
+the	O
+ability	O
+to	O
+compensate	O
+for	O
+upstream	O
+deviations	O
+from	O
+target	B-KEY
+specifications	I-KEY
+.	O
+Doing	O
+so	O
+ensures	O
+that-downstream	O
+process	O
+sequences	O
+operate	O
+on	O
+work-in-progress	O
+that	O
+is	O
+well	O
+within	O
+control	O
+.	O
+Because	O
+point-of-use	B-KEY
+visibility	I-KEY
+of	O
+work-in-progress	B-KEY
+quality	I-KEY
+has	O
+become	O
+of	O
+paramount	O
+concern	O
+in	O
+the	O
+industry	O
+'s	O
+drive	O
+to	O
+reduce	O
+scrap	O
+and	O
+improve	O
+yield	O
+,	O
+controlling	O
+trench	O
+depth	O
+has	O
+assumed	O
+greater	O
+importance	O
+.	O
+An	O
+integrated	O
+,	O
+interferometric	O
+based	O
+,	O
+rate	O
+monitor	O
+for	O
+etch-to-depth	O
+and	O
+spacer	B-KEY
+etch	I-KEY
+applications	I-KEY
+has	O
+been	O
+developed	O
+for	O
+controlling	O
+this	O
+parameter	O
+.	O
+This	O
+article	O
+demonstrates	O
+that	O
+the	O
+integrated	O
+rate	O
+monitor	O
+,	O
+using	O
+polarization	B-KEY
+and	O
+digital	B-KEY
+signal	I-KEY
+processing	I-KEY
+,	O
+enhances	O
+control	O
+etch-to-depth	O
+processes	O
+and	O
+can	O
+also	O
+be	O
+implemented	O
+as	O
+a	O
+predictive	O
+endpoint	O
+in	O
+a	O
+wafer	B-KEY
+manufacturing	I-KEY
+environment	I-KEY
+for	O
+dual	B-KEY
+damascene	I-KEY
+trench	I-KEY
+etch	I-KEY
+and	O
+spacer	B-KEY
+etch	I-KEY
+applications	I-KEY
+
+Supply	B-KEY
+chain	I-KEY
+infrastructures	I-KEY
+:	O
+system	B-KEY
+integration	I-KEY
+and	O
+information	B-KEY
+sharing	I-KEY
+The	O
+need	O
+for	O
+supply	B-KEY
+chain	I-KEY
+integration	I-KEY
+-LRB-	O
+SCI	O
+-RRB-	O
+methodologies	O
+has	O
+been	O
+increasing	O
+as	O
+a	O
+consequence	O
+of	O
+the	O
+globalization	B-KEY
+of	O
+production	B-KEY
+and	O
+sales	B-KEY
+,	O
+and	O
+the	O
+advancement	O
+of	O
+enabling	O
+information	O
+technologies	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+describe	O
+our	O
+experience	O
+with	O
+implementing	O
+and	O
+modeling	O
+SCIs	O
+.	O
+We	O
+present	O
+the	O
+integration	O
+architecture	O
+and	O
+the	O
+software	B-KEY
+components	I-KEY
+of	O
+our	O
+prototype	O
+implementation	O
+.	O
+We	O
+then	O
+discuss	O
+a	O
+variety	O
+of	O
+information	B-KEY
+sharing	I-KEY
+methodologies	O
+.	O
+Then	O
+,	O
+within	O
+the	O
+framework	O
+of	O
+a	O
+multi-echelon	B-KEY
+supply	I-KEY
+chain	I-KEY
+process	I-KEY
+model	I-KEY
+spanning	O
+multiple	B-KEY
+organizations	I-KEY
+,	O
+we	O
+summarize	O
+research	O
+on	O
+the	O
+benefits	O
+of	O
+intraorganizational	B-KEY
+knowledge	I-KEY
+sharing	I-KEY
+,	O
+and	O
+we	O
+discuss	O
+performance	B-KEY
+scalability	I-KEY
+
+Diagnostic	B-KEY
+expert	I-KEY
+system	I-KEY
+using	O
+non-monotonic	O
+reasoning	O
+The	O
+objective	O
+of	O
+this	O
+work	O
+is	O
+to	O
+develop	O
+an	O
+expert	O
+system	O
+for	O
+cucumber	B-KEY
+disorder	I-KEY
+diagnosis	I-KEY
+using	O
+non-monotonic	O
+reasoning	O
+to	O
+handle	O
+the	O
+situation	O
+when	O
+the	O
+system	O
+can	O
+not	O
+reach	O
+a	O
+conclusion	O
+.	O
+One	O
+reason	O
+for	O
+this	O
+situation	O
+is	O
+when	O
+the	O
+information	O
+is	O
+incomplete	O
+.	O
+Another	O
+reason	O
+is	O
+when	O
+the	O
+domain	O
+knowledge	O
+itself	O
+is	O
+incomplete	O
+.	O
+Another	O
+reason	O
+is	O
+when	O
+the	O
+information	O
+is	O
+inconsistent	O
+.	O
+This	O
+method	O
+maintains	O
+the	O
+truth	O
+of	O
+the	O
+system	O
+in	O
+case	O
+of	O
+changing	O
+a	O
+piece	O
+of	O
+information	O
+.	O
+The	O
+proposed	O
+method	O
+uses	O
+two	O
+types	O
+of	O
+non-monotonic	O
+reasoning	O
+namely	O
+:	O
+default	B-KEY
+reasoning	I-KEY
+and	O
+reasoning	O
+in	O
+the	O
+presence	O
+of	O
+inconsistent	B-KEY
+information	I-KEY
+to	O
+achieve	O
+its	O
+goal	O
+
+Estimation	O
+of	O
+the	O
+gradient	O
+of	O
+the	O
+solution	O
+of	O
+an	O
+adjoint	B-KEY
+diffusion	I-KEY
+equation	I-KEY
+by	O
+the	O
+Monte	B-KEY
+Carlo	I-KEY
+method	I-KEY
+For	O
+the	O
+case	O
+of	O
+isotropic	B-KEY
+diffusion	I-KEY
+we	O
+consider	O
+the	O
+representation	O
+of	O
+the	O
+weighted	B-KEY
+concentration	O
+of	O
+trajectories	O
+and	O
+its	O
+space	B-KEY
+derivatives	I-KEY
+in	O
+the	O
+form	O
+of	O
+integrals	B-KEY
+-LRB-	O
+with	O
+some	O
+weights	B-KEY
+-RRB-	O
+of	O
+the	O
+solution	O
+to	O
+the	O
+corresponding	O
+boundary	B-KEY
+value	I-KEY
+problem	I-KEY
+and	O
+its	O
+directional	B-KEY
+derivative	I-KEY
+of	O
+a	O
+convective	B-KEY
+velocity	I-KEY
+.	O
+If	O
+the	O
+convective	B-KEY
+velocity	I-KEY
+at	O
+the	O
+domain	B-KEY
+boundary	I-KEY
+is	O
+degenerate	O
+and	O
+some	O
+other	O
+additional	O
+conditions	O
+are	O
+imposed	O
+this	O
+representation	O
+allows	O
+us	O
+to	O
+construct	O
+an	O
+efficient	O
+`	O
+random	O
+walk	O
+by	O
+spheres	O
+and	O
+balls	O
+'	O
+algorithm	O
+.	O
+When	O
+these	O
+conditions	O
+are	O
+violated	O
+,	O
+transition	O
+to	O
+modelling	O
+the	O
+diffusion	B-KEY
+trajectories	I-KEY
+by	O
+the	O
+Euler	B-KEY
+scheme	I-KEY
+is	O
+realized	O
+,	O
+and	O
+the	O
+directional	B-KEY
+derivative	I-KEY
+of	O
+velocity	O
+is	O
+estimated	O
+by	O
+the	O
+dependent	B-KEY
+testing	I-KEY
+method	I-KEY
+,	O
+using	O
+the	O
+parallel	B-KEY
+modelling	I-KEY
+of	O
+two	O
+closely-spaced	O
+diffusion	B-KEY
+trajectories	I-KEY
+.	O
+We	O
+succeeded	O
+in	O
+justifying	O
+this	O
+method	O
+by	O
+statistically	B-KEY
+equivalent	I-KEY
+transition	I-KEY
+to	O
+modelling	O
+a	O
+single	O
+trajectory	O
+after	O
+the	O
+first	O
+step	O
+in	O
+the	O
+Euler	B-KEY
+scheme	I-KEY
+,	O
+using	O
+a	O
+suitable	O
+weight	B-KEY
+.	O
+This	O
+weight	B-KEY
+also	O
+admits	O
+direct	B-KEY
+differentiation	I-KEY
+with	O
+respect	O
+to	O
+the	O
+initial	B-KEY
+coordinate	I-KEY
+along	O
+a	O
+given	O
+direction	O
+.	O
+The	O
+resulting	O
+weight	B-KEY
+algorithm	O
+for	O
+calculating	O
+concentration	B-KEY
+derivatives	I-KEY
+is	O
+especially	O
+efficient	O
+if	O
+the	O
+initial	O
+point	O
+is	O
+in	O
+the	O
+subdomain	O
+in	O
+which	O
+the	O
+coefficients	O
+of	O
+the	O
+diffusion	O
+equation	O
+are	O
+constant	O
+
+Tactical	B-KEY
+airborne	I-KEY
+reconnaissance	I-KEY
+goes	O
+dual-band	O
+and	O
+beyond	O
+Multispectral	B-KEY
+imaging	I-KEY
+technologies	I-KEY
+are	O
+satisfying	O
+the	O
+need	O
+for	O
+a	O
+``	O
+persistent	O
+''	O
+look	O
+at	O
+the	O
+battlefield	B-KEY
+.	O
+We	O
+highlight	O
+the	O
+need	O
+to	O
+persistently	O
+monitor	O
+a	O
+battlefield	B-KEY
+to	O
+determine	O
+exactly	O
+who	O
+and	O
+what	O
+is	O
+there	O
+.	O
+For	O
+example	O
+,	O
+infrared	B-KEY
+imaging	I-KEY
+can	O
+be	O
+used	O
+to	O
+expose	O
+the	O
+fuel	B-KEY
+status	I-KEY
+of	O
+an	O
+aircraft	B-KEY
+on	O
+the	O
+runway	O
+.	O
+A	O
+daytime	O
+,	O
+visible-spectrum	O
+image	O
+of	O
+the	O
+same	O
+aircraft	B-KEY
+would	O
+offer	O
+information	O
+about	O
+external	O
+details	O
+,	O
+such	O
+as	O
+the	O
+plane	O
+'s	O
+markings	O
+and	O
+paint	O
+scheme	O
+.	O
+A	O
+dual-band	B-KEY
+camera	I-KEY
+enables	O
+precision	B-KEY
+image	I-KEY
+registration	I-KEY
+by	O
+fusion	O
+and	O
+frequently	O
+yields	O
+more	O
+information	O
+than	O
+is	O
+possible	O
+by	O
+evaluating	O
+the	O
+images	O
+separately	O
+
+Development	O
+and	O
+validation	O
+of	O
+user-adaptive	B-KEY
+navigation	I-KEY
+and	O
+information	B-KEY
+retrieval	I-KEY
+tools	I-KEY
+for	O
+an	O
+intranet	B-KEY
+portal	I-KEY
+organizational	B-KEY
+memory	I-KEY
+information	I-KEY
+system	I-KEY
+Based	O
+on	O
+previous	O
+research	O
+and	O
+properties	O
+of	O
+organizational	O
+memory	O
+,	O
+a	O
+conceptual	B-KEY
+model	I-KEY
+for	O
+navigation	O
+and	O
+retrieval	O
+functions	O
+in	O
+an	O
+intranet	B-KEY
+portal	I-KEY
+organizational	B-KEY
+memory	I-KEY
+information	I-KEY
+system	I-KEY
+was	O
+proposed	O
+,	O
+and	O
+two	O
+human-centred	O
+features	O
+-LRB-	O
+memory	B-KEY
+structure	I-KEY
+map	I-KEY
+and	O
+history-based	B-KEY
+tool	I-KEY
+-RRB-	O
+were	O
+developed	O
+to	O
+support	O
+user	O
+'s	O
+navigation	O
+and	O
+retrieval	O
+in	O
+a	O
+well-known	O
+organizational	O
+memory	O
+.	O
+To	O
+test	O
+two	O
+hypotheses	O
+concerning	O
+the	O
+validity	O
+of	O
+the	O
+conceptual	B-KEY
+model	I-KEY
+and	O
+two	O
+human-centred	O
+features	O
+,	O
+an	O
+experiment	B-KEY
+was	O
+conducted	O
+with	O
+30	O
+subjects	O
+.	O
+Testing	O
+of	O
+the	O
+two	O
+hypotheses	O
+indicated	O
+the	O
+following	O
+:	O
+-LRB-	O
+1	O
+-RRB-	O
+the	O
+memory	B-KEY
+structure	I-KEY
+map	I-KEY
+'s	O
+users	O
+showed	O
+29	O
+%	O
+better	O
+performance	O
+in	O
+navigation	O
+,	O
+and	O
+-LRB-	O
+2	O
+-RRB-	O
+the	O
+history-based	B-KEY
+tool	I-KEY
+'s	O
+users	O
+outperformed	O
+by	O
+34	O
+%	O
+in	O
+identifying	O
+information	O
+.	O
+The	O
+results	O
+of	O
+the	O
+study	O
+suggest	O
+that	O
+a	O
+conceptual	B-KEY
+model	I-KEY
+and	O
+two	O
+human-centred	O
+features	O
+could	O
+be	O
+used	O
+in	O
+a	O
+user-adaptive	B-KEY
+interface	I-KEY
+design	I-KEY
+to	O
+improve	O
+user	O
+'s	O
+performance	O
+in	O
+an	O
+intranet	B-KEY
+portal	I-KEY
+organizational	B-KEY
+memory	I-KEY
+information	I-KEY
+system	I-KEY
+
+Anticipating	O
+the	O
+further	O
+development	O
+of	O
+cadastral	O
+systems	O
+Although	O
+the	O
+paper	O
+recognises	O
+the	O
+merits	O
+of	O
+the	O
+evolution	O
+of	O
+cadastral	O
+systems	O
+towards	O
+an	O
+increased	O
+capability	O
+over	O
+time	O
+,	O
+it	O
+promotes	O
+a	O
+radical	O
+introduction	O
+or	O
+overhaul	O
+of	O
+existing	O
+cadastral	O
+systems	O
+.	O
+It	O
+encourages	O
+the	O
+development	O
+of	O
+a	O
+capability	O
+to	O
+cope	O
+with	O
+some	O
+key	O
+drivers	O
+of	O
+major	O
+change	O
+.	O
+These	O
+have	O
+been	O
+identified	O
+as	O
+globalisation	B-KEY
+,	O
+the	O
+advent	O
+of	O
+fully	O
+automated	B-KEY
+cadastral	I-KEY
+environments	I-KEY
+,	O
+improved	O
+decentralised	O
+methods	O
+of	O
+governance	O
+and	O
+greatly	O
+improved	O
+service	B-KEY
+delivery	I-KEY
+of	O
+future	O
+cadastral	O
+systems	O
+to	O
+a	O
+wide	O
+range	O
+of	O
+users	O
+.	O
+The	O
+paper	O
+promotes	O
+the	O
+registration	O
+of	O
+title	O
+supported	O
+by	O
+government	B-KEY
+guarantee	I-KEY
+as	O
+an	O
+effective	O
+means	O
+for	O
+rapidly	O
+introducing	O
+cadastral	O
+systems	O
+to	O
+facilitate	O
+globally	B-KEY
+competitive	I-KEY
+land	I-KEY
+markets	I-KEY
+in	O
+developing	B-KEY
+countries	I-KEY
+.	O
+In	O
+developing	O
+automated	B-KEY
+environments	I-KEY
+for	O
+cadastral	O
+systems	O
+,	O
+the	O
+need	O
+to	O
+completely	O
+re-engineer	O
+and	O
+redesign	O
+cadastral	O
+systems	O
+to	O
+meet	O
+basic	O
+cadastral	B-KEY
+principles	I-KEY
+and	O
+responsiveness	O
+to	O
+individual	O
+user	B-KEY
+needs	I-KEY
+is	O
+promoted	O
+.	O
+In	O
+this	O
+environment	O
+,	O
+highly	B-KEY
+decentralised	I-KEY
+cadastral	I-KEY
+operations	I-KEY
+and	O
+administration	O
+combined	O
+with	O
+light	B-KEY
+regulatory	I-KEY
+control	I-KEY
+are	O
+advocated	O
+as	O
+a	O
+future	B-KEY
+governance	I-KEY
+strategy	I-KEY
+.	O
+With	O
+regard	O
+to	O
+the	O
+level	O
+of	O
+services	O
+to	O
+users	O
+,	O
+an	O
+emphasis	O
+on	O
+recognising	O
+and	O
+serving	O
+the	O
+future	O
+needs	O
+of	O
+users	O
+is	O
+seen	O
+as	O
+essential	O
+.	O
+International	O
+and	O
+national	O
+professional	O
+and	O
+user	B-KEY
+organisations	I-KEY
+involved	O
+in	O
+land	B-KEY
+administration	I-KEY
+are	O
+seen	O
+as	O
+an	O
+important	O
+vehicle	O
+for	O
+developing	O
+strategies	O
+and	O
+providing	O
+evaluation	O
+to	O
+guide	O
+the	O
+over-arching	O
+development	O
+of	O
+cadastral	O
+systems	O
+around	O
+the	O
+world	O
+
+Content	O
+all	O
+clear	O
+-LSB-	O
+workflow	O
+&	O
+content	B-KEY
+management	I-KEY
+-RSB-	O
+Graeme	O
+Muir	O
+of	O
+SchlumbergerSema	B-KEY
+cuts	O
+through	O
+the	O
+confusion	O
+between	O
+content	O
+,	O
+document	O
+and	O
+records	B-KEY
+management	I-KEY
+
+A	O
+dynamic	B-KEY
+method	I-KEY
+for	O
+weighted	B-KEY
+linear	I-KEY
+least	I-KEY
+squares	I-KEY
+problems	I-KEY
+A	O
+new	O
+method	O
+for	O
+solving	O
+the	O
+weighted	B-KEY
+linear	I-KEY
+least	I-KEY
+squares	I-KEY
+problems	I-KEY
+with	O
+full	O
+rank	O
+is	O
+proposed	O
+.	O
+Based	O
+on	O
+the	O
+theory	O
+of	O
+Liapunov	O
+'s	O
+stability	O
+,	O
+the	O
+method	O
+associates	O
+a	O
+dynamic	O
+system	O
+with	O
+a	O
+weighted	B-KEY
+linear	I-KEY
+least	I-KEY
+squares	I-KEY
+problem	I-KEY
+,	O
+whose	O
+solution	O
+we	O
+are	O
+interested	O
+in	O
+and	O
+integrates	O
+the	O
+former	O
+numerically	O
+by	O
+an	O
+A-stable	B-KEY
+numerical	I-KEY
+method	I-KEY
+.	O
+The	O
+numerical	O
+tests	O
+suggest	O
+that	O
+the	O
+new	O
+method	O
+is	O
+more	O
+than	O
+comparative	O
+with	O
+current	O
+conventional	O
+techniques	O
+based	O
+on	O
+the	O
+normal	O
+equations	O
+
+Laguerre	B-KEY
+approximation	I-KEY
+of	O
+fractional	B-KEY
+systems	I-KEY
+Systems	O
+characterised	O
+by	O
+fractional	B-KEY
+power	I-KEY
+poles	I-KEY
+can	O
+be	O
+called	O
+fractional	B-KEY
+systems	I-KEY
+.	O
+Here	O
+,	O
+Laguerre	O
+orthogonal	B-KEY
+polynomials	I-KEY
+are	O
+employed	O
+to	O
+approximate	O
+fractional	B-KEY
+systems	I-KEY
+by	O
+minimum	B-KEY
+phase	I-KEY
+,	O
+reduced	B-KEY
+order	I-KEY
+,	O
+rational	B-KEY
+transfer	I-KEY
+functions	I-KEY
+.	O
+Both	O
+the	O
+time	O
+and	O
+the	O
+frequency-domain	B-KEY
+analysis	I-KEY
+exhibit	O
+the	O
+accuracy	O
+of	O
+the	O
+approximation	O
+
+An	O
+intelligent	O
+system	O
+combining	O
+different	O
+resource-bounded	B-KEY
+reasoning	I-KEY
+techniques	I-KEY
+In	O
+this	O
+paper	O
+,	O
+PRIMES	B-KEY
+-LRB-	O
+Progressive	B-KEY
+Reasoning	I-KEY
+and	O
+Intelligent	B-KEY
+multiple	I-KEY
+MEthods	I-KEY
+System	I-KEY
+-RRB-	O
+,	O
+a	O
+new	O
+architecture	O
+for	O
+resource-bounded	O
+reasoning	O
+that	O
+combines	O
+a	O
+form	O
+of	O
+progressive	B-KEY
+reasoning	I-KEY
+and	O
+the	O
+so-called	O
+multiple	O
+methods	O
+approach	O
+is	O
+presented	O
+.	O
+Each	O
+time-critical	B-KEY
+reasoning	I-KEY
+unit	I-KEY
+is	O
+designed	O
+in	O
+such	O
+a	O
+way	O
+that	O
+it	O
+delivers	O
+an	O
+approximate	O
+result	O
+in	O
+time	O
+whenever	O
+an	O
+overload	O
+or	O
+a	O
+failure	O
+prevents	O
+the	O
+system	O
+from	O
+producing	O
+the	O
+most	O
+accurate	O
+result	O
+.	O
+Indeed	O
+,	O
+reasoning	O
+units	O
+use	O
+approximate	B-KEY
+processing	I-KEY
+based	O
+on	O
+two	O
+salient	O
+features	O
+.	O
+First	O
+,	O
+an	O
+incremental	O
+processing	O
+unit	O
+constructs	O
+an	O
+approximate	O
+solution	O
+quickly	O
+and	O
+then	O
+refines	O
+it	O
+incrementally	O
+.	O
+Second	O
+,	O
+a	O
+multiple	O
+methods	O
+approach	O
+proposes	O
+different	O
+alternatives	O
+to	O
+solve	O
+the	O
+problem	O
+,	O
+each	O
+of	O
+them	O
+being	O
+selected	O
+according	O
+to	O
+the	O
+available	O
+resources	O
+.	O
+In	O
+allowing	O
+several	O
+resource-bounded	O
+reasoning	O
+paradigms	O
+to	O
+be	O
+combined	O
+,	O
+we	O
+hope	O
+to	O
+extend	O
+their	O
+actual	O
+scope	O
+to	O
+cover	O
+more	O
+real-world	O
+application	O
+domains	O
+
+Web	O
+ad	O
+explosion	O
+Financed	O
+by	O
+advertising	O
+dollars	O
+from	O
+big	O
+names	O
+,	O
+online	B-KEY
+marketers	I-KEY
+are	O
+embracing	O
+more	O
+aggressive	O
+tactics	O
+
+Simulation	O
+and	O
+transient	O
+testing	O
+of	O
+numerical	B-KEY
+relays	I-KEY
+A	O
+hybrid	O
+and	O
+practical	O
+solution	O
+for	O
+relay	B-KEY
+evaluation	I-KEY
+is	O
+presented	O
+.	O
+Two	O
+main	O
+issues	O
+are	O
+taken	O
+into	O
+account	O
+:	O
+power	B-KEY
+system	I-KEY
+simulation	I-KEY
+and	O
+relay	B-KEY
+simulation	I-KEY
+,	O
+both	O
+of	O
+which	O
+consist	O
+of	O
+different	O
+stages	O
+.	O
+System	O
+simulation	O
+is	O
+carried	O
+out	O
+by	O
+means	O
+of	O
+EMTP	B-KEY
+and	O
+is	O
+complemented	O
+by	O
+additional	O
+features	O
+,	O
+such	O
+as	O
+filtering	B-KEY
+for	O
+location	O
+and	O
+determination	O
+of	O
+fault	O
+parameters	O
+that	O
+allow	O
+comparing	O
+simulated	O
+and	O
+actual	O
+fault	O
+records	O
+to	O
+improve	O
+and	O
+guarantee	O
+a	O
+correct	O
+system	O
+simulation	O
+.	O
+Relay	B-KEY
+simulation	I-KEY
+includes	O
+filtering	B-KEY
+algorithms	O
+,	O
+all	O
+the	O
+relaying	O
+units	O
+,	O
+and	O
+the	O
+decision	O
+logic	O
+.	O
+Playing	O
+simulated	O
+or	O
+real	B-KEY
+faults	I-KEY
+over	O
+the	O
+actual	O
+relay	O
+and	O
+comparing	O
+simulated	O
+and	O
+real	O
+responses	O
+can	O
+check	O
+for	O
+correct	O
+relay	B-KEY
+simulation	I-KEY
+
+Agreeing	O
+with	O
+automated	B-KEY
+diagnostic	I-KEY
+aids	I-KEY
+:	O
+a	O
+study	O
+of	O
+users	O
+'	O
+concurrence	O
+strategies	O
+Automated	B-KEY
+diagnostic	I-KEY
+aids	I-KEY
+that	O
+are	O
+less	O
+than	O
+perfectly	O
+reliable	B-KEY
+often	O
+produce	O
+unwarranted	O
+levels	O
+of	O
+disuse	O
+by	O
+operators	O
+.	O
+In	O
+the	O
+present	O
+study	O
+,	O
+users	O
+'	O
+tendencies	O
+to	O
+either	O
+agree	O
+or	O
+disagree	O
+with	O
+automated	B-KEY
+diagnostic	I-KEY
+aids	I-KEY
+were	O
+examined	O
+under	O
+conditions	O
+in	O
+which	O
+:	O
+-LRB-	O
+1	O
+-RRB-	O
+the	O
+aids	O
+were	O
+less	O
+than	O
+perfectly	O
+reliable	B-KEY
+but	O
+aided-diagnosis	O
+was	O
+still	O
+more	O
+accurate	O
+that	O
+unaided	O
+diagnosis	O
+;	O
+and	O
+-LRB-	O
+2	O
+-RRB-	O
+the	O
+system	O
+was	O
+completely	O
+opaque	O
+,	O
+affording	O
+users	O
+no	O
+additional	O
+information	O
+upon	O
+which	O
+to	O
+base	O
+a	O
+diagnosis	O
+.	O
+The	O
+results	O
+revealed	O
+that	O
+some	O
+users	O
+adopted	O
+a	O
+strategy	O
+of	O
+always	O
+agreeing	O
+with	O
+the	O
+aids	O
+,	O
+thereby	O
+maximizing	B-KEY
+the	O
+number	O
+of	O
+correct	O
+diagnoses	O
+made	O
+over	O
+several	O
+trials	O
+.	O
+Other	O
+users	O
+,	O
+however	O
+,	O
+adopted	O
+a	O
+probability-matching	B-KEY
+strategy	O
+in	O
+which	O
+agreement	O
+and	O
+disagreement	B-KEY
+rates	I-KEY
+matched	O
+the	O
+rate	O
+of	O
+correct	O
+and	O
+incorrect	O
+diagnoses	O
+of	O
+the	O
+aids	O
+.	O
+The	O
+probability-matching	B-KEY
+strategy	O
+,	O
+therefore	O
+,	O
+resulted	O
+in	O
+diagnostic	O
+accuracy	O
+scores	O
+that	O
+were	O
+lower	O
+than	O
+was	O
+maximally	B-KEY
+possible	O
+.	O
+Users	O
+who	O
+adopted	O
+the	O
+maximization	B-KEY
+strategy	O
+had	O
+higher	O
+self-ratings	O
+of	O
+problem-solving	B-KEY
+and	O
+decision-making	O
+skills	O
+,	O
+were	O
+more	O
+accurate	O
+in	O
+estimating	O
+aid	O
+reliabilities	B-KEY
+,	O
+and	O
+were	O
+more	O
+confident	O
+in	O
+their	O
+diagnosis	O
+on	O
+trials	O
+in	O
+which	O
+they	O
+agreed	O
+with	O
+the	O
+aids	O
+.	O
+The	O
+potential	O
+applications	O
+of	O
+these	O
+findings	O
+include	O
+the	O
+design	O
+of	O
+interface	O
+and	O
+training	O
+solutions	O
+that	O
+facilitate	O
+the	O
+adoption	O
+of	O
+the	O
+most	O
+effective	O
+concurrence	O
+strategies	O
+by	O
+users	O
+of	O
+automated	B-KEY
+diagnostic	I-KEY
+aids	I-KEY
+
+The	O
+exact	B-KEY
+solution	I-KEY
+of	O
+coupled	B-KEY
+thermoelectroelastic	I-KEY
+behavior	I-KEY
+of	O
+piezoelectric	B-KEY
+laminates	I-KEY
+Exact	B-KEY
+solutions	I-KEY
+for	O
+static	O
+analysis	O
+of	O
+thermoelectroelastic	B-KEY
+laminated	I-KEY
+plates	I-KEY
+are	O
+presented	O
+.	O
+In	O
+this	O
+analysis	O
+,	O
+a	O
+new	O
+concise	O
+procedure	O
+for	O
+the	O
+analytical	B-KEY
+solution	I-KEY
+of	O
+composite	B-KEY
+laminated	I-KEY
+plates	I-KEY
+with	O
+piezoelectric	B-KEY
+layers	I-KEY
+is	O
+developed	O
+.	O
+A	O
+simple	O
+eigenvalue	B-KEY
+formula	I-KEY
+in	O
+real	B-KEY
+number	I-KEY
+form	I-KEY
+is	O
+directly	O
+developed	O
+from	O
+the	O
+basic	O
+coupled	B-KEY
+piezoelectric	I-KEY
+differential	I-KEY
+equations	I-KEY
+and	O
+the	O
+difficulty	O
+of	O
+treating	O
+imaginary	O
+eigenvalues	O
+is	O
+avoided	O
+.	O
+The	O
+solution	O
+is	O
+defined	O
+in	O
+the	O
+trigonometric	B-KEY
+series	I-KEY
+and	O
+can	O
+be	O
+applied	O
+to	O
+thin	O
+and	O
+thick	B-KEY
+plates	I-KEY
+.	O
+Numerical	B-KEY
+studies	I-KEY
+are	O
+conducted	O
+on	O
+a	O
+five-layer	B-KEY
+piezoelectric	I-KEY
+plate	I-KEY
+and	O
+the	O
+complexity	O
+of	O
+stresses	B-KEY
+and	O
+deformations	B-KEY
+under	O
+combined	B-KEY
+loading	I-KEY
+is	O
+illustrated	O
+.	O
+The	O
+results	O
+could	O
+be	O
+used	O
+as	O
+a	O
+benchmark	O
+for	O
+assessing	O
+any	O
+numerical	O
+solution	O
+by	O
+approximate	O
+approaches	O
+such	O
+as	O
+the	O
+finite	B-KEY
+element	I-KEY
+method	I-KEY
+while	O
+also	O
+providing	O
+useful	O
+physical	O
+insight	O
+into	O
+the	O
+behavior	O
+of	O
+piezoelectric	O
+plates	O
+in	O
+a	O
+thermal	B-KEY
+environment	I-KEY
+
+Exploiting	O
+structure	O
+in	O
+adaptive	B-KEY
+dynamic	I-KEY
+programming	I-KEY
+algorithms	I-KEY
+for	O
+a	O
+stochastic	B-KEY
+batch	I-KEY
+service	I-KEY
+problem	I-KEY
+The	O
+purpose	O
+of	O
+this	O
+paper	O
+is	O
+to	O
+illustrate	O
+the	O
+importance	O
+of	O
+using	O
+structural	B-KEY
+results	I-KEY
+in	O
+dynamic	O
+programming	O
+algorithms	O
+.	O
+We	O
+consider	O
+the	O
+problem	O
+of	O
+approximating	O
+optimal	O
+strategies	O
+for	O
+the	O
+batch	O
+service	O
+of	O
+customers	O
+at	O
+a	O
+service	B-KEY
+station	I-KEY
+.	O
+Customers	O
+stochastically	O
+arrive	O
+at	O
+the	O
+station	O
+and	O
+wait	O
+to	O
+be	O
+served	O
+,	O
+incurring	O
+a	O
+waiting	B-KEY
+cost	I-KEY
+and	O
+a	O
+service	B-KEY
+cost	I-KEY
+.	O
+Service	O
+of	O
+customers	O
+is	O
+performed	O
+in	O
+groups	O
+of	O
+a	O
+fixed	B-KEY
+service	I-KEY
+capacity	I-KEY
+.	O
+We	O
+investigate	O
+the	O
+structure	O
+of	O
+cost	O
+functions	O
+and	O
+establish	O
+some	O
+theoretical	O
+results	O
+including	O
+monotonicity	O
+of	O
+the	O
+value	O
+functions	O
+.	O
+Then	O
+,	O
+we	O
+use	O
+our	O
+adaptive	O
+dynamic	O
+programming	O
+monotone	O
+algorithm	O
+that	O
+uses	O
+structure	O
+to	O
+preserve	O
+monotonicity	O
+of	O
+the	O
+estimates	O
+at	O
+each	O
+iterations	O
+to	O
+approximate	O
+the	O
+value	O
+functions	O
+.	O
+Since	O
+the	O
+problem	O
+with	O
+homogeneous	O
+customers	O
+can	O
+be	O
+solved	O
+optimally	O
+,	O
+we	O
+have	O
+a	O
+means	O
+of	O
+comparison	O
+to	O
+evaluate	O
+our	O
+heuristic	O
+.	O
+Finally	O
+,	O
+we	O
+compare	O
+our	O
+algorithm	O
+to	O
+classical	O
+forward	O
+dynamic	O
+programming	O
+methods	O
+
+On	O
+the	O
+distribution	O
+of	O
+Lachlan	O
+nonsplitting	O
+bases	O
+We	O
+say	O
+that	O
+a	O
+computably	O
+enumerable	O
+-LRB-	O
+c.e.	O
+-RRB-	O
+degree	O
+b	O
+is	O
+a	O
+Lachlan	O
+nonsplitting	O
+base	O
+-LRB-	O
+LNB	O
+-RRB-	O
+,	O
+if	O
+there	O
+is	O
+a	O
+computably	B-KEY
+enumerable	I-KEY
+degree	I-KEY
+a	O
+such	O
+that	O
+a	O
+>	O
+b	O
+,	O
+and	O
+for	O
+any	O
+c.e.	O
+degrees	O
+w	O
+,	O
+v	O
+<	O
+or	O
+=	O
+a	O
+,	O
+if	O
+a	O
+<	O
+or	O
+=	O
+wVvV	O
+b	O
+then	O
+either	O
+a	O
+<	O
+or	O
+=	O
+wV	O
+b	O
+or	O
+a	O
+<	O
+or	O
+=	O
+vV	O
+b	O
+.	O
+In	O
+this	O
+paper	O
+we	O
+investigate	O
+the	O
+relationship	O
+between	O
+bounding	O
+and	O
+nonbounding	O
+of	O
+Lachlan	O
+nonsplitting	O
+bases	O
+and	O
+the	O
+high/low	O
+hierarchy	O
+.	O
+We	O
+prove	O
+that	O
+there	O
+is	O
+a	O
+non-Low/sub	O
+2	O
+/	O
+c.e.	O
+degree	O
+which	O
+bounds	O
+no	O
+Lachlan	O
+nonsplitting	O
+base	O
+
+Fault	O
+diagnosis	O
+and	O
+fault	B-KEY
+tolerant	I-KEY
+control	I-KEY
+of	O
+linear	O
+stochastic	B-KEY
+systems	I-KEY
+with	O
+unknown	O
+inputs	O
+This	O
+paper	O
+presents	O
+an	O
+integrated	O
+robust	O
+fault	B-KEY
+detection	I-KEY
+and	O
+isolation	O
+-LRB-	O
+FDI	O
+-RRB-	O
+and	O
+fault	B-KEY
+tolerant	I-KEY
+control	I-KEY
+-LRB-	O
+FTC	O
+-RRB-	O
+scheme	O
+for	O
+a	O
+fault	O
+in	O
+actuators	O
+or	O
+sensors	O
+of	O
+linear	O
+stochastic	B-KEY
+systems	I-KEY
+subjected	O
+to	O
+unknown	O
+inputs	O
+-LRB-	O
+disturbances	O
+-RRB-	O
+.	O
+As	O
+usual	O
+in	O
+this	O
+kind	O
+of	O
+works	O
+,	O
+it	O
+is	O
+assumed	O
+that	O
+single	O
+fault	O
+occurs	O
+at	O
+a	O
+time	O
+and	O
+the	O
+fault	O
+treated	O
+is	O
+of	O
+random	O
+bias	O
+type	O
+.	O
+The	O
+FDI	O
+module	O
+is	O
+constructed	O
+using	O
+banks	O
+of	O
+robust	O
+two-stage	B-KEY
+Kalman	I-KEY
+filters	I-KEY
+,	O
+which	O
+simultaneously	O
+estimate	O
+the	O
+state	O
+and	O
+the	O
+fault	O
+bias	O
+,	O
+and	O
+generate	O
+residual	O
+sets	O
+decoupled	O
+from	O
+unknown	O
+disturbances	O
+.	O
+All	O
+elements	O
+of	O
+residual	O
+sets	O
+are	O
+evaluated	O
+by	O
+using	O
+a	O
+hypothesis	O
+statistical	O
+test	O
+,	O
+and	O
+the	O
+fault	O
+is	O
+declared	O
+according	O
+to	O
+the	O
+prepared	O
+decision	O
+logic	O
+.	O
+The	O
+FTC	O
+module	O
+is	O
+activated	O
+based	O
+on	O
+the	O
+fault	O
+indicator	O
+,	O
+and	O
+additive	O
+compensation	O
+signal	O
+is	O
+computed	O
+using	O
+the	O
+fault	O
+bias	O
+estimate	O
+and	O
+combined	O
+to	O
+the	O
+nominal	O
+control	O
+law	O
+for	O
+compensating	O
+the	O
+fault	O
+'s	O
+effect	O
+on	O
+the	O
+system	O
+.	O
+Simulation	O
+results	O
+for	O
+the	O
+simplified	O
+longitudinal	B-KEY
+flight	I-KEY
+control	I-KEY
+system	I-KEY
+with	O
+parameter	O
+variations	O
+,	O
+process	O
+and	O
+measurement	O
+noises	O
+demonstrate	O
+the	O
+effectiveness	O
+of	O
+the	O
+approach	O
+proposed	O
+
+Formal	B-KEY
+verification	I-KEY
+of	O
+human-automation	B-KEY
+interaction	I-KEY
+This	O
+paper	O
+discusses	O
+a	O
+formal	O
+and	O
+rigorous	O
+approach	O
+to	O
+the	O
+analysis	O
+of	O
+operator	O
+interaction	O
+with	O
+machines	O
+.	O
+It	O
+addresses	O
+the	O
+acute	O
+problem	O
+of	O
+detecting	O
+design	O
+errors	O
+in	O
+human-machine	O
+interaction	O
+and	O
+focuses	O
+on	O
+verifying	O
+the	O
+correctness	O
+of	O
+the	O
+interaction	O
+in	O
+complex	O
+and	O
+automated	B-KEY
+control	I-KEY
+systems	I-KEY
+.	O
+The	O
+paper	O
+describes	O
+a	O
+systematic	O
+methodology	O
+for	O
+evaluating	O
+whether	O
+the	O
+interface	O
+provides	O
+the	O
+necessary	O
+information	O
+about	O
+the	O
+machine	O
+to	O
+enable	O
+the	O
+operator	O
+to	O
+perform	O
+a	O
+specified	O
+task	O
+successfully	O
+and	O
+unambiguously	O
+.	O
+It	O
+also	O
+addresses	O
+the	O
+adequacy	O
+of	O
+information	O
+provided	O
+to	O
+the	O
+user	O
+via	O
+training	O
+materials	O
+-LRB-	O
+e.g.	O
+,	O
+user	O
+manual	O
+-RRB-	O
+about	O
+the	O
+machine	O
+'s	O
+behavior	O
+.	O
+The	O
+essentials	O
+of	O
+the	O
+methodology	O
+,	O
+which	O
+can	O
+be	O
+automated	O
+and	O
+applied	O
+to	O
+the	O
+verification	O
+of	O
+large	O
+systems	O
+,	O
+are	O
+illustrated	O
+by	O
+several	O
+examples	O
+and	O
+through	O
+a	O
+case	O
+study	O
+of	O
+pilot	O
+interaction	O
+with	O
+an	O
+autopilot	B-KEY
+aboard	O
+a	O
+modern	O
+commercial	B-KEY
+aircraft	I-KEY
+.	O
+The	O
+expected	O
+application	O
+of	O
+this	O
+methodology	O
+is	O
+an	O
+augmentation	O
+and	O
+enhancement	O
+,	O
+by	O
+formal	B-KEY
+verification	I-KEY
+,	O
+of	O
+human-automation	O
+interfaces	O
+
+The	O
+dynamics	B-KEY
+of	O
+a	O
+railway	B-KEY
+freight	I-KEY
+wagon	I-KEY
+wheelset	I-KEY
+with	O
+dry	B-KEY
+friction	I-KEY
+damping	I-KEY
+We	O
+investigate	O
+the	O
+dynamics	B-KEY
+of	O
+a	O
+simple	O
+model	O
+of	O
+a	O
+wheelset	O
+that	O
+supports	O
+one	O
+end	O
+of	O
+a	O
+railway	O
+freight	O
+wagon	O
+by	O
+springs	O
+with	O
+linear	B-KEY
+characteristics	I-KEY
+and	O
+dry	O
+friction	O
+dampers	O
+.	O
+The	O
+wagon	O
+runs	O
+on	O
+an	O
+ideal	O
+,	O
+straight	O
+and	O
+level	O
+track	O
+with	O
+constant	O
+speed	O
+.	O
+The	O
+lateral	B-KEY
+dynamics	I-KEY
+in	O
+dependence	O
+on	O
+the	O
+speed	O
+is	O
+examined	O
+.	O
+We	O
+have	O
+included	O
+stick-slip	B-KEY
+and	O
+hysteresis	B-KEY
+in	O
+our	O
+model	O
+of	O
+the	O
+dry	O
+friction	O
+and	O
+assume	O
+that	O
+Coulomb	O
+'s	O
+law	O
+holds	O
+during	O
+the	O
+slip	O
+phase	O
+.	O
+It	O
+is	O
+found	O
+that	O
+the	O
+action	O
+of	O
+dry	O
+friction	O
+completely	O
+changes	O
+the	O
+bifurcation	B-KEY
+diagram	I-KEY
+,	O
+and	O
+that	O
+the	O
+longitudinal	B-KEY
+component	I-KEY
+of	O
+the	O
+dry	B-KEY
+friction	I-KEY
+damping	I-KEY
+forces	O
+destabilizes	O
+the	O
+wagon	O
+
+Developing	O
+a	O
+CD-ROM	B-KEY
+as	O
+a	O
+teaching	O
+and	O
+learning	B-KEY
+tool	I-KEY
+in	O
+food	B-KEY
+and	I-KEY
+beverage	I-KEY
+management	I-KEY
+:	O
+a	O
+case	O
+study	O
+in	O
+hospitality	B-KEY
+education	I-KEY
+Food	B-KEY
+and	I-KEY
+beverage	I-KEY
+management	I-KEY
+is	O
+the	O
+traditional	O
+core	O
+of	O
+hospitality	B-KEY
+education	I-KEY
+but	O
+,	O
+in	O
+its	O
+laboratory	O
+manifestation	O
+,	O
+has	O
+come	O
+under	O
+increasing	O
+pressure	O
+in	O
+recent	O
+years	O
+.	O
+It	O
+is	O
+an	O
+area	O
+that	O
+,	O
+arguably	O
+,	O
+presents	O
+the	O
+greatest	O
+challenges	O
+in	O
+adaptation	O
+to	O
+contemporary	O
+learning	O
+technologies	O
+but	O
+,	O
+at	O
+the	O
+same	O
+time	O
+,	O
+stands	O
+to	O
+benefit	O
+most	O
+from	O
+the	O
+potential	O
+of	O
+the	O
+Web	O
+.	O
+This	O
+paper	O
+addresses	O
+the	O
+design	O
+and	O
+development	O
+of	O
+a	O
+CD-ROM	B-KEY
+learning	O
+resource	O
+for	O
+food	O
+and	O
+beverage	O
+.	O
+It	O
+is	O
+a	O
+learning	O
+resource	O
+which	O
+is	O
+designed	O
+to	O
+integrate	O
+with	O
+rather	O
+than	O
+to	O
+replace	O
+existing	O
+conventional	O
+classroom	O
+and	O
+laboratory	O
+learning	O
+methods	O
+and	O
+,	O
+thus	O
+,	O
+compensate	O
+for	O
+the	O
+decline	O
+in	O
+the	O
+resource	O
+base	O
+faced	O
+in	O
+food	O
+and	O
+beverage	O
+education	O
+in	O
+recent	O
+years	O
+.	O
+The	O
+paper	O
+includes	O
+illustrative	O
+material	O
+drawn	O
+from	O
+the	O
+CD-ROM	B-KEY
+which	O
+demonstrates	O
+its	O
+use	O
+in	O
+teaching	O
+and	O
+learning	O
+
+Numerical	B-KEY
+validation	I-KEY
+of	O
+solutions	O
+of	O
+complementarity	O
+problems	O
+:	O
+the	O
+nonlinear	O
+case	O
+This	O
+paper	O
+proposes	O
+a	O
+validation	O
+method	O
+for	O
+solutions	O
+of	O
+nonlinear	B-KEY
+complementarity	I-KEY
+problems	I-KEY
+.	O
+The	O
+validation	O
+procedure	O
+performs	O
+a	O
+computational	B-KEY
+test	I-KEY
+.	O
+If	O
+the	O
+result	O
+of	O
+the	O
+test	O
+is	O
+positive	O
+,	O
+then	O
+it	O
+is	O
+guaranteed	O
+that	O
+a	O
+given	O
+multi-dimensional	O
+interval	O
+either	O
+includes	O
+a	O
+solution	O
+or	O
+excludes	O
+all	O
+solutions	O
+of	O
+the	O
+nonlinear	B-KEY
+complementarity	I-KEY
+problem	I-KEY
+
+Hermite	O
+interpolation	B-KEY
+by	O
+rotation-invariant	O
+spatial	O
+Pythagorean-hodograph	O
+curves	O
+The	O
+interpolation	B-KEY
+of	O
+first-order	B-KEY
+Hermite	I-KEY
+data	I-KEY
+by	O
+spatial	O
+Pythagorean-hodograph	O
+curves	O
+that	O
+exhibit	O
+closure	O
+under	O
+arbitrary	O
+3-dimensional	O
+rotations	O
+is	O
+addressed	O
+.	O
+The	O
+hodographs	O
+of	O
+such	O
+curves	O
+correspond	O
+to	O
+certain	O
+combinations	O
+of	O
+four	O
+polynomials	B-KEY
+,	O
+given	O
+by	O
+Dietz	O
+et	O
+al.	O
+-LRB-	O
+1993	O
+-RRB-	O
+,	O
+that	O
+admit	O
+compact	O
+descriptions	O
+in	O
+terms	O
+of	O
+quaternions	B-KEY
+-	O
+an	O
+instance	O
+of	O
+the	O
+``	O
+PH	O
+representation	O
+map	O
+''	O
+proposed	O
+by	O
+Choi	O
+et	O
+al.	O
+-LRB-	O
+2002	O
+-RRB-	O
+.	O
+The	O
+lowest-order	O
+PH	O
+curves	O
+that	O
+interpolate	B-KEY
+arbitrary	O
+first-order	O
+spatial	O
+Hermite	O
+data	O
+are	O
+quintics	O
+.	O
+It	O
+is	O
+shown	O
+that	O
+,	O
+with	O
+PH	O
+quintics	O
+,	O
+the	O
+quaternion	B-KEY
+representation	O
+yields	O
+a	O
+reduction	O
+of	O
+the	O
+Hermite	O
+interpolation	B-KEY
+problem	O
+to	O
+three	O
+``	O
+simple	O
+''	O
+quadratic	O
+equations	O
+in	O
+three	O
+quaternion	B-KEY
+unknowns	O
+.	O
+This	O
+system	O
+admits	O
+a	O
+closed-form	B-KEY
+solution	I-KEY
+,	O
+expressing	O
+all	O
+PH	O
+quintic	O
+interpolants	B-KEY
+to	O
+given	O
+spatial	O
+Hermite	O
+data	O
+as	O
+a	O
+two-parameter	O
+family	O
+.	O
+An	O
+integral	B-KEY
+shape	I-KEY
+measure	I-KEY
+is	O
+invoked	O
+to	O
+fix	O
+these	O
+two	O
+free	O
+parameters	O
+
+Problems	O
+with	O
+my	O
+PDA	B-KEY
+Tom	O
+Berry	O
+has	O
+lost	O
+his	O
+PDA	B-KEY
+,	O
+and	O
+now	O
+he	O
+has	O
+an	O
+even	O
+better	O
+understanding	O
+of	O
+the	O
+risks	B-KEY
+and	O
+benefits	B-KEY
+of	O
+working	O
+on	O
+the	O
+move	O
+
+Practice	O
+management	O
+goes	O
+remote	O
+-LSB-	O
+accounting	O
+-RSB-	O
+There	O
+'s	O
+a	O
+lot	O
+of	O
+life	O
+in	O
+accounting	B-KEY
+practice	I-KEY
+management	I-KEY
+software	I-KEY
+,	O
+a	O
+valuable	O
+category	O
+that	O
+has	O
+been	O
+subject	O
+to	O
+much	O
+change	O
+in	O
+the	O
+last	O
+few	O
+years	O
+.	O
+Web-based	B-KEY
+time	I-KEY
+tracking	I-KEY
+grows	O
+in	O
+popularity	O
+.	O
+Looks	O
+at	O
+CCH	B-KEY
+ProSystem	I-KEY
+fx	I-KEY
+Practice	I-KEY
+,	O
+CMS	B-KEY
+Open	I-KEY
+Solutions	I-KEY
+6	I-KEY
+,	O
+Creative	B-KEY
+Solutions	I-KEY
+Practice	I-KEY
+,	O
+Time	B-KEY
+Matters	I-KEY
+,	O
+CPASoftware	B-KEY
+Visual	I-KEY
+Practice	I-KEY
+Management	I-KEY
+,	O
+and	O
+Abak	B-KEY
+
+Transmission	O
+of	O
+real-time	O
+video	O
+over	O
+IP	B-KEY
+differentiated	I-KEY
+services	I-KEY
+Multimedia	B-KEY
+applications	I-KEY
+require	O
+high	O
+bandwidth	O
+and	O
+guaranteed	O
+quality	B-KEY
+of	I-KEY
+service	I-KEY
+-LRB-	O
+QoS	O
+-RRB-	O
+.	O
+The	O
+current	O
+Internet	B-KEY
+,	O
+which	O
+provides	O
+`	O
+best	O
+effort	O
+'	O
+services	O
+,	O
+can	O
+not	O
+meet	O
+the	O
+stringent	O
+QoS	O
+requirements	O
+for	O
+delivering	O
+MPEG	B-KEY
+videos	I-KEY
+.	O
+It	O
+is	O
+proposed	O
+that	O
+MPEG	O
+frames	O
+are	O
+transported	O
+through	O
+various	O
+service	O
+models	O
+of	O
+DiffServ	B-KEY
+.	O
+Performance	O
+analysis	O
+and	O
+simulation	O
+results	O
+show	O
+that	O
+the	O
+proposed	O
+approach	O
+can	O
+not	O
+only	O
+guarantee	O
+QoS	O
+but	O
+can	O
+also	O
+achieve	O
+high	B-KEY
+bandwidth	I-KEY
+utilisation	I-KEY
+
+Dousing	O
+terrorist	B-KEY
+funding	I-KEY
+:	O
+mission	O
+possible	O
+?	O
+-LSB-	O
+banks	B-KEY
+-RSB-	O
+The	O
+government	O
+is	O
+tightening	O
+its	O
+grip	O
+on	O
+terrorist	O
+money	O
+flows	O
+.	O
+But	O
+as	O
+the	O
+banking	B-KEY
+industry	O
+continues	O
+to	O
+expand	O
+its	O
+Patriot	B-KEY
+Act	I-KEY
+compliance	O
+activities	O
+,	O
+it	O
+is	O
+with	O
+the	O
+realization	O
+that	O
+a	O
+great	O
+deal	O
+of	O
+work	O
+remains	O
+to	O
+be	O
+done	O
+before	O
+the	O
+American	O
+financial	O
+system	O
+can	O
+become	O
+truly	O
+airtight	O
+.	O
+Identification	B-KEY
+instruments	O
+,	O
+especially	O
+drivers	O
+licenses	O
+,	O
+represent	O
+a	O
+significant	O
+weak	O
+spot	O
+
+A	O
+note	O
+on	O
+vector	B-KEY
+cascade	I-KEY
+algorithm	I-KEY
+The	O
+focus	O
+of	O
+this	O
+paper	O
+is	O
+on	O
+the	O
+relationship	O
+between	O
+accuracy	O
+of	O
+multivariate	B-KEY
+refinable	I-KEY
+vector	I-KEY
+and	O
+vector	B-KEY
+cascade	I-KEY
+algorithm	I-KEY
+.	O
+We	O
+show	O
+that	O
+,	O
+if	O
+the	O
+vector	B-KEY
+cascade	I-KEY
+algorithm	I-KEY
+-LRB-	O
+1.5	O
+-RRB-	O
+with	O
+isotropic	B-KEY
+dilation	I-KEY
+converges	O
+to	O
+a	O
+vector-valued	B-KEY
+function	I-KEY
+with	O
+regularity	O
+,	O
+then	O
+the	O
+initial	O
+function	O
+must	O
+satisfy	O
+the	O
+Strang-Fix	B-KEY
+conditions	I-KEY
+
+A	O
+column	B-KEY
+generation	I-KEY
+approach	I-KEY
+to	O
+delivery	B-KEY
+planning	I-KEY
+over	I-KEY
+time	I-KEY
+with	O
+inhomogeneous	B-KEY
+service	I-KEY
+providers	I-KEY
+and	O
+service	B-KEY
+interval	I-KEY
+constraints	I-KEY
+We	O
+consider	O
+a	O
+problem	O
+of	O
+delivery	O
+planning	O
+over	O
+multiple	O
+time	O
+periods	O
+.	O
+Deliveries	O
+must	O
+be	O
+made	O
+to	O
+customers	O
+having	O
+nominated	O
+demand	O
+in	O
+each	O
+time	O
+period	O
+.	O
+Demand	O
+must	O
+be	O
+met	O
+in	O
+each	O
+time	O
+period	O
+by	O
+use	O
+of	O
+some	O
+combination	O
+of	O
+inhomogeneous	B-KEY
+service	I-KEY
+providers	I-KEY
+.	O
+Each	O
+service	O
+provider	O
+has	O
+a	O
+different	O
+delivery	B-KEY
+capacity	I-KEY
+,	O
+different	O
+cost	O
+of	O
+delivery	O
+to	O
+each	O
+customer	O
+,	O
+a	O
+different	O
+utilisation	O
+requirement	O
+,	O
+and	O
+different	O
+rules	O
+governing	O
+the	O
+spread	O
+of	O
+deliveries	O
+in	O
+time	O
+.	O
+The	O
+problem	O
+is	O
+to	O
+plan	O
+deliveries	O
+so	O
+as	O
+to	O
+minimise	O
+overall	O
+costs	O
+,	O
+subject	O
+to	O
+demand	O
+being	O
+met	O
+and	O
+service	O
+rules	O
+obeyed	O
+.	O
+A	O
+natural	O
+integer	O
+programming	O
+model	O
+was	O
+found	O
+to	O
+be	O
+intractable	O
+,	O
+except	O
+on	O
+problems	O
+with	O
+loose	O
+demand	O
+constraints	O
+,	O
+with	O
+gaps	O
+between	O
+best	O
+lower	B-KEY
+bound	I-KEY
+and	O
+best	O
+feasible	O
+solution	O
+of	O
+up	O
+to	O
+35.1	O
+%	O
+,	O
+with	O
+an	O
+average	O
+of	O
+15.4	O
+%	O
+over	O
+the	O
+test	O
+data	O
+set	O
+.	O
+In	O
+all	O
+but	O
+the	O
+problem	O
+with	O
+loosest	O
+demand	O
+constraints	O
+,	O
+Cplex	O
+6.5	O
+applied	O
+to	O
+this	O
+formulation	O
+failed	O
+to	O
+find	O
+the	O
+optimal	O
+solution	O
+before	O
+running	O
+out	O
+of	O
+memory	O
+.	O
+However	O
+a	O
+column	B-KEY
+generation	I-KEY
+approach	I-KEY
+improved	O
+the	O
+lower	B-KEY
+bound	I-KEY
+by	O
+between	O
+0.6	O
+%	O
+and	O
+21.9	O
+%	O
+,	O
+with	O
+an	O
+average	O
+of	O
+9.9	O
+%	O
+,	O
+and	O
+in	O
+all	O
+cases	O
+found	O
+the	O
+optimal	O
+solution	O
+at	O
+the	O
+root	O
+node	O
+,	O
+without	O
+requiring	O
+branching	O
+
+Hit	O
+the	O
+road	O
+,	O
+Jack	O
+Going	O
+freelance	O
+offers	O
+the	O
+potential	O
+of	O
+higher	O
+earnings	O
+,	O
+variety	O
+and	O
+independence	O
+-	O
+but	O
+also	O
+removes	O
+the	O
+benefits	O
+of	O
+permanent	O
+employment	O
+and	O
+can	O
+mean	O
+long	O
+distance	O
+travel	O
+and	O
+periods	O
+out	O
+of	O
+work	O
+.	O
+The	O
+author	O
+looks	O
+at	O
+the	O
+benefits	O
+and	O
+drawbacks	O
+-	O
+and	O
+how	O
+to	O
+get	O
+started	O
+as	O
+an	O
+IT	B-KEY
+contractor	I-KEY
+
+Sliding-mode	B-KEY
+control	I-KEY
+scheme	I-KEY
+for	O
+a	O
+class	O
+of	O
+continuous	B-KEY
+chemical	I-KEY
+reactors	I-KEY
+The	O
+synthesis	O
+of	O
+a	O
+robust	O
+control	O
+law	O
+for	O
+regulation	O
+control	O
+of	O
+a	O
+class	O
+of	O
+relative-degree-one	B-KEY
+nonlinear	I-KEY
+systems	I-KEY
+is	O
+presented	O
+.	O
+The	O
+control	O
+design	O
+is	O
+based	O
+on	O
+a	O
+sliding-mode	B-KEY
+uncertainty	I-KEY
+estimator	I-KEY
+,	O
+developed	O
+under	O
+a	O
+framework	O
+of	O
+algebraic-differential	B-KEY
+concepts	I-KEY
+.	O
+The	O
+closed-loop	B-KEY
+stability	I-KEY
+for	O
+the	O
+underlying	O
+closed-loop	B-KEY
+system	I-KEY
+is	O
+achieved	O
+via	O
+averaging	B-KEY
+techniques	I-KEY
+.	O
+Robustness	O
+of	O
+the	O
+proposed	O
+control	O
+scheme	O
+is	O
+proved	O
+in	O
+the	O
+face	O
+of	O
+noise	B-KEY
+measurements	I-KEY
+,	O
+model	B-KEY
+uncertainties	I-KEY
+and	O
+sustained	B-KEY
+disturbances	I-KEY
+.	O
+The	O
+performance	O
+of	O
+the	O
+proposed	O
+control	O
+law	O
+is	O
+illustrated	O
+with	O
+numerical	O
+simulations	O
+,	O
+comparing	O
+the	O
+proposed	O
+controller	O
+with	O
+a	O
+well	O
+tuned	O
+PI	O
+controller	O
+
+Linguistic	B-KEY
+knowledge	I-KEY
+and	O
+new	O
+technologies	O
+Modern	B-KEY
+language	I-KEY
+studies	I-KEY
+are	O
+characterized	O
+by	O
+a	O
+variety	O
+of	O
+forms	O
+,	O
+ways	O
+,	O
+and	O
+methods	O
+of	O
+their	O
+development	O
+.	O
+In	O
+this	O
+connection	O
+,	O
+it	O
+is	O
+necessary	O
+to	O
+specify	O
+the	O
+problem	O
+of	O
+the	O
+development	O
+of	O
+their	O
+internal	B-KEY
+differentiation	I-KEY
+and	O
+classification	O
+,	O
+which	O
+lead	O
+to	O
+the	O
+formation	O
+of	O
+specific	O
+areas	O
+knowledge	O
+.	O
+An	O
+example	O
+of	O
+such	O
+an	O
+area	O
+is	O
+speechology-a	O
+field	O
+of	O
+science	O
+belonging	O
+to	O
+fundamental	O
+,	O
+theoretical	O
+,	O
+and	O
+applied	B-KEY
+linguistics	I-KEY
+
+Document-based	B-KEY
+workflow	I-KEY
+modeling	I-KEY
+:	O
+a	O
+case-based	B-KEY
+reasoning	I-KEY
+approach	O
+A	O
+workflow	O
+model	O
+is	O
+useful	O
+for	O
+business	B-KEY
+process	I-KEY
+analysis	I-KEY
+.	O
+A	O
+well-built	O
+workflow	O
+can	O
+help	O
+a	O
+company	B-KEY
+streamline	O
+its	O
+internal	O
+processes	O
+by	O
+reducing	O
+overhead	O
+.	O
+The	O
+results	O
+of	O
+workflow	O
+modeling	O
+need	O
+to	O
+be	O
+managed	O
+as	O
+information	B-KEY
+assets	I-KEY
+in	O
+a	O
+systematic	O
+fashion	O
+.	O
+Reusing	O
+these	O
+results	O
+is	O
+likely	O
+to	O
+enhance	O
+the	O
+quality	O
+of	O
+the	O
+modeling	O
+.	O
+Therefore	O
+,	O
+this	O
+paper	O
+proposes	O
+a	O
+document-based	B-KEY
+workflow	I-KEY
+modeling	I-KEY
+mechanism	O
+,	O
+which	O
+employs	O
+a	O
+case-based	B-KEY
+reasoning	I-KEY
+-LRB-	O
+CBR	O
+-RRB-	O
+technique	O
+for	O
+the	O
+effective	O
+reuse	O
+of	O
+design	O
+outputs	O
+.	O
+A	O
+repository	O
+is	O
+proposed	O
+to	O
+support	O
+this	O
+CBR	O
+process	O
+.	O
+A	O
+real-life	O
+case	O
+is	O
+illustrated	O
+to	O
+demonstrate	O
+the	O
+usefulness	O
+of	O
+our	O
+approach	O
+
+Simple	O
+...	O
+But	O
+complex	O
+FlexPro	B-KEY
+5.0	I-KEY
+,	O
+from	O
+Weisang	O
+and	O
+Co.	O
+,	O
+is	O
+one	O
+of	O
+those	O
+products	O
+which	O
+aim	O
+to	O
+serve	O
+an	O
+often	O
+ignored	O
+range	O
+of	O
+data	O
+users	O
+:	O
+those	O
+who	O
+,	O
+in	O
+FlexPro	O
+'s	O
+words	O
+,	O
+are	O
+interested	O
+in	O
+documenting	O
+,	O
+analysing	O
+and	O
+archiving	O
+data	O
+in	O
+the	O
+simplest	O
+way	O
+possible	O
+.	O
+The	O
+online	B-KEY
+help	I-KEY
+system	I-KEY
+is	O
+clearly	O
+designed	O
+to	O
+promote	O
+the	O
+product	O
+in	O
+this	O
+market	O
+segment	O
+,	O
+with	O
+a	O
+very	O
+clear	O
+introduction	O
+from	O
+first	O
+principles	O
+and	O
+a	O
+hands-on	B-KEY
+tutorial	I-KEY
+,	O
+and	O
+the	O
+live	O
+project	O
+to	O
+which	O
+it	O
+was	O
+applied	O
+was	O
+selected	O
+with	O
+this	O
+in	O
+mind	O
+
+New	B-KEY
+developments	I-KEY
+in	O
+inductive	B-KEY
+learning	I-KEY
+Any	O
+intelligent	B-KEY
+system	I-KEY
+,	O
+whether	O
+natural	O
+or	O
+artificial	O
+,	O
+must	O
+have	O
+three	O
+characteristics	O
+:	O
+knowledge	B-KEY
+,	O
+reasoning	B-KEY
+,	O
+and	O
+learning	O
+.	O
+Artificial	B-KEY
+intelligence	I-KEY
+-LRB-	O
+AI	O
+-RRB-	O
+studies	O
+these	O
+three	O
+aspects	O
+in	O
+artificial	O
+systems	O
+.	O
+Briefly	O
+,	O
+we	O
+could	O
+say	O
+that	O
+knowledge	B-KEY
+refers	O
+to	O
+the	O
+system	O
+'s	O
+world	O
+model	O
+,	O
+and	O
+reasoning	B-KEY
+to	O
+the	O
+manipulation	O
+of	O
+this	O
+knowledge	B-KEY
+.	O
+Learning	O
+is	O
+slightly	O
+more	O
+complex	O
+;	O
+the	O
+system	O
+interacts	O
+with	O
+the	O
+world	O
+and	O
+as	O
+a	O
+consequence	O
+it	O
+builds	O
+onto	O
+and	O
+modifies	O
+its	O
+knowledge	B-KEY
+.	O
+This	O
+process	O
+of	O
+self-building	O
+and	O
+self-modifying	O
+is	O
+known	O
+as	O
+learning	O
+.	O
+This	O
+thesis	O
+is	O
+set	O
+within	O
+the	O
+field	O
+of	O
+artificial	B-KEY
+intelligence	I-KEY
+and	O
+focuses	O
+on	O
+learning	O
+.	O
+More	O
+specifically	O
+,	O
+it	O
+deals	O
+with	O
+the	O
+inductive	B-KEY
+learning	I-KEY
+of	O
+decision	B-KEY
+trees	I-KEY
+
+Asymptotic	B-KEY
+expansions	I-KEY
+for	O
+the	O
+zeros	B-KEY
+of	O
+certain	O
+special	O
+functions	O
+We	O
+derive	O
+asymptotic	B-KEY
+expansions	I-KEY
+for	O
+the	O
+zeros	B-KEY
+of	O
+the	O
+cosine-integral	B-KEY
+Ci	O
+-LRB-	O
+x	O
+-RRB-	O
+and	O
+the	O
+Struve	B-KEY
+function	I-KEY
+H/sub	O
+0	O
+/	O
+-LRB-	O
+x	O
+-RRB-	O
+,	O
+and	O
+extend	O
+the	O
+available	O
+formulae	O
+for	O
+the	O
+zeros	B-KEY
+of	O
+Kelvin	B-KEY
+functions	I-KEY
+.	O
+Numerical	O
+evidence	O
+is	O
+provided	O
+to	O
+illustrate	O
+the	O
+accuracy	B-KEY
+of	O
+the	O
+expansions	O
+
+A	O
+formal	B-KEY
+model	I-KEY
+of	O
+correctness	O
+in	O
+a	O
+cadastre	B-KEY
+A	O
+key	O
+issue	O
+for	O
+cadastral	B-KEY
+systems	O
+is	O
+the	O
+maintenance	O
+of	O
+their	O
+correctness	O
+.	O
+Correctness	O
+is	O
+defined	O
+to	O
+be	O
+the	O
+proper	O
+correspondence	O
+between	O
+the	O
+valid	O
+legal	B-KEY
+situation	I-KEY
+and	O
+the	O
+content	O
+of	O
+the	O
+cadastre	B-KEY
+.	O
+This	O
+correspondence	O
+is	O
+generally	O
+difficult	O
+to	O
+achieve	O
+,	O
+since	O
+the	O
+cadastre	B-KEY
+is	O
+not	O
+a	O
+complete	O
+representation	O
+of	O
+all	O
+aspects	O
+influencing	O
+the	O
+legal	B-KEY
+situation	I-KEY
+in	O
+reality	O
+.	O
+The	O
+goal	O
+of	O
+the	O
+paper	O
+is	O
+to	O
+develop	O
+a	O
+formal	B-KEY
+model	I-KEY
+comprising	O
+representations	O
+of	O
+the	O
+cadastre	B-KEY
+and	O
+of	O
+reality	O
+that	O
+allows	O
+the	O
+simulation	O
+and	O
+investigation	O
+of	O
+cases	O
+where	O
+this	O
+correspondence	O
+is	O
+potentially	O
+violated	O
+.	O
+For	O
+this	O
+purpose	O
+the	O
+model	O
+consists	O
+of	O
+two	O
+parts	O
+,	O
+the	O
+first	O
+part	O
+represents	O
+the	O
+valid	O
+legal	B-KEY
+situation	I-KEY
+and	O
+the	O
+second	O
+part	O
+represents	O
+the	O
+cadastre	B-KEY
+.	O
+This	O
+makes	O
+it	O
+feasible	O
+to	O
+mark	O
+the	O
+differences	O
+between	O
+reality	O
+and	O
+the	O
+cadastre	B-KEY
+.	O
+The	O
+marking	O
+together	O
+with	O
+the	O
+two	O
+parts	O
+of	O
+the	O
+model	O
+facilitate	O
+the	O
+discussion	O
+of	O
+issues	O
+in	O
+``	O
+real-world	O
+''	O
+cadastral	B-KEY
+systems	O
+where	O
+incorrectness	O
+occurs	O
+.	O
+In	O
+order	O
+to	O
+develop	O
+a	O
+formal	B-KEY
+model	I-KEY
+,	O
+the	O
+paper	O
+uses	O
+the	O
+transfer	B-KEY
+of	I-KEY
+ownership	I-KEY
+of	O
+a	O
+parcel	O
+between	O
+two	O
+persons	O
+as	O
+minimal	B-KEY
+case	I-KEY
+study	I-KEY
+.	O
+The	O
+foundation	O
+for	O
+the	O
+formalization	O
+is	O
+a	O
+modern	O
+version	O
+of	O
+the	O
+situation	B-KEY
+calculus	I-KEY
+.	O
+The	O
+focus	O
+moves	O
+from	O
+the	O
+analysis	O
+of	O
+the	O
+cadastre	B-KEY
+to	O
+the	O
+preparation	O
+of	O
+a	O
+conceptual	O
+and	O
+a	O
+formalized	B-KEY
+model	I-KEY
+and	O
+the	O
+implementation	O
+of	O
+a	O
+prototype	O
+
+Contentment	O
+management	O
+Andersen	O
+'s	O
+William	O
+Yarker	O
+and	O
+Richard	O
+Young	O
+outline	O
+the	O
+route	O
+to	O
+a	O
+successful	O
+content	B-KEY
+management	I-KEY
+strategy	I-KEY
+
+Information	B-KEY
+systems	I-KEY
+project	I-KEY
+failure	I-KEY
+:	O
+a	O
+comparative	O
+study	O
+of	O
+two	O
+countries	O
+Many	O
+organizations	O
+,	O
+regardless	O
+of	O
+size	O
+,	O
+engage	O
+in	O
+at	O
+least	O
+one	O
+,	O
+and	O
+often	O
+many	O
+information	O
+system	O
+projects	O
+each	O
+year	O
+.	O
+Many	O
+of	O
+these	O
+projects	O
+consume	O
+massive	O
+amounts	O
+of	O
+resources	O
+,	O
+and	O
+may	O
+cost	O
+as	O
+little	O
+as	O
+a	O
+few	O
+thousand	O
+dollars	O
+to	O
+ten	O
+,	O
+and	O
+even	O
+hundreds	O
+of	O
+millions	O
+of	O
+dollars	O
+.	O
+Needless	O
+to	O
+say	O
+,	O
+the	O
+investment	O
+of	O
+time	O
+and	O
+resources	O
+into	O
+these	O
+ventures	O
+are	O
+of	O
+significant	O
+concern	O
+to	O
+chief	O
+information	O
+officers	O
+-LRB-	O
+CIOs	O
+-RRB-	O
+,	O
+executives	O
+staff	O
+members	O
+,	O
+project	O
+managers	O
+,	O
+and	O
+others	O
+in	O
+leadership	O
+positions	O
+.	O
+This	O
+paper	O
+describes	O
+the	O
+results	O
+of	O
+a	O
+survey	O
+performed	O
+between	O
+Australia	B-KEY
+and	O
+the	O
+United	B-KEY
+States	I-KEY
+regarding	O
+factors	O
+leading	O
+to	O
+IS	O
+project	O
+failure	O
+.	O
+The	O
+findings	O
+suggest	O
+that	O
+,	O
+among	O
+other	O
+things	O
+,	O
+end	B-KEY
+user	I-KEY
+involvement	I-KEY
+and	O
+executive	B-KEY
+management	I-KEY
+leadership	I-KEY
+are	O
+key	O
+indicators	O
+influencing	O
+IS	O
+project	O
+failure	O
+
+Fuzzy	O
+non-homogeneous	O
+Markov	O
+systems	O
+In	O
+this	O
+paper	O
+the	O
+theory	O
+of	O
+fuzzy	B-KEY
+logic	I-KEY
+and	O
+fuzzy	B-KEY
+reasoning	I-KEY
+is	O
+combined	O
+with	O
+the	O
+theory	O
+of	O
+Markov	O
+systems	O
+and	O
+the	O
+concept	O
+of	O
+a	O
+fuzzy	O
+non-homogeneous	O
+Markov	O
+system	O
+is	O
+introduced	O
+for	O
+the	O
+first	O
+time	O
+.	O
+This	O
+is	O
+an	O
+effort	O
+to	O
+deal	O
+with	O
+the	O
+uncertainty	B-KEY
+introduced	O
+in	O
+the	O
+estimation	O
+of	O
+the	O
+transition	B-KEY
+probabilities	I-KEY
+and	O
+the	O
+input	B-KEY
+probabilities	I-KEY
+in	O
+Markov	O
+systems	O
+.	O
+The	O
+asymptotic	O
+behaviour	O
+of	O
+the	O
+fuzzy	O
+Markov	O
+system	O
+and	O
+its	O
+asymptotic	B-KEY
+variability	I-KEY
+is	O
+considered	O
+and	O
+given	O
+in	O
+closed	O
+analytic	O
+form	O
+.	O
+Moreover	O
+,	O
+the	O
+asymptotically	O
+attainable	O
+structures	O
+of	O
+the	O
+system	O
+are	O
+estimated	O
+also	O
+in	O
+a	O
+closed	O
+analytic	O
+form	O
+under	O
+some	O
+realistic	O
+assumptions	O
+.	O
+The	O
+importance	O
+of	O
+this	O
+result	O
+lies	O
+in	O
+the	O
+fact	O
+that	O
+in	O
+most	O
+cases	O
+the	O
+traditional	O
+methods	O
+for	O
+estimating	O
+the	O
+probabilities	O
+can	O
+not	O
+be	O
+used	O
+due	O
+to	O
+lack	O
+of	O
+data	O
+and	O
+measurement	B-KEY
+errors	I-KEY
+.	O
+The	O
+introduction	O
+of	O
+fuzzy	B-KEY
+logic	I-KEY
+into	O
+Markov	O
+systems	O
+represents	O
+a	O
+powerful	O
+tool	O
+for	O
+taking	O
+advantage	O
+of	O
+the	O
+symbolic	B-KEY
+knowledge	I-KEY
+that	O
+the	O
+experts	O
+of	O
+the	O
+systems	O
+possess	O
+
+Uniform	B-KEY
+supersaturated	I-KEY
+design	I-KEY
+and	O
+its	O
+construction	O
+Supersaturated	O
+designs	O
+are	O
+factorial	B-KEY
+designs	I-KEY
+in	O
+which	O
+the	O
+number	O
+of	O
+main	O
+effects	O
+is	O
+greater	O
+than	O
+the	O
+number	O
+of	O
+experimental	B-KEY
+runs	I-KEY
+.	O
+In	O
+this	O
+paper	O
+,	O
+a	O
+discrete	B-KEY
+discrepancy	I-KEY
+is	O
+proposed	O
+as	O
+a	O
+measure	O
+of	O
+uniformity	O
+for	O
+supersaturated	O
+designs	O
+,	O
+and	O
+a	O
+lower	O
+bound	O
+of	O
+this	O
+discrepancy	O
+is	O
+obtained	O
+as	O
+,	O
+a	O
+benchmark	O
+of	O
+design	O
+uniformity	O
+.	O
+A	O
+construction	O
+method	O
+for	O
+uniform	B-KEY
+supersaturated	I-KEY
+designs	I-KEY
+via	O
+resolvable	B-KEY
+balanced	I-KEY
+incomplete	I-KEY
+block	I-KEY
+designs	I-KEY
+is	O
+also	O
+presented	O
+along	O
+with	O
+the	O
+investigation	O
+of	O
+properties	O
+of	O
+the	O
+resulting	O
+designs	O
+.	O
+The	O
+construction	O
+method	O
+shows	O
+a	O
+strong	O
+link	O
+between	O
+these	O
+two	O
+different	O
+kinds	O
+of	O
+designs	O
+
+Relation	O
+between	O
+glare	B-KEY
+and	O
+driving	B-KEY
+performance	I-KEY
+The	O
+present	O
+study	O
+investigated	O
+the	O
+effects	O
+of	O
+discomfort	B-KEY
+glare	I-KEY
+on	O
+driving	O
+behavior	O
+.	O
+Participants	O
+-LRB-	O
+old	O
+and	O
+young	O
+;	O
+US	O
+and	O
+Europeans	O
+-RRB-	O
+were	O
+exposed	O
+to	O
+a	O
+simulated	B-KEY
+low	I-KEY
+-	I-KEY
+beam	I-KEY
+light	I-KEY
+source	I-KEY
+mounted	O
+on	O
+the	O
+hood	O
+of	O
+an	O
+instrumented	O
+vehicle	O
+.	O
+Participants	O
+drove	O
+at	O
+night	O
+in	O
+actual	O
+traffic	O
+along	O
+a	O
+track	O
+consisting	O
+of	O
+urban	O
+,	O
+rural	O
+,	O
+and	O
+highway	B-KEY
+stretches	O
+.	O
+The	O
+results	O
+show	O
+that	O
+the	O
+relatively	O
+low	O
+glare	B-KEY
+source	O
+caused	O
+a	O
+significant	O
+drop	O
+in	O
+detecting	O
+simulated	O
+pedestrians	O
+along	O
+the	O
+roadside	O
+and	O
+made	O
+participants	O
+drive	O
+significantly	O
+slower	O
+on	O
+dark	O
+and	O
+winding	O
+roads	O
+.	O
+Older	O
+participants	O
+showed	O
+the	O
+largest	O
+drop	O
+in	O
+pedestrian	O
+detection	O
+performance	O
+and	O
+reduced	O
+their	O
+driving	O
+speed	O
+the	O
+most	O
+.	O
+The	O
+results	O
+indicate	O
+that	O
+the	O
+de	O
+Boer	O
+rating	O
+scale	O
+,	O
+the	O
+most	O
+commonly	O
+used	O
+rating	O
+scale	O
+for	O
+discomfort	B-KEY
+glare	I-KEY
+,	O
+is	O
+practically	O
+useless	O
+as	O
+a	O
+predictor	O
+of	O
+driving	O
+performance	O
+.	O
+Furthermore	O
+,	O
+the	O
+maximum	O
+US	O
+headlamp	O
+intensity	O
+-LRB-	O
+1380	O
+cd	O
+per	O
+headlamp	O
+-RRB-	O
+appears	O
+to	O
+be	O
+an	O
+acceptable	O
+upper	O
+limit	O
+
+Simulation	B-KEY
+of	O
+ecological	O
+and	O
+economical	B-KEY
+structural-type	I-KEY
+functions	I-KEY
+An	O
+optimization	O
+approach	O
+to	O
+the	O
+simulation	B-KEY
+of	O
+ecological	O
+and	O
+economical	B-KEY
+structural-type	I-KEY
+functions	I-KEY
+is	O
+proposed	O
+.	O
+A	O
+methodology	O
+for	O
+construction	O
+of	O
+such	O
+functions	O
+is	O
+created	O
+in	O
+an	O
+explicit	B-KEY
+analytical	I-KEY
+form	I-KEY
+
+Rate	O
+allocation	O
+for	O
+video	B-KEY
+transmission	I-KEY
+over	O
+lossy	B-KEY
+correlated	I-KEY
+networks	I-KEY
+A	O
+novel	O
+rate	B-KEY
+allocation	I-KEY
+algorithm	I-KEY
+for	O
+video	B-KEY
+transmission	I-KEY
+over	O
+lossy	O
+networks	O
+subject	O
+to	O
+bursty	B-KEY
+packet	I-KEY
+losses	I-KEY
+is	O
+presented	O
+.	O
+A	O
+Gilbert-Elliot	B-KEY
+model	I-KEY
+is	O
+used	O
+at	O
+the	O
+encoder	O
+to	O
+drive	O
+the	O
+selection	O
+of	O
+coding	B-KEY
+parameters	I-KEY
+.	O
+Experimental	O
+results	O
+using	O
+the	O
+H.	O
+26L	O
+test	O
+model	O
+show	O
+a	O
+significant	O
+performance	O
+improvement	O
+with	O
+respect	O
+to	O
+the	O
+assumption	O
+of	O
+independent	O
+packet	O
+losses	O
+
+GK-DEVS	B-KEY
+:	O
+Geometric	O
+and	O
+kinematic	B-KEY
+DEVS	I-KEY
+formalism	O
+for	O
+simulation	B-KEY
+modeling	I-KEY
+of	O
+3-dimensional	O
+multi-component	O
+systems	O
+A	O
+combined	B-KEY
+discrete/continuous	I-KEY
+simulation	I-KEY
+methodology	I-KEY
+based	O
+on	O
+the	O
+DEVS	O
+-LRB-	O
+discrete	O
+event	O
+system	O
+specification	O
+-RRB-	O
+formalism	O
+is	O
+presented	O
+in	O
+this	O
+paper	O
+that	O
+satisfies	O
+the	O
+simulation	B-KEY
+requirements	I-KEY
+of	O
+3-dimensional	O
+and	O
+dynamic	O
+systems	O
+with	O
+multi-components	O
+.	O
+We	O
+propose	O
+a	O
+geometric	O
+and	O
+kinematic	B-KEY
+DEVS	I-KEY
+-LRB-	O
+GK-DEVS	B-KEY
+-RRB-	O
+formalism	O
+that	O
+is	O
+able	O
+to	O
+describe	O
+the	O
+geometric	O
+and	O
+kinematic	O
+structure	O
+of	O
+a	O
+system	O
+and	O
+its	O
+continuous	B-KEY
+state	I-KEY
+dynamics	I-KEY
+as	O
+well	O
+as	O
+the	O
+interaction	O
+among	O
+the	O
+multi-components	O
+.	O
+To	O
+establish	O
+one	O
+model	O
+having	O
+dynamic	B-KEY
+behavior	I-KEY
+and	O
+a	O
+particular	O
+hierarchical	O
+structure	O
+,	O
+the	O
+atomic	O
+and	O
+the	O
+coupled	O
+model	O
+of	O
+the	O
+conventional	O
+DEVS	O
+are	O
+merged	O
+into	O
+one	O
+model	O
+in	O
+the	O
+proposed	O
+formalism	O
+.	O
+For	O
+simulation	O
+of	O
+the	O
+continuous	B-KEY
+motion	I-KEY
+of	O
+3-D	O
+components	O
+,	O
+the	O
+sequential	B-KEY
+state	I-KEY
+set	I-KEY
+is	O
+partitioned	O
+into	O
+the	O
+discrete	O
+and	O
+the	O
+continuous	O
+state	O
+set	O
+and	O
+the	O
+rate	O
+of	O
+change	O
+function	O
+over	O
+the	O
+continuous	O
+state	O
+set	O
+is	O
+employed	O
+.	O
+Although	O
+modified	O
+from	O
+the	O
+conventional	O
+DEVS	O
+formalism	O
+,	O
+the	O
+GK-DEVS	B-KEY
+formalism	O
+preserves	O
+a	O
+hierarchical	O
+,	O
+modular	O
+modeling	O
+fashion	O
+and	O
+a	O
+coupling	O
+scheme	O
+.	O
+Furthermore	O
+,	O
+for	O
+the	O
+GK-DEVS	B-KEY
+model	O
+simulation	O
+,	O
+we	O
+propose	O
+an	O
+abstract	B-KEY
+simulation	I-KEY
+algorithm	I-KEY
+,	O
+called	O
+a	O
+GK-Simulator	B-KEY
+,	O
+in	O
+which	O
+data	O
+and	O
+control	O
+are	O
+separated	O
+and	O
+events	O
+are	O
+scheduled	O
+not	O
+globally	O
+but	O
+hierarchically	O
+so	O
+that	O
+an	O
+object-oriented	B-KEY
+principle	I-KEY
+is	O
+satisfied	O
+.	O
+The	O
+proposed	O
+GK-DEVS	B-KEY
+formalism	O
+and	O
+the	O
+GK-Simulator	B-KEY
+algorithm	O
+have	O
+been	O
+applied	O
+to	O
+the	O
+simulation	O
+of	O
+a	O
+flexible	B-KEY
+manufacturing	I-KEY
+system	I-KEY
+consisting	O
+of	O
+a	O
+2-axis	B-KEY
+lathe	I-KEY
+,	O
+a	O
+3-axis	B-KEY
+milling	I-KEY
+machine	I-KEY
+,	O
+and	O
+a	O
+vehicle-mounted	B-KEY
+robot	I-KEY
+
+The	O
+design	O
+and	O
+implementation	O
+of	O
+VAMPIRE	B-KEY
+We	O
+describe	O
+VAMPIRE	B-KEY
+:	O
+a	O
+high-performance	B-KEY
+theorem	I-KEY
+prover	I-KEY
+for	O
+first-order	B-KEY
+logic	I-KEY
+.	O
+As	O
+our	O
+description	O
+is	O
+mostly	O
+targeted	O
+to	O
+the	O
+developers	O
+of	O
+such	O
+systems	O
+and	O
+specialists	O
+in	O
+automated	B-KEY
+reasoning	I-KEY
+,	O
+it	O
+focuses	O
+on	O
+the	O
+design	O
+of	O
+the	O
+system	O
+and	O
+some	O
+key	O
+implementation	O
+features	O
+.	O
+We	O
+also	O
+analyze	O
+the	O
+performance	O
+of	O
+the	O
+prover	O
+at	O
+CASC-JC	B-KEY
+
+Computational	B-KEY
+complexity	I-KEY
+of	O
+probabilistic	B-KEY
+disambiguation	I-KEY
+Recent	O
+models	O
+of	O
+natural	B-KEY
+language	I-KEY
+processing	I-KEY
+employ	O
+statistical	B-KEY
+reasoning	O
+for	O
+dealing	O
+with	O
+the	O
+ambiguity	O
+of	O
+formal	O
+grammars	O
+.	O
+In	O
+this	O
+approach	O
+,	O
+statistics	B-KEY
+,	O
+concerning	O
+the	O
+various	O
+linguistic	O
+phenomena	O
+of	O
+interest	O
+,	O
+are	O
+gathered	O
+from	O
+actual	O
+linguistic	O
+data	O
+and	O
+used	O
+to	O
+estimate	O
+the	O
+probabilities	O
+of	O
+the	O
+various	O
+entities	O
+that	O
+are	O
+generated	O
+by	O
+a	O
+given	O
+grammar	O
+,	O
+e.g.	O
+,	O
+derivations	O
+,	O
+parse-trees	O
+and	O
+sentences	O
+.	O
+The	O
+extension	O
+of	O
+grammars	O
+with	O
+probabilities	O
+makes	O
+it	O
+possible	O
+to	O
+state	B-KEY
+ambiguity	I-KEY
+resolution	I-KEY
+as	O
+a	O
+constrained	B-KEY
+optimization	I-KEY
+formula	I-KEY
+,	O
+which	O
+aims	O
+at	O
+maximizing	O
+the	O
+probability	O
+of	O
+some	O
+entity	O
+that	O
+the	O
+grammar	O
+generates	O
+given	O
+the	O
+input	O
+-LRB-	O
+e.g.	O
+,	O
+maximum	O
+probability	O
+parse-tree	O
+given	O
+some	O
+input	O
+sentence	O
+-RRB-	O
+.	O
+The	O
+implementation	O
+of	O
+these	O
+optimization	O
+formulae	O
+in	O
+efficient	O
+algorithms	O
+,	O
+however	O
+,	O
+does	O
+not	O
+always	O
+proceed	O
+smoothly	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+address	O
+the	O
+computational	B-KEY
+complexity	I-KEY
+of	O
+ambiguity	O
+resolution	O
+under	O
+various	O
+kinds	O
+of	O
+probabilistic	B-KEY
+models	I-KEY
+.	O
+We	O
+provide	O
+proofs	O
+that	O
+some	O
+,	O
+frequently	O
+occurring	O
+problems	O
+of	O
+ambiguity	O
+resolution	O
+are	O
+NP-complete	O
+.	O
+These	O
+problems	O
+are	O
+encountered	O
+in	O
+various	O
+applications	O
+,	O
+e.g.	O
+,	O
+language	B-KEY
+understanding	I-KEY
+for	O
+textand	O
+speech-based	O
+applications	O
+.	O
+Assuming	O
+the	O
+common	O
+model	O
+of	O
+computation	O
+,	O
+this	O
+result	O
+implies	O
+that	O
+,	O
+for	O
+many	O
+existing	O
+probabilistic	B-KEY
+models	I-KEY
+it	O
+is	O
+not	O
+possible	O
+to	O
+devise	O
+tractable	O
+algorithms	O
+for	O
+solving	O
+these	O
+optimization	O
+problems	O
+
+Single-phase	O
+half-bridge	O
+converter	O
+topology	O
+for	O
+power	B-KEY
+quality	I-KEY
+compensation	I-KEY
+A	O
+high	O
+power	O
+factor	O
+half-bridge	O
+rectifier	O
+with	O
+neutral	B-KEY
+point	I-KEY
+switch	I-KEY
+clamped	I-KEY
+scheme	I-KEY
+is	O
+proposed	O
+.	O
+Three	O
+power	O
+switches	O
+are	O
+employed	O
+in	O
+the	O
+proposed	O
+rectifier	O
+.	O
+Two	O
+PWM	B-KEY
+control	I-KEY
+schemes	I-KEY
+are	O
+used	O
+to	O
+draw	O
+a	O
+sinusoidal	B-KEY
+line	I-KEY
+current	I-KEY
+with	O
+low	O
+current	B-KEY
+distortion	I-KEY
+.	O
+The	O
+control	O
+signals	O
+of	O
+the	O
+power	O
+switches	O
+are	O
+derived	O
+from	O
+the	O
+DC	B-KEY
+link	I-KEY
+voltage	I-KEY
+balance	I-KEY
+compensator	I-KEY
+,	O
+line	B-KEY
+current	I-KEY
+controller	I-KEY
+and	O
+DC	B-KEY
+link	I-KEY
+voltage	I-KEY
+regulator	I-KEY
+.	O
+The	O
+hysteresis	B-KEY
+current	I-KEY
+control	I-KEY
+scheme	I-KEY
+is	O
+employed	O
+to	O
+track	O
+the	O
+line	O
+current	O
+command	O
+.	O
+The	O
+proposed	O
+control	O
+scheme	O
+and	O
+the	O
+circuit	B-KEY
+configuration	I-KEY
+can	O
+be	O
+applied	O
+to	O
+the	O
+active	O
+power	O
+filter	O
+to	O
+eliminate	O
+the	O
+harmonic	O
+currents	O
+and	O
+compensate	O
+the	O
+reactive	O
+power	O
+generated	O
+from	O
+the	O
+nonlinear	O
+load	O
+.	O
+Analytical	O
+and	O
+experimental	O
+results	O
+are	O
+included	O
+to	O
+illustrate	O
+the	O
+validity	O
+and	O
+effectiveness	O
+of	O
+the	O
+proposed	O
+control	O
+scheme	O
+
+The	O
+simulated	B-KEY
+emergence	I-KEY
+of	O
+distributed	O
+environmental	O
+control	O
+in	O
+evolving	B-KEY
+microcosms	I-KEY
+This	O
+work	O
+continues	O
+investigation	O
+into	O
+Gaia	B-KEY
+theory	I-KEY
+-LRB-	O
+Lovelock	O
+,	O
+The	O
+ages	O
+of	O
+Gaia	O
+,	O
+Oxford	O
+University	O
+Press	O
+,	O
+1995	O
+-RRB-	O
+from	O
+an	O
+artificial	B-KEY
+life	I-KEY
+perspective	O
+-LRB-	O
+Downing	O
+,	O
+Proceedings	O
+of	O
+the	O
+7th	O
+International	O
+Conference	O
+on	O
+Artificial	B-KEY
+Life	I-KEY
+,	O
+p.	O
+90-99	O
+,	O
+MIT	O
+Press	O
+,	O
+2000	O
+-RRB-	O
+,	O
+with	O
+the	O
+aim	O
+of	O
+assessing	O
+the	O
+general	O
+compatibility	O
+of	O
+emergent	B-KEY
+distributed	I-KEY
+environmental	I-KEY
+control	I-KEY
+with	O
+conventional	O
+natural	B-KEY
+selection	I-KEY
+.	O
+Our	O
+earlier	O
+system	O
+,	O
+GUILD	O
+-LRB-	O
+Downing	O
+and	O
+Zvirinsky	O
+,	O
+Artificial	B-KEY
+Life	I-KEY
+,	O
+5	O
+,	O
+p.291-318	O
+,	O
+1999	O
+-RRB-	O
+,	O
+displayed	O
+emergent	O
+regulation	O
+of	O
+the	O
+chemical	O
+environment	O
+by	O
+a	O
+population	O
+of	O
+metabolizing	B-KEY
+agents	I-KEY
+,	O
+but	O
+the	O
+chemical	B-KEY
+model	I-KEY
+underlying	O
+those	O
+results	O
+was	O
+trivial	O
+,	O
+essentially	O
+admitting	O
+all	O
+possible	O
+reactions	O
+at	O
+a	O
+single	O
+energy	O
+cost	O
+.	O
+The	O
+new	O
+model	O
+,	O
+METAMIC	O
+,	O
+utilizes	O
+abstract	O
+chemistries	O
+that	O
+are	O
+both	O
+-LRB-	O
+a	O
+-RRB-	O
+constrained	O
+to	O
+a	O
+small	O
+set	O
+of	O
+legal	O
+reactions	O
+,	O
+and	O
+-LRB-	O
+b	O
+-RRB-	O
+grounded	O
+in	O
+basic	O
+fundamental	O
+relationships	O
+between	O
+energy	O
+,	O
+entropy	O
+,	O
+and	O
+biomass	O
+synthesis/breakdown	O
+.	O
+To	O
+explore	O
+the	O
+general	O
+phenomena	O
+of	O
+emergent	B-KEY
+homeostasis	I-KEY
+,	O
+we	O
+generate	O
+100	O
+different	O
+chemistries	O
+and	O
+use	O
+each	O
+as	O
+the	O
+basis	O
+for	O
+several	O
+METAMIC	O
+runs	O
+,	O
+as	O
+part	O
+of	O
+a	O
+Gaia	B-KEY
+hunt	I-KEY
+.	O
+This	O
+search	O
+discovers	O
+20	O
+chemistries	O
+that	O
+support	O
+microbial	O
+populations	O
+capable	O
+of	O
+regulating	O
+a	O
+physical	O
+environmental	O
+factor	O
+within	O
+their	O
+growth-optimal	O
+range	O
+,	O
+despite	O
+the	O
+extra	O
+metabolic	O
+cost	O
+.	O
+Case	O
+studies	O
+from	O
+the	O
+Gaia	B-KEY
+hunt	I-KEY
+illustrate	O
+a	O
+few	O
+simple	O
+mechanisms	O
+by	O
+which	O
+real	O
+biota	O
+might	O
+exploit	O
+the	O
+underlying	O
+chemistry	O
+to	O
+achieve	O
+some	O
+control	O
+over	O
+their	O
+physical	O
+environment	O
+.	O
+Although	O
+these	O
+results	O
+shed	O
+little	O
+light	O
+on	O
+the	O
+question	O
+of	O
+Gaia	O
+on	O
+Earth	O
+,	O
+they	O
+support	O
+the	O
+possibility	O
+of	O
+emergent	O
+environmental	O
+control	O
+at	O
+the	O
+microcosmic	O
+level	O
+
+Chaos	B-KEY
+theory	I-KEY
+as	O
+a	O
+framework	O
+for	O
+studying	O
+information	B-KEY
+systems	I-KEY
+This	O
+paper	O
+introduces	O
+chaos	B-KEY
+theory	I-KEY
+as	O
+a	O
+means	O
+of	O
+studying	O
+information	B-KEY
+systems	I-KEY
+.	O
+It	O
+argues	O
+that	O
+chaos	B-KEY
+theory	I-KEY
+,	O
+combined	O
+with	O
+new	O
+techniques	O
+for	O
+discovering	O
+patterns	O
+in	O
+complex	O
+quantitative	O
+and	O
+qualitative	B-KEY
+evidence	I-KEY
+,	O
+offers	O
+a	O
+potentially	O
+more	O
+substantive	O
+approach	O
+to	O
+understand	O
+the	O
+nature	O
+of	O
+information	B-KEY
+systems	I-KEY
+in	O
+a	O
+variety	O
+of	O
+contexts	O
+.	O
+The	O
+paper	O
+introduces	O
+chaos	B-KEY
+theory	I-KEY
+concepts	O
+by	O
+way	O
+of	O
+an	O
+illustrative	O
+research	O
+design	O
+
+Improved	O
+approximation	O
+of	O
+Max-Cut	O
+on	O
+graphs	O
+of	O
+bounded	O
+degree	O
+Let	O
+alpha	O
+approximately	O
+=	O
+0.87856	O
+denote	O
+the	O
+best	B-KEY
+approximation	I-KEY
+ratio	I-KEY
+currently	O
+known	O
+for	O
+the	O
+Max-Cut	O
+problem	O
+on	O
+general	O
+graphs	O
+.	O
+We	O
+consider	O
+a	O
+semidefinite	B-KEY
+relaxation	I-KEY
+of	O
+the	O
+Max-Cut	O
+problem	O
+,	O
+round	O
+it	O
+using	O
+the	O
+random	O
+hyperplane	O
+rounding	O
+technique	O
+of	O
+M.X.	O
+Goemans	O
+and	O
+D.P.	O
+Williamson	O
+-LRB-	O
+1995	O
+-RRB-	O
+,	O
+and	O
+then	O
+add	O
+a	O
+local	O
+improvement	O
+step	O
+.	O
+We	O
+show	O
+that	O
+for	O
+graphs	O
+of	O
+degree	O
+at	O
+most	O
+Delta	O
+,	O
+our	O
+algorithm	O
+achieves	O
+an	O
+approximation	B-KEY
+ratio	I-KEY
+of	O
+at	O
+least	O
+alpha	O
++	O
+epsilon	O
+,	O
+where	O
+epsilon	O
+>	O
+0	O
+is	O
+a	O
+constant	O
+that	O
+depends	O
+only	O
+on	O
+Delta	O
+.	O
+.	O
+Using	O
+computer	B-KEY
+assisted	I-KEY
+analysis	I-KEY
+,	O
+we	O
+show	O
+that	O
+for	O
+graphs	O
+of	O
+maximal	O
+degree	O
+3	O
+our	O
+algorithm	O
+obtains	O
+an	O
+approximation	B-KEY
+ratio	I-KEY
+of	O
+at	O
+least	O
+0.921	O
+,	O
+and	O
+for	O
+3-regular	O
+graphs	O
+the	O
+approximation	B-KEY
+ratio	I-KEY
+is	O
+at	O
+least	O
+0.924	O
+.	O
+We	O
+note	O
+that	O
+for	O
+the	O
+semidefinite	B-KEY
+relaxation	I-KEY
+of	O
+Max-Cut	O
+used	O
+by	O
+Goemans	O
+and	O
+Williamson	O
+the	O
+integrality	O
+gap	O
+is	O
+at	O
+least	O
+1/0	O
+.885	O
+,	O
+even	O
+for	O
+2-regular	B-KEY
+graphs	I-KEY
+
+Convergence	O
+of	O
+finite	O
+element	O
+approximations	O
+and	O
+multilevel	B-KEY
+linearization	I-KEY
+for	O
+Ginzburg-Landau	B-KEY
+model	I-KEY
+of	O
+d-wave	B-KEY
+superconductors	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+consider	O
+the	O
+finite	O
+element	O
+approximations	O
+of	O
+a	O
+recently	O
+proposed	O
+Ginzburg-Landau-type	O
+model	O
+for	O
+d-wave	B-KEY
+superconductors	O
+.	O
+In	O
+contrast	O
+to	O
+the	O
+conventional	O
+Ginzburg-Landau	B-KEY
+model	I-KEY
+the	O
+scalar	O
+complex	O
+valued	O
+order-parameter	O
+is	O
+replaced	O
+by	O
+a	O
+multicomponent	O
+complex	O
+order-parameter	O
+and	O
+the	O
+free	B-KEY
+energy	I-KEY
+is	O
+modified	O
+according	O
+to	O
+the	O
+d-wave	B-KEY
+paring	O
+symmetry	O
+.	O
+Convergence	O
+and	O
+optimal	O
+error	B-KEY
+estimates	I-KEY
+and	O
+some	O
+super-convergent	O
+estimates	O
+for	O
+the	O
+derivatives	O
+are	O
+derived	O
+.	O
+Furthermore	O
+,	O
+we	O
+propose	O
+a	O
+multilevel	B-KEY
+linearization	I-KEY
+procedure	O
+to	O
+solve	O
+the	O
+nonlinear	B-KEY
+systems	I-KEY
+.	O
+It	O
+is	O
+proved	O
+that	O
+the	O
+optimal	O
+error	B-KEY
+estimates	I-KEY
+and	O
+super-convergence	O
+for	O
+the	O
+derivatives	O
+are	O
+preserved	O
+by	O
+the	O
+multi-level	O
+linearization	O
+algorithm	O
+
+The	O
+vibration	B-KEY
+reliability	I-KEY
+of	O
+poppet	O
+and	O
+contoured	B-KEY
+actuator	I-KEY
+valves	I-KEY
+The	O
+problem	O
+of	O
+selecting	O
+the	O
+shape	O
+of	O
+the	O
+actuator	O
+valve	O
+-LRB-	O
+the	O
+final	O
+control	O
+valve	O
+-RRB-	O
+itself	O
+is	O
+discussed	O
+;	O
+the	O
+solution	O
+to	O
+this	O
+problem	O
+will	O
+permit	O
+appreciable	O
+dynamic	O
+loads	O
+to	O
+be	O
+eliminated	O
+from	O
+the	O
+moving	B-KEY
+elements	I-KEY
+of	O
+the	O
+steam	B-KEY
+distribution	I-KEY
+system	I-KEY
+of	O
+steam	B-KEY
+turbines	I-KEY
+under	O
+all	O
+operating	O
+conditions	O
+
+The	O
+best	O
+circulant	B-KEY
+preconditioners	I-KEY
+for	O
+Hermitian	O
+Toeplitz	O
+systems.II	O
+.	O
+The	O
+multiple-zero	B-KEY
+case	I-KEY
+For	O
+pt.I	O
+.	O
+see	O
+SIAM	O
+J.	O
+Numer	O
+.	O
+Anal.	O
+,	O
+vol	O
+.	O
+38	O
+,	O
+p.	O
+876-896	O
+.	O
+Circulant-type	O
+preconditioners	O
+have	O
+been	O
+proposed	O
+previously	O
+for	O
+ill-conditioned	O
+Hermitian	B-KEY
+Toeplitz	I-KEY
+systems	I-KEY
+that	O
+are	O
+generated	O
+by	O
+nonnegative	B-KEY
+continuous	I-KEY
+functions	I-KEY
+with	O
+a	O
+zero	O
+of	O
+even	O
+order	O
+.	O
+The	O
+proposed	O
+circulant	B-KEY
+preconditioners	I-KEY
+can	O
+be	O
+constructed	O
+without	O
+requiring	O
+explicit	O
+knowledge	O
+of	O
+the	O
+generating	B-KEY
+functions	I-KEY
+.	O
+It	O
+was	O
+shown	O
+that	O
+the	O
+spectra	O
+of	O
+the	O
+preconditioned	B-KEY
+matrices	I-KEY
+are	O
+uniformly	O
+bounded	O
+except	O
+for	O
+a	O
+fixed	O
+number	O
+of	O
+outliers	O
+and	O
+that	O
+all	O
+eigenvalues	B-KEY
+are	O
+uniformly	O
+bounded	O
+away	O
+from	O
+zero	O
+.	O
+Therefore	O
+the	O
+conjugate	B-KEY
+gradient	I-KEY
+method	I-KEY
+converges	O
+linearly	O
+when	O
+applied	O
+to	O
+solving	O
+the	O
+circulant	O
+preconditioned	O
+systems	O
+.	O
+Previously	O
+it	O
+was	O
+claimed	O
+that	O
+this	O
+result	O
+can	O
+be	O
+extended	O
+to	O
+the	O
+case	O
+where	O
+the	O
+generating	B-KEY
+functions	I-KEY
+have	O
+multiple	O
+zeros	O
+.	O
+The	O
+main	O
+aim	O
+of	O
+this	O
+paper	O
+is	O
+to	O
+give	O
+a	O
+complete	O
+convergence	O
+proof	O
+of	O
+the	O
+method	O
+for	O
+this	O
+class	O
+of	O
+generating	B-KEY
+functions	I-KEY
+
+Axioms	B-KEY
+for	O
+branching	B-KEY
+time	I-KEY
+Logics	O
+of	O
+general	O
+branching	B-KEY
+time	I-KEY
+,	O
+or	O
+historical	O
+necessity	O
+,	O
+have	O
+long	O
+been	O
+studied	O
+but	O
+important	O
+axiomatization	O
+questions	O
+remain	O
+open	O
+.	O
+Here	O
+the	O
+difficulties	O
+of	O
+finding	O
+axioms	B-KEY
+for	O
+such	O
+logics	O
+are	O
+considered	O
+and	O
+ideas	O
+for	O
+solving	O
+some	O
+of	O
+the	O
+main	O
+open	O
+problems	O
+are	O
+presented	O
+.	O
+A	O
+new	O
+,	O
+more	O
+expressive	O
+logical	O
+account	O
+is	O
+also	O
+given	O
+to	O
+support	O
+Peirce	O
+'s	O
+prohibition	O
+on	O
+truth	B-KEY
+values	I-KEY
+being	O
+attached	O
+to	O
+the	O
+contingent	O
+future	O
+
+Assessment	O
+of	O
+prehospital	O
+chest	O
+pain	O
+using	O
+telecardiology	B-KEY
+Two	O
+hundred	O
+general	B-KEY
+practitioners	I-KEY
+were	O
+equipped	O
+with	O
+a	O
+portable	B-KEY
+electrocardiograph	I-KEY
+which	O
+could	O
+transmit	O
+a	O
+12-lead	O
+electrocardiogram	O
+-LRB-	O
+ECG	O
+-RRB-	O
+via	O
+a	O
+telephone	B-KEY
+line	I-KEY
+.	O
+A	O
+cardiologist	O
+was	O
+available	O
+24	O
+h	O
+a	O
+day	O
+for	O
+an	O
+interactive	B-KEY
+teleconsultation	I-KEY
+.	O
+In	O
+a	O
+13	B-KEY
+month	I-KEY
+period	O
+there	O
+were	O
+5073	O
+calls	O
+to	O
+the	O
+telecardiology	B-KEY
+service	O
+and	O
+952	O
+subjects	O
+with	O
+chest	O
+pain	O
+were	O
+identified	O
+.	O
+The	O
+telecardiology	B-KEY
+service	O
+allowed	O
+the	O
+general	B-KEY
+practitioners	I-KEY
+to	O
+manage	O
+700	O
+cases	O
+-LRB-	O
+74	O
+%	O
+-RRB-	O
+themselves	O
+;	O
+further	O
+diagnostic	B-KEY
+tests	I-KEY
+were	O
+requested	O
+for	O
+162	O
+patients	B-KEY
+-LRB-	O
+17	O
+%	O
+-RRB-	O
+and	O
+83	O
+patients	B-KEY
+-LRB-	O
+9	O
+%	O
+-RRB-	O
+were	O
+sent	O
+to	O
+the	O
+hospital	B-KEY
+emergency	I-KEY
+department	I-KEY
+.	O
+In	O
+the	O
+last	O
+group	O
+a	O
+cardiological	O
+diagnosis	O
+was	O
+confirmed	O
+in	O
+60	O
+patients	B-KEY
+and	O
+refuted	O
+in	O
+23	O
+.	O
+Seven	O
+patients	B-KEY
+in	O
+whom	O
+the	O
+telecardiology	B-KEY
+service	O
+failed	O
+to	O
+detect	O
+a	O
+cardiac	O
+problem	O
+were	O
+hospitalized	O
+in	O
+the	O
+subsequent	O
+48	O
+h	O
+.	O
+The	O
+telecardiology	B-KEY
+service	O
+showed	O
+a	O
+sensitivity	B-KEY
+of	O
+97.4	O
+%	O
+,	O
+a	O
+specificity	B-KEY
+of	O
+89.5	O
+%	O
+and	O
+a	O
+diagnostic	B-KEY
+accuracy	I-KEY
+of	O
+86.9	O
+%	O
+for	O
+chest	O
+pain	O
+.	O
+Telemedicine	O
+could	O
+be	O
+a	O
+useful	O
+tool	O
+in	O
+the	O
+diagnosis	O
+of	O
+chest	O
+pain	O
+in	O
+primary	B-KEY
+care	I-KEY
+
+On	O
+trajectory	O
+and	O
+force	B-KEY
+tracking	I-KEY
+control	I-KEY
+of	O
+constrained	B-KEY
+mobile	I-KEY
+manipulators	I-KEY
+with	O
+parameter	B-KEY
+uncertainty	I-KEY
+Studies	O
+the	O
+trajectory	O
+and	O
+force	B-KEY
+tracking	I-KEY
+control	I-KEY
+problem	O
+of	O
+mobile	O
+manipulators	O
+subject	O
+to	O
+holonomic	O
+and	O
+nonholonomic	B-KEY
+constraints	I-KEY
+with	O
+unknown	O
+inertia	O
+parameters	O
+.	O
+Adaptive	B-KEY
+controllers	I-KEY
+are	O
+proposed	O
+based	O
+on	O
+a	O
+suitable	O
+reduced	B-KEY
+dynamic	I-KEY
+model	I-KEY
+,	O
+the	O
+defined	O
+reference	O
+signals	O
+and	O
+the	O
+mixed	B-KEY
+tracking	I-KEY
+errors	I-KEY
+.	O
+The	O
+proposed	O
+controllers	O
+not	O
+only	O
+ensure	O
+the	O
+entire	O
+state	O
+of	O
+the	O
+system	O
+to	O
+asymptotically	B-KEY
+converge	I-KEY
+to	O
+the	O
+desired	O
+trajectory	O
+but	O
+also	O
+ensure	O
+the	O
+constraint	O
+force	O
+to	O
+asymptotically	B-KEY
+converge	I-KEY
+to	O
+the	O
+desired	O
+force	O
+.	O
+A	O
+detailed	O
+numerical	O
+example	O
+is	O
+presented	O
+to	O
+illustrate	O
+the	O
+developed	O
+methods	O
+
+Developing	O
+Web-enhanced	B-KEY
+learning	I-KEY
+for	O
+information	O
+fluency-a	O
+liberal	B-KEY
+arts	I-KEY
+college	I-KEY
+'s	O
+perspective	O
+Learning	O
+is	O
+likely	O
+to	O
+take	O
+a	O
+new	O
+form	O
+in	O
+the	O
+twenty-first	O
+century	O
+,	O
+and	O
+a	O
+transformation	O
+is	O
+already	O
+in	O
+process	O
+.	O
+Under	O
+the	O
+framework	O
+of	O
+information	B-KEY
+fluency	I-KEY
+,	O
+efforts	O
+are	O
+being	O
+made	O
+at	O
+Rollins	O
+College	O
+to	O
+develop	O
+a	O
+Web-enhanced	O
+course	O
+that	O
+encompasses	O
+information	B-KEY
+literacy	I-KEY
+,	O
+basic	O
+computer	B-KEY
+literacy	I-KEY
+,	O
+and	O
+critical	B-KEY
+thinking	I-KEY
+skills	I-KEY
+.	O
+Computer-based	B-KEY
+education	I-KEY
+can	O
+be	O
+successful	O
+when	O
+librarians	B-KEY
+use	O
+technology	O
+effectively	O
+to	O
+enhance	O
+their	O
+integrated	B-KEY
+library	I-KEY
+teaching	I-KEY
+.	O
+In	O
+an	O
+online	B-KEY
+learning	I-KEY
+environment	O
+,	O
+students	O
+choose	O
+a	O
+time	O
+for	O
+learning	O
+that	O
+best	O
+suits	O
+their	O
+needs	O
+and	O
+motivational	O
+levels	O
+.	O
+They	O
+can	O
+learn	O
+at	O
+their	O
+own	O
+pace	O
+,	O
+take	O
+a	O
+nonlinear	O
+approach	O
+to	O
+the	O
+subject	O
+,	O
+and	O
+maintain	O
+constant	O
+communication	O
+with	O
+instructors	O
+and	O
+other	O
+students	O
+.	O
+The	O
+quality	O
+of	O
+a	O
+technology-facilitated	O
+course	O
+can	O
+be	O
+upheld	O
+if	O
+the	O
+educational	O
+objectives	O
+and	O
+methods	O
+for	O
+achieving	O
+those	O
+objectives	O
+are	O
+carefully	O
+planned	O
+and	O
+explored	O
+
+The	O
+top	B-KEY
+cycle	I-KEY
+and	O
+uncovered	B-KEY
+solutions	I-KEY
+for	O
+weak	B-KEY
+tournaments	I-KEY
+We	O
+study	O
+axiomatic	B-KEY
+properties	I-KEY
+of	O
+the	O
+top	B-KEY
+cycle	I-KEY
+and	O
+uncovered	B-KEY
+solutions	I-KEY
+for	O
+weak	B-KEY
+tournaments	I-KEY
+.	O
+Subsequently	O
+,	O
+we	O
+establish	O
+its	O
+connection	O
+with	O
+the	O
+rational	B-KEY
+choice	I-KEY
+theory	I-KEY
+
+Improving	O
+supply-chain	O
+performance	O
+by	O
+sharing	O
+advance	B-KEY
+demand	I-KEY
+information	I-KEY
+In	O
+this	O
+paper	O
+,	O
+we	O
+analyze	O
+how	O
+sharing	O
+advance	B-KEY
+demand	I-KEY
+information	I-KEY
+-LRB-	O
+ADI	O
+-RRB-	O
+can	O
+improve	O
+supply-chain	O
+performance	O
+.	O
+We	O
+consider	O
+two	O
+types	O
+of	O
+ADI	O
+,	O
+aggregated	B-KEY
+ADI	I-KEY
+-LRB-	O
+A-ADI	O
+-RRB-	O
+and	O
+detailed	B-KEY
+ADI	I-KEY
+-LRB-	O
+D-ADI	O
+-RRB-	O
+.	O
+With	O
+A-ADI	O
+,	O
+customers	O
+share	O
+with	O
+manufacturers	B-KEY
+information	O
+about	O
+whether	O
+they	O
+will	O
+place	O
+an	O
+order	O
+for	O
+some	O
+product	O
+in	O
+the	O
+next	O
+time	O
+period	O
+,	O
+but	O
+do	O
+not	O
+share	O
+information	O
+about	O
+which	O
+product	O
+they	O
+will	O
+order	O
+and	O
+which	O
+of	O
+several	O
+potential	O
+manufacturers	B-KEY
+will	O
+receive	O
+the	O
+order	O
+.	O
+With	O
+D-ADI	O
+,	O
+customers	O
+additionally	O
+share	O
+information	O
+about	O
+which	O
+product	O
+they	O
+will	O
+order	O
+,	O
+but	O
+which	O
+manufacturer	B-KEY
+will	O
+receive	O
+the	O
+order	O
+remains	O
+uncertain	O
+.	O
+We	O
+develop	O
+and	O
+solve	O
+mathematical	B-KEY
+models	I-KEY
+of	O
+supply	O
+chains	O
+where	O
+ADI	O
+is	O
+shared	O
+.	O
+We	O
+derive	O
+exact	O
+expressions	O
+and	O
+closed-form	B-KEY
+approximations	I-KEY
+for	O
+expected	B-KEY
+costs	I-KEY
+,	O
+expected	B-KEY
+base-stock	I-KEY
+levels	I-KEY
+,	O
+and	O
+variations	O
+of	O
+the	O
+production	O
+quantities	O
+.	O
+We	O
+show	O
+that	O
+both	O
+the	O
+manufacturer	B-KEY
+and	O
+the	O
+customers	O
+benefit	O
+from	O
+sharing	O
+ADI	O
+,	O
+but	O
+that	O
+sharing	O
+ADI	O
+increases	O
+the	O
+bullwhip	B-KEY
+effect	I-KEY
+.	O
+We	O
+also	O
+show	O
+that	O
+under	O
+certain	O
+conditions	O
+it	O
+is	O
+optimal	O
+to	O
+collect	O
+ADI	O
+from	O
+either	O
+none	O
+or	O
+all	O
+of	O
+the	O
+customers	O
+.	O
+We	O
+study	O
+two	O
+supply	O
+chains	O
+in	O
+detail	O
+:	O
+a	O
+supply	O
+chain	O
+with	O
+an	O
+arbitrary	O
+number	O
+of	O
+products	O
+that	O
+have	O
+identical	B-KEY
+demand	I-KEY
+rates	I-KEY
+,	O
+and	O
+a	O
+supply	O
+chain	O
+with	O
+two	O
+products	O
+that	O
+have	O
+arbitrary	B-KEY
+demand	I-KEY
+rates	I-KEY
+.	O
+For	O
+these	O
+two	O
+supply	O
+chains	O
+,	O
+we	O
+analyze	O
+how	O
+the	O
+values	O
+of	O
+A-ADI	O
+and	O
+D-ADI	O
+depend	O
+on	O
+the	O
+characteristics	O
+of	O
+the	O
+supply	O
+chain	O
+and	O
+on	O
+the	O
+quality	O
+of	O
+the	O
+shared	O
+information	O
+,	O
+and	O
+we	O
+identify	O
+conditions	O
+under	O
+which	O
+sharing	O
+A-ADI	O
+and	O
+D-ADI	O
+can	O
+significantly	O
+reduce	O
+cost	O
+.	O
+Our	O
+results	O
+can	O
+be	O
+used	O
+by	O
+decision	B-KEY
+makers	I-KEY
+to	O
+analyze	O
+the	O
+cost	B-KEY
+savings	I-KEY
+that	O
+can	O
+be	O
+achieved	O
+by	O
+sharing	O
+ADI	O
+and	O
+help	O
+them	O
+to	O
+determine	O
+if	O
+sharing	O
+ADI	O
+is	O
+beneficial	O
+for	O
+their	O
+supply	O
+chains	O
+
+Estimation	O
+of	O
+an	O
+N-L-N	B-KEY
+Hammerstein-Wiener	I-KEY
+model	I-KEY
+Estimation	O
+of	O
+a	O
+single-input	B-KEY
+single-output	I-KEY
+block-oriented	I-KEY
+model	I-KEY
+is	O
+studied	O
+.	O
+The	O
+model	O
+consists	B-KEY
+of	O
+a	O
+linear	B-KEY
+block	I-KEY
+embedded	O
+between	O
+two	O
+static	B-KEY
+nonlinear	I-KEY
+gains	I-KEY
+.	O
+Hence	O
+,	O
+it	O
+is	O
+called	O
+an	O
+N-L-N	B-KEY
+Hammerstein-Wiener	I-KEY
+model	I-KEY
+.	O
+First	O
+,	O
+the	O
+model	B-KEY
+structure	I-KEY
+is	O
+motivated	O
+and	O
+the	O
+disturbance	B-KEY
+model	I-KEY
+is	O
+discussed	O
+.	O
+The	O
+paper	O
+then	O
+concentrates	O
+on	O
+parameter	B-KEY
+estimation	I-KEY
+.	O
+A	O
+relaxation	B-KEY
+iteration	I-KEY
+scheme	I-KEY
+is	O
+proposed	O
+by	O
+making	O
+use	O
+of	O
+a	O
+model	B-KEY
+structure	I-KEY
+in	O
+which	O
+the	O
+error	O
+is	O
+bilinear-in-parameters	O
+.	O
+This	O
+leads	O
+to	O
+a	O
+simple	O
+algorithm	O
+which	O
+minimizes	O
+the	O
+original	O
+loss	O
+function	O
+.	O
+The	O
+convergence	B-KEY
+and	O
+consistency	B-KEY
+of	O
+the	O
+algorithm	O
+are	O
+studied	O
+.	O
+In	O
+order	O
+to	O
+reduce	O
+the	O
+variance	B-KEY
+error	I-KEY
+,	O
+the	O
+obtained	O
+linear	O
+model	O
+is	O
+further	O
+reduced	O
+using	O
+frequency	B-KEY
+weighted	I-KEY
+model	I-KEY
+reduction	I-KEY
+.	O
+A	O
+simulation	O
+study	O
+is	O
+used	O
+to	O
+illustrate	O
+the	O
+method	O
+
+Evaluation	O
+of	O
+videoconferenced	B-KEY
+grand	I-KEY
+rounds	I-KEY
+We	O
+evaluated	O
+various	O
+aspects	O
+of	O
+grand	O
+rounds	O
+videoconferenced	O
+from	O
+a	O
+tertiary	B-KEY
+care	I-KEY
+hospital	I-KEY
+to	O
+a	O
+regional	B-KEY
+hospital	I-KEY
+in	O
+Nova	O
+Scotia	O
+.	O
+During	O
+a	O
+five-month	O
+study	O
+period	O
+,	O
+29	O
+rounds	O
+were	O
+broadcast	O
+-LRB-	O
+19	O
+in	O
+medicine	O
+and	O
+10	O
+in	O
+cardiology	B-KEY
+-RRB-	O
+.	O
+The	O
+total	O
+recorded	O
+attendance	O
+at	O
+the	O
+remote	B-KEY
+site	I-KEY
+was	O
+103	O
+,	O
+comprising	O
+70	O
+specialists	O
+,	O
+nine	O
+family	O
+physicians	O
+and	O
+24	O
+other	O
+health-care	B-KEY
+professionals	I-KEY
+.	O
+We	O
+received	O
+55	O
+evaluations	O
+,	O
+a	O
+response	O
+rate	O
+of	O
+53	O
+%	O
+.	O
+On	O
+a	O
+five-point	B-KEY
+Likert	I-KEY
+scale	I-KEY
+-LRB-	O
+on	O
+which	O
+higher	O
+scores	O
+indicated	O
+better	O
+quality	O
+-RRB-	O
+,	O
+mean	O
+ratings	O
+by	O
+remote-site	O
+participants	O
+of	O
+the	O
+technical	O
+quality	O
+of	O
+the	O
+videoconference	O
+were	O
+3.0-3	O
+.5	O
+,	O
+with	O
+the	O
+lowest	O
+ratings	O
+being	O
+for	O
+ability	O
+to	O
+hear	O
+the	O
+discussion	O
+-LRB-	O
+3.0	O
+-RRB-	O
+and	O
+to	O
+see	O
+visual	O
+aids	O
+-LRB-	O
+3.1	O
+-RRB-	O
+.	O
+Mean	O
+ratings	O
+for	O
+content	O
+,	O
+presentation	O
+,	O
+discussion	O
+and	O
+educational	O
+value	O
+were	O
+3.8	O
+or	O
+higher	O
+.	O
+Of	O
+the	O
+49	O
+physicians	O
+who	O
+presented	O
+the	O
+rounds	O
+,	O
+we	O
+received	O
+evaluations	O
+from	O
+41	O
+,	O
+a	O
+response	O
+rate	O
+of	O
+84	O
+%	O
+.	O
+The	O
+presenters	O
+rated	O
+all	O
+aspects	O
+of	O
+the	O
+videoconference	O
+and	O
+interaction	O
+with	O
+remote	B-KEY
+sites	I-KEY
+at	O
+3.8	O
+or	O
+lower	O
+.	O
+The	O
+lowest	O
+ratings	O
+were	O
+for	O
+ability	O
+to	O
+see	O
+the	O
+remote	B-KEY
+sites	I-KEY
+-LRB-	O
+3.0	O
+-RRB-	O
+and	O
+the	O
+usefulness	O
+of	O
+the	O
+discussion	O
+-LRB-	O
+3.4	O
+-RRB-	O
+.	O
+We	O
+received	O
+278	O
+evaluations	O
+from	O
+participants	O
+at	O
+the	O
+presenting	O
+site	O
+,	O
+an	O
+estimated	O
+response	O
+rate	O
+of	O
+about	O
+55	O
+%	O
+.	O
+The	O
+results	O
+indicated	O
+no	O
+adverse	O
+opinions	O
+of	O
+the	O
+effect	O
+of	O
+videoconferencing	O
+-LRB-	O
+mean	O
+scores	O
+3.1-3	O
+.3	O
+-RRB-	O
+.	O
+The	O
+estimated	O
+costs	O
+of	O
+videoconferencing	O
+one	O
+grand	O
+round	O
+to	O
+one	O
+site	O
+and	O
+four	O
+sites	O
+were	O
+C$	O
+723	O
+and	O
+C$	O
+1515	O
+,	O
+respectively	O
+.	O
+The	O
+study	O
+confirmed	O
+that	O
+videoconferenced	O
+rounds	O
+can	O
+provide	O
+satisfactory	O
+continuing	B-KEY
+medical	I-KEY
+education	I-KEY
+to	O
+community	O
+specialists	O
+,	O
+which	O
+is	O
+an	O
+especially	O
+important	O
+consideration	O
+as	O
+maintenance	O
+of	O
+certification	B-KEY
+becomes	O
+mandatory	O
+
+Doubly	B-KEY
+invariant	I-KEY
+equilibria	I-KEY
+of	O
+linear	B-KEY
+discrete-time	I-KEY
+games	I-KEY
+The	O
+notion	O
+of	O
+doubly	O
+invariant	O
+-LRB-	O
+DI	O
+-RRB-	O
+equilibrium	O
+is	O
+introduced	O
+.	O
+The	O
+concept	O
+extends	O
+controlled	O
+and	O
+robustly	B-KEY
+controlled	I-KEY
+invariance	I-KEY
+notions	O
+to	O
+the	O
+context	O
+of	O
+two-person	B-KEY
+dynamic	I-KEY
+games	I-KEY
+.	O
+Each	O
+player	O
+tries	O
+to	O
+keep	O
+the	O
+state	O
+in	O
+a	O
+region	O
+of	O
+state	B-KEY
+space	I-KEY
+independently	O
+of	O
+the	O
+actions	O
+of	O
+the	O
+rival	O
+player	O
+.	O
+The	O
+paper	O
+gives	O
+existence	B-KEY
+conditions	I-KEY
+,	O
+criteria	O
+and	O
+algorithms	O
+for	O
+the	O
+determination	O
+of	O
+DI	O
+equilibria	O
+of	O
+linear	O
+dynamic	O
+games	O
+in	O
+discrete	O
+time	O
+.	O
+Two	O
+examples	O
+illustrate	O
+the	O
+results	O
+.	O
+The	O
+first	O
+one	O
+is	O
+in	O
+the	O
+area	O
+of	O
+fault-tolerant	B-KEY
+controller	I-KEY
+synthesis	I-KEY
+.	O
+The	O
+second	O
+is	O
+an	O
+application	O
+to	O
+macroeconomics	B-KEY
+
+Even	B-KEY
+unimodular	I-KEY
+Gaussian	I-KEY
+lattices	I-KEY
+of	O
+rank	O
+12	O
+We	O
+classify	O
+even	B-KEY
+unimodular	I-KEY
+Gaussian	I-KEY
+lattices	I-KEY
+of	O
+rank	O
+12	O
+,	O
+that	O
+is	O
+,	O
+even	B-KEY
+unimodular	I-KEY
+integral	I-KEY
+lattices	I-KEY
+of	O
+rank	O
+12	O
+over	O
+the	O
+ring	O
+of	O
+Gaussian	B-KEY
+integers	I-KEY
+.	O
+This	O
+is	O
+equivalent	O
+to	O
+the	O
+classification	O
+of	O
+the	O
+automorphisms	B-KEY
+tau	O
+with	O
+tau	O
+/	O
+sup	O
+2	O
+/	O
+=	O
+-1	O
+in	O
+the	O
+automorphism	B-KEY
+groups	O
+of	O
+all	O
+the	O
+Niemeier	B-KEY
+lattices	I-KEY
+,	O
+which	O
+are	O
+even	O
+unimodular	O
+-LRB-	O
+real	O
+-RRB-	O
+integral	O
+lattices	O
+of	O
+rank	O
+24	O
+.	O
+There	O
+are	O
+28	O
+even	B-KEY
+unimodular	I-KEY
+Gaussian	I-KEY
+lattices	I-KEY
+of	O
+rank	O
+12	O
+up	O
+to	O
+equivalence	O
+
+Cutting	O
+through	O
+the	O
+confusion	O
+-LSB-	O
+workflow	B-KEY
+&	O
+content	O
+management	O
+-RSB-	O
+Information	O
+management	O
+vendors	O
+are	O
+rushing	O
+to	O
+re-position	O
+themselves	O
+and	O
+put	O
+a	O
+portal	B-KEY
+spin	O
+on	O
+their	O
+products	O
+,	O
+says	O
+ITNET	B-KEY
+'s	O
+Graham	O
+Urquhart	O
+.	O
+The	O
+result	O
+is	O
+confusion	O
+,	O
+with	O
+a	O
+range	O
+of	O
+different	O
+definitions	O
+and	O
+claims	O
+clouding	O
+the	O
+true	O
+picture	O
+
+Computation	O
+of	O
+unmeasured	O
+third-generation	O
+VCT	O
+views	O
+from	O
+measured	B-KEY
+views	I-KEY
+We	O
+compute	O
+unmeasured	O
+cone-beam	B-KEY
+projections	I-KEY
+from	O
+projections	O
+measured	O
+by	O
+a	O
+third-generation	B-KEY
+helical	I-KEY
+volumetric	I-KEY
+computed	I-KEY
+tomography	I-KEY
+system	I-KEY
+by	O
+solving	O
+a	O
+characteristic	O
+problem	O
+for	O
+an	O
+ultrahyperbolic	B-KEY
+differential	I-KEY
+equation	I-KEY
+-LSB-	O
+John	O
+-LRB-	O
+1938	O
+-RRB-	O
+-RSB-	O
+.	O
+By	O
+working	O
+in	O
+the	O
+Fourier	B-KEY
+domain	I-KEY
+,	O
+we	O
+convert	O
+the	O
+second-order	O
+PDE	O
+into	O
+a	O
+family	O
+of	O
+first-order	B-KEY
+ordinary	I-KEY
+differential	I-KEY
+equations	I-KEY
+.	O
+A	O
+simple	B-KEY
+first-order	I-KEY
+integration	I-KEY
+is	O
+used	O
+to	O
+solve	O
+the	O
+ODES	O
+
+Effects	O
+of	O
+the	O
+transition	O
+to	O
+a	O
+client-centred	B-KEY
+team	I-KEY
+organization	I-KEY
+in	O
+administrative	B-KEY
+surveying	I-KEY
+work	I-KEY
+A	O
+new	O
+work	O
+organization	O
+was	O
+introduced	O
+in	O
+administrative	B-KEY
+surveying	I-KEY
+work	I-KEY
+in	O
+Sweden	O
+during	O
+1998	O
+.	O
+The	O
+new	O
+work	O
+organization	O
+implied	O
+a	O
+transition	O
+to	O
+a	O
+client-centred	O
+team-based	O
+organization	O
+and	O
+required	O
+a	O
+change	O
+in	O
+competence	O
+from	O
+specialist	O
+to	O
+generalist	O
+knowledge	O
+as	O
+well	O
+as	O
+a	O
+transition	O
+to	O
+a	O
+new	O
+information	B-KEY
+technology	I-KEY
+,	O
+implying	O
+a	O
+greater	O
+integration	O
+within	O
+the	O
+company	B-KEY
+.	O
+The	O
+aim	O
+of	O
+this	O
+study	O
+was	O
+to	O
+follow	O
+the	O
+surveyors	O
+for	O
+two	O
+years	O
+from	O
+the	O
+start	O
+of	O
+the	O
+transition	O
+and	O
+investigate	O
+how	O
+perceived	O
+consequences	O
+of	O
+the	O
+transition	O
+,	O
+job	B-KEY
+,	O
+organizational	B-KEY
+factors	I-KEY
+,	O
+well-being	O
+and	O
+effectiveness	B-KEY
+measures	I-KEY
+changed	O
+between	O
+1998	O
+and	O
+2000	O
+.	O
+The	O
+Teamwork	B-KEY
+Profile	I-KEY
+and	O
+QPS	B-KEY
+Nordic	I-KEY
+questionnaire	I-KEY
+were	O
+used	O
+.	O
+The	O
+205	O
+surveyors	O
+who	O
+participated	O
+in	O
+all	O
+three	O
+study	O
+phases	O
+constituted	O
+the	O
+study	O
+group	O
+.	O
+The	O
+result	O
+showed	O
+that	O
+surveyors	O
+who	O
+perceived	O
+that	O
+they	O
+were	O
+working	O
+as	O
+generalists	O
+rated	O
+the	O
+improvements	O
+in	O
+job	B-KEY
+and	O
+organizational	B-KEY
+factors	I-KEY
+significantly	O
+higher	O
+than	O
+those	O
+who	O
+perceived	O
+that	O
+they	O
+were	O
+not	O
+yet	O
+generalists	O
+.	O
+Improvements	O
+were	O
+noted	O
+in	O
+2000	O
+in	O
+quality	O
+of	O
+service	O
+to	O
+clients	O
+,	O
+time	O
+available	O
+to	O
+handle	O
+a	O
+case	O
+and	O
+effectiveness	O
+of	O
+teamwork	O
+in	O
+a	O
+transfer	O
+to	O
+a	O
+team-based	O
+work	O
+organization	O
+group	O
+,	O
+cohesion	O
+and	O
+continuous	O
+improvement	O
+practices-for	O
+example	O
+,	O
+learning	O
+by	O
+doing	O
+,	O
+mentoring	O
+and	O
+guided	O
+delegation-were	O
+important	O
+to	O
+improve	O
+the	O
+social	B-KEY
+effectiveness	I-KEY
+of	O
+group	O
+work	O
+
+FC	O
++	O
++	O
+:	O
+Functional	O
+tools	O
+for	O
+object-oriented	O
+tasks	O
+FC	O
++	O
++	O
+is	O
+a	O
+library	B-KEY
+for	O
+programming	O
+functionally	O
+in	O
+C++	B-KEY
+.	O
+Compared	O
+to	O
+other	O
+C++	B-KEY
+functional	B-KEY
+programming	I-KEY
+libraries	B-KEY
+,	O
+FC	O
++	O
++	O
+is	O
+distinguished	O
+by	O
+its	O
+powerful	O
+type	O
+system	O
+which	O
+allows	O
+the	O
+manipulation	O
+of	O
+parametrically	B-KEY
+polymorphic	I-KEY
+functions	O
+-LRB-	O
+e.g.	O
+,	O
+passing	O
+them	O
+as	O
+arguments	O
+to	O
+other	O
+functions	O
+and	O
+returning	O
+them	O
+as	O
+results	O
+-RRB-	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+show	O
+how	O
+FC	O
++	O
++	O
+can	O
+be	O
+used	O
+in	O
+common	O
+object-oriented	B-KEY
+programming	I-KEY
+tasks	O
+.	O
+We	O
+demonstrate	O
+FC	O
++	O
++	O
+implementations	O
+of	O
+several	O
+common	O
+design	O
+patterns	O
+-LRB-	O
+Adapter	O
+,	O
+Builder	O
+,	O
+Command	O
+,	O
+and	O
+more	O
+-RRB-	O
+.	O
+Compared	O
+to	O
+conventional	O
+C++	B-KEY
+implementations	O
+of	O
+these	O
+patterns	O
+,	O
+our	O
+implementations	O
+are	O
+either	O
+simpler	O
+-LRB-	O
+in	O
+that	O
+fewer	O
+classes/dependencies	O
+are	O
+needed	O
+-RRB-	O
+,	O
+more	O
+efficient	O
+,	O
+or	O
+more	O
+type-safe	O
+-LRB-	O
+thanks	O
+to	O
+parametric	B-KEY
+polymorphism	I-KEY
+and	O
+type	O
+inference	O
+-RRB-	O
+
+A	O
+VMEbus	B-KEY
+interface	I-KEY
+for	O
+multi-detector	O
+trigger	O
+and	O
+control	B-KEY
+system	I-KEY
+MUSE	B-KEY
+-LRB-	O
+MUltiplicity	O
+SElector	O
+-RRB-	O
+is	O
+the	O
+trigger	O
+and	O
+control	B-KEY
+system	I-KEY
+of	O
+CHIMERA	B-KEY
+,	O
+a	O
+4	O
+pi	O
+charged	O
+particle	O
+detector	O
+.	O
+Initialization	O
+of	O
+MUSE	B-KEY
+can	O
+be	O
+performed	O
+via	O
+VMEbus	O
+.	O
+This	O
+paper	O
+describes	O
+the	O
+design	O
+of	O
+VMEbus	B-KEY
+interface	I-KEY
+and	O
+functional	O
+module	O
+in	O
+MUSE	B-KEY
+,	O
+and	O
+briefly	O
+discusses	O
+an	O
+application	O
+of	O
+MUSE	B-KEY
+
+Minimizing	O
+blossoms	O
+under	O
+symmetric	B-KEY
+linear	I-KEY
+constraints	I-KEY
+In	O
+this	O
+paper	O
+,	O
+we	O
+show	O
+that	O
+there	O
+exists	O
+a	O
+close	O
+dependence	O
+between	O
+the	O
+control	B-KEY
+polygon	I-KEY
+of	O
+a	O
+polynomial	B-KEY
+and	O
+the	O
+minimum	O
+of	O
+its	O
+blossom	O
+under	O
+symmetric	B-KEY
+linear	I-KEY
+constraints	I-KEY
+.	O
+We	O
+consider	O
+a	O
+given	O
+minimization	O
+problem	O
+P	O
+,	O
+for	O
+which	O
+a	O
+unique	O
+solution	O
+will	O
+be	O
+a	O
+point	O
+delta	O
+on	O
+the	O
+Bezier	B-KEY
+curve	I-KEY
+.	O
+For	O
+the	O
+minimization	O
+function	O
+f	O
+,	O
+two	O
+sufficient	O
+conditions	O
+exist	O
+that	O
+ensure	O
+the	O
+uniqueness	O
+of	O
+the	O
+solution	O
+,	O
+namely	O
+,	O
+the	O
+concavity	B-KEY
+of	O
+the	O
+control	B-KEY
+polygon	I-KEY
+of	O
+the	O
+polynomial	B-KEY
+and	O
+the	O
+characteristics	O
+of	O
+the	O
+Polya	O
+frequency-control	O
+polygon	O
+where	O
+the	O
+minimum	O
+coincides	O
+with	O
+a	O
+critical	O
+point	O
+of	O
+the	O
+polynomial	O
+.	O
+The	O
+use	O
+of	O
+the	O
+blossoming	O
+theory	O
+provides	O
+us	O
+with	O
+a	O
+useful	O
+geometrical	B-KEY
+interpretation	I-KEY
+of	O
+the	O
+minimization	O
+problem	O
+.	O
+In	O
+addition	O
+,	O
+this	O
+minimization	O
+approach	O
+leads	O
+us	O
+to	O
+a	O
+new	O
+method	O
+of	O
+discovering	O
+inequalities	B-KEY
+about	O
+the	O
+elementary	B-KEY
+symmetric	I-KEY
+polynomials	I-KEY
+
+A	O
+multi-agent	O
+system	O
+infrastructure	O
+for	O
+software	B-KEY
+component	I-KEY
+marketplace	I-KEY
+:	O
+an	O
+ontological	O
+perspective	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+introduce	O
+a	O
+multi-agent	B-KEY
+system	I-KEY
+architecture	I-KEY
+and	O
+an	O
+implemented	O
+prototype	O
+for	O
+a	O
+software	B-KEY
+component	I-KEY
+marketplace	I-KEY
+.	O
+We	O
+emphasize	O
+the	O
+ontological	O
+perspective	O
+by	O
+discussing	O
+ontology	B-KEY
+modeling	I-KEY
+for	O
+the	O
+component	O
+marketplace	O
+,	O
+UML	B-KEY
+extensions	I-KEY
+for	O
+ontology	B-KEY
+modeling	I-KEY
+,	O
+and	O
+the	O
+idea	O
+of	O
+ontology	B-KEY
+transfer	I-KEY
+which	O
+makes	O
+the	O
+multi-agent	O
+system	O
+adapt	B-KEY
+itself	O
+to	O
+dynamically	B-KEY
+changing	I-KEY
+ontologies	I-KEY
+
+Well-posed	B-KEY
+anisotropic	I-KEY
+diffusion	I-KEY
+for	O
+image	B-KEY
+denoising	I-KEY
+A	O
+nonlinear	B-KEY
+iterative	I-KEY
+smoothing	I-KEY
+filter	I-KEY
+based	O
+on	O
+a	O
+second-order	B-KEY
+partial	I-KEY
+differential	I-KEY
+equation	I-KEY
+is	O
+introduced	O
+.	O
+It	O
+smooths	O
+out	O
+the	O
+image	O
+according	O
+to	O
+an	O
+anisotropic	O
+diffusion	O
+process	O
+.	O
+The	O
+approach	O
+is	O
+based	O
+on	O
+a	O
+smooth	O
+approximation	O
+of	O
+the	O
+total	O
+variation	O
+-LRB-	O
+TV	O
+-RRB-	O
+functional	O
+which	O
+overcomes	O
+the	O
+non-differentiability	O
+of	O
+the	O
+TV	O
+functional	O
+at	O
+the	O
+origin	O
+.	O
+In	O
+particular	O
+,	O
+the	O
+authors	O
+perform	O
+linear	B-KEY
+smoothing	I-KEY
+over	O
+smooth	O
+areas	O
+but	O
+selective	B-KEY
+smoothing	I-KEY
+over	O
+candidate	O
+edges	O
+.	O
+By	O
+relating	O
+the	O
+smoothing	O
+parameter	O
+to	O
+the	O
+time	O
+step	O
+,	O
+they	O
+arrive	O
+at	O
+a	O
+CFL	B-KEY
+condition	I-KEY
+which	O
+guarantees	O
+the	O
+causality	B-KEY
+of	O
+the	O
+discrete	B-KEY
+scheme	I-KEY
+.	O
+This	O
+allows	O
+the	O
+adoption	O
+of	O
+higher	B-KEY
+time	I-KEY
+discretisation	I-KEY
+steps	I-KEY
+,	O
+while	O
+ensuring	O
+the	O
+absence	O
+of	O
+artefacts	O
+deriving	O
+from	O
+the	O
+non-smooth	O
+behaviour	O
+of	O
+the	O
+TV	O
+functional	O
+at	O
+the	O
+origin	O
+.	O
+In	O
+particular	O
+,	O
+it	O
+is	O
+shown	O
+that	O
+the	O
+proposed	O
+approach	O
+avoids	O
+the	O
+typical	O
+staircase	O
+effects	O
+in	O
+smooth	O
+areas	O
+which	O
+occur	O
+in	O
+the	O
+standard	O
+time-marching	O
+TV	O
+scheme	O
+
+LMI	B-KEY
+approach	I-KEY
+to	O
+digital	B-KEY
+redesign	I-KEY
+of	O
+linear	B-KEY
+time-invariant	I-KEY
+systems	I-KEY
+A	O
+simple	O
+design	B-KEY
+methodology	I-KEY
+for	O
+the	O
+digital	B-KEY
+redesign	I-KEY
+of	O
+static	O
+state	O
+feedback	O
+controllers	O
+by	O
+using	O
+linear	B-KEY
+matrix	I-KEY
+inequalities	I-KEY
+is	O
+presented	O
+.	O
+The	O
+proposed	O
+method	O
+provides	O
+close	O
+matching	O
+of	O
+the	O
+states	O
+between	O
+the	O
+original	O
+continuous-time	B-KEY
+system	I-KEY
+and	O
+those	O
+of	O
+the	O
+digitally	B-KEY
+redesigned	I-KEY
+system	O
+with	O
+a	O
+guaranteed	B-KEY
+stability	I-KEY
+.	O
+Specifically	O
+,	O
+the	O
+digital	B-KEY
+redesign	I-KEY
+problem	O
+is	O
+reformulated	O
+as	O
+linear	B-KEY
+matrix	I-KEY
+inequalities	I-KEY
+-LRB-	O
+LMIs	O
+-RRB-	O
+and	O
+solved	O
+by	O
+a	O
+numerical	B-KEY
+optimisation	I-KEY
+technique	I-KEY
+.	O
+The	O
+main	O
+feature	O
+of	O
+the	O
+proposed	O
+method	O
+is	O
+that	O
+the	O
+closed-loop	B-KEY
+stability	I-KEY
+of	O
+the	O
+digitally	B-KEY
+redesigned	I-KEY
+system	O
+is	O
+explicitly	O
+guaranteed	O
+within	O
+the	O
+design	O
+procedure	O
+using	O
+the	O
+LMI-based	O
+approach	O
+.	O
+A	O
+numerical	O
+example	O
+of	O
+the	O
+position	B-KEY
+control	I-KEY
+of	O
+a	O
+simple	O
+crane	B-KEY
+system	I-KEY
+is	O
+presented	O
+
+Adaptive	B-KEY
+thinning	I-KEY
+for	O
+bivariate	O
+scattered	B-KEY
+data	I-KEY
+This	O
+paper	O
+studies	O
+adaptive	B-KEY
+thinning	I-KEY
+strategies	O
+for	O
+approximating	O
+a	O
+large	O
+set	O
+of	O
+scattered	B-KEY
+data	I-KEY
+by	O
+piecewise	B-KEY
+linear	I-KEY
+functions	I-KEY
+over	O
+triangulated	B-KEY
+subsets	I-KEY
+.	O
+Our	O
+strategies	O
+depend	O
+on	O
+both	O
+the	O
+locations	O
+of	O
+the	O
+data	O
+points	O
+in	O
+the	O
+plane	O
+,	O
+and	O
+the	O
+values	O
+of	O
+the	O
+sampled	O
+function	O
+at	O
+these	O
+points	O
+-	O
+adaptive	B-KEY
+thinning	I-KEY
+.	O
+All	O
+our	O
+thinning	O
+strategies	O
+remove	O
+data	O
+points	O
+one	O
+by	O
+one	O
+,	O
+so	O
+as	O
+to	O
+minimize	O
+an	O
+estimate	O
+of	O
+the	O
+error	B-KEY
+that	O
+results	O
+by	O
+the	O
+removal	O
+of	O
+a	O
+point	O
+from	O
+the	O
+current	O
+set	O
+of	O
+points	O
+-LRB-	O
+this	O
+estimate	O
+is	O
+termed	O
+``	O
+anticipated	O
+error	B-KEY
+''	O
+-RRB-	O
+.	O
+The	O
+thinning	O
+process	O
+generates	O
+subsets	O
+of	O
+``	O
+most	O
+significant	O
+''	O
+points	O
+,	O
+such	O
+that	O
+the	O
+piecewise	O
+linear	O
+interpolants	O
+over	O
+the	O
+Delaunay	B-KEY
+triangulations	I-KEY
+of	O
+these	O
+subsets	O
+approximate	O
+progressively	O
+the	O
+function	O
+values	O
+sampled	O
+at	O
+the	O
+original	O
+scattered	O
+points	O
+,	O
+and	O
+such	O
+that	O
+the	O
+approximation	O
+errors	B-KEY
+are	O
+small	O
+relative	O
+to	O
+the	O
+number	O
+of	O
+points	O
+in	O
+the	O
+subsets	O
+.	O
+We	O
+design	O
+various	O
+methods	O
+for	O
+computing	O
+the	O
+anticipated	O
+error	B-KEY
+at	O
+reasonable	O
+cost	O
+,	O
+and	O
+compare	O
+and	O
+test	O
+the	O
+performance	O
+of	O
+the	O
+methods	O
+.	O
+It	O
+is	O
+proved	O
+that	O
+for	O
+data	O
+sampled	O
+from	O
+a	O
+convex	B-KEY
+function	I-KEY
+,	O
+with	O
+the	O
+strategy	O
+of	O
+convex	O
+triangulation	O
+,	O
+the	O
+actual	O
+error	B-KEY
+is	O
+minimized	O
+by	O
+minimizing	O
+the	O
+best	O
+performing	O
+measure	O
+of	O
+anticipated	O
+error	B-KEY
+.	O
+It	O
+is	O
+also	O
+shown	O
+that	O
+for	O
+data	O
+sampled	O
+from	O
+certain	O
+quadratic	O
+polynomials	O
+,	O
+adaptive	B-KEY
+thinning	I-KEY
+is	O
+equivalent	O
+to	O
+thinning	O
+which	O
+depends	O
+only	O
+on	O
+the	O
+locations	O
+of	O
+the	O
+data	O
+points	O
+-	O
+nonadaptive	O
+thinning	O
+.	O
+Based	O
+on	O
+our	O
+numerical	O
+tests	O
+and	O
+comparisons	O
+,	O
+two	O
+practical	O
+adaptive	B-KEY
+thinning	I-KEY
+algorithms	O
+are	O
+proposed	O
+for	O
+thinning	O
+large	O
+data	O
+sets	O
+,	O
+one	O
+which	O
+is	O
+more	O
+accurate	O
+and	O
+another	O
+which	O
+is	O
+faster	O
+
+Supply	B-KEY
+chain	I-KEY
+optimisation	I-KEY
+in	O
+the	O
+paper	O
+industry	O
+We	O
+describe	O
+the	O
+formulation	O
+and	O
+development	O
+of	O
+a	O
+supply-chain	O
+optimisation	O
+model	O
+for	O
+Fletcher	B-KEY
+Challenge	I-KEY
+Paper	I-KEY
+Australasia	I-KEY
+-LRB-	O
+FCPA	O
+-RRB-	O
+.	O
+This	O
+model	O
+,	O
+known	O
+as	O
+the	O
+paper	B-KEY
+industry	I-KEY
+value	I-KEY
+optimisation	I-KEY
+tool	I-KEY
+-LRB-	O
+PIVOT	B-KEY
+-RRB-	O
+,	O
+is	O
+a	O
+large	B-KEY
+mixed	I-KEY
+integer	I-KEY
+program	I-KEY
+that	O
+finds	O
+an	O
+optimal	B-KEY
+allocation	I-KEY
+of	O
+supplier	O
+to	O
+mill	O
+,	O
+product	O
+to	O
+paper	O
+machine	O
+,	O
+and	O
+paper	O
+machine	O
+to	O
+customer	O
+,	O
+while	O
+at	O
+the	O
+same	O
+time	O
+modelling	O
+many	O
+of	O
+the	O
+supply	O
+chain	O
+details	O
+and	O
+nuances	O
+which	O
+are	O
+peculiar	O
+to	O
+FCPA	O
+.	O
+PIVOT	B-KEY
+has	O
+assisted	O
+FCPA	O
+in	O
+solving	O
+a	O
+number	O
+of	O
+strategic	O
+and	O
+tactical	B-KEY
+decision	I-KEY
+problems	I-KEY
+,	O
+and	O
+provided	O
+significant	O
+economic	B-KEY
+benefits	I-KEY
+for	O
+the	O
+company	O
+
+Internet	B-KEY
+infrastructure	I-KEY
+and	O
+the	O
+emerging	O
+information	O
+society	O
+:	O
+an	O
+appraisal	O
+of	O
+the	O
+Internet	O
+backbone	O
+industry	O
+This	O
+paper	O
+examines	O
+the	O
+real	O
+constraints	O
+to	O
+the	O
+expansion	O
+of	O
+all	O
+encumbering	O
+and	O
+all	O
+pervasive	O
+information	O
+technology	O
+in	O
+our	O
+contemporary	O
+society	O
+.	O
+Perhaps	O
+the	O
+U.S.	O
+Internet	O
+infrastructure	B-KEY
+is	I-KEY
+the	O
+most	O
+appropriate	O
+to	O
+examine	O
+since	O
+it	O
+is	O
+U.S.	O
+technology	O
+that	O
+has	O
+led	O
+the	O
+world	O
+into	O
+the	O
+Internet	O
+age	O
+.	O
+In	O
+this	O
+context	O
+,	O
+this	O
+paper	O
+reviews	O
+the	O
+state	O
+of	O
+the	O
+U.S.	O
+Internet	O
+backbone	O
+that	O
+will	O
+lead	O
+us	O
+into	O
+information	O
+society	O
+of	O
+the	O
+future	O
+by	O
+facilitating	O
+massive	O
+data	O
+transmission	O
+
+Regularity	O
+of	O
+some	O
+`	O
+incomplete	O
+'	O
+Pal-type	B-KEY
+interpolation	I-KEY
+problems	I-KEY
+In	O
+this	O
+paper	O
+the	O
+regularity	O
+of	O
+nine	O
+Pal-type	B-KEY
+interpolation	I-KEY
+problems	I-KEY
+is	O
+proved	O
+.	O
+In	O
+the	O
+literature	O
+interpolation	O
+on	O
+the	O
+zeros	B-KEY
+of	O
+the	O
+pair	O
+W/sub	O
+n	O
+/	O
+/	O
+sup	O
+-LRB-	O
+alpha	O
+-RRB-	O
+/	O
+-LRB-	O
+z	O
+-RRB-	O
+=	O
+-LRB-	O
+z	O
++	O
+alpha	O
+-RRB-	O
+/	O
+sup	O
+n	O
+/	O
++	O
+-LRB-	O
+1	O
++	O
+alpha	O
+z	O
+-RRB-	O
+/	O
+sup	O
+n	O
+/	O
+,	O
+v/sub	O
+n	O
+/	O
+/	O
+sup	O
+-LRB-	O
+alpha	O
+-RRB-	O
+/	O
+-LRB-	O
+z	O
+-RRB-	O
+=	O
+-LRB-	O
+z	O
++	O
+alpha	O
+-RRB-	O
+/	O
+sup	O
+n	O
+/	O
+-	O
+-LRB-	O
+1	O
++	O
+alpha	O
+z	O
+-RRB-	O
+/	O
+sup	O
+n	O
+/	O
+with	O
+0	O
+<	O
+alpha	O
+<	O
+1	O
+has	O
+been	O
+studied	O
+.	O
+Here	O
+the	O
+nodes	O
+form	O
+a	O
+subset	O
+of	O
+these	O
+sets	O
+of	O
+zeros	B-KEY
+
+Exact	O
+analytical	B-KEY
+model	I-KEY
+for	O
+the	O
+AEP	B-KEY
+of	O
+control	B-KEY
+signals	I-KEY
+An	O
+exact	O
+analytical	B-KEY
+model	I-KEY
+for	O
+the	O
+aliasing	B-KEY
+error	I-KEY
+probability	I-KEY
+-LRB-	O
+AEP	B-KEY
+-RRB-	O
+in	O
+the	O
+signature	B-KEY
+analysis	I-KEY
+of	O
+control	B-KEY
+signals	I-KEY
+using	O
+a	O
+modified	O
+signature	B-KEY
+analyser	I-KEY
+is	O
+presented	O
+.	O
+The	O
+signature	B-KEY
+analyser	I-KEY
+used	O
+comprises	O
+a	O
+general-structure	O
+two-input	B-KEY
+compacting	I-KEY
+module	I-KEY
+-LRB-	O
+TICM	O
+-RRB-	O
+,	O
+which	O
+simplifies	O
+the	O
+motherboard	B-KEY
+VLSI	I-KEY
+design	I-KEY
+by	O
+providing	O
+a	O
+flexible	B-KEY
+geometry	I-KEY
+,	O
+which	O
+could	O
+be	O
+easily	O
+integrated	O
+with	O
+neighbouring	O
+structures	O
+.	O
+The	O
+use	O
+of	O
+the	O
+modified	O
+data	O
+probe	O
+eliminates	O
+the	O
+ambiguity	O
+introduced	O
+by	O
+the	O
+high-impedance	B-KEY
+state	I-KEY
+and	O
+at	O
+the	O
+same	O
+time	O
+retains	O
+the	O
+same	O
+signature	O
+of	O
+the	O
+binary	B-KEY
+stream	I-KEY
+.	O
+The	O
+model	O
+specifies	O
+algebraically	O
+the	O
+effects	O
+of	O
+the	O
+TICM	O
+architecture	O
+,	O
+the	O
+test	B-KEY
+pattern	I-KEY
+length	I-KEY
+,	O
+and	O
+the	O
+control	B-KEY
+stream	I-KEY
+error	I-KEY
+probabilities	I-KEY
+.	O
+It	O
+is	O
+proved	O
+that	O
+the	O
+-LRB-	O
+hardware	O
+-RRB-	O
+criterion	O
+used	O
+for	O
+calculating	O
+the	O
+AEP	B-KEY
+for	O
+the	O
+internal	O
+-	O
+and	O
+external	O
+exclusive-OR	O
+two-input	B-KEY
+shift	I-KEY
+registers	I-KEY
+is	O
+not	O
+valid	O
+for	O
+the	O
+general	O
+case	O
+and	O
+a	O
+new	O
+criterion	O
+is	O
+provided	O
+.	O
+The	O
+results	O
+obtained	O
+are	O
+augmented	O
+by	O
+two	O
+special	O
+cases	O
+,	O
+a	O
+case	O
+study	O
+,	O
+and	O
+associated	O
+simulation	O
+
+Design	B-KEY
+and	O
+modeling	B-KEY
+of	O
+an	O
+interval-based	B-KEY
+ABR	I-KEY
+flow	I-KEY
+control	I-KEY
+protocol	I-KEY
+A	O
+novel	O
+flow	O
+control	O
+protocol	O
+is	O
+presented	O
+for	O
+availability	O
+bit	O
+rate	O
+-LRB-	O
+ABR	O
+-RRB-	O
+service	O
+in	O
+asynchronous	O
+transfer	O
+mode	O
+-LRB-	O
+ATM	O
+-RRB-	O
+networks	O
+.	O
+This	O
+scheme	O
+features	O
+periodic	B-KEY
+explicit	I-KEY
+rate	I-KEY
+feedback	I-KEY
+that	O
+enables	O
+precise	O
+allocation	O
+of	O
+link	O
+bandwidth	O
+and	O
+buffer	O
+space	O
+on	O
+a	O
+hop-by-hop	O
+basis	O
+to	O
+guarantee	O
+maximum	B-KEY
+throughput	I-KEY
+,	O
+minimum	B-KEY
+cell	I-KEY
+loss	I-KEY
+,	O
+and	O
+high	B-KEY
+resource	I-KEY
+efficiency	I-KEY
+.	O
+With	O
+the	O
+inclusion	O
+of	O
+resource	O
+management	O
+cell	O
+synchronization	O
+and	O
+consolidation	O
+algorithms	O
+,	O
+this	O
+protocol	O
+is	O
+capable	O
+of	O
+controlling	O
+point-to-multipoint	O
+ABR	O
+services	O
+within	O
+a	O
+unified	O
+framework	O
+.	O
+The	O
+authors	O
+illustrate	O
+the	O
+modeling	B-KEY
+of	O
+single	O
+ABR	O
+connection	O
+,	O
+the	O
+interaction	O
+between	O
+multiple	O
+ABR	O
+connections	O
+,	O
+and	O
+the	O
+constraints	O
+applicable	O
+to	O
+flow	B-KEY
+control	I-KEY
+decisions	I-KEY
+.	O
+A	O
+loss-free	B-KEY
+flow	I-KEY
+control	I-KEY
+mechanism	I-KEY
+is	O
+presented	O
+for	O
+high-speed	B-KEY
+ABR	I-KEY
+connections	I-KEY
+using	O
+a	O
+fluid	B-KEY
+traffic	I-KEY
+model	I-KEY
+.	O
+Supporting	O
+algorithms	O
+and	O
+ATM	O
+signaling	B-KEY
+procedures	O
+are	O
+specified	O
+,	O
+in	O
+company	O
+with	O
+linear	B-KEY
+system	I-KEY
+modeling	I-KEY
+,	O
+numerical	O
+analysis	O
+,	O
+and	O
+simulation	O
+results	O
+,	O
+which	O
+demonstrate	O
+its	O
+performance	O
+and	O
+cost	O
+benefits	O
+in	O
+high-speed	O
+backbone	O
+networking	O
+scenarios	O
+
+The	O
+design	O
+and	O
+performance	B-KEY
+evaluation	I-KEY
+of	O
+alternative	O
+XML	O
+storage	O
+strategies	O
+This	O
+paper	O
+studies	O
+five	O
+strategies	O
+for	O
+storing	O
+XML	O
+documents	O
+including	O
+one	O
+that	O
+leaves	O
+documents	O
+in	O
+the	O
+file	B-KEY
+system	I-KEY
+,	O
+three	O
+that	O
+use	O
+a	O
+relational	B-KEY
+database	I-KEY
+system	I-KEY
+,	O
+and	O
+one	O
+that	O
+uses	O
+an	O
+object	B-KEY
+manager	I-KEY
+.	O
+We	O
+implement	O
+and	O
+evaluate	O
+each	O
+approach	O
+using	O
+a	O
+number	O
+of	O
+XQuery	B-KEY
+queries	I-KEY
+.	O
+A	O
+number	O
+of	O
+interesting	O
+insights	O
+are	O
+gained	O
+from	O
+these	O
+experiments	O
+and	O
+a	O
+summary	O
+of	O
+the	O
+advantages	O
+and	O
+disadvantages	O
+of	O
+the	O
+approaches	O
+is	O
+presented	O
+
+Computational	O
+challenges	O
+in	O
+cell	B-KEY
+simulation	I-KEY
+:	O
+a	O
+software	B-KEY
+engineering	I-KEY
+approach	O
+Molecular	B-KEY
+biology	I-KEY
+'s	O
+advent	O
+in	O
+the	O
+20th	O
+century	O
+has	O
+exponentially	O
+increased	O
+our	O
+knowledge	O
+about	O
+the	O
+inner	O
+workings	O
+of	O
+life	O
+.	O
+We	O
+have	O
+dozens	O
+of	O
+completed	O
+genomes	O
+and	O
+an	O
+array	O
+of	O
+high-throughput	O
+methods	O
+to	O
+characterize	O
+gene	O
+encodings	O
+and	O
+gene	O
+product	O
+operation	O
+.	O
+The	O
+question	O
+now	O
+is	O
+how	O
+we	O
+will	O
+assemble	O
+the	O
+various	O
+pieces	O
+.	O
+In	O
+other	O
+words	O
+,	O
+given	O
+sufficient	O
+information	O
+about	O
+a	O
+living	O
+cell	O
+'s	O
+molecular	O
+components	O
+,	O
+can	O
+we	O
+predict	O
+its	O
+behavior	O
+?	O
+We	O
+introduce	O
+the	O
+major	O
+classes	O
+of	O
+cellular	O
+processes	O
+relevant	O
+to	O
+modeling	O
+,	O
+discuss	O
+software	B-KEY
+engineering	I-KEY
+'s	O
+role	O
+in	O
+cell	B-KEY
+simulation	I-KEY
+,	O
+and	O
+identify	O
+cell	B-KEY
+simulation	I-KEY
+requirements	O
+.	O
+Our	O
+E-Cell	B-KEY
+project	I-KEY
+aims	O
+to	O
+develop	O
+the	O
+theories	O
+,	O
+techniques	O
+,	O
+and	O
+software	O
+platforms	O
+necessary	O
+for	O
+whole-cell-scale	B-KEY
+modeling	I-KEY
+,	O
+simulation	O
+,	O
+and	O
+analysis	O
+.	O
+Since	O
+the	O
+project	O
+'s	O
+launch	O
+in	O
+1996	O
+,	O
+we	O
+have	O
+built	O
+a	O
+variety	O
+of	O
+cell	O
+models	O
+,	O
+and	O
+we	O
+are	O
+currently	O
+developing	O
+new	O
+models	O
+that	O
+vary	O
+with	O
+respect	O
+to	O
+species	O
+,	O
+target	O
+subsystem	O
+,	O
+and	O
+overall	O
+scale	O
+
+Plug-ins	O
+for	O
+critical	B-KEY
+media	I-KEY
+literacy	I-KEY
+:	O
+a	O
+collaborative	B-KEY
+program	I-KEY
+Information	B-KEY
+literacy	I-KEY
+is	O
+important	O
+in	O
+academic	O
+and	O
+other	O
+libraries	O
+.	O
+The	O
+paper	O
+looks	O
+at	O
+whether	O
+it	O
+would	O
+be	O
+more	O
+useful	O
+to	O
+librarians	O
+and	O
+to	O
+instructors	B-KEY
+,	O
+as	O
+well	O
+as	O
+the	O
+students	O
+,	O
+to	O
+deal	O
+with	O
+information-literacy	O
+skill	O
+levels	O
+of	O
+students	O
+beginning	O
+their	O
+academic	O
+careers	O
+,	O
+rather	O
+than	O
+checking	O
+them	O
+at	O
+the	O
+end	O
+.	O
+Approaching	O
+the	O
+situation	O
+with	O
+an	O
+eye	O
+toward	O
+the	O
+broader	O
+scope	O
+of	O
+critical	B-KEY
+media	I-KEY
+literacy	I-KEY
+opens	O
+the	O
+discussion	O
+beyond	O
+a	O
+skills	O
+inventory	O
+to	O
+the	O
+broader	O
+range	O
+of	O
+intellectual	O
+activity	O
+
+Exploring	O
+the	O
+sabbatical	O
+or	O
+other	O
+leave	O
+as	O
+a	O
+means	O
+of	O
+energizing	O
+a	O
+career	B-KEY
+This	O
+article	O
+challenges	O
+librarians	B-KEY
+to	O
+create	O
+leaves	O
+that	O
+will	O
+not	O
+only	O
+inspire	O
+professional	B-KEY
+growth	I-KEY
+but	O
+also	O
+renewal	O
+.	O
+It	O
+presents	O
+a	O
+framework	O
+for	O
+developing	O
+a	O
+successful	O
+leave	O
+,	O
+incorporating	O
+useful	O
+advice	O
+from	O
+librarians	B-KEY
+at	O
+Concordia	O
+University	O
+-LRB-	O
+Montreal	O
+-RRB-	O
+.	O
+As	O
+food	O
+for	O
+thought	O
+,	O
+the	O
+article	O
+offers	O
+examples	O
+of	O
+specific	O
+options	O
+meant	O
+to	O
+encourage	O
+professionals	O
+to	O
+explore	O
+their	O
+own	O
+creative	O
+ideas	O
+.	O
+Finally	O
+,	O
+a	O
+central	O
+theme	O
+of	O
+this	O
+article	O
+is	O
+that	O
+a	O
+midlife	B-KEY
+leave	I-KEY
+provides	O
+one	O
+with	O
+the	O
+perfect	O
+opportunity	O
+to	O
+take	O
+stock	O
+of	O
+oneself	O
+in	O
+order	O
+to	O
+define	O
+future	O
+career	B-KEY
+directions	O
+.	O
+Midlife	O
+is	O
+a	O
+time	O
+when	O
+rebel	O
+forces	O
+,	O
+feisty	O
+protestors	O
+from	O
+within	O
+,	O
+often	O
+insist	O
+on	O
+being	O
+heard	O
+.	O
+It	O
+is	O
+a	O
+time	O
+,	O
+in	O
+other	O
+words	O
+,	O
+when	O
+professionals	O
+often	O
+long	O
+to	O
+break	O
+loose	O
+from	O
+the	O
+stress	O
+``	O
+to	O
+do	O
+far	O
+more	O
+,	O
+in	O
+less	O
+time	O
+''	O
+-LRB-	O
+Barner	O
+,	O
+1994	O
+-RRB-	O
+.	O
+Escaping	O
+from	O
+current	O
+job	O
+constraints	O
+into	O
+a	O
+world	O
+of	O
+creative	O
+endeavor	O
+,	O
+when	O
+well-executed	O
+,	O
+is	O
+a	O
+superb	O
+means	O
+of	O
+invigorating	O
+a	O
+career	B-KEY
+stuck	O
+in	O
+gear	O
+and	O
+discovering	O
+a	O
+fresh	O
+perspective	O
+from	O
+which	O
+to	O
+view	O
+one	O
+'s	O
+profession	O
+.	O
+To	O
+ignite	O
+renewal	O
+,	O
+midcareer	O
+is	O
+the	O
+perfect	O
+time	O
+to	O
+grant	O
+one	O
+'s	O
+imagination	O
+free	O
+reign	O
+
+Quasi-Newton	B-KEY
+algorithm	I-KEY
+for	O
+adaptive	B-KEY
+minor	I-KEY
+component	I-KEY
+extraction	I-KEY
+An	O
+adaptive	O
+quasi-Newton	B-KEY
+algorithm	I-KEY
+is	O
+first	O
+developed	O
+to	O
+extract	O
+a	O
+single	O
+minor	O
+component	O
+corresponding	O
+to	O
+the	O
+smallest	O
+eigenvalue	B-KEY
+of	O
+a	O
+stationary	B-KEY
+sample	I-KEY
+covariance	I-KEY
+matrix	I-KEY
+.	O
+A	O
+deflation	B-KEY
+technique	I-KEY
+instead	O
+of	O
+the	O
+commonly	O
+used	O
+inflation	O
+method	O
+is	O
+then	O
+applied	O
+to	O
+extract	O
+the	O
+higher-order	B-KEY
+minor	I-KEY
+components	I-KEY
+.	O
+The	O
+algorithm	O
+enjoys	O
+the	O
+advantage	O
+of	O
+having	O
+a	O
+simpler	O
+computational	B-KEY
+complexity	I-KEY
+and	O
+a	O
+highly	O
+modular	O
+and	O
+parallel	B-KEY
+structure	I-KEY
+for	O
+efficient	O
+implementation	O
+.	O
+Simulation	B-KEY
+results	I-KEY
+are	O
+given	O
+to	O
+demonstrate	O
+the	O
+effectiveness	O
+of	O
+the	O
+proposed	O
+algorithm	O
+for	O
+extracting	O
+multiple	O
+minor	O
+components	O
+adaptively	O
+
+Fuzzy	O
+logic	O
+controlled	O
+shunt	O
+active	O
+power	O
+filter	O
+for	O
+power	B-KEY
+quality	I-KEY
+improvement	I-KEY
+The	O
+simulation	O
+and	O
+experimental	O
+study	O
+of	O
+a	O
+fuzzy	O
+logic	O
+controlled	O
+,	O
+three-phase	B-KEY
+shunt	I-KEY
+active	I-KEY
+power	I-KEY
+filter	I-KEY
+to	O
+improve	O
+power	O
+quality	O
+by	O
+compensating	O
+harmonics	O
+and	O
+reactive	O
+power	O
+required	O
+by	O
+a	O
+nonlinear	B-KEY
+load	I-KEY
+is	O
+presented	O
+.	O
+The	O
+advantage	O
+of	O
+fuzzy	O
+control	O
+is	O
+that	O
+it	O
+is	O
+based	O
+on	O
+a	O
+linguistic	O
+description	O
+and	O
+does	O
+not	O
+require	O
+a	O
+mathematical	O
+model	O
+of	O
+the	O
+system	O
+.	O
+The	O
+fuzzy	O
+control	O
+scheme	O
+is	O
+realised	O
+on	O
+an	O
+inexpensive	O
+dedicated	O
+micro-controller	B-KEY
+-LRB-	O
+INTEL	O
+8031	O
+-RRB-	O
+based	O
+system	O
+.	O
+The	O
+compensation	O
+process	O
+is	O
+based	O
+on	O
+sensing	O
+line	O
+currents	O
+only	O
+,	O
+an	O
+approach	O
+different	O
+from	O
+conventional	O
+methods	O
+,	O
+which	O
+require	O
+harmonics	O
+or	O
+reactive	O
+volt-ampere	O
+requirement	O
+of	O
+the	O
+load	O
+.	O
+The	O
+performance	O
+of	O
+the	O
+fuzzy	O
+logic	O
+controller	O
+is	O
+compared	O
+with	O
+a	O
+conventional	O
+PI	O
+controller	O
+.	O
+The	O
+dynamic	O
+behavior	O
+of	O
+the	O
+fuzzy	O
+controller	O
+is	O
+found	O
+to	O
+be	O
+better	O
+than	O
+the	O
+conventional	O
+PI	O
+controller	O
+.	O
+PWM	B-KEY
+pattern	I-KEY
+generation	I-KEY
+is	O
+based	O
+on	O
+carrierless	B-KEY
+hysteresis	I-KEY
+based	I-KEY
+current	I-KEY
+control	I-KEY
+to	O
+obtain	O
+the	O
+switching	B-KEY
+signals	I-KEY
+.	O
+Various	O
+simulation	O
+and	O
+experimental	O
+results	O
+are	O
+presented	O
+under	O
+steady	O
+state	O
+and	O
+transient	O
+conditions	O
+
+Evaluating	O
+the	O
+best	O
+main	O
+battle	O
+tank	O
+using	O
+fuzzy	B-KEY
+decision	I-KEY
+theory	I-KEY
+with	O
+linguistic	B-KEY
+criteria	I-KEY
+evaluation	I-KEY
+In	O
+this	O
+paper	O
+,	O
+experts	O
+'	O
+opinions	O
+are	O
+described	O
+in	O
+linguistic	O
+terms	O
+which	O
+can	O
+be	O
+expressed	O
+in	O
+trapezoidal	O
+-LRB-	O
+or	O
+triangular	O
+-RRB-	O
+fuzzy	O
+numbers	O
+.	O
+To	O
+make	O
+the	O
+consensus	O
+of	O
+the	O
+experts	O
+consistent	O
+,	O
+we	O
+utilize	O
+the	O
+fuzzy	B-KEY
+Delphi	I-KEY
+method	I-KEY
+to	O
+adjust	O
+the	O
+fuzzy	B-KEY
+rating	I-KEY
+of	O
+every	O
+expert	O
+to	O
+achieve	O
+the	O
+consensus	B-KEY
+condition	I-KEY
+.	O
+For	O
+the	O
+aggregate	O
+of	O
+many	O
+experts	O
+'	O
+opinions	O
+,	O
+we	O
+take	O
+the	O
+operation	O
+of	O
+fuzzy	O
+numbers	O
+to	O
+get	O
+the	O
+mean	O
+of	O
+fuzzy	B-KEY
+rating	I-KEY
+,	O
+x/sub	O
+ij	O
+/	O
+and	O
+the	O
+mean	O
+of	O
+weight	O
+,	O
+w/sub	O
+.	O
+j	O
+/	O
+.	O
+In	O
+multi-alternatives	O
+and	O
+multi-attributes	O
+cases	O
+,	O
+the	O
+fuzzy	B-KEY
+decision	I-KEY
+matrix	I-KEY
+X	O
+=	O
+-LSB-	O
+x/sub	O
+ij	O
+/	O
+-RSB-	O
+/	O
+sub	O
+m	O
+*	O
+n	O
+/	O
+is	O
+constructed	O
+by	O
+means	O
+of	O
+the	O
+fuzzy	B-KEY
+rating	I-KEY
+,	O
+x/sub	O
+ij	O
+/	O
+.	O
+Then	O
+,	O
+we	O
+can	O
+derive	O
+the	O
+aggregate	B-KEY
+fuzzy	I-KEY
+numbers	I-KEY
+by	O
+multiplying	O
+the	O
+fuzzy	B-KEY
+decision	I-KEY
+matrix	I-KEY
+with	O
+the	O
+corresponding	O
+fuzzy	B-KEY
+attribute	I-KEY
+weights	I-KEY
+.	O
+The	O
+final	O
+results	O
+become	O
+a	O
+problem	O
+of	O
+ranking	O
+fuzzy	O
+numbers	O
+.	O
+We	O
+also	O
+propose	O
+an	O
+easy	O
+procedure	O
+of	O
+using	O
+fuzzy	O
+numbers	O
+to	O
+rank	O
+aggregate	B-KEY
+fuzzy	I-KEY
+numbers	I-KEY
+A/sub	O
+i	O
+/	O
+.	O
+In	O
+this	O
+way	O
+,	O
+we	O
+can	O
+obtain	O
+the	O
+best	O
+selection	O
+for	O
+evaluating	O
+the	O
+system	O
+.	O
+For	O
+practical	O
+application	O
+,	O
+we	O
+propose	O
+an	O
+algorithm	O
+for	O
+evaluating	O
+the	O
+best	O
+main	O
+battle	O
+tank	O
+by	O
+fuzzy	B-KEY
+decision	I-KEY
+theory	I-KEY
+and	O
+comparing	O
+it	O
+with	O
+other	O
+methods	O
+
+A	O
+geometric	B-KEY
+process	I-KEY
+equivalent	I-KEY
+model	I-KEY
+for	O
+a	O
+multistate	B-KEY
+degenerative	I-KEY
+system	I-KEY
+In	O
+this	O
+paper	O
+,	O
+a	O
+monotone	B-KEY
+process	I-KEY
+model	I-KEY
+for	O
+a	O
+one-component	B-KEY
+degenerative	I-KEY
+system	I-KEY
+with	O
+k	O
++1	O
+states	O
+-LRB-	O
+k	O
+failure	B-KEY
+states	I-KEY
+and	O
+one	O
+working	B-KEY
+state	I-KEY
+-RRB-	O
+is	O
+studied	O
+.	O
+We	O
+show	O
+that	O
+this	O
+model	O
+is	O
+equivalent	O
+to	O
+a	O
+geometric	O
+process	O
+-LRB-	O
+GP	O
+-RRB-	O
+model	O
+for	O
+a	O
+two-state	B-KEY
+one	I-KEY
+component	I-KEY
+system	I-KEY
+such	O
+that	O
+both	O
+systems	O
+have	O
+the	O
+same	O
+long-run	B-KEY
+average	I-KEY
+cost	I-KEY
+per	O
+unit	O
+time	O
+and	O
+the	O
+same	O
+optimal	B-KEY
+policy	I-KEY
+.	O
+Furthermore	O
+,	O
+an	O
+explicit	O
+expression	O
+for	O
+the	O
+determination	O
+of	O
+an	O
+optimal	B-KEY
+policy	I-KEY
+is	O
+derived	O
+
+TPTP	O
+,	O
+CASC	B-KEY
+and	O
+the	O
+development	O
+of	O
+a	O
+semantically	B-KEY
+guided	I-KEY
+theorem	I-KEY
+prover	I-KEY
+The	O
+first-order	B-KEY
+theorem	I-KEY
+prover	I-KEY
+SCOTT	B-KEY
+has	O
+been	O
+through	O
+a	O
+series	O
+of	O
+versions	O
+over	O
+some	O
+ten	O
+years	O
+.	O
+The	O
+successive	O
+provers	O
+,	O
+while	O
+retaining	O
+the	O
+same	O
+underlying	O
+technology	O
+,	O
+have	O
+used	O
+radically	O
+different	O
+algorithms	O
+and	O
+shown	O
+wide	O
+differences	O
+of	O
+behaviour	O
+.	O
+The	O
+development	O
+process	O
+has	O
+depended	O
+heavily	O
+on	O
+experiments	O
+with	O
+problems	O
+from	O
+the	O
+TPTP	B-KEY
+library	I-KEY
+and	O
+has	O
+been	O
+sharpened	O
+by	O
+participation	O
+in	O
+CASC	B-KEY
+each	O
+year	O
+since	O
+1997	O
+.	O
+We	O
+outline	O
+some	O
+of	O
+the	O
+difficulties	O
+inherent	O
+in	O
+designing	O
+and	O
+refining	O
+a	O
+theorem	O
+prover	O
+as	O
+complex	O
+as	O
+SCOTT	B-KEY
+,	O
+and	O
+explain	O
+our	O
+experimental	B-KEY
+methodology	I-KEY
+.	O
+While	O
+SCOTT	B-KEY
+is	O
+not	O
+one	O
+of	O
+the	O
+systems	O
+which	O
+have	O
+been	O
+highly	O
+optimised	O
+for	O
+CASC	B-KEY
+,	O
+it	O
+does	O
+help	O
+to	O
+illustrate	O
+the	O
+influence	O
+of	O
+both	O
+CASC	B-KEY
+and	O
+the	O
+TPTP	B-KEY
+library	I-KEY
+on	O
+contemporary	O
+theorem	O
+proving	O
+research	O
+
+Optimal	B-KEY
+multi-degree	I-KEY
+reduction	I-KEY
+of	O
+Bezier	B-KEY
+curves	I-KEY
+with	O
+constraints	O
+of	O
+endpoints	O
+continuity	O
+Given	O
+a	O
+Bezier	B-KEY
+curve	I-KEY
+of	O
+degree	O
+n	O
+,	O
+the	O
+problem	O
+of	O
+optimal	B-KEY
+multi-degree	I-KEY
+reduction	I-KEY
+-LRB-	O
+degree	O
+reduction	O
+of	O
+more	O
+than	O
+one	O
+degree	O
+-RRB-	O
+by	O
+a	O
+Bezier	B-KEY
+curve	I-KEY
+of	O
+degree	O
+m	O
+-LRB-	O
+m	O
+<	O
+n-1	O
+-RRB-	O
+with	O
+constraints	O
+of	O
+endpoint	O
+continuity	O
+is	O
+investigated	O
+.	O
+With	O
+respect	O
+to	O
+L/sub	O
+2	O
+/	O
+norm	O
+,	O
+this	O
+paper	O
+presents	O
+an	O
+approximate	B-KEY
+method	I-KEY
+-LRB-	O
+MDR	O
+by	O
+L/sub	O
+2	O
+/	O
+-RRB-	O
+that	O
+gives	O
+an	O
+explicit	B-KEY
+solution	I-KEY
+to	O
+deal	O
+with	O
+it	O
+.	O
+The	O
+method	O
+has	O
+good	O
+properties	O
+of	O
+endpoint	B-KEY
+interpolation	I-KEY
+:	O
+continuity	O
+of	O
+any	O
+r	O
+,	O
+s	O
+-LRB-	O
+r	O
+,	O
+s	O
+>	O
+or	O
+=	O
+0	O
+-RRB-	O
+orders	O
+can	O
+be	O
+preserved	O
+at	O
+two	O
+endpoints	O
+respectively	O
+.	O
+The	O
+method	O
+in	O
+the	O
+paper	O
+performs	O
+multi-degree	O
+reduction	O
+at	O
+one	O
+time	O
+and	O
+does	O
+not	O
+need	O
+stepwise	O
+computing	O
+.	O
+When	O
+applied	O
+to	O
+multi-degree	O
+reduction	O
+with	O
+endpoint	O
+continuity	O
+of	O
+any	O
+order	O
+,	O
+the	O
+MDR	O
+by	O
+L/sub	O
+2	O
+/	O
+obtains	O
+the	O
+best	O
+least	B-KEY
+squares	I-KEY
+approximation	I-KEY
+.	O
+Comparison	O
+with	O
+another	O
+method	O
+of	O
+multi-degree	O
+reduction	O
+-LRB-	O
+MDR	O
+by	O
+L/sub	O
+infinity	O
+/	O
+-RRB-	O
+,	O
+which	O
+achieves	O
+the	O
+nearly	O
+best	O
+uniform	B-KEY
+approximation	I-KEY
+with	O
+respect	O
+to	O
+L/sub	O
+infinity	O
+/	O
+norm	O
+,	O
+is	O
+also	O
+given	O
+.	O
+The	O
+approximate	O
+effect	O
+of	O
+the	O
+MDR	O
+by	O
+L/sub	O
+2	O
+/	O
+is	O
+better	O
+than	O
+that	O
+of	O
+the	O
+MDR	O
+by	O
+L/sub	O
+infinity	O
+/	O
+.	O
+Explicit	B-KEY
+approximate	I-KEY
+error	I-KEY
+analysis	I-KEY
+of	O
+the	O
+multi-degree	O
+reduction	O
+methods	O
+is	O
+presented	O
+
+LR	O
+parsing	O
+for	O
+conjunctive	B-KEY
+grammars	I-KEY
+The	O
+generalized	B-KEY
+LR	I-KEY
+parsing	I-KEY
+algorithm	I-KEY
+for	O
+context-free	B-KEY
+grammars	I-KEY
+,	O
+introduced	O
+by	O
+Tomita	O
+in	O
+1986	O
+,	O
+is	O
+a	O
+polynomial-time	O
+implementation	O
+of	O
+nondeterministic	O
+LR	O
+parsing	O
+that	O
+uses	O
+graph-structured	B-KEY
+stack	I-KEY
+to	O
+represent	O
+the	O
+contents	O
+of	O
+the	O
+nondeterministic	O
+parser	O
+'s	O
+pushdown	O
+for	O
+all	O
+possible	O
+branches	O
+of	O
+computation	B-KEY
+at	O
+a	O
+single	O
+computation	B-KEY
+step	O
+.	O
+It	O
+has	O
+been	O
+specifically	O
+developed	O
+as	O
+a	O
+solution	O
+for	O
+practical	O
+parsing	O
+tasks	O
+arising	O
+in	O
+computational	B-KEY
+linguistics	O
+,	O
+and	O
+indeed	O
+has	O
+proved	O
+itself	O
+to	O
+be	O
+very	O
+suitable	O
+for	O
+natural	O
+language	O
+processing	O
+.	O
+Conjunctive	B-KEY
+grammars	I-KEY
+extend	O
+context-free	B-KEY
+grammars	I-KEY
+by	O
+allowing	O
+the	O
+use	O
+of	O
+an	O
+explicit	B-KEY
+intersection	I-KEY
+operation	I-KEY
+within	O
+grammar	B-KEY
+rules	I-KEY
+.	O
+This	O
+paper	O
+develops	O
+a	O
+new	O
+LR-style	O
+parsing	O
+algorithm	O
+for	O
+these	O
+grammars	O
+,	O
+which	O
+is	O
+based	O
+on	O
+the	O
+very	O
+same	O
+idea	O
+of	O
+a	O
+graph-structured	O
+pushdown	O
+,	O
+where	O
+the	O
+simultaneous	O
+existence	O
+of	O
+several	O
+paths	O
+in	O
+the	O
+graph	O
+is	O
+used	O
+to	O
+perform	O
+the	O
+mentioned	O
+intersection	O
+operation	O
+.	O
+The	O
+underlying	O
+finite	B-KEY
+automata	I-KEY
+are	O
+treated	O
+in	O
+the	O
+most	O
+general	O
+way	O
+:	O
+instead	O
+of	O
+showing	O
+the	O
+algorithm	O
+'s	O
+correctness	O
+for	O
+some	O
+particular	O
+way	O
+of	O
+constructing	O
+automata	O
+,	O
+the	O
+paper	O
+defines	O
+a	O
+wide	O
+class	O
+of	O
+automata	O
+usable	O
+with	O
+a	O
+given	O
+grammar	O
+,	O
+which	O
+includes	O
+not	O
+only	O
+the	O
+traditional	O
+LR	O
+-LRB-	O
+k	O
+-RRB-	O
+automata	O
+,	O
+but	O
+also	O
+,	O
+for	O
+instance	O
+,	O
+a	O
+trivial	B-KEY
+automaton	I-KEY
+with	O
+a	O
+single	B-KEY
+reachable	I-KEY
+state	I-KEY
+.	O
+A	O
+modification	O
+of	O
+the	O
+SLR	O
+-LRB-	O
+k	O
+-RRB-	O
+table	O
+construction	O
+method	O
+that	O
+makes	O
+use	O
+of	O
+specific	O
+properties	O
+of	O
+conjunctive	B-KEY
+grammars	I-KEY
+is	O
+provided	O
+as	O
+one	O
+possible	O
+way	O
+of	O
+making	O
+finite	B-KEY
+automata	I-KEY
+to	O
+use	O
+with	O
+the	O
+algorithm	O
+
+Linear	B-KEY
+tense	I-KEY
+logics	I-KEY
+of	O
+increasing	O
+sets	O
+We	O
+provide	O
+an	O
+extension	O
+of	O
+the	O
+language	O
+of	O
+linear	B-KEY
+tense	I-KEY
+logic	I-KEY
+with	O
+future	B-KEY
+and	I-KEY
+past	I-KEY
+connectives	I-KEY
+F	O
+and	O
+P	O
+,	O
+respectively	O
+,	O
+by	O
+a	O
+modality	O
+that	O
+quantifies	O
+over	O
+the	O
+points	O
+of	O
+some	O
+set	O
+which	O
+is	O
+assumed	O
+to	O
+increase	O
+in	O
+the	O
+course	O
+of	O
+time	O
+.	O
+In	O
+this	O
+way	O
+we	O
+obtain	O
+a	O
+general	O
+framework	O
+for	O
+modelling	O
+growth	O
+qualitatively	O
+.	O
+We	O
+develop	O
+an	O
+appropriate	O
+logical	B-KEY
+system	I-KEY
+,	O
+prove	O
+a	O
+corresponding	O
+completeness	B-KEY
+and	O
+decidability	B-KEY
+result	O
+and	O
+discuss	O
+the	O
+various	O
+kinds	O
+of	O
+flow	O
+of	O
+time	O
+in	O
+the	O
+new	O
+context	O
+.	O
+We	O
+also	O
+consider	O
+decreasing	B-KEY
+sets	I-KEY
+briefly	O
+
+Technology	O
+on	O
+social	B-KEY
+issues	I-KEY
+of	O
+videoconferencing	B-KEY
+on	O
+the	O
+Internet	B-KEY
+:	O
+a	O
+survey	O
+Constant	O
+advances	O
+in	O
+audio/video	O
+compression	O
+,	O
+the	O
+development	O
+of	O
+the	O
+multicast	B-KEY
+protocol	I-KEY
+as	O
+well	O
+as	O
+fast	O
+improvement	O
+in	O
+computing	O
+devices	O
+-LRB-	O
+e.g.	O
+higher	O
+speed	O
+,	O
+larger	O
+memory	O
+-RRB-	O
+have	O
+set	O
+forth	O
+the	O
+opportunity	O
+to	O
+have	O
+resource	O
+demanding	O
+videoconferencing	B-KEY
+-LRB-	O
+VC	O
+-RRB-	O
+sessions	O
+on	O
+the	O
+Internet	B-KEY
+.	O
+Multicast	O
+is	O
+supported	O
+by	O
+the	O
+multicast	B-KEY
+backbone	I-KEY
+-LRB-	O
+Mbone	B-KEY
+-RRB-	O
+,	O
+which	O
+is	O
+a	O
+special	O
+portion	O
+of	O
+the	O
+Internet	B-KEY
+where	O
+this	O
+protocol	O
+is	O
+being	O
+deployed	O
+.	O
+Mbone	B-KEY
+VC	O
+tools	O
+are	O
+steadily	O
+emerging	O
+and	O
+the	O
+user	O
+population	O
+is	O
+growing	O
+fast	O
+.	O
+VC	O
+is	O
+a	O
+fascinating	O
+application	O
+that	O
+has	O
+the	O
+potential	O
+to	O
+greatly	O
+impact	O
+the	O
+way	O
+we	O
+remotely	O
+communicate	O
+and	O
+work	O
+.	O
+Yet	O
+,	O
+the	O
+adoption	O
+of	O
+VC	O
+is	O
+not	O
+as	O
+fast	O
+as	O
+one	O
+could	O
+have	O
+predicted	O
+.	O
+Hence	O
+,	O
+it	O
+is	O
+important	O
+to	O
+examine	O
+the	O
+factors	O
+that	O
+affect	O
+a	O
+widespread	O
+adoption	O
+of	O
+VC	O
+.	O
+This	O
+paper	O
+examines	O
+the	O
+enabling	O
+technology	O
+and	O
+the	O
+social	B-KEY
+issues	I-KEY
+.	O
+It	O
+discusses	O
+the	O
+achievements	O
+and	O
+identifies	O
+the	O
+future	O
+challenges	O
+.	O
+It	O
+suggests	O
+an	O
+integration	O
+of	O
+many	O
+emerging	O
+multimedia	B-KEY
+tools	O
+into	O
+VC	O
+in	O
+order	O
+to	O
+enhance	O
+its	O
+versatility	O
+for	O
+more	O
+effectiveness	O
+
+Cultural	B-KEY
+differences	I-KEY
+in	O
+developers	O
+'	O
+perceptions	O
+of	O
+information	B-KEY
+systems	I-KEY
+success	I-KEY
+factors	I-KEY
+:	O
+Japan	B-KEY
+vs.	O
+the	O
+United	B-KEY
+States	I-KEY
+The	O
+study	O
+examined	O
+the	O
+perceptions	O
+of	O
+information	O
+systems	O
+-LRB-	O
+IS	O
+-RRB-	O
+developers	O
+from	O
+Japan	B-KEY
+and	O
+the	O
+United	B-KEY
+States	I-KEY
+regarding	O
+the	O
+strategies	O
+that	O
+are	O
+considered	O
+most	O
+important	O
+for	O
+successful	O
+implementation	O
+of	O
+an	O
+IS	O
+.	O
+The	O
+results	O
+of	O
+principal	B-KEY
+component	I-KEY
+analysis	I-KEY
+revealed	O
+that	O
+the	O
+IS	O
+strategies	O
+could	O
+be	O
+reduced	O
+to	O
+five	O
+components	O
+:	O
+-LRB-	O
+1	O
+-RRB-	O
+characteristics	O
+of	O
+the	O
+team	O
+members	O
+,	O
+-LRB-	O
+2	O
+-RRB-	O
+characteristics	O
+of	O
+the	O
+project	O
+leader	O
+,	O
+-LRB-	O
+3	O
+-RRB-	O
+management/user	B-KEY
+input	I-KEY
+,	O
+-LRB-	O
+4	O
+-RRB-	O
+proper	B-KEY
+technology	I-KEY
+,	O
+and	O
+-LRB-	O
+5	O
+-RRB-	O
+communication	B-KEY
+.	O
+The	O
+results	O
+indicated	O
+that	O
+there	O
+was	O
+a	O
+significant	O
+difference	O
+in	O
+the	O
+perceptions	O
+of	O
+Japanese	O
+and	O
+US	O
+developers	O
+with	O
+respect	O
+to	O
+the	O
+importance	O
+of	O
+the	O
+five	O
+components	O
+.	O
+Japanese	O
+developers	O
+perceived	O
+the	O
+project	O
+leader	O
+as	O
+the	O
+most	O
+crucial	O
+component	O
+for	O
+determining	O
+the	O
+success	O
+of	O
+an	O
+IS	B-KEY
+project	I-KEY
+.	O
+Team	B-KEY
+member	I-KEY
+characteristics	I-KEY
+was	O
+viewed	O
+as	O
+the	O
+least	O
+important	O
+by	O
+Japanese	O
+developers	O
+.	O
+On	O
+the	O
+other	O
+hand	O
+,	O
+developers	O
+from	O
+the	O
+US	O
+viewed	O
+communications	B-KEY
+as	O
+the	O
+most	O
+critical	O
+component	O
+.	O
+Project	B-KEY
+leader	I-KEY
+characteristics	I-KEY
+were	O
+perceived	O
+to	O
+be	O
+the	O
+least	O
+important	O
+by	O
+US	O
+developers	O
+.	O
+The	O
+results	O
+were	O
+discussed	O
+in	O
+terms	O
+of	O
+cultural	B-KEY
+differences	I-KEY
+
+An	O
+ACL	B-KEY
+for	O
+a	O
+dynamic	B-KEY
+system	I-KEY
+of	O
+agents	O
+In	O
+this	O
+article	O
+we	O
+present	O
+the	O
+design	O
+of	O
+an	O
+ACL	B-KEY
+for	O
+a	O
+dynamic	B-KEY
+system	I-KEY
+of	O
+agents	O
+.	O
+The	O
+ACL	B-KEY
+includes	O
+a	O
+set	O
+of	O
+conversation	O
+performatives	O
+extended	O
+with	O
+operations	O
+to	O
+register	O
+,	O
+create	O
+,	O
+and	O
+terminate	O
+agents	B-KEY
+.	O
+The	O
+main	O
+design	O
+goal	O
+at	O
+the	O
+agent-level	O
+is	O
+to	O
+provide	O
+only	O
+knowledge-level	O
+primitives	O
+that	O
+are	O
+well	O
+integrated	O
+with	O
+the	O
+dynamic	O
+nature	O
+of	O
+the	O
+system	O
+.	O
+This	O
+goal	O
+has	O
+been	O
+achieved	O
+by	O
+defining	O
+an	O
+anonymous	B-KEY
+interaction	I-KEY
+protocol	I-KEY
+which	O
+enables	O
+agents	B-KEY
+to	O
+request	O
+and	O
+supply	O
+knowledge	O
+without	O
+considering	O
+symbol-level	O
+issues	O
+concerning	O
+management	O
+of	O
+agent	B-KEY
+names	O
+,	O
+routing	O
+,	O
+and	O
+agent	B-KEY
+reachability	O
+.	O
+This	O
+anonymous	B-KEY
+interaction	I-KEY
+protocol	I-KEY
+exploits	O
+a	O
+distributed	B-KEY
+facilitator	I-KEY
+schema	O
+which	O
+is	O
+hidden	O
+at	O
+the	O
+agent-level	O
+and	O
+provides	O
+mechanisms	O
+for	O
+registering	O
+capabilities	O
+of	O
+agents	O
+and	O
+delivering	O
+requests	O
+according	O
+to	O
+the	O
+competence	O
+of	O
+agents	O
+.	O
+We	O
+present	O
+a	O
+formal	O
+specification	O
+of	O
+the	O
+ACL	B-KEY
+and	O
+of	O
+the	O
+underlying	O
+architecture	O
+,	O
+exploiting	O
+an	O
+algebra	O
+of	O
+actors	B-KEY
+,	O
+and	O
+illustrate	O
+it	O
+with	O
+the	O
+help	O
+of	O
+a	O
+graphical	O
+notation	O
+.	O
+This	O
+approach	O
+provides	O
+the	O
+basis	O
+for	O
+discussing	O
+dynamic	O
+primitives	O
+in	O
+ACL	B-KEY
+and	O
+for	O
+studying	O
+properties	O
+of	O
+dynamic	O
+multi	O
+agent	B-KEY
+systems	O
+,	O
+for	O
+example	O
+concerning	O
+the	O
+behavior	O
+of	O
+agents	B-KEY
+and	O
+the	O
+correctness	O
+of	O
+their	O
+conversation	O
+policies	O
+
+Surface	B-KEY
+textures	I-KEY
+improve	O
+the	O
+robustness	B-KEY
+of	O
+stereoscopic	B-KEY
+depth	I-KEY
+cues	I-KEY
+This	O
+research	O
+develops	O
+design	O
+recommendations	O
+for	O
+surface	B-KEY
+textures	I-KEY
+-LRB-	O
+patterns	O
+of	O
+color	O
+on	O
+object	O
+surfaces	O
+-RRB-	O
+rendered	O
+with	O
+stereoscopic	B-KEY
+displays	I-KEY
+.	O
+In	O
+3	O
+method-of-adjustment	O
+procedure	O
+experiments	O
+,	O
+8	O
+participants	O
+matched	O
+the	O
+disparity	O
+of	O
+a	O
+circular	O
+probe	O
+and	O
+a	O
+planar	O
+stimulus	O
+rendered	O
+using	O
+a	O
+single	B-KEY
+visible	I-KEY
+edge	I-KEY
+.	O
+The	O
+experiments	O
+varied	O
+stimulus	B-KEY
+orientation	I-KEY
+and	O
+surface	B-KEY
+texture	I-KEY
+.	O
+Participants	O
+more	O
+accurately	O
+matched	O
+the	O
+depth	O
+of	O
+vertical	O
+stimuli	O
+than	O
+that	O
+of	O
+horizontal	O
+stimuli	O
+,	O
+consistent	O
+with	O
+previous	O
+studies	O
+and	O
+existing	O
+theory	O
+.	O
+Participants	O
+matched	O
+the	O
+depth	O
+of	O
+surfaces	O
+with	O
+large	O
+pixel-to-pixel	B-KEY
+luminance	I-KEY
+variations	I-KEY
+more	O
+accurately	O
+than	O
+they	O
+did	O
+surfaces	O
+with	O
+a	O
+small	O
+pixel-to-pixel	B-KEY
+luminance	I-KEY
+variation	I-KEY
+.	O
+Finally	O
+,	O
+they	O
+matched	O
+the	O
+depth	O
+of	O
+surfaces	O
+with	O
+vertical	B-KEY
+line	I-KEY
+patterns	I-KEY
+more	O
+accurately	O
+than	O
+they	O
+did	O
+surfaces	O
+with	O
+horizontal-striped	B-KEY
+texture	I-KEY
+patterns	I-KEY
+.	O
+These	O
+results	O
+suggest	O
+that	O
+designers	O
+can	O
+enhance	O
+depth	B-KEY
+perception	I-KEY
+in	O
+stereoscopic	B-KEY
+displays	I-KEY
+,	O
+and	O
+also	O
+reduce	O
+undesirable	O
+sensitivity	O
+to	O
+orientation	O
+,	O
+by	O
+rendering	O
+objects	O
+with	O
+surface	B-KEY
+textures	I-KEY
+using	O
+large	O
+pixel-to-pixel	B-KEY
+luminance	I-KEY
+variations	I-KEY
+
+Office	O
+essentials	O
+-LSB-	O
+stationery	B-KEY
+suppliers	I-KEY
+-RSB-	O
+Make	O
+purchasing	B-KEY
+stationery	O
+a	O
+relatively	O
+simple	O
+task	O
+through	O
+effective	O
+planning	B-KEY
+and	O
+management	B-KEY
+of	I-KEY
+stock	I-KEY
+,	O
+and	O
+identifying	O
+the	O
+right	O
+supplier	O
+
+British	B-KEY
+Standard	I-KEY
+7666	I-KEY
+as	O
+a	O
+framework	O
+for	O
+geocoding	B-KEY
+land	O
+and	O
+property	B-KEY
+information	I-KEY
+the	O
+UK	B-KEY
+The	O
+article	O
+examines	O
+the	O
+role	O
+of	O
+British	B-KEY
+Standard	I-KEY
+7666	I-KEY
+in	O
+the	O
+development	O
+of	O
+a	O
+national	B-KEY
+framework	I-KEY
+for	O
+geocoding	B-KEY
+land	O
+and	O
+property	B-KEY
+information	I-KEY
+in	O
+the	O
+United	B-KEY
+Kingdom	I-KEY
+.	O
+The	O
+author	O
+assesses	O
+how	O
+local	B-KEY
+authorities	I-KEY
+,	O
+and	O
+other	O
+agencies	O
+concerned	O
+with	O
+property	O
+and	O
+address	B-KEY
+datasets	O
+,	O
+are	O
+coping	O
+with	O
+the	O
+introduction	O
+of	O
+British	O
+Standard	O
+7666	O
+,	O
+and	O
+examines	O
+the	O
+prospects	O
+and	O
+limitations	O
+of	O
+this	O
+development	O
+.	O
+British	B-KEY
+Standard	I-KEY
+7666	I-KEY
+has	O
+four	O
+parts	O
+,	O
+comprising	O
+specifications	O
+for	O
+street	B-KEY
+gazetteer	I-KEY
+;	O
+land	O
+and	O
+property	B-KEY
+gazetteer	I-KEY
+;	O
+addresses	B-KEY
+;	O
+and	O
+public	B-KEY
+rights	I-KEY
+of	I-KEY
+way	I-KEY
+.	O
+The	O
+organisation	O
+coordinating	O
+the	O
+introduction	O
+of	O
+British	B-KEY
+Standard	I-KEY
+7666	I-KEY
+,	O
+Improvement	B-KEY
+and	I-KEY
+Development	I-KEY
+Agency	I-KEY
+-LRB-	O
+IDeA	B-KEY
+-RRB-	O
+,	O
+is	O
+also	O
+overseeing	O
+the	O
+development	O
+and	O
+maintenance	O
+of	O
+a	O
+National	O
+Land	O
+and	O
+Property	B-KEY
+Gazetteer	I-KEY
+-LRB-	O
+NLPG	O
+-RRB-	O
+based	O
+on	O
+British	O
+Standard	O
+7666	O
+.	O
+The	O
+introduction	O
+of	O
+the	O
+new	O
+addressing	B-KEY
+standard	O
+has	O
+mainly	O
+been	O
+prompted	O
+by	O
+Britain	O
+'s	O
+effort	O
+to	O
+set	O
+up	O
+a	O
+national	O
+cadastral	O
+service	O
+to	O
+replace	O
+the	O
+obsolescent	O
+property	O
+registration	O
+system	O
+currently	O
+in	O
+place	O
+
+Determinantal	B-KEY
+solutions	I-KEY
+of	O
+solvable	B-KEY
+chaotic	I-KEY
+systems	I-KEY
+It	O
+is	O
+shown	O
+that	O
+two	O
+solvable	B-KEY
+chaotic	I-KEY
+systems	I-KEY
+,	O
+the	O
+arithmetic-harmonic	O
+mean	O
+-LRB-	O
+ARM	O
+-RRB-	O
+algorithm	O
+and	O
+the	O
+Ulam-von	O
+Neumann	O
+-LRB-	O
+UvN	O
+-RRB-	O
+map	O
+,	O
+have	O
+determinantal	B-KEY
+solutions	I-KEY
+.	O
+An	O
+additional	O
+formula	O
+for	O
+certain	O
+determinants	B-KEY
+and	O
+Riccati	B-KEY
+difference	I-KEY
+equations	I-KEY
+play	O
+a	O
+key	O
+role	O
+in	O
+both	O
+cases	O
+.	O
+Two	O
+infinite	O
+hierarchies	O
+of	O
+solvable	B-KEY
+chaotic	I-KEY
+systems	I-KEY
+are	O
+presented	O
+which	O
+have	O
+determinantal	B-KEY
+solutions	I-KEY
+
+Robustness	B-KEY
+evaluation	I-KEY
+of	O
+a	O
+minimal	O
+RBF	B-KEY
+neural	I-KEY
+network	I-KEY
+for	O
+nonlinear-data-storage-channel	B-KEY
+equalisation	I-KEY
+The	O
+authors	O
+present	O
+a	O
+performance-robustness	O
+evaluation	O
+of	O
+the	O
+recently	O
+developed	O
+minimal	O
+resource	O
+allocation	O
+network	O
+-LRB-	O
+MRAN	O
+-RRB-	O
+for	O
+equalisation	O
+in	O
+highly	O
+nonlinear	O
+magnetic	O
+recording	O
+channels	O
+in	O
+disc	O
+storage	O
+systems	O
+.	O
+Unlike	O
+communication	O
+systems	O
+,	O
+equalisation	O
+of	O
+signals	O
+in	O
+these	O
+channels	O
+is	O
+a	O
+difficult	O
+problem	O
+,	O
+as	O
+they	O
+are	O
+corrupted	O
+by	O
+data-dependent	B-KEY
+noise	I-KEY
+and	O
+highly	B-KEY
+nonlinear	I-KEY
+distortions	I-KEY
+.	O
+Nair	O
+and	O
+Moon	O
+-LRB-	O
+1997	O
+-RRB-	O
+have	O
+proposed	O
+a	O
+maximum	O
+signal	O
+to	O
+distortion	O
+ratio	O
+-LRB-	O
+MSDR	O
+-RRB-	O
+equaliser	O
+for	O
+data	O
+storage	O
+channels	O
+,	O
+which	O
+uses	O
+a	O
+specially	O
+designed	O
+neural	O
+network	O
+,	O
+where	O
+all	O
+the	O
+parameters	O
+of	O
+the	O
+neural	O
+network	O
+are	O
+determined	O
+theoretically	O
+,	O
+based	O
+on	O
+the	O
+exact	O
+knowledge	O
+of	O
+the	O
+channel	O
+model	O
+parameters	O
+.	O
+In	O
+the	O
+present	O
+paper	O
+,	O
+the	O
+performance	O
+of	O
+the	O
+MSDR	B-KEY
+equaliser	I-KEY
+is	O
+compared	O
+with	O
+that	O
+of	O
+the	O
+MRAN	B-KEY
+equaliser	I-KEY
+using	O
+a	O
+magnetic	O
+recording	O
+channel	O
+model	O
+,	O
+under	O
+Conditions	O
+that	O
+include	O
+variations	O
+in	O
+partial	O
+erasure	O
+,	O
+jitter	O
+,	O
+width	O
+and	O
+noise	O
+power	O
+,	O
+as	O
+well	O
+as	O
+model	O
+mismatch	O
+.	O
+Results	O
+from	O
+the	O
+study	O
+indicate	O
+that	O
+the	O
+less	O
+complex	O
+MRAN	B-KEY
+equaliser	I-KEY
+gives	O
+consistently	O
+better	O
+performance	O
+robustness	O
+than	O
+the	O
+MSDR	B-KEY
+equaliser	I-KEY
+in	O
+terms	O
+of	O
+signal	O
+to	O
+distortion	O
+ratios	O
+-LRB-	O
+SDRs	O
+-RRB-	O
+
+One	O
+structure	O
+for	O
+fractional	B-KEY
+delay	I-KEY
+filter	I-KEY
+with	O
+small	O
+number	O
+of	O
+multipliers	B-KEY
+A	O
+wide-bandwidth	O
+,	O
+high-resolution	O
+fractional	B-KEY
+delay	I-KEY
+filter	I-KEY
+-LRB-	O
+FDF	O
+-RRB-	O
+structure	O
+with	O
+a	O
+small	O
+number	O
+of	O
+multipliers	B-KEY
+per	O
+output	O
+sample	O
+and	O
+a	O
+short	B-KEY
+coefficient	I-KEY
+computing	I-KEY
+time	I-KEY
+is	O
+presented	O
+.	O
+The	O
+proposal	O
+is	O
+based	O
+on	O
+the	O
+use	O
+of	O
+a	O
+frequency	O
+FDF	O
+design	O
+method	O
+up	O
+to	O
+only	O
+half	O
+of	O
+the	O
+Nyquist	O
+frequency	O
+,	O
+in	O
+a	O
+multirate	B-KEY
+structure	I-KEY
+
+Midlife	B-KEY
+career	I-KEY
+choices	I-KEY
+:	O
+how	O
+are	O
+they	O
+different	O
+from	O
+other	O
+career	O
+choices	O
+?	O
+It	O
+was	O
+1963	O
+when	O
+Candy	O
+Start	O
+began	O
+working	O
+in	O
+libraries	B-KEY
+.	O
+Libraries	B-KEY
+seemed	O
+to	O
+be	O
+a	O
+refuge	O
+from	O
+change	O
+,	O
+a	O
+dependable	O
+environment	O
+devoted	O
+primarily	O
+to	O
+preservation	O
+.	O
+She	O
+was	O
+mistaken	O
+.	O
+Technological	B-KEY
+changes	I-KEY
+in	O
+every	O
+decade	O
+of	O
+her	O
+experience	O
+have	O
+affected	O
+how	O
+and	O
+where	O
+she	O
+used	O
+her	O
+MLS	O
+.	O
+Far	O
+from	O
+a	O
+static	O
+refuge	O
+,	O
+libraries	B-KEY
+have	O
+proven	O
+to	O
+be	O
+spaceships	O
+loaded	O
+with	O
+precious	O
+cargo	O
+hurtling	O
+into	O
+the	O
+unknown	O
+.	O
+The	O
+historian	O
+in	O
+the	O
+author	O
+says	O
+that	O
+perhaps	O
+libraries	B-KEY
+have	O
+always	O
+been	O
+like	O
+this	O
+.	O
+This	O
+paper	O
+looks	O
+at	O
+a	O
+midlife	O
+decision	O
+point	O
+and	O
+the	O
+choice	O
+that	O
+this	O
+librarian	O
+made	O
+to	O
+move	O
+from	O
+a	O
+point	O
+of	O
+lessening	O
+productivity	B-KEY
+and	O
+interest	O
+to	O
+one	O
+of	O
+increasing	O
+challenge	O
+and	O
+contribution	O
+.	O
+It	O
+is	O
+a	O
+personal	O
+narrative	O
+of	O
+midlife	O
+experience	O
+from	O
+one	O
+librarian	O
+'s	O
+point	O
+of	O
+view	O
+.	O
+Since	O
+writing	O
+this	O
+article	O
+,	O
+Candy	O
+'s	O
+career	O
+has	O
+followed	O
+more	O
+changes	O
+.	O
+After	O
+selling	O
+the	O
+WINGS	O
+TM	O
+system	O
+,	O
+she	O
+has	O
+taken	O
+her	O
+experiences	O
+and	O
+vision	O
+to	O
+another	O
+library	B-KEY
+vendor	O
+,	O
+Gaylord	O
+Information	O
+Systems	O
+,	O
+where	O
+she	O
+serves	O
+as	O
+a	O
+senior	O
+product	B-KEY
+strategist	O
+
+Linear	O
+,	O
+parameter-varying	O
+control	O
+and	O
+its	O
+application	O
+to	O
+a	O
+turbofan	B-KEY
+engine	I-KEY
+This	O
+paper	O
+describes	O
+application	O
+of	O
+parameter-dependent	B-KEY
+control	I-KEY
+design	I-KEY
+methods	I-KEY
+to	O
+a	O
+turbofan	B-KEY
+engine	I-KEY
+.	O
+Parameter-dependent	O
+systems	O
+are	O
+linear	O
+systems	O
+,	O
+whose	O
+state-space	B-KEY
+descriptions	I-KEY
+are	O
+known	O
+functions	O
+of	O
+time-varying	B-KEY
+parameters	I-KEY
+.	O
+The	O
+time	O
+variation	O
+of	O
+each	O
+of	O
+the	O
+parameters	O
+is	O
+not	O
+known	O
+in	O
+advance	O
+,	O
+but	O
+is	O
+assumed	O
+to	O
+be	O
+measurable	O
+in	O
+real-time	O
+.	O
+Three	O
+linear	O
+,	O
+parameter-varying	O
+-LRB-	O
+LPV	O
+-RRB-	O
+approaches	O
+to	O
+control	O
+design	O
+are	O
+discussed	O
+.	O
+The	O
+first	O
+method	O
+is	O
+based	O
+on	O
+linear	B-KEY
+fractional	I-KEY
+transformations	I-KEY
+which	O
+relies	O
+on	O
+the	O
+small	B-KEY
+gain	I-KEY
+theorem	I-KEY
+for	O
+bounds	O
+on	O
+performance	O
+and	O
+robustness	O
+.	O
+The	O
+other	O
+methods	O
+make	O
+use	O
+of	O
+either	O
+a	O
+single	O
+-LRB-	O
+SQLF	O
+-RRB-	O
+or	O
+parameter-dependent	O
+-LRB-	O
+PDQLF	O
+-RRB-	O
+quadratic	O
+Lyapunov	O
+function	O
+to	O
+bound	O
+the	O
+achievable	O
+level	O
+of	O
+performance	O
+.	O
+The	O
+latter	O
+two	O
+techniques	O
+are	O
+used	O
+to	O
+synthesize	O
+controllers	O
+for	O
+a	O
+high-performance	O
+turbofan	B-KEY
+engine	I-KEY
+.	O
+A	O
+LPV	O
+model	O
+of	O
+the	O
+turbofan	B-KEY
+engine	I-KEY
+is	O
+constructed	O
+from	O
+Jacobian	B-KEY
+linearizations	I-KEY
+at	O
+fixed	O
+power	O
+codes	O
+for	O
+control	O
+design	O
+.	O
+The	O
+control	O
+problem	O
+is	O
+formulated	O
+as	O
+a	O
+model	B-KEY
+matching	I-KEY
+problem	I-KEY
+in	O
+the	O
+H/sub	O
+infinity	O
+/	O
+and	O
+LPV	O
+framework	O
+.	O
+The	O
+objective	O
+is	O
+decoupled	B-KEY
+command	I-KEY
+response	I-KEY
+of	O
+the	O
+closed-loop	B-KEY
+system	I-KEY
+to	O
+pressure	O
+and	O
+rotor	O
+speed	O
+requests	O
+.	O
+The	O
+performance	O
+of	O
+linear	O
+,	O
+H/sub	O
+infinity	O
+/	O
+point	O
+designs	O
+are	O
+compared	O
+with	O
+the	O
+SQLF	O
+and	O
+PDQLF	O
+controllers	O
+.	O
+Nonlinear	B-KEY
+simulations	I-KEY
+indicate	O
+that	O
+the	O
+controller	O
+synthesized	O
+using	O
+the	O
+SQLF	O
+approach	O
+is	O
+slightly	O
+more	O
+conservative	O
+than	O
+the	O
+PDQLF	O
+controller	O
+.	O
+Nonlinear	B-KEY
+simulations	I-KEY
+with	O
+the	O
+SQLF	O
+and	O
+PDQLF	O
+controllers	O
+show	O
+very	B-KEY
+robust	I-KEY
+designs	I-KEY
+that	O
+achieve	O
+all	O
+desired	O
+performance	O
+objectives	O
+
+Contracting	B-KEY
+in	O
+the	O
+days	O
+of	O
+ebusiness	O
+Putting	O
+electronic	B-KEY
+business	I-KEY
+on	O
+a	O
+sound	O
+foundation-model	O
+theoretically	O
+as	O
+well	O
+as	O
+technologically-is	O
+a	O
+central	O
+challenge	O
+for	O
+research	O
+as	O
+well	O
+as	O
+commercial	O
+development	O
+.	O
+This	O
+paper	O
+concentrates	O
+on	O
+the	O
+discovery	O
+and	O
+negotiation	O
+phase	O
+of	O
+concluding	O
+an	O
+agreement	O
+based	O
+on	O
+a	O
+contract	B-KEY
+.	O
+We	O
+present	O
+a	O
+methodology	O
+for	O
+moving	O
+seamlessly	O
+from	O
+a	O
+many-to-many	B-KEY
+relationship	I-KEY
+in	O
+the	O
+discovery	B-KEY
+phase	I-KEY
+to	O
+a	O
+one-to-one	B-KEY
+relationship	I-KEY
+in	O
+the	O
+contract	B-KEY
+negotiation	O
+phase	O
+.	O
+Making	O
+the	O
+content	O
+of	O
+contracts	B-KEY
+persistent	O
+is	O
+achieved	O
+by	O
+reconstructing	O
+contract	B-KEY
+templates	O
+by	O
+means	O
+of	O
+mereologic	O
+-LRB-	O
+logic	O
+of	O
+the	O
+whole-part	O
+relation	O
+-RRB-	O
+.	O
+Possibly	O
+nested	B-KEY
+sub-structures	I-KEY
+of	O
+the	O
+contract	B-KEY
+template	O
+are	O
+taken	O
+as	O
+a	O
+basis	O
+for	O
+negotiation	O
+in	O
+a	O
+dialogical	O
+way	O
+.	O
+For	O
+the	O
+negotiation	O
+itself	O
+the	O
+contract	B-KEY
+templates	O
+are	O
+extended	O
+by	O
+implications	O
+-LRB-	O
+logical	O
+-RRB-	O
+and	O
+sequences	O
+-LRB-	O
+topical	O
+-RRB-	O
+
+How	O
+airlines	O
+and	O
+airports	B-KEY
+recover	O
+from	O
+schedule	B-KEY
+perturbations	I-KEY
+:	O
+a	O
+survey	O
+The	O
+explosive	O
+growth	O
+in	O
+air	O
+traffic	O
+as	O
+well	O
+as	O
+the	O
+widespread	O
+adoption	O
+of	O
+Operations	B-KEY
+Research	I-KEY
+techniques	I-KEY
+in	O
+airline	B-KEY
+scheduling	I-KEY
+has	O
+given	O
+rise	O
+to	O
+tight	B-KEY
+flight	I-KEY
+schedules	I-KEY
+at	O
+major	O
+airports	B-KEY
+.	O
+An	O
+undesirable	O
+consequence	O
+of	O
+this	O
+is	O
+that	O
+a	O
+minor	O
+incident	O
+such	O
+as	O
+a	O
+delay	O
+in	O
+the	O
+arrival	O
+of	O
+a	O
+small	O
+number	O
+of	O
+flights	O
+can	O
+result	O
+in	O
+a	O
+chain	O
+reaction	O
+of	O
+events	O
+involving	O
+several	O
+flights	O
+and	O
+airports	B-KEY
+,	O
+causing	O
+disruption	O
+throughout	O
+the	O
+system	O
+.	O
+This	O
+paper	O
+reviews	O
+recent	O
+literature	O
+in	O
+the	O
+area	O
+of	O
+recovery	B-KEY
+from	O
+schedule	B-KEY
+disruptions	I-KEY
+.	O
+First	O
+we	O
+review	O
+how	O
+disturbances	O
+at	O
+a	O
+given	O
+airport	B-KEY
+could	O
+be	O
+handled	O
+,	O
+including	O
+the	O
+effects	O
+of	O
+runways	B-KEY
+and	O
+fixes	O
+.	O
+Then	O
+we	O
+study	O
+the	O
+papers	O
+on	O
+recovery	B-KEY
+from	O
+airline	B-KEY
+schedule	I-KEY
+perturbations	O
+,	O
+which	O
+involve	O
+adjustments	O
+in	O
+flight	O
+schedules	O
+,	O
+aircraft	O
+,	O
+and	O
+crew	O
+.	O
+The	O
+mathematical	B-KEY
+programming	I-KEY
+techniques	I-KEY
+used	O
+in	O
+ground	B-KEY
+holding	I-KEY
+are	O
+covered	O
+in	O
+some	O
+detail	O
+.	O
+We	O
+conclude	O
+the	O
+review	O
+with	O
+suggestions	O
+on	O
+how	O
+singular	B-KEY
+perturbation	I-KEY
+theory	I-KEY
+could	O
+play	O
+a	O
+role	O
+in	O
+analyzing	O
+disruptions	O
+to	O
+such	O
+highly	O
+sensitive	O
+schedules	O
+as	O
+those	O
+in	O
+the	O
+civil	B-KEY
+aviation	I-KEY
+industry	I-KEY
+
+Mission	B-KEY
+planning	I-KEY
+for	O
+regional	B-KEY
+surveillance	I-KEY
+The	O
+regional	B-KEY
+surveillance	I-KEY
+problem	O
+discussed	O
+involves	O
+formulating	O
+a	O
+flight	B-KEY
+route	I-KEY
+for	O
+an	O
+aircraft	O
+to	O
+scan	O
+a	O
+given	O
+geographical	O
+region	O
+.	O
+Aerial	B-KEY
+surveillance	I-KEY
+is	O
+conducted	O
+using	O
+a	O
+synthetic	B-KEY
+aperture	I-KEY
+radar	I-KEY
+device	I-KEY
+mounted	O
+on	O
+the	O
+aircraft	O
+to	O
+compose	O
+a	O
+complete	O
+,	O
+high-resolution	B-KEY
+image	I-KEY
+of	O
+the	O
+region	O
+.	O
+Two	O
+models	O
+for	O
+determining	O
+an	O
+optimised	B-KEY
+flight	I-KEY
+route	I-KEY
+are	O
+described	O
+,	O
+the	O
+first	O
+employing	O
+integer	O
+programming	O
+and	O
+the	O
+second	O
+,	O
+genetic	O
+algorithms	O
+.	O
+A	O
+comparison	O
+of	O
+the	O
+solution	B-KEY
+optimality	I-KEY
+in	O
+terms	O
+of	O
+the	O
+total	B-KEY
+distance	I-KEY
+travelled	I-KEY
+,	O
+and	O
+model	O
+efficiency	O
+of	O
+the	O
+two	O
+techniques	O
+in	O
+terms	O
+of	O
+their	O
+required	O
+CPU	O
+times	O
+,	O
+is	O
+made	O
+in	O
+order	O
+to	O
+identify	O
+the	O
+conditions	O
+under	O
+which	O
+it	O
+is	O
+appropriate	O
+to	O
+apply	O
+each	O
+model	O
+
+Wired	O
+right	O
+-LSB-	O
+accounting	B-KEY
+-RSB-	O
+From	O
+business	B-KEY
+intelligence	I-KEY
+to	O
+wireless	B-KEY
+networking	I-KEY
+to	O
+service	B-KEY
+providers	I-KEY
+,	O
+here	O
+is	O
+what	O
+you	O
+need	O
+to	O
+know	O
+to	O
+keep	O
+up	O
+to	O
+speed	O
+with	O
+a	O
+changing	O
+landscape	O
+
+Approach	O
+to	O
+adaptive	B-KEY
+neural	I-KEY
+net-based	I-KEY
+H/sub	I-KEY
+infinity	I-KEY
+/	I-KEY
+control	I-KEY
+design	I-KEY
+An	O
+approach	O
+is	O
+investigated	O
+for	O
+the	O
+adaptive	B-KEY
+neural	I-KEY
+net-based	I-KEY
+H/sub	I-KEY
+infinity	I-KEY
+/	I-KEY
+control	I-KEY
+design	I-KEY
+of	O
+a	O
+class	O
+of	O
+nonlinear	B-KEY
+uncertain	I-KEY
+systems	I-KEY
+.	O
+In	O
+the	O
+proposed	O
+framework	O
+,	O
+two	O
+multilayer	B-KEY
+feedforward	I-KEY
+neural	I-KEY
+networks	I-KEY
+are	O
+constructed	O
+as	O
+an	O
+alternative	O
+to	O
+approximate	O
+the	O
+nonlinear	O
+system	O
+.	O
+The	O
+neural	O
+networks	O
+are	O
+piecewisely	B-KEY
+interpolated	I-KEY
+to	O
+generate	O
+a	O
+linear	B-KEY
+differential	I-KEY
+inclusion	I-KEY
+model	I-KEY
+by	O
+which	O
+a	O
+linear	B-KEY
+state	I-KEY
+feedback	I-KEY
+H/sub	O
+infinity	O
+/	O
+control	O
+law	O
+can	O
+be	O
+applied	O
+.	O
+An	O
+adaptive	O
+weight	O
+adjustment	O
+mechanism	O
+for	O
+the	O
+multilayer	B-KEY
+feedforward	I-KEY
+neural	I-KEY
+networks	I-KEY
+is	O
+developed	O
+to	O
+ensure	O
+H/sub	O
+infinity	O
+/	O
+regulation	O
+performance	O
+.	O
+It	O
+is	O
+shown	O
+that	O
+finding	O
+the	O
+control	B-KEY
+gain	I-KEY
+matrices	I-KEY
+can	O
+be	O
+transformed	O
+into	O
+a	O
+standard	O
+linear	B-KEY
+matrix	I-KEY
+inequality	I-KEY
+problem	I-KEY
+and	O
+solved	O
+via	O
+a	O
+developed	O
+recurrent	B-KEY
+neural	I-KEY
+network	I-KEY
+
+Genetic	B-KEY
+algorithm	I-KEY
+for	O
+input/output	B-KEY
+selection	I-KEY
+in	O
+MIMO	B-KEY
+systems	I-KEY
+based	O
+on	O
+controllability	O
+and	O
+observability	B-KEY
+indices	I-KEY
+A	O
+time	B-KEY
+domain	I-KEY
+optimisation	I-KEY
+algorithm	I-KEY
+using	O
+a	O
+genetic	B-KEY
+algorithm	I-KEY
+in	O
+conjunction	O
+with	O
+a	O
+linear	B-KEY
+search	I-KEY
+scheme	I-KEY
+has	O
+been	O
+developed	O
+to	O
+find	O
+the	O
+smallest	O
+or	O
+near-smallest	B-KEY
+subset	I-KEY
+of	O
+inputs	O
+and	O
+outputs	O
+to	O
+control	O
+a	O
+multi-input-multi-output	O
+system	O
+.	O
+Experimental	O
+results	O
+have	O
+shown	O
+that	O
+this	O
+proposed	O
+algorithm	O
+has	O
+a	O
+very	B-KEY
+fast	I-KEY
+convergence	I-KEY
+rate	O
+and	O
+high	B-KEY
+computation	I-KEY
+efficiency	I-KEY
+
+Superconvergence	B-KEY
+of	I-KEY
+discontinuous	I-KEY
+Galerkin	I-KEY
+method	I-KEY
+for	O
+nonstationary	B-KEY
+hyperbolic	I-KEY
+equation	I-KEY
+For	O
+the	O
+first	O
+order	O
+nonstationary	B-KEY
+hyperbolic	I-KEY
+equation	I-KEY
+taking	O
+the	O
+piecewise	B-KEY
+linear	I-KEY
+discontinuous	I-KEY
+Galerkin	I-KEY
+solver	I-KEY
+,	O
+we	O
+prove	O
+that	O
+under	O
+the	O
+uniform	O
+rectangular	B-KEY
+partition	I-KEY
+,	O
+such	O
+a	O
+discontinuous	O
+solver	O
+,	O
+after	O
+postprocessing	O
+,	O
+can	O
+have	O
+two	O
+and	O
+half	O
+approximative	B-KEY
+order	I-KEY
+which	O
+is	O
+half	O
+order	O
+higher	O
+than	O
+the	O
+optimal	O
+estimate	O
+by	O
+P.	O
+Lesaint	O
+and	O
+P.	O
+Raviart	O
+-LRB-	O
+1974	O
+-RRB-	O
+under	O
+the	O
+rectangular	B-KEY
+partition	I-KEY
+
+Control	O
+of	O
+a	O
+thrust-vectored	O
+flying	O
+wing	O
+:	O
+a	O
+receding	B-KEY
+horizon	I-KEY
+-	I-KEY
+LPV	I-KEY
+approach	I-KEY
+This	O
+paper	O
+deals	O
+with	O
+the	O
+application	O
+of	O
+receding	O
+horizon	O
+methods	O
+to	O
+hover	O
+and	O
+forward	B-KEY
+flight	I-KEY
+models	I-KEY
+of	O
+an	O
+experimental	O
+tethered	B-KEY
+flying	I-KEY
+wing	I-KEY
+developed	O
+at	O
+Caltech	B-KEY
+.	O
+The	O
+dynamics	O
+of	O
+the	O
+system	O
+are	O
+representative	O
+of	O
+a	O
+vertical	O
+landing	O
+and	O
+take	O
+off	O
+aircraft	O
+,	O
+such	O
+as	O
+a	O
+Harrier	B-KEY
+around	I-KEY
+hover	I-KEY
+,	O
+or	O
+a	O
+thrust-vectored	B-KEY
+aircraft	I-KEY
+such	O
+as	O
+F18-HARV	B-KEY
+or	O
+X-31	B-KEY
+in	O
+forward	O
+flight	O
+.	O
+The	O
+adopted	O
+control	O
+methodology	O
+is	O
+a	O
+hybrid	O
+of	O
+receding	B-KEY
+horizon	I-KEY
+techniques	I-KEY
+and	O
+control	O
+Lyapunov	O
+function	O
+-LRB-	O
+CLF	O
+-RRB-	O
+-	O
+based	O
+ideas	O
+.	O
+First	O
+,	O
+a	O
+CLF	O
+is	O
+generated	O
+using	O
+quasi-LPV	B-KEY
+methods	I-KEY
+and	O
+then	O
+,	O
+by	O
+using	O
+the	O
+CLF	O
+as	O
+the	O
+terminal	B-KEY
+cost	I-KEY
+in	O
+the	O
+receding	B-KEY
+horizon	I-KEY
+optimization	I-KEY
+,	O
+stability	O
+is	O
+guaranteed	O
+.	O
+The	O
+main	O
+advantage	O
+of	O
+this	O
+approach	O
+is	O
+that	O
+stability	O
+can	O
+be	O
+guaranteed	O
+without	O
+imposing	O
+constraints	O
+in	O
+the	O
+on-line	O
+optimization	O
+,	O
+allowing	O
+the	O
+problem	O
+to	O
+be	O
+solved	O
+in	O
+a	O
+more	O
+efficient	O
+manner	O
+.	O
+Models	O
+of	O
+the	O
+experimental	O
+set-up	O
+are	O
+obtained	O
+for	O
+the	O
+hover	O
+and	O
+forward	O
+flight	O
+modes	O
+.	O
+Numerical	B-KEY
+simulations	I-KEY
+for	O
+different	O
+time	O
+horizons	O
+are	O
+presented	O
+to	O
+illustrate	O
+the	O
+effectiveness	O
+of	O
+the	O
+discussed	O
+methods	O
+.	O
+Specifically	O
+,	O
+it	O
+is	O
+shown	O
+that	O
+a	O
+mere	O
+upper	O
+bound	O
+on	O
+the	O
+cost-to-go	O
+is	O
+not	O
+an	O
+appropriate	O
+choice	O
+for	O
+a	O
+terminal	B-KEY
+cost	I-KEY
+,	O
+when	O
+the	O
+horizon	O
+length	O
+is	O
+short	O
+.	O
+Simulation	O
+results	O
+are	O
+presented	O
+using	O
+experimentally	O
+verified	O
+model	O
+parameters	O
+
+Nurturing	O
+clients	O
+'	O
+trust	O
+to	O
+encourage	O
+engagement	B-KEY
+success	I-KEY
+during	O
+the	O
+customization	B-KEY
+of	O
+ERP	B-KEY
+systems	I-KEY
+Customization	B-KEY
+is	O
+a	O
+crucial	O
+,	O
+lengthy	O
+,	O
+and	O
+costly	O
+aspect	O
+in	O
+the	O
+successful	O
+implementation	O
+of	O
+ERP	B-KEY
+systems	I-KEY
+,	O
+and	O
+has	O
+,	O
+accordingly	O
+,	O
+become	O
+a	O
+major	O
+specialty	O
+of	O
+many	O
+vendors	B-KEY
+and	O
+consulting	B-KEY
+companies	I-KEY
+.	O
+The	O
+study	O
+examines	O
+how	O
+such	O
+companies	O
+can	O
+increase	O
+their	O
+clients	O
+'	O
+perception	O
+of	O
+engagement	B-KEY
+success	I-KEY
+through	O
+increased	O
+client	B-KEY
+trust	I-KEY
+that	O
+is	O
+brought	O
+about	O
+through	O
+responsive	O
+and	O
+dependable	B-KEY
+customization	B-KEY
+.	O
+Survey	O
+data	O
+from	O
+ERP	O
+customization	B-KEY
+clients	O
+show	O
+that	O
+,	O
+as	O
+hypothesized	O
+,	O
+clients	O
+'	O
+trust	O
+influenced	O
+their	O
+perception	O
+of	O
+engagement	B-KEY
+success	I-KEY
+with	O
+the	O
+company	O
+.	O
+The	O
+data	O
+also	O
+show	O
+that	O
+clients	O
+'	O
+trust	O
+in	O
+the	O
+customization	B-KEY
+company	O
+was	O
+increased	O
+when	O
+the	O
+company	O
+behaved	O
+in	O
+accordance	O
+with	O
+client	O
+expectations	O
+by	O
+being	O
+responsive	O
+,	O
+and	O
+decreased	O
+when	O
+the	O
+company	O
+behaved	O
+in	O
+a	O
+manner	O
+that	O
+contradicted	O
+these	O
+expectations	O
+by	O
+not	O
+being	O
+dependable	B-KEY
+.	O
+Responses	O
+to	O
+an	O
+open-ended	O
+question	O
+addendum	O
+attached	O
+to	O
+the	O
+survey	O
+corroborated	O
+the	O
+importance	O
+of	O
+responsiveness	O
+and	O
+dependability	B-KEY
+.	O
+Implications	O
+for	O
+customization	B-KEY
+companies	O
+and	O
+research	O
+on	O
+trust	O
+are	O
+discussed	O
+
+The	O
+diameter	O
+of	O
+a	O
+long-range	O
+percolation	B-KEY
+graph	O
+We	O
+consider	O
+the	O
+following	O
+long-range	O
+percolation	B-KEY
+model	O
+:	O
+an	O
+undirected	O
+graph	O
+with	O
+the	O
+node	O
+set	O
+-LCB-	O
+0	O
+,	O
+1	O
+,	O
+...	O
+,	O
+N	O
+-RCB-	O
+/	O
+sup	O
+d	O
+/	O
+,	O
+has	O
+edges	O
+-LRB-	O
+x	O
+,	O
+y	O
+-RRB-	O
+selected	O
+with	O
+probability	O
+approximately	O
+=	O
+beta	O
+/	O
+|	O
+|	O
+x	O
+-	O
+y	O
+|	O
+|	O
+/	O
+sup	O
+s	O
+/	O
+if	O
+|	O
+|	O
+x	O
+-	O
+y	O
+|	O
+|	O
+>	O
+1	O
+,	O
+and	O
+with	O
+probability	O
+1	O
+if	O
+|	O
+|	O
+x	O
+-	O
+y	O
+|	O
+|	O
+=	O
+1	O
+,	O
+for	O
+some	O
+parameters	O
+beta	O
+,	O
+s	O
+>	O
+0	O
+.	O
+This	O
+model	O
+was	O
+introduced	O
+by	O
+who	O
+obtained	O
+bounds	O
+on	O
+the	O
+diameter	O
+of	O
+this	O
+graph	O
+for	O
+the	O
+one-dimensional	O
+case	O
+d	O
+=	O
+1	O
+and	O
+for	O
+various	O
+values	O
+of	O
+s	O
+,	O
+but	O
+left	O
+cases	O
+s	O
+=	O
+1	O
+,	O
+2	O
+open	O
+.	O
+We	O
+show	O
+that	O
+,	O
+with	O
+high	O
+probability	B-KEY
+,	O
+the	O
+diameter	O
+of	O
+this	O
+graph	O
+is	O
+Theta	O
+-LRB-	O
+log	O
+N/log	O
+log	O
+N	O
+-RRB-	O
+when	O
+s	O
+=	O
+d	O
+,	O
+and	O
+,	O
+for	O
+some	O
+constants	O
+0	O
+<	O
+eta	O
+/	O
+sub	O
+1	O
+/	O
+<	O
+eta	O
+/	O
+sub	O
+2	O
+/	O
+<	O
+1	O
+,	O
+it	O
+is	O
+at	O
+most	O
+N/sup	O
+eta	O
+2	O
+/	O
+when	O
+s	O
+=	O
+2d	O
+,	O
+and	O
+is	O
+at	O
+least	O
+N/sup	O
+eta	O
+1	O
+/	O
+when	O
+d	O
+=	O
+1	O
+,	O
+s	O
+=	O
+2	O
+,	O
+beta	O
+<	O
+1	O
+or	O
+when	O
+s	O
+>	O
+2d	O
+.	O
+We	O
+also	O
+provide	O
+a	O
+simple	O
+proof	O
+that	O
+the	O
+diameter	O
+is	O
+at	O
+most	O
+log/sup	O
+O	O
+-LRB-	O
+1	O
+-RRB-	O
+/	O
+N	O
+with	O
+high	O
+probability	B-KEY
+,	O
+when	O
+d	O
+<	O
+s	O
+<	O
+2d	O
+,	O
+established	O
+previously	O
+in	O
+Benjamini	O
+and	O
+Berger	O
+-LRB-	O
+2001	O
+-RRB-	O
+
+MRP	B-KEY
+in	O
+a	O
+job	B-KEY
+shop	I-KEY
+environment	I-KEY
+using	O
+a	O
+resource	O
+constrained	O
+project	O
+scheduling	B-KEY
+model	O
+One	O
+of	O
+the	O
+most	O
+difficult	O
+tasks	O
+in	O
+a	O
+job	O
+shop	O
+manufacturing	O
+environment	O
+is	O
+to	O
+balance	O
+schedule	B-KEY
+and	O
+capacity	O
+in	O
+an	O
+ongoing	O
+basis	O
+.	O
+MRP	B-KEY
+systems	O
+are	O
+commonly	O
+used	O
+for	O
+scheduling	B-KEY
+,	O
+although	O
+their	O
+inability	O
+to	O
+deal	O
+with	O
+capacity	B-KEY
+constraints	I-KEY
+adequately	O
+is	O
+a	O
+severe	O
+drawback	O
+.	O
+In	O
+this	O
+study	O
+,	O
+we	O
+show	O
+that	O
+material	B-KEY
+requirements	I-KEY
+planning	I-KEY
+can	O
+be	O
+done	O
+more	O
+effectively	O
+in	O
+a	O
+job	B-KEY
+shop	I-KEY
+environment	I-KEY
+using	O
+a	O
+resource	O
+constrained	O
+project	O
+scheduling	B-KEY
+model	O
+.	O
+The	O
+proposed	O
+model	O
+augments	O
+MRP	B-KEY
+models	O
+by	O
+incorporating	O
+capacity	B-KEY
+constraints	I-KEY
+and	O
+using	O
+variable	B-KEY
+lead	I-KEY
+time	I-KEY
+lengths	I-KEY
+.	O
+The	O
+efficacy	O
+of	O
+this	O
+approach	O
+is	O
+tested	O
+on	O
+MRP	B-KEY
+systems	O
+by	O
+comparing	O
+the	O
+inventory	B-KEY
+carrying	I-KEY
+costs	I-KEY
+and	O
+resource	B-KEY
+allocation	I-KEY
+of	O
+the	O
+solutions	O
+obtained	O
+by	O
+the	O
+proposed	O
+model	O
+to	O
+those	O
+obtained	O
+by	O
+using	O
+a	O
+traditional	O
+MRP	B-KEY
+model	O
+.	O
+In	O
+general	O
+,	O
+it	O
+is	O
+concluded	O
+that	O
+the	O
+proposed	O
+model	O
+provides	O
+improved	O
+schedules	B-KEY
+with	O
+considerable	O
+reductions	O
+in	O
+inventory	B-KEY
+carrying	I-KEY
+costs	I-KEY
+
+Use	O
+of	O
+fuzzy	O
+weighted	O
+autocorrelation	B-KEY
+function	I-KEY
+for	O
+pitch	B-KEY
+extraction	I-KEY
+from	O
+noisy	B-KEY
+speech	I-KEY
+An	O
+investigation	O
+is	O
+presented	O
+into	O
+the	O
+feasibility	O
+of	O
+incorporating	O
+a	O
+fuzzy	B-KEY
+weighting	I-KEY
+scheme	I-KEY
+into	O
+the	O
+calculation	O
+of	O
+an	O
+autocorrelation	B-KEY
+function	I-KEY
+for	O
+pitch	B-KEY
+extraction	I-KEY
+.	O
+Simulation	B-KEY
+results	I-KEY
+reveal	O
+that	O
+the	O
+proposed	O
+method	O
+provides	O
+better	O
+robustness	O
+against	O
+background	B-KEY
+noise	I-KEY
+than	O
+the	O
+conventional	O
+approaches	O
+for	O
+extracting	O
+pitch	O
+period	O
+in	O
+a	O
+noisy	O
+environment	O
+
+Dihedral	B-KEY
+congruence	I-KEY
+primes	I-KEY
+and	O
+class	B-KEY
+fields	I-KEY
+of	O
+real	B-KEY
+quadratic	I-KEY
+fields	I-KEY
+We	O
+show	O
+that	O
+for	O
+a	O
+real	B-KEY
+quadratic	I-KEY
+field	I-KEY
+F	O
+the	O
+dihedral	B-KEY
+congruence	I-KEY
+primes	I-KEY
+with	O
+respect	O
+to	O
+F	O
+for	O
+cusp	O
+forms	O
+of	O
+weight	O
+k	O
+and	O
+quadratic	B-KEY
+nebentypus	I-KEY
+are	O
+essentially	O
+the	O
+primes	O
+dividing	O
+expressions	O
+of	O
+the	O
+form	O
+epsilon	O
+/	O
+sub	O
++	O
+/	O
+/	O
+sup	O
+k-1	O
+/	O
++	O
+or-1	O
+where	O
+epsilon	O
+/	O
+sub	O
++	O
+/	O
+is	O
+a	O
+totally	O
+positive	O
+fundamental	O
+unit	O
+of	O
+F	O
+.	O
+This	O
+extends	O
+work	O
+of	O
+Hida	O
+.	O
+Our	O
+results	O
+allow	O
+us	O
+to	O
+identify	O
+a	O
+family	O
+of	O
+-LRB-	O
+ray	O
+-RRB-	O
+class	B-KEY
+fields	I-KEY
+of	O
+F	O
+which	O
+are	O
+generated	O
+by	O
+torsion	B-KEY
+points	I-KEY
+on	O
+modular	B-KEY
+abelian	I-KEY
+varieties	I-KEY
+
+Nonlinearities	O
+in	O
+NARX	O
+polynomial	O
+models	O
+:	O
+representation	O
+and	O
+estimation	O
+It	O
+is	O
+shown	O
+how	O
+nonlinearities	O
+are	O
+mapped	O
+in	O
+NARX	O
+polynomial	O
+models	O
+.	O
+General	O
+expressions	O
+are	O
+derived	O
+for	O
+the	O
+gain	O
+and	O
+eigenvalue	B-KEY
+functions	I-KEY
+in	O
+terms	O
+of	O
+the	O
+regressors	B-KEY
+and	O
+coefficients	O
+of	O
+NARX	O
+models	O
+.	O
+Such	O
+relationships	O
+are	O
+useful	O
+in	O
+grey-box	B-KEY
+identification	I-KEY
+problems	I-KEY
+.	O
+The	O
+results	O
+are	O
+illustrated	O
+using	O
+simulated	O
+and	O
+real	O
+data	O
+
+Two	O
+issues	O
+in	O
+setting	O
+call	B-KEY
+centre	I-KEY
+staffing	I-KEY
+levels	I-KEY
+Motivated	O
+by	O
+a	O
+problem	O
+facing	O
+the	O
+Police	B-KEY
+Communication	I-KEY
+Centre	I-KEY
+in	O
+Auckland	B-KEY
+,	O
+New	B-KEY
+Zealand	I-KEY
+,	O
+we	O
+consider	O
+the	O
+setting	O
+of	O
+staffing	O
+levels	O
+in	O
+a	O
+call	O
+centre	O
+with	O
+priority	B-KEY
+customers	I-KEY
+.	O
+The	O
+choice	O
+of	O
+staffing	O
+level	O
+over	O
+any	O
+particular	O
+time	O
+period	O
+-LRB-	O
+e.g.	O
+,	O
+Monday	O
+from	O
+8	O
+am-9	O
+am	O
+-RRB-	O
+relies	O
+on	O
+accurate	O
+arrival	B-KEY
+rate	I-KEY
+information	I-KEY
+.	O
+The	O
+usual	O
+method	O
+for	O
+identifying	O
+the	O
+arrival	O
+rate	O
+based	O
+on	O
+historical	O
+data	O
+can	O
+,	O
+in	O
+some	O
+cases	O
+,	O
+lead	O
+to	O
+considerable	O
+errors	O
+in	O
+performance	B-KEY
+estimates	I-KEY
+for	O
+a	O
+given	O
+staffing	O
+level	O
+.	O
+We	O
+explain	O
+why	O
+,	O
+identify	O
+three	O
+potential	O
+causes	O
+of	O
+the	O
+difficulty	O
+,	O
+and	O
+describe	O
+a	O
+method	O
+for	O
+detecting	O
+and	O
+addressing	O
+such	O
+a	O
+problem	O
+
+The	O
+road	O
+to	O
+recovery	B-KEY
+-LSB-	O
+disaster	B-KEY
+planning	I-KEY
+-RSB-	O
+September	O
+11	O
+stripped	O
+us	O
+of	O
+our	O
+innocence	O
+,	O
+forcing	O
+corporations	O
+to	O
+recognize	O
+that	O
+disaster	B-KEY
+planning	I-KEY
+is	O
+a	O
+business	O
+necessity	O
+
+Disappointment	O
+reigns	O
+-LSB-	O
+retail	B-KEY
+IT	O
+-RSB-	O
+CPFR	O
+remains	O
+at	O
+the	O
+forefront	O
+of	O
+CIOs	B-KEY
+'	O
+minds	O
+,	O
+but	O
+a	O
+number	O
+of	O
+barriers	O
+,	O
+such	O
+as	O
+secretive	O
+corporate	O
+cultures	O
+and	O
+spotty	O
+data	O
+integrity	O
+,	O
+stand	O
+between	O
+retail	B-KEY
+organizations	O
+and	O
+true	O
+supply-chain	O
+collaboration	O
+.	O
+CIOs	B-KEY
+remain	O
+vexed	O
+at	O
+these	O
+obstacles	O
+,	O
+as	O
+was	O
+evidenced	O
+at	O
+a	O
+roundtable	O
+discussion	O
+by	O
+retail	B-KEY
+and	O
+consumer-goods	O
+IT	O
+leaders	O
+at	O
+the	O
+Retail	B-KEY
+Systems	O
+2002	O
+conference	O
+,	O
+held	O
+in	O
+Chicago	O
+by	O
+the	O
+consultancy	O
+MoonWatch	O
+Media	O
+Inc.	O
+,	O
+Newton	O
+Upper	O
+Falls	O
+,	O
+Mass.	O
+.	O
+Other	O
+annoyances	O
+discussed	O
+by	O
+retail	B-KEY
+CIOs	B-KEY
+include	O
+poorly	O
+designed	O
+business	O
+processes	O
+and	O
+retail	B-KEY
+'s	O
+poor	O
+image	O
+with	O
+the	O
+IT	O
+talent	O
+emerging	O
+from	O
+school	O
+into	O
+the	O
+job	O
+market	O
+
+Dueling	O
+platforms	O
+-LSB-	O
+healthcare	O
+network	B-KEY
+servers	I-KEY
+-RSB-	O
+Many	O
+large	O
+hospitals	O
+and	O
+healthcare	O
+systems	O
+have	O
+grown	O
+accustomed	O
+to	O
+the	O
+reliability	O
+of	O
+mainframe	O
+architecture	O
+,	O
+although	O
+tighter	O
+operating	O
+budgets	O
+,	O
+coupled	O
+with	O
+advances	O
+in	O
+client/server	O
+technology	O
+,	O
+have	O
+led	O
+to	O
+more	O
+office	O
+and	O
+clinical	O
+applications	O
+being	O
+moved	O
+off	O
+mainframes	O
+.	O
+But	O
+Evanston	B-KEY
+Northwestern	I-KEY
+Healthcare	I-KEY
+was	O
+n't	O
+ready	O
+to	O
+get	O
+rid	O
+of	O
+its	O
+IBM	B-KEY
+OS	I-KEY
+390	I-KEY
+mainframe	I-KEY
+just	O
+yet	O
+.	O
+While	O
+a	O
+number	O
+of	O
+new	O
+clinical	O
+applications	O
+are	O
+being	O
+installed	O
+on	O
+two	O
+brand	O
+new	O
+IBM	O
+servers	O
+,	O
+Evanston	B-KEY
+Northwestern	I-KEY
+Healthcare	I-KEY
+will	O
+retain	O
+its	O
+favored	O
+hospital	O
+billing	O
+system	O
+and	O
+let	O
+it	O
+reside	O
+on	O
+the	O
+organization	O
+'s	O
+mainframe	O
+,	O
+as	O
+it	O
+has	O
+since	O
+1982	O
+
+On	O
+the	O
+design	O
+of	O
+gain-scheduled	O
+trajectory	O
+tracking	O
+controllers	O
+-LSB-	O
+AUV	O
+application	O
+-RSB-	O
+A	O
+new	O
+methodology	O
+is	O
+proposed	O
+for	O
+the	O
+design	O
+of	O
+trajectory	O
+tracking	O
+controllers	O
+for	O
+autonomous	B-KEY
+vehicles	I-KEY
+.	O
+The	O
+design	O
+technique	O
+builds	O
+on	O
+gain	B-KEY
+scheduling	I-KEY
+control	I-KEY
+theory	I-KEY
+.	O
+An	O
+application	O
+is	O
+made	O
+to	O
+the	O
+design	O
+of	O
+a	O
+trajectory	O
+tracking	O
+controller	O
+for	O
+a	O
+prototype	O
+autonomous	B-KEY
+underwater	I-KEY
+vehicle	I-KEY
+-LRB-	O
+AUV	O
+-RRB-	O
+.	O
+The	O
+effectiveness	O
+and	O
+advantages	O
+of	O
+the	O
+new	O
+control	B-KEY
+laws	I-KEY
+derived	O
+are	O
+illustrated	O
+in	O
+simulation	O
+using	O
+a	O
+full	O
+set	O
+of	O
+non-linear	O
+equations	O
+of	O
+motion	O
+of	O
+the	O
+vehicle	O
+
+An	O
+active	B-KEY
+functionality	I-KEY
+service	I-KEY
+for	O
+e-business	B-KEY
+applications	I-KEY
+Service	O
+based	O
+architectures	O
+are	O
+a	O
+powerful	O
+approach	O
+to	O
+meet	O
+the	O
+fast	O
+evolution	O
+of	O
+business	B-KEY
+rules	I-KEY
+and	O
+the	O
+corresponding	O
+software	B-KEY
+.	O
+An	O
+active	B-KEY
+functionality	I-KEY
+service	I-KEY
+that	O
+detects	O
+events	O
+and	O
+involves	O
+the	O
+appropriate	O
+business	B-KEY
+rules	I-KEY
+is	O
+a	O
+critical	O
+component	O
+of	O
+such	O
+a	O
+service-based	B-KEY
+middleware	I-KEY
+architecture	I-KEY
+.	O
+In	O
+this	O
+paper	O
+we	O
+present	O
+an	O
+active	B-KEY
+functionality	I-KEY
+service	I-KEY
+that	O
+is	O
+capable	O
+of	O
+detecting	O
+events	O
+in	O
+heterogeneous	B-KEY
+environments	I-KEY
+,	O
+it	O
+uses	O
+an	O
+integral	O
+ontology-based	O
+approach	O
+for	O
+the	O
+semantic	B-KEY
+interpretation	I-KEY
+of	O
+heterogeneous	O
+events	O
+and	O
+data	O
+,	O
+and	O
+provides	O
+notifications	O
+through	O
+a	O
+publish/subscribe	B-KEY
+notification	I-KEY
+mechanism	I-KEY
+.	O
+The	O
+power	O
+of	O
+this	O
+approach	O
+is	O
+illustrated	O
+with	O
+the	O
+help	O
+of	O
+an	O
+auction	B-KEY
+application	I-KEY
+and	O
+through	O
+the	O
+personalization	O
+of	O
+car	O
+and	O
+driver	O
+portals	O
+in	O
+Internet-enabled	B-KEY
+vehicles	I-KEY
+
+Steady-state	B-KEY
+mean-square	I-KEY
+error	I-KEY
+analysis	I-KEY
+of	O
+the	O
+cross-correlation	B-KEY
+and	O
+constant	B-KEY
+modulus	I-KEY
+algorithm	I-KEY
+in	O
+a	O
+MIMO	B-KEY
+convolutive	I-KEY
+system	I-KEY
+The	O
+cross-correlation	B-KEY
+and	O
+constant	B-KEY
+modulus	I-KEY
+algorithm	I-KEY
+-LRB-	O
+CC-CMA	B-KEY
+-RRB-	O
+has	O
+been	O
+proven	O
+to	O
+be	O
+an	O
+effective	O
+approach	O
+in	O
+the	O
+problem	O
+of	O
+joint	B-KEY
+blind	I-KEY
+equalisation	I-KEY
+and	O
+source	B-KEY
+separation	I-KEY
+in	O
+a	O
+multi-input	O
+and	O
+multi-output	O
+system	O
+.	O
+In	O
+the	O
+paper	O
+,	O
+the	O
+steady-state	O
+mean-square	O
+error	O
+performance	O
+of	O
+CC-CMA	B-KEY
+in	O
+a	O
+noise-free	B-KEY
+environment	I-KEY
+is	O
+studied	O
+,	O
+and	O
+a	O
+new	O
+expression	O
+is	O
+derived	O
+based	O
+on	O
+the	O
+energy	B-KEY
+preservation	I-KEY
+approach	I-KEY
+of	O
+Mai	O
+and	O
+Sayed	O
+-LRB-	O
+2000	O
+-RRB-	O
+.	O
+Simulation	O
+studies	O
+are	O
+undertaken	O
+to	O
+support	O
+the	O
+analysis	O
+
+48	O
+Gbit/s	O
+InP	O
+DHBT	O
+MS-DFF	O
+with	O
+very	O
+low	O
+time	O
+jitter	O
+A	O
+master-slave	B-KEY
+D-type	I-KEY
+flip-flop	I-KEY
+-LRB-	O
+MS	O
+DFF	O
+-RRB-	O
+fabricated	O
+in	O
+a	O
+self-aligned	O
+InP	B-KEY
+DHBT	O
+technology	O
+is	O
+presented	O
+.	O
+The	O
+packaged	B-KEY
+circuit	I-KEY
+shows	O
+full-rate	O
+clock	O
+operation	O
+at	O
+48	O
+Gbit/s	O
+.	O
+Very	O
+low	B-KEY
+time	I-KEY
+jitter	I-KEY
+and	O
+good	O
+retiming	B-KEY
+capabilities	I-KEY
+are	O
+observed	O
+.	O
+Layout	B-KEY
+aspects	I-KEY
+,	O
+packaging	O
+and	O
+measurement	O
+issues	O
+are	O
+discussed	O
+in	O
+particular	O
+
+Job	B-KEY
+rotation	I-KEY
+in	O
+an	O
+academic	B-KEY
+library	I-KEY
+:	O
+damned	O
+if	O
+you	O
+do	O
+and	O
+damned	O
+if	O
+you	O
+do	O
+n't	O
+!	O
+This	O
+article	O
+considers	O
+job	O
+rotation-the	O
+systematic	O
+movement	O
+of	O
+employees	O
+from	O
+one	O
+job	O
+to	O
+another-as	O
+one	O
+of	O
+the	O
+many	O
+tools	O
+within	O
+the	O
+organizational	B-KEY
+development	I-KEY
+tool	O
+kit	O
+.	O
+There	O
+is	O
+a	O
+brief	O
+consideration	O
+of	O
+useful	O
+print	O
+and	O
+Internet	O
+literature	O
+on	O
+the	O
+subject	O
+as	O
+well	O
+as	O
+a	O
+discussion	O
+of	O
+the	O
+pros	O
+and	O
+cons	O
+of	O
+job	B-KEY
+rotation	I-KEY
+.	O
+The	O
+application	O
+of	O
+job	B-KEY
+rotation	I-KEY
+methods	O
+in	O
+Ryerson	B-KEY
+University	I-KEY
+Library	I-KEY
+,	O
+a	O
+small	O
+academic	B-KEY
+library	I-KEY
+,	O
+concludes	O
+the	O
+article	O
+in	O
+order	O
+to	O
+illustrate	O
+process	O
+and	O
+insights	O
+through	O
+example	O
+
+A	O
+linear	B-KEY
+time	I-KEY
+algorithm	I-KEY
+for	O
+recognizing	O
+regular	B-KEY
+Boolean	I-KEY
+functions	I-KEY
+A	O
+positive	O
+-LRB-	O
+or	O
+monotone	O
+-RRB-	O
+Boolean	O
+function	O
+is	O
+regular	O
+if	O
+its	O
+variables	O
+are	O
+naturally	O
+ordered	O
+,	O
+left	O
+to	O
+fight	O
+,	O
+by	O
+decreasing	O
+strength	O
+,	O
+so	O
+that	O
+shifting	O
+the	O
+nonzero	B-KEY
+component	I-KEY
+of	O
+any	O
+true	B-KEY
+vector	I-KEY
+to	O
+the	O
+left	O
+always	O
+yields	O
+another	O
+true	B-KEY
+vector	I-KEY
+.	O
+This	O
+paper	O
+considers	O
+the	O
+problem	O
+of	O
+recognizing	O
+whether	O
+a	O
+positive	B-KEY
+function	I-KEY
+f	O
+is	O
+regular	O
+,	O
+where	O
+f	O
+is	O
+given	O
+by	O
+min	O
+T	O
+-LRB-	O
+f	O
+-RRB-	O
+-LRB-	O
+the	O
+set	O
+of	O
+all	O
+minimal	O
+true	B-KEY
+vectors	I-KEY
+of	O
+f	O
+-RRB-	O
+.	O
+We	O
+propose	O
+a	O
+simple	O
+linear	O
+time	O
+-LRB-	O
+i.e.	O
+,	O
+O	O
+-LRB-	O
+n	O
+|	O
+min	O
+T	O
+-LRB-	O
+f	O
+-RRB-	O
+|	O
+-RRB-	O
+-	O
+time	O
+-RRB-	O
+algorithm	O
+for	O
+it	O
+.	O
+This	O
+improves	O
+upon	O
+the	O
+previous	O
+algorithm	O
+by	O
+J.S.	O
+Provan	O
+and	O
+M.O.	O
+Ball	O
+-LRB-	O
+1988	O
+-RRB-	O
+which	O
+requires	O
+O	O
+-LRB-	O
+n/sup	O
+2	O
+/	O
+|	O
+min	O
+T	O
+-LRB-	O
+f	O
+-RRB-	O
+|	O
+-RRB-	O
+time	O
+.	O
+As	O
+a	O
+corollary	O
+,	O
+we	O
+also	O
+present	O
+an	O
+O	O
+-LRB-	O
+n	O
+-LRB-	O
+n	O
++	O
+|	O
+min	O
+T	O
+-LRB-	O
+f	O
+-RRB-	O
+|	O
+-RRB-	O
+-RRB-	O
+-	O
+time	O
+algorithm	O
+for	O
+the	O
+recognition	O
+problem	O
+of	O
+2-monotonic	B-KEY
+functions	I-KEY
+
+Self-validating	B-KEY
+integration	I-KEY
+and	O
+approximation	O
+of	O
+piecewise	B-KEY
+analytic	I-KEY
+functions	I-KEY
+Let	O
+an	O
+analytic	O
+or	O
+a	O
+piecewise	B-KEY
+analytic	I-KEY
+function	I-KEY
+on	O
+a	O
+compact	B-KEY
+interval	I-KEY
+be	O
+given	O
+.	O
+We	O
+present	O
+algorithms	O
+that	O
+produce	O
+enclosures	B-KEY
+for	O
+the	O
+integral	O
+or	O
+the	O
+function	O
+itself	O
+.	O
+Under	O
+certain	O
+conditions	O
+on	O
+the	O
+representation	O
+of	O
+the	O
+function	O
+,	O
+this	O
+is	O
+done	O
+with	O
+the	O
+minimal	B-KEY
+order	I-KEY
+of	O
+numbers	O
+of	O
+operations	O
+.	O
+The	O
+integration	B-KEY
+algorithm	I-KEY
+is	O
+implemented	O
+and	O
+numerical	O
+comparisons	O
+to	O
+non-validating	O
+integration	O
+software	O
+are	O
+presented	O
+
+Spatial	O
+solutions	O
+-LSB-	O
+office	B-KEY
+furniture	I-KEY
+-RSB-	O
+Take	O
+the	O
+stress	O
+out	O
+of	O
+the	O
+office	O
+by	O
+considering	O
+the	O
+design	O
+of	O
+furniture	O
+and	O
+staff	B-KEY
+needs	I-KEY
+,	O
+before	O
+major	O
+buying	B-KEY
+decisions	I-KEY
+
+On	O
+the	O
+relationship	O
+between	O
+omega	O
+-	O
+automata	O
+and	O
+temporal	B-KEY
+logic	I-KEY
+normal	I-KEY
+forms	I-KEY
+We	O
+consider	O
+the	O
+relationship	O
+between	O
+omega	O
+-	O
+automata	O
+and	O
+a	O
+specific	O
+logical	B-KEY
+formulation	I-KEY
+based	O
+on	O
+a	O
+normal	O
+form	O
+for	O
+temporal	O
+logic	O
+formulae	O
+.	O
+While	O
+this	O
+normal	O
+form	O
+was	O
+developed	O
+for	O
+use	O
+with	O
+execution	O
+and	O
+clausal	B-KEY
+resolution	I-KEY
+in	O
+temporal	O
+logics	O
+,	O
+we	O
+show	O
+how	O
+it	O
+can	O
+represent	O
+,	O
+syntactically	O
+,	O
+omega	O
+-	O
+automata	O
+in	O
+a	O
+high-level	O
+way	O
+.	O
+Technical	O
+proofs	O
+of	O
+the	O
+correctness	O
+of	O
+this	O
+representation	O
+are	O
+given	O
+
+Connection	B-KEY
+management	I-KEY
+for	O
+QoS	O
+service	O
+on	O
+the	O
+Web	O
+The	O
+current	O
+Web	B-KEY
+service	I-KEY
+model	I-KEY
+treats	O
+all	O
+requests	O
+equivalently	O
+,	O
+both	O
+while	O
+being	O
+processed	O
+by	O
+servers	O
+and	O
+while	O
+being	O
+transmitted	O
+over	O
+the	O
+network	O
+.	O
+For	O
+some	O
+uses	O
+,	O
+such	O
+as	O
+multiple	O
+priority	O
+schemes	O
+,	O
+different	O
+levels	O
+of	O
+service	O
+are	O
+desirable	O
+.	O
+We	O
+propose	O
+application-level	O
+TCP	B-KEY
+connection	I-KEY
+management	O
+mechanisms	O
+for	O
+Web	O
+servers	O
+to	O
+provide	O
+two	O
+different	O
+levels	O
+of	O
+Web	O
+service	O
+,	O
+high	O
+and	O
+low	O
+service	O
+,	O
+by	O
+setting	O
+different	O
+time-outs	O
+for	O
+inactive	O
+TCP	O
+connections	O
+.	O
+We	O
+evaluated	O
+the	O
+performance	O
+of	O
+the	O
+mechanism	O
+under	O
+heavy	O
+and	O
+light	O
+loading	O
+conditions	O
+on	O
+the	O
+Web	O
+server	O
+.	O
+Our	O
+experiments	O
+show	O
+that	O
+,	O
+though	O
+heavy	O
+traffic	O
+saturates	O
+the	O
+network	O
+,	O
+high	O
+level	O
+class	O
+performance	O
+is	O
+improved	O
+by	O
+as	O
+much	O
+as	O
+25-28	O
+%	O
+.	O
+Therefore	O
+,	O
+this	O
+mechanism	O
+can	O
+effectively	O
+provide	O
+QoS	O
+guaranteed	O
+services	O
+even	O
+in	O
+the	O
+absence	O
+of	O
+operating	O
+system	O
+and	O
+network	O
+supports	O
+
+Towards	O
+the	O
+globalisation	B-KEY
+of	O
+the	O
+IS/IT	B-KEY
+function	I-KEY
+The	O
+IS/IT	B-KEY
+function	I-KEY
+has	O
+recently	O
+emerged	O
+from	O
+the	O
+peripheral	O
+aspects	O
+of	O
+the	O
+finance	O
+department	O
+to	O
+the	O
+centre	O
+of	O
+critical	O
+organisational	O
+change	O
+.	O
+There	O
+is	O
+an	O
+increasing	O
+dependency	O
+on	O
+its	O
+activities	O
+as	O
+systems	O
+extend	O
+beyond	O
+supporting	O
+the	O
+internal	O
+efficiency	O
+of	O
+the	O
+organisation	O
+to	O
+augmenting	O
+global	O
+performance	O
+.	O
+The	O
+growth	O
+of	O
+wide	O
+and	O
+local	O
+networks	O
+has	O
+resulted	O
+in	O
+communication	O
+possibilities	O
+that	O
+were	O
+not	O
+possible	O
+a	O
+few	O
+years	O
+ago	O
+.	O
+E-commerce	B-KEY
+challenges	O
+the	O
+achievements	O
+of	O
+the	O
+IS/IT	B-KEY
+function	I-KEY
+and	O
+is	O
+very	O
+prominent	O
+in	O
+the	O
+globalisation	B-KEY
+of	O
+modern	O
+organisations	O
+.	O
+The	O
+complexity	O
+and	O
+diversity	O
+of	O
+electronic	B-KEY
+exchange	I-KEY
+is	O
+also	O
+well	O
+documented	O
+-LRB-	O
+Hackney	O
+et	O
+al.	O
+,	O
+2000	O
+-RRB-	O
+.	O
+This	O
+has	O
+a	O
+number	O
+of	O
+impacts	O
+on	O
+the	O
+development	O
+and	O
+implementation	O
+of	O
+IS/IT	O
+solutions	O
+for	O
+organisations	O
+involved	O
+in	O
+international	B-KEY
+trade	I-KEY
+.	O
+It	O
+is	O
+a	O
+conjecture	O
+that	O
+the	O
+IS/IT	B-KEY
+function	I-KEY
+is	O
+critically	O
+important	O
+for	O
+the	O
+alignment	O
+of	O
+the	O
+business	O
+to	O
+meet	O
+the	O
+demands	O
+of	O
+global	O
+competition	O
+,	O
+through	O
+building	O
+internal	B-KEY
+marketing	I-KEY
+strategies	I-KEY
+and	O
+creating	O
+knowledge	B-KEY
+based	I-KEY
+communities	I-KEY
+.	O
+There	O
+is	O
+clear	O
+evidence	O
+that	O
+IS/IT	O
+can	O
+lead	O
+to	O
+improved	O
+business	O
+performance	O
+and	O
+potentially	O
+for	O
+sustained	O
+competitive	O
+advantage	O
+.	O
+This	O
+is	O
+obviously	O
+true	O
+through	O
+the	O
+advent	O
+of	O
+new	O
+and	O
+emerging	O
+technologies	O
+such	O
+as	O
+the	O
+Internet	B-KEY
+
+To	O
+commit	O
+or	O
+not	O
+to	O
+commit	O
+:	O
+modeling	O
+agent	O
+conversations	O
+for	O
+action	O
+Conversations	O
+are	O
+sequences	O
+of	O
+messages	O
+exchanged	O
+among	O
+interacting	B-KEY
+agents	I-KEY
+.	O
+For	O
+conversations	O
+to	O
+be	O
+meaningful	O
+,	O
+agents	O
+ought	O
+to	O
+follow	O
+commonly	O
+known	O
+specifications	B-KEY
+limiting	O
+the	O
+types	O
+of	O
+messages	O
+that	O
+can	O
+be	O
+exchanged	O
+at	O
+any	O
+point	O
+in	O
+the	O
+conversation	O
+.	O
+These	O
+specifications	B-KEY
+are	O
+usually	O
+implemented	O
+using	O
+conversation	O
+policies	O
+-LRB-	O
+which	O
+are	O
+rules	B-KEY
+of	I-KEY
+inference	I-KEY
+-RRB-	O
+or	O
+conversation	B-KEY
+protocols	I-KEY
+-LRB-	O
+which	O
+are	O
+predefined	O
+conversation	B-KEY
+templates	I-KEY
+-RRB-	O
+.	O
+In	O
+this	O
+article	O
+we	O
+present	O
+a	O
+semantic	O
+model	O
+for	O
+specifying	O
+conversations	O
+using	O
+conversation	O
+policies	O
+.	O
+This	O
+model	O
+is	O
+based	O
+on	O
+the	O
+principles	O
+that	O
+the	O
+negotiation	O
+and	O
+uptake	O
+of	O
+shared	O
+social	B-KEY
+commitments	I-KEY
+entail	O
+the	O
+adoption	O
+of	O
+obligations	O
+to	O
+action	O
+,	O
+which	O
+indicate	O
+the	O
+actions	O
+that	O
+agents	O
+have	O
+agreed	O
+to	O
+perform	O
+.	O
+In	O
+the	O
+same	O
+way	O
+,	O
+obligations	O
+are	O
+retracted	O
+based	O
+on	O
+the	O
+negotiation	O
+to	O
+discharge	O
+their	O
+corresponding	O
+shared	O
+social	B-KEY
+commitments	I-KEY
+.	O
+Based	O
+on	O
+these	O
+principles	O
+,	O
+conversations	O
+are	O
+specified	O
+as	O
+interaction	O
+specifications	B-KEY
+that	O
+model	O
+the	O
+ideal	O
+sequencing	O
+of	O
+agent	O
+participations	O
+negotiating	O
+the	O
+execution	O
+of	O
+actions	O
+in	O
+a	O
+joint	O
+activity	O
+.	O
+These	O
+specifications	B-KEY
+not	O
+only	O
+specify	O
+the	O
+adoption	O
+and	O
+discharge	O
+of	O
+shared	O
+commitments	O
+and	O
+obligations	O
+during	O
+an	O
+activity	O
+,	O
+but	O
+also	O
+indicate	O
+the	O
+commitments	O
+and	O
+obligations	O
+that	O
+are	O
+required	O
+-LRB-	O
+as	O
+preconditions	O
+-RRB-	O
+or	O
+that	O
+outlive	O
+a	O
+joint	O
+activity	O
+-LRB-	O
+as	O
+postconditions	O
+-RRB-	O
+.	O
+We	O
+model	O
+the	O
+Contract	O
+Net	O
+Protocol	O
+as	O
+an	O
+example	O
+of	O
+the	O
+specification	B-KEY
+of	O
+conversations	O
+in	O
+a	O
+joint	O
+activity	O
+
+Control	B-KEY
+performance	I-KEY
+with	O
+three	O
+translational	O
+degrees	O
+of	O
+freedom	O
+For	O
+multiple	O
+degree-of-freedom	O
+-LRB-	O
+DOF	O
+-RRB-	O
+systems	O
+,	O
+it	O
+is	O
+important	O
+to	O
+determine	O
+how	O
+accurately	O
+operators	O
+can	O
+control	O
+each	O
+DOF	O
+and	O
+what	O
+influence	O
+perceptual	O
+,	O
+information	O
+processing	O
+,	O
+and	O
+psychomotor	O
+components	O
+have	O
+on	O
+performance	O
+.	O
+Sixteen	O
+right-handed	O
+male	O
+students	O
+participated	O
+in	O
+2	O
+experiments	O
+:	O
+1	O
+involving	O
+positioning	B-KEY
+and	O
+1	O
+involving	O
+tracking	B-KEY
+with	O
+3	O
+translational	O
+DOFs	O
+.	O
+To	O
+separate	O
+perceptual	O
+and	O
+psychomotor	B-KEY
+effects	I-KEY
+,	O
+we	O
+used	O
+2	O
+control-display	O
+mappings	O
+that	O
+differed	O
+in	O
+the	O
+coupling	O
+of	O
+vertical	O
+and	O
+depth	O
+dimensions	O
+to	O
+the	O
+up-down	O
+and	O
+fore-aft	O
+control	O
+axes	O
+.	O
+We	O
+observed	O
+information	O
+processing	O
+effects	O
+in	O
+the	O
+positioning	B-KEY
+task	O
+:	O
+Initial	B-KEY
+error	I-KEY
+correction	I-KEY
+on	O
+the	O
+vertical	O
+dimension	O
+lagged	O
+in	O
+time	O
+behind	O
+the	O
+horizontal	O
+dimension	O
+.	O
+The	O
+depth	B-KEY
+dimension	I-KEY
+error	I-KEY
+correction	I-KEY
+lagged	O
+behind	O
+both	O
+,	O
+which	O
+was	O
+ascribed	O
+to	O
+the	O
+poorer	O
+perceptual	O
+information	O
+.	O
+We	O
+observed	O
+this	O
+perceptual	B-KEY
+effect	I-KEY
+also	O
+in	O
+the	O
+tracking	B-KEY
+experiment	O
+.	O
+Motor	O
+effects	O
+were	O
+also	O
+present	O
+,	O
+with	O
+tracking	B-KEY
+errors	O
+along	O
+the	O
+up-down	O
+axis	O
+of	O
+the	O
+hand	O
+controller	O
+being	O
+1.1	O
+times	O
+larger	O
+than	O
+along	O
+the	O
+fore-aft	O
+axis	O
+.	O
+These	O
+results	O
+indicate	O
+that	O
+all	O
+3	O
+components	O
+contribute	O
+to	O
+control	B-KEY
+performance	I-KEY
+.	O
+Actual	O
+applications	O
+of	O
+this	O
+research	O
+include	O
+interface	B-KEY
+design	I-KEY
+
+A	O
+phytography	B-KEY
+of	O
+WALDMEISTER	B-KEY
+The	O
+architecture	O
+of	O
+the	O
+WALDMEISTER	B-KEY
+prover	O
+for	O
+unit	B-KEY
+equational	I-KEY
+deduction	I-KEY
+is	O
+based	O
+on	O
+a	O
+strict	O
+separation	O
+of	O
+active	O
+and	O
+passive	B-KEY
+facts	I-KEY
+.	O
+After	O
+an	O
+inspection	O
+of	O
+the	O
+system	O
+'s	O
+proof	O
+procedure	O
+,	O
+the	O
+representation	O
+of	O
+each	O
+of	O
+the	O
+central	O
+data	B-KEY
+structures	I-KEY
+is	O
+outlined	O
+,	O
+namely	O
+indexing	B-KEY
+for	O
+the	O
+active	B-KEY
+facts	I-KEY
+,	O
+compression	O
+for	O
+the	O
+passive	B-KEY
+facts	I-KEY
+,	O
+successor	O
+sets	O
+for	O
+the	O
+hypotheses	B-KEY
+,	O
+and	O
+minimal	O
+recording	O
+of	O
+inference	B-KEY
+steps	O
+for	O
+the	O
+proof	O
+object	O
+.	O
+In	O
+order	O
+to	O
+cope	O
+with	O
+large	B-KEY
+search	I-KEY
+spaces	I-KEY
+,	O
+specialized	O
+redundancy	B-KEY
+criteria	O
+are	O
+employed	O
+,	O
+and	O
+the	O
+empirically	O
+gained	O
+control	O
+knowledge	O
+is	O
+integrated	O
+to	O
+ease	O
+the	O
+use	O
+of	O
+the	O
+system	O
+.	O
+The	O
+paper	O
+concludes	O
+with	O
+a	O
+quantitative	O
+comparison	O
+of	O
+the	O
+WALDMEISTER	B-KEY
+versions	O
+over	O
+the	O
+years	O
+,	O
+and	O
+a	O
+view	O
+of	O
+the	O
+future	B-KEY
+prospects	I-KEY
+
+Uniform	B-KEY
+hyperbolic	I-KEY
+polynomial	I-KEY
+B-spline	I-KEY
+curves	I-KEY
+This	O
+paper	O
+presents	O
+a	O
+new	O
+kind	O
+of	O
+uniform	O
+splines	O
+,	O
+called	O
+hyperbolic	O
+polynomial	O
+B-splines	O
+,	O
+generated	O
+over	O
+the	O
+space	O
+Omega	O
+=	O
+span	O
+-LCB-	O
+sinh	O
+t	O
+,	O
+cosh	O
+t	O
+,	O
+t/sup	O
+k-3	O
+/	O
+,	O
+t/sup	O
+k-3	O
+/	O
+,	O
+t/sup	O
+k-4	O
+/	O
+,	O
+...	O
+,	O
+t	O
+1	O
+-RCB-	O
+in	O
+which	O
+k	O
+is	O
+an	O
+arbitrary	B-KEY
+integer	I-KEY
+larger	O
+than	O
+or	O
+equal	O
+to	O
+3	O
+.	O
+Hyperbolic	O
+polynomial	O
+B-splines	O
+share	O
+most	O
+of	O
+the	O
+properties	O
+of	O
+B-splines	O
+in	O
+polynomial	O
+space	O
+.	O
+We	O
+give	O
+subdivision	B-KEY
+formulae	O
+for	O
+this	O
+new	O
+kind	O
+of	O
+curve	O
+and	O
+then	O
+prove	O
+that	O
+they	O
+have	O
+variation	O
+diminishing	O
+properties	O
+and	O
+the	O
+control	O
+polygons	O
+of	O
+the	O
+subdivisions	O
+converge	O
+.	O
+Hyperbolic	O
+polynomial	O
+B-splines	O
+can	O
+handle	O
+freeform	B-KEY
+curves	I-KEY
+as	O
+well	O
+as	O
+remarkable	O
+curves	O
+such	O
+as	O
+the	O
+hyperbola	B-KEY
+and	O
+the	O
+catenary	B-KEY
+.	O
+The	O
+generation	O
+of	O
+tensor	O
+product	O
+surfaces	O
+using	O
+these	O
+new	O
+splines	O
+is	O
+straightforward	O
+.	O
+Examples	O
+of	O
+such	O
+tensor	O
+product	O
+surfaces	O
+:	O
+the	O
+saddle	B-KEY
+surface	I-KEY
+,	O
+the	O
+catenary	B-KEY
+cylinder	O
+,	O
+and	O
+a	O
+certain	O
+kind	O
+of	O
+ruled	O
+surface	O
+are	O
+given	O
+
+P	B-KEY
+systems	I-KEY
+with	O
+symport/antiport	O
+rules	O
+:	O
+the	O
+traces	O
+of	O
+objects	O
+We	O
+continue	O
+the	O
+study	O
+of	O
+those	O
+P	B-KEY
+systems	I-KEY
+where	O
+the	O
+computation	O
+is	O
+performed	O
+by	O
+the	O
+communication	O
+of	O
+objects	O
+,	O
+that	O
+is	O
+,	O
+systems	O
+with	O
+symport	O
+and	O
+antiport	B-KEY
+rules	I-KEY
+.	O
+Instead	O
+of	O
+the	O
+-LRB-	O
+number	O
+of	O
+-RRB-	O
+objects	O
+collected	O
+in	O
+a	O
+specified	O
+membrane	O
+,	O
+as	O
+the	O
+result	O
+of	O
+a	O
+computation	O
+we	O
+consider	O
+the	O
+itineraries	B-KEY
+of	O
+a	O
+certain	O
+object	O
+through	O
+membranes	O
+,	O
+during	O
+a	O
+halting	B-KEY
+computation	I-KEY
+,	O
+written	O
+as	O
+a	O
+coding	O
+of	O
+the	O
+string	O
+of	O
+labels	O
+of	O
+the	O
+visited	O
+membranes	O
+.	O
+The	O
+family	O
+of	O
+languages	B-KEY
+generated	O
+in	O
+this	O
+way	O
+is	O
+investigated	O
+with	O
+respect	O
+to	O
+its	O
+place	O
+in	O
+the	O
+Chomsky	B-KEY
+hierarchy	I-KEY
+.	O
+When	O
+the	O
+-LRB-	O
+symport	O
+and	O
+antiport	O
+-RRB-	O
+rules	O
+are	O
+applied	O
+in	O
+a	O
+conditional	O
+manner	O
+,	O
+promoted	O
+or	O
+inhibited	O
+by	O
+certain	O
+objects	O
+which	O
+should	O
+be	O
+present	O
+in	O
+the	O
+membrane	O
+where	O
+a	O
+rule	O
+is	O
+applied	O
+,	O
+then	O
+a	O
+characterization	O
+of	O
+recursively	B-KEY
+enumerable	I-KEY
+languages	I-KEY
+is	O
+obtained	O
+;	O
+the	O
+power	O
+of	O
+systems	O
+with	O
+the	O
+rules	O
+applied	O
+freely	O
+is	O
+only	O
+partially	O
+described	O
+
+Modeling	O
+undesirable	O
+factors	O
+in	O
+efficiency	B-KEY
+evaluation	I-KEY
+Data	B-KEY
+envelopment	I-KEY
+analysis	I-KEY
+-LRB-	O
+DEA	O
+-RRB-	O
+measures	O
+the	O
+relative	O
+efficiency	O
+of	O
+decision	B-KEY
+making	I-KEY
+units	I-KEY
+-LRB-	O
+DMUs	O
+-RRB-	O
+with	O
+multiple	B-KEY
+performance	I-KEY
+factors	I-KEY
+which	O
+are	O
+grouped	O
+into	O
+outputs	O
+and	O
+inputs	O
+.	O
+Once	O
+the	O
+efficient	B-KEY
+frontier	I-KEY
+is	O
+determined	O
+,	O
+inefficient	O
+DMUs	O
+can	O
+improve	O
+their	O
+performance	O
+to	O
+reach	O
+the	O
+efficient	B-KEY
+frontier	I-KEY
+by	O
+either	O
+increasing	O
+their	O
+current	B-KEY
+output	I-KEY
+levels	I-KEY
+or	O
+decreasing	O
+their	O
+current	B-KEY
+input	I-KEY
+levels	I-KEY
+.	O
+However	O
+,	O
+both	O
+desirable	O
+-LRB-	O
+good	O
+-RRB-	O
+and	O
+undesirable	O
+-LRB-	O
+bad	O
+-RRB-	O
+factors	O
+may	O
+be	O
+present	O
+.	O
+For	O
+example	O
+,	O
+if	O
+inefficiency	O
+exists	O
+in	O
+production	B-KEY
+processes	I-KEY
+where	O
+final	O
+products	O
+are	O
+manufactured	O
+with	O
+a	O
+production	O
+of	O
+wastes	B-KEY
+and	O
+pollutants	B-KEY
+,	O
+the	O
+outputs	O
+of	O
+wastes	B-KEY
+and	O
+pollutants	B-KEY
+are	O
+undesirable	O
+and	O
+should	O
+be	O
+reduced	O
+to	O
+improve	O
+the	O
+performance	O
+.	O
+Using	O
+the	O
+classification	B-KEY
+invariance	I-KEY
+property	I-KEY
+,	O
+we	O
+show	O
+that	O
+the	O
+standard	O
+DEA	O
+model	O
+can	O
+be	O
+used	O
+to	O
+improve	O
+the	O
+performance	O
+via	O
+increasing	O
+the	O
+desirable	B-KEY
+outputs	I-KEY
+and	O
+decreasing	O
+the	O
+undesirable	B-KEY
+outputs	I-KEY
+.	O
+The	O
+method	O
+can	O
+also	O
+be	O
+applied	O
+to	O
+situations	O
+when	O
+some	O
+inputs	O
+need	O
+to	O
+be	O
+increased	O
+to	O
+improve	O
+the	O
+performance	O
+.	O
+The	O
+linearity	O
+and	O
+convexity	O
+of	O
+DEA	O
+are	O
+preserved	O
+through	O
+our	O
+proposal	O
+
+Parallel	B-KEY
+operation	I-KEY
+of	O
+capacity-limited	B-KEY
+three-phase	I-KEY
+four-wire	I-KEY
+active	I-KEY
+power	I-KEY
+filters	I-KEY
+Three-phase	O
+four-wire	O
+active	O
+power	O
+filters	O
+-LRB-	O
+APFs	O
+-RRB-	O
+are	O
+presented	O
+that	O
+can	O
+be	O
+paralleled	O
+to	O
+enlarge	O
+the	O
+system	O
+capacity	O
+and	O
+reliability	O
+.	O
+The	O
+APF	O
+employs	O
+the	O
+PWM	B-KEY
+four-leg	I-KEY
+voltage-source	I-KEY
+inverter	I-KEY
+.	O
+A	O
+decoupling	B-KEY
+control	I-KEY
+approach	I-KEY
+for	O
+the	O
+leg	O
+connected	O
+to	O
+the	O
+neutral	O
+line	O
+is	O
+proposed	O
+such	O
+that	O
+the	O
+switching	O
+of	O
+all	O
+legs	O
+has	O
+no	O
+interaction	O
+.	O
+Functions	O
+of	O
+the	O
+proposed	O
+APF	O
+include	O
+compensation	O
+of	O
+reactive	O
+power	O
+,	O
+harmonic	O
+current	O
+,	O
+unbalanced	O
+power	O
+and	O
+zero-sequence	O
+current	O
+of	O
+the	O
+load	O
+.	O
+The	O
+objective	O
+is	O
+to	O
+achieve	O
+unity	B-KEY
+power	I-KEY
+factor	I-KEY
+,	O
+balanced	B-KEY
+line	I-KEY
+current	I-KEY
+and	O
+zero	B-KEY
+neutral-line	I-KEY
+current	I-KEY
+.	O
+Compensation	O
+of	O
+all	O
+components	O
+is	O
+capacity-limited	O
+,	O
+co-operating	O
+with	O
+the	O
+cascaded	O
+load	O
+current	O
+sensing	O
+scheme	O
+.	O
+Multiple	O
+APFs	O
+can	O
+be	O
+paralleled	O
+to	O
+share	O
+the	O
+load	O
+power	O
+without	O
+requiring	O
+any	O
+control	O
+interconnection	O
+.	O
+In	O
+addition	O
+to	O
+providing	O
+the	O
+theoretic	O
+bases	O
+and	O
+detailed	O
+design	O
+of	O
+the	O
+APFs	O
+,	O
+two	O
+6	B-KEY
+kVA	I-KEY
+APFs	O
+are	O
+implemented	O
+.	O
+The	O
+effectiveness	O
+of	O
+the	O
+proposed	O
+method	O
+is	O
+validated	O
+with	O
+experimental	O
+results	O
+
+A	O
+decision	B-KEY
+support	I-KEY
+model	I-KEY
+for	O
+selecting	O
+product/service	B-KEY
+benefit	I-KEY
+positionings	I-KEY
+The	O
+art	O
+-LRB-	O
+and	O
+science	O
+-RRB-	O
+of	O
+successful	O
+product/service	O
+positioning	O
+generally	O
+hinges	O
+on	O
+the	O
+firm	O
+'s	O
+ability	O
+to	O
+select	O
+a	O
+set	O
+of	O
+attractively	B-KEY
+priced	I-KEY
+consumer	I-KEY
+benefits	I-KEY
+that	O
+are	O
+:	O
+valued	O
+by	O
+the	O
+buyer	O
+,	O
+distinctive	O
+in	O
+one	O
+or	O
+more	O
+respects	O
+,	O
+believable	O
+,	O
+deliverable	O
+,	O
+and	O
+sustainable	O
+-LRB-	O
+under	O
+actual	O
+or	O
+potential	O
+competitive	O
+abilities	O
+to	O
+imitate	O
+,	O
+neutralize	O
+,	O
+or	O
+overcome	O
+-RRB-	O
+in	O
+the	O
+target	O
+markets	O
+that	O
+the	O
+firm	O
+selects	O
+.	O
+For	O
+many	O
+years	O
+,	O
+the	O
+ubiquitous	O
+quadrant	B-KEY
+chart	I-KEY
+has	O
+been	O
+used	O
+to	O
+provide	O
+a	O
+simple	B-KEY
+graph	I-KEY
+of	O
+product/service	O
+benefits	O
+-LRB-	O
+usually	O
+called	O
+product/service	B-KEY
+attributes	I-KEY
+-RRB-	O
+described	O
+in	O
+terms	O
+of	O
+consumers	O
+'	O
+perceptions	O
+of	O
+the	O
+importance	O
+of	O
+attributes	O
+-LRB-	O
+to	O
+brand/supplier	B-KEY
+choice	I-KEY
+-RRB-	O
+and	O
+the	O
+performance	O
+of	O
+competing	O
+firms	O
+on	O
+these	O
+attributes	O
+.	O
+This	O
+paper	O
+describes	O
+a	O
+model	O
+that	O
+extends	O
+the	O
+quadrant	B-KEY
+chart	I-KEY
+concept	O
+to	O
+a	O
+decision	O
+support	O
+system	O
+that	O
+optimizes	O
+a	O
+firm	O
+'s	O
+market	O
+share	O
+for	O
+a	O
+specified	O
+product/service	O
+.	O
+In	O
+particular	O
+,	O
+we	O
+describe	O
+a	O
+decision	B-KEY
+support	I-KEY
+model	I-KEY
+that	O
+utilizes	O
+relatively	O
+simple	O
+marketing	B-KEY
+research	I-KEY
+data	I-KEY
+on	O
+consumers	O
+'	O
+judged	O
+benefit	O
+importances	O
+,	O
+and	O
+supplier	O
+performances	O
+on	O
+these	O
+benefits	O
+to	O
+develop	O
+message	B-KEY
+components	I-KEY
+for	O
+specified	O
+target	O
+buyers	O
+.	O
+A	O
+case	O
+study	O
+is	O
+used	O
+to	O
+illustrate	O
+the	O
+model	O
+.	O
+The	O
+study	O
+deals	O
+with	O
+developing	O
+advertising	B-KEY
+message	O
+components	O
+for	O
+a	O
+relatively	O
+new	O
+entrant	O
+in	O
+the	O
+US	O
+air	O
+shipping	O
+market	O
+.	O
+We	O
+also	O
+discuss	O
+,	O
+more	O
+briefly	O
+,	O
+management	B-KEY
+reactions	I-KEY
+to	O
+application	O
+of	O
+the	O
+model	O
+to	O
+date	O
+,	O
+and	O
+areas	O
+for	O
+further	O
+research	O
+and	O
+model	O
+extension	O
+
+Becoming	O
+a	O
+chief	B-KEY
+librarian	I-KEY
+:	O
+an	O
+analysis	O
+of	O
+transition	B-KEY
+stages	I-KEY
+in	O
+academic	B-KEY
+library	I-KEY
+leadership	I-KEY
+The	O
+author	O
+explores	O
+how	O
+the	O
+four-part	O
+model	O
+of	O
+transition	O
+cycles	O
+identified	O
+by	O
+Nicholson	O
+and	O
+West	O
+-LRB-	O
+1988	O
+-RRB-	O
+applies	O
+to	O
+becoming	O
+a	O
+chief	B-KEY
+librarian	I-KEY
+of	O
+an	O
+academic	O
+library	O
+.	O
+The	O
+four	O
+stages	O
+:	O
+preparation	O
+,	O
+encounter	O
+,	O
+adjustment	O
+,	O
+and	O
+stabilization	O
+,	O
+are	O
+considered	O
+from	O
+the	O
+micro	O
+-	O
+,	O
+mezzo	O
+-	O
+,	O
+and	O
+macrolevels	O
+of	O
+the	O
+organization	B-KEY
+,	O
+as	O
+well	O
+as	O
+for	O
+their	O
+psychological	O
+and	O
+social	B-KEY
+impact	I-KEY
+on	O
+the	O
+new	O
+job	B-KEY
+incumbent	O
+.	O
+An	O
+instrument	O
+for	O
+assessment	O
+of	O
+transitional	O
+success	O
+which	O
+could	O
+be	O
+administered	O
+in	O
+the	O
+adjustment	O
+or	O
+stabilization	O
+stage	O
+is	O
+considered	O
+
+Robot	B-KEY
+trajectory	I-KEY
+control	I-KEY
+using	O
+neural	B-KEY
+networks	I-KEY
+The	O
+use	O
+of	O
+a	O
+new	O
+type	O
+of	O
+neural	B-KEY
+network	I-KEY
+-LRB-	O
+NN	O
+-RRB-	O
+for	O
+controlling	O
+the	O
+trajectory	O
+of	O
+a	O
+robot	O
+is	O
+discussed	O
+.	O
+A	O
+control	B-KEY
+system	I-KEY
+is	O
+described	O
+which	O
+comprises	O
+an	O
+NN-based	O
+controller	O
+and	O
+a	O
+fixed-gain	B-KEY
+feedback	I-KEY
+controller	I-KEY
+.	O
+The	O
+NN-based	O
+controller	O
+employs	O
+a	O
+modified	O
+recurrent	O
+NN	O
+,	O
+the	O
+weights	O
+of	O
+which	O
+are	O
+obtained	O
+by	O
+training	O
+another	O
+NN	O
+to	O
+identify	O
+online	O
+the	O
+inverse	O
+dynamics	O
+of	O
+the	O
+robot	O
+.	O
+The	O
+work	O
+has	O
+confirmed	O
+the	O
+superiority	O
+of	O
+the	O
+proposed	O
+NN-based	O
+control	B-KEY
+system	I-KEY
+in	O
+rejecting	O
+large	O
+disturbances	O
+
+Changes	O
+in	O
+the	O
+entropy	B-KEY
+and	O
+the	O
+Tsallis	B-KEY
+difference	I-KEY
+information	I-KEY
+during	O
+spontaneous	B-KEY
+decay	I-KEY
+and	O
+self-organization	B-KEY
+of	O
+nonextensive	B-KEY
+systems	I-KEY
+A	O
+theoretical-information	O
+description	O
+of	O
+self-organization	B-KEY
+processes	O
+during	O
+stimulated	B-KEY
+transitions	I-KEY
+between	O
+stationary	O
+states	O
+of	O
+open	O
+nonextensive	B-KEY
+systems	I-KEY
+is	O
+presented	O
+.	O
+S/sub	O
+q	O
+/	O
+-	O
+and	O
+I/sub	O
+q	O
+/	O
+-	O
+theorems	O
+on	O
+changes	O
+of	O
+the	O
+entropy	B-KEY
+and	O
+Tsallis	B-KEY
+difference	I-KEY
+information	I-KEY
+measures	O
+in	O
+the	O
+process	O
+of	O
+evolution	O
+in	O
+the	O
+space	O
+of	O
+control	O
+parameters	O
+are	O
+proved	O
+.	O
+The	O
+entropy	B-KEY
+and	O
+the	O
+Tsallis	B-KEY
+difference	I-KEY
+information	I-KEY
+are	O
+derived	O
+and	O
+their	O
+new	O
+extreme	O
+properties	O
+are	O
+discussed	O
+
+CherylAnn	O
+Silberer	O
+:	O
+all	O
+about	O
+process	O
+-LSB-	O
+accounting	B-KEY
+technologist	I-KEY
+-RSB-	O
+Silberer	O
+'s	O
+company	O
+,	O
+CompLete	B-KEY
+,	O
+is	O
+making	O
+a	O
+specialty	O
+of	O
+workflow	B-KEY
+process	I-KEY
+analysis	I-KEY
+
+DAML+OIL	B-KEY
+:	O
+an	O
+ontology	O
+language	O
+for	O
+the	O
+Semantic	B-KEY
+Web	I-KEY
+By	O
+all	O
+measures	O
+,	O
+the	O
+Web	O
+is	O
+enormous	O
+and	O
+growing	O
+at	O
+a	O
+staggering	O
+rate	O
+,	O
+which	O
+has	O
+made	O
+it	O
+increasingly	O
+difficult-and	O
+important-for	O
+both	O
+people	O
+and	O
+programs	O
+to	O
+have	O
+quick	O
+and	O
+accurate	O
+access	O
+to	O
+Web	O
+information	O
+and	O
+services	O
+.	O
+The	O
+Semantic	B-KEY
+Web	I-KEY
+offers	O
+a	O
+solution	O
+,	O
+capturing	O
+and	O
+exploiting	O
+the	O
+meaning	O
+of	O
+terms	O
+to	O
+transform	O
+the	O
+Web	O
+from	O
+a	O
+platform	O
+that	O
+focuses	O
+on	O
+presenting	O
+information	O
+,	O
+to	O
+a	O
+platform	O
+that	O
+focuses	O
+on	O
+understanding	O
+and	O
+reasoning	O
+with	O
+information	O
+.	O
+To	O
+support	O
+Semantic	B-KEY
+Web	I-KEY
+development	O
+,	O
+the	O
+US	O
+Defense	O
+Advanced	O
+Research	O
+Projects	O
+Agency	O
+launched	O
+the	O
+DARPA	B-KEY
+Agent	I-KEY
+Markup	I-KEY
+Language	I-KEY
+-LRB-	O
+DAML	O
+-RRB-	O
+initiative	O
+to	O
+fund	O
+research	O
+in	O
+languages	O
+,	O
+tools	O
+,	O
+infrastructure	O
+,	O
+and	O
+applications	O
+that	O
+make	O
+Web	O
+content	O
+more	O
+accessible	O
+and	O
+understandable	O
+.	O
+Although	O
+the	O
+US	O
+government	O
+funds	O
+DAML	O
+,	O
+several	O
+organizations-including	O
+US	O
+and	O
+European	O
+businesses	O
+and	O
+universities	O
+,	O
+and	O
+international	O
+consortia	O
+such	O
+as	O
+the	O
+World	O
+Wide	O
+Web	O
+Consortium-have	O
+contributed	O
+to	O
+work	O
+on	O
+issues	O
+related	O
+to	O
+DAML	O
+'s	O
+development	O
+and	O
+deployment	O
+.	O
+We	O
+focus	O
+on	O
+DAML	O
+'s	O
+current	O
+markup	O
+language	O
+,	O
+DAML+OIL	B-KEY
+,	O
+which	O
+is	O
+a	O
+proposed	O
+starting	O
+point	O
+for	O
+the	O
+W3C	O
+'s	O
+Semantic	B-KEY
+Web	I-KEY
+Activity	O
+'s	O
+Ontology	B-KEY
+Web	I-KEY
+Language	I-KEY
+-LRB-	O
+OWL	O
+-RRB-	O
+.	O
+We	O
+introduce	O
+DAML+OIL	B-KEY
+syntax	B-KEY
+and	O
+usage	O
+through	O
+a	O
+set	O
+of	O
+examples	O
+,	O
+drawn	O
+from	O
+a	O
+wine	B-KEY
+knowledge	I-KEY
+base	I-KEY
+used	O
+to	O
+teach	O
+novices	O
+how	O
+to	O
+build	O
+ontologies	O
+
+Monitoring	O
+the	O
+news	O
+online	O
+The	O
+author	O
+looks	O
+at	O
+how	O
+we	O
+can	O
+focus	O
+on	O
+what	O
+we	O
+want	O
+,	O
+finding	O
+small	O
+stories	O
+in	O
+vast	O
+oceans	O
+of	O
+news	O
+.	O
+There	O
+is	O
+no	O
+one	O
+tool	O
+that	O
+will	O
+scan	O
+every	O
+news	O
+resource	O
+available	O
+and	O
+give	O
+alerts	O
+on	O
+new	O
+available	O
+materials	O
+.	O
+Every	O
+one	O
+has	O
+a	O
+slightly	O
+different	O
+focus	O
+.	O
+Some	O
+are	O
+paid	O
+sources	O
+,	O
+while	O
+many	O
+are	O
+free	O
+.	O
+If	O
+used	O
+wisely	O
+,	O
+an	O
+excellent	O
+news	B-KEY
+monitoring	I-KEY
+system	O
+for	O
+a	O
+large	O
+number	O
+of	O
+topics	O
+can	O
+be	O
+set	O
+up	O
+for	O
+surprisingly	O
+little	O
+cost	O
+
+L/sub	O
+p	O
+/	O
+boundedness	B-KEY
+of	O
+-LRB-	O
+C	O
+,	O
+1	O
+-RRB-	O
+means	O
+of	O
+orthonormal	B-KEY
+expansions	I-KEY
+for	O
+general	B-KEY
+exponential	I-KEY
+weights	I-KEY
+Let	O
+I	O
+be	O
+a	O
+finite	O
+or	O
+infinite	B-KEY
+interval	I-KEY
+,	O
+and	O
+let	O
+W	O
+:	O
+I	O
+to	O
+-LRB-	O
+0	O
+,	O
+infinity	O
+-RRB-	O
+.	O
+Assume	O
+that	O
+W/sup	O
+2	O
+/	O
+is	O
+a	O
+weight	O
+,	O
+so	O
+that	O
+we	O
+may	O
+define	O
+orthonormal	B-KEY
+polynomials	I-KEY
+corresponding	O
+to	O
+W/sup	O
+2	O
+/	O
+.	O
+For	O
+f	O
+:	O
+R	O
+to	O
+R	O
+,	O
+let	O
+s/sub	O
+m	O
+/	O
+-LSB-	O
+f	O
+-RSB-	O
+denote	O
+the	O
+mth	B-KEY
+partial	I-KEY
+sum	I-KEY
+of	O
+the	O
+orthonormal	B-KEY
+expansion	I-KEY
+of	O
+f	O
+with	O
+respect	O
+to	O
+these	O
+polynomials	O
+.	O
+We	O
+investigate	O
+boundedness	B-KEY
+in	O
+weighted	O
+L/sub	O
+p	O
+/	O
+spaces	O
+of	O
+the	O
+-LRB-	O
+C	O
+,	O
+1	O
+-RRB-	O
+means	O
+1/n	O
+/	O
+sub	O
+m	O
+=	O
+1	O
+/	O
+Sigma	O
+/	O
+sup	O
+n/s/sub	O
+m	O
+/	O
+-LSB-	O
+f	O
+-RSB-	O
+.	O
+The	O
+class	O
+of	O
+weights	O
+W/sup	O
+2	O
+/	O
+considered	O
+includes	O
+even	O
+and	O
+noneven	O
+exponential	O
+weights	O
+
+Module	O
+placement	O
+with	O
+boundary	B-KEY
+constraints	I-KEY
+using	O
+B	O
+*	O
+-	O
+trees	O
+The	O
+module	O
+placement	O
+problem	O
+is	O
+to	O
+determine	O
+the	O
+co-ordinates	O
+of	O
+logic	O
+modules	O
+in	O
+a	O
+chip	O
+such	O
+that	O
+no	O
+two	O
+modules	O
+overlap	O
+and	O
+some	O
+cost	O
+-LRB-	O
+e.g.	O
+silicon	B-KEY
+area	I-KEY
+,	O
+interconnection	B-KEY
+length	I-KEY
+,	O
+etc.	O
+-RRB-	O
+is	O
+optimised	O
+.	O
+To	O
+shorten	O
+connections	O
+between	O
+inputs	O
+and	O
+outputs	O
+and/or	O
+make	O
+related	O
+modules	O
+adjacent	O
+,	O
+it	O
+is	O
+desired	O
+to	O
+place	O
+some	O
+modules	O
+along	O
+the	O
+specific	O
+boundaries	O
+of	O
+a	O
+chip	O
+.	O
+To	O
+deal	O
+with	O
+such	O
+boundary	B-KEY
+constraints	I-KEY
+,	O
+we	O
+explore	O
+the	O
+feasibility	O
+conditions	O
+of	O
+a	O
+B	O
+*	O
+-	O
+tree	O
+with	O
+boundary	B-KEY
+constraints	I-KEY
+and	O
+develop	O
+a	O
+simulated	O
+annealing-based	O
+algorithm	O
+using	O
+B	O
+*	O
+-	O
+trees	O
+.	O
+Unlike	O
+most	O
+previous	O
+work	O
+,	O
+the	O
+proposed	O
+algorithm	O
+guarantees	O
+a	O
+feasible	O
+B	O
+*	O
+-	O
+tree	O
+with	O
+boundary	B-KEY
+constraints	I-KEY
+for	O
+each	O
+perturbation	O
+.	O
+Experimental	O
+results	O
+show	O
+that	O
+the	O
+algorithm	O
+can	O
+obtain	O
+a	O
+smaller	O
+silicon	B-KEY
+area	I-KEY
+than	O
+the	O
+most	O
+recent	O
+work	O
+based	O
+on	O
+sequence	O
+pairs	O
+
+Elastic	B-KEY
+constraint	I-KEY
+branching	I-KEY
+,	O
+the	O
+Wedelin/Carmen	O
+Lagrangian	O
+heuristic	O
+and	O
+integer	B-KEY
+programming	I-KEY
+for	O
+personnel	B-KEY
+scheduling	I-KEY
+The	O
+Wedelin	B-KEY
+algorithm	I-KEY
+is	O
+a	O
+Lagrangian	B-KEY
+based	I-KEY
+heuristic	I-KEY
+that	O
+is	O
+being	O
+successfully	O
+used	O
+by	O
+Carmen	B-KEY
+Systems	I-KEY
+to	O
+solve	O
+large	B-KEY
+crew	I-KEY
+pairing	I-KEY
+problems	I-KEY
+within	O
+the	O
+airline	B-KEY
+industry	I-KEY
+.	O
+We	O
+extend	O
+the	O
+Wedelin	O
+approach	O
+by	O
+developing	O
+an	O
+implementation	O
+for	O
+personnel	B-KEY
+scheduling	I-KEY
+problems	O
+-LRB-	O
+also	O
+termed	O
+staff	B-KEY
+rostering	I-KEY
+problems	I-KEY
+-RRB-	O
+that	O
+exploits	O
+the	O
+special	O
+structure	O
+of	O
+these	O
+problems	O
+.	O
+We	O
+also	O
+introduce	O
+elastic	B-KEY
+constraint	I-KEY
+branching	I-KEY
+with	O
+the	O
+twin	O
+aims	O
+of	O
+improving	O
+the	O
+performance	O
+of	O
+our	O
+new	O
+approach	O
+and	O
+making	O
+it	O
+more	O
+column	O
+generation	O
+friendly	O
+.	O
+Numerical	O
+results	O
+show	O
+that	O
+our	O
+approach	O
+can	O
+outperform	O
+the	O
+commercial	O
+solver	O
+CPLEX	O
+on	O
+difficult	O
+commercial	O
+rostering	O
+problems	O
+
+Cleared	O
+for	O
+take-off	O
+-LSB-	O
+Hummingbird	B-KEY
+Enterprise	I-KEY
+-RSB-	O
+A	O
+recent	O
+Gartner	O
+report	O
+identifies	O
+Hummingbird	O
+in	O
+the	O
+first	O
+wave	O
+of	O
+vendors	O
+as	O
+an	O
+early	O
+example	O
+of	O
+convergence	O
+in	O
+the	O
+`	O
+smart	B-KEY
+enterprise	I-KEY
+suite	I-KEY
+'	O
+market	O
+.	O
+We	O
+spoke	O
+to	O
+Hummingbird	O
+'s	O
+Marketing	O
+Director	O
+for	O
+Northern	O
+Europe	O
+
+Computing	O
+the	O
+frequency	B-KEY
+response	I-KEY
+of	O
+systems	O
+affinely	O
+depending	O
+on	O
+uncertain	B-KEY
+parameters	I-KEY
+The	O
+computation	O
+of	O
+the	O
+frequency	B-KEY
+response	I-KEY
+of	O
+systems	O
+depending	O
+affinely	O
+on	O
+uncertain	B-KEY
+parameters	I-KEY
+can	O
+be	O
+reduced	O
+to	O
+that	O
+of	O
+all	O
+its	O
+one-dimensional	B-KEY
+edge	I-KEY
+plants	I-KEY
+while	O
+the	O
+image	O
+of	O
+such	O
+an	O
+edge	O
+plant	O
+at	O
+a	O
+fixed	O
+frequency	O
+is	O
+an	O
+arc	B-KEY
+or	O
+a	O
+line	B-KEY
+segment	I-KEY
+in	O
+the	O
+complex	O
+plane	O
+.	O
+Based	O
+on	O
+this	O
+conclusion	O
+,	O
+four	O
+computational	O
+formulas	O
+of	O
+the	O
+maximal	O
+and	O
+minimal	O
+-LRB-	O
+maxi-mini	O
+-RRB-	O
+magnitudes	O
+and	O
+phases	O
+of	O
+an	O
+edge	O
+plant	O
+at	O
+a	O
+fixed	O
+frequency	O
+are	O
+given	O
+.	O
+The	O
+formulas	O
+,	O
+besides	O
+sharing	O
+a	O
+simpler	O
+form	O
+of	O
+expression	O
+,	O
+concretely	O
+display	O
+how	O
+the	O
+extrema	O
+of	O
+the	O
+frequency	B-KEY
+response	I-KEY
+of	O
+the	O
+edge	O
+plant	O
+relate	O
+to	O
+the	O
+typical	O
+characteristics	O
+of	O
+the	O
+arc	B-KEY
+and	O
+line	B-KEY
+segment	I-KEY
+such	O
+as	O
+the	O
+centre	O
+,	O
+radius	O
+and	O
+tangent	O
+points	O
+of	O
+the	O
+arc	B-KEY
+,	O
+the	O
+distance	O
+from	O
+the	O
+origin	O
+to	O
+the	O
+line	B-KEY
+segment	I-KEY
+etc.	O
+.	O
+The	O
+direct	O
+application	O
+of	O
+the	O
+results	O
+is	O
+to	O
+compute	O
+the	O
+Bode	O
+-	O
+,	O
+Nichols	O
+-	O
+and	O
+Nyquist-plot	B-KEY
+collections	O
+of	O
+the	O
+systems	O
+which	O
+are	O
+needed	O
+in	O
+robustness	B-KEY
+analysis	I-KEY
+and	O
+design	O
+
+The	O
+AT89C51/52	B-KEY
+flash	B-KEY
+memory	I-KEY
+programmers	I-KEY
+When	O
+faced	O
+with	O
+a	O
+plethora	O
+of	O
+applications	O
+to	O
+design	O
+,	O
+it	O
+'s	O
+essential	O
+to	O
+have	O
+a	O
+versatile	O
+microcontroller	B-KEY
+in	O
+hand	O
+.	O
+The	O
+author	O
+describes	O
+the	O
+AT89C51/52	B-KEY
+microcontrollers	B-KEY
+.	O
+To	O
+get	O
+you	O
+started	O
+,	O
+he	O
+'ll	O
+describe	O
+his	O
+inexpensive	O
+microcontroller	B-KEY
+programmer	O
+
+New	O
+voice	B-KEY
+over	I-KEY
+Internet	I-KEY
+protocol	I-KEY
+technique	O
+with	O
+hierarchical	B-KEY
+data	I-KEY
+security	I-KEY
+protection	I-KEY
+The	O
+authors	O
+propose	O
+a	O
+voice	B-KEY
+over	I-KEY
+Internet	I-KEY
+protocol	I-KEY
+-LRB-	O
+VoIP	B-KEY
+-RRB-	O
+technique	O
+with	O
+a	O
+new	O
+hierarchical	B-KEY
+data	I-KEY
+security	I-KEY
+protection	I-KEY
+-LRB-	O
+HDSP	O
+-RRB-	O
+scheme	O
+.	O
+The	O
+proposed	O
+HDSP	B-KEY
+scheme	I-KEY
+can	O
+maintain	O
+the	O
+voice	O
+quality	O
+degraded	O
+from	O
+packet	B-KEY
+loss	I-KEY
+and	O
+preserve	O
+high	B-KEY
+data	I-KEY
+security	I-KEY
+.	O
+It	O
+performs	O
+both	O
+the	O
+data	O
+inter-leaving	O
+on	O
+the	O
+inter-frame	O
+of	O
+voice	O
+for	O
+achieving	O
+better	O
+error	O
+recovery	O
+of	O
+voices	O
+suffering	O
+from	O
+continuous	O
+packet	B-KEY
+loss	I-KEY
+,	O
+and	O
+the	O
+data	B-KEY
+encryption	I-KEY
+on	O
+the	O
+intra-frame	O
+of	O
+voice	O
+for	O
+achieving	O
+high	B-KEY
+data	I-KEY
+security	I-KEY
+,	O
+which	O
+are	O
+controlled	O
+by	O
+a	O
+random	B-KEY
+bit-string	I-KEY
+sequence	I-KEY
+generated	O
+from	O
+a	O
+chaotic	B-KEY
+system	I-KEY
+.	O
+To	O
+demonstrate	O
+the	O
+performance	O
+of	O
+the	O
+proposed	O
+HDSP	B-KEY
+scheme	I-KEY
+,	O
+we	O
+have	O
+successfully	O
+verified	O
+and	O
+analysed	O
+the	O
+proposed	O
+approach	O
+through	O
+software	B-KEY
+simulation	I-KEY
+and	O
+statistical	B-KEY
+measures	I-KEY
+on	O
+several	O
+test	O
+voices	O
+
+Robust	O
+L/sub	O
+2	O
+/	O
+disturbance	O
+attenuation	O
+for	O
+nonlinear	B-KEY
+systems	I-KEY
+with	O
+input	B-KEY
+dynamical	I-KEY
+uncertainty	I-KEY
+Deals	O
+with	O
+the	O
+problem	O
+of	O
+robust	O
+L/sub	O
+2	O
+/	O
+disturbance	O
+attenuation	O
+for	O
+nonlinear	B-KEY
+systems	I-KEY
+with	O
+input	B-KEY
+dynamical	I-KEY
+uncertainty	I-KEY
+.	O
+The	O
+input	B-KEY
+dynamical	I-KEY
+uncertainty	I-KEY
+is	O
+restricted	O
+to	O
+be	O
+minimum-phase	O
+and	O
+relative	O
+degree	O
+zero	O
+.	O
+A	O
+sufficient	B-KEY
+condition	I-KEY
+.	O
+is	O
+given	O
+such	O
+that	O
+the	O
+nonlinear	B-KEY
+system	I-KEY
+satisfies	O
+the	O
+L/sub	O
+2	O
+/	O
+gain	O
+performance	O
+and	O
+input-to-state	B-KEY
+stable	I-KEY
+property	I-KEY
+.	O
+Using	O
+this	O
+condition	O
+,	O
+a	O
+design	B-KEY
+approach	I-KEY
+is	O
+given	O
+for	O
+a	O
+smooth	B-KEY
+state	I-KEY
+feedback	I-KEY
+control	I-KEY
+law	I-KEY
+that	O
+solves	O
+the	O
+robust	O
+L/sub	O
+2	O
+/	O
+disturbance	O
+attenuation	O
+problem	O
+,	O
+and	O
+the	O
+approach	O
+is	O
+extended	O
+to	O
+a	O
+more	O
+general	O
+case	O
+where	O
+the	O
+nominal	B-KEY
+system	I-KEY
+has	O
+higher	O
+relative	O
+degree	O
+.	O
+Finally	O
+,	O
+a	O
+numerical	O
+example	O
+is	O
+given	O
+to	O
+demonstrate	O
+the	O
+proposed	O
+approach	O
+
+Stock	B-KEY
+market	I-KEY
+trading	I-KEY
+rule	B-KEY
+discovery	I-KEY
+using	O
+technical	B-KEY
+charting	I-KEY
+heuristics	I-KEY
+In	O
+this	O
+case	B-KEY
+study	I-KEY
+in	O
+knowledge	B-KEY
+engineering	I-KEY
+and	O
+data	B-KEY
+mining	I-KEY
+,	O
+we	O
+implement	O
+a	O
+recognizer	O
+for	O
+two	O
+variations	O
+of	O
+the	O
+`	O
+bull	O
+flag	O
+'	O
+technical	B-KEY
+charting	I-KEY
+heuristic	I-KEY
+and	O
+use	O
+this	O
+recognizer	O
+to	O
+discover	O
+trading	O
+rules	O
+on	O
+the	O
+NYSE	B-KEY
+Composite	I-KEY
+Index	I-KEY
+.	O
+Out-of-sample	B-KEY
+results	I-KEY
+indicate	O
+that	O
+these	O
+rules	O
+are	O
+effective	O
+
+Using	O
+duality	O
+to	O
+implicitize	O
+and	O
+find	O
+cusps	B-KEY
+and	O
+inflection	B-KEY
+points	I-KEY
+of	O
+Bezier	B-KEY
+curves	I-KEY
+A	O
+planar	B-KEY
+algebraic	I-KEY
+curve	I-KEY
+C	O
+has	O
+an	O
+implicit	B-KEY
+equation	I-KEY
+and	O
+a	O
+tangential	B-KEY
+equation	I-KEY
+.	O
+The	O
+tangential	B-KEY
+equation	I-KEY
+defines	O
+a	O
+dual	B-KEY
+curve	I-KEY
+to	O
+C.	O
+Starting	O
+with	O
+a	O
+parametrization	B-KEY
+of	O
+C	O
+,	O
+we	O
+find	O
+a	O
+parametrization	B-KEY
+of	O
+the	O
+dual	B-KEY
+curve	I-KEY
+,	O
+and	O
+the	O
+tangential	B-KEY
+equation	I-KEY
+and	O
+implicit	B-KEY
+equation	I-KEY
+of	O
+C	O
+in	O
+a	O
+novel	O
+way	O
+.	O
+We	O
+also	O
+find	O
+equations	O
+whose	O
+roots	O
+are	O
+the	O
+parameter	O
+values	O
+of	O
+the	O
+cusps	B-KEY
+and	O
+inflection	B-KEY
+points	I-KEY
+of	O
+C.	O
+Methods	O
+include	O
+polar	B-KEY
+reciprocation	I-KEY
+and	O
+the	O
+theory	O
+of	O
+envelopes	O
+
+Business	B-KEY
+data	I-KEY
+management	I-KEY
+for	O
+business-to-business	B-KEY
+electronic	I-KEY
+commerce	I-KEY
+Business-to-business	B-KEY
+electronic	I-KEY
+commerce	I-KEY
+-LRB-	O
+B2B	O
+EC	O
+-RRB-	O
+opens	O
+up	O
+new	O
+possibilities	O
+for	O
+trade	O
+.	O
+For	O
+example	O
+,	O
+new	O
+business	O
+partners	O
+from	O
+around	O
+the	O
+globe	O
+can	O
+be	O
+found	O
+,	O
+their	O
+offers	O
+can	O
+be	O
+compared	O
+,	O
+even	O
+complex	O
+negotiations	O
+can	O
+be	O
+conducted	O
+electronically	O
+,	O
+and	O
+a	O
+contract	O
+can	O
+be	O
+drawn	O
+up	O
+and	O
+fulfilled	O
+via	O
+an	O
+electronic	B-KEY
+marketplace	I-KEY
+.	O
+However	O
+,	O
+sophisticated	O
+data	O
+management	O
+is	O
+required	O
+to	O
+provide	O
+such	O
+facilities	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+the	O
+results	O
+of	O
+a	O
+multi-national	B-KEY
+project	I-KEY
+on	O
+creating	O
+a	O
+business-to-business	O
+electronic	B-KEY
+marketplace	I-KEY
+for	O
+small	B-KEY
+and	I-KEY
+medium-sized	I-KEY
+enterprises	I-KEY
+are	O
+presented	O
+.	O
+Tools	O
+for	O
+information	B-KEY
+discovery	I-KEY
+,	O
+protocol-based	B-KEY
+negotiations	I-KEY
+,	O
+and	O
+monitored	B-KEY
+contract	I-KEY
+enactment	I-KEY
+are	O
+provided	O
+and	O
+based	O
+on	O
+a	O
+business	B-KEY
+data	I-KEY
+repository	I-KEY
+.	O
+The	O
+repository	O
+integrates	O
+heterogeneous	B-KEY
+business	I-KEY
+data	I-KEY
+with	O
+business	B-KEY
+communication	I-KEY
+.	O
+Specific	O
+problems	O
+such	O
+as	O
+multilingual	O
+nature	O
+,	O
+data	B-KEY
+ownership	I-KEY
+,	O
+and	O
+traceability	B-KEY
+of	O
+contracts	O
+and	O
+related	O
+negotiations	O
+are	O
+addressed	O
+and	O
+it	O
+is	O
+shown	O
+that	O
+the	O
+present	O
+approach	O
+provides	O
+efficient	O
+business	B-KEY
+data	I-KEY
+management	I-KEY
+for	O
+B2B	O
+EC	O
+
+Estimation	O
+of	O
+3-D	O
+left	O
+ventricular	O
+deformation	O
+from	O
+medical	O
+images	O
+using	O
+biomechanical	B-KEY
+models	I-KEY
+The	O
+quantitative	B-KEY
+estimation	I-KEY
+of	O
+regional	B-KEY
+cardiac	I-KEY
+deformation	I-KEY
+from	O
+three-dimensional	O
+-LRB-	O
+3-D	O
+-RRB-	O
+image	O
+sequences	O
+has	O
+important	O
+clinical	O
+implications	O
+for	O
+the	O
+assessment	O
+of	O
+viability	O
+in	O
+the	O
+heart	O
+wall	O
+.	O
+We	O
+present	O
+here	O
+a	O
+generic	B-KEY
+methodology	I-KEY
+for	O
+estimating	O
+soft	O
+tissue	O
+deformation	O
+which	O
+integrates	O
+image-derived	O
+information	O
+with	O
+biomechanical	B-KEY
+models	I-KEY
+,	O
+and	O
+apply	O
+it	O
+to	O
+the	O
+problem	O
+of	O
+cardiac	O
+deformation	O
+estimation	O
+.	O
+The	O
+method	O
+is	O
+image	O
+modality	O
+independent	O
+.	O
+The	O
+images	O
+are	O
+segmented	O
+interactively	O
+and	O
+then	O
+initial	O
+correspondence	O
+is	O
+established	O
+using	O
+a	O
+shape-tracking	O
+approach	O
+.	O
+A	O
+dense	O
+motion	O
+field	O
+is	O
+then	O
+estimated	O
+using	O
+a	O
+transversely	O
+isotropic	O
+,	O
+linear-elastic	O
+model	O
+,	O
+which	O
+accounts	O
+for	O
+the	O
+muscle	B-KEY
+fiber	I-KEY
+directions	I-KEY
+in	O
+the	O
+left	O
+ventricle	O
+.	O
+The	O
+dense	O
+motion	O
+field	O
+is	O
+in	O
+turn	O
+used	O
+to	O
+calculate	O
+the	O
+deformation	O
+of	O
+the	O
+heart	O
+wall	O
+in	O
+terms	O
+of	O
+strain	O
+in	O
+cardiac	B-KEY
+specific	I-KEY
+directions	I-KEY
+.	O
+The	O
+strains	O
+obtained	O
+using	O
+this	O
+approach	O
+in	O
+open-chest	B-KEY
+dogs	I-KEY
+before	O
+and	O
+after	O
+coronary	O
+occlusion	O
+,	O
+exhibit	O
+a	O
+high	O
+correlation	O
+with	O
+strains	O
+produced	O
+in	O
+the	O
+same	O
+animals	O
+using	O
+implanted	O
+markers	O
+.	O
+Further	O
+,	O
+they	O
+show	O
+good	O
+agreement	O
+with	O
+previously	O
+published	O
+results	O
+in	O
+the	O
+literature	O
+.	O
+This	O
+proposed	O
+method	O
+provides	O
+quantitative	O
+regional	O
+3-D	O
+estimates	O
+of	O
+heart	O
+deformation	O
+
+An	O
+experimental	B-KEY
+evaluation	I-KEY
+of	O
+comprehensibility	O
+aspects	O
+of	O
+knowledge	O
+structures	O
+derived	O
+through	O
+induction	B-KEY
+techniques	I-KEY
+:	O
+a	O
+case	B-KEY
+study	I-KEY
+of	O
+industrial	B-KEY
+fault	I-KEY
+diagnosis	I-KEY
+Machine	O
+induction	O
+has	O
+been	O
+extensively	O
+used	O
+in	O
+order	O
+to	O
+develop	O
+knowledge	B-KEY
+bases	I-KEY
+for	O
+decision	B-KEY
+support	I-KEY
+systems	I-KEY
+and	O
+predictive	B-KEY
+systems	I-KEY
+.	O
+The	O
+extent	O
+to	O
+which	O
+developers	O
+and	O
+domain	O
+experts	O
+can	O
+comprehend	O
+these	O
+knowledge	O
+structures	O
+and	O
+gain	O
+useful	O
+insights	O
+into	O
+the	O
+basis	O
+of	O
+decision	O
+making	O
+has	O
+become	O
+a	O
+challenging	O
+research	O
+issue	O
+.	O
+This	O
+article	O
+examines	O
+the	O
+knowledge	O
+structures	O
+generated	O
+by	O
+the	O
+C4	O
+.5	O
+induction	B-KEY
+technique	I-KEY
+in	O
+a	O
+fault	O
+diagnostic	O
+task	O
+and	O
+proposes	O
+to	O
+use	O
+a	O
+model	O
+of	O
+human	O
+learning	O
+in	O
+order	O
+to	O
+guide	O
+the	O
+process	O
+of	O
+making	O
+comprehensive	O
+the	O
+results	O
+of	O
+machine	O
+induction	O
+.	O
+The	O
+model	O
+of	O
+learning	O
+is	O
+used	O
+to	O
+generate	O
+hierarchical	O
+representations	O
+of	O
+diagnostic	O
+knowledge	O
+by	O
+adjusting	O
+the	O
+level	O
+of	O
+abstraction	O
+and	O
+varying	O
+the	O
+goal	O
+structures	O
+between	O
+`	O
+shallow	O
+'	O
+and	O
+`	O
+deep	O
+'	O
+ones	O
+.	O
+Comprehensibility	O
+is	O
+assessed	O
+in	O
+a	O
+global	O
+way	O
+in	O
+an	O
+experimental	O
+comparison	O
+where	O
+subjects	O
+are	O
+required	O
+to	O
+acquire	O
+the	O
+knowledge	O
+structures	O
+and	O
+transfer	O
+to	O
+new	O
+tasks	O
+.	O
+This	O
+method	O
+of	O
+addressing	O
+the	O
+issue	O
+of	O
+comprehensibility	O
+appears	O
+promising	O
+especially	O
+for	O
+machine	O
+induction	B-KEY
+techniques	I-KEY
+that	O
+are	O
+rather	O
+inflexible	O
+with	O
+regard	O
+to	O
+the	O
+number	O
+and	O
+sorts	O
+of	O
+interventions	O
+allowed	O
+to	O
+system	O
+developers	O
+
+On	O
+the	O
+diophantine	B-KEY
+equation	I-KEY
+x/sup	O
+2	O
+/	O
++	O
+q/sup	O
+2k	O
++1	O
+/	O
+=	O
+y/sup	O
+n	O
+/	O
+In	O
+this	O
+paper	O
+it	O
+has	O
+been	O
+proved	O
+that	O
+if	O
+q	O
+is	O
+an	O
+odd	B-KEY
+prime	I-KEY
+,	O
+q	O
+not	O
+=	O
+7	O
+-LRB-	O
+mod	O
+8	O
+-RRB-	O
+,	O
+n	O
+is	O
+an	O
+odd	B-KEY
+integer	I-KEY
+>	O
+or	O
+=	O
+5	O
+,	O
+n	O
+is	O
+not	O
+a	O
+multiple	O
+of	O
+3	O
+and	O
+-LRB-	O
+h	O
+,	O
+n	O
+-RRB-	O
+=	O
+1	O
+,	O
+where	O
+h	O
+is	O
+the	O
+class	O
+number	O
+of	O
+the	O
+filed	O
+Q	O
+-LRB-	O
+square	O
+root	O
+-LRB-	O
+-	O
+q	O
+-RRB-	O
+-RRB-	O
+,	O
+then	O
+the	O
+diophantine	B-KEY
+equation	I-KEY
+x/sup	O
+2	O
+/	O
++	O
+q/sup	O
+2k	O
++1	O
+/	O
+=	O
+y/sup	O
+n	O
+/	O
+has	O
+exactly	O
+two	O
+families	O
+of	O
+solutions	O
+-LRB-	O
+q	O
+,	O
+n	O
+,	O
+k	O
+,	O
+x	O
+,	O
+y	O
+-RRB-	O
+
+Current	O
+waveform	O
+control	O
+of	O
+a	O
+high-power-factor	B-KEY
+rectifier	I-KEY
+circuit	I-KEY
+for	O
+harmonic	O
+suppression	O
+of	O
+voltage	O
+and	O
+current	O
+in	O
+a	O
+distribution	B-KEY
+system	I-KEY
+This	O
+paper	O
+presents	O
+the	O
+input	B-KEY
+current	I-KEY
+waveform	I-KEY
+control	O
+of	O
+the	O
+rectifier	O
+circuit	O
+which	O
+realizes	O
+simultaneously	O
+the	O
+high	O
+input	O
+power	O
+factor	O
+and	O
+the	O
+harmonics	O
+suppression	O
+of	O
+the	O
+receiving-end	O
+voltage	O
+and	O
+the	O
+source	O
+current	O
+under	O
+the	O
+distorted	O
+receiving-end	O
+voltage	O
+.	O
+The	O
+proposed	O
+input	B-KEY
+current	I-KEY
+waveform	I-KEY
+includes	O
+the	O
+harmonic	O
+components	O
+which	O
+are	O
+in	O
+phase	O
+with	O
+the	O
+receiving-end	B-KEY
+voltage	I-KEY
+harmonics	O
+.	O
+The	O
+control	O
+parameter	O
+in	O
+the	O
+proposed	O
+waveform	O
+is	O
+designed	O
+by	O
+examining	O
+the	O
+characteristics	O
+of	O
+both	O
+the	O
+harmonic	O
+suppression	O
+effect	O
+in	O
+the	O
+distribution	B-KEY
+system	I-KEY
+and	O
+the	O
+input	O
+power	O
+factor	O
+of	O
+the	O
+rectifier	O
+circuit	O
+.	O
+The	O
+effectiveness	O
+of	O
+the	O
+proposed	O
+current	O
+waveform	O
+has	O
+been	O
+confirmed	O
+experimentally	O
+
+Stability	B-KEY
+and	O
+L/sub	O
+2	O
+/	O
+gain	O
+properties	O
+of	O
+LPV	O
+systems	O
+Stability	B-KEY
+and	O
+L/sub	O
+2	O
+/	O
+gain	O
+properties	O
+of	O
+linear	B-KEY
+parameter-varying	I-KEY
+systems	I-KEY
+are	O
+obtained	O
+under	O
+assumed	O
+bounds	O
+on	O
+either	O
+the	O
+maximum	O
+or	O
+average	O
+value	O
+of	O
+the	O
+parameter	B-KEY
+rate	I-KEY
+
+Client	B-KEY
+satisfaction	I-KEY
+in	O
+a	O
+feasibility	O
+study	O
+comparing	O
+face-to-face	B-KEY
+interviews	I-KEY
+with	O
+telepsychiatry	B-KEY
+We	O
+carried	O
+out	O
+a	O
+pilot	O
+study	O
+comparing	O
+satisfaction	O
+levels	O
+between	O
+psychiatric	O
+patients	O
+seen	O
+face	O
+to	O
+face	O
+-LRB-	O
+FTF	O
+-RRB-	O
+and	O
+those	O
+seen	O
+via	O
+videoconference	B-KEY
+.	O
+Patients	O
+who	O
+consented	O
+were	O
+randomly	O
+assigned	O
+to	O
+one	O
+of	O
+two	O
+groups	O
+.	O
+One	O
+group	O
+received	O
+services	O
+in	O
+person	O
+-LRB-	O
+FTF	O
+from	O
+the	O
+visiting	O
+psychiatrist	O
+-RRB-	O
+while	O
+the	O
+other	O
+was	O
+seen	O
+using	O
+videoconferencing	O
+at	O
+128	O
+kbit/s	O
+.	O
+One	O
+psychiatrist	O
+provided	O
+all	O
+the	O
+FTF	O
+and	O
+videoconferencing	O
+assessment	O
+and	O
+follow-up	O
+visits	O
+.	O
+A	O
+total	O
+of	O
+24	O
+subjects	O
+were	O
+recruited	O
+.	O
+Three	O
+of	O
+the	O
+subjects	O
+-LRB-	O
+13	O
+%	O
+-RRB-	O
+did	O
+not	O
+attend	O
+their	O
+appointments	O
+and	O
+two	O
+subjects	O
+in	O
+each	O
+group	O
+were	O
+lost	O
+to	O
+follow-up	O
+.	O
+Thus	O
+there	O
+were	O
+nine	O
+in	O
+the	O
+FTF	O
+group	O
+and	O
+eight	O
+in	O
+the	O
+videoconferencing	O
+group	O
+.	O
+The	O
+two	O
+groups	O
+were	O
+similar	O
+in	O
+most	O
+respects	O
+.	O
+Patient	O
+satisfaction	O
+with	O
+the	O
+services	O
+was	O
+assessed	O
+using	O
+the	O
+Client	B-KEY
+Satisfaction	I-KEY
+Questionnaire	O
+-LRB-	O
+CSQ-8	O
+-RRB-	O
+,	O
+completed	O
+four	O
+months	O
+after	O
+the	O
+initial	O
+consultation	O
+.	O
+The	O
+mean	O
+scores	O
+were	O
+25.3	O
+in	O
+the	O
+FTF	O
+group	O
+and	O
+21.6	O
+in	O
+the	O
+videoconferencing	O
+group	O
+.	O
+Although	O
+there	O
+was	O
+a	O
+trend	O
+in	O
+favour	O
+of	O
+the	O
+FTF	O
+service	O
+,	O
+the	O
+difference	O
+was	O
+not	O
+significant	O
+.	O
+Patient	O
+satisfaction	O
+is	O
+only	O
+one	O
+component	O
+of	O
+evaluation	O
+.	O
+The	O
+efficacy	O
+of	O
+telepsychiatry	B-KEY
+must	O
+also	O
+be	O
+measured	O
+relative	O
+to	O
+that	O
+of	O
+conventional	O
+,	O
+FTF	O
+care	O
+before	O
+policy	O
+makers	O
+can	O
+decide	O
+how	O
+extensively	O
+telepsychiatry	B-KEY
+should	O
+be	O
+implemented	O
+
+Non-asymptotic	O
+confidence	O
+ellipsoids	O
+for	O
+the	O
+least-squares	B-KEY
+estimate	I-KEY
+We	O
+consider	O
+the	O
+finite	B-KEY
+sample	I-KEY
+properties	I-KEY
+of	O
+least-squares	B-KEY
+system	I-KEY
+identification	I-KEY
+,	O
+and	O
+derive	O
+non-asymptotic	O
+confidence	O
+ellipsoids	O
+for	O
+the	O
+estimate	O
+.	O
+The	O
+shape	O
+of	O
+the	O
+confidence	O
+ellipsoids	O
+is	O
+similar	O
+to	O
+the	O
+shape	O
+of	O
+the	O
+ellipsoids	O
+derived	O
+using	O
+asymptotic	O
+theory	O
+,	O
+but	O
+unlike	O
+asymptotic	O
+theory	O
+,	O
+they	O
+are	O
+valid	O
+for	O
+a	O
+finite	O
+number	O
+of	O
+data	B-KEY
+points	I-KEY
+.	O
+The	O
+probability	B-KEY
+that	O
+the	O
+estimate	O
+belongs	O
+to	O
+a	O
+certain	O
+ellipsoid	O
+has	O
+a	O
+natural	O
+dependence	O
+on	O
+the	O
+volume	O
+of	O
+the	O
+ellipsoid	O
+,	O
+the	O
+data	B-KEY
+generating	I-KEY
+mechanism	I-KEY
+,	O
+the	O
+model	B-KEY
+order	I-KEY
+and	O
+the	O
+number	O
+of	O
+data	B-KEY
+points	I-KEY
+available	O
+
+Verification	O
+of	O
+ideological	O
+classifications-a	O
+statistical	B-KEY
+approach	I-KEY
+The	O
+paper	O
+presents	O
+a	O
+statistical	O
+method	O
+of	O
+verifying	O
+ideological	B-KEY
+classifications	I-KEY
+of	O
+votes	O
+.	O
+Parliamentary	B-KEY
+votes	I-KEY
+,	O
+preclassified	O
+by	O
+an	O
+expert	O
+-LRB-	O
+on	O
+a	O
+chosen	O
+subset	O
+-RRB-	O
+,	O
+are	O
+verified	O
+at	O
+an	O
+assumed	O
+significance	B-KEY
+level	I-KEY
+by	O
+seeking	O
+the	O
+most	O
+likely	O
+match	O
+with	O
+the	O
+actual	O
+vote	O
+results	O
+.	O
+Classifications	O
+that	O
+do	O
+not	O
+meet	O
+the	O
+requirements	O
+defined	O
+are	O
+rejected	O
+.	O
+The	O
+results	O
+obtained	O
+can	O
+be	O
+applied	O
+in	O
+the	O
+ideological	B-KEY
+dimensioning	I-KEY
+algorithms	I-KEY
+,	O
+enabling	O
+ideological	O
+identification	O
+of	O
+dimensions	O
+obtained	O
+
+A	O
+GRASP	B-KEY
+heuristic	I-KEY
+for	O
+the	O
+mixed	B-KEY
+Chinese	I-KEY
+postman	I-KEY
+problem	I-KEY
+Arc	B-KEY
+routing	I-KEY
+problems	I-KEY
+-LRB-	O
+ARPs	O
+-RRB-	O
+consist	O
+of	O
+finding	O
+a	O
+traversal	O
+on	O
+a	O
+graph	O
+satisfying	O
+some	O
+conditions	O
+related	O
+to	O
+the	O
+links	O
+of	O
+the	O
+graph	O
+.	O
+In	O
+the	O
+Chinese	O
+postman	O
+problem	O
+-LRB-	O
+CPP	O
+-RRB-	O
+the	O
+aim	O
+is	O
+to	O
+find	O
+a	O
+minimum	B-KEY
+cost	I-KEY
+tour	I-KEY
+-LRB-	O
+closed	B-KEY
+walk	I-KEY
+-RRB-	O
+traversing	O
+all	O
+the	O
+links	O
+of	O
+the	O
+graph	O
+at	O
+least	O
+once	O
+.	O
+Both	O
+the	O
+Undirected	O
+CPP	O
+,	O
+where	O
+all	O
+the	O
+links	O
+are	O
+edges	O
+that	O
+can	O
+be	O
+traversed	O
+in	O
+both	O
+ways	O
+,	O
+and	O
+the	O
+Directed	O
+CPP	O
+,	O
+where	O
+all	O
+the	O
+links	O
+are	O
+arcs	O
+that	O
+must	O
+be	O
+traversed	O
+in	O
+a	O
+specified	O
+way	O
+,	O
+are	O
+known	O
+to	O
+be	O
+polynomially	O
+solvable	O
+.	O
+However	O
+,	O
+if	O
+we	O
+deal	O
+with	O
+a	O
+mixed	O
+graph	O
+-LRB-	O
+having	O
+edges	O
+and	O
+arcs	O
+-RRB-	O
+,	O
+the	O
+problem	O
+turns	O
+out	O
+to	O
+be	O
+NP-hard	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+present	O
+a	O
+heuristic	B-KEY
+algorithm	I-KEY
+for	O
+this	O
+problem	O
+,	O
+the	O
+so-called	O
+Mixed	O
+CPP	O
+-LRB-	O
+MCPP	O
+-RRB-	O
+,	O
+based	O
+on	O
+greedy	B-KEY
+randomized	I-KEY
+adaptive	I-KEY
+search	I-KEY
+procedure	I-KEY
+-LRB-	O
+GRASP	O
+-RRB-	O
+techniques	O
+.	O
+The	O
+algorithm	O
+has	O
+been	O
+tested	O
+and	O
+compared	O
+with	O
+other	O
+known	O
+and	O
+recent	O
+methods	O
+from	O
+the	O
+literature	O
+on	O
+a	O
+wide	O
+collection	O
+of	O
+randomly	O
+generated	O
+instances	O
+,	O
+with	O
+up	O
+to	O
+200	O
+nodes	O
+and	O
+600	O
+links	O
+,	O
+producing	O
+encouraging	O
+computational	O
+results	O
+.	O
+As	O
+far	O
+as	O
+we	O
+know	O
+,	O
+this	O
+is	O
+the	O
+best	O
+heuristic	B-KEY
+algorithm	I-KEY
+for	O
+the	O
+MCPP	O
+,	O
+with	O
+respect	O
+to	O
+solution	O
+quality	O
+,	O
+published	O
+up	O
+to	O
+now	O
+
+Hand-held	O
+digital	O
+video-camera	O
+for	O
+eye	B-KEY
+examination	I-KEY
+and	O
+follow-up	B-KEY
+We	O
+developed	O
+a	O
+hand-held	O
+digital	O
+colour	O
+video-camera	O
+for	O
+eye	B-KEY
+examination	I-KEY
+in	O
+primary	B-KEY
+care	I-KEY
+.	O
+The	O
+device	O
+weighed	O
+550	O
+g	O
+.	O
+It	O
+featured	O
+a	O
+charge-coupled	B-KEY
+device	I-KEY
+-LRB-	O
+CCD	O
+-RRB-	O
+and	O
+corrective	B-KEY
+optics	I-KEY
+.	O
+Both	O
+colour	O
+video	O
+and	O
+digital	B-KEY
+still	I-KEY
+images	I-KEY
+could	O
+be	O
+taken	O
+.	O
+The	O
+video-camera	O
+was	O
+connected	O
+to	O
+a	O
+PC	B-KEY
+with	O
+software	B-KEY
+for	O
+database	B-KEY
+storage	I-KEY
+,	O
+image	B-KEY
+processing	I-KEY
+and	O
+telecommunication	B-KEY
+.	O
+We	O
+studied	O
+88	O
+normal	B-KEY
+subjects	I-KEY
+-LRB-	O
+38	O
+male	O
+,	O
+50	O
+female	O
+-RRB-	O
+,	O
+aged	O
+7-62	O
+years	O
+.	O
+It	O
+was	O
+not	O
+necessary	O
+to	O
+use	O
+mydriatic	O
+eye	O
+drops	O
+for	O
+pupillary	O
+dilation	O
+.	O
+Satisfactory	O
+digital	O
+images	O
+of	O
+the	O
+whole	B-KEY
+face	I-KEY
+and	O
+the	O
+anterior	B-KEY
+eye	I-KEY
+were	O
+obtained	O
+.	O
+The	O
+optic	B-KEY
+disc	I-KEY
+and	O
+the	O
+central	O
+part	O
+of	O
+the	O
+ocular	B-KEY
+fundus	I-KEY
+could	O
+also	O
+be	O
+recorded	O
+.	O
+Image	B-KEY
+quality	I-KEY
+of	O
+the	O
+face	O
+and	O
+the	O
+anterior	B-KEY
+eye	I-KEY
+were	O
+excellent	O
+;	O
+image	B-KEY
+quality	I-KEY
+of	O
+the	O
+optic	B-KEY
+disc	I-KEY
+and	O
+macula	O
+were	O
+good	O
+enough	O
+for	O
+tele-ophthalmology	B-KEY
+.	O
+Further	O
+studies	O
+are	O
+needed	O
+to	O
+evaluate	O
+the	O
+usefulness	O
+of	O
+the	O
+equipment	O
+in	O
+different	O
+clinical	B-KEY
+conditions	I-KEY
+
+Extending	O
+Kamp	O
+'s	O
+theorem	O
+to	O
+model	B-KEY
+time	I-KEY
+granularity	I-KEY
+In	O
+this	O
+paper	O
+,	O
+a	O
+generalization	O
+of	O
+Kamp	O
+'s	O
+theorem	O
+relative	O
+to	O
+the	O
+functional	B-KEY
+completeness	I-KEY
+of	O
+the	O
+until	B-KEY
+operator	I-KEY
+is	O
+proved	O
+.	O
+Such	O
+a	O
+generalization	O
+consists	O
+in	O
+showing	O
+the	O
+functional	B-KEY
+completeness	I-KEY
+of	O
+more	O
+expressive	O
+temporal	B-KEY
+operators	I-KEY
+with	O
+respect	O
+to	O
+the	O
+extension	O
+of	O
+the	O
+first-order	B-KEY
+theory	I-KEY
+of	O
+linear	B-KEY
+orders	I-KEY
+MFO	O
+-LSB-	O
+<	O
+-RSB-	O
+with	O
+an	O
+extra	O
+binary	B-KEY
+relational	I-KEY
+symbol	I-KEY
+.	O
+The	O
+result	O
+is	O
+motivated	O
+by	O
+the	O
+search	O
+of	O
+a	O
+modal	O
+language	O
+capable	O
+of	O
+expressing	O
+properties	O
+and	O
+operators	O
+suitable	O
+to	O
+model	B-KEY
+time	I-KEY
+granularity	I-KEY
+in	O
+omega	O
+-	O
+layered	O
+temporal	O
+structures	O
+
+Robustness	O
+of	O
+trajectories	O
+with	O
+finite	B-KEY
+time	I-KEY
+extent	I-KEY
+The	O
+problem	O
+of	O
+estimating	O
+perturbation	B-KEY
+bounds	I-KEY
+of	O
+finite	O
+trajectories	O
+is	O
+considered	O
+.	O
+The	O
+trajectory	O
+is	O
+assumed	O
+to	O
+be	O
+generated	O
+by	O
+a	O
+linear	B-KEY
+system	I-KEY
+with	O
+uncertainty	B-KEY
+characterized	O
+in	O
+terms	O
+of	O
+integral	B-KEY
+quadratic	I-KEY
+constraints	I-KEY
+.	O
+It	O
+is	O
+shown	O
+that	O
+such	O
+perturbation	B-KEY
+bounds	I-KEY
+can	O
+be	O
+obtained	O
+as	O
+the	O
+solution	O
+to	O
+a	O
+nonconvex	B-KEY
+quadratic	I-KEY
+optimization	I-KEY
+problem	I-KEY
+,	O
+which	O
+can	O
+be	O
+addressed	O
+using	O
+Lagrange	B-KEY
+relaxation	I-KEY
+.	O
+The	O
+result	O
+can	O
+be	O
+used	O
+in	O
+robustness	B-KEY
+analysis	I-KEY
+of	O
+hybrid	B-KEY
+systems	I-KEY
+and	O
+switched	B-KEY
+dynamical	I-KEY
+systems	I-KEY
+
+The	O
+necessity	O
+of	O
+real-time-fact	O
+and	O
+fiction	O
+in	O
+digital	O
+reference	O
+systems	O
+Current	O
+discussions	O
+and	O
+trends	O
+in	O
+digital	O
+reference	O
+have	O
+emphasized	O
+the	O
+use	O
+of	O
+real-time	B-KEY
+digital	I-KEY
+reference	I-KEY
+services	I-KEY
+.	O
+Recent	O
+articles	O
+have	O
+questioned	O
+both	O
+the	O
+utility	O
+and	O
+use	O
+of	O
+asynchronous	B-KEY
+services	I-KEY
+such	O
+as	O
+e-mail	B-KEY
+.	O
+This	O
+article	O
+uses	O
+data	O
+from	O
+the	O
+AskERIC	B-KEY
+digital	O
+reference	O
+service	O
+to	O
+demonstrate	O
+that	O
+asynchronous	B-KEY
+services	I-KEY
+are	O
+not	O
+only	O
+useful	O
+and	O
+used	O
+,	O
+but	O
+may	O
+have	O
+greater	O
+utility	O
+than	O
+real-time	O
+systems	O
+
+Responding	O
+to	O
+market	B-KEY
+trends	I-KEY
+with	O
+predictive	B-KEY
+segmentation	I-KEY
+-LSB-	O
+health	O
+care	O
+-RSB-	O
+Technology	O
+and	O
+technological	O
+advances	O
+have	O
+always	O
+been	O
+a	O
+part	O
+of	O
+healthcare	B-KEY
+,	O
+but	O
+often	O
+it	O
+'s	O
+advances	O
+in	O
+treatment	O
+machinery	O
+and	O
+materials	O
+that	O
+get	O
+the	O
+attention	O
+.	O
+However	O
+,	O
+technology	O
+gains	O
+also	O
+occur	O
+behind	O
+the	O
+scenes	O
+in	O
+operations	O
+.	O
+One	O
+of	O
+the	O
+less	O
+glamorous	O
+but	O
+powerful	O
+technological	O
+advances	O
+available	O
+today	O
+is	O
+predictive	B-KEY
+segmentation	I-KEY
+,	O
+a	O
+phrase	O
+that	O
+means	O
+``	O
+a	O
+new	O
+way	O
+to	O
+assess	O
+and	O
+view	O
+individuals	O
+in	O
+the	O
+market	O
+based	O
+on	O
+their	O
+health	O
+status	O
+and	O
+health	O
+needs	O
+.	O
+''	O
+Sophisticated	O
+databases	O
+,	O
+data	B-KEY
+mining	I-KEY
+,	O
+neural	B-KEY
+networks	I-KEY
+and	O
+statistical	O
+capabilities	O
+have	O
+enabled	O
+the	O
+development	O
+of	O
+predictive	B-KEY
+segmentation	I-KEY
+techniques	O
+.	O
+These	O
+predictive	O
+models	O
+for	O
+healthcare	B-KEY
+can	O
+identify	O
+who	O
+is	O
+likely	O
+to	O
+need	O
+certain	O
+services	O
+and	O
+who	O
+is	O
+likely	O
+to	O
+become	O
+ill	O
+.	O
+They	O
+are	O
+a	O
+significant	O
+departure	O
+from	O
+various	O
+geographical	O
+and	O
+attitudinal	O
+segmentation	O
+methods	O
+that	O
+healthcare	B-KEY
+strategists	O
+have	O
+used	O
+in	O
+the	O
+past	O
+to	O
+gain	O
+a	O
+better	O
+understanding	O
+of	O
+their	O
+customers	O
+
+Convergence	O
+of	O
+a	O
+finite	B-KEY
+volume	I-KEY
+scheme	I-KEY
+for	O
+nonlinear	B-KEY
+degenerate	I-KEY
+parabolic	I-KEY
+equations	I-KEY
+One	O
+approximates	O
+the	O
+entropy	B-KEY
+weak	I-KEY
+solution	I-KEY
+u	O
+of	O
+a	O
+nonlinear	O
+parabolic	O
+degenerate	O
+equation	O
+u/sub	O
+t	O
+/	O
++	O
+div	O
+-LRB-	O
+qf	O
+-LRB-	O
+u	O
+-RRB-	O
+-RRB-	O
+-	O
+Delta	O
+phi	O
+-LRB-	O
+u	O
+-RRB-	O
+=	O
+0	O
+by	O
+a	O
+piecewise	B-KEY
+constant	I-KEY
+function	I-KEY
+u/sub	O
+D	O
+/	O
+using	O
+a	O
+discretization	O
+D	O
+in	O
+space	O
+and	O
+time	O
+and	O
+a	O
+finite	B-KEY
+volume	I-KEY
+scheme	I-KEY
+.	O
+The	O
+convergence	O
+of	O
+u/sub	O
+D	O
+/	O
+to	O
+u	O
+is	O
+shown	O
+as	O
+the	O
+size	O
+of	O
+the	O
+space	O
+and	O
+time	O
+steps	O
+tend	O
+to	O
+zero	O
+.	O
+In	O
+a	O
+first	O
+step	O
+,	O
+estimates	O
+on	O
+u/sub	O
+D	O
+/	O
+are	O
+used	O
+to	O
+prove	O
+the	O
+convergence	O
+,	O
+up	O
+to	O
+a	O
+subsequence	O
+,	O
+of	O
+u/sub	O
+D	O
+/	O
+to	O
+a	O
+measure	O
+valued	O
+entropy	O
+solution	O
+-LRB-	O
+called	O
+here	O
+an	O
+entropy	O
+process	O
+solution	O
+-RRB-	O
+.	O
+A	O
+result	O
+of	O
+uniqueness	O
+of	O
+the	O
+entropy	O
+process	O
+solution	O
+is	O
+proved	O
+,	O
+yielding	O
+the	O
+strong	B-KEY
+convergence	I-KEY
+of	O
+u/sub	O
+D	O
+/	O
+to	O
+u	O
+.	O
+Some	O
+numerical	B-KEY
+results	I-KEY
+on	O
+a	O
+model	B-KEY
+equation	I-KEY
+are	O
+shown	O
+
+Exploiting	O
+structure	O
+in	O
+quantified	B-KEY
+formulas	I-KEY
+We	O
+study	O
+the	O
+computational	O
+problem	O
+``	O
+find	O
+the	O
+value	O
+of	O
+the	O
+quantified	B-KEY
+formula	I-KEY
+obtained	O
+by	O
+quantifying	O
+the	O
+variables	O
+in	O
+a	O
+sum	O
+of	O
+terms	O
+.	O
+''	O
+The	O
+``	O
+sum	O
+''	O
+can	O
+be	O
+based	O
+on	O
+any	O
+commutative	B-KEY
+monoid	I-KEY
+,	O
+the	O
+``	O
+quantifiers	O
+''	O
+need	O
+only	O
+satisfy	O
+two	O
+simple	O
+conditions	O
+,	O
+and	O
+the	O
+variables	O
+can	O
+have	O
+any	O
+finite	O
+domain	O
+.	O
+This	O
+problem	O
+is	O
+a	O
+generalization	O
+of	O
+the	O
+problem	O
+``	O
+given	O
+a	O
+sum-of-products	O
+of	O
+terms	O
+,	O
+find	O
+the	O
+value	O
+of	O
+the	O
+sum	O
+''	O
+studied	O
+by	O
+R.E.	O
+Stearns	O
+and	O
+H.B.	O
+Hunt	O
+III	O
+-LRB-	O
+1996	O
+-RRB-	O
+.	O
+A	O
+data	B-KEY
+structure	I-KEY
+called	O
+a	O
+``	O
+structure	B-KEY
+tree	I-KEY
+''	O
+is	O
+defined	O
+which	O
+displays	O
+information	O
+about	O
+``	O
+subproblems	O
+''	O
+that	O
+can	O
+be	O
+solved	O
+independently	O
+during	O
+the	O
+process	O
+of	O
+evaluating	O
+the	O
+formula	O
+.	O
+Some	O
+formulas	O
+have	O
+``	O
+good	O
+''	O
+structure	B-KEY
+trees	I-KEY
+which	O
+enable	O
+certain	O
+generic	B-KEY
+algorithms	I-KEY
+to	O
+evaluate	O
+the	O
+formulas	O
+in	O
+significantly	O
+less	O
+time	O
+than	O
+by	O
+brute	O
+force	O
+evaluation	O
+.	O
+By	O
+``	O
+generic	B-KEY
+algorithm	I-KEY
+,	O
+''	O
+we	O
+mean	O
+an	O
+algorithm	O
+constructed	O
+from	O
+uninterpreted	O
+function	B-KEY
+symbols	I-KEY
+,	O
+quantifier	B-KEY
+symbols	I-KEY
+,	O
+and	O
+monoid	B-KEY
+operations	I-KEY
+.	O
+The	O
+algebraic	O
+nature	O
+of	O
+the	O
+model	O
+facilitates	O
+a	O
+formal	O
+treatment	O
+of	O
+``	O
+local	O
+reductions	O
+''	O
+based	O
+on	O
+the	O
+``	O
+local	O
+replacement	O
+''	O
+of	O
+terms	O
+.	O
+Such	O
+local	O
+reductions	O
+``	O
+preserve	O
+formula	O
+structure	O
+''	O
+in	O
+the	O
+sense	O
+that	O
+structure	B-KEY
+trees	I-KEY
+with	O
+nice	O
+properties	O
+transform	O
+into	O
+structure	B-KEY
+trees	I-KEY
+with	O
+similar	O
+properties	O
+.	O
+These	O
+local	O
+reductions	O
+can	O
+also	O
+be	O
+used	O
+to	O
+transform	O
+hierarchical	B-KEY
+specified	I-KEY
+problems	I-KEY
+with	O
+useful	O
+structure	O
+into	O
+hierarchically	B-KEY
+specified	I-KEY
+problems	I-KEY
+having	O
+similar	O
+structure	O
+
+Training	O
+multilayer	B-KEY
+perceptrons	I-KEY
+via	O
+minimization	B-KEY
+of	O
+sum	O
+of	O
+ridge	B-KEY
+functions	I-KEY
+Motivated	O
+by	O
+the	O
+problem	O
+of	O
+training	O
+multilayer	B-KEY
+perceptrons	I-KEY
+in	O
+neural	B-KEY
+networks	I-KEY
+,	O
+we	O
+consider	O
+the	O
+problem	O
+of	O
+minimizing	B-KEY
+E	O
+-LRB-	O
+x	O
+-RRB-	O
+=	O
+Sigma	O
+/	O
+sub	O
+i	O
+=	O
+1	O
+/	O
+/	O
+sup	O
+n	O
+/	O
+f/sub	O
+i	O
+/	O
+-LRB-	O
+xi	O
+/	O
+sub	O
+i	O
+/	O
+.	O
+x	O
+-RRB-	O
+,	O
+where	O
+xi	O
+/	O
+sub	O
+i	O
+/	O
+in	O
+R/sup	O
+S	O
+/	O
+,	O
+1	O
+<	O
+or	O
+=	O
+i	O
+<	O
+or	O
+=	O
+n	O
+,	O
+and	O
+each	O
+f/sub	O
+i	O
+/	O
+-LRB-	O
+xi	O
+/	O
+sub	O
+i	O
+/	O
+.	O
+x	O
+-RRB-	O
+is	O
+a	O
+ridge	B-KEY
+function	I-KEY
+.	O
+We	O
+show	O
+that	O
+when	O
+n	O
+is	O
+small	O
+the	O
+problem	O
+of	O
+minimizing	B-KEY
+E	O
+can	O
+be	O
+treated	O
+as	O
+one	O
+of	O
+minimizing	B-KEY
+univariate	B-KEY
+functions	I-KEY
+,	O
+and	O
+we	O
+use	O
+the	O
+gradient	B-KEY
+algorithms	I-KEY
+for	O
+minimizing	B-KEY
+E	O
+when	O
+n	O
+is	O
+moderately	O
+large	O
+.	O
+For	O
+a	O
+large	O
+n	O
+,	O
+we	O
+present	O
+the	O
+online	B-KEY
+gradient	I-KEY
+algorithms	I-KEY
+and	O
+especially	O
+show	O
+the	O
+monotonicity	O
+and	O
+weak	O
+convergence	O
+of	O
+the	O
+algorithms	O
+
+Migrating	O
+to	O
+public	B-KEY
+librarianship	I-KEY
+:	O
+depart	O
+on	O
+time	O
+to	O
+ensure	O
+a	O
+smooth	O
+flight	O
+Career	B-KEY
+change	I-KEY
+can	O
+be	O
+a	O
+difficult	O
+,	O
+time-consuming	O
+,	O
+and	O
+anxiety-laden	O
+process	O
+for	O
+anyone	O
+contemplating	O
+this	O
+important	O
+decision	O
+.	O
+The	O
+challenges	O
+faced	O
+by	O
+librarians	O
+considering	O
+the	O
+move	O
+from	O
+academic	O
+to	O
+public	B-KEY
+librarianship	I-KEY
+can	O
+be	O
+equally	O
+and	O
+significantly	O
+demanding	O
+.	O
+To	O
+most	O
+outsiders	O
+,	O
+at	O
+least	O
+on	O
+the	O
+surface	O
+,	O
+it	O
+may	O
+appear	O
+to	O
+be	O
+a	O
+quick	O
+and	O
+easy	O
+transition	O
+to	O
+make	O
+,	O
+but	O
+some	O
+professional	B-KEY
+librarians	I-KEY
+recognize	O
+the	O
+distinct	O
+differences	O
+between	O
+these	O
+areas	O
+of	O
+librarianship	O
+.	O
+Although	O
+the	O
+ubiquitous	O
+nature	O
+of	O
+technology	O
+has	O
+brought	O
+the	O
+various	O
+work	B-KEY
+responsibilities	I-KEY
+of	O
+academic	O
+and	O
+public	O
+librarians	O
+closer	O
+together	O
+during	O
+the	O
+last	O
+decade	O
+,	O
+there	O
+remain	O
+key	O
+differences	O
+in	O
+job-related	B-KEY
+duties	I-KEY
+and	O
+the	O
+work	B-KEY
+environments	I-KEY
+.	O
+These	O
+dissimilarities	O
+pose	O
+meaningful	O
+hurdles	O
+to	O
+leap	O
+for	O
+academic	O
+librarians	O
+wishing	O
+to	O
+migrate	O
+to	O
+the	O
+public	O
+sector	O
+.	O
+The	O
+paper	O
+considers	O
+the	O
+variations	O
+between	O
+academic	O
+and	O
+public	B-KEY
+librarianship	I-KEY
+
+Neural	O
+networks	O
+for	O
+web	B-KEY
+content	I-KEY
+filtering	I-KEY
+With	O
+the	O
+proliferation	O
+of	O
+harmful	O
+Internet	O
+content	O
+such	O
+as	O
+pornography	O
+,	O
+violence	B-KEY
+,	O
+and	O
+hate	O
+messages	O
+,	O
+effective	O
+content-filtering	O
+systems	O
+are	O
+essential	O
+.	O
+Many	O
+Web-filtering	O
+systems	O
+are	O
+commercially	O
+available	O
+,	O
+and	O
+potential	O
+users	O
+can	O
+download	O
+trial	O
+versions	O
+from	O
+the	O
+Internet	O
+.	O
+However	O
+,	O
+the	O
+techniques	O
+these	O
+systems	O
+use	O
+are	O
+insufficiently	O
+accurate	O
+and	O
+do	O
+not	O
+adapt	O
+well	O
+to	O
+the	O
+ever-changing	O
+Web	O
+.	O
+To	O
+solve	O
+this	O
+problem	O
+,	O
+we	O
+propose	O
+using	O
+artificial	B-KEY
+neural	I-KEY
+networks	I-KEY
+to	O
+classify	O
+Web	O
+pages	O
+during	O
+content	O
+filtering	O
+.	O
+We	O
+focus	O
+on	O
+blocking	O
+pornography	O
+because	O
+it	O
+is	O
+among	O
+the	O
+most	O
+prolific	O
+and	O
+harmful	B-KEY
+Web	I-KEY
+content	I-KEY
+.	O
+However	O
+,	O
+our	O
+general	O
+framework	O
+is	O
+adaptable	O
+for	O
+filtering	O
+other	O
+objectionable	O
+Web	O
+material	O
+
+The	O
+semantic	B-KEY
+Web	I-KEY
+:	O
+differentiating	O
+between	O
+taxonomies	O
+and	O
+ontologies	O
+There	O
+is	O
+a	O
+new	O
+vision	O
+of	O
+the	O
+WWW	B-KEY
+-	O
+the	O
+semantic	B-KEY
+Web	I-KEY
+-	O
+that	O
+will	O
+dramatically	O
+improve	O
+Web-based	O
+services	O
+and	O
+products	O
+.	O
+It	O
+creates	O
+a	O
+setting	O
+where	O
+software	B-KEY
+agents	I-KEY
+perform	O
+everyday	O
+jobs	O
+for	O
+end-users	O
+.	O
+Deploying	O
+hierarchies	B-KEY
+,	O
+metadata	B-KEY
+,	O
+and	O
+structured	B-KEY
+vocabularies	I-KEY
+,	O
+the	O
+semantic	B-KEY
+Web	I-KEY
+expands	O
+basic	O
+Internet	B-KEY
+functions	O
+
+The	O
+n-tier	B-KEY
+hub	I-KEY
+technology	I-KEY
+During	O
+2001	O
+,	O
+the	O
+Enterprise	O
+Engineering	O
+Laboratory	O
+at	O
+George	O
+Mason	O
+University	O
+was	O
+contracted	O
+by	O
+the	O
+Boeing	B-KEY
+Company	I-KEY
+to	O
+develop	O
+an	O
+eHub	O
+capability	O
+for	O
+aerospace	B-KEY
+suppliers	I-KEY
+in	O
+Taiwan	B-KEY
+.	O
+In	O
+a	O
+laboratory	O
+environment	O
+,	O
+the	O
+core	O
+technology	O
+was	O
+designed	O
+,	O
+developed	O
+,	O
+and	O
+tested	O
+,	O
+and	O
+now	O
+a	O
+large	O
+first-tier	O
+aerospace	B-KEY
+supplier	I-KEY
+in	O
+Taiwan	B-KEY
+is	O
+commercializing	O
+the	O
+technology	O
+.	O
+The	O
+project	O
+objective	O
+was	O
+to	O
+provide	O
+layered	O
+network	O
+and	O
+application	O
+services	O
+for	O
+transporting	O
+XML-based	B-KEY
+business	I-KEY
+transaction	I-KEY
+flows	I-KEY
+across	O
+multi-tier	O
+,	O
+heterogeneous	O
+data	O
+processing	O
+environments	O
+.	O
+This	O
+paper	O
+documents	O
+the	O
+business	B-KEY
+scenario	I-KEY
+,	O
+the	O
+eHub	O
+application	O
+,	O
+and	O
+the	O
+network	B-KEY
+transport	I-KEY
+mechanisms	I-KEY
+that	O
+were	O
+used	O
+to	O
+build	O
+the	O
+n-tier	O
+hub	O
+.	O
+In	O
+contrast	O
+to	O
+most	O
+eHubs	O
+,	O
+this	O
+solution	O
+takes	O
+the	O
+point	O
+of	O
+view	O
+of	O
+suppliers	O
+,	O
+pushing	O
+data	O
+in	O
+accordance	O
+with	O
+supplier	O
+requirements	O
+;	O
+hence	O
+,	O
+enhancing	O
+the	O
+probability	O
+of	O
+supplier	B-KEY
+adoption	I-KEY
+.	O
+The	O
+unique	O
+contribution	O
+of	O
+this	O
+project	O
+is	O
+the	O
+development	O
+of	O
+an	O
+eHub	O
+that	O
+meets	O
+the	O
+needs	O
+of	O
+small	B-KEY
+and	I-KEY
+medium	I-KEY
+enterprises	I-KEY
+-LRB-	O
+SMEs	O
+-RRB-	O
+and	O
+first-tier	B-KEY
+suppliers	I-KEY
+
+Multichannel	B-KEY
+scaler	I-KEY
+for	O
+general	B-KEY
+statistical	I-KEY
+analysis	I-KEY
+of	O
+dynamic	B-KEY
+light	I-KEY
+scattering	I-KEY
+A	O
+four	B-KEY
+channel	I-KEY
+scaler	I-KEY
+for	O
+counting	O
+applications	O
+has	O
+been	O
+designed	O
+and	O
+built	O
+using	O
+a	O
+standard	B-KEY
+high	I-KEY
+transfer	I-KEY
+rate	I-KEY
+parallel	I-KEY
+computer	I-KEY
+interface	I-KEY
+bus	O
+parallel	O
+data	O
+card	O
+.	O
+The	O
+counter	O
+section	O
+is	O
+based	O
+on	O
+standard	O
+complex	B-KEY
+programmable	I-KEY
+logic	I-KEY
+device	I-KEY
+integrated	O
+circuits	O
+.	O
+With	O
+a	O
+200	B-KEY
+MHz	I-KEY
+Pentium	B-KEY
+based	I-KEY
+host	I-KEY
+PC	I-KEY
+a	O
+sustained	O
+counting	O
+and	O
+data	O
+transfer	O
+with	O
+channel	O
+widths	O
+as	O
+short	O
+as	O
+200	B-KEY
+ns	I-KEY
+for	O
+a	O
+single	O
+channel	O
+is	O
+realized	O
+.	O
+The	O
+use	O
+of	O
+the	O
+multichannel	B-KEY
+scaler	I-KEY
+is	O
+demonstrated	O
+in	O
+dynamic	B-KEY
+light	I-KEY
+scattering	I-KEY
+experiments	O
+.	O
+The	O
+recorded	O
+traces	O
+are	O
+analyzed	O
+with	O
+wavelet	O
+and	O
+other	O
+statistical	O
+techniques	O
+to	O
+obtain	O
+transient	O
+changes	O
+in	O
+the	O
+properties	O
+of	O
+the	O
+scattered	O
+light	O
+
+Identification	B-KEY
+of	O
+linear	B-KEY
+parameter	I-KEY
+varying	I-KEY
+models	I-KEY
+We	O
+consider	O
+identification	B-KEY
+of	O
+a	O
+certain	O
+class	O
+of	O
+discrete-time	B-KEY
+nonlinear	I-KEY
+systems	I-KEY
+known	O
+as	O
+linear	O
+parameter	O
+varying	O
+system	O
+.	O
+We	O
+assume	O
+that	O
+inputs	O
+,	O
+outputs	O
+and	O
+the	O
+scheduling	B-KEY
+parameters	I-KEY
+are	O
+directly	O
+measured	O
+,	O
+and	O
+a	O
+form	O
+of	O
+the	O
+functional	B-KEY
+dependence	I-KEY
+of	O
+the	O
+system	B-KEY
+coefficients	I-KEY
+on	O
+the	O
+parameters	O
+is	O
+known	O
+.	O
+We	O
+show	O
+how	O
+this	O
+identification	B-KEY
+problem	O
+can	O
+be	O
+reduced	O
+to	O
+a	O
+linear	B-KEY
+regression	I-KEY
+,	O
+and	O
+provide	O
+compact	O
+formulae	O
+for	O
+the	O
+corresponding	O
+least	O
+mean	O
+square	O
+and	O
+recursive	B-KEY
+least-squares	I-KEY
+algorithms	I-KEY
+.	O
+We	O
+derive	O
+conditions	O
+on	O
+persistency	O
+of	O
+excitation	O
+in	O
+terms	O
+of	O
+the	O
+inputs	O
+and	O
+scheduling	B-KEY
+parameter	I-KEY
+trajectories	O
+when	O
+the	O
+functional	O
+dependence	O
+is	O
+of	O
+polynomial	O
+type	O
+.	O
+These	O
+conditions	O
+have	O
+a	O
+natural	O
+polynomial	B-KEY
+interpolation	I-KEY
+interpretation	I-KEY
+,	O
+and	O
+do	O
+not	O
+require	O
+the	O
+scheduling	B-KEY
+parameter	I-KEY
+trajectories	O
+to	O
+vary	O
+slowly	O
+.	O
+This	O
+method	O
+is	O
+illustrated	O
+with	O
+a	O
+simulation	O
+example	O
+using	O
+two	O
+different	O
+parameter	B-KEY
+trajectories	I-KEY
+
+Nurture	O
+the	O
+geek	O
+in	O
+you	O
+-LSB-	O
+accounting	O
+on	O
+the	O
+Internet	B-KEY
+-RSB-	O
+When	O
+chartered	B-KEY
+accountants	I-KEY
+focus	O
+on	O
+IT	O
+,	O
+it	O
+'s	O
+not	O
+simply	O
+because	O
+we	O
+think	O
+technology	O
+is	O
+neat	O
+.	O
+We	O
+keep	O
+on	O
+top	O
+of	O
+tech	O
+trends	O
+and	O
+issues	O
+because	O
+it	O
+helps	O
+us	O
+do	O
+our	O
+jobs	O
+well	O
+.	O
+We	O
+need	O
+to	O
+know	O
+how	O
+to	O
+best	O
+manage	O
+and	O
+implement	O
+the	O
+wealth	O
+of	O
+technology	O
+systems	O
+within	O
+out	O
+client	O
+base	O
+or	O
+employer	O
+,	O
+as	O
+well	O
+as	O
+to	O
+determine	O
+on	O
+an	O
+ongoing	O
+basis	O
+how	O
+evolving	O
+technologies	O
+might	O
+affect	O
+business	O
+strategies	O
+,	O
+threats	O
+and	O
+opportunities	O
+.	O
+One	O
+way	O
+to	O
+stay	O
+current	O
+with	O
+technology	O
+is	O
+by	O
+monitoring	O
+the	O
+online	O
+drumbeat	O
+.	O
+Imagine	O
+the	O
+Internet	B-KEY
+as	O
+an	O
+endless	O
+conversation	O
+of	O
+millions	O
+of	O
+chattering	O
+voices	O
+,	O
+each	O
+focusing	O
+on	O
+a	O
+multitude	O
+of	O
+topics	O
+and	O
+issues	O
+.	O
+It	O
+'s	O
+not	O
+surprising	O
+that	O
+a	O
+great	O
+deal	O
+of	O
+the	O
+information	O
+relates	O
+to	O
+technology	O
+itself	O
+,	O
+and	O
+if	O
+you	O
+learn	O
+how	O
+to	O
+tune	O
+in	O
+to	O
+the	O
+drumbeat	O
+,	O
+you	O
+can	O
+keep	O
+yourself	O
+informed	O
+
+Passing	O
+the	O
+image	O
+test	O
+-LSB-	O
+imaging	O
+accreditation	B-KEY
+-RSB-	O
+Accredited	B-KEY
+imaging	B-KEY
+qualifications	I-KEY
+,	O
+hot	O
+on	O
+the	O
+heels	O
+of	O
+Microsoft	O
+,	O
+Cisco	O
+and	O
+others	O
+,	O
+are	O
+taking	O
+off	O
+in	O
+the	O
+USA	O
+.	O
+Dave	O
+Tyler	O
+looks	O
+at	O
+the	O
+CDIA	O
++	O
+qualification	O
+that	O
+looks	O
+likely	O
+to	O
+become	O
+the	O
+exam	O
+of	O
+choice	O
+for	O
+the	O
+DM	O
+industry	O
+
+Regional	B-KEY
+flux	I-KEY
+target	I-KEY
+with	O
+minimum	B-KEY
+energy	I-KEY
+An	O
+extension	O
+of	O
+a	O
+gradient	B-KEY
+controllability	I-KEY
+problem	I-KEY
+to	O
+the	O
+case	O
+where	O
+the	O
+target	B-KEY
+subregion	I-KEY
+is	O
+a	O
+part	O
+of	O
+the	O
+boundary	O
+of	O
+a	O
+parabolic	O
+system	O
+domain	O
+is	O
+discussed	O
+.	O
+A	O
+definition	O
+and	O
+some	O
+properties	O
+adapted	O
+to	O
+this	O
+case	O
+are	O
+presented	O
+.	O
+The	O
+focus	O
+is	O
+on	O
+the	O
+characterisation	O
+of	O
+the	O
+control	O
+achieving	O
+a	O
+regional	B-KEY
+boundary	I-KEY
+gradient	I-KEY
+target	I-KEY
+with	O
+minimum	B-KEY
+energy	I-KEY
+.	O
+An	O
+approach	O
+is	O
+developed	O
+that	O
+leads	O
+to	O
+a	O
+numerical	B-KEY
+algorithm	I-KEY
+for	O
+the	O
+computation	O
+of	O
+optimal	B-KEY
+control	I-KEY
+.	O
+Numerical	O
+illustrations	O
+show	O
+the	O
+efficiency	O
+of	O
+the	O
+approach	O
+and	O
+lead	O
+to	O
+conjectures	O
+
+Differential	B-KEY
+calculus	I-KEY
+for	O
+p-norms	O
+of	O
+complex-valued	O
+vector	B-KEY
+functions	I-KEY
+with	O
+applications	O
+For	O
+complex-valued	O
+n-dimensional	O
+vector	B-KEY
+functions	I-KEY
+t	O
+to	O
+s	O
+-LRB-	O
+t	O
+-RRB-	O
+,	O
+supposed	O
+to	O
+be	O
+sufficiently	O
+smooth	O
+,	O
+the	O
+differentiability	O
+properties	O
+of	O
+the	O
+mapping	B-KEY
+t	O
+to	O
+|	O
+|	O
+s	O
+-LRB-	O
+t	O
+-RRB-	O
+|	O
+|	O
+/	O
+sub	O
+p	O
+/	O
+at	O
+every	O
+point	O
+t	O
+=	O
+t/sub	O
+0	O
+/	O
+epsilon	O
+R/sub	O
+0	O
+/	O
+/	O
+sup	O
++	O
+/	O
+:	O
+=	O
+-LCB-	O
+t	O
+epsilon	O
+R	O
+|	O
+t	O
+>	O
+or	O
+=	O
+0	O
+-RCB-	O
+are	O
+investigated	O
+,	O
+where	O
+|	O
+|	O
+.	O
+|	O
+|	O
+/	O
+sub	O
+p	O
+/	O
+is	O
+the	O
+usual	O
+vector	B-KEY
+norm	I-KEY
+in	O
+C/sup	O
+n	O
+/	O
+resp	O
+.	O
+R/sup	O
+n	O
+/	O
+,	O
+for	O
+p	O
+epsilon	O
+-LSB-	O
+1	O
+,	O
+o	O
+infinity	O
+-RSB-	O
+.	O
+Moreover	O
+,	O
+formulae	O
+for	O
+the	O
+first	O
+three	O
+right	O
+derivatives	O
+D/sub	O
++	O
+/	O
+/	O
+sup	O
+k	O
+/	O
+|	O
+|	O
+s	O
+-LRB-	O
+t	O
+-RRB-	O
+|	O
+|	O
+/	O
+sub	O
+p	O
+/	O
+,	O
+k	O
+=	O
+1	O
+,	O
+2,3	O
+are	O
+determined	O
+.	O
+These	O
+formulae	O
+are	O
+applied	O
+to	O
+vibration	B-KEY
+problems	I-KEY
+by	O
+computing	O
+the	O
+best	O
+upper	O
+bounds	O
+on	O
+|	O
+|	O
+s	O
+-LRB-	O
+t	O
+-RRB-	O
+|	O
+|	O
+/	O
+sub	O
+p	O
+/	O
+in	O
+certain	O
+classes	O
+of	O
+bounds	O
+.	O
+These	O
+results	O
+can	O
+not	O
+be	O
+obtained	O
+by	O
+the	O
+methods	O
+used	O
+so	O
+far	O
+.	O
+The	O
+systematic	O
+use	O
+of	O
+the	O
+differential	B-KEY
+calculus	I-KEY
+for	O
+vector	B-KEY
+norms	I-KEY
+,	O
+as	O
+done	O
+here	O
+for	O
+the	O
+first	O
+time	O
+,	O
+could	O
+lead	O
+to	O
+major	O
+advances	O
+also	O
+in	O
+other	O
+branches	O
+of	O
+mathematics	O
+and	O
+other	O
+sciences	O
+
+E-learning	B-KEY
+on	O
+the	O
+college	O
+campus	O
+:	O
+a	O
+help	O
+or	O
+hindrance	O
+to	O
+students	O
+learning	O
+objectives	O
+:	O
+a	O
+case	O
+study	O
+If	O
+you	O
+know	O
+how	O
+to	O
+surf	O
+the	O
+World	O
+Wide	O
+Web	O
+,	O
+have	O
+used	O
+email	O
+before	O
+,	O
+and	O
+can	O
+learn	O
+how	O
+to	O
+send	O
+an	O
+email	O
+attachment	O
+,	O
+then	O
+learning	O
+how	O
+to	O
+interact	O
+in	O
+an	O
+online	O
+course	O
+should	O
+not	O
+be	O
+difficult	O
+at	O
+all	O
+.	O
+In	O
+a	O
+way	O
+to	O
+find	O
+out	O
+,	O
+I	O
+decided	O
+to	O
+offer	O
+two	O
+identical	O
+courses	O
+,	O
+one	O
+of	O
+which	O
+would	O
+be	O
+offered	O
+online	O
+and	O
+the	O
+other	O
+the	O
+``	O
+traditional	O
+way	O
+''	O
+.	O
+I	O
+wanted	O
+to	O
+see	O
+how	O
+students	O
+would	O
+fare	O
+with	O
+identical	O
+material	O
+provided	O
+in	O
+each	O
+course	O
+.	O
+I	O
+wanted	O
+their	O
+anonymous	O
+feedback	O
+,	O
+when	O
+the	O
+course	O
+was	O
+over	O
+
+The	O
+open-source	O
+HCS	O
+project	O
+Despite	O
+the	O
+rumors	O
+,	O
+the	O
+HCS	B-KEY
+II	I-KEY
+project	O
+is	O
+not	O
+dead	O
+.	O
+In	O
+fact	O
+,	O
+HCS	O
+has	O
+been	O
+licensed	O
+and	O
+is	O
+now	O
+an	O
+open-source	O
+project	O
+.	O
+In	O
+this	O
+article	O
+,	O
+the	O
+author	O
+brings	O
+us	O
+up	O
+to	O
+speed	O
+on	O
+the	O
+HCS	B-KEY
+II	I-KEY
+project	O
+'s	O
+past	O
+,	O
+present	O
+,	O
+and	O
+future	O
+.	O
+The	O
+HCS	B-KEY
+II	I-KEY
+is	O
+an	O
+expandable	O
+,	O
+standalone	O
+,	O
+network-based	B-KEY
+-LRB-	O
+RS-485	O
+-RRB-	O
+,	O
+intelligent-node	O
+,	O
+industrial-oriented	O
+supervisory	O
+control	O
+-LRB-	O
+SC	O
+-RRB-	O
+system	O
+intended	O
+for	O
+demanding	O
+home	B-KEY
+control	I-KEY
+applications	O
+.	O
+The	O
+HCS	O
+incorporates	O
+direct	O
+and	O
+remote	O
+digital	O
+inputs	O
+and	O
+outputs	O
+,	O
+direct	O
+and	O
+remote	O
+analog	O
+inputs	O
+and	O
+outputs	O
+,	O
+real	O
+time	O
+or	O
+Boolean	O
+decision	O
+event	O
+triggering	O
+,	O
+X10	O
+transmission	O
+and	O
+reception	O
+,	O
+infrared	O
+remote	O
+control	O
+transmission	O
+and	O
+reception	O
+,	O
+remote	O
+LCDs	O
+,	O
+and	O
+a	O
+master	O
+console	O
+.	O
+Its	O
+program	O
+is	O
+compiled	O
+on	O
+a	O
+PC	O
+with	O
+the	O
+XPRESS	O
+compiler	O
+and	O
+then	O
+downloaded	O
+to	O
+the	O
+SC	O
+where	O
+it	O
+runs	O
+independently	O
+of	O
+the	O
+PC	O
+
+Adaptive	B-KEY
+tracking	I-KEY
+controller	I-KEY
+design	I-KEY
+for	O
+robotic	B-KEY
+systems	I-KEY
+using	O
+Gaussian	B-KEY
+wavelet	I-KEY
+networks	I-KEY
+An	O
+adaptive	B-KEY
+tracking	I-KEY
+control	I-KEY
+design	I-KEY
+for	O
+robotic	B-KEY
+systems	I-KEY
+using	O
+Gaussian	B-KEY
+wavelet	I-KEY
+networks	I-KEY
+is	O
+proposed	O
+.	O
+A	O
+Gaussian	B-KEY
+wavelet	I-KEY
+network	I-KEY
+with	O
+accurate	B-KEY
+approximation	I-KEY
+capability	I-KEY
+is	O
+employed	O
+to	O
+approximate	O
+the	O
+unknown	B-KEY
+dynamics	I-KEY
+of	O
+robotic	B-KEY
+systems	I-KEY
+by	O
+using	O
+an	O
+adaptive	B-KEY
+learning	I-KEY
+algorithm	I-KEY
+that	O
+can	O
+learn	O
+the	O
+parameters	O
+of	O
+the	O
+dilation	O
+and	O
+translation	O
+of	O
+Gaussian	O
+wavelet	O
+functions	O
+.	O
+Depending	O
+on	O
+the	O
+finite	O
+number	O
+of	O
+wavelet	O
+basis	O
+functions	O
+which	O
+result	O
+in	O
+inevitable	O
+approximation	B-KEY
+errors	I-KEY
+,	O
+a	O
+robust	B-KEY
+control	I-KEY
+law	I-KEY
+is	O
+provided	O
+to	O
+guarantee	O
+the	O
+stability	O
+of	O
+the	O
+closed-loop	O
+robotic	B-KEY
+system	I-KEY
+that	O
+can	O
+be	O
+proved	O
+by	O
+Lyapunov	B-KEY
+theory	I-KEY
+.	O
+Finally	O
+,	O
+the	O
+effectiveness	O
+of	O
+the	O
+Gaussian	O
+wavelet	O
+network-based	O
+control	O
+approach	O
+is	O
+illustrated	O
+through	O
+comparative	O
+simulations	O
+on	O
+a	O
+six-link	O
+robot	O
+manipulator	O
+
+Maybe	O
+it	O
+'s	O
+not	O
+too	O
+late	O
+to	O
+join	O
+the	O
+circus	O
+:	O
+books	O
+for	O
+midlife	B-KEY
+career	I-KEY
+management	I-KEY
+Midcareer	O
+librarians	B-KEY
+looking	O
+for	O
+career	O
+management	O
+help	O
+on	O
+the	O
+bookshelf	O
+face	O
+thousands	O
+of	O
+choices	O
+.	O
+This	O
+article	O
+reviews	O
+thirteen	O
+popular	O
+career	B-KEY
+self-help	I-KEY
+books	I-KEY
+.	O
+The	O
+reviewed	O
+books	O
+cover	O
+various	O
+aspects	O
+of	O
+career	O
+management	O
+and	O
+provide	O
+information	O
+on	O
+which	O
+might	O
+be	O
+best	O
+suited	O
+for	O
+particular	O
+goals	O
+,	O
+including	O
+career	B-KEY
+change	I-KEY
+,	O
+career	O
+tune-up	O
+,	O
+and	O
+personal	O
+and	O
+professional	B-KEY
+self-evaluation	I-KEY
+.	O
+The	O
+comments	O
+reflect	O
+issues	O
+of	O
+interest	O
+to	O
+midcareer	O
+professionals	O
+
+Taylor	B-KEY
+series	I-KEY
+based	O
+two-dimensional	B-KEY
+digital	I-KEY
+differentiators	I-KEY
+A	O
+new	O
+type	O
+of	O
+Taylor	B-KEY
+series	I-KEY
+based	O
+2-D	O
+finite	O
+difference	O
+approximation	O
+is	O
+presented	O
+,	O
+and	O
+it	O
+is	O
+shown	O
+that	O
+the	O
+coefficients	O
+of	O
+these	O
+approximations	O
+are	O
+not	O
+unique	O
+.	O
+Explicit	O
+formulas	O
+are	O
+presented	O
+for	O
+one	O
+of	O
+the	O
+possible	O
+sets	O
+of	O
+coefficients	O
+for	O
+an	O
+arbitrary	O
+order	O
+,	O
+by	O
+extending	O
+the	O
+previously	O
+presented	O
+1-D	O
+approximations	O
+.	O
+These	O
+coefficients	O
+are	O
+implemented	O
+as	O
+maximally	O
+linear	O
+2-D	O
+FIR	O
+digital	O
+differentiators	O
+,	O
+and	O
+their	O
+formulas	O
+are	O
+modified	O
+to	O
+narrow	O
+the	O
+inaccuracy	O
+regions	O
+on	O
+the	O
+resultant	O
+frequency	B-KEY
+responses	I-KEY
+,	O
+close	O
+to	O
+the	O
+Nyquist	B-KEY
+frequencies	I-KEY
+
+Semantic	B-KEY
+B2B	I-KEY
+integration	I-KEY
+:	O
+issues	O
+in	O
+ontology-based	B-KEY
+approaches	I-KEY
+Solving	O
+queries	B-KEY
+to	O
+support	O
+e-commerce	B-KEY
+transactions	I-KEY
+can	O
+involve	O
+retrieving	O
+and	O
+integrating	O
+information	O
+from	O
+multiple	B-KEY
+information	I-KEY
+resources	I-KEY
+.	O
+Often	O
+,	O
+users	O
+do	O
+n't	O
+care	O
+which	O
+resources	O
+are	O
+used	O
+to	O
+answer	O
+their	O
+query	B-KEY
+.	O
+In	O
+such	O
+situations	O
+,	O
+the	O
+ideal	O
+solution	O
+would	O
+be	O
+to	O
+hide	O
+from	O
+the	O
+user	O
+the	O
+details	O
+of	O
+the	O
+resources	O
+involved	O
+in	O
+solving	O
+a	O
+particular	O
+query	B-KEY
+.	O
+An	O
+example	O
+would	O
+be	O
+providing	O
+seamless	O
+access	O
+to	O
+a	O
+set	O
+of	O
+heterogeneous	B-KEY
+electronic	I-KEY
+product	I-KEY
+catalogues	I-KEY
+.	O
+There	O
+are	O
+many	O
+problems	O
+that	O
+must	O
+be	O
+addressed	O
+before	O
+such	O
+a	O
+solution	O
+can	O
+be	O
+provided	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+discuss	O
+a	O
+number	O
+of	O
+these	O
+problems	O
+,	O
+indicate	O
+how	O
+we	O
+have	O
+addressed	O
+these	O
+and	O
+go	O
+on	O
+to	O
+describe	O
+the	O
+proof-of-concept	O
+demonstration	O
+system	O
+we	O
+have	O
+developed	O
+
+The	O
+impact	O
+of	O
+the	O
+product	O
+mix	O
+on	O
+the	O
+value	O
+of	O
+flexibility	O
+Product-mix	B-KEY
+flexibility	I-KEY
+is	O
+one	O
+of	O
+the	O
+major	O
+types	O
+of	O
+manufacturing	B-KEY
+flexibility	I-KEY
+,	O
+referring	O
+to	O
+the	O
+ability	O
+to	O
+produce	O
+a	O
+broad	O
+range	O
+of	O
+products	O
+or	O
+variants	O
+with	O
+presumed	O
+low	B-KEY
+changeover	I-KEY
+costs	I-KEY
+.	O
+The	O
+value	O
+of	O
+such	O
+a	O
+capability	O
+is	O
+important	O
+to	O
+establish	O
+for	O
+an	O
+industrial	B-KEY
+firm	I-KEY
+in	O
+order	O
+to	O
+ensure	O
+that	O
+the	O
+flexibility	O
+provided	O
+will	O
+be	O
+at	O
+the	O
+right	O
+level	O
+and	O
+used	O
+profitably	O
+rather	O
+than	O
+in	O
+excess	O
+of	O
+market	O
+requirements	O
+and	O
+consequently	O
+costly	O
+.	O
+We	O
+use	O
+option-pricing	B-KEY
+theory	I-KEY
+to	O
+analyse	O
+the	O
+impact	O
+of	O
+various	O
+product-mix	O
+issues	O
+on	O
+the	O
+value	O
+of	O
+flexibility	O
+.	O
+The	O
+real	B-KEY
+options	I-KEY
+model	I-KEY
+we	O
+use	O
+incorporates	O
+multiple	B-KEY
+products	I-KEY
+,	O
+capacity	B-KEY
+constraints	I-KEY
+as	O
+well	O
+as	O
+set-up	B-KEY
+costs	I-KEY
+.	O
+The	O
+issues	O
+treated	O
+here	O
+include	O
+the	O
+number	O
+of	O
+products	O
+,	O
+demand	B-KEY
+variability	I-KEY
+,	O
+correlation	O
+between	O
+products	O
+,	O
+and	O
+the	O
+relative	B-KEY
+demand	I-KEY
+distribution	I-KEY
+within	O
+the	O
+product	O
+mix	O
+.	O
+Thus	O
+,	O
+we	O
+are	O
+interested	O
+in	O
+the	O
+nature	O
+of	O
+the	O
+input	O
+data	O
+to	O
+analyse	O
+its	O
+effect	O
+on	O
+the	O
+value	O
+of	O
+flexibility	O
+.	O
+We	O
+also	O
+check	O
+the	O
+impact	O
+at	O
+different	O
+capacity	O
+levels	O
+.	O
+The	O
+results	O
+suggest	O
+that	O
+the	O
+value	O
+of	O
+flexibility	O
+-LRB-	O
+i	O
+-RRB-	O
+increases	O
+with	O
+an	O
+increasing	O
+number	O
+of	O
+products	O
+,	O
+-LRB-	O
+ii	O
+-RRB-	O
+decreases	O
+with	O
+increasing	O
+volatility	O
+of	O
+product	O
+demand	O
+,	O
+-LRB-	O
+iii	O
+-RRB-	O
+decreases	O
+the	O
+more	O
+positively	O
+correlated	O
+the	O
+demand	O
+is	O
+,	O
+and	O
+-LRB-	O
+iv	O
+-RRB-	O
+reduces	O
+for	O
+marginal	B-KEY
+capacity	I-KEY
+with	O
+increasing	O
+levels	O
+of	O
+capacity	O
+.	O
+Of	O
+these	O
+,	O
+the	O
+impact	O
+of	O
+positively	B-KEY
+correlated	I-KEY
+demand	I-KEY
+seems	O
+to	O
+be	O
+a	O
+major	O
+issue	O
+.	O
+However	O
+,	O
+the	O
+joint	O
+impact	O
+of	O
+the	O
+number	O
+of	O
+products	O
+and	O
+demand	B-KEY
+correlation	I-KEY
+showed	O
+some	O
+non-intuitive	O
+results	O
+
+p-Bezier	B-KEY
+curves	I-KEY
+,	O
+spirals	B-KEY
+,	O
+and	O
+sectrix	B-KEY
+curves	I-KEY
+We	O
+elucidate	O
+the	O
+connection	O
+between	O
+Bezier	O
+curves	O
+in	O
+polar	B-KEY
+coordinates	I-KEY
+,	O
+also	O
+called	O
+p-Bezier	O
+or	O
+focal	B-KEY
+Bezier	I-KEY
+curves	I-KEY
+,	O
+and	O
+certain	O
+families	O
+of	O
+spirals	B-KEY
+and	O
+sectrix	B-KEY
+curves	I-KEY
+.	O
+p-Bezier	B-KEY
+curves	I-KEY
+are	O
+the	O
+analogue	O
+in	O
+polar	B-KEY
+coordinates	I-KEY
+of	O
+nonparametric	O
+Bezier	O
+curves	O
+in	O
+Cartesian	O
+coordinates	O
+.	O
+Such	O
+curves	O
+form	O
+a	O
+subset	O
+of	O
+rational	B-KEY
+Bezier	I-KEY
+curves	I-KEY
+characterized	O
+by	O
+control	B-KEY
+points	I-KEY
+on	O
+radial	B-KEY
+directions	I-KEY
+regularly	O
+spaced	O
+with	O
+respect	O
+to	O
+the	O
+polar	B-KEY
+angle	I-KEY
+,	O
+and	O
+weights	O
+equal	O
+to	O
+the	O
+inverse	O
+of	O
+the	O
+polar	O
+radius	O
+.	O
+We	O
+show	O
+that	O
+this	O
+subset	O
+encompasses	O
+several	O
+classical	O
+sectrix	B-KEY
+curves	I-KEY
+,	O
+which	O
+solve	O
+geometrically	O
+the	O
+problem	O
+of	O
+dividing	O
+an	O
+angle	O
+into	O
+equal	B-KEY
+spans	I-KEY
+,	O
+and	O
+also	O
+spirals	B-KEY
+defining	O
+the	O
+trajectories	O
+of	O
+particles	O
+in	O
+central	B-KEY
+fields	I-KEY
+.	O
+First	O
+,	O
+we	O
+identify	O
+as	O
+p-Bezier	B-KEY
+curves	I-KEY
+a	O
+family	O
+of	O
+sinusoidal	B-KEY
+spirals	I-KEY
+that	O
+includes	O
+Tschirnhausen	O
+'s	O
+cubic	O
+.	O
+Second	O
+,	O
+the	O
+trisectrix	B-KEY
+of	O
+Maclaurin	O
+and	O
+their	O
+generalizations	O
+,	O
+called	O
+arachnidas	B-KEY
+.	O
+Finally	O
+,	O
+a	O
+special	O
+class	O
+of	O
+epi	B-KEY
+spirals	I-KEY
+that	O
+encompasses	O
+the	O
+trisectrix	O
+of	O
+Delanges	O
+
+The	O
+BLISS	B-KEY
+programming	I-KEY
+language	I-KEY
+:	O
+a	O
+history	O
+The	O
+BLISS	B-KEY
+programming	I-KEY
+language	I-KEY
+was	O
+invented	O
+by	O
+William	O
+A.	O
+Wulf	O
+and	O
+others	O
+at	O
+Carnegie-Mellon	O
+University	O
+in	O
+1969	O
+,	O
+originally	O
+for	O
+the	O
+DEC	O
+PDP-10	O
+.	O
+BLISS-10	O
+caught	O
+the	O
+interest	O
+of	O
+Ronald	O
+F.	O
+Brender	O
+of	O
+DEC	O
+-LRB-	O
+Digital	O
+Equipment	O
+Corporation	O
+-RRB-	O
+.	O
+After	O
+several	O
+years	O
+of	O
+collaboration	O
+,	O
+including	O
+the	O
+creation	O
+of	O
+BLISS-11	O
+for	O
+the	O
+PDP-11	O
+,	O
+BLISS	O
+was	O
+adopted	O
+as	O
+DEC	O
+'s	O
+implementation	O
+language	O
+for	O
+use	O
+on	O
+its	O
+new	O
+line	O
+of	O
+VAX	O
+computers	O
+in	O
+1975	O
+.	O
+DEC	O
+developed	O
+a	O
+completely	O
+new	O
+generation	O
+of	O
+BLISSs	O
+for	O
+the	O
+VAX	O
+,	O
+PDP-10	O
+and	O
+PDP-11	O
+,	O
+which	O
+became	O
+widely	O
+used	O
+at	O
+DEC	O
+during	O
+the	O
+1970s	O
+and	O
+1980s	O
+.	O
+With	O
+the	O
+creation	O
+of	O
+the	O
+Alpha	O
+architecture	O
+in	O
+the	O
+early	O
+1990s	O
+,	O
+BLISS	O
+was	O
+extended	O
+again	O
+,	O
+in	O
+both	O
+32	O
+-	O
+and	O
+64-bit	O
+flavors	O
+.	O
+BLISS	O
+support	O
+for	O
+the	O
+Intel	O
+IA-32	O
+architecture	O
+was	O
+introduced	O
+in	O
+1995	O
+and	O
+IA-64	O
+support	O
+is	O
+now	O
+in	O
+progress	O
+.	O
+BLISS	O
+has	O
+a	O
+number	O
+of	O
+unusual	O
+characteristics	O
+:	O
+it	O
+is	O
+typeless	O
+,	O
+requires	O
+use	O
+of	O
+an	O
+explicit	O
+contents	O
+of	O
+operator	O
+-LRB-	O
+written	O
+as	O
+a	O
+period	O
+or	O
+`	O
+dot	O
+'	O
+-RRB-	O
+,	O
+takes	O
+an	O
+algorithmic	O
+approach	O
+to	O
+data	B-KEY
+structure	I-KEY
+definition	I-KEY
+,	O
+has	O
+no	O
+goto	O
+,	O
+is	O
+an	O
+expression	O
+language	O
+,	O
+and	O
+has	O
+an	O
+unusually	O
+rich	O
+compile-time	B-KEY
+language	I-KEY
+.	O
+This	O
+paper	O
+reviews	O
+the	O
+evolution	O
+and	O
+use	O
+of	O
+BLISS	O
+over	O
+its	O
+three	O
+decade	O
+lifetime	O
+.	O
+Emphasis	O
+is	O
+on	O
+how	O
+the	O
+language	O
+evolved	O
+to	O
+facilitate	O
+portable	B-KEY
+programming	I-KEY
+while	O
+retaining	O
+its	O
+initial	O
+highly	O
+machine-specific	O
+character	O
+.	O
+Finally	O
+,	O
+the	O
+success	O
+of	O
+its	O
+characteristics	O
+are	O
+assessed	O
+
+Examining	O
+children	O
+'s	O
+reading	O
+performance	O
+and	O
+preference	O
+for	O
+different	O
+computer-displayed	B-KEY
+text	I-KEY
+This	O
+study	O
+investigated	O
+how	O
+common	O
+online	B-KEY
+text	I-KEY
+affects	O
+reading	O
+performance	O
+of	O
+elementary	B-KEY
+school-age	I-KEY
+children	I-KEY
+by	O
+examining	O
+the	O
+actual	O
+and	O
+perceived	O
+readability	O
+of	O
+four	O
+computer-displayed	B-KEY
+typefaces	I-KEY
+at	O
+12	O
+-	O
+and	O
+14-point	O
+sizes	O
+.	O
+Twenty-seven	O
+children	O
+,	O
+ages	O
+9	O
+to	O
+11	O
+,	O
+were	O
+asked	O
+to	O
+read	O
+eight	O
+children	O
+'s	O
+passages	O
+and	O
+identify	O
+erroneous/substituted	O
+words	O
+while	O
+reading	O
+.	O
+Comic	O
+Sans	O
+MS	O
+,	O
+Arial	O
+and	O
+Times	O
+New	O
+Roman	O
+typefaces	O
+,	O
+regardless	O
+of	O
+size	O
+,	O
+were	O
+found	O
+to	O
+be	O
+more	O
+readable	O
+-LRB-	O
+as	O
+measured	O
+by	O
+a	O
+reading	O
+efficiency	O
+score	O
+-RRB-	O
+than	O
+Courier	O
+New	O
+.	O
+No	O
+differences	O
+in	O
+reading	O
+speed	O
+were	O
+found	O
+for	O
+any	O
+of	O
+the	O
+typeface	O
+combinations	O
+.	O
+In	O
+general	O
+,	O
+the	O
+14-point	O
+size	O
+and	O
+the	O
+examined	O
+sans	O
+serif	O
+typefaces	O
+were	O
+perceived	O
+as	O
+being	O
+the	O
+easiest	O
+to	O
+read	O
+,	O
+fastest	O
+,	O
+most	O
+attractive	O
+,	O
+and	O
+most	O
+desirable	O
+for	O
+school-related	O
+material	O
+.	O
+In	O
+addition	O
+,	O
+participants	O
+significantly	O
+preferred	O
+Comic	O
+Sans	O
+MS	O
+and	O
+14-point	O
+Arial	O
+to	O
+12-point	O
+Courier	O
+.	O
+Recommendations	O
+for	O
+appropriate	O
+typeface	O
+combinations	O
+for	O
+children	O
+reading	O
+on	O
+computers	O
+are	O
+discussed	O
+
+Reconstruction	O
+of	O
+time-varying	O
+3-D	O
+left-ventricular	O
+shape	O
+from	O
+multiview	B-KEY
+X-ray	I-KEY
+cineangiocardiograms	I-KEY
+This	O
+paper	O
+reports	O
+on	O
+the	O
+clinical	O
+application	O
+of	O
+a	O
+system	O
+for	O
+recovering	O
+the	O
+time-varying	O
+three-dimensional	O
+-LRB-	O
+3-D	O
+-RRB-	O
+left-ventricular	O
+-LRB-	O
+LV	O
+-RRB-	O
+shape	O
+from	O
+multiview	B-KEY
+X-ray	I-KEY
+cineangiocardiograms	I-KEY
+.	O
+Considering	O
+that	O
+X-ray	O
+cineangiocardiography	O
+is	O
+still	O
+commonly	O
+employed	O
+in	O
+clinical	B-KEY
+cardiology	I-KEY
+and	O
+computational	B-KEY
+costs	I-KEY
+for	O
+3-D	O
+recovery	O
+and	O
+visualization	O
+are	O
+rapidly	O
+decreasing	O
+,	O
+it	O
+is	O
+meaningful	O
+to	O
+develop	O
+a	O
+clinically	O
+applicable	O
+system	O
+for	O
+3-D	O
+LV	O
+shape	O
+recovery	O
+from	O
+X-ray	O
+cineangiocardiograms	O
+.	O
+The	O
+system	O
+is	O
+based	O
+on	O
+a	O
+previously	O
+reported	O
+closed-surface	O
+method	O
+of	O
+shape	O
+recovery	O
+from	O
+two-dimensional	B-KEY
+occluding	I-KEY
+contours	I-KEY
+with	O
+multiple	O
+views	O
+.	O
+To	O
+apply	O
+the	O
+method	O
+to	O
+``	O
+real	O
+''	O
+LV	O
+cineangiocardiograms	O
+,	O
+user-interactive	B-KEY
+systems	I-KEY
+were	O
+implemented	O
+for	O
+preprocessing	O
+,	O
+including	O
+detection	O
+of	O
+LV	O
+contours	O
+,	O
+calibration	O
+of	O
+the	O
+imaging	O
+geometry	O
+,	O
+and	O
+setting	O
+of	O
+the	O
+LV	O
+model	O
+coordinate	O
+system	O
+.	O
+The	O
+results	O
+for	O
+three	O
+real	O
+LV	O
+angiographic	B-KEY
+image	I-KEY
+sequences	I-KEY
+are	O
+presented	O
+,	O
+two	O
+with	O
+fixed	B-KEY
+multiple	I-KEY
+views	I-KEY
+-LRB-	O
+using	O
+supplementary	O
+angiography	O
+-RRB-	O
+and	O
+one	O
+with	O
+rotating	O
+views	O
+.	O
+3-D	O
+reconstructions	O
+utilizing	O
+different	O
+numbers	O
+of	O
+views	O
+were	O
+compared	O
+and	O
+evaluated	O
+in	O
+terms	O
+of	O
+contours	O
+manually	O
+traced	O
+by	O
+an	O
+experienced	B-KEY
+radiologist	I-KEY
+.	O
+The	O
+performance	O
+of	O
+the	O
+preprocesses	O
+was	O
+also	O
+evaluated	O
+,	O
+and	O
+the	O
+effects	O
+of	O
+variations	O
+in	O
+user-specified	O
+parameters	O
+on	O
+the	O
+final	O
+3-D	O
+reconstruction	O
+results	O
+were	O
+shown	O
+to	O
+be	O
+sufficiently	O
+small	O
+.	O
+These	O
+experimental	O
+results	O
+demonstrate	O
+the	O
+potential	O
+usefulness	O
+of	O
+combining	O
+multiple	O
+views	O
+for	O
+3-D	O
+recovery	O
+from	O
+``	O
+real	O
+''	O
+LV	O
+cineangiocardiograms	O
+
+Dynamic	O
+multi-objective	B-KEY
+heating	I-KEY
+optimization	I-KEY
+We	O
+develop	O
+a	O
+multicriteria	B-KEY
+approach	I-KEY
+to	O
+the	O
+problem	O
+of	O
+space	B-KEY
+heating	I-KEY
+under	O
+a	O
+time	O
+varying	O
+price	O
+of	O
+electricity	O
+.	O
+In	O
+our	O
+dynamic	B-KEY
+goal	I-KEY
+programming	I-KEY
+model	I-KEY
+the	O
+goals	O
+are	O
+ideal	B-KEY
+temperature	I-KEY
+intervals	I-KEY
+and	O
+the	O
+other	O
+criteria	O
+are	O
+the	O
+costs	O
+and	O
+energy	B-KEY
+consumption	I-KEY
+.	O
+We	O
+discuss	O
+the	O
+modelling	B-KEY
+requirements	I-KEY
+in	O
+multicriteria	O
+problems	O
+with	O
+a	O
+dynamic	B-KEY
+structure	I-KEY
+and	O
+present	O
+a	O
+new	O
+relaxation	B-KEY
+method	I-KEY
+combining	O
+the	O
+traditional	O
+epsilon	O
+-	O
+constraint	O
+and	O
+goal	O
+programming	O
+-LRB-	O
+GP	O
+-RRB-	O
+methods	O
+.	O
+The	O
+multi-objective	B-KEY
+heating	I-KEY
+optimization	I-KEY
+-LRB-	O
+MOHO	O
+-RRB-	O
+application	O
+in	O
+a	O
+spreadsheet	B-KEY
+environment	I-KEY
+with	O
+numerical	B-KEY
+examples	I-KEY
+is	O
+described	O
+
+Theta	O
+functions	O
+with	O
+harmonic	B-KEY
+coefficients	I-KEY
+over	O
+number	B-KEY
+fields	I-KEY
+We	O
+investigate	O
+theta	O
+functions	O
+attached	O
+to	O
+quadratic	B-KEY
+forms	I-KEY
+over	O
+a	O
+number	B-KEY
+field	I-KEY
+K	O
+.	O
+We	O
+establish	O
+a	O
+functional	B-KEY
+equation	I-KEY
+by	O
+regarding	O
+the	O
+theta	O
+functions	O
+as	O
+specializations	O
+of	O
+symplectic	B-KEY
+theta	I-KEY
+functions	I-KEY
+.	O
+By	O
+applying	O
+a	O
+differential	B-KEY
+operator	I-KEY
+to	O
+the	O
+functional	B-KEY
+equation	I-KEY
+,	O
+we	O
+show	O
+how	O
+theta	O
+functions	O
+with	O
+harmonic	B-KEY
+coefficients	I-KEY
+over	O
+K	O
+behave	O
+under	O
+modular	B-KEY
+transformations	I-KEY
+
+Analysis	O
+of	O
+nonlinear	B-KEY
+time-delay	I-KEY
+systems	I-KEY
+using	O
+modules	B-KEY
+over	O
+non-commutative	O
+rings	O
+The	O
+theory	O
+of	O
+non-commutative	O
+rings	O
+is	O
+introduced	O
+to	O
+provide	O
+a	O
+basis	O
+for	O
+the	O
+study	O
+of	O
+nonlinear	B-KEY
+control	I-KEY
+systems	I-KEY
+with	O
+time	O
+delays	O
+.	O
+The	O
+left	B-KEY
+Ore	I-KEY
+ring	I-KEY
+of	O
+non-commutative	O
+polynomials	O
+defined	O
+over	O
+the	O
+field	O
+of	O
+a	O
+meromorphic	B-KEY
+function	I-KEY
+is	O
+suggested	O
+as	O
+the	O
+framework	O
+for	O
+such	O
+a	O
+study	O
+.	O
+This	O
+approach	O
+is	O
+then	O
+generalized	O
+to	O
+a	O
+broader	O
+class	O
+of	O
+nonlinear	O
+systems	O
+with	O
+delays	O
+that	O
+are	O
+called	O
+generalized	B-KEY
+Roesser	I-KEY
+systems	I-KEY
+.	O
+Finally	O
+,	O
+the	O
+theory	O
+is	O
+applied	O
+to	O
+analyze	O
+nonlinear	B-KEY
+time-delay	I-KEY
+systems	I-KEY
+.	O
+A	O
+weak	B-KEY
+observability	I-KEY
+is	O
+defined	O
+and	O
+characterized	O
+,	O
+generalizing	O
+the	O
+well-known	O
+linear	O
+result	O
+.	O
+Properties	O
+of	O
+closed	O
+submodules	O
+are	O
+then	O
+developed	O
+to	O
+obtain	O
+a	O
+result	O
+on	O
+the	O
+accessibility	O
+of	O
+such	O
+systems	O
+
+Comments	O
+on	O
+some	O
+recent	O
+methods	O
+for	O
+the	O
+simultaneous	O
+determination	O
+of	O
+polynomial	B-KEY
+zeros	B-KEY
+In	O
+this	O
+note	O
+we	O
+give	O
+some	O
+comments	O
+on	O
+the	O
+recent	O
+results	O
+concerning	O
+a	O
+simultaneous	O
+method	O
+of	O
+the	O
+fourth-order	O
+for	O
+finding	O
+complex	B-KEY
+zeros	I-KEY
+in	O
+circular	O
+interval	O
+arithmetic	O
+.	O
+The	O
+main	O
+discussion	O
+is	O
+directed	O
+to	O
+a	O
+rediscovered	O
+iterative	B-KEY
+formula	I-KEY
+and	O
+its	O
+modification	O
+,	O
+presented	O
+recently	O
+in	O
+Sun	O
+and	O
+Kosmol	O
+,	O
+-LRB-	O
+2001	O
+-RRB-	O
+.	O
+The	O
+presented	O
+comments	O
+include	O
+some	O
+critical	O
+parts	O
+of	O
+the	O
+papers	O
+Petkovic	O
+,	O
+Trickovic	O
+,	O
+Herceg	O
+,	O
+-LRB-	O
+1998	O
+-RRB-	O
+and	O
+Sun	O
+and	O
+Kosmol	O
+,	O
+-LRB-	O
+2001	O
+-RRB-	O
+which	O
+treat	O
+the	O
+same	O
+subject	O
+
+Research	O
+into	O
+telehealth	B-KEY
+applications	I-KEY
+in	O
+speech-language	B-KEY
+pathology	I-KEY
+A	O
+literature	B-KEY
+review	I-KEY
+was	O
+conducted	O
+to	O
+investigate	O
+the	O
+extent	O
+to	O
+which	O
+telehealth	O
+has	O
+been	O
+researched	O
+within	O
+the	O
+domain	O
+of	O
+speech-language	B-KEY
+pathology	I-KEY
+and	O
+the	O
+outcomes	O
+of	O
+this	O
+research	O
+.	O
+A	O
+total	O
+of	O
+13	O
+studies	O
+were	O
+identified	O
+.	O
+Three	O
+early	O
+studies	O
+demonstrated	O
+that	O
+telehealth	O
+was	O
+feasible	O
+,	O
+although	O
+there	O
+was	O
+no	O
+discussion	O
+of	O
+the	O
+cost-effectiveness	B-KEY
+of	O
+this	O
+process	O
+in	O
+terms	O
+of	O
+patient	B-KEY
+outcomes	I-KEY
+.	O
+The	O
+majority	O
+of	O
+the	O
+subsequent	O
+studies	O
+indicated	O
+positive	O
+or	O
+encouraging	O
+outcomes	O
+resulting	O
+from	O
+telehealth	O
+.	O
+However	O
+,	O
+there	O
+were	O
+a	O
+number	O
+of	O
+shortcomings	O
+in	O
+the	O
+research	O
+,	O
+including	O
+a	O
+lack	O
+of	O
+cost-benefit	O
+information	O
+,	O
+failure	O
+to	O
+evaluate	O
+the	O
+technology	O
+itself	O
+,	O
+an	O
+absence	O
+of	O
+studies	O
+of	O
+the	O
+educational	O
+and	O
+informational	O
+aspects	O
+of	O
+telehealth	O
+in	O
+relation	O
+to	O
+speech-language	B-KEY
+pathology	I-KEY
+,	O
+and	O
+the	O
+use	O
+of	O
+telehealth	O
+in	O
+a	O
+limited	O
+range	O
+of	O
+communication	B-KEY
+disorders	I-KEY
+.	O
+Future	O
+research	O
+into	O
+the	O
+application	O
+of	O
+telehealth	O
+to	O
+speech-language	B-KEY
+pathology	I-KEY
+services	O
+must	O
+adopt	O
+a	O
+scientific	O
+approach	O
+,	O
+and	O
+have	O
+a	O
+well	O
+defined	O
+development	O
+and	O
+evaluation	O
+framework	O
+that	O
+addresses	O
+the	O
+effectiveness	O
+of	O
+the	O
+technique	O
+,	O
+patient	B-KEY
+outcomes	I-KEY
+and	O
+satisfaction	O
+,	O
+and	O
+the	O
+cost-benefit	O
+relationship	O
+
+Single	B-KEY
+machine	I-KEY
+earliness-tardiness	I-KEY
+scheduling	I-KEY
+with	O
+resource-dependent	B-KEY
+release	I-KEY
+dates	I-KEY
+This	O
+paper	O
+deals	O
+with	O
+the	O
+single	O
+machine	O
+earliness	O
+and	O
+tardiness	O
+scheduling	O
+problem	O
+with	O
+a	O
+common	B-KEY
+due	I-KEY
+date	I-KEY
+and	O
+resource-dependent	B-KEY
+release	I-KEY
+dates	I-KEY
+.	O
+It	O
+is	O
+assumed	O
+that	O
+the	O
+cost	O
+of	O
+resource	O
+consumption	O
+of	O
+a	O
+job	O
+is	O
+a	O
+non-increasing	O
+linear	O
+function	O
+of	O
+the	O
+job	B-KEY
+release	I-KEY
+date	I-KEY
+,	O
+and	O
+this	O
+function	O
+is	O
+common	O
+for	O
+all	O
+jobs	O
+.	O
+The	O
+objective	O
+is	O
+to	O
+find	O
+a	O
+schedule	O
+and	O
+job	B-KEY
+release	I-KEY
+dates	I-KEY
+that	O
+minimize	O
+the	O
+total	O
+resource	O
+consumption	O
+,	O
+and	O
+earliness	O
+and	O
+tardiness	O
+penalties	O
+.	O
+It	O
+is	O
+shown	O
+that	O
+the	O
+problem	O
+is	O
+NP-hard	O
+in	O
+the	O
+ordinary	O
+sense	O
+even	O
+if	O
+the	O
+due	O
+date	O
+is	O
+unrestricted	O
+-LRB-	O
+the	O
+number	O
+of	O
+jobs	O
+that	O
+can	O
+be	O
+scheduled	O
+before	O
+the	O
+due	O
+date	O
+is	O
+unrestricted	O
+-RRB-	O
+.	O
+An	O
+exact	O
+dynamic	O
+programming	O
+-LRB-	O
+DP	O
+-RRB-	O
+algorithm	O
+for	O
+small	O
+and	O
+medium	B-KEY
+size	I-KEY
+problems	I-KEY
+is	O
+developed	O
+.	O
+A	O
+heuristic	B-KEY
+algorithm	I-KEY
+for	O
+large-scale	B-KEY
+problems	I-KEY
+is	O
+also	O
+proposed	O
+and	O
+the	O
+results	O
+of	O
+a	O
+computational	O
+comparison	O
+between	O
+heuristic	O
+and	O
+optimal	O
+solutions	O
+are	O
+discussed	O
+
+Adaptive	B-KEY
+stabilization	I-KEY
+of	O
+undamped	B-KEY
+flexible	I-KEY
+structures	I-KEY
+In	O
+the	O
+paper	O
+non-identifier-based	O
+adaptive	B-KEY
+stabilization	I-KEY
+of	O
+undamped	B-KEY
+flexible	I-KEY
+structures	I-KEY
+is	O
+considered	O
+in	O
+the	O
+case	O
+of	O
+collocated	O
+input	O
+and	O
+output	O
+operators	O
+.	O
+The	O
+systems	O
+have	O
+poles	B-KEY
+and	I-KEY
+zeros	I-KEY
+on	O
+the	O
+imaginary	B-KEY
+axis	I-KEY
+.	O
+In	O
+the	O
+case	O
+where	O
+velocity	B-KEY
+feedback	I-KEY
+is	O
+available	O
+,	O
+the	O
+adaptive	B-KEY
+stabilizer	I-KEY
+is	O
+constructed	O
+by	O
+an	O
+adaptive	B-KEY
+PD-controller	I-KEY
+-LRB-	O
+proportional	B-KEY
+plus	I-KEY
+derivative	I-KEY
+controller	I-KEY
+-RRB-	O
+.	O
+In	O
+the	O
+case	O
+where	O
+only	O
+position	B-KEY
+feedback	I-KEY
+is	O
+available	O
+,	O
+the	O
+adaptive	B-KEY
+stabilizer	I-KEY
+is	O
+constructed	O
+by	O
+an	O
+adaptive	B-KEY
+P-controller	I-KEY
+for	O
+the	O
+augmented	B-KEY
+system	I-KEY
+which	O
+consists	O
+of	O
+the	O
+controlled	O
+system	O
+and	O
+a	O
+parallel	B-KEY
+compensator	I-KEY
+.	O
+Numerical	O
+examples	O
+are	O
+given	O
+to	O
+illustrate	O
+the	O
+effectiveness	O
+of	O
+the	O
+proposed	O
+controllers	O
+
+Closed-loop	B-KEY
+model	I-KEY
+set	I-KEY
+validation	I-KEY
+under	O
+a	O
+stochastic	B-KEY
+framework	I-KEY
+Deals	O
+with	O
+probabilistic	B-KEY
+model	I-KEY
+set	I-KEY
+validation	I-KEY
+.	O
+It	O
+is	O
+assumed	O
+that	O
+the	O
+dynamics	O
+of	O
+a	O
+multi-input	O
+multi-output	O
+-LRB-	O
+MIMO	O
+-RRB-	O
+plant	O
+is	O
+described	O
+by	O
+a	O
+model	O
+set	O
+with	O
+unstructured	B-KEY
+uncertainties	I-KEY
+,	O
+and	O
+identification	O
+experiments	O
+are	O
+performed	O
+in	O
+closed	O
+loop	O
+.	O
+A	O
+necessary	B-KEY
+and	I-KEY
+sufficient	I-KEY
+condition	I-KEY
+has	O
+been	O
+derived	O
+for	O
+the	O
+consistency	O
+of	O
+the	O
+model	O
+set	O
+with	O
+both	O
+the	O
+stabilizing	B-KEY
+controller	I-KEY
+and	O
+closed-loop	B-KEY
+frequency	I-KEY
+domain	I-KEY
+experimental	I-KEY
+data	I-KEY
+-LRB-	O
+FDED	O
+-RRB-	O
+.	O
+In	O
+this	O
+condition	O
+,	O
+only	O
+the	O
+Euclidean	B-KEY
+norm	I-KEY
+of	O
+a	O
+complex	B-KEY
+vector	I-KEY
+is	O
+involved	O
+,	O
+and	O
+this	O
+complex	B-KEY
+vector	I-KEY
+depends	O
+linearly	O
+on	O
+both	O
+the	O
+disturbances	O
+and	O
+the	O
+measurement	O
+errors	O
+.	O
+Based	O
+on	O
+this	O
+condition	O
+,	O
+an	O
+analytic	O
+formula	O
+has	O
+been	O
+derived	O
+for	O
+the	O
+sample	O
+unfalsified	O
+probability	O
+-LRB-	O
+SUP	O
+-RRB-	O
+of	O
+the	O
+model	O
+set	O
+.	O
+Some	O
+of	O
+the	O
+asymptotic	B-KEY
+statistical	I-KEY
+properties	I-KEY
+of	O
+the	O
+SUP	O
+have	O
+also	O
+been	O
+briefly	O
+discussed	O
+.	O
+A	O
+numerical	O
+example	O
+is	O
+included	O
+to	O
+illustrate	O
+the	O
+efficiency	O
+of	O
+the	O
+suggested	O
+method	O
+in	O
+model	O
+set	O
+quality	O
+evaluation	O
+
+Telemedicine	B-KEY
+in	O
+the	O
+management	O
+of	O
+a	O
+cervical	O
+dislocation	O
+by	O
+a	O
+mobile	B-KEY
+neurosurgeon	I-KEY
+Neurosurgical	O
+teams	O
+,	O
+who	O
+are	O
+normally	O
+located	O
+in	O
+specialist	O
+centres	O
+,	O
+frequently	O
+use	O
+teleradiology	B-KEY
+to	O
+make	O
+a	O
+decision	O
+about	O
+the	O
+transfer	O
+of	O
+a	O
+patient	O
+to	O
+the	O
+nearest	O
+neurosurgical	O
+department	O
+.	O
+This	O
+decision	O
+depends	O
+on	O
+the	O
+type	O
+of	O
+pathology	O
+,	O
+the	O
+clinical	O
+status	O
+of	O
+the	O
+patient	O
+and	O
+the	O
+prognosis	O
+.	O
+If	O
+the	O
+transfer	O
+of	O
+the	O
+patient	O
+is	O
+not	O
+possible	O
+,	O
+for	O
+example	O
+because	O
+of	O
+an	O
+unstable	O
+clinical	O
+status	O
+,	O
+a	O
+mobile	O
+neurosurgical	O
+team	O
+may	O
+be	O
+used	O
+.	O
+We	O
+report	O
+a	O
+case	O
+which	O
+was	O
+dealt	O
+with	O
+in	O
+a	O
+remote	B-KEY
+French	I-KEY
+military	I-KEY
+airborne	I-KEY
+surgical	I-KEY
+unit	I-KEY
+,	O
+in	O
+the	O
+Republic	B-KEY
+of	I-KEY
+Chad	I-KEY
+.	O
+The	O
+unit	O
+,	O
+which	O
+provides	O
+health-care	O
+to	O
+the	O
+French	B-KEY
+military	I-KEY
+personnel	I-KEY
+stationed	O
+there	O
+,	O
+also	O
+provides	O
+free	O
+medical	O
+care	O
+for	O
+the	O
+local	O
+population	O
+.	O
+It	O
+conducts	O
+about	O
+100	O
+operations	O
+each	O
+month	O
+.	O
+The	O
+unit	O
+comprises	O
+two	O
+surgeons	O
+-LRB-	O
+an	O
+orthopaedic	O
+and	O
+a	O
+general	O
+surgeon	O
+-RRB-	O
+,	O
+one	O
+anaesthetist	O
+,	O
+two	O
+anaesthetic	O
+nurses	O
+,	O
+one	O
+operating	O
+room	O
+nurse	O
+,	O
+two	O
+nurses	O
+,	O
+three	O
+paramedics	O
+and	O
+a	O
+secretary	O
+.	O
+The	O
+civilian	B-KEY
+patient	I-KEY
+presented	O
+with	O
+unstable	B-KEY
+cervical	I-KEY
+trauma	I-KEY
+.	O
+A	O
+mobile	B-KEY
+neurosurgeon	I-KEY
+operated	O
+on	O
+her	O
+,	O
+and	O
+used	O
+telemedicine	B-KEY
+before	O
+,	O
+during	O
+and	O
+after	O
+surgery	B-KEY
+
+H-matrix	B-KEY
+approximation	I-KEY
+for	O
+the	O
+operator	B-KEY
+exponential	I-KEY
+with	O
+applications	O
+We	O
+previously	O
+developed	O
+a	O
+data-sparse	O
+and	O
+accurate	O
+approximation	O
+to	O
+parabolic	B-KEY
+solution	I-KEY
+operators	I-KEY
+in	O
+the	O
+case	O
+of	O
+a	O
+rather	O
+general	O
+elliptic	O
+part	O
+given	O
+by	O
+a	O
+strongly	B-KEY
+P-positive	I-KEY
+operator	I-KEY
+.	O
+Also	O
+a	O
+class	O
+of	O
+matrices	O
+-LRB-	O
+H-matrices	O
+-RRB-	O
+has	O
+been	O
+analysed	O
+which	O
+are	O
+data-sparse	O
+and	O
+allow	O
+an	O
+approximate	O
+matrix	O
+arithmetic	O
+with	O
+almost	B-KEY
+linear	I-KEY
+complexity	I-KEY
+.	O
+In	O
+particular	O
+,	O
+the	O
+matrix-vector/matrix-matrix	O
+product	O
+with	O
+such	O
+matrices	O
+as	O
+well	O
+as	O
+the	O
+computation	O
+of	O
+the	O
+inverse	O
+have	O
+linear-logarithmic	O
+cost	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+apply	O
+the	O
+H-matrix	O
+techniques	O
+to	O
+approximate	O
+the	O
+exponent	O
+of	O
+an	O
+elliptic	O
+operator	O
+.	O
+Starting	O
+with	O
+the	O
+Dunford-Cauchy	B-KEY
+representation	I-KEY
+for	O
+the	O
+operator	O
+exponent	O
+,	O
+we	O
+then	O
+discretise	O
+the	O
+integral	O
+by	O
+the	O
+exponentially	B-KEY
+convergent	I-KEY
+quadrature	I-KEY
+rule	I-KEY
+involving	O
+a	O
+short	O
+sum	O
+of	O
+resolvents	O
+.	O
+The	O
+latter	O
+are	O
+approximated	O
+by	O
+the	O
+H-matrices	O
+.	O
+Our	O
+algorithm	O
+inherits	O
+a	O
+two-level	O
+parallelism	O
+with	O
+respect	O
+to	O
+both	O
+the	O
+computation	O
+of	O
+resolvents	O
+and	O
+the	O
+treatment	O
+of	O
+different	O
+time	O
+values	O
+.	O
+In	O
+the	O
+case	O
+of	O
+smooth	O
+data	O
+-LRB-	O
+coefficients	O
+,	O
+boundaries	O
+-RRB-	O
+,	O
+we	O
+prove	O
+the	O
+linear-logarithmic	O
+complexity	O
+of	O
+the	O
+method	O
+
+Hordes	B-KEY
+:	O
+a	O
+multicast	O
+based	O
+protocol	B-KEY
+for	O
+anonymity	O
+With	O
+widespread	O
+acceptance	O
+of	O
+the	O
+Internet	B-KEY
+as	O
+a	O
+public	O
+medium	O
+for	O
+communication	O
+and	O
+information	O
+retrieval	O
+,	O
+there	O
+has	O
+been	O
+rising	O
+concern	O
+that	O
+the	O
+personal	B-KEY
+privacy	I-KEY
+of	O
+users	O
+can	O
+be	O
+eroded	O
+by	O
+cooperating	B-KEY
+network	I-KEY
+entities	I-KEY
+.	O
+A	O
+technical	O
+solution	O
+to	O
+maintaining	O
+privacy	O
+is	O
+to	O
+provide	O
+anonymity	O
+.	O
+We	O
+present	O
+a	O
+protocol	B-KEY
+for	O
+initiator	B-KEY
+anonymity	I-KEY
+called	O
+Hordes	B-KEY
+,	O
+which	O
+uses	O
+forwarding	B-KEY
+mechanisms	I-KEY
+similar	O
+to	O
+those	O
+used	O
+in	O
+previous	O
+protocols	B-KEY
+for	O
+sending	O
+data	O
+,	O
+but	O
+is	O
+the	O
+first	O
+protocol	B-KEY
+to	O
+make	O
+use	O
+of	O
+multicast	B-KEY
+routing	I-KEY
+to	O
+anonymously	O
+receive	O
+data	O
+.	O
+We	O
+show	O
+this	O
+results	O
+in	O
+shorter	O
+transmission	B-KEY
+latencies	I-KEY
+and	O
+requires	O
+less	O
+work	O
+of	O
+the	O
+protocol	B-KEY
+participants	O
+,	O
+in	O
+terms	O
+of	O
+the	O
+messages	O
+processed	O
+.	O
+We	O
+also	O
+present	O
+a	O
+comparison	O
+of	O
+the	O
+security	O
+and	O
+anonymity	O
+of	O
+Hordes	B-KEY
+with	O
+previous	O
+protocols	B-KEY
+,	O
+using	O
+the	O
+first	O
+quantitative	O
+definition	O
+of	O
+anonymity	O
+and	O
+unlinkability	B-KEY
+.	O
+Our	O
+analysis	O
+shows	O
+that	O
+Hordes	B-KEY
+provides	O
+anonymity	O
+in	O
+a	O
+degree	O
+similar	O
+to	O
+that	O
+of	O
+Crowds	B-KEY
+and	O
+Onion	B-KEY
+Routing	I-KEY
+,	O
+but	O
+also	O
+that	O
+Hordes	B-KEY
+has	O
+numerous	O
+performance	B-KEY
+advantages	O
+
+Application	O
+of	O
+heuristic	B-KEY
+methods	I-KEY
+for	O
+conformance	O
+test	O
+selection	O
+In	O
+this	O
+paper	O
+we	O
+focus	O
+on	O
+the	O
+test	B-KEY
+selection	I-KEY
+problem	I-KEY
+.	O
+It	O
+is	O
+modeled	O
+after	O
+a	O
+real-life	O
+problem	O
+that	O
+arises	O
+in	O
+telecommunication	O
+when	O
+one	O
+has	O
+to	O
+check	O
+the	O
+reliability	B-KEY
+of	O
+an	O
+application	O
+.	O
+We	O
+apply	O
+different	O
+metaheuristics	B-KEY
+,	O
+namely	O
+Reactive	B-KEY
+Tabu	I-KEY
+Search	I-KEY
+-LRB-	O
+RTS	O
+-RRB-	O
+,	O
+Genetic	B-KEY
+Algorithms	I-KEY
+-LRB-	O
+GA	O
+-RRB-	O
+and	O
+Simulated	B-KEY
+Annealing	I-KEY
+-LRB-	O
+SA	O
+-RRB-	O
+to	O
+solve	O
+the	O
+problem	O
+.	O
+We	O
+propose	O
+some	O
+modifications	O
+to	O
+the	O
+conventional	O
+schemes	O
+including	O
+an	O
+adaptive	B-KEY
+neighbourhood	I-KEY
+sampling	I-KEY
+in	O
+RTS	O
+,	O
+an	O
+adaptive	B-KEY
+variable	I-KEY
+mutation	I-KEY
+rate	I-KEY
+in	O
+GA	O
+and	O
+an	O
+adaptive	B-KEY
+variable	I-KEY
+neighbourhood	I-KEY
+structure	I-KEY
+in	O
+SA	O
+.	O
+The	O
+performance	O
+of	O
+the	O
+algorithms	O
+is	O
+evaluated	O
+in	O
+different	O
+models	O
+for	O
+existing	O
+protocols	O
+.	O
+Computational	O
+results	O
+show	O
+that	O
+GA	O
+and	O
+SA	O
+can	O
+provide	O
+high-quality	O
+solutions	O
+in	O
+acceptable	O
+time	O
+compared	O
+to	O
+the	O
+results	O
+of	O
+a	O
+commercial	O
+software	O
+,	O
+which	O
+makes	O
+them	O
+applicable	O
+in	O
+practical	O
+test	O
+selection	O
+
+Records	O
+role	O
+in	O
+e-business	O
+Records	B-KEY
+management	I-KEY
+standards	O
+are	O
+now	O
+playing	O
+a	O
+key	O
+role	O
+in	O
+e-business	B-KEY
+strategy	I-KEY
+
+Property	B-KEY
+testers	I-KEY
+for	O
+dense	O
+Constraint	B-KEY
+Satisfaction	I-KEY
+programs	O
+on	O
+finite	O
+domains	O
+Many	O
+NP-hard	B-KEY
+languages	I-KEY
+can	O
+be	O
+``	O
+decided	O
+''	O
+in	O
+subexponential	B-KEY
+time	I-KEY
+if	O
+the	O
+definition	O
+of	O
+``	O
+decide	O
+''	O
+is	O
+relaxed	O
+only	O
+slightly	O
+.	O
+Rubinfeld	O
+and	O
+Sudan	O
+introduced	O
+the	O
+notion	O
+of	O
+property	B-KEY
+testers	I-KEY
+,	O
+probabilistic	B-KEY
+algorithms	I-KEY
+that	O
+can	O
+decide	O
+,	O
+with	O
+high	O
+probability	O
+,	O
+if	O
+a	O
+function	O
+has	O
+a	O
+certain	O
+property	O
+or	O
+if	O
+it	O
+is	O
+far	O
+from	O
+any	O
+function	O
+having	O
+this	O
+property	O
+.	O
+Goldreich	O
+,	O
+Goldwasser	O
+,	O
+and	O
+Ron	O
+constructed	O
+property	B-KEY
+testers	I-KEY
+with	O
+constant	B-KEY
+query	I-KEY
+complexity	I-KEY
+for	O
+dense	B-KEY
+instances	I-KEY
+of	O
+a	O
+large	O
+class	O
+of	O
+graph	B-KEY
+problems	I-KEY
+.	O
+Since	O
+many	O
+graph	B-KEY
+problems	I-KEY
+can	O
+be	O
+viewed	O
+as	O
+special	O
+cases	O
+of	O
+the	O
+Constraint	B-KEY
+Satisfaction	I-KEY
+Problem	O
+on	O
+Boolean	O
+domains	O
+,	O
+it	O
+is	O
+natural	O
+to	O
+try	O
+to	O
+construct	O
+property	O
+testers	O
+for	O
+more	O
+general	O
+cases	O
+of	O
+the	O
+Constraint	O
+Satisfaction	O
+Problem	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+give	O
+explicit	O
+constructions	O
+of	O
+property	B-KEY
+testers	I-KEY
+using	O
+a	O
+constant	O
+number	O
+of	O
+queries	O
+for	O
+dense	B-KEY
+instances	I-KEY
+of	O
+Constraint	B-KEY
+Satisfaction	I-KEY
+Problems	O
+where	O
+the	O
+constraints	O
+have	O
+constant	O
+arity	O
+and	O
+the	O
+variables	O
+assume	O
+values	O
+in	O
+some	O
+domain	O
+of	O
+finite	O
+size	O
+
+Toward	O
+a	O
+formalism	O
+for	O
+conversation	B-KEY
+protocols	I-KEY
+using	O
+joint	O
+intention	O
+theory	O
+Conversation	B-KEY
+protocols	I-KEY
+are	O
+used	O
+to	O
+achieve	O
+certain	O
+goals	O
+or	O
+to	O
+bring	O
+about	O
+certain	O
+states	O
+in	O
+the	O
+world	O
+.	O
+Therefore	O
+,	O
+one	O
+may	O
+identify	O
+the	O
+landmarks	O
+or	O
+the	O
+states	O
+that	O
+must	O
+be	O
+brought	O
+about	O
+during	O
+the	O
+goal-directed	O
+execution	O
+of	O
+a	O
+protocol	O
+.	O
+Accordingly	O
+,	O
+the	O
+landmarks	O
+,	O
+characterized	O
+by	O
+propositions	O
+that	O
+are	O
+true	O
+in	O
+the	O
+state	O
+represented	O
+by	O
+that	O
+landmark	O
+,	O
+are	O
+the	O
+most	O
+important	O
+aspect	O
+of	O
+a	O
+protocol	O
+.	O
+Families	O
+of	O
+conversation	B-KEY
+protocols	I-KEY
+can	O
+be	O
+expressed	O
+formally	O
+as	O
+partially	O
+ordered	O
+landmarks	O
+after	O
+the	O
+landmarks	O
+necessary	O
+to	O
+achieve	O
+a	O
+goal	O
+have	O
+been	O
+identified	O
+.	O
+Concrete	O
+protocols	O
+represented	O
+as	O
+joint	O
+action	O
+expressions	O
+can	O
+,	O
+then	O
+,	O
+be	O
+derived	O
+from	O
+the	O
+partially	O
+ordered	O
+landmarks	O
+and	O
+executed	O
+directly	O
+by	O
+joint	O
+intention	O
+interpreters	O
+.	O
+This	O
+approach	O
+of	O
+applying	O
+Joint	O
+Intention	O
+theory	O
+to	O
+protocols	O
+also	O
+supports	O
+flexibility	O
+in	O
+the	O
+actions	O
+used	O
+to	O
+get	O
+to	O
+landmarks	O
+,	O
+shortcutting	O
+protocol	B-KEY
+execution	I-KEY
+,	O
+automatic	B-KEY
+exception	I-KEY
+handling	I-KEY
+,	O
+and	O
+correctness	B-KEY
+criterion	I-KEY
+for	O
+protocols	O
+and	O
+protocol	O
+compositions	O
+
+Numerical	B-KEY
+studies	I-KEY
+of	O
+2D	B-KEY
+free	I-KEY
+surface	I-KEY
+waves	I-KEY
+with	O
+fixed	O
+bottom	O
+The	O
+motion	O
+of	O
+surface	O
+waves	O
+under	O
+the	O
+effect	O
+of	O
+bottom	O
+is	O
+a	O
+very	O
+interesting	O
+and	O
+challenging	O
+phenomenon	O
+in	O
+the	O
+nature	O
+.	O
+we	O
+use	O
+boundary	B-KEY
+integral	I-KEY
+method	I-KEY
+to	O
+compute	O
+and	O
+analyze	O
+this	O
+problem	O
+.	O
+In	O
+the	O
+linear	B-KEY
+analysis	I-KEY
+,	O
+the	O
+linearized	B-KEY
+equations	I-KEY
+have	O
+bounded	O
+error	O
+increase	O
+under	O
+some	O
+compatible	O
+conditions	O
+.	O
+This	O
+contributes	O
+to	O
+the	O
+cancellation	O
+of	O
+instable	B-KEY
+Kelvin-Helmholtz	I-KEY
+terms	I-KEY
+.	O
+Under	O
+the	O
+effect	O
+of	O
+bottom	O
+,	O
+the	O
+existence	O
+of	O
+equations	O
+is	O
+hard	O
+to	O
+determine	O
+,	O
+but	O
+given	O
+some	O
+limitations	O
+it	O
+proves	O
+true	O
+.	O
+These	O
+limitations	O
+are	O
+that	O
+the	O
+swing	O
+of	O
+interfaces	O
+should	O
+be	O
+small	O
+enough	O
+,	O
+and	O
+the	O
+distance	O
+between	O
+surface	O
+and	O
+bottom	O
+should	O
+be	O
+large	O
+enough	O
+.	O
+In	O
+order	O
+to	O
+maintain	O
+the	O
+stability	O
+of	O
+computation	O
+,	O
+some	O
+compatible	O
+relationship	O
+must	O
+be	O
+satisfied	O
+.	O
+In	O
+the	O
+numerical	O
+examples	O
+,	O
+the	O
+simulation	O
+of	O
+standing	O
+waves	O
+and	O
+breaking	O
+waves	O
+are	O
+calculated	O
+.	O
+And	O
+in	O
+the	O
+case	O
+of	O
+shallow	O
+bottom	O
+,	O
+we	O
+found	O
+that	O
+the	O
+behavior	O
+of	O
+waves	O
+are	O
+rather	O
+singular	O
+
+Modifier	B-KEY
+formula	I-KEY
+on	O
+mean	B-KEY
+square	I-KEY
+convergence	I-KEY
+of	O
+LMS	B-KEY
+algorithm	I-KEY
+In	O
+describing	O
+the	O
+mean	B-KEY
+square	I-KEY
+convergence	I-KEY
+of	O
+the	O
+LMS	B-KEY
+algorithm	I-KEY
+,	O
+the	O
+update	B-KEY
+formula	I-KEY
+based	O
+on	O
+independence	B-KEY
+assumption	I-KEY
+will	O
+bring	O
+explicit	O
+errors	O
+,	O
+especially	O
+when	O
+step-size	O
+is	O
+large	O
+.	O
+A	O
+modifier	B-KEY
+formula	I-KEY
+that	O
+describes	O
+the	O
+convergence	O
+well	O
+,	O
+is	O
+proposed	O
+.	O
+Simulations	O
+support	O
+the	O
+proposed	O
+formula	O
+in	O
+different	O
+conditions	O
+
+Orthogonality	B-KEY
+of	O
+the	O
+Jacobi	B-KEY
+polynomials	I-KEY
+with	O
+negative	B-KEY
+integer	I-KEY
+parameters	I-KEY
+It	O
+is	O
+well	O
+known	O
+that	O
+the	O
+Jacobi	B-KEY
+polynomials	I-KEY
+P/sub	O
+n	O
+/	O
+/	O
+sup	O
+-LRB-	O
+alpha	O
+,	O
+beta	O
+-RRB-	O
+/	O
+-LRB-	O
+x	O
+-RRB-	O
+are	O
+orthogonal	B-KEY
+with	O
+respect	O
+to	O
+a	O
+quasi-definite	B-KEY
+linear	I-KEY
+functional	I-KEY
+whenever	O
+alpha	O
+,	O
+beta	O
+,	O
+and	O
+alpha	O
++	O
+beta	O
++	O
+1	O
+are	O
+not	O
+negative	O
+integer	O
+numbers	O
+.	O
+Recently	O
+,	O
+Sobolev	B-KEY
+orthogonality	I-KEY
+for	O
+these	O
+polynomials	O
+has	O
+been	O
+obtained	O
+for	O
+alpha	O
+a	O
+negative	O
+integer	O
+and	O
+beta	O
+not	O
+a	O
+negative	O
+integer	O
+and	O
+also	O
+for	O
+the	O
+case	O
+alpha	O
+=	O
+beta	O
+negative	O
+integer	O
+numbers	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+give	O
+a	O
+Sobolev	B-KEY
+orthogonality	I-KEY
+for	O
+the	O
+Jacobi	O
+polynomials	O
+in	O
+the	O
+remainder	O
+cases	O
+
+Going	O
+electronic	O
+-LSB-	O
+auditing	B-KEY
+-RSB-	O
+A	O
+study	O
+group	O
+examines	O
+the	O
+issues	O
+auditors	O
+face	O
+in	O
+gathering	O
+electronic	B-KEY
+information	I-KEY
+as	O
+evidence	O
+and	O
+its	O
+impact	O
+on	O
+the	O
+audit	B-KEY
+
+Cane	B-KEY
+railway	I-KEY
+scheduling	I-KEY
+via	O
+constraint	B-KEY
+logic	I-KEY
+programming	I-KEY
+:	O
+labelling	O
+order	O
+and	O
+constraints	O
+in	O
+a	O
+real-life	O
+application	O
+In	O
+Australia	O
+,	O
+cane	B-KEY
+transport	I-KEY
+is	O
+the	O
+largest	O
+unit	O
+cost	O
+in	O
+the	O
+manufacturing	O
+of	O
+raw	B-KEY
+sugar	I-KEY
+,	O
+making	O
+up	O
+around	O
+35	O
+%	O
+of	O
+the	O
+total	B-KEY
+manufacturing	I-KEY
+costs	I-KEY
+.	O
+Producing	O
+efficient	O
+schedules	O
+for	O
+the	O
+cane	O
+railways	O
+can	O
+result	O
+in	O
+significant	O
+cost	B-KEY
+savings	I-KEY
+.	O
+The	O
+paper	O
+presents	O
+a	O
+study	O
+using	O
+constraint	B-KEY
+logic	I-KEY
+programming	I-KEY
+-LRB-	O
+CLP	O
+-RRB-	O
+to	O
+solve	O
+the	O
+cane	B-KEY
+transport	I-KEY
+scheduling	O
+problem	O
+.	O
+Tailored	O
+heuristic	B-KEY
+labelling	I-KEY
+order	I-KEY
+and	O
+constraints	B-KEY
+strategies	I-KEY
+are	O
+proposed	O
+and	O
+encouraging	O
+results	O
+of	O
+application	O
+to	O
+several	O
+test	O
+problems	O
+and	O
+one	O
+real-life	O
+case	O
+are	O
+presented	O
+.	O
+The	O
+preliminary	O
+results	O
+demonstrate	O
+that	O
+CLP	O
+can	O
+be	O
+used	O
+as	O
+an	O
+effective	O
+tool	O
+for	O
+solving	O
+the	O
+cane	B-KEY
+transport	I-KEY
+scheduling	O
+problem	O
+,	O
+with	O
+a	O
+potential	O
+decrease	O
+in	O
+development	O
+costs	O
+of	O
+the	O
+scheduling	O
+system	O
+.	O
+It	O
+can	O
+also	O
+be	O
+used	O
+as	O
+an	O
+efficient	O
+tool	O
+for	O
+rescheduling	O
+tasks	O
+which	O
+the	O
+existing	O
+cane	B-KEY
+transport	I-KEY
+scheduling	O
+system	O
+can	O
+not	O
+perform	O
+well	O
+
+Connecting	O
+the	O
+business	O
+without	O
+busting	O
+the	O
+budget	O
+The	O
+``	O
+multi-channel	B-KEY
+content	I-KEY
+delivery	I-KEY
+''	O
+model	O
+-LRB-	O
+MCCD	O
+-RRB-	O
+might	O
+be	O
+a	O
+new	O
+concept	O
+to	O
+you	O
+,	O
+but	O
+it	O
+is	O
+already	O
+beginning	O
+to	O
+replace	O
+traditional	O
+methods	O
+of	O
+business	O
+communications	O
+,	O
+print	O
+and	O
+content	O
+delivery	O
+,	O
+argues	O
+Darren	O
+Atkinson	O
+,	O
+CTO	O
+,	O
+FormScape	B-KEY
+
+Combining	O
+constraint	B-KEY
+programming	I-KEY
+and	O
+linear	B-KEY
+programming	I-KEY
+on	O
+an	O
+example	O
+of	O
+bus	B-KEY
+driver	I-KEY
+scheduling	I-KEY
+Provides	O
+details	O
+of	O
+a	O
+successful	O
+application	O
+where	O
+the	O
+column	B-KEY
+generation	I-KEY
+algorithm	I-KEY
+was	O
+used	O
+to	O
+combine	O
+constraint	B-KEY
+programming	I-KEY
+and	O
+linear	B-KEY
+programming	I-KEY
+.	O
+In	O
+the	O
+past	O
+,	O
+constraint	B-KEY
+programming	I-KEY
+and	O
+linear	B-KEY
+programming	I-KEY
+were	O
+considered	O
+to	O
+be	O
+two	O
+competing	O
+technologies	O
+that	O
+solved	O
+similar	O
+types	O
+of	O
+problems	O
+.	O
+Both	O
+these	O
+technologies	O
+had	O
+their	O
+strengths	O
+and	O
+weaknesses	O
+.	O
+The	O
+paper	O
+shows	O
+that	O
+the	O
+two	O
+technologies	O
+can	O
+be	O
+combined	O
+together	O
+to	O
+extract	O
+the	O
+strengths	O
+of	O
+both	O
+these	O
+technologies	O
+.	O
+Details	O
+of	O
+a	O
+real-world	O
+application	O
+to	O
+optimize	O
+bus	O
+driver	O
+duties	O
+are	O
+given	O
+.	O
+This	O
+system	O
+was	O
+developed	O
+by	O
+ILOG	B-KEY
+for	O
+a	O
+major	O
+software	O
+house	O
+in	O
+Japan	O
+using	O
+ILOG-Solver	O
+and	O
+ILOG-CPLEX	O
+,	O
+constraint	O
+programming	O
+and	O
+linear	O
+programming	O
+C/C	O
++	O
++	O
+libraries	O
+
+Structural	B-KEY
+invariance	I-KEY
+of	O
+spatial	B-KEY
+Pythagorean	I-KEY
+hodographs	I-KEY
+The	O
+structural	B-KEY
+invariance	I-KEY
+of	O
+the	O
+four-polynomial	B-KEY
+characterization	I-KEY
+for	O
+three-dimensional	O
+Pythagorean	O
+hodographs	O
+introduced	O
+by	O
+Dietz	O
+et	O
+al.	O
+-LRB-	O
+1993	O
+-RRB-	O
+,	O
+under	O
+arbitrary	B-KEY
+spatial	I-KEY
+rotations	I-KEY
+,	O
+is	O
+demonstrated	O
+.	O
+The	O
+proof	O
+relies	O
+on	O
+a	O
+factored-quaternion	O
+representation	O
+for	O
+Pythagorean	O
+hodographs	O
+in	O
+three-dimensional	O
+Euclidean	O
+space-a	O
+particular	O
+instance	O
+of	O
+the	O
+``	O
+PH	B-KEY
+representation	I-KEY
+map	I-KEY
+''	O
+proposed	O
+by	O
+Choi	O
+et	O
+al.	O
+-LRB-	O
+2002	O
+-RRB-	O
+-	O
+and	O
+the	O
+unit	B-KEY
+quaternion	I-KEY
+description	I-KEY
+of	O
+spatial	B-KEY
+rotations	I-KEY
+.	O
+This	O
+approach	O
+furnishes	O
+a	O
+remarkably	O
+simple	O
+derivation	O
+for	O
+the	O
+polynomials	O
+u	O
+-LRB-	O
+t	O
+-RRB-	O
+,	O
+upsilon	O
+-LRB-	O
+t	O
+-RRB-	O
+,	O
+p	O
+-LRB-	O
+t	O
+-RRB-	O
+,	O
+q	O
+-LRB-	O
+t	O
+-RRB-	O
+that	O
+specify	O
+the	O
+canonical	O
+form	O
+of	O
+a	O
+rotated	O
+Pythagorean	O
+hodograph	O
+,	O
+in	O
+terms	O
+of	O
+the	O
+original	O
+polynomials	O
+u	O
+-LRB-	O
+t	O
+-RRB-	O
+,	O
+upsilon	O
+-LRB-	O
+t	O
+-RRB-	O
+,	O
+p	O
+-LRB-	O
+t	O
+-RRB-	O
+,	O
+q	O
+-LRB-	O
+t	O
+-RRB-	O
+and	O
+the	O
+angle	O
+theta	O
+and	O
+axis	O
+n	O
+of	O
+the	O
+spatial	B-KEY
+rotation	I-KEY
+.	O
+The	O
+preservation	O
+of	O
+the	O
+canonical	O
+form	O
+of	O
+PH	O
+space	O
+curves	O
+under	O
+arbitrary	B-KEY
+spatial	I-KEY
+rotations	I-KEY
+is	O
+essential	O
+to	O
+their	O
+incorporation	O
+into	O
+computer-aided	O
+design	O
+and	O
+manufacturing	O
+applications	O
+,	O
+such	O
+as	O
+the	O
+contour	O
+machining	O
+of	O
+free-form	O
+surfaces	O
+using	O
+a	O
+ball-end	O
+mill	O
+and	O
+realtime	O
+PH	O
+curve	O
+CNC	O
+interpolators	O
+
+Are	O
+we	O
+there	O
+yet	O
+?	O
+:	O
+facing	O
+the	O
+never-ending	O
+speed	O
+and	O
+change	O
+of	O
+technology	O
+in	O
+midlife	O
+This	O
+essay	O
+is	O
+a	O
+personal	O
+reflection	O
+on	O
+entering	O
+librarianship	B-KEY
+in	O
+middle	B-KEY
+age	I-KEY
+at	O
+a	O
+time	O
+when	O
+the	O
+profession	O
+,	O
+like	O
+society	O
+in	O
+general	O
+,	O
+is	O
+experiencing	O
+rapidly	O
+accelerating	O
+change	O
+.	O
+Much	O
+of	O
+this	O
+change	O
+is	O
+due	O
+to	O
+the	O
+increased	O
+use	O
+of	O
+computers	B-KEY
+and	O
+information	B-KEY
+technologies	I-KEY
+in	O
+the	O
+library	O
+setting	O
+.	O
+These	O
+aids	O
+in	O
+the	O
+production	O
+,	O
+collection	B-KEY
+,	O
+storage	B-KEY
+,	O
+retrieval	B-KEY
+,	O
+and	O
+dissemination	B-KEY
+of	O
+the	O
+collective	B-KEY
+information	O
+,	O
+knowledge	O
+,	O
+and	O
+sometimes	O
+wisdom	O
+of	O
+the	O
+past	O
+and	O
+the	O
+contemporary	O
+world	O
+can	O
+exhilarate	O
+or	O
+burden	O
+depending	O
+on	O
+one	O
+'s	O
+worldview	O
+,	O
+the	O
+organization	O
+,	O
+and	O
+the	O
+flexibility	O
+of	O
+the	O
+workplace	O
+.	O
+This	O
+writer	O
+finds	O
+herself	O
+working	O
+in	O
+a	O
+library	O
+where	O
+everyone	O
+is	O
+expected	O
+continually	O
+to	O
+explore	O
+and	O
+use	O
+new	O
+ways	O
+of	O
+working	O
+and	O
+providing	O
+library	O
+service	O
+to	O
+a	O
+campus	O
+and	O
+a	O
+wider	O
+community	O
+.	O
+No	O
+time	O
+is	O
+spent	O
+in	O
+reflecting	O
+on	O
+what	O
+was	O
+,	O
+but	O
+all	O
+efforts	O
+are	O
+to	O
+anticipate	O
+and	O
+prepare	O
+for	O
+what	O
+will	O
+be	O
+
+Digital-domain	B-KEY
+self-calibration	I-KEY
+technique	I-KEY
+for	O
+video-rate	B-KEY
+pipeline	I-KEY
+A/D	I-KEY
+converters	I-KEY
+using	O
+Gaussian	O
+white	O
+noise	O
+A	O
+digital-domain	B-KEY
+self-calibration	I-KEY
+technique	I-KEY
+for	O
+video-rate	B-KEY
+pipeline	I-KEY
+A/D	I-KEY
+converters	I-KEY
+based	O
+on	O
+a	O
+Gaussian	B-KEY
+white	I-KEY
+noise	I-KEY
+input	I-KEY
+signal	I-KEY
+is	O
+presented	O
+.	O
+The	O
+proposed	O
+algorithm	O
+is	O
+simple	O
+and	O
+efficient	O
+.	O
+A	O
+design	O
+example	O
+is	O
+shown	O
+to	O
+illustrate	O
+that	O
+the	O
+overall	O
+linearity	O
+of	O
+a	O
+pipeline	O
+ADC	O
+can	O
+be	O
+highly	O
+improved	O
+using	O
+this	O
+technique	O
+
+Solution	O
+of	O
+a	O
+class	O
+of	O
+two-dimensional	O
+integral	O
+equations	O
+The	O
+two-dimensional	O
+integral	O
+equation	O
+1	O
+/	O
+pi	O
+integral	O
+integral	O
+/	O
+sub	O
+D	O
+/	O
+-LRB-	O
+phi	O
+-LRB-	O
+r	O
+,	O
+theta	O
+-RRB-	O
+/	O
+R/sup	O
+2	O
+/	O
+-RRB-	O
+dS	O
+=	O
+f	O
+-LRB-	O
+r/sub	O
+0	O
+/	O
+,	O
+theta	O
+/	O
+sub	O
+0	O
+/	O
+-RRB-	O
+defined	O
+on	O
+a	O
+circular	B-KEY
+disk	I-KEY
+D	O
+:	O
+r/sub	O
+0	O
+/	O
+<	O
+or	O
+=	O
+a	O
+,	O
+0	O
+<	O
+or	O
+=	O
+theta	O
+/	O
+sub	O
+0	O
+/	O
+<	O
+or	O
+=	O
+2	O
+pi	O
+,	O
+is	O
+considered	O
+in	O
+the	O
+present	O
+paper	O
+.	O
+Here	O
+R	O
+in	O
+the	O
+kernel	B-KEY
+denotes	O
+the	O
+distance	O
+between	O
+two	O
+points	O
+P	O
+-LRB-	O
+r	O
+,	O
+theta	O
+-RRB-	O
+and	O
+P/sub	O
+0	O
+/	O
+-LRB-	O
+r/sub	O
+0	O
+/	O
+,	O
+theta	O
+/	O
+sub	O
+0	O
+/	O
+-RRB-	O
+in	O
+D	O
+,	O
+and	O
+0	O
+<	O
+alpha	O
+<	O
+2	O
+or	O
+2	O
+<	O
+alpha	O
+<	O
+4	O
+.	O
+Based	O
+on	O
+some	O
+known	O
+results	O
+of	O
+Bessel	B-KEY
+functions	I-KEY
+,	O
+integral	B-KEY
+representations	I-KEY
+of	O
+the	O
+kernel	B-KEY
+are	O
+established	O
+for	O
+0	O
+<	O
+alpha	O
+<	O
+2	O
+and	O
+2	O
+<	O
+alpha	O
+<	O
+4	O
+,	O
+respectively	O
+,	O
+and	O
+employed	O
+to	O
+solve	O
+the	O
+corresponding	O
+two-dimensional	O
+integral	O
+equation	O
+.	O
+The	O
+solutions	O
+of	O
+the	O
+weakly	B-KEY
+singular	I-KEY
+integral	I-KEY
+equation	I-KEY
+for	O
+0	O
+<	O
+alpha	O
+<	O
+2	O
+and	O
+of	O
+the	O
+hypersingular	B-KEY
+integral	I-KEY
+equation	I-KEY
+for	O
+2	O
+<	O
+alpha	O
+<	O
+4	O
+are	O
+obtained	O
+,	O
+respectively	O
+
+Fast	B-KEY
+broadcasting	I-KEY
+and	O
+gossiping	B-KEY
+in	O
+radio	B-KEY
+networks	I-KEY
+We	O
+establish	O
+an	O
+O	O
+-LRB-	O
+n	O
+log/sup	O
+2	O
+/	O
+n	O
+-RRB-	O
+upper	B-KEY
+bound	I-KEY
+on	O
+the	O
+time	O
+for	O
+deterministic	B-KEY
+distributed	I-KEY
+broadcasting	I-KEY
+in	O
+multi-hop	O
+radio	B-KEY
+networks	I-KEY
+with	O
+unknown	O
+topology	O
+.	O
+This	O
+nearly	O
+matches	O
+the	O
+known	O
+lower	O
+bound	O
+of	O
+Omega	O
+-LRB-	O
+n	O
+log	O
+n	O
+-RRB-	O
+.	O
+The	O
+fastest	O
+previously	O
+known	O
+algorithm	O
+for	O
+this	O
+problem	O
+works	O
+in	O
+time	O
+O	O
+-LRB-	O
+n/sup	O
+3/2	O
+/	O
+-RRB-	O
+.	O
+Using	O
+our	O
+broadcasting	O
+algorithm	O
+,	O
+we	O
+develop	O
+an	O
+O	O
+-LRB-	O
+n/sup	O
+3/2	O
+/	O
+log/sup	O
+2	O
+/	O
+n	O
+-RRB-	O
+algorithm	O
+for	O
+gossiping	B-KEY
+in	O
+the	O
+same	O
+network	O
+model	O
+
+When	O
+reference	B-KEY
+works	I-KEY
+are	O
+not	O
+books-the	O
+new	O
+edition	O
+of	O
+the	O
+Guide	B-KEY
+to	I-KEY
+Reference	I-KEY
+Books	I-KEY
+The	O
+author	O
+considers	O
+the	O
+history	B-KEY
+of	O
+the	O
+Guide	B-KEY
+to	I-KEY
+Reference	I-KEY
+Books	I-KEY
+-LRB-	O
+GRB	B-KEY
+-RRB-	O
+and	O
+its	O
+importance	O
+in	O
+librarianship	B-KEY
+.	O
+He	O
+discusses	O
+the	O
+ways	O
+in	O
+which	O
+the	O
+new	O
+edition	O
+is	O
+taking	O
+advantage	O
+of	O
+changing	O
+times	O
+.	O
+GRB	B-KEY
+has	O
+become	O
+a	O
+cornerstone	O
+of	O
+the	O
+literature	O
+of	O
+U.S.	O
+librarianship	O
+.	B-KEY
+The	O
+biggest	O
+change	O
+GRB	B-KEY
+will	O
+undergo	O
+to	O
+become	O
+GRS	B-KEY
+-LRB-	O
+Guide	B-KEY
+to	I-KEY
+Reference	I-KEY
+Sources	I-KEY
+-RRB-	O
+will	O
+be	O
+designing	O
+it	O
+primarily	O
+as	O
+a	O
+Web	B-KEY
+product	I-KEY
+
+Predictive	B-KEY
+control	I-KEY
+of	O
+a	O
+high	B-KEY
+temperature-short	I-KEY
+time	I-KEY
+pasteurisation	I-KEY
+process	I-KEY
+Modifications	O
+on	O
+the	O
+dynamic	O
+matrix	O
+control	O
+-LRB-	O
+DMC	O
+-RRB-	O
+algorithm	O
+are	O
+presented	O
+to	O
+deal	O
+with	O
+transfer	B-KEY
+functions	I-KEY
+with	O
+varying	O
+parameters	O
+in	O
+order	O
+to	O
+control	O
+a	O
+high	B-KEY
+temperature-short	I-KEY
+time	I-KEY
+pasteurisation	I-KEY
+process	I-KEY
+.	O
+To	O
+control	O
+processes	O
+with	O
+first	O
+order	O
+with	O
+pure	O
+time	B-KEY
+delay	I-KEY
+models	I-KEY
+whose	O
+parameters	O
+present	O
+an	O
+exogenous	B-KEY
+variable	I-KEY
+dependence	I-KEY
+,	O
+a	O
+new	O
+method	O
+of	O
+free	B-KEY
+response	I-KEY
+calculation	I-KEY
+,	O
+using	O
+multiple	B-KEY
+model	I-KEY
+information	I-KEY
+,	O
+is	O
+developed	O
+.	O
+Two	O
+methods	O
+,	O
+to	O
+cope	O
+with	O
+those	O
+nonlinear	B-KEY
+models	I-KEY
+that	O
+allow	O
+a	O
+generalised	B-KEY
+Hammerstein	I-KEY
+model	I-KEY
+description	I-KEY
+,	O
+are	O
+proposed	O
+.	O
+The	O
+proposed	O
+methods	O
+have	O
+been	O
+tested	O
+,	O
+both	O
+in	O
+simulation	O
+and	O
+in	O
+real	O
+cases	O
+,	O
+in	O
+comparison	O
+with	O
+PID	O
+and	O
+DMC	O
+classic	O
+controllers	O
+,	O
+showing	O
+important	O
+improvements	O
+on	O
+reference	B-KEY
+tracking	I-KEY
+and	O
+disturbance	B-KEY
+rejection	I-KEY
+
+Sliding	B-KEY
+mode	I-KEY
+dynamics	I-KEY
+in	O
+continuous	B-KEY
+feedback	I-KEY
+control	I-KEY
+for	O
+distributed	B-KEY
+discrete-event	I-KEY
+scheduling	I-KEY
+A	O
+continuous	B-KEY
+feedback	I-KEY
+control	I-KEY
+approach	O
+for	O
+real-time	B-KEY
+scheduling	I-KEY
+of	O
+discrete	O
+events	O
+is	O
+presented	O
+motivated	O
+by	O
+the	O
+need	O
+for	O
+control	B-KEY
+theoretic	I-KEY
+techniques	I-KEY
+to	O
+analyze	O
+and	O
+design	O
+such	O
+systems	O
+in	O
+distributed	B-KEY
+manufacturing	I-KEY
+applications	I-KEY
+.	O
+These	O
+continuous	B-KEY
+feedback	I-KEY
+control	I-KEY
+systems	O
+exhibit	O
+highly	O
+nonlinear	O
+and	O
+discontinuous	O
+dynamics	O
+.	O
+Specifically	O
+,	O
+when	O
+the	O
+production	B-KEY
+demand	I-KEY
+in	O
+the	O
+manufacturing	O
+system	O
+exceeds	O
+the	O
+available	O
+resource	B-KEY
+capacity	I-KEY
+then	O
+the	O
+control	O
+system	O
+``	O
+chatters	O
+''	O
+and	O
+exhibits	O
+sliding	O
+modes	O
+.	O
+This	O
+sliding	O
+mode	O
+behavior	O
+is	O
+advantageously	O
+used	O
+in	O
+the	O
+scheduling	O
+application	O
+by	O
+allowing	O
+the	O
+system	O
+to	O
+visit	O
+different	O
+schedules	O
+within	O
+an	O
+infinitesimal	O
+region	O
+near	O
+the	O
+sliding	O
+surface	O
+.	O
+In	O
+the	O
+paper	O
+,	O
+an	O
+analytical	O
+model	O
+is	O
+developed	O
+to	O
+characterize	O
+the	O
+sliding	B-KEY
+mode	I-KEY
+dynamics	I-KEY
+.	O
+This	O
+model	O
+is	O
+then	O
+used	O
+to	O
+design	O
+controllers	O
+in	O
+the	O
+sliding	O
+mode	O
+domain	O
+to	O
+improve	O
+the	O
+effectiveness	O
+of	O
+the	O
+control	O
+system	O
+to	O
+``	O
+search	O
+''	O
+for	O
+schedules	O
+with	O
+good	O
+performance	O
+.	O
+Computational	O
+results	O
+indicate	O
+that	O
+the	O
+continuous	B-KEY
+feedback	I-KEY
+control	I-KEY
+approach	O
+can	O
+provide	O
+near-optimal	O
+schedules	O
+and	O
+that	O
+it	O
+is	O
+computationally	O
+efficient	O
+compared	O
+to	O
+existing	O
+scheduling	O
+techniques	O
+
+Tracking	O
+with	O
+sensor	B-KEY
+failures	I-KEY
+Studies	O
+the	O
+reliability	B-KEY
+with	O
+sensor	B-KEY
+failures	I-KEY
+of	O
+the	O
+asymptotic	B-KEY
+tracking	I-KEY
+problem	I-KEY
+for	O
+linear	B-KEY
+time	I-KEY
+invariant	I-KEY
+systems	I-KEY
+using	O
+the	O
+factorization	B-KEY
+approach	I-KEY
+.	O
+The	O
+plant	O
+is	O
+two-output	O
+and	O
+the	O
+compensator	O
+is	O
+two-degree-of-freedom	O
+.	O
+Necessary	B-KEY
+and	I-KEY
+sufficient	I-KEY
+conditions	I-KEY
+are	O
+presented	O
+for	O
+the	O
+general	O
+problem	O
+and	O
+a	O
+simple	O
+solution	O
+is	O
+given	O
+for	O
+problems	O
+with	O
+stable	O
+plants	O
+
+Model	B-KEY
+checking	I-KEY
+games	I-KEY
+for	O
+branching	B-KEY
+time	I-KEY
+logics	I-KEY
+This	O
+paper	O
+defines	O
+and	O
+examines	O
+model	B-KEY
+checking	I-KEY
+games	I-KEY
+for	O
+the	O
+branching	O
+time	O
+temporal	B-KEY
+logic	I-KEY
+CTL	O
+*	O
+.	O
+The	O
+games	O
+employ	O
+a	O
+technique	O
+called	O
+focus	O
+which	O
+enriches	O
+sets	O
+by	O
+picking	O
+out	O
+one	O
+distinguished	O
+element	O
+.	O
+This	O
+is	O
+necessary	O
+to	O
+avoid	O
+ambiguities	O
+in	O
+the	O
+regeneration	O
+of	O
+temporal	B-KEY
+operators	I-KEY
+.	O
+The	O
+correctness	O
+of	O
+these	O
+games	O
+is	O
+proved	O
+,	O
+and	O
+optimizations	O
+are	O
+considered	O
+to	O
+obtain	O
+model	B-KEY
+checking	I-KEY
+games	I-KEY
+for	O
+important	O
+fragments	O
+of	O
+CTL	O
+*	O
+.	O
+A	O
+game	O
+based	O
+model	O
+checking	O
+algorithm	O
+that	O
+matches	O
+the	O
+known	O
+lower	O
+and	O
+upper	O
+complexity	B-KEY
+bounds	I-KEY
+is	O
+sketched	O
+
+Hot	O
+controllers	O
+Over	O
+the	O
+last	O
+few	O
+years	O
+,	O
+the	O
+semiconductor	O
+industry	O
+has	O
+put	O
+much	O
+emphasis	O
+on	O
+ways	O
+to	O
+improve	O
+the	O
+accuracy	O
+of	O
+thermal	B-KEY
+mass	I-KEY
+flow	I-KEY
+controllers	I-KEY
+-LRB-	O
+TMFCs	O
+-RRB-	O
+.	O
+Although	O
+issues	O
+involving	O
+TMFC	O
+mounting	O
+orientation	O
+and	O
+pressure	O
+effects	O
+have	O
+received	O
+much	O
+attention	O
+,	O
+little	O
+has	O
+been	O
+done	O
+to	O
+address	O
+the	O
+effect	O
+of	O
+changes	O
+in	O
+ambient	O
+temperature	O
+or	O
+process	O
+gas	O
+temperature	O
+.	O
+Scientists	O
+and	O
+engineers	O
+at	O
+Qualiflow	O
+have	O
+succeeded	O
+to	O
+solve	O
+the	O
+problem	O
+using	O
+a	O
+temperature	B-KEY
+correction	I-KEY
+algorithm	I-KEY
+for	O
+digital	O
+TMFCs	O
+.	O
+Using	O
+an	O
+in	B-KEY
+situ	I-KEY
+environmental	I-KEY
+temperature	I-KEY
+compensation	I-KEY
+technique	O
+,	O
+we	O
+calculated	O
+correction	O
+factors	O
+for	O
+the	O
+temperature	O
+effect	O
+and	O
+obtained	O
+satisfactory	O
+results	O
+with	O
+both	O
+the	O
+traditional	O
+sensor	O
+and	O
+the	O
+new	O
+,	O
+improved	O
+thin-film	O
+sensors	O
+
+On	O
+the	O
+p-adic	B-KEY
+Birch	I-KEY
+,	O
+Swinnerton-Dyer	B-KEY
+Conjecture	I-KEY
+for	O
+non-semistable	O
+reduction	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+examine	O
+the	O
+Iwasawa	O
+theory	O
+of	O
+elliptic	B-KEY
+curves	I-KEY
+E	O
+with	O
+additive	B-KEY
+reduction	I-KEY
+at	O
+an	O
+odd	O
+prime	O
+p.	O
+By	O
+extending	O
+Perrin-Riou	O
+'s	O
+theory	O
+to	O
+certain	O
+nonsemistable	O
+representations	O
+,	O
+we	O
+are	O
+able	O
+to	O
+convert	O
+Kato	O
+'s	O
+zeta-elements	O
+into	O
+p-adic	B-KEY
+L-functions	I-KEY
+.	O
+This	O
+allows	O
+us	O
+to	O
+deduce	O
+the	O
+cotorsion	B-KEY
+of	O
+the	O
+Selmer	B-KEY
+group	I-KEY
+over	O
+the	O
+cyclotomic	O
+Z/sub	O
+p	O
+/	O
+-	O
+extension	O
+of	O
+Q	O
+,	O
+and	O
+thus	O
+prove	O
+an	O
+inequality	O
+in	O
+the	O
+p-adic	B-KEY
+Birch	I-KEY
+and	O
+Swinnerton-Dyer	B-KEY
+conjecture	I-KEY
+at	O
+primes	O
+p	O
+whose	O
+square	O
+divides	O
+the	O
+conductor	O
+of	O
+E	O
+
+Feldkamp-type	B-KEY
+image	I-KEY
+reconstruction	I-KEY
+from	O
+equiangular	B-KEY
+data	I-KEY
+The	O
+cone-beam	B-KEY
+approach	I-KEY
+for	O
+image	O
+reconstruction	O
+attracts	O
+increasing	O
+attention	O
+in	O
+various	O
+applications	O
+,	O
+especially	O
+medical	B-KEY
+imaging	I-KEY
+.	O
+Previously	O
+,	O
+the	O
+traditional	O
+practical	B-KEY
+cone-beam	I-KEY
+reconstruction	I-KEY
+method	I-KEY
+,	O
+the	O
+Feldkamp	O
+algorithm	O
+,	O
+was	O
+generalized	O
+into	O
+the	O
+case	O
+of	O
+spiral/helical	B-KEY
+scanning	I-KEY
+loci	I-KEY
+with	O
+equispatial	B-KEY
+cone-beam	I-KEY
+projection	I-KEY
+data	I-KEY
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+formulated	O
+the	O
+generalized	B-KEY
+Feldkamp	I-KEY
+algorithm	I-KEY
+in	O
+the	O
+case	O
+of	O
+equiangular	B-KEY
+cone-beam	I-KEY
+projection	I-KEY
+data	I-KEY
+,	O
+and	O
+performed	O
+numerical	B-KEY
+simulation	I-KEY
+to	O
+evaluate	O
+the	O
+image	B-KEY
+quality	I-KEY
+.	O
+Because	O
+medical	B-KEY
+multi-slice/cone-beam	I-KEY
+CT	I-KEY
+scanners	I-KEY
+typically	O
+use	O
+equiangular	O
+projection	O
+data	O
+,	O
+our	O
+new	O
+formula	O
+may	O
+be	O
+useful	O
+in	O
+this	O
+area	O
+as	O
+a	O
+framework	O
+for	O
+further	O
+refinement	O
+and	O
+a	O
+benchmark	O
+for	O
+comparison	O
+
+Process	B-KEY
+specialization	I-KEY
+:	O
+defining	O
+specialization	O
+for	O
+state	B-KEY
+diagrams	I-KEY
+A	O
+precise	O
+definition	O
+of	O
+specialization	O
+and	O
+inheritance	B-KEY
+promises	O
+to	O
+be	O
+as	O
+useful	O
+in	O
+organizational	B-KEY
+process	I-KEY
+modeling	I-KEY
+as	O
+it	O
+is	O
+in	O
+object	O
+modeling	O
+.	O
+It	O
+would	O
+help	O
+us	O
+better	O
+understand	O
+,	O
+maintain	O
+,	O
+reuse	O
+,	O
+and	O
+generate	O
+process	O
+models	O
+.	O
+However	O
+,	O
+even	O
+though	O
+object-oriented	B-KEY
+analysis	I-KEY
+and	O
+design	O
+methodologies	O
+take	O
+full	O
+advantage	O
+of	O
+the	O
+object	B-KEY
+specialization	I-KEY
+hierarchy	I-KEY
+,	O
+the	O
+process	B-KEY
+specialization	I-KEY
+hierarchy	O
+is	O
+not	O
+supported	O
+in	O
+major	O
+process	B-KEY
+representations	I-KEY
+,	O
+such	O
+as	O
+the	O
+state	B-KEY
+diagram	I-KEY
+,	O
+data	O
+flow	O
+diagram	O
+,	O
+and	O
+UML	O
+representations	O
+.	O
+Partly	O
+underlying	O
+this	O
+lack	O
+of	O
+support	O
+is	O
+an	O
+implicit	O
+assumption	O
+that	O
+we	O
+can	O
+always	O
+specialize	O
+a	O
+process	O
+by	O
+treating	O
+it	O
+as	O
+``	O
+just	O
+another	O
+object	O
+.	O
+''	O
+We	O
+argue	O
+in	O
+this	O
+paper	O
+that	O
+this	O
+is	O
+not	O
+so	O
+straightforward	O
+as	O
+it	O
+might	O
+seem	O
+;	O
+we	O
+argue	O
+that	O
+a	O
+process-specific	O
+approach	O
+must	O
+be	O
+developed	O
+.	O
+We	O
+propose	O
+such	O
+an	O
+approach	O
+in	O
+the	O
+form	O
+of	O
+a	O
+set	O
+of	O
+transformations	O
+which	O
+,	O
+when	O
+applied	O
+to	O
+a	O
+process	O
+description	O
+,	O
+always	O
+result	O
+in	O
+specialization	O
+.	O
+We	O
+illustrate	O
+this	O
+approach	O
+by	O
+applying	O
+it	O
+to	O
+the	O
+state	B-KEY
+diagram	I-KEY
+representation	O
+and	O
+demonstrate	O
+that	O
+this	O
+approach	O
+to	O
+process	B-KEY
+specialization	I-KEY
+is	O
+not	O
+only	O
+theoretically	O
+possible	O
+,	O
+but	O
+shows	O
+promise	O
+as	O
+a	O
+method	O
+for	O
+categorizing	O
+and	O
+analyzing	O
+processes	O
+.	O
+We	O
+point	O
+out	O
+apparent	O
+inconsistencies	O
+between	O
+our	O
+notion	O
+of	O
+process	B-KEY
+specialization	I-KEY
+and	O
+existing	O
+work	O
+on	O
+object	O
+specialization	O
+but	O
+show	O
+that	O
+these	O
+inconsistencies	O
+are	O
+superficial	O
+and	O
+that	O
+the	O
+definition	O
+we	O
+provide	O
+is	O
+compatible	O
+with	O
+the	O
+traditional	O
+notion	O
+of	O
+specialization	O
+
+An	O
+eight-year	O
+study	O
+of	O
+Internet-based	B-KEY
+remote	I-KEY
+medical	I-KEY
+counselling	I-KEY
+We	O
+carried	O
+out	O
+a	O
+prospective	O
+study	O
+of	O
+an	O
+Internet-based	O
+remote	O
+counselling	O
+service	O
+.	O
+A	O
+total	O
+of	O
+15,456	O
+Internet	B-KEY
+users	I-KEY
+visited	O
+the	O
+Web	B-KEY
+site	I-KEY
+over	O
+eight	O
+years	O
+.	O
+From	O
+these	O
+,	O
+1500	O
+users	O
+were	O
+randomly	O
+selected	O
+for	O
+analysis	O
+.	O
+Medical	O
+counselling	O
+had	O
+been	O
+granted	O
+to	O
+901	O
+of	O
+the	O
+people	O
+requesting	O
+it	O
+-LRB-	O
+60	O
+%	O
+-RRB-	O
+.	O
+One	O
+hundred	O
+and	O
+sixty-four	O
+physicians	O
+formed	O
+project	O
+groups	O
+to	O
+process	O
+the	O
+requests	O
+and	O
+responded	O
+using	O
+email	B-KEY
+.	O
+The	O
+distribution	O
+of	O
+patients	O
+using	O
+the	O
+service	O
+was	O
+similar	O
+to	O
+the	O
+availability	O
+of	O
+the	O
+Internet	O
+:	O
+78	O
+%	O
+were	O
+from	O
+the	O
+European	O
+Union	O
+,	O
+North	O
+America	O
+and	O
+Australia	O
+.	O
+Sixty-seven	O
+per	O
+cent	O
+of	O
+the	O
+patients	O
+lived	O
+in	O
+urban	B-KEY
+areas	I-KEY
+and	O
+the	O
+remainder	O
+were	O
+residents	O
+of	O
+remote	B-KEY
+rural	I-KEY
+areas	I-KEY
+with	O
+limited	O
+local	O
+medical	O
+coverage	O
+.	O
+Sixty-five	O
+per	O
+cent	O
+of	O
+the	O
+requests	O
+were	O
+about	O
+problems	O
+of	O
+internal	O
+medicine	O
+and	O
+30	O
+%	O
+of	O
+the	O
+requests	O
+concerned	O
+surgical	B-KEY
+issues	I-KEY
+.	O
+The	O
+remaining	O
+5	O
+%	O
+of	O
+the	O
+patients	O
+sought	O
+information	O
+about	O
+recent	O
+developments	O
+,	O
+such	O
+as	O
+molecular	O
+medicine	O
+or	O
+aviation	O
+medicine	O
+.	O
+During	O
+the	O
+project	O
+,	O
+our	O
+portal	B-KEY
+became	O
+inaccessible	O
+five	O
+times	O
+,	O
+and	O
+counselling	O
+was	O
+not	O
+possible	O
+on	O
+44	O
+days	O
+.	O
+There	O
+was	O
+no	O
+hacking	O
+of	O
+the	O
+Web	B-KEY
+site	I-KEY
+.	O
+Internet-based	O
+medical	O
+counselling	O
+is	O
+a	O
+helpful	O
+addition	O
+to	O
+conventional	O
+practice	O
+
+Robust	B-KEY
+control	I-KEY
+of	O
+nonlinear	B-KEY
+systems	I-KEY
+with	O
+parametric	B-KEY
+uncertainty	I-KEY
+Probabilistic	B-KEY
+robustness	I-KEY
+analysis	I-KEY
+and	O
+synthesis	O
+for	O
+nonlinear	B-KEY
+systems	I-KEY
+with	O
+uncertain	B-KEY
+parameters	I-KEY
+are	O
+presented	O
+.	O
+Monte	B-KEY
+Carlo	I-KEY
+simulation	I-KEY
+is	O
+used	O
+to	O
+estimate	O
+the	O
+likelihood	O
+of	O
+system	B-KEY
+instability	I-KEY
+and	O
+violation	O
+of	O
+performance	O
+requirements	O
+subject	O
+to	O
+variations	O
+of	O
+the	O
+probabilistic	O
+system	O
+parameters	O
+.	O
+Stochastic	O
+robust	B-KEY
+control	I-KEY
+synthesis	O
+searches	O
+the	O
+controller	O
+design	O
+parameter	O
+space	O
+to	O
+minimize	O
+a	O
+cost	O
+that	O
+is	O
+a	O
+function	O
+of	O
+the	O
+probabilities	O
+that	O
+design	O
+criteria	O
+will	O
+not	O
+be	O
+satisfied	O
+.	O
+The	O
+robust	B-KEY
+control	I-KEY
+design	O
+approach	O
+is	O
+illustrated	O
+by	O
+a	O
+simple	O
+nonlinear	O
+example	O
+.	O
+A	O
+modified	B-KEY
+feedback	I-KEY
+linearization	I-KEY
+control	I-KEY
+is	O
+chosen	O
+as	O
+controller	O
+structure	O
+,	O
+and	O
+the	O
+design	O
+parameters	O
+are	O
+searched	O
+by	O
+a	O
+genetic	B-KEY
+algorithm	I-KEY
+to	O
+achieve	O
+the	O
+tradeoff	O
+between	O
+stability	O
+and	O
+performance	O
+robustness	O
+
+Gossip	O
+is	O
+synteny	O
+:	O
+Incomplete	O
+gossip	O
+and	O
+the	O
+syntenic	B-KEY
+distance	I-KEY
+between	O
+genomes	B-KEY
+The	O
+syntenic	B-KEY
+distance	I-KEY
+between	O
+two	O
+genomes	B-KEY
+is	O
+given	O
+by	O
+the	O
+minimum	O
+number	O
+of	O
+fusions	O
+,	O
+fissions	O
+,	O
+and	O
+translocations	O
+required	O
+to	O
+transform	O
+one	O
+into	O
+the	O
+other	O
+,	O
+ignoring	O
+the	O
+order	O
+of	O
+genes	O
+within	O
+chromosomes	B-KEY
+.	O
+Computing	O
+this	O
+distance	O
+is	O
+NP-hard	B-KEY
+.	O
+In	O
+the	O
+present	O
+work	O
+,	O
+we	O
+give	O
+a	O
+tight	O
+connection	O
+between	O
+syntenic	B-KEY
+distance	I-KEY
+and	O
+the	O
+incomplete	B-KEY
+gossip	I-KEY
+problem	I-KEY
+,	O
+a	O
+novel	O
+generalization	O
+of	O
+the	O
+classical	O
+gossip	O
+problem	O
+.	O
+In	O
+this	O
+problem	O
+,	O
+there	O
+are	O
+n	O
+gossipers	O
+,	O
+each	O
+with	O
+a	O
+unique	O
+piece	O
+of	O
+initial	O
+information	O
+;	O
+they	O
+communicate	O
+by	O
+phone	O
+calls	O
+in	O
+which	O
+the	O
+two	O
+participants	O
+exchange	O
+all	O
+their	O
+information	O
+.	O
+The	O
+goal	O
+is	O
+to	O
+minimize	O
+the	O
+total	O
+number	O
+of	O
+phone	O
+calls	O
+necessary	O
+to	O
+inform	O
+each	O
+gossiper	O
+of	O
+his	O
+set	O
+of	O
+relevant	O
+gossip	O
+which	O
+he	O
+desires	O
+to	O
+learn	O
+.	O
+As	O
+an	O
+application	O
+of	O
+the	O
+connection	O
+between	O
+syntenic	B-KEY
+distance	I-KEY
+and	O
+incomplete	O
+gossip	O
+,	O
+we	O
+derive	O
+an	O
+O	O
+-LRB-	O
+2/sup	O
+O	O
+-LRB-	O
+n	O
+log	O
+n	O
+-RRB-	O
+/	O
+-RRB-	O
+algorithm	O
+to	O
+exactly	O
+compute	O
+the	O
+syntenic	B-KEY
+distance	I-KEY
+between	O
+two	O
+genomes	B-KEY
+with	O
+at	O
+most	O
+n	O
+chromosomes	B-KEY
+each	O
+.	O
+Our	O
+algorithm	O
+requires	O
+O	O
+-LRB-	O
+n/sup	O
+2	O
+/	O
++2	O
+/	O
+sup	O
+O	O
+-LRB-	O
+d	O
+log	O
+d	O
+-RRB-	O
+/	O
+-RRB-	O
+time	O
+when	O
+this	O
+distance	O
+is	O
+d	O
+,	O
+improving	O
+the	O
+O	O
+-LRB-	O
+n/sup	O
+2	O
+/	O
++2	O
+-LRB-	O
+O	O
+-LRB-	O
+d	O
+/	O
+/	O
+sup	O
+2	O
+/	O
+-RRB-	O
+-RRB-	O
+-RRB-	O
+running	B-KEY
+time	I-KEY
+of	O
+the	O
+best	O
+previous	O
+exact	O
+algorithm	O
+
+No-go	O
+areas	O
+?	O
+-LSB-	O
+content	O
+management	O
+-RSB-	O
+Alex	O
+Fry	O
+looks	O
+at	O
+how	O
+content	B-KEY
+management	I-KEY
+systems	I-KEY
+can	O
+be	O
+used	O
+to	O
+ensure	O
+website	B-KEY
+access	I-KEY
+for	O
+one	O
+important	O
+customer	O
+group	O
+,	O
+the	O
+disabled	B-KEY
+
+The	O
+UPS	O
+as	O
+network	O
+management	O
+tool	O
+Uninterrupted	B-KEY
+power	I-KEY
+supplies	I-KEY
+-LRB-	O
+UPS	O
+-RRB-	O
+,	O
+or	O
+battery	O
+backup	O
+systems	O
+,	O
+once	O
+provided	O
+a	O
+relatively	O
+limited	O
+,	O
+although	O
+important	O
+,	O
+function-continual	O
+battery	O
+support	O
+to	O
+connected	O
+equipment	O
+in	O
+the	O
+event	O
+of	O
+a	O
+power	O
+failure	O
+.	O
+However	O
+,	O
+yesterday	O
+'s	O
+``	O
+battery	O
+in	O
+a	O
+box	O
+''	O
+has	O
+evolved	O
+into	O
+a	O
+sophisticated	O
+network	B-KEY
+power	I-KEY
+management	I-KEY
+tool	O
+that	O
+can	O
+monitor	O
+and	O
+actively	O
+correct	O
+many	O
+of	O
+the	O
+problems	O
+that	O
+might	O
+plague	O
+a	O
+healthy	O
+network	O
+.	O
+This	O
+new	O
+breed	O
+of	O
+UPS	O
+system	O
+provides	O
+such	O
+features	O
+as	O
+automatic	B-KEY
+voltage	I-KEY
+regulation	I-KEY
+,	O
+generous	O
+runtimes	O
+and	O
+unattended	B-KEY
+system	I-KEY
+shutdown	I-KEY
+,	O
+and	O
+now	O
+also	O
+monitors	O
+and	O
+automatically	O
+restarts	O
+critical	O
+services	O
+and	O
+operating	O
+systems	O
+if	O
+they	O
+lock	O
+up	O
+or	O
+otherwise	O
+fail	O
+
+Modeling	B-KEY
+shape	O
+and	O
+topology	B-KEY
+of	O
+low-resolution	B-KEY
+density	I-KEY
+maps	I-KEY
+of	O
+biological	B-KEY
+macromolecules	I-KEY
+We	O
+develop	O
+an	O
+efficient	O
+way	O
+of	O
+representing	O
+the	O
+geometry	B-KEY
+and	O
+topology	B-KEY
+of	O
+volumetric	B-KEY
+datasets	I-KEY
+of	O
+biological	B-KEY
+structures	I-KEY
+from	O
+medium	O
+to	O
+low	O
+resolution	O
+,	O
+aiming	O
+at	O
+storing	O
+and	O
+querying	O
+them	O
+in	O
+a	O
+database	B-KEY
+framework	I-KEY
+.	O
+We	O
+make	O
+use	O
+of	O
+a	O
+new	O
+vector	B-KEY
+quantization	I-KEY
+algorithm	I-KEY
+to	O
+select	O
+the	O
+points	O
+within	O
+the	O
+macromolecule	O
+that	O
+best	O
+approximate	O
+the	O
+probability	B-KEY
+density	I-KEY
+function	I-KEY
+of	O
+the	O
+original	B-KEY
+volume	I-KEY
+data	I-KEY
+.	O
+Connectivity	B-KEY
+among	O
+points	O
+is	O
+obtained	O
+with	O
+the	O
+use	O
+of	O
+the	O
+alpha	B-KEY
+shapes	I-KEY
+theory	I-KEY
+.	O
+This	O
+novel	O
+data	B-KEY
+representation	I-KEY
+has	O
+a	O
+number	O
+of	O
+interesting	O
+characteristics	O
+,	O
+such	O
+as	O
+-LRB-	O
+1	O
+-RRB-	O
+it	O
+allows	O
+us	O
+to	O
+automatically	O
+segment	O
+and	O
+quantify	O
+a	O
+number	O
+of	O
+important	O
+structural	B-KEY
+features	I-KEY
+from	O
+low-resolution	O
+maps	O
+,	O
+such	O
+as	O
+cavities	B-KEY
+and	O
+channels	B-KEY
+,	O
+opening	O
+the	O
+possibility	O
+of	O
+querying	O
+large	O
+collections	O
+of	O
+maps	O
+on	O
+the	O
+basis	O
+of	O
+these	O
+quantitative	O
+structural	B-KEY
+features	I-KEY
+;	O
+-LRB-	O
+2	O
+-RRB-	O
+it	O
+provides	O
+a	O
+compact	B-KEY
+representation	I-KEY
+in	O
+terms	O
+of	O
+size	O
+;	O
+-LRB-	O
+3	O
+-RRB-	O
+it	O
+contains	O
+a	O
+subset	O
+of	O
+three-dimensional	B-KEY
+points	I-KEY
+that	O
+optimally	O
+quantify	O
+the	O
+densities	O
+of	O
+medium	B-KEY
+resolution	I-KEY
+data	I-KEY
+;	O
+and	O
+-LRB-	O
+4	O
+-RRB-	O
+a	O
+general	B-KEY
+model	I-KEY
+of	O
+the	O
+geometry	O
+and	O
+topology	O
+of	O
+the	O
+macromolecule	O
+-LRB-	O
+as	O
+opposite	O
+to	O
+a	O
+spatially	O
+unrelated	O
+bunch	O
+of	O
+voxels	O
+-RRB-	O
+is	O
+easily	O
+obtained	O
+by	O
+the	O
+use	O
+of	O
+the	O
+alpha	O
+shapes	O
+theory	O
+
+Utilizing	O
+Web-based	B-KEY
+case	I-KEY
+studies	I-KEY
+for	O
+cutting-edge	B-KEY
+information	I-KEY
+services	I-KEY
+issues	O
+This	O
+article	O
+reports	O
+on	O
+a	O
+pilot	O
+study	O
+conducted	O
+by	O
+the	O
+Academic	B-KEY
+Libraries	I-KEY
+of	O
+the	O
+21st	O
+Century	O
+project	O
+team	O
+to	O
+determine	O
+whether	O
+the	O
+benefits	O
+of	O
+the	O
+case	O
+study	O
+method	O
+as	O
+a	O
+training	B-KEY
+framework	O
+for	O
+change	B-KEY
+initiatives	I-KEY
+could	O
+successfully	O
+transfer	O
+from	O
+the	O
+traditional	O
+face-to-face	O
+format	O
+to	O
+a	O
+virtual	O
+format	O
+.	O
+Methods	O
+of	O
+developing	O
+the	O
+training	B-KEY
+framework	O
+,	O
+as	O
+well	O
+as	O
+the	O
+benefits	O
+,	O
+challenges	O
+,	O
+and	O
+recommendations	O
+for	O
+future	O
+strategies	O
+gained	O
+from	O
+participant	O
+feedback	O
+are	O
+outlined	O
+.	O
+The	O
+results	O
+of	O
+a	O
+survey	B-KEY
+administered	O
+to	O
+chat	O
+session	O
+registrants	O
+are	O
+presented	O
+in	O
+three	O
+sections	O
+:	O
+-LRB-	O
+1	O
+-RRB-	O
+evaluation	O
+of	O
+the	O
+training	B-KEY
+framework	O
+;	O
+-LRB-	O
+2	O
+-RRB-	O
+evaluation	O
+of	O
+participants	O
+'	O
+experiences	O
+in	O
+the	O
+virtual	B-KEY
+environment	I-KEY
+;	O
+and	O
+-LRB-	O
+3	O
+-RRB-	O
+a	O
+comparison	O
+of	O
+participants	O
+'	O
+preference	O
+of	O
+format	O
+.	O
+The	O
+overall	O
+participant	O
+feedback	O
+regarding	O
+the	O
+utilization	O
+of	O
+the	O
+case	O
+study	O
+method	O
+in	O
+a	O
+virtual	B-KEY
+environment	I-KEY
+for	O
+professional	B-KEY
+development	I-KEY
+and	O
+collaborative	B-KEY
+problem	I-KEY
+solving	I-KEY
+is	O
+very	O
+positive	O
+
+Waltzing	O
+through	O
+Port	O
+80	O
+-LSB-	O
+Web	O
+security	O
+-RSB-	O
+Web	B-KEY
+services	I-KEY
+follow	O
+the	O
+trusting	B-KEY
+model	O
+of	O
+the	O
+Internet	B-KEY
+,	O
+but	O
+allow	O
+ever	O
+more	O
+powerful	O
+payloads	O
+to	O
+travel	O
+between	O
+businesses	O
+and	O
+consumers	O
+.	O
+Before	O
+you	O
+leap	O
+online	O
+,	O
+the	O
+author	O
+advises	O
+to	O
+scan	O
+the	O
+security	O
+concerns	O
+and	O
+the	O
+available	O
+fixes	O
+.	O
+He	O
+looks	O
+at	O
+how	O
+we	O
+define	O
+and	O
+store	O
+Web	B-KEY
+services	I-KEY
+and	O
+incorporate	O
+them	O
+into	O
+business	B-KEY
+processes	I-KEY
+
+Social	B-KEY
+presence	I-KEY
+in	O
+telemedicine	B-KEY
+We	O
+studied	O
+consultations	O
+between	O
+a	O
+doctor	B-KEY
+,	O
+emergency	B-KEY
+nurse	I-KEY
+practitioners	I-KEY
+-LRB-	O
+ENPs	O
+-RRB-	O
+and	O
+their	O
+patients	B-KEY
+in	O
+a	O
+minor	B-KEY
+accident	I-KEY
+and	I-KEY
+treatment	I-KEY
+service	I-KEY
+-LRB-	O
+MATS	O
+-RRB-	O
+.	O
+In	O
+the	O
+conventional	O
+consultations	O
+,	O
+all	O
+three	O
+people	O
+were	O
+located	O
+at	O
+the	O
+main	O
+hospital	O
+.	O
+In	O
+the	O
+teleconsultations	B-KEY
+,	O
+the	O
+doctor	B-KEY
+was	O
+located	O
+in	O
+a	O
+hospital	O
+6	O
+km	O
+away	O
+from	O
+the	O
+MATS	O
+and	O
+used	O
+a	O
+videoconferencing	B-KEY
+link	I-KEY
+connected	O
+at	O
+384	O
+kbit/s	O
+.	O
+There	O
+were	O
+30	O
+patients	B-KEY
+in	O
+the	O
+conventional	O
+group	O
+and	O
+30	O
+in	O
+the	O
+telemedical	O
+group	O
+.	O
+The	O
+presenting	O
+problems	O
+were	O
+similar	O
+in	O
+the	O
+two	O
+groups	O
+.	O
+The	O
+mean	O
+duration	O
+of	O
+teleconsultations	B-KEY
+was	O
+951	B-KEY
+s	I-KEY
+and	O
+the	O
+mean	O
+duration	O
+of	O
+face-to-face	B-KEY
+consultations	I-KEY
+was	O
+247	B-KEY
+s	I-KEY
+.	O
+In	O
+doctor-nurse	O
+communication	O
+there	O
+was	O
+a	O
+higher	O
+rate	O
+of	O
+turn	O
+taking	O
+in	O
+teleconsultations	O
+than	O
+in	O
+face-to-face	O
+consultations	O
+;	O
+there	O
+were	O
+also	O
+more	O
+interruptions	O
+,	O
+more	O
+words	O
+and	O
+more	O
+`	O
+backchannels	O
+'	O
+-LRB-	O
+e.g.	O
+`	O
+mhm	O
+'	O
+,	O
+`	O
+uh-huh	O
+'	O
+-RRB-	O
+per	O
+teleconsultation	O
+.	O
+In	O
+doctor-patient	O
+communication	O
+there	O
+was	O
+a	O
+higher	O
+rate	O
+of	O
+turn	O
+taking	O
+,	O
+more	O
+words	O
+,	O
+more	O
+interruptions	O
+and	O
+more	O
+backchannels	O
+per	O
+teleconsultation	O
+.	O
+In	O
+patient-nurse	O
+communication	O
+there	O
+was	O
+.	O
+relatively	O
+little	O
+difference	O
+between	O
+the	O
+two	O
+modes	O
+of	O
+consulting	O
+the	O
+doctor	B-KEY
+.	O
+Telemedicine	B-KEY
+appeared	O
+to	O
+empower	O
+the	O
+patient	B-KEY
+to	O
+ask	O
+more	O
+questions	O
+of	O
+the	O
+doctor	B-KEY
+.	O
+It	O
+also	O
+seemed	O
+that	O
+the	O
+doctor	B-KEY
+took	O
+greater	O
+care	O
+in	O
+a	O
+teleconsultation	B-KEY
+to	O
+achieve	O
+coordination	O
+of	O
+beliefs	O
+with	O
+the	O
+patient	B-KEY
+than	O
+in	O
+a	O
+face-to-face	B-KEY
+consultation	I-KEY
+
+Embedded	B-KEY
+Linux	I-KEY
+and	O
+the	O
+law	O
+The	O
+rising	O
+popularity	O
+of	O
+Linux	O
+,	O
+combined	O
+with	O
+perceived	O
+cost	O
+savings	O
+,	O
+has	O
+spurred	O
+many	O
+embedded	O
+developers	O
+to	O
+consider	O
+a	O
+real-time	B-KEY
+Linux	I-KEY
+variant	O
+as	O
+an	O
+alternative	O
+to	O
+a	O
+traditional	O
+RTOS	O
+.	O
+The	O
+paper	O
+presents	O
+the	O
+legal	B-KEY
+implications	I-KEY
+for	O
+the	O
+proprietary	O
+parts	O
+of	O
+firmware	O
+
+Strong	O
+and	O
+weak	O
+points	O
+of	O
+the	O
+MUSCADET	B-KEY
+theorem	O
+prover-examples	O
+from	O
+CASC-JC	B-KEY
+MUSCADET	B-KEY
+is	O
+a	O
+knowledge-based	B-KEY
+theorem	I-KEY
+prover	I-KEY
+based	O
+on	O
+natural	B-KEY
+deduction	I-KEY
+.	O
+It	O
+has	O
+participated	O
+in	O
+CADE	B-KEY
+Automated	I-KEY
+theorem	I-KEY
+proving	I-KEY
+System	I-KEY
+Competitions	I-KEY
+.	O
+The	O
+results	O
+show	O
+its	O
+complementarity	O
+with	O
+regard	O
+to	O
+resolution-based	B-KEY
+provers	I-KEY
+.	O
+This	O
+paper	O
+presents	O
+some	O
+of	O
+its	O
+crucial	O
+methods	O
+and	O
+gives	O
+some	O
+examples	O
+of	O
+MUSCADET	B-KEY
+proofs	O
+from	O
+the	O
+last	O
+competition	O
+-LRB-	O
+CASC-JC	B-KEY
+in	O
+IJCAR	O
+2001	O
+-RRB-	O
+
+Hilbert	B-KEY
+modular	I-KEY
+threefolds	I-KEY
+of	O
+arithmetic	B-KEY
+genus	I-KEY
+one	I-KEY
+D.	O
+Weisser	O
+-LRB-	O
+1981	O
+-RRB-	O
+proved	O
+that	O
+there	O
+are	O
+exactly	O
+four	O
+Galois	B-KEY
+cubic	I-KEY
+number	I-KEY
+fields	I-KEY
+with	O
+Hilbert	B-KEY
+modular	I-KEY
+threefolds	I-KEY
+of	O
+arithmetic	B-KEY
+genus	I-KEY
+one	I-KEY
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+extend	O
+Weisser	O
+'s	O
+work	O
+to	O
+cover	O
+all	O
+cubic	O
+number	O
+fields	O
+.	O
+Our	O
+main	O
+result	O
+is	O
+that	O
+there	O
+are	O
+exactly	O
+33	O
+fields	O
+with	O
+Hilbert	B-KEY
+modular	I-KEY
+threefolds	I-KEY
+of	O
+arithmetic	B-KEY
+genus	I-KEY
+one	I-KEY
+.	O
+These	O
+fields	O
+are	O
+enumerated	O
+explicitly	O
+
+E-commerce-resources	O
+for	O
+doing	O
+business	B-KEY
+on	O
+the	O
+Internet	B-KEY
+There	O
+are	O
+many	O
+different	O
+types	O
+of	O
+e-commerce	B-KEY
+depending	O
+upon	O
+who	O
+or	O
+what	O
+is	O
+selling	O
+and	O
+who	O
+or	O
+what	O
+is	O
+buying	O
+.	O
+In	O
+addition	O
+,	O
+e-commerce	B-KEY
+is	O
+more	O
+than	O
+an	O
+exchange	O
+of	O
+funds	O
+and	O
+goods	O
+or	O
+services	O
+,	O
+it	O
+encompasses	O
+an	O
+entire	O
+infrastructure	O
+of	O
+services	O
+,	O
+computer	O
+hardware	O
+and	O
+software	O
+products	O
+,	O
+technologies	O
+,	O
+and	O
+communications	O
+formats	O
+.	O
+The	O
+paper	O
+discusses	O
+e-commerce	B-KEY
+terminology	B-KEY
+,	O
+types	O
+and	O
+information	B-KEY
+resources	I-KEY
+,	O
+including	O
+books	B-KEY
+and	O
+Web	B-KEY
+sites	I-KEY
+
+Trends	O
+in	O
+agent	B-KEY
+communication	I-KEY
+language	I-KEY
+Agent	B-KEY
+technology	I-KEY
+is	O
+an	O
+exciting	O
+and	O
+important	O
+new	O
+way	O
+to	O
+create	O
+complex	O
+software	O
+systems	O
+.	O
+Agents	O
+blend	O
+many	O
+of	O
+the	O
+traditional	O
+properties	O
+of	O
+AI	B-KEY
+programs	I-KEY
+-	O
+knowledge-level	O
+reasoning	O
+,	O
+flexibility	O
+,	O
+proactiveness	O
+,	O
+goal-directedness	O
+,	O
+and	O
+so	O
+forth	O
+-	O
+with	O
+insights	O
+gained	O
+from	O
+distributed	B-KEY
+software	I-KEY
+engineering	I-KEY
+,	O
+machine	B-KEY
+learning	I-KEY
+,	O
+negotiation	B-KEY
+and	O
+teamwork	B-KEY
+theory	O
+,	O
+and	O
+the	O
+social	B-KEY
+sciences	I-KEY
+.	O
+An	O
+important	O
+part	O
+of	O
+the	O
+agent	O
+approach	O
+is	O
+the	O
+principle	O
+that	O
+agents	O
+-LRB-	O
+like	O
+humans	O
+-RRB-	O
+can	O
+function	O
+more	O
+effectively	O
+in	O
+groups	O
+that	O
+are	O
+characterized	O
+by	O
+cooperation	O
+and	O
+division	O
+of	O
+labor	O
+.	O
+Agent	O
+programs	O
+are	O
+designed	O
+to	O
+autonomously	O
+collaborate	O
+with	O
+each	O
+other	O
+in	O
+order	O
+to	O
+satisfy	O
+both	O
+their	O
+internal	O
+goals	O
+and	O
+the	O
+shared	O
+external	O
+demands	O
+generated	O
+by	O
+virtue	O
+of	O
+their	O
+participation	O
+in	O
+agent	B-KEY
+societies	I-KEY
+.	O
+This	O
+type	O
+of	O
+collaboration	O
+depends	O
+on	O
+a	O
+sophisticated	O
+system	O
+of	O
+inter-agent	B-KEY
+communication	I-KEY
+.	O
+The	O
+assumption	O
+that	O
+inter-agent	B-KEY
+communication	I-KEY
+is	O
+best	O
+handled	O
+through	O
+the	O
+explicit	O
+use	O
+of	O
+an	O
+agent	B-KEY
+communication	I-KEY
+language	I-KEY
+-LRB-	O
+ACL	O
+-RRB-	O
+underlies	O
+each	O
+of	O
+the	O
+articles	O
+in	O
+this	O
+special	O
+issue	O
+.	O
+In	O
+this	O
+introductory	O
+article	O
+,	O
+we	O
+will	O
+supply	O
+a	O
+brief	O
+background	O
+and	O
+introduction	O
+to	O
+the	O
+main	O
+topics	O
+in	O
+agent	O
+communication	O
+
+L/sub	O
+2	O
+/	O
+model	O
+reduction	O
+and	O
+variance	B-KEY
+reduction	I-KEY
+We	O
+examine	O
+certain	O
+variance	O
+properties	O
+of	O
+model	O
+reduction	O
+.	O
+The	O
+focus	O
+is	O
+on	O
+L/sub	O
+2	O
+/	O
+model	O
+reduction	O
+,	O
+but	O
+some	O
+general	O
+results	O
+are	O
+also	O
+presented	O
+.	O
+These	O
+general	O
+results	O
+can	O
+be	O
+used	O
+to	O
+analyze	O
+various	O
+other	O
+model	O
+reduction	O
+schemes	O
+.	O
+The	O
+models	O
+we	O
+study	O
+are	O
+finite	O
+impulse	O
+response	O
+-LRB-	O
+FIR	O
+-RRB-	O
+and	O
+output	O
+error	O
+-LRB-	O
+OE	O
+-RRB-	O
+models	O
+.	O
+We	O
+compare	O
+the	O
+variance	O
+of	O
+two	O
+estimated	O
+models	O
+.	O
+The	O
+first	O
+one	O
+is	O
+estimated	O
+directly	O
+from	O
+data	O
+and	O
+the	O
+other	O
+one	O
+is	O
+computed	O
+by	O
+reducing	O
+a	O
+high	O
+order	O
+model	O
+,	O
+by	O
+L/sub	O
+2	O
+/	O
+model	O
+reduction	O
+.	O
+In	O
+the	O
+FIR	O
+case	O
+we	O
+show	O
+that	O
+it	O
+is	O
+never	O
+better	O
+to	O
+estimate	O
+the	O
+model	O
+directly	O
+from	O
+data	O
+,	O
+compared	O
+to	O
+estimating	O
+it	O
+via	O
+L/sub	O
+2	O
+/	O
+model	O
+reduction	O
+of	O
+a	O
+high	O
+order	O
+FIR	B-KEY
+model	I-KEY
+.	O
+For	O
+OE	O
+models	O
+we	O
+show	O
+that	O
+the	O
+reduced	O
+model	O
+has	O
+the	O
+same	O
+variance	O
+as	O
+the	O
+directly	O
+estimated	O
+one	O
+if	O
+the	O
+reduced	O
+model	O
+class	O
+used	O
+contains	O
+the	O
+true	O
+system	O
+
+Optimization-based	B-KEY
+design	I-KEY
+of	O
+fixed-order	B-KEY
+controllers	I-KEY
+for	O
+command	B-KEY
+following	I-KEY
+For	O
+discrete-time	B-KEY
+scalar	I-KEY
+systems	I-KEY
+,	O
+we	O
+propose	O
+an	O
+approach	O
+for	O
+designing	O
+feedback	B-KEY
+controllers	I-KEY
+of	O
+fixed	O
+order	O
+to	O
+minimize	O
+an	O
+upper	O
+bound	O
+on	O
+the	O
+peak	O
+magnitude	O
+of	O
+the	O
+tracking	B-KEY
+error	I-KEY
+to	O
+a	O
+given	O
+command	O
+input	O
+.	O
+The	O
+work	O
+makes	O
+use	O
+of	O
+linear	B-KEY
+programming	I-KEY
+to	O
+design	O
+over	O
+a	O
+class	O
+of	O
+closed-loop	B-KEY
+systems	I-KEY
+proposed	O
+for	O
+the	O
+rejection	O
+of	O
+non-zero	O
+initial	O
+conditions	O
+and	O
+bounded	O
+disturbances	O
+.	O
+We	O
+incorporate	O
+performance	B-KEY
+robustness	I-KEY
+in	O
+the	O
+form	O
+of	O
+a	O
+guaranteed	B-KEY
+upper	I-KEY
+bound	I-KEY
+on	O
+the	O
+peak	O
+magnitude	O
+of	O
+the	O
+tracking	B-KEY
+error	I-KEY
+under	O
+plant	O
+coprime	B-KEY
+factor	I-KEY
+uncertainty	I-KEY
+
+Extending	O
+CTL	O
+with	O
+actions	B-KEY
+and	O
+real	O
+time	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+present	O
+the	O
+logic	B-KEY
+ATCTL	I-KEY
+,	O
+which	O
+is	O
+intended	O
+to	O
+be	O
+used	O
+for	O
+model	B-KEY
+checking	I-KEY
+models	I-KEY
+that	O
+have	O
+been	O
+specified	O
+in	O
+a	O
+lightweight	O
+version	O
+of	O
+the	O
+Unified	B-KEY
+Modelling	I-KEY
+Language	I-KEY
+-LRB-	O
+UML	O
+-RRB-	O
+.	O
+Elsewhere	O
+,	O
+we	O
+have	O
+defined	O
+a	O
+formal	B-KEY
+semantics	I-KEY
+for	O
+LUML	O
+to	O
+describe	O
+the	O
+models	O
+.	O
+This	O
+paper	O
+'s	O
+goal	O
+is	O
+to	O
+give	O
+a	O
+specification	B-KEY
+language	I-KEY
+for	O
+properties	O
+that	O
+fits	O
+LUML	O
+;	O
+LUML	O
+includes	O
+states	O
+,	O
+actions	B-KEY
+and	O
+real	O
+time	O
+.	O
+ATCTL	O
+extends	O
+CTL	O
+with	O
+concurrent	O
+actions	B-KEY
+and	O
+real	O
+time	O
+.	O
+It	O
+is	O
+based	O
+on	O
+earlier	O
+extensions	O
+of	O
+CTL	O
+by	O
+R.	O
+De	O
+Nicola	O
+and	O
+F.	O
+Vaandrager	O
+-LRB-	O
+ACTL	O
+-RRB-	O
+-LRB-	O
+1990	O
+-RRB-	O
+and	O
+R.	O
+Alur	O
+et	O
+aL	O
+-LRB-	O
+TCTL	O
+-RRB-	O
+-LRB-	O
+1993	O
+-RRB-	O
+.	O
+This	O
+makes	O
+it	O
+easier	O
+to	O
+adapt	O
+existing	O
+model	O
+checkers	O
+to	O
+ATCTL	O
+.	O
+To	O
+show	O
+that	O
+we	O
+can	O
+check	O
+properties	O
+specified	O
+in	O
+ATCTL	O
+in	O
+models	O
+specified	O
+in	O
+LUML	O
+,	O
+we	O
+give	O
+a	O
+small	O
+example	O
+using	O
+the	O
+Kronos	B-KEY
+model	I-KEY
+checker	I-KEY
+
+Generic	O
+simulation	O
+approach	O
+for	O
+multi-axis	O
+machining	O
+.	O
+Part	O
+1	O
+:	O
+modeling	O
+methodology	O
+This	O
+paper	O
+presents	O
+a	O
+new	O
+methodology	O
+for	O
+analytically	O
+simulating	O
+multi-axis	O
+machining	O
+of	O
+complex	B-KEY
+sculptured	I-KEY
+surfaces	I-KEY
+.	O
+A	O
+generalized	O
+approach	O
+is	O
+developed	O
+for	O
+representing	O
+an	O
+arbitrary	O
+cutting	O
+edge	O
+design	O
+,	O
+and	O
+the	O
+local	O
+surface	B-KEY
+topology	I-KEY
+of	O
+a	O
+complex	B-KEY
+sculptured	I-KEY
+surface	I-KEY
+.	O
+A	O
+NURBS	B-KEY
+curve	I-KEY
+is	O
+used	O
+to	O
+represent	O
+the	O
+cutting	B-KEY
+edge	I-KEY
+profile	I-KEY
+.	O
+This	O
+approach	O
+offers	O
+the	O
+advantages	O
+of	O
+representing	O
+any	O
+arbitrary	O
+cutting	O
+edge	O
+design	O
+in	O
+a	O
+generic	O
+way	O
+,	O
+as	O
+well	O
+as	O
+providing	O
+standardized	O
+techniques	O
+for	O
+manipulating	O
+the	O
+location	O
+and	O
+orientation	O
+of	O
+the	O
+cutting	O
+edge	O
+.	O
+The	O
+local	O
+surface	B-KEY
+topology	I-KEY
+of	O
+the	O
+part	O
+is	O
+defined	O
+as	O
+those	O
+surfaces	O
+generated	O
+by	O
+previous	O
+tool	O
+paths	O
+in	O
+the	O
+vicinity	O
+of	O
+the	O
+current	O
+tool	O
+position	O
+.	O
+The	O
+local	O
+surface	B-KEY
+topology	I-KEY
+of	O
+the	O
+part	O
+is	O
+represented	O
+without	O
+using	O
+a	O
+computationally	O
+expensive	O
+CAD	O
+system	O
+.	O
+A	O
+systematic	B-KEY
+prediction	I-KEY
+technique	O
+is	O
+then	O
+developed	O
+to	O
+determine	O
+the	O
+instantaneous	O
+tool/part	O
+interaction	O
+during	O
+machining	O
+.	O
+The	O
+methodology	O
+employed	O
+here	O
+determines	O
+the	O
+cutting	O
+edge	O
+in-cut	O
+segments	O
+by	O
+determining	O
+the	O
+intersection	O
+between	O
+the	O
+NURBS	B-KEY
+curve	I-KEY
+representation	O
+of	O
+the	O
+cutting	O
+edge	O
+and	O
+the	O
+defined	O
+local	O
+surface	B-KEY
+topology	I-KEY
+.	O
+These	O
+in-cut	O
+segments	O
+are	O
+then	O
+utilized	O
+for	O
+predicting	O
+instantaneous	O
+chip	O
+load	O
+,	O
+static	O
+and	O
+dynamic	O
+cutting	O
+forces	O
+,	O
+and	O
+tool	O
+deflection	O
+.	O
+Part	O
+1	O
+of	O
+this	O
+paper	O
+details	O
+the	O
+modeling	O
+methodology	O
+and	O
+demonstrates	O
+the	O
+capabilities	O
+of	O
+the	O
+simulation	O
+for	O
+machining	O
+a	O
+complex	O
+surface	O
+
+A	O
+distance	O
+between	O
+elliptical	B-KEY
+distributions	I-KEY
+based	O
+in	O
+an	O
+embedding	O
+into	O
+the	O
+Siegel	B-KEY
+group	I-KEY
+This	O
+paper	O
+describes	O
+two	O
+different	O
+embeddings	O
+of	O
+the	O
+manifolds	O
+corresponding	O
+to	O
+many	O
+elliptical	B-KEY
+probability	I-KEY
+distributions	I-KEY
+with	O
+the	O
+informative	B-KEY
+geometry	I-KEY
+into	O
+the	O
+manifold	O
+of	O
+positive-definite	B-KEY
+matrices	I-KEY
+with	O
+the	O
+Siegel	O
+metric	O
+,	O
+generalizing	O
+a	O
+result	O
+published	O
+previously	O
+elsewhere	O
+.	O
+These	O
+new	O
+general	O
+embeddings	O
+are	O
+applicable	O
+to	O
+a	O
+wide	O
+class	O
+of	O
+elliptical	B-KEY
+probability	I-KEY
+distributions	I-KEY
+,	O
+in	O
+which	O
+the	O
+normal	O
+,	O
+t-Student	O
+and	O
+Cauchy	O
+are	O
+specific	O
+examples	O
+.	O
+A	O
+lower	B-KEY
+bound	I-KEY
+for	O
+the	O
+Rao	O
+distance	O
+is	O
+obtained	O
+,	O
+which	O
+is	O
+itself	O
+a	O
+distance	O
+,	O
+and	O
+,	O
+through	O
+these	O
+embeddings	O
+,	O
+a	O
+number	O
+of	O
+statistical	O
+tests	O
+of	O
+hypothesis	O
+are	O
+derived	O
+
+Approximation	O
+of	O
+pathwidth	O
+of	O
+outerplanar	B-KEY
+graphs	I-KEY
+There	O
+exists	O
+a	O
+polynomial	B-KEY
+time	I-KEY
+algorithm	I-KEY
+to	O
+compute	O
+the	O
+pathwidth	O
+of	O
+outerplanar	B-KEY
+graphs	I-KEY
+,	O
+but	O
+the	O
+large	O
+exponent	O
+makes	O
+this	O
+algorithm	O
+impractical	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+give	O
+an	O
+algorithm	O
+that	O
+,	O
+given	O
+a	O
+biconnected	B-KEY
+outerplanar	I-KEY
+graph	I-KEY
+G	O
+,	O
+finds	O
+a	O
+path	O
+decomposition	O
+of	O
+G	O
+of	O
+pathwidth	O
+at	O
+most	O
+twice	O
+the	O
+pathwidth	O
+of	O
+G	O
+plus	O
+one	O
+.	O
+To	O
+obtain	O
+the	O
+result	O
+,	O
+several	O
+relations	O
+between	O
+the	O
+pathwidth	O
+of	O
+a	O
+biconnected	B-KEY
+outerplanar	I-KEY
+graph	I-KEY
+and	O
+its	O
+dual	O
+are	O
+established	O
+
+A	O
+work	B-KEY
+journal	I-KEY
+-LSB-	O
+librarianship	O
+-RSB-	O
+Keeping	O
+a	O
+work	B-KEY
+journal	I-KEY
+can	O
+be	O
+useful	O
+in	O
+exploring	O
+one	O
+'s	O
+thoughts	O
+and	O
+feelings	O
+about	O
+work	B-KEY
+challenges	I-KEY
+and	O
+work	B-KEY
+decisions	I-KEY
+.	O
+It	O
+can	O
+help	O
+bring	O
+about	O
+greater	O
+fulfillment	O
+in	O
+one	O
+'s	O
+work	O
+life	O
+by	O
+facilitating	O
+self-renewal	B-KEY
+,	O
+change	B-KEY
+,	O
+the	O
+search	O
+for	O
+new	O
+meaning	O
+,	O
+and	O
+job	B-KEY
+satisfaction	I-KEY
+.	O
+One	O
+example	O
+of	O
+a	O
+work	B-KEY
+journal	I-KEY
+which	O
+I	O
+kept	O
+in	O
+1998	O
+is	O
+considered	O
+.	O
+It	O
+touches	O
+on	O
+several	O
+issues	O
+of	O
+potential	O
+interest	O
+to	O
+midlife	B-KEY
+career	I-KEY
+librarians	I-KEY
+including	O
+the	O
+challenge	O
+of	O
+technology	B-KEY
+,	O
+returning	O
+to	O
+work	O
+at	O
+midlife	O
+after	O
+raising	O
+a	O
+family	O
+,	O
+further	B-KEY
+education	I-KEY
+,	O
+professional	B-KEY
+writing	I-KEY
+,	O
+and	O
+job	B-KEY
+exchange	I-KEY
+
+Recovering	O
+lost	O
+efficiency	O
+of	O
+exponentiation	B-KEY
+algorithms	I-KEY
+on	O
+smart	B-KEY
+cards	I-KEY
+At	O
+the	O
+RSA	B-KEY
+cryptosystem	I-KEY
+implementation	I-KEY
+stage	I-KEY
+,	O
+a	O
+major	O
+security	B-KEY
+concern	O
+is	O
+resistance	O
+against	O
+so-called	O
+side-channel	O
+attacks	O
+.	O
+Solutions	O
+are	O
+known	O
+but	O
+they	O
+increase	O
+the	O
+overall	O
+complexity	O
+by	O
+a	O
+non-negligible	O
+factor	O
+-LRB-	O
+typically	O
+,	O
+a	O
+protected	O
+RSA	O
+exponentiation	O
+is	O
+133	O
+%	O
+slower	O
+-RRB-	O
+.	O
+For	O
+the	O
+first	O
+time	O
+,	O
+protected	O
+solutions	O
+are	O
+proposed	O
+that	O
+do	O
+not	O
+penalise	O
+the	O
+running	O
+time	O
+of	O
+an	O
+exponentiation	O
+
+Explicit	B-KEY
+matrix	I-KEY
+representation	I-KEY
+for	O
+NURBS	B-KEY
+curves	I-KEY
+and	O
+surfaces	O
+The	O
+matrix	O
+forms	O
+for	O
+curves	O
+and	O
+surfaces	O
+were	O
+largely	O
+promoted	O
+in	O
+CAD/CAM	B-KEY
+.	O
+In	O
+this	O
+paper	O
+we	O
+have	O
+presented	O
+two	O
+matrix	B-KEY
+representation	I-KEY
+formulations	I-KEY
+for	O
+arbitrary	O
+degree	O
+NURBS	B-KEY
+curves	I-KEY
+and	O
+surfaces	O
+explicitly	O
+other	O
+than	O
+recursively	O
+.	O
+The	O
+two	O
+approaches	O
+are	O
+derived	O
+from	O
+the	O
+computation	O
+of	O
+divided	B-KEY
+difference	I-KEY
+and	O
+the	O
+Marsden	B-KEY
+identity	I-KEY
+respectively	O
+.	O
+The	O
+explicit	B-KEY
+coefficient	I-KEY
+matrix	I-KEY
+of	O
+B-spline	B-KEY
+with	O
+equally	B-KEY
+spaced	I-KEY
+knot	I-KEY
+and	O
+Bezier	B-KEY
+curves	I-KEY
+and	O
+surfaces	O
+can	O
+be	O
+obtained	O
+by	O
+these	O
+formulae	O
+.	O
+The	O
+coefficient	B-KEY
+formulae	I-KEY
+and	O
+the	O
+coefficient	B-KEY
+matrix	I-KEY
+formulae	I-KEY
+developed	O
+in	O
+this	O
+paper	O
+express	O
+non-uniform	O
+B-spline	B-KEY
+functions	O
+of	O
+arbitrary	O
+degree	O
+in	O
+explicit	O
+polynomial	O
+and	O
+matrix	O
+forms	O
+.	O
+.	O
+They	O
+are	O
+useful	O
+for	O
+the	O
+evaluation	O
+and	O
+the	O
+conversion	O
+of	O
+NURBS	B-KEY
+curves	I-KEY
+and	O
+surfaces	O
+,	O
+in	O
+CAD/CAM	B-KEY
+systems	O
+
+New	B-KEY
+Jersey	I-KEY
+African	I-KEY
+American	I-KEY
+women	I-KEY
+writers	I-KEY
+and	O
+their	O
+publications	O
+:	O
+a	O
+study	O
+of	O
+identification	O
+from	O
+written	O
+and	O
+oral	O
+sources	O
+This	O
+study	O
+examines	O
+the	O
+use	O
+of	O
+written	B-KEY
+sources	I-KEY
+,	O
+and	O
+personal	B-KEY
+interviews	I-KEY
+and	O
+informal	B-KEY
+conversations	I-KEY
+with	O
+individuals	O
+from	O
+New	O
+Jersey	O
+'s	O
+religious	O
+,	O
+political	O
+,	O
+and	O
+educational	O
+community	O
+to	O
+identify	O
+African	O
+American	O
+women	O
+writers	O
+in	O
+New	O
+Jersey	O
+and	O
+their	O
+intellectual	B-KEY
+output	I-KEY
+.	O
+The	O
+focus	O
+on	O
+recognizing	O
+the	O
+community	O
+as	O
+an	O
+oral	B-KEY
+repository	I-KEY
+of	O
+history	B-KEY
+and	O
+then	O
+tapping	O
+these	O
+oral	O
+sources	O
+for	O
+collection	B-KEY
+development	I-KEY
+and	O
+acquisition	O
+purposes	O
+is	O
+supported	O
+by	O
+empirical	O
+and	O
+qualitative	O
+evidence	O
+.	O
+Findings	O
+indicate	O
+that	O
+written	B-KEY
+sources	I-KEY
+are	O
+so	O
+limited	O
+that	O
+information	O
+professionals	O
+must	O
+rely	O
+on	O
+oral	O
+sources	O
+to	O
+uncover	O
+local	B-KEY
+writers	I-KEY
+and	O
+their	O
+publications	O
+
+Positive	O
+productivity	O
+,	O
+better	O
+billing	O
+-LSB-	O
+health	B-KEY
+care	I-KEY
+-RSB-	O
+Workflow	B-KEY
+software	I-KEY
+provides	O
+the	O
+right	O
+communication	O
+solution	O
+for	O
+hospital	O
+specialists	O
+,	O
+and	O
+delivers	O
+an	O
+unexpected	O
+financial	O
+boost	O
+too	O
+
+Airline	B-KEY
+base	I-KEY
+schedule	I-KEY
+optimisation	I-KEY
+by	O
+flight	B-KEY
+network	I-KEY
+annealing	I-KEY
+A	O
+system	O
+for	O
+rigorous	O
+airline	B-KEY
+base	I-KEY
+schedule	I-KEY
+optimisation	I-KEY
+is	O
+described	O
+.	O
+The	O
+architecture	O
+of	O
+the	O
+system	O
+reflects	O
+the	O
+underlying	O
+problem	O
+structure	O
+.	O
+The	O
+architecture	O
+is	O
+hierarchical	O
+consisting	O
+of	O
+a	O
+master	B-KEY
+problem	I-KEY
+for	O
+logical	B-KEY
+aircraft	I-KEY
+schedule	I-KEY
+optimisation	I-KEY
+and	O
+a	O
+sub-problem	O
+for	O
+schedule	B-KEY
+evaluation	I-KEY
+.	O
+The	O
+sub-problem	O
+is	O
+made	O
+up	O
+of	O
+a	O
+number	O
+of	O
+component	O
+sub-problems	O
+including	O
+connection	B-KEY
+generation	I-KEY
+,	O
+passenger	B-KEY
+choice	I-KEY
+modelling	I-KEY
+,	O
+passenger	B-KEY
+traffic	I-KEY
+allocation	I-KEY
+by	O
+simulation	O
+and	O
+revenue	O
+and	O
+cost	B-KEY
+determination	I-KEY
+.	O
+Schedule	O
+optimisation	O
+is	O
+carried	O
+out	O
+by	O
+means	O
+of	O
+simulated	B-KEY
+annealing	I-KEY
+of	O
+flight	O
+networks	O
+.	O
+The	O
+operators	B-KEY
+for	O
+the	O
+simulated	B-KEY
+annealing	I-KEY
+process	O
+are	O
+feasibility	O
+preserving	O
+and	O
+form	O
+a	O
+complete	O
+set	O
+of	O
+operators	B-KEY
+
+Mid-market	B-KEY
+accounting	I-KEY
+systems	I-KEY
+Welcome	O
+to	O
+our	O
+fourth	O
+annual	O
+survey	B-KEY
+of	O
+accounting	O
+systems	O
+and	O
+enterprise	B-KEY
+resource	I-KEY
+planning	I-KEY
+-LRB-	O
+ERP	O
+-RRB-	O
+systems	O
+.	O
+Last	O
+September	O
+,	O
+we	O
+concentrated	O
+on	O
+financial	O
+and	O
+distribution	O
+systems	O
+for	O
+medium-sized	O
+businesses	O
+-LRB-	O
+mid	O
+market	O
+-RRB-	O
+and	O
+included	O
+22	O
+products	O
+in	O
+our	O
+charts	O
+.	O
+This	O
+year	O
+,	O
+we	O
+extended	O
+the	O
+products	O
+to	O
+include	O
+manufacturing	B-KEY
+and	O
+added	O
+34	O
+products	O
+to	O
+the	O
+list	O
+
+An	O
+integrated	B-KEY
+optimization	I-KEY
+model	I-KEY
+for	O
+train	B-KEY
+crew	I-KEY
+management	I-KEY
+Train	B-KEY
+crew	I-KEY
+management	I-KEY
+involves	O
+the	O
+development	O
+of	O
+a	O
+duty	B-KEY
+timetable	I-KEY
+for	O
+each	O
+of	O
+the	O
+drivers	O
+-LRB-	O
+crew	O
+-RRB-	O
+to	O
+cover	O
+a	O
+given	O
+train	O
+timetable	O
+in	O
+a	O
+rail	B-KEY
+transport	I-KEY
+organization	I-KEY
+.	O
+This	O
+duty	B-KEY
+timetable	I-KEY
+is	O
+spread	O
+over	O
+a	O
+certain	O
+period	O
+,	O
+known	O
+as	O
+the	O
+roster	B-KEY
+planning	I-KEY
+horizon	I-KEY
+.	O
+Train	B-KEY
+crew	I-KEY
+management	I-KEY
+may	O
+arise	O
+either	O
+from	O
+the	O
+planning	O
+stage	O
+,	O
+when	O
+the	O
+total	O
+number	O
+of	O
+crew	O
+and	O
+crew	O
+distributions	O
+are	O
+to	O
+be	O
+determined	O
+,	O
+or	O
+from	O
+the	O
+operating	O
+stage	O
+when	O
+the	O
+number	O
+of	O
+crew	O
+at	O
+each	O
+depot	O
+is	O
+known	O
+as	O
+input	O
+data	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+are	O
+interested	O
+in	O
+train	B-KEY
+crew	I-KEY
+management	I-KEY
+in	O
+the	O
+planning	O
+stage	O
+.	O
+In	O
+the	O
+literature	O
+,	O
+train	B-KEY
+crew	I-KEY
+management	I-KEY
+is	O
+decomposed	O
+into	O
+two	O
+stages	O
+:	O
+crew	B-KEY
+scheduling	I-KEY
+and	O
+crew	B-KEY
+rostering	I-KEY
+which	O
+are	O
+solved	O
+sequentially	O
+.	O
+We	O
+propose	O
+an	O
+integrated	B-KEY
+optimization	I-KEY
+model	I-KEY
+to	O
+solve	O
+both	O
+crew	B-KEY
+scheduling	I-KEY
+and	O
+crew	B-KEY
+rostering	I-KEY
+.	O
+The	O
+model	O
+enables	O
+us	O
+to	O
+generate	O
+either	O
+cyclic	B-KEY
+rosters	I-KEY
+or	O
+non-cyclic	O
+rosters	O
+.	O
+Numerical	O
+experiments	O
+are	O
+carried	O
+out	O
+over	O
+data	O
+sets	O
+arising	O
+from	O
+a	O
+practical	O
+application	O
+
+A	O
+comparison	B-KEY
+theorem	I-KEY
+for	O
+the	O
+iterative	B-KEY
+method	I-KEY
+with	O
+the	O
+preconditioner	B-KEY
+-LRB-	O
+I	O
++	O
+S/sub	O
+max	O
+/	O
+-RRB-	O
+A.D.	O
+Gunawardena	O
+et	O
+al.	O
+-LRB-	O
+1991	O
+-RRB-	O
+have	O
+reported	O
+the	O
+modified	O
+Gauss-Seidel	B-KEY
+method	I-KEY
+with	I-KEY
+a	O
+preconditioner	O
+-LRB-	B-KEY
+I	O
++	O
+S	O
+-RRB-	O
+.	O
+In	O
+this	O
+article	O
+,	O
+we	O
+propose	O
+to	O
+use	O
+a	O
+preconditioner	B-KEY
+-LRB-	O
+I	O
++	O
+S/sub	O
+max	O
+/	O
+-RRB-	O
+instead	O
+of	O
+-LRB-	O
+I	O
++	O
+S	O
+-RRB-	O
+.	O
+Here	O
+,	O
+S/sub	O
+max	O
+/	O
+is	O
+constructed	O
+by	O
+only	O
+the	O
+largest	O
+element	O
+at	O
+each	O
+row	O
+of	O
+the	O
+upper	O
+triangular	O
+part	O
+of	O
+A.	O
+By	O
+using	O
+the	O
+lemma	O
+established	O
+by	O
+M.	O
+Neumann	O
+and	O
+R.J.	O
+Plemmons	O
+-LRB-	O
+1987	O
+-RRB-	O
+,	O
+we	O
+get	O
+the	O
+comparison	O
+theorem	B-KEY
+for	I-KEY
+the	O
+proposed	O
+method	O
+.	O
+Simple	O
+numerical	O
+examples	O
+are	O
+also	O
+given	O
+
+Laguerre	B-KEY
+pseudospectral	I-KEY
+method	I-KEY
+for	O
+nonlinear	B-KEY
+partial	I-KEY
+differential	I-KEY
+equations	I-KEY
+The	O
+Laguerre	B-KEY
+Gauss-Radau	I-KEY
+interpolation	I-KEY
+is	O
+investigated	O
+.	O
+Some	O
+approximation	B-KEY
+results	I-KEY
+are	O
+obtained	O
+.	O
+As	O
+an	O
+example	O
+,	O
+the	O
+Laguerre	O
+pseudospectral	O
+scheme	O
+is	O
+constructed	O
+for	O
+the	O
+BBM	B-KEY
+equation	I-KEY
+.	O
+The	O
+stability	B-KEY
+and	O
+the	O
+convergence	O
+of	O
+proposed	O
+scheme	O
+are	O
+proved	O
+.	O
+The	O
+numerical	B-KEY
+results	I-KEY
+show	O
+the	O
+high	O
+accuracy	O
+of	O
+this	O
+approach	O
+
+Blind	B-KEY
+identification	I-KEY
+of	O
+non-stationary	O
+MA	O
+systems	O
+A	O
+new	O
+adaptive	B-KEY
+algorithm	I-KEY
+for	O
+blind	B-KEY
+identification	I-KEY
+of	O
+time-varying	O
+MA	O
+channels	O
+is	O
+derived	O
+.	O
+This	O
+algorithm	O
+proposes	O
+the	O
+use	O
+of	O
+a	O
+novel	O
+system	O
+of	O
+equations	O
+derived	O
+by	O
+combining	O
+the	O
+third	O
+-	O
+and	O
+fourth-order	B-KEY
+statistics	I-KEY
+of	O
+the	O
+output	O
+signals	O
+of	O
+MA	B-KEY
+models	I-KEY
+.	O
+This	O
+overdetermined	O
+system	O
+of	O
+equations	O
+has	O
+the	O
+important	O
+property	O
+that	O
+it	O
+can	O
+be	O
+solved	O
+adaptively	O
+because	O
+of	O
+their	O
+symmetries	O
+via	O
+an	O
+overdetermined	O
+recursive	O
+instrumental	O
+variable-type	O
+algorithm	O
+.	O
+This	O
+algorithm	O
+shows	O
+good	O
+behaviour	O
+in	O
+arbitrary	B-KEY
+noisy	I-KEY
+environments	I-KEY
+and	O
+good	O
+performance	O
+in	O
+tracking	B-KEY
+time-varying	O
+systems	O
+
+On	O
+the	O
+expected	O
+value	O
+of	O
+the	O
+minimum	O
+assignment	O
+The	O
+minimum	B-KEY
+k-assignment	I-KEY
+of	O
+an	O
+m	B-KEY
+*	I-KEY
+n	I-KEY
+matrix	I-KEY
+X	O
+is	O
+the	O
+minimum	O
+sum	O
+of	O
+k	O
+entries	O
+of	O
+X	O
+,	O
+no	O
+two	O
+of	O
+which	O
+belong	O
+to	O
+the	O
+same	O
+row	O
+or	O
+column	O
+.	O
+Coppersmith	O
+and	O
+Sorkin	O
+conjectured	O
+that	O
+if	O
+X	O
+is	O
+generated	O
+by	O
+choosing	O
+each	O
+entry	O
+independently	O
+from	O
+the	O
+exponential	B-KEY
+distribution	I-KEY
+with	O
+mean	O
+1	O
+,	O
+then	O
+the	O
+expected	O
+value	O
+of	O
+its	O
+minimum	B-KEY
+k-assignment	I-KEY
+is	O
+given	O
+by	O
+an	O
+explicit	O
+formula	O
+,	O
+which	O
+has	O
+been	O
+proven	O
+only	O
+in	O
+a	O
+few	O
+cases	O
+.	O
+In	O
+this	O
+paper	O
+we	O
+describe	O
+our	O
+efforts	O
+to	O
+prove	O
+the	O
+Coppersmith-Sorkin	O
+conjecture	O
+by	O
+considering	O
+the	O
+more	O
+general	O
+situation	O
+where	O
+the	O
+entries	O
+x/sub	O
+ij	O
+/	O
+of	O
+X	O
+are	O
+chosen	O
+independently	O
+from	O
+different	O
+distributions	O
+.	O
+In	O
+particular	O
+,	O
+we	O
+require	O
+that	O
+x/sub	O
+ij	O
+/	O
+be	O
+chosen	O
+from	O
+the	O
+exponential	B-KEY
+distribution	I-KEY
+with	O
+mean	O
+1/r/sub	O
+i/c/sub	O
+j	O
+/	O
+.	O
+We	O
+conjecture	O
+an	O
+explicit	O
+formula	O
+for	O
+the	O
+expected	O
+value	O
+of	O
+the	O
+minimum	B-KEY
+k-assignment	I-KEY
+of	O
+such	O
+X	O
+and	O
+give	O
+evidence	O
+for	O
+this	O
+formula	O
+
+Negotiating	O
+the	O
+semantics	O
+of	O
+agent	O
+communication	B-KEY
+languages	I-KEY
+This	O
+article	O
+presents	O
+a	O
+formal	O
+framework	O
+and	O
+outlines	O
+a	O
+method	O
+that	O
+autonomous	B-KEY
+agents	I-KEY
+can	O
+use	O
+to	O
+negotiate	O
+the	O
+semantics	O
+of	O
+their	O
+communication	B-KEY
+language	I-KEY
+at	O
+run-time	O
+.	O
+Such	O
+an	O
+ability	O
+is	O
+needed	O
+in	O
+open	O
+multi-agent	B-KEY
+systems	I-KEY
+so	O
+that	O
+agents	O
+can	O
+ensure	O
+they	O
+understand	O
+the	O
+implications	O
+of	O
+the	O
+utterances	O
+that	O
+are	O
+being	O
+made	O
+and	O
+so	O
+that	O
+they	O
+can	O
+tailor	O
+the	O
+meaning	O
+of	O
+the	O
+primitives	O
+to	O
+best	O
+fit	O
+their	O
+prevailing	O
+circumstances	O
+.	O
+To	O
+this	O
+end	O
+,	O
+the	O
+semantic	B-KEY
+space	I-KEY
+framework	O
+provides	O
+a	O
+systematic	O
+means	O
+of	O
+classifying	O
+the	O
+primitives	O
+along	O
+multiple	O
+relevant	O
+dimensions	O
+.	O
+This	O
+classification	O
+can	O
+then	O
+be	O
+used	O
+by	O
+the	O
+agents	O
+to	O
+structure	O
+their	O
+negotiation	O
+-LRB-	O
+or	O
+semantic	B-KEY
+fixing	I-KEY
+-RRB-	O
+process	O
+so	O
+that	O
+they	O
+converge	O
+to	O
+the	O
+mutually	O
+agreeable	O
+semantics	O
+that	O
+are	O
+necessary	O
+for	O
+coherent	O
+social	B-KEY
+interactions	I-KEY
+
+Wavelet	O
+collocation	O
+methods	O
+for	O
+a	O
+first	O
+kind	O
+boundary	B-KEY
+integral	I-KEY
+equation	I-KEY
+in	O
+acoustic	B-KEY
+scattering	I-KEY
+In	O
+this	O
+paper	O
+we	O
+consider	O
+a	O
+wavelet	B-KEY
+algorithm	I-KEY
+for	O
+the	O
+piecewise	B-KEY
+constant	I-KEY
+collocation	I-KEY
+method	O
+applied	O
+to	O
+the	O
+boundary	B-KEY
+element	I-KEY
+solution	I-KEY
+of	O
+a	O
+first	O
+kind	O
+integral	O
+equation	O
+arising	O
+in	O
+acoustic	B-KEY
+scattering	I-KEY
+.	O
+The	O
+conventional	O
+stiffness	B-KEY
+matrix	I-KEY
+is	O
+transformed	O
+into	O
+the	O
+corresponding	O
+matrix	O
+with	O
+respect	O
+to	O
+wavelet	O
+bases	O
+,	O
+and	O
+it	O
+is	O
+approximated	O
+by	O
+a	O
+compressed	O
+matrix	O
+.	O
+Finally	O
+,	O
+the	O
+stiffness	B-KEY
+matrix	I-KEY
+is	O
+multiplied	O
+by	O
+diagonal	O
+preconditioners	O
+such	O
+that	O
+the	O
+resulting	O
+matrix	O
+of	O
+the	O
+system	O
+of	O
+linear	B-KEY
+equations	I-KEY
+is	O
+well	O
+conditioned	O
+and	O
+sparse	O
+.	O
+Using	O
+this	O
+matrix	O
+,	O
+the	O
+boundary	B-KEY
+integral	I-KEY
+equation	I-KEY
+can	O
+be	O
+solved	O
+effectively	O
+
+Low	O
+to	O
+mid-speed	O
+copiers	O
+-LSB-	O
+buyer	O
+'s	O
+guide	O
+-RSB-	O
+The	O
+low	B-KEY
+to	I-KEY
+mid-speed	I-KEY
+copier	I-KEY
+market	I-KEY
+is	O
+being	O
+transformed	O
+by	O
+the	O
+almost	O
+universal	O
+adoption	O
+of	O
+digital	O
+solutions	O
+.	O
+The	O
+days	O
+of	O
+the	O
+analogue	O
+copier	O
+are	O
+numbered	O
+as	O
+the	O
+remaining	O
+vendors	O
+plan	O
+to	O
+withdraw	O
+from	O
+this	O
+sector	O
+by	O
+2005	O
+.	O
+Reflecting	O
+the	O
+growing	O
+market	O
+for	O
+digital	O
+,	O
+vendors	O
+are	O
+reducing	O
+prices	O
+,	O
+making	O
+a	O
+digital	O
+solution	O
+much	O
+more	O
+affordable	O
+.	O
+The	O
+battle	O
+for	O
+the	O
+copier	O
+market	O
+is	O
+intense	O
+,	O
+and	O
+the	O
+popularity	O
+of	O
+the	O
+multifunctional	O
+device	O
+is	O
+going	O
+to	O
+transform	O
+the	O
+office	O
+equipment	O
+market	O
+.	O
+As	O
+total	B-KEY
+cost	I-KEY
+of	I-KEY
+ownership	I-KEY
+becomes	O
+increasingly	O
+important	O
+and	O
+as	O
+budgets	O
+are	O
+squeezed	O
+,	O
+the	O
+most	O
+cost-effective	O
+solutions	O
+are	O
+those	O
+that	O
+will	O
+survive	O
+this	O
+shake-down	O
+
+Information-processing	O
+and	O
+computing	B-KEY
+systems	I-KEY
+at	O
+thermal	B-KEY
+power	I-KEY
+stations	I-KEY
+in	O
+China	B-KEY
+The	O
+development	B-KEY
+and	O
+commissioning	B-KEY
+of	O
+information-processing	O
+and	O
+computing	B-KEY
+systems	I-KEY
+-LRB-	O
+IPCSs	O
+-RRB-	O
+at	O
+four	O
+power	O
+units	O
+,	O
+each	O
+of	O
+500	B-KEY
+MW	I-KEY
+capacity	O
+at	O
+the	O
+thermal	B-KEY
+power	I-KEY
+stations	I-KEY
+Tszisyan	O
+'	O
+and	O
+Imin	O
+'	O
+in	O
+China	B-KEY
+,	O
+are	O
+considered	O
+.	O
+The	O
+functional	B-KEY
+structure	I-KEY
+and	O
+the	O
+characteristics	O
+of	O
+the	O
+functions	O
+of	O
+the	O
+IPCSs	O
+are	O
+presented	O
+as	O
+is	O
+information	O
+on	O
+the	O
+technology	O
+of	O
+development	B-KEY
+and	O
+experience	O
+in	O
+adjustments	O
+.	O
+Ways	O
+of	O
+using	O
+the	O
+experience	O
+gained	O
+in	O
+creating	O
+a	O
+comprehensive	O
+functional	O
+firmware	B-KEY
+system	I-KEY
+are	O
+shown	O
+
+Closed-loop	B-KEY
+persistent	I-KEY
+identification	I-KEY
+of	O
+linear	O
+systems	O
+with	O
+unmodeled	B-KEY
+dynamics	I-KEY
+and	O
+stochastic	B-KEY
+disturbances	I-KEY
+The	O
+essential	O
+issues	O
+of	O
+time	B-KEY
+complexity	I-KEY
+and	O
+probing	B-KEY
+signal	I-KEY
+selection	I-KEY
+are	O
+studied	O
+for	O
+persistent	O
+identification	O
+of	O
+linear	B-KEY
+time-invariant	I-KEY
+systems	I-KEY
+in	O
+a	O
+closed-loop	O
+setting	O
+.	O
+By	O
+establishing	O
+both	O
+upper	O
+and	O
+lower	B-KEY
+bounds	I-KEY
+on	O
+identification	B-KEY
+accuracy	I-KEY
+as	O
+functions	O
+of	O
+the	O
+length	O
+of	O
+observation	O
+,	O
+size	O
+of	O
+unmodeled	B-KEY
+dynamics	I-KEY
+,	O
+and	O
+stochastic	B-KEY
+disturbances	I-KEY
+,	O
+we	O
+demonstrate	O
+the	O
+inherent	O
+impact	O
+of	O
+unmodeled	B-KEY
+dynamics	I-KEY
+on	O
+identification	B-KEY
+accuracy	I-KEY
+,	O
+reduction	O
+of	O
+time	B-KEY
+complexity	I-KEY
+by	O
+stochastic	O
+averaging	O
+on	O
+disturbances	O
+,	O
+and	O
+probing	O
+capability	O
+of	O
+full	B-KEY
+rank	I-KEY
+periodic	I-KEY
+signals	I-KEY
+for	O
+closed-loop	B-KEY
+persistent	I-KEY
+identification	I-KEY
+.	O
+These	O
+findings	O
+indicate	O
+that	O
+the	O
+mixed	O
+formulation	O
+,	O
+in	O
+which	O
+deterministic	O
+uncertainty	O
+of	O
+system	O
+dynamics	O
+is	O
+blended	O
+with	O
+random	O
+disturbances	O
+,	O
+is	O
+beneficial	O
+to	O
+reduction	O
+of	O
+identification	O
+complexity	O
+
+Portfolio	B-KEY
+optimization	I-KEY
+and	O
+the	O
+random	O
+magnet	B-KEY
+problem	O
+Diversification	O
+of	O
+an	O
+investment	B-KEY
+into	O
+independently	O
+fluctuating	B-KEY
+assets	I-KEY
+reduces	O
+its	O
+risk	O
+.	O
+In	O
+reality	O
+,	O
+movements	O
+of	O
+assets	O
+are	O
+mutually	O
+correlated	O
+and	O
+therefore	O
+knowledge	O
+of	O
+cross-correlations	B-KEY
+among	O
+asset	O
+price	B-KEY
+movements	I-KEY
+are	O
+of	O
+great	O
+importance	O
+.	O
+Our	O
+results	O
+support	O
+the	O
+possibility	O
+that	O
+the	O
+problem	O
+of	O
+finding	O
+an	O
+investment	B-KEY
+in	O
+stocks	B-KEY
+which	O
+exposes	O
+invested	B-KEY
+funds	O
+to	O
+a	O
+minimum	O
+level	O
+of	O
+risk	O
+is	O
+analogous	O
+to	O
+the	O
+problem	O
+of	O
+finding	O
+the	O
+magnetization	O
+of	O
+a	O
+random	O
+magnet	O
+.	O
+The	O
+interactions	O
+for	O
+this	O
+``	O
+random	O
+magnet	B-KEY
+problem	O
+''	O
+are	O
+given	O
+by	O
+the	O
+cross-correlation	O
+matrix	O
+C	O
+of	O
+stock	O
+returns	O
+.	O
+We	O
+find	O
+that	O
+random	O
+matrix	O
+theory	O
+allows	O
+us	O
+to	O
+make	O
+an	O
+estimate	O
+for	O
+C	O
+which	O
+outperforms	O
+the	O
+standard	O
+estimate	O
+in	O
+terms	O
+of	O
+constructing	O
+an	O
+investment	B-KEY
+which	O
+carries	O
+a	O
+minimum	O
+level	O
+of	O
+risk	O
+
+A	O
+solvable	B-KEY
+queueing	I-KEY
+network	I-KEY
+model	I-KEY
+for	O
+railway	B-KEY
+networks	I-KEY
+and	O
+its	O
+validation	O
+and	O
+applications	O
+for	O
+the	O
+Netherlands	B-KEY
+The	O
+performance	O
+of	O
+new	O
+railway	B-KEY
+networks	I-KEY
+can	O
+not	O
+be	O
+measured	O
+or	O
+simulated	O
+,	O
+as	O
+no	O
+detailed	O
+train	O
+schedules	O
+are	O
+available	O
+.	O
+Railway	B-KEY
+infrastructure	I-KEY
+and	O
+capacities	O
+are	O
+to	O
+be	O
+determined	O
+long	O
+before	O
+the	O
+actual	O
+traffic	O
+is	O
+known	O
+.	O
+This	O
+paper	O
+therefore	O
+proposes	O
+a	O
+solvable	B-KEY
+queueing	I-KEY
+network	I-KEY
+model	I-KEY
+to	O
+compute	O
+performance	B-KEY
+measures	I-KEY
+of	O
+interest	O
+without	O
+requiring	O
+train	O
+schedules	O
+-LRB-	O
+timetables	O
+-RRB-	O
+.	O
+Closed	B-KEY
+form	I-KEY
+expressions	I-KEY
+for	O
+mean	B-KEY
+delays	I-KEY
+are	O
+obtained	O
+.	O
+New	O
+network	B-KEY
+designs	I-KEY
+,	O
+traffic	B-KEY
+scenarios	I-KEY
+,	O
+and	O
+capacity	B-KEY
+expansions	I-KEY
+can	O
+so	O
+be	O
+evaluated	O
+.	O
+A	O
+comparison	O
+with	O
+real	O
+delay	O
+data	O
+for	O
+the	O
+Netherlands	B-KEY
+supports	O
+the	O
+practical	O
+value	O
+of	O
+the	O
+model	O
+.	O
+A	O
+special	O
+Dutch	B-KEY
+cargo-line	I-KEY
+application	I-KEY
+is	O
+included	O
+
+A	O
+sufficient	O
+condition	O
+for	O
+optimality	O
+in	O
+nondifferentiable	O
+invex	B-KEY
+programming	O
+A	O
+sufficient	B-KEY
+optimality	I-KEY
+condition	I-KEY
+is	O
+established	O
+for	O
+a	O
+nonlinear	B-KEY
+programming	I-KEY
+problem	I-KEY
+without	O
+differentiability	O
+assumption	O
+on	O
+the	O
+data	O
+wherein	O
+Clarke	O
+'s	O
+-LRB-	O
+1975	O
+-RRB-	O
+generalized	B-KEY
+gradient	I-KEY
+is	O
+used	O
+to	O
+define	O
+invexity	B-KEY
+
+Observer-based	O
+strict	O
+positive	O
+real	O
+-LRB-	O
+SPR	O
+-RRB-	O
+feedback	O
+control	B-KEY
+system	I-KEY
+design	I-KEY
+Presents	O
+theory	O
+for	O
+stability	B-KEY
+analysis	I-KEY
+and	O
+design	O
+for	O
+a	O
+class	O
+of	O
+observer-based	O
+feedback	O
+control	O
+systems	O
+.	O
+Relaxation	O
+of	O
+the	O
+controllability	O
+and	O
+observability	O
+conditions	O
+imposed	O
+in	O
+the	O
+Yakubovich-Kalman-Popov	B-KEY
+lemma	I-KEY
+can	O
+be	O
+made	O
+for	O
+a	O
+class	O
+of	O
+nonlinear	B-KEY
+systems	I-KEY
+described	O
+by	O
+a	O
+linear	B-KEY
+time-invariant	I-KEY
+system	I-KEY
+with	O
+a	O
+feedback-connected	O
+cone-bounded	B-KEY
+nonlinear	I-KEY
+element	O
+.	O
+It	O
+is	O
+shown	O
+how	O
+a	O
+circle-criterion	B-KEY
+approach	I-KEY
+can	O
+be	O
+used	O
+to	O
+design	O
+an	O
+observer-based	O
+state	B-KEY
+feedback	I-KEY
+control	I-KEY
+which	O
+yields	O
+a	O
+closed-loop	B-KEY
+system	I-KEY
+with	O
+specified	O
+robustness	B-KEY
+characteristics	I-KEY
+.	O
+The	O
+approach	O
+is	O
+relevant	O
+for	O
+design	O
+with	O
+preservation	O
+of	O
+stability	O
+when	O
+a	O
+cone-bounded	B-KEY
+nonlinearity	I-KEY
+is	O
+introduced	O
+in	O
+the	O
+feedback	O
+loop	O
+.	O
+Important	O
+applications	O
+are	O
+to	O
+be	O
+found	O
+in	O
+nonlinear	O
+control	O
+with	O
+high	O
+robustness	O
+requirements	O
+
+A	O
+heuristic	B-KEY
+approach	O
+to	O
+resource	B-KEY
+locations	I-KEY
+in	O
+broadband	B-KEY
+networks	I-KEY
+In	O
+broadband	B-KEY
+networks	I-KEY
+,	O
+such	O
+as	O
+ATM	B-KEY
+,	O
+the	O
+importance	O
+of	O
+dynamic	O
+migration	O
+of	O
+data	O
+resources	O
+is	O
+increasing	O
+because	O
+of	O
+its	O
+potential	O
+to	O
+improve	O
+performance	O
+especially	O
+for	O
+transaction	O
+processing	O
+.	O
+In	O
+environments	O
+with	O
+migratory	O
+data	O
+resources	O
+,	O
+it	O
+is	O
+necessary	O
+to	O
+have	O
+mechanisms	O
+to	O
+manage	O
+the	O
+locations	O
+of	O
+each	O
+data	O
+resource	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+present	O
+an	O
+algorithm	O
+that	O
+makes	O
+use	O
+of	O
+system	O
+state	O
+information	O
+and	O
+heuristics	B-KEY
+to	O
+manage	O
+locations	O
+of	O
+data	O
+resources	O
+in	O
+a	O
+distributed	B-KEY
+network	I-KEY
+.	O
+In	O
+the	O
+proposed	O
+algorithm	O
+,	O
+each	O
+site	O
+maintains	O
+information	O
+about	O
+state	O
+of	O
+other	O
+sites	O
+with	O
+respect	O
+to	O
+each	O
+data	O
+resource	O
+of	O
+the	O
+system	O
+and	O
+uses	O
+it	O
+to	O
+find	O
+:	O
+-LRB-	O
+1	O
+-RRB-	O
+a	O
+subset	O
+of	O
+sites	O
+likely	O
+to	O
+have	O
+the	O
+requested	O
+data	O
+resource	O
+;	O
+and	O
+-LRB-	O
+2	O
+-RRB-	O
+the	O
+site	O
+where	O
+the	O
+data	O
+resource	O
+is	O
+to	O
+be	O
+migrated	O
+from	O
+the	O
+current	O
+site	O
+.	O
+The	O
+proposed	O
+algorithm	O
+enhances	O
+its	O
+effectiveness	O
+by	O
+continuously	O
+updating	O
+system	O
+state	O
+information	O
+stored	O
+at	O
+each	O
+site	O
+.	O
+It	O
+focuses	O
+on	O
+reducing	O
+the	O
+overall	O
+average	O
+time	O
+delay	O
+needed	O
+by	O
+the	O
+transaction	O
+requests	O
+to	O
+locate	O
+and	O
+access	O
+the	O
+migratory	O
+data	O
+resources	O
+.	O
+We	O
+evaluated	O
+the	O
+performance	O
+of	O
+the	O
+proposed	O
+algorithm	O
+and	O
+also	O
+compared	O
+it	O
+with	O
+one	O
+of	O
+the	O
+existing	O
+location	O
+management	O
+algorithms	O
+,	O
+by	O
+simulation	O
+studies	O
+under	O
+several	O
+system	O
+parameters	O
+such	O
+as	O
+the	O
+frequency	O
+of	O
+requests	O
+generation	O
+,	O
+frequency	O
+of	O
+data	B-KEY
+resource	I-KEY
+migrations	I-KEY
+,	O
+network	B-KEY
+topology	I-KEY
+and	O
+scale	O
+of	O
+network	O
+.	O
+The	O
+experimental	O
+results	O
+show	O
+the	O
+effectiveness	O
+of	O
+the	O
+proposed	O
+algorithm	O
+in	O
+all	O
+cases	O
+
+A	O
+systematic	O
+review	O
+of	O
+the	O
+efficacy	O
+of	O
+telemedicine	B-KEY
+for	O
+making	O
+diagnostic	O
+and	O
+management	O
+decisions	O
+We	O
+conducted	O
+a	O
+systematic	O
+review	O
+of	O
+the	O
+literature	O
+to	O
+evaluate	O
+the	O
+efficacy	O
+of	O
+telemedicine	B-KEY
+for	O
+making	O
+diagnostic	O
+and	O
+management	O
+decisions	O
+in	O
+three	O
+classes	O
+of	O
+application	O
+:	O
+office/hospital-based	O
+,	O
+store-and-forward	O
+,	O
+and	O
+home-based	O
+telemedicine	B-KEY
+.	O
+We	O
+searched	O
+the	O
+MEDLINE	B-KEY
+,	O
+EMBASE	B-KEY
+,	O
+CINAHL	B-KEY
+and	O
+HealthSTAR	B-KEY
+databases	O
+and	O
+printed	O
+resources	O
+,	O
+and	O
+interviewed	O
+investigators	O
+in	O
+the	O
+field	O
+.	O
+We	O
+excluded	O
+studies	O
+where	O
+the	O
+service	O
+did	O
+not	O
+historically	O
+require	O
+face-to-face	O
+encounters	O
+-LRB-	O
+e.g.	O
+radiology	O
+or	O
+pathology	O
+diagnosis	O
+-RRB-	O
+.	O
+A	O
+total	O
+of	O
+58	O
+articles	O
+met	O
+the	O
+inclusion	O
+criteria	O
+.	O
+The	O
+articles	O
+were	O
+summarized	O
+and	O
+graded	O
+for	O
+the	O
+quality	O
+and	O
+direction	O
+of	O
+the	O
+evidence	O
+.	O
+There	O
+were	O
+very	O
+few	O
+high-quality	O
+studies	O
+.	O
+The	O
+strongest	O
+evidence	O
+for	O
+the	O
+efficacy	O
+of	O
+telemedicine	B-KEY
+for	O
+diagnostic	O
+and	O
+management	O
+decisions	O
+came	O
+from	O
+the	O
+specialties	O
+of	O
+psychiatry	B-KEY
+and	O
+dermatology	B-KEY
+.	O
+There	O
+was	O
+also	O
+reasonable	O
+evidence	O
+that	O
+general	O
+medical	O
+history	O
+and	O
+physical	O
+examinations	O
+performed	O
+via	O
+telemedicine	B-KEY
+had	O
+relatively	O
+good	O
+sensitivity	O
+and	O
+specificity	O
+.	O
+Other	O
+specialties	O
+in	O
+which	O
+some	O
+evidence	O
+for	O
+efficacy	O
+existed	O
+were	O
+cardiology	B-KEY
+and	O
+certain	O
+areas	O
+of	O
+ophthalmology	B-KEY
+.	O
+Despite	O
+the	O
+widespread	O
+use	O
+of	O
+telemedicine	B-KEY
+in	O
+most	O
+major	O
+medical	O
+specialties	O
+,	O
+there	O
+is	O
+strong	O
+evidence	O
+in	O
+only	O
+a	O
+few	O
+of	O
+them	O
+that	O
+the	O
+diagnostic	O
+and	O
+management	O
+decisions	O
+provided	O
+by	O
+telemedicine	B-KEY
+are	O
+comparable	O
+to	O
+face-to-face	O
+care	O
+
+Data	B-KEY
+mining	I-KEY
+business	B-KEY
+intelligence	I-KEY
+for	O
+competitive	B-KEY
+advantage	I-KEY
+Organizations	B-KEY
+have	O
+lately	O
+realized	O
+that	O
+just	O
+processing	O
+transactions	O
+and/or	O
+information	O
+faster	O
+and	O
+more	O
+efficiently	O
+no	O
+longer	O
+provides	O
+them	O
+with	O
+a	O
+competitive	B-KEY
+advantage	I-KEY
+vis-a-vis	O
+their	O
+competitors	O
+for	O
+achieving	O
+business	O
+excellence	O
+.	O
+Information	B-KEY
+technology	I-KEY
+-LRB-	O
+IT	O
+-RRB-	O
+tools	O
+that	O
+are	O
+oriented	O
+towards	O
+knowledge	B-KEY
+processing	I-KEY
+can	O
+provide	O
+the	O
+edge	O
+that	O
+organizations	B-KEY
+need	O
+to	O
+survive	O
+and	O
+thrive	O
+in	O
+the	O
+current	O
+era	O
+of	O
+fierce	O
+competition	O
+.	O
+Enterprises	O
+are	O
+no	O
+longer	O
+satisfied	O
+with	O
+business	B-KEY
+information	I-KEY
+system	I-KEY
+-LRB-	O
+s	O
+-RRB-	O
+;	O
+they	O
+require	O
+business	B-KEY
+intelligence	I-KEY
+system	O
+-LRB-	O
+s	O
+-RRB-	O
+.	O
+The	O
+increasing	O
+competitive	O
+pressures	O
+and	O
+the	O
+desire	O
+to	O
+leverage	O
+information	B-KEY
+technology	I-KEY
+techniques	O
+have	O
+led	O
+many	O
+organizations	B-KEY
+to	O
+explore	O
+the	O
+benefits	O
+of	O
+new	O
+emerging	O
+technology	O
+,	O
+data	O
+warehousing	O
+and	O
+data	B-KEY
+mining	I-KEY
+.	O
+The	O
+paper	O
+discusses	O
+data	B-KEY
+warehouses	I-KEY
+and	O
+data	B-KEY
+mining	I-KEY
+tools	O
+and	O
+applications	O
+
+Coordination	O
+-LSB-	O
+crisis	B-KEY
+management	I-KEY
+-RSB-	O
+Communications	O
+during	O
+a	O
+crisis	O
+,	O
+both	O
+internal	O
+and	O
+external	O
+,	O
+set	O
+the	O
+tone	O
+during	O
+response	O
+and	O
+carry	O
+a	O
+message	O
+through	O
+recovery	O
+.	O
+The	O
+authors	O
+describe	O
+how	O
+to	O
+set	O
+up	O
+a	O
+system	O
+for	O
+information	B-KEY
+coordination	I-KEY
+to	O
+make	O
+sure	O
+the	O
+right	O
+people	O
+get	O
+the	O
+right	O
+message	O
+,	O
+and	O
+the	O
+organization	O
+stays	O
+in	O
+control	O
+
+The	O
+limits	O
+of	O
+shape	B-KEY
+constancy	I-KEY
+:	O
+point-to-point	B-KEY
+mapping	I-KEY
+of	O
+perspective	O
+projections	O
+of	O
+flat	O
+figures	O
+The	O
+present	O
+experiments	B-KEY
+investigate	O
+point-to-point	B-KEY
+mapping	I-KEY
+of	O
+perspective	O
+transformations	O
+of	O
+2D	B-KEY
+outline	I-KEY
+figures	I-KEY
+under	O
+diverse	B-KEY
+viewing	I-KEY
+conditions	I-KEY
+:	O
+binocular	B-KEY
+free	I-KEY
+viewing	I-KEY
+,	O
+monocular	B-KEY
+perspective	I-KEY
+with	O
+2D	B-KEY
+cues	I-KEY
+masked	O
+by	O
+an	O
+optic	B-KEY
+tunnel	I-KEY
+,	O
+and	O
+stereoptic	B-KEY
+viewing	I-KEY
+through	O
+an	O
+optic	B-KEY
+tunnel	I-KEY
+.	O
+The	O
+first	O
+experiment	B-KEY
+involved	O
+upright	O
+figures	O
+,	O
+and	O
+served	O
+to	O
+determine	O
+baseline	O
+point-to-point	B-KEY
+mapping	I-KEY
+accuracy	O
+,	O
+which	O
+was	O
+found	O
+to	O
+be	O
+very	O
+good	O
+.	O
+Three	O
+shapes	O
+were	O
+used	O
+:	O
+square	O
+,	O
+circle	O
+and	O
+irregularly	O
+round	O
+.	O
+The	O
+main	O
+experiment	B-KEY
+,	O
+with	O
+slanted	O
+figures	O
+,	O
+involved	O
+only	O
+two	O
+shapes-square	O
+and	O
+irregularly	O
+shaped-showed	O
+at	O
+several	O
+slant	O
+degrees	O
+.	O
+Despite	O
+the	O
+accumulated	O
+evidence	O
+for	O
+shape	B-KEY
+constancy	I-KEY
+when	O
+the	O
+outline	O
+of	O
+perspective	O
+projections	O
+is	O
+considered	O
+,	O
+metric	O
+perception	O
+of	O
+the	O
+inner	O
+structure	O
+of	O
+such	O
+projections	O
+was	O
+quite	O
+limited	O
+.	O
+Systematic	O
+distortions	O
+were	O
+found	O
+,	O
+especially	O
+with	O
+more	O
+extreme	O
+slants	O
+,	O
+and	O
+attributed	O
+to	O
+the	O
+joint	O
+effect	O
+of	O
+several	O
+factors	O
+:	O
+anchors	B-KEY
+,	O
+3D	B-KEY
+information	I-KEY
+,	O
+and	O
+slant	B-KEY
+underestimation	I-KEY
+.	O
+Contradictory	O
+flatness	O
+cues	O
+did	O
+not	O
+detract	O
+from	O
+performance	O
+,	O
+while	O
+stereoptic	O
+information	O
+improved	O
+it	O
+
+Statistical	O
+analysis	O
+of	O
+nonlinearly	B-KEY
+reconstructed	I-KEY
+near-infrared	I-KEY
+tomographic	I-KEY
+images	I-KEY
+.	O
+II	O
+.	O
+Experimental	O
+interpretation	O
+For	O
+pt	O
+.	O
+I	O
+see	O
+ibid.	O
+,	O
+vol	O
+.	O
+21	O
+,	O
+no.	O
+7	O
+,	O
+p.	O
+755-63	O
+-LRB-	O
+2002	O
+-RRB-	O
+.	O
+Image	B-KEY
+error	I-KEY
+analysis	O
+of	O
+a	O
+diffuse	O
+near-infrared	O
+tomography	O
+-LRB-	O
+NIR	O
+-RRB-	O
+system	O
+has	O
+been	O
+carried	O
+out	O
+on	O
+simulated	O
+data	O
+using	O
+a	O
+statistical	O
+approach	O
+described	O
+in	O
+pt	O
+.	O
+I	O
+of	O
+this	O
+paper	O
+-LRB-	O
+Pogue	O
+et	O
+al.	O
+,	O
+2002	O
+-RRB-	O
+.	O
+The	O
+methodology	O
+is	O
+used	O
+here	O
+with	O
+experimental	O
+data	O
+acquired	O
+on	O
+phantoms	O
+with	O
+a	O
+prototype	O
+imaging	O
+system	O
+intended	O
+for	O
+characterizing	O
+breast	O
+tissue	O
+.	O
+Results	O
+show	O
+that	O
+imaging	O
+performance	O
+is	O
+not	O
+limited	O
+by	O
+random	B-KEY
+measurement	I-KEY
+error	I-KEY
+,	O
+but	O
+rather	O
+by	O
+calibration	O
+issues	O
+.	O
+The	O
+image	B-KEY
+error	I-KEY
+over	O
+the	O
+entire	O
+field	O
+of	O
+view	O
+is	O
+generally	O
+not	O
+minimized	O
+when	O
+an	O
+accurate	B-KEY
+homogeneous	I-KEY
+estimate	I-KEY
+of	O
+the	O
+phantom	B-KEY
+properties	I-KEY
+is	O
+available	O
+;	O
+however	O
+,	O
+local	O
+image	B-KEY
+error	I-KEY
+over	O
+a	O
+target	B-KEY
+region	I-KEY
+of	I-KEY
+interest	I-KEY
+-LRB-	O
+ROI	O
+-RRB-	O
+is	O
+reduced	O
+.	O
+The	O
+image	O
+reconstruction	O
+process	O
+which	O
+includes	O
+a	O
+Levenberg-Marquardt	B-KEY
+style	I-KEY
+regularization	I-KEY
+provides	O
+good	O
+minimization	O
+of	O
+the	O
+objective	O
+function	O
+,	O
+yet	O
+its	O
+reduction	O
+is	O
+not	O
+always	O
+correlated	O
+with	O
+an	O
+overall	O
+image	B-KEY
+error	I-KEY
+decrease	O
+.	O
+Minimization	O
+of	O
+the	O
+bias	O
+in	O
+an	O
+ROI	O
+which	O
+contains	O
+localized	O
+changes	O
+in	O
+the	O
+optical	O
+properties	O
+can	O
+be	O
+achieved	O
+through	O
+five	O
+to	O
+nine	O
+iterations	O
+of	O
+the	O
+algorithm	O
+.	O
+Precalibration	O
+of	O
+the	O
+algorithm	O
+through	O
+statistical	O
+evaluation	O
+of	O
+phantom	O
+studies	O
+may	O
+provide	O
+a	O
+better	O
+measure	O
+of	O
+the	O
+image	O
+accuracy	O
+than	O
+that	O
+implied	O
+by	O
+minimization	O
+of	O
+the	O
+standard	O
+objective	O
+function	O
+
+Conceptual	B-KEY
+modeling	I-KEY
+and	O
+specification	B-KEY
+generation	I-KEY
+for	O
+B2B	B-KEY
+business	I-KEY
+processes	I-KEY
+based	O
+on	O
+ebXML	B-KEY
+In	O
+order	O
+to	O
+support	O
+dynamic	O
+setup	O
+of	O
+business	O
+processes	O
+among	O
+independent	O
+organizations	O
+,	O
+a	O
+formal	B-KEY
+standard	I-KEY
+schema	I-KEY
+for	O
+describing	O
+the	O
+business	O
+processes	O
+is	O
+basically	O
+required	O
+.	O
+The	O
+ebXML	B-KEY
+framework	O
+provides	O
+such	O
+a	O
+specification	O
+schema	O
+called	O
+BPSS	O
+-LRB-	O
+Business	B-KEY
+Process	I-KEY
+Specification	I-KEY
+Schema	I-KEY
+-RRB-	O
+which	O
+is	O
+available	O
+in	O
+two	O
+standalone	O
+representations	O
+:	O
+a	O
+UML	O
+version	O
+,	O
+and	O
+an	O
+XML	O
+version	O
+.	O
+The	O
+former	O
+,	O
+however	O
+,	O
+is	O
+not	O
+intended	O
+for	O
+the	O
+direct	O
+creation	O
+of	O
+business	O
+process	O
+specifications	O
+,	O
+but	O
+for	O
+defining	O
+specification	O
+elements	O
+and	O
+their	O
+relationships	O
+required	O
+for	O
+creating	O
+an	O
+ebXML-compliant	O
+business	O
+process	O
+specification	O
+.	O
+For	O
+this	O
+reason	O
+,	O
+it	O
+is	O
+very	O
+important	O
+to	O
+support	O
+conceptual	B-KEY
+modeling	I-KEY
+that	O
+is	O
+well	O
+organized	O
+and	O
+directly	O
+matched	O
+with	O
+major	O
+modeling	O
+concepts	O
+.	O
+This	O
+paper	O
+deals	O
+with	O
+how	O
+to	O
+represent	O
+and	O
+manage	O
+B2B	B-KEY
+business	I-KEY
+processes	I-KEY
+using	O
+UML-compliant	B-KEY
+diagrams	I-KEY
+.	O
+The	O
+major	O
+challenge	O
+is	O
+to	O
+organize	O
+UML	O
+diagrams	O
+in	O
+a	O
+natural	O
+way	O
+that	O
+is	O
+well	O
+suited	O
+to	O
+the	O
+business	O
+process	O
+meta-model	O
+and	O
+then	O
+to	O
+transform	O
+the	O
+diagrams	O
+into	O
+an	O
+XML	O
+version	O
+.	O
+This	O
+paper	O
+demonstrates	O
+the	O
+usefulness	O
+of	O
+conceptually	B-KEY
+modeling	I-KEY
+business	O
+processes	O
+by	O
+prototyping	O
+a	O
+business	B-KEY
+process	I-KEY
+editor	I-KEY
+tool	O
+called	O
+ebDesigner	B-KEY
+
+Education	B-KEY
+,	O
+training	B-KEY
+and	O
+development	B-KEY
+policies	I-KEY
+and	O
+practices	O
+in	O
+medium-sized	O
+companies	O
+in	O
+the	O
+UK	O
+:	O
+do	O
+they	O
+really	O
+influence	O
+firm	B-KEY
+performance	I-KEY
+?	O
+This	O
+paper	O
+sets	O
+out	O
+to	O
+examine	O
+the	O
+relationship	O
+between	O
+training	B-KEY
+and	O
+firm	B-KEY
+performance	I-KEY
+in	O
+middle-sized	O
+UK	O
+companies	O
+.	O
+It	O
+recognises	O
+that	O
+there	O
+is	O
+evidence	O
+that	O
+``	O
+high	B-KEY
+performance	I-KEY
+work	I-KEY
+practices	I-KEY
+''	O
+appear	O
+to	O
+be	O
+associated	O
+with	O
+better	O
+performance	O
+in	O
+large	O
+US	O
+companies	O
+,	O
+but	O
+argues	O
+that	O
+this	O
+relationship	O
+is	O
+less	O
+likely	O
+to	O
+be	O
+present	O
+in	O
+middle-sized	O
+companies	O
+.	O
+The	O
+paper	O
+'s	O
+key	O
+contribution	O
+is	O
+to	O
+justify	O
+the	O
+wider	O
+concept	O
+of	O
+education	B-KEY
+,	O
+training	B-KEY
+and	O
+development	O
+-LRB-	O
+ETD	O
+-RRB-	O
+as	O
+applicable	O
+to	O
+such	O
+companies	O
+.	O
+It	O
+then	O
+finds	O
+that	O
+clusters	O
+of	O
+some	O
+ETD	O
+variables	O
+do	O
+appear	O
+to	O
+be	O
+associated	O
+with	O
+better	O
+middle-sized	O
+company	O
+performance	O
+
+Universal	B-KEY
+parametrization	I-KEY
+in	O
+constructing	O
+smoothly-connected	O
+B-spline	O
+surfaces	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+explore	O
+the	O
+feasibility	O
+of	O
+universal	B-KEY
+parametrization	I-KEY
+in	O
+generating	O
+B-spline	O
+surfaces	O
+,	O
+which	O
+was	O
+proposed	O
+recently	O
+in	O
+the	O
+literature	O
+-LRB-	O
+Lim	O
+,	O
+1999	O
+-RRB-	O
+.	O
+We	O
+present	O
+an	O
+interesting	O
+property	O
+of	O
+the	O
+new	O
+parametrization	O
+that	O
+it	O
+guarantees	O
+Go	O
+continuity	O
+on	O
+B-spline	O
+surfaces	O
+when	O
+several	O
+independently	O
+constructed	O
+patches	B-KEY
+are	O
+put	O
+together	O
+without	O
+imposing	O
+any	O
+constraints	O
+.	O
+Also	O
+,	O
+a	O
+simple	O
+blending	O
+method	O
+of	O
+patchwork	O
+is	O
+proposed	O
+to	O
+construct	O
+C/sup	O
+n-1	O
+/	O
+surfaces	O
+,	O
+where	O
+overlapping	B-KEY
+control	I-KEY
+nets	I-KEY
+are	O
+utilized	O
+.	O
+It	O
+takes	O
+into	O
+account	O
+the	O
+semi-localness	B-KEY
+property	I-KEY
+of	O
+universal	B-KEY
+parametrization	I-KEY
+.	O
+It	O
+effectively	O
+helps	O
+us	O
+construct	O
+very	O
+natural	O
+looking	O
+B-spline	O
+surfaces	O
+while	O
+keeping	O
+the	O
+deviation	O
+from	O
+given	O
+data	O
+points	O
+very	O
+low	O
+.	O
+Experimental	O
+results	O
+are	O
+shown	O
+with	O
+several	O
+sets	O
+of	O
+surface	B-KEY
+data	I-KEY
+points	I-KEY
+
+Engineering	O
+plug-in	B-KEY
+software	I-KEY
+components	I-KEY
+to	O
+support	O
+collaborative	O
+work	O
+Many	O
+software	B-KEY
+applications	I-KEY
+require	O
+co-operative	B-KEY
+work	I-KEY
+support	I-KEY
+,	O
+including	O
+collaborative	B-KEY
+editing	I-KEY
+,	O
+group	B-KEY
+awareness	I-KEY
+,	O
+versioning	B-KEY
+,	O
+messaging	B-KEY
+and	O
+automated	B-KEY
+notification	I-KEY
+and	O
+co-ordination	O
+agents	O
+.	O
+Most	O
+approaches	O
+hard-code	O
+such	O
+facilities	O
+into	O
+applications	O
+,	O
+with	O
+fixed	O
+functionality	O
+and	O
+limited	O
+ability	O
+to	O
+reuse	O
+groupware	B-KEY
+implementations	O
+.	O
+We	O
+describe	O
+our	O
+recent	O
+work	O
+in	O
+seamlessly	O
+adding	O
+such	O
+capabilities	O
+to	O
+component-based	O
+applications	O
+via	O
+a	O
+set	O
+of	O
+collaborative	O
+work-supporting	O
+plug-in	B-KEY
+software	I-KEY
+components	I-KEY
+.	O
+We	O
+describe	O
+a	O
+variety	O
+of	O
+applications	O
+of	O
+this	O
+technique	O
+,	O
+along	O
+with	O
+descriptions	O
+of	O
+the	O
+novel	O
+architecture	O
+,	O
+user	O
+interface	O
+adaptation	O
+and	O
+implementation	O
+techniques	O
+for	O
+the	O
+collaborative	O
+work-supporting	O
+components	O
+that	O
+we	O
+have	O
+developed	O
+.	O
+We	O
+report	O
+on	O
+our	O
+experiences	O
+to	O
+date	O
+with	O
+this	O
+method	O
+of	O
+supporting	O
+collaborative	O
+work	O
+enhancement	O
+of	O
+component-based	O
+systems	O
+,	O
+and	O
+discuss	O
+the	O
+advantages	O
+of	O
+our	O
+approach	O
+over	O
+conventional	O
+techniques	O
+
+HeLIN	B-KEY
+pilot	I-KEY
+mentoring	I-KEY
+scheme	I-KEY
+The	O
+health	B-KEY
+care	I-KEY
+libraries	I-KEY
+unit	I-KEY
+coordinates	O
+,	O
+facilitates	O
+,	O
+and	O
+promotes	O
+continuing	B-KEY
+personal	I-KEY
+development	I-KEY
+for	O
+all	O
+staff	B-KEY
+in	O
+the	O
+Health	B-KEY
+Libraries	I-KEY
+and	I-KEY
+Information	I-KEY
+Network	I-KEY
+-LRB-	O
+HeLIN	O
+-RRB-	O
+of	O
+the	O
+Oxford	O
+Deanery	O
+-LRB-	O
+UK	O
+-RRB-	O
+.	O
+It	O
+supports	O
+the	O
+development	O
+of	O
+a	O
+culture	O
+of	O
+lifelong	B-KEY
+learning	I-KEY
+and	O
+recognizes	O
+that	O
+CPD	O
+should	O
+help	O
+deliver	O
+organizational	O
+objectives	O
+,	O
+as	O
+well	O
+as	O
+enabling	O
+all	O
+staff	B-KEY
+to	O
+expand	O
+and	O
+fulfill	O
+their	O
+potential	O
+.	O
+A	O
+major	O
+emphasis	O
+for	O
+2000	O
+was	O
+to	O
+investigate	O
+ways	O
+of	O
+improving	O
+support	O
+for	O
+individual	O
+learning	O
+within	O
+the	O
+workplace	O
+.	O
+The	O
+group	O
+identified	O
+a	O
+need	O
+to	O
+build	O
+on	O
+existing	O
+informal	B-KEY
+support	I-KEY
+networks	I-KEY
+in	O
+order	O
+to	O
+provide	O
+additional	O
+learning	O
+opportunities	O
+and	O
+decided	O
+to	O
+investigate	O
+the	O
+feasibility	O
+of	O
+piloting	O
+a	O
+mentoring	O
+scheme	O
+.	O
+The	O
+objectives	O
+of	O
+the	O
+pilot	O
+were	O
+to	O
+increase	O
+understanding	O
+and	O
+knowledge	O
+of	O
+mentoring	O
+as	O
+a	O
+tool	O
+for	O
+CPD	O
+;	O
+to	O
+investigate	O
+existing	O
+mentoring	O
+schemes	O
+and	O
+their	O
+applicability	O
+for	O
+HeLIN	O
+;	O
+to	O
+develop	O
+a	O
+pilot	O
+mentoring	O
+scheme	O
+for	O
+HeLIN	O
+incorporating	O
+a	O
+program	O
+for	O
+accreditation	B-KEY
+of	O
+mentors	O
+;	O
+and	O
+to	O
+evaluate	O
+the	O
+scheme	O
+and	O
+disseminate	O
+the	O
+results	O
+.	O
+In	O
+order	O
+to	O
+identify	O
+current	O
+practice	O
+in	O
+this	O
+area	O
+,	O
+a	O
+literature	B-KEY
+review	I-KEY
+was	O
+carried	O
+out	O
+,	O
+and	O
+colleagues	O
+with	O
+an	O
+interest	O
+in	O
+or	O
+existing	O
+knowledge	O
+of	O
+mentoring	O
+schemes	O
+were	O
+contacted	O
+where	O
+possible	O
+.	O
+In	O
+the	O
+absence	O
+of	O
+clearly	O
+defined	O
+appraisal	O
+tools	O
+,	O
+all	O
+abstracts	O
+were	O
+read	O
+,	O
+and	O
+articles	O
+that	O
+met	O
+the	O
+following	O
+criteria	O
+were	O
+obtained	O
+and	O
+distributed	O
+to	O
+the	O
+group	O
+for	O
+review	O
+
+Use	O
+of	O
+periodic	O
+and	O
+monotonic	B-KEY
+activation	I-KEY
+functions	I-KEY
+in	O
+multilayer	B-KEY
+feedforward	I-KEY
+neural	I-KEY
+networks	I-KEY
+trained	O
+by	O
+extended	B-KEY
+Kalman	I-KEY
+filter	I-KEY
+algorithm	I-KEY
+The	O
+authors	O
+investigate	O
+the	O
+convergence	B-KEY
+and	O
+pruning	B-KEY
+performance	I-KEY
+of	O
+multilayer	B-KEY
+feedforward	I-KEY
+neural	I-KEY
+networks	I-KEY
+with	O
+different	O
+types	O
+of	O
+neuronal	B-KEY
+activation	I-KEY
+functions	I-KEY
+in	O
+solving	O
+various	O
+problems	O
+.	O
+Three	O
+types	O
+of	O
+activation	O
+functions	O
+are	O
+adopted	O
+in	O
+the	O
+network	O
+,	O
+namely	O
+,	O
+the	O
+traditional	O
+sigmoid	B-KEY
+function	I-KEY
+,	O
+the	O
+sinusoidal	B-KEY
+function	I-KEY
+and	O
+a	O
+periodic	O
+function	O
+that	O
+can	O
+be	O
+considered	O
+as	O
+a	O
+combination	O
+of	O
+the	O
+first	O
+two	O
+functions	O
+.	O
+To	O
+speed	O
+up	O
+the	O
+learning	O
+,	O
+as	O
+well	O
+as	O
+to	O
+reduce	O
+the	O
+network	O
+size	O
+,	O
+the	O
+extended	O
+Kalman	O
+filter	O
+-LRB-	O
+EKF	O
+-RRB-	O
+algorithm	O
+conjunct	O
+with	O
+a	O
+pruning	O
+method	O
+is	O
+used	O
+to	O
+train	O
+the	O
+network	O
+.	O
+The	O
+corresponding	O
+networks	O
+are	O
+applied	O
+to	O
+solve	O
+five	O
+typical	O
+problems	O
+,	O
+namely	O
+,	O
+4-point	B-KEY
+XOR	I-KEY
+logic	I-KEY
+function	I-KEY
+,	O
+parity	B-KEY
+generation	I-KEY
+,	O
+handwritten	B-KEY
+digit	I-KEY
+recognition	I-KEY
+,	O
+piecewise	B-KEY
+linear	I-KEY
+function	I-KEY
+approximation	I-KEY
+and	O
+sunspot	B-KEY
+series	I-KEY
+prediction	I-KEY
+.	O
+Simulation	O
+results	O
+show	O
+that	O
+periodic	B-KEY
+activation	I-KEY
+functions	I-KEY
+perform	O
+better	O
+than	O
+monotonic	O
+ones	O
+in	O
+solving	O
+multicluster	B-KEY
+classification	I-KEY
+problems	I-KEY
+.	O
+Moreover	O
+,	O
+the	O
+combined	O
+periodic	B-KEY
+activation	I-KEY
+function	I-KEY
+is	O
+found	O
+to	O
+possess	O
+the	O
+fast	O
+convergence	B-KEY
+and	O
+multicluster	O
+classification	O
+capabilities	O
+of	O
+the	O
+sinusoidal	O
+activation	O
+function	O
+while	O
+keeping	O
+the	O
+robustness	O
+property	O
+of	O
+the	O
+sigmoid	B-KEY
+function	I-KEY
+required	O
+in	O
+the	O
+modelling	O
+of	O
+unknown	O
+systems	O
+
+RISCy	O
+business	O
+.	O
+Part	O
+1	O
+:	O
+RISC	B-KEY
+projects	I-KEY
+by	O
+Cornell	B-KEY
+students	I-KEY
+The	O
+author	O
+looks	O
+at	O
+several	O
+projects	O
+that	O
+Cornell	O
+University	O
+students	O
+entered	O
+in	O
+the	O
+Atmel	O
+Design	O
+2001	O
+contest	O
+.	O
+Those	O
+covered	O
+include	O
+a	O
+vertical	B-KEY
+plotter	I-KEY
+;	O
+BiLines	B-KEY
+,	O
+an	O
+electronic	B-KEY
+game	I-KEY
+;	O
+a	O
+wireless	B-KEY
+Internet	I-KEY
+pager	I-KEY
+;	O
+Cooking	B-KEY
+Coach	I-KEY
+;	O
+Barbie	O
+'s	O
+zip	O
+drive	O
+;	O
+and	O
+a	O
+model	B-KEY
+train	I-KEY
+controller	I-KEY
+
+Input-output	B-KEY
+based	I-KEY
+pole-placement	I-KEY
+controller	I-KEY
+for	O
+a	O
+class	O
+of	O
+time-delay	B-KEY
+systems	I-KEY
+A	O
+controller	O
+structure	O
+valid	O
+for	O
+SISO	B-KEY
+plants	I-KEY
+involving	O
+both	O
+internal	O
+and	B-KEY
+external	I-KEY
+point	I-KEY
+delays	I-KEY
+is	O
+presented	O
+.	O
+The	O
+control	O
+signal	O
+is	O
+based	O
+only	O
+on	O
+the	O
+input	O
+and	O
+output	O
+plant	O
+signals	O
+.	O
+The	O
+controller	O
+allows	O
+finite	O
+or	O
+infinite	B-KEY
+spectrum	I-KEY
+assignment	I-KEY
+.	O
+The	O
+most	O
+important	O
+feature	O
+of	O
+the	O
+proposed	O
+controller	O
+is	O
+that	O
+it	O
+only	O
+involves	O
+the	O
+use	O
+of	O
+a	O
+class	O
+of	O
+point-delayed	B-KEY
+signals	I-KEY
+.	O
+Thus	O
+the	O
+controller	B-KEY
+synthesis	I-KEY
+involves	O
+less	O
+computational	B-KEY
+cost	I-KEY
+than	O
+former	O
+methods	O
+.	O
+Since	O
+the	O
+plant	O
+control	O
+input	O
+is	O
+generated	O
+by	O
+filtering	B-KEY
+the	O
+input	O
+and	O
+output	O
+plant	O
+signals	O
+,	O
+this	O
+controller	O
+structure	O
+is	O
+potentially	O
+applicable	O
+to	O
+the	O
+adaptive	O
+case	O
+of	O
+unknown	O
+plant	O
+parameters	O
+
+Use	O
+of	O
+web	O
+technologies	O
+in	O
+construction	O
+project	O
+management	O
+:	O
+what	O
+are	O
+the	O
+critical	O
+success/failure	O
+factors	O
+?	O
+A	O
+concept	O
+of	O
+how	O
+the	O
+World	O
+Wide	O
+Web	O
+-LRB-	O
+WWW	O
+-RRB-	O
+and	O
+its	O
+associated	O
+technologies	O
+can	O
+be	O
+used	O
+to	O
+manage	O
+construction	O
+projects	O
+has	O
+been	O
+recognized	O
+by	O
+practitioners	O
+in	O
+the	O
+construction	B-KEY
+industry	I-KEY
+for	O
+quite	O
+sometime	O
+.	O
+This	O
+concept	O
+is	O
+often	O
+referred	O
+to	O
+as	O
+a	O
+Web-Based	B-KEY
+Project	I-KEY
+Management	I-KEY
+System	I-KEY
+-LRB-	O
+WPMS	O
+-RRB-	O
+.	O
+It	O
+promises	O
+,	O
+to	O
+enhance	O
+construction	O
+project	B-KEY
+documentation	I-KEY
+and	O
+control	O
+,	O
+and	O
+to	O
+revolutionize	O
+the	O
+way	O
+construction	O
+project	O
+teams	O
+process	O
+and	O
+transmit	O
+project	O
+information	O
+.	O
+WPMS	O
+is	O
+an	O
+electronic	O
+project-management	O
+system	O
+conducted	O
+through	O
+the	O
+Internet	O
+.	O
+The	O
+system	O
+provides	O
+a	O
+centralized	O
+,	O
+commonly	O
+accessible	O
+,	O
+reliable	O
+means	O
+of	O
+transmitting	O
+and	O
+storing	O
+project	O
+information	O
+.	O
+Project	O
+information	O
+is	O
+stored	O
+on	O
+the	O
+server	O
+and	O
+a	O
+standard	O
+Web	B-KEY
+browser	I-KEY
+is	O
+used	O
+as	O
+the	O
+gateway	O
+to	O
+exchange	O
+this	O
+information	O
+,	O
+eliminating	O
+geographic	O
+and	O
+hardware	O
+platforms	O
+boundary	O
+
+Fast	O
+and	O
+efficient	O
+algorithm	O
+for	O
+the	O
+multiplierless	B-KEY
+realisation	I-KEY
+of	O
+linear	B-KEY
+DSP	I-KEY
+transforms	I-KEY
+A	O
+fast	O
+algorithm	O
+having	O
+a	O
+pseudopolynomial	B-KEY
+run-time	I-KEY
+and	O
+memory	B-KEY
+requirement	I-KEY
+in	O
+the	O
+worst	O
+case	O
+is	O
+developed	O
+to	O
+generate	O
+multiplierless	O
+architectures	O
+at	O
+all	O
+wordlengths	B-KEY
+for	O
+constant	B-KEY
+multiplications	I-KEY
+in	O
+linear	B-KEY
+DSP	I-KEY
+transforms	I-KEY
+.	O
+It	O
+is	O
+also	O
+re-emphasised	O
+that	O
+indefinitely	O
+reducing	O
+operators	O
+for	O
+multiplierless	O
+architectures	O
+is	O
+not	O
+sufficient	O
+to	O
+reduce	O
+the	O
+final	B-KEY
+chip	I-KEY
+area	I-KEY
+.	O
+For	O
+a	O
+major	O
+reduction	O
+,	O
+techniques	O
+like	O
+resource	B-KEY
+folding	I-KEY
+must	O
+be	O
+used	O
+.	O
+Simple	O
+techniques	O
+for	O
+improving	O
+the	O
+results	O
+are	O
+also	O
+presented	O
+
+A	O
+note	O
+on	O
+multi-index	B-KEY
+polynomials	I-KEY
+of	O
+Dickson	O
+type	O
+and	O
+their	O
+applications	O
+in	O
+quantum	B-KEY
+optics	I-KEY
+We	O
+discuss	O
+the	O
+properties	O
+of	O
+a	O
+new	O
+family	O
+of	O
+multi-index	O
+Lucas	B-KEY
+type	I-KEY
+polynomials	I-KEY
+,	O
+which	O
+are	O
+often	O
+encountered	O
+in	O
+problems	O
+of	O
+intracavity	B-KEY
+photon	I-KEY
+statistics	I-KEY
+.	O
+We	O
+develop	O
+an	O
+approach	O
+based	O
+on	O
+the	O
+integral	B-KEY
+representation	I-KEY
+method	O
+and	O
+show	O
+that	O
+this	O
+class	O
+of	O
+polynomials	O
+can	O
+be	O
+derived	O
+from	O
+recently	O
+introduced	O
+multi-index	O
+Hermite	O
+like	O
+polynomials	O
+
+Application	O
+of	O
+normal	B-KEY
+possibility	I-KEY
+decision	I-KEY
+rule	I-KEY
+to	O
+silence	B-KEY
+The	O
+paper	O
+presents	O
+the	O
+way	O
+of	O
+combining	O
+two	O
+decision	B-KEY
+problems	I-KEY
+concerning	O
+a	O
+single	O
+-LRB-	O
+or	O
+a	O
+common	O
+-RRB-	O
+dimension	O
+,	O
+so	O
+that	O
+an	O
+effective	O
+fuzzy	O
+decision	O
+rule	O
+can	O
+be	O
+obtained	O
+.	O
+Normality	O
+of	O
+the	O
+possibility	O
+distribution	O
+is	O
+assumed	O
+,	O
+leading	O
+to	O
+possibility	O
+of	O
+fusing	O
+the	O
+respective	O
+functions	O
+related	O
+to	O
+the	O
+two	O
+decision	B-KEY
+problems	I-KEY
+and	O
+their	O
+characteristics	O
+-LRB-	O
+decisions	O
+,	O
+states	O
+of	O
+nature	O
+,	O
+utility	O
+functions	O
+,	O
+etc.	O
+-RRB-	O
+.	O
+The	O
+approach	O
+proposed	O
+can	O
+be	O
+applied	O
+in	O
+cases	O
+when	O
+the	O
+statement	O
+of	O
+the	O
+problem	O
+requires	O
+making	O
+of	O
+more	O
+refined	O
+distinctions	O
+rather	O
+than	O
+considering	O
+simply	O
+a	O
+bi-criterion	O
+or	O
+bi-utility	O
+two-decision	O
+problem	O
+
+Healthy	O
+,	O
+wealthy	O
+and	O
+wise	O
+?	O
+-LSB-	O
+health	O
+sector	O
+document	B-KEY
+management	I-KEY
+-RSB-	O
+NHS	B-KEY
+spending	I-KEY
+will	O
+rise	O
+from	O
+Pounds	O
+65.4	O
+bn	O
+in	O
+2002	O
+to	O
+Pounds	O
+87.2	O
+bn	O
+in	O
+2006	O
+,	O
+and	O
+by	O
+2008	O
+,	O
+spending	O
+will	O
+total	O
+Pounds	O
+105.6	O
+bn	O
+.	O
+David	O
+Tyler	O
+looks	O
+at	O
+how	O
+the	O
+health	O
+sector	O
+is	O
+already	O
+beginning	O
+to	O
+exploit	O
+IT	B-KEY
+,	O
+and	O
+particularly	O
+document	B-KEY
+management	I-KEY
+,	O
+to	O
+improve	O
+service	O
+and	O
+cut	O
+costs	O
+
+Mining	O
+open	O
+answers	O
+in	O
+questionnaire	B-KEY
+data	I-KEY
+Surveys	O
+are	O
+important	O
+tools	O
+for	O
+marketing	O
+and	O
+for	O
+managing	O
+customer	O
+relationships	O
+;	O
+the	O
+answers	O
+to	O
+open-ended	O
+questions	O
+,	O
+in	O
+particular	O
+,	O
+often	O
+contain	O
+valuable	O
+information	O
+and	O
+provide	O
+an	O
+important	O
+basis	O
+for	O
+business	O
+decisions	O
+.	O
+The	O
+summaries	O
+that	O
+human	O
+analysts	O
+make	O
+of	O
+these	O
+open	O
+answers	O
+,	O
+however	O
+,	O
+tend	O
+to	O
+rely	O
+too	O
+much	O
+on	O
+intuition	O
+and	O
+so	O
+are	O
+n't	O
+satisfactorily	O
+reliable	O
+.	O
+Moreover	O
+,	O
+because	O
+the	O
+Web	O
+makes	O
+it	O
+so	O
+easy	O
+to	O
+take	O
+surveys	O
+and	O
+solicit	O
+comments	O
+,	O
+companies	O
+are	O
+finding	O
+themselves	O
+inundated	O
+with	O
+data	O
+from	O
+questionnaires	O
+and	O
+other	O
+sources	O
+.	O
+Handling	O
+it	O
+all	O
+manually	O
+would	O
+be	O
+not	O
+only	O
+cumbersome	O
+but	O
+also	O
+costly	O
+.	O
+Thus	O
+,	O
+devising	O
+a	O
+computer	O
+system	O
+that	O
+can	O
+automatically	O
+mine	O
+useful	O
+information	O
+from	O
+open	O
+answers	O
+has	O
+become	O
+an	O
+important	O
+issue	O
+.	O
+We	O
+have	O
+developed	O
+a	O
+survey	B-KEY
+analysis	I-KEY
+system	O
+that	O
+works	O
+on	O
+these	O
+principles	O
+.	O
+The	O
+system	O
+mines	O
+open	O
+answers	O
+through	O
+two	O
+statistical	B-KEY
+learning	I-KEY
+techniques	I-KEY
+:	O
+rule	O
+learning	O
+-LRB-	O
+which	O
+we	O
+call	O
+rule	B-KEY
+analysis	I-KEY
+-RRB-	O
+and	O
+correspondence	B-KEY
+analysis	I-KEY
+
+Business	B-KEY
+school	I-KEY
+research	O
+:	O
+bridging	O
+the	O
+gap	O
+between	O
+producers	B-KEY
+and	O
+consumers	B-KEY
+There	O
+has	O
+been	O
+a	O
+great	O
+deal	O
+of	O
+continuing	O
+discussion	O
+concerning	O
+the	O
+seemingly	O
+unbridgeable	O
+gap	O
+between	O
+so	O
+much	O
+of	O
+the	O
+research	O
+produced	B-KEY
+by	O
+business	B-KEY
+school	I-KEY
+professors	B-KEY
+and	O
+the	O
+needs	O
+of	O
+the	O
+business	B-KEY
+people	I-KEY
+who	O
+,	O
+ideally	O
+,	O
+would	O
+use	O
+it	O
+.	O
+Here	O
+,	O
+we	O
+examine	O
+this	O
+gap	O
+and	O
+suggest	O
+a	O
+model	O
+for	O
+bridging	O
+it	O
+.	O
+We	O
+sample	O
+four	O
+groups	O
+of	O
+people	O
+,	O
+business	B-KEY
+school	I-KEY
+academics	B-KEY
+-LRB-	O
+professors	B-KEY
+-RRB-	O
+,	O
+deans	B-KEY
+of	O
+business	B-KEY
+schools	I-KEY
+,	O
+executive	O
+MBA	O
+students/recent	O
+graduates	O
+,	O
+and	O
+senior	B-KEY
+business	I-KEY
+executives	I-KEY
+.	O
+Each	O
+group	O
+rates	O
+44	O
+different	O
+-LRB-	O
+potential	O
+-RRB-	O
+properties	O
+of	O
+exemplary	B-KEY
+research	I-KEY
+.	O
+We	O
+analyze	O
+within-group	B-KEY
+differences	I-KEY
+,	O
+and	O
+more	O
+meaningfully	O
+,	O
+between-group	B-KEY
+differences	I-KEY
+.	O
+We	O
+then	O
+offer	O
+commentary	O
+on	O
+the	O
+results	O
+and	O
+use	O
+the	O
+results	O
+to	O
+develop	O
+the	O
+aforementioned	O
+suggestions	O
+for	O
+bridging	O
+the	O
+gap	O
+we	O
+find	O
+
+Supporting	O
+global	B-KEY
+user	I-KEY
+profiles	I-KEY
+through	O
+trusted	B-KEY
+authorities	I-KEY
+Personalization	B-KEY
+generally	O
+refers	O
+to	O
+making	O
+a	O
+Web	B-KEY
+site	I-KEY
+more	O
+responsive	O
+to	O
+the	O
+unique	O
+and	O
+individual	O
+needs	O
+of	O
+each	O
+user	O
+.	O
+We	O
+argue	O
+that	O
+for	O
+personalization	B-KEY
+to	O
+work	O
+effectively	O
+,	O
+detailed	O
+and	O
+interoperable	O
+user	O
+profiles	O
+should	O
+be	O
+globally	O
+available	O
+for	O
+authorized	O
+sites	O
+,	O
+and	O
+these	O
+profiles	O
+should	O
+dynamically	O
+reflect	O
+changes	O
+in	O
+user	O
+interests	O
+.	O
+Creating	O
+user	O
+profiles	O
+from	O
+user	O
+click-stream	O
+data	O
+seems	O
+to	O
+be	O
+an	O
+effective	O
+way	O
+of	O
+generating	O
+detailed	O
+and	O
+dynamic	O
+user	O
+profiles	O
+.	O
+However	O
+,	O
+a	O
+user	O
+profile	O
+generated	O
+in	O
+this	O
+way	O
+is	O
+available	O
+only	O
+on	O
+the	O
+computer	O
+where	O
+the	O
+user	O
+accesses	O
+his	O
+browser	O
+,	O
+and	O
+is	O
+inaccessible	O
+when	O
+the	O
+same	O
+user	O
+works	O
+on	O
+a	O
+different	O
+computer	O
+.	O
+On	O
+the	O
+other	O
+hand	O
+,	O
+integration	O
+of	O
+the	O
+Internet	B-KEY
+with	O
+telecommunication	B-KEY
+networks	I-KEY
+has	O
+made	O
+it	O
+possible	O
+for	O
+the	O
+users	O
+to	O
+connect	O
+to	O
+the	O
+Web	O
+with	O
+a	O
+variety	O
+of	O
+mobile	B-KEY
+devices	I-KEY
+as	O
+well	O
+as	O
+desktops	O
+.	O
+This	O
+requires	O
+that	O
+user	O
+profiles	O
+should	O
+be	O
+available	O
+to	O
+any	O
+desktop	O
+or	O
+mobile	B-KEY
+device	I-KEY
+on	O
+the	O
+Internet	B-KEY
+that	O
+users	O
+choose	O
+to	O
+work	O
+with	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+we	O
+address	O
+these	O
+problems	O
+through	O
+the	O
+concept	O
+of	O
+``	O
+trusted	B-KEY
+authority	I-KEY
+''	O
+.	O
+A	O
+user	B-KEY
+agent	I-KEY
+at	O
+the	O
+client	O
+side	O
+that	O
+captures	O
+the	O
+user	B-KEY
+click	I-KEY
+stream	I-KEY
+,	O
+dynamically	O
+generates	O
+a	O
+navigational	O
+history	O
+`	O
+log	O
+'	O
+file	O
+in	O
+Extensible	O
+Markup	O
+Language	O
+-LRB-	O
+XML	B-KEY
+-RRB-	O
+.	O
+This	O
+log	O
+file	O
+is	O
+then	O
+used	O
+to	O
+produce	O
+`	O
+user	O
+profiles	O
+'	O
+in	O
+a	O
+resource	B-KEY
+description	I-KEY
+framework	I-KEY
+-LRB-	O
+RDF	O
+-RRB-	O
+.	O
+A	O
+user	O
+'s	O
+right	O
+to	O
+privacy	B-KEY
+is	O
+provided	O
+through	O
+the	O
+Platform	O
+for	O
+Privacy	B-KEY
+Preferences	O
+-LRB-	O
+P3P	O
+-RRB-	O
+standard	O
+.	O
+User	O
+profiles	O
+are	O
+uploaded	O
+to	O
+the	O
+trusted	B-KEY
+authority	I-KEY
+and	O
+served	O
+next	O
+time	O
+the	O
+user	O
+connects	O
+to	O
+the	O
+Web	O
+
+Vacuum-compatible	O
+vibration	B-KEY
+isolation	I-KEY
+stack	I-KEY
+for	O
+an	O
+interferometric	B-KEY
+gravitational	I-KEY
+wave	I-KEY
+detector	I-KEY
+TAMA300	O
+Interferometric	B-KEY
+gravitational	I-KEY
+wave	I-KEY
+detectors	I-KEY
+require	O
+a	O
+large	O
+degree	O
+of	O
+vibration	O
+isolation	O
+.	O
+For	O
+this	O
+purpose	O
+,	O
+a	O
+multilayer	B-KEY
+stack	I-KEY
+constructed	O
+of	O
+rubber	O
+and	O
+metal	B-KEY
+blocks	I-KEY
+is	O
+suitable	O
+,	O
+because	O
+it	O
+provides	O
+isolation	O
+in	O
+all	O
+degrees	O
+of	O
+freedom	O
+at	O
+once	O
+.	O
+In	O
+TAMA300	O
+,	O
+a	O
+300	B-KEY
+m	I-KEY
+interferometer	O
+in	O
+Japan	O
+,	O
+long-term	B-KEY
+dimensional	I-KEY
+stability	I-KEY
+and	O
+compatibility	O
+with	O
+an	O
+ultrahigh	B-KEY
+vacuum	I-KEY
+environment	I-KEY
+of	O
+about	O
+10/sup	O
+-6	O
+/	O
+Pa	O
+are	O
+also	O
+required	O
+.	O
+To	O
+keep	O
+the	O
+interferometer	O
+at	O
+its	O
+operating	B-KEY
+point	I-KEY
+despite	O
+ground	B-KEY
+strain	I-KEY
+and	O
+thermal	B-KEY
+drift	I-KEY
+of	O
+the	O
+isolation	O
+system	O
+,	O
+a	O
+thermal	B-KEY
+actuator	I-KEY
+was	O
+introduced	O
+.	O
+To	O
+prevent	O
+the	O
+high	O
+outgassing	O
+rate	O
+of	O
+the	O
+rubber	O
+from	O
+spoiling	O
+the	O
+vacuum	O
+,	O
+the	O
+rubber	B-KEY
+blocks	I-KEY
+were	O
+enclosed	O
+by	O
+gas-tight	B-KEY
+bellows	I-KEY
+.	O
+Using	O
+these	O
+techniques	O
+,	O
+we	O
+have	O
+successfully	O
+developed	O
+a	O
+three-layer	O
+stack	O
+which	O
+has	O
+a	O
+vibration	O
+isolation	O
+ratio	O
+of	O
+more	O
+than	O
+10/sup	O
+3	O
+/	O
+at	O
+300	B-KEY
+Hz	I-KEY
+with	O
+control	O
+of	O
+drift	O
+and	O
+enough	O
+vacuum	B-KEY
+compatibility	I-KEY
+
+Sampled-data	B-KEY
+implementation	I-KEY
+of	O
+a	O
+gain	B-KEY
+scheduled	I-KEY
+controller	I-KEY
+A	O
+continuous-time	B-KEY
+gain-scheduled	I-KEY
+controller	I-KEY
+must	O
+be	O
+transformed	O
+to	O
+a	O
+corresponding	O
+discrete-time	B-KEY
+controller	I-KEY
+for	O
+sampled-data	B-KEY
+implementation	I-KEY
+.	O
+We	O
+show	O
+that	O
+certain	O
+linearization	B-KEY
+properties	I-KEY
+of	O
+a	O
+continuous-time	O
+gain	B-KEY
+scheduled	I-KEY
+controller	I-KEY
+are	O
+inherited	O
+by	O
+its	O
+sampled-data	B-KEY
+implementation	I-KEY
+.	O
+We	O
+also	O
+show	O
+that	O
+a	O
+similar	O
+relationship	O
+exists	O
+for	O
+multi-rate	O
+gain	B-KEY
+scheduled	I-KEY
+controllers	I-KEY
+arising	O
+in	O
+flight	O
+control	O
+applications	O
+
+Making	O
+it	O
+to	O
+the	O
+major	O
+leagues	O
+:	O
+career	B-KEY
+movement	I-KEY
+between	O
+library	O
+and	O
+archival	B-KEY
+professions	I-KEY
+and	O
+from	O
+small	O
+college	O
+to	O
+large	B-KEY
+university	I-KEY
+libraries	I-KEY
+Issues	O
+of	O
+career	B-KEY
+movement	I-KEY
+and	O
+change	O
+are	O
+examined	O
+between	O
+library	O
+and	O
+archival	O
+fields	O
+and	O
+from	O
+small	O
+colleges	O
+to	O
+large	O
+universities	O
+.	O
+Issues	O
+examined	O
+include	O
+professional	B-KEY
+education	I-KEY
+and	O
+training	B-KEY
+,	O
+initial	O
+career-planning	O
+and	O
+placement	O
+,	O
+continuing	B-KEY
+education	I-KEY
+,	O
+scouting	O
+and	O
+mentoring	O
+,	O
+job	B-KEY
+market	I-KEY
+conditions	O
+,	O
+work	B-KEY
+experience	I-KEY
+and	O
+personal	B-KEY
+skills	I-KEY
+,	O
+professional	O
+involvement	O
+,	O
+and	O
+professional	O
+association	O
+self-interest	O
+.	O
+This	O
+examination	O
+leads	O
+to	O
+five	O
+observations	O
+:	O
+1	O
+.	O
+It	O
+is	O
+easier	O
+,	O
+in	O
+terms	O
+of	O
+career	O
+transitions	O
+,	O
+for	O
+a	O
+librarian	B-KEY
+to	O
+become	O
+an	O
+archivist	O
+than	O
+it	O
+is	O
+for	O
+an	O
+archivist	O
+to	O
+become	O
+a	O
+librarian	B-KEY
+;	O
+2	O
+.	O
+The	O
+progression	O
+from	O
+a	O
+small	O
+college	O
+venue	O
+to	O
+a	O
+large	O
+research	O
+university	O
+is	O
+very	O
+manageable	O
+with	O
+the	O
+proper	O
+planning	O
+and	O
+experience	O
+;	O
+3	O
+.	O
+At	O
+least	O
+three	O
+of	O
+the	O
+career	O
+elements-professional	O
+education	O
+,	O
+career-planning	O
+,	O
+and	O
+professional	O
+association	O
+self-interest-in	O
+their	O
+best	O
+moments	O
+provide	O
+a	O
+foundation	O
+that	O
+enables	O
+a	O
+future	O
+consideration	O
+of	O
+change	O
+between	O
+institutional	O
+types	O
+and	O
+professional	O
+areas	O
+and	O
+in	O
+their	O
+worst	O
+moments	O
+conspire	O
+against	O
+the	O
+midcareer	O
+professional	O
+in	O
+terms	O
+of	O
+change	O
+;	O
+4	O
+.	O
+The	O
+elements	O
+of	O
+scouting	O
+,	O
+continuing	B-KEY
+education	I-KEY
+,	O
+work	B-KEY
+experience	I-KEY
+,	O
+and	O
+professional	O
+involvement	O
+offer	O
+the	O
+greatest	O
+assistance	O
+in	O
+career	O
+transitions	O
+;	O
+5	O
+.	O
+The	O
+job	B-KEY
+market	I-KEY
+is	O
+the	O
+wildcard	O
+that	O
+either	O
+stymies	O
+or	O
+stimulates	O
+occupational	B-KEY
+development	I-KEY
+
+Mathematical	B-KEY
+modelling	I-KEY
+of	O
+the	O
+work	B-KEY
+of	O
+the	O
+system	O
+of	O
+wells	O
+in	O
+a	O
+layer	O
+with	O
+the	O
+exponential	B-KEY
+law	I-KEY
+of	O
+permeability	B-KEY
+variation	I-KEY
+and	O
+the	O
+mobile	B-KEY
+liquid	I-KEY
+interface	I-KEY
+We	O
+construct	O
+and	O
+study	O
+a	O
+two-dimensional	O
+model	O
+of	O
+the	O
+work	B-KEY
+of	O
+the	O
+system	O
+of	O
+wells	O
+in	O
+a	O
+layer	O
+with	O
+the	O
+mobile	B-KEY
+boundary	I-KEY
+between	O
+liquids	O
+of	O
+various	O
+viscosity	B-KEY
+.	O
+We	O
+use	O
+a	O
+`	O
+plunger	O
+'	O
+displacement	O
+model	O
+of	O
+liquids	O
+.	O
+The	O
+boundaries	O
+of	O
+the	O
+filtration	O
+region	O
+of	O
+these	O
+liquids	O
+are	O
+modelled	O
+by	O
+curves	O
+of	O
+the	O
+Lyapunov	O
+class	O
+.	O
+Unlike	O
+familiar	O
+work	B-KEY
+,	O
+we	O
+solve	O
+two-dimensonal	O
+problems	O
+in	O
+an	O
+inhomogeneous	B-KEY
+layer	I-KEY
+when	O
+the	O
+mobile	B-KEY
+boundary	I-KEY
+and	O
+the	O
+boundaries	O
+of	O
+the	O
+filtration	O
+region	O
+are	O
+modelled	O
+by	O
+curves	O
+of	O
+the	O
+Lyapunov	O
+class	O
+.	O
+We	O
+show	O
+the	O
+practical	O
+convergence	B-KEY
+of	O
+the	O
+numerical	B-KEY
+solution	I-KEY
+of	O
+the	O
+problems	O
+studied	O
+
+Asymptotic	B-KEY
+analysis	I-KEY
+of	O
+-LRB-	O
+3	O
+,	O
+2	O
+,	O
+1	O
+-RRB-	O
+-	O
+Shell	B-KEY
+Sort	I-KEY
+We	O
+analyze	O
+the	O
+-LRB-	O
+3	O
+,	O
+2	O
+,	O
+1	O
+-RRB-	O
+-	O
+Shell	B-KEY
+Sort	I-KEY
+algorithm	O
+under	O
+the	O
+usual	O
+random	O
+permutation	O
+model	O
+
+On	O
+bandlimited	B-KEY
+scaling	I-KEY
+function	I-KEY
+This	O
+paper	O
+discusses	O
+band-limited	O
+scaling	O
+function	O
+,	O
+especially	O
+the	O
+single	O
+interval	B-KEY
+band	I-KEY
+case	I-KEY
+and	O
+three	O
+interval	B-KEY
+band	I-KEY
+cases	I-KEY
+.	O
+Their	O
+relationship	O
+to	O
+oversampling	B-KEY
+property	I-KEY
+and	O
+weakly	B-KEY
+translation	I-KEY
+invariance	I-KEY
+are	O
+also	O
+studied	O
+.	O
+At	O
+the	O
+end	O
+,	O
+we	O
+propose	O
+an	O
+open	O
+problem	O
+
+Rapid	O
+Cauer	B-KEY
+filter	I-KEY
+design	O
+employing	O
+new	O
+filter	O
+model	O
+The	O
+exact	O
+three-dimensional	O
+-LRB-	O
+3D	O
+-RRB-	O
+design	O
+of	O
+a	O
+coaxial	O
+Cauer	B-KEY
+filter	I-KEY
+employing	O
+a	O
+new	O
+filter	B-KEY
+model	I-KEY
+,	O
+a	O
+3D	O
+field	B-KEY
+simulator	I-KEY
+and	O
+a	O
+circuit	B-KEY
+simulator	I-KEY
+,	O
+is	O
+demonstrated	O
+.	O
+Only	O
+a	O
+few	O
+iterations	B-KEY
+between	O
+the	O
+field	B-KEY
+simulator	I-KEY
+and	O
+the	O
+circuit	B-KEY
+simulator	I-KEY
+are	O
+necessary	O
+to	O
+meet	O
+a	O
+given	O
+specification	O
+
+Exact	B-KEY
+frequency-domain	I-KEY
+reconstruction	I-KEY
+for	O
+thermoacoustic	B-KEY
+tomography	I-KEY
+.	O
+I.	O
+Planar	B-KEY
+geometry	I-KEY
+We	O
+report	O
+an	O
+exact	O
+and	O
+fast	O
+Fourier-domain	O
+reconstruction	B-KEY
+algorithm	I-KEY
+for	O
+thermoacoustic	B-KEY
+tomography	I-KEY
+in	O
+a	O
+planar	B-KEY
+configuration	I-KEY
+assuming	O
+thermal	B-KEY
+confinement	I-KEY
+and	O
+constant	B-KEY
+acoustic	I-KEY
+speed	I-KEY
+.	O
+The	O
+effects	O
+of	O
+the	O
+finite	O
+size	O
+of	O
+the	O
+detector	O
+and	O
+the	O
+finite	O
+length	O
+of	O
+the	O
+excitation	B-KEY
+pulse	I-KEY
+are	O
+explicitly	O
+included	O
+in	O
+the	O
+reconstruction	B-KEY
+algorithm	I-KEY
+.	O
+The	O
+algorithm	O
+is	O
+numerically	O
+and	O
+experimentally	O
+verified	O
+.	O
+We	O
+also	O
+demonstrate	O
+that	O
+the	O
+blurring	B-KEY
+caused	O
+by	O
+the	O
+finite	O
+size	O
+of	O
+the	O
+detector	O
+surface	O
+is	O
+the	O
+primary	B-KEY
+limiting	I-KEY
+factor	I-KEY
+on	O
+the	O
+resolution	O
+and	O
+that	O
+it	O
+can	O
+be	O
+compensated	O
+for	O
+by	O
+deconvolution	B-KEY
+
+Community	O
+spirit	O
+IT	B-KEY
+companies	I-KEY
+that	O
+contribute	O
+volunteers	O
+,	O
+resources	O
+or	O
+funding	O
+to	O
+charities	O
+and	O
+local	O
+groups	O
+not	O
+only	O
+make	O
+a	O
+real	O
+difference	O
+to	O
+their	O
+communities	O
+but	O
+also	O
+add	O
+value	O
+to	O
+their	O
+businesses	O
+.	O
+So	O
+says	O
+a	O
+new	O
+coalition	O
+of	O
+IT	O
+industry	O
+bodies	O
+formed	O
+to	O
+raise	O
+awareness	O
+of	O
+the	O
+options	O
+for	O
+community	O
+involvement	O
+,	O
+promote	O
+the	O
+business	O
+case	O
+,	O
+and	O
+publicise	O
+examples	O
+of	O
+best	B-KEY
+practice	I-KEY
+.	O
+The	O
+BCS	O
+,	O
+Intellect	O
+-LRB-	O
+formed	O
+from	O
+the	O
+merger	O
+of	O
+the	O
+Computing	O
+Services	O
+and	O
+Software	O
+Association	O
+and	O
+the	O
+Federation	O
+of	O
+the	O
+Electronics	O
+Industry	O
+-RRB-	O
+and	O
+the	O
+Worshipful	O
+Company	O
+of	O
+Information	O
+Technologists	O
+plan	O
+to	O
+run	O
+advisory	O
+seminars	O
+and	O
+provide	O
+guidelines	O
+on	O
+how	O
+companies	O
+of	O
+all	O
+sizes	O
+can	O
+transform	O
+their	O
+local	O
+communities	O
+using	O
+their	O
+specialist	O
+IT	O
+skills	O
+and	O
+resources	O
+while	O
+reaping	O
+business	B-KEY
+benefits	I-KEY
+
+Minimised	B-KEY
+geometric	I-KEY
+Buchberger	I-KEY
+algorithm	I-KEY
+for	O
+integer	O
+programming	O
+Recently	O
+,	O
+various	O
+algebraic	B-KEY
+integer	I-KEY
+programming	I-KEY
+-LRB-	O
+IP	O
+-RRB-	O
+solvers	O
+have	O
+been	O
+proposed	O
+based	O
+on	O
+the	O
+theory	O
+of	O
+Grobner	B-KEY
+bases	I-KEY
+.	O
+The	O
+main	O
+difficulty	O
+of	O
+these	O
+solvers	O
+is	O
+the	O
+size	O
+of	O
+the	O
+Grobner	B-KEY
+bases	I-KEY
+generated	O
+.	O
+In	O
+algorithms	O
+proposed	O
+so	O
+far	O
+,	O
+large	O
+Grobner	B-KEY
+bases	I-KEY
+are	O
+generated	O
+by	O
+either	O
+introducing	O
+additional	O
+variables	O
+or	O
+by	O
+considering	O
+the	O
+generic	O
+IP	O
+problem	O
+IP/sub	O
+A	O
+,	O
+C	O
+/	O
+.	O
+Some	O
+improvements	O
+have	O
+been	O
+proposed	O
+such	O
+as	O
+Hosten	O
+and	O
+Sturmfels	O
+'	O
+method	O
+-LRB-	O
+GRIN	O
+-RRB-	O
+designed	O
+to	O
+avoid	O
+additional	O
+variables	O
+and	O
+Thomas	O
+'	O
+truncated	B-KEY
+Grobner	I-KEY
+basis	I-KEY
+method	I-KEY
+which	O
+computes	O
+the	O
+reduced	B-KEY
+Grobner	I-KEY
+basis	I-KEY
+for	O
+a	O
+specific	O
+IP	O
+problem	O
+IP/sub	O
+A	O
+,	O
+C	O
+/	O
+-LRB-	O
+b	O
+-RRB-	O
+-LRB-	O
+rather	O
+than	O
+its	O
+generalisation	O
+IPA	O
+,	O
+C	O
+-RRB-	O
+.	O
+In	O
+this	O
+paper	O
+we	O
+propose	O
+a	O
+new	O
+algebraic	O
+algorithm	O
+for	O
+solving	O
+IP	O
+problems	O
+.	O
+The	O
+new	O
+algorithm	O
+,	O
+called	O
+Minimised	B-KEY
+Geometric	I-KEY
+Buchberger	I-KEY
+Algorithm	I-KEY
+,	O
+combines	O
+Hosten	O
+and	O
+Sturmfels	O
+'	O
+GRIN	O
+and	O
+Thomas	O
+'	O
+truncated	O
+Grobner	O
+basis	O
+method	O
+to	O
+compute	O
+the	O
+fundamental	O
+segments	O
+of	O
+an	O
+IP	O
+problem	O
+IP/sub	O
+A	O
+,	O
+C	O
+/	O
+directly	O
+in	O
+its	O
+original	O
+space	O
+and	O
+also	O
+the	O
+truncated	O
+Grobner	O
+basis	O
+for	O
+a	O
+specific	O
+IP	O
+problem	O
+IP/sub	O
+A	O
+,	O
+C	O
+/	O
+-LRB-	O
+b	O
+-RRB-	O
+.	O
+We	O
+have	O
+carried	O
+out	O
+experiments	O
+to	O
+compare	O
+this	O
+algorithm	O
+with	O
+others	O
+such	O
+as	O
+the	O
+geometric	B-KEY
+Buchberger	I-KEY
+algorithm	I-KEY
+,	O
+the	O
+truncated	B-KEY
+geometric	I-KEY
+Buchberger	I-KEY
+algorithm	I-KEY
+and	O
+the	O
+algorithm	O
+in	O
+GRIN	O
+.	O
+These	O
+experiments	O
+show	O
+that	O
+the	O
+new	O
+algorithm	O
+offers	O
+significant	O
+performance	B-KEY
+improvement	I-KEY
+
+A	O
+second	B-KEY
+order	I-KEY
+characteristic	I-KEY
+finite	I-KEY
+element	I-KEY
+scheme	I-KEY
+for	O
+convection-diffusion	B-KEY
+problems	I-KEY
+A	O
+new	O
+characteristic	O
+finite	O
+element	O
+scheme	O
+is	O
+presented	O
+for	O
+convection-diffusion	B-KEY
+problems	I-KEY
+.	O
+It	O
+is	O
+of	O
+second	B-KEY
+order	I-KEY
+accuracy	I-KEY
+in	O
+time	O
+increment	O
+,	O
+symmetric	O
+,	O
+and	O
+unconditionally	O
+stable	O
+.	O
+Optimal	B-KEY
+error	I-KEY
+estimates	I-KEY
+are	O
+proved	O
+in	O
+the	O
+framework	O
+of	O
+L/sup	O
+2	O
+/	O
+-	O
+theory	O
+.	O
+Numerical	O
+results	O
+are	O
+presented	O
+for	O
+two	O
+examples	O
+,	O
+which	O
+show	O
+the	O
+advantage	O
+of	O
+the	O
+scheme	O
+
+A	O
+winning	O
+combination	O
+-LSB-	O
+wireless	B-KEY
+health	O
+care	O
+-RSB-	O
+Three	O
+years	O
+ago	O
+,	O
+the	O
+Institute	O
+of	O
+Medicine	O
+-LRB-	O
+IOM	O
+-RRB-	O
+reported	O
+that	O
+medical	B-KEY
+errors	I-KEY
+result	O
+in	O
+at	O
+least	O
+44,000	O
+deaths	O
+each	O
+year-more	O
+than	O
+deaths	O
+from	O
+highway	O
+accidents	O
+,	O
+breast	O
+cancer	O
+or	O
+AIDS	O
+.	O
+That	O
+report	O
+,	O
+and	O
+others	O
+which	O
+placed	O
+serious	O
+errors	O
+as	O
+high	O
+as	O
+98,000	O
+annually	O
+,	O
+served	O
+as	O
+a	O
+wake-up	O
+call	O
+for	O
+healthcare	O
+providers	O
+such	O
+as	O
+the	O
+CareGroup	B-KEY
+Healthcare	I-KEY
+System	I-KEY
+Inc.	O
+,	O
+a	O
+Boston-area	O
+healthcare	O
+network	B-KEY
+that	I-KEY
+is	O
+the	O
+second	O
+largest	O
+integrated	O
+delivery	O
+system	O
+in	O
+the	O
+northeastern	O
+United	O
+States	O
+.	O
+With	O
+annual	O
+revenues	O
+of	O
+$	O
+1.2	O
+B	O
+,	O
+CareGroup	O
+provides	O
+primary	O
+care	O
+and	O
+specialty	O
+services	O
+to	O
+more	O
+than	O
+1,000,000	O
+patients	O
+.	O
+CareGroup	O
+combined	O
+wireless	B-KEY
+technology	O
+with	O
+the	O
+Web	O
+to	O
+create	O
+a	O
+provider	B-KEY
+order	I-KEY
+entry	I-KEY
+-LRB-	O
+POE	O
+-RRB-	O
+system	O
+designed	O
+to	O
+reduce	O
+the	O
+frequency	O
+of	O
+costly	O
+medical	O
+mistakes	O
+.	O
+The	O
+POE	O
+infrastructure	O
+includes	O
+InterSystems	O
+Corporation	O
+'s	O
+CACHE	O
+database	O
+,	O
+Dell	B-KEY
+Computer	I-KEY
+C600	I-KEY
+laptops	I-KEY
+and	O
+Cisco	O
+Systems	O
+'	O
+Aironet	O
+350	O
+wireless	B-KEY
+networks	O
+
+The	O
+road	O
+to	O
+perpetual	O
+progress	O
+-LSB-	O
+retail	B-KEY
+inventory	B-KEY
+management	I-KEY
+-RSB-	O
+With	O
+annual	O
+revenues	O
+increasing	O
+17.0	O
+%	O
+to	O
+20.0	O
+%	O
+consistently	O
+over	O
+the	O
+last	O
+three	O
+years	O
+and	O
+more	O
+than	O
+2,500	O
+new	O
+stores	O
+opened	O
+from	O
+1998	O
+through	O
+2001	O
+,	O
+Dollar	B-KEY
+General	I-KEY
+is	O
+on	O
+the	O
+fast	O
+track	O
+.	O
+However	O
+,	O
+the	O
+road	O
+to	O
+riches	O
+could	O
+have	O
+easily	O
+become	O
+the	O
+road	O
+to	O
+ruin	O
+had	O
+the	O
+retailer	B-KEY
+not	O
+exerted	O
+control	O
+over	O
+its	O
+inventory	B-KEY
+management	I-KEY
+
+Breast	O
+MR	O
+imaging	O
+with	O
+high	O
+spectral	O
+and	O
+spatial	O
+resolutions	O
+:	O
+preliminary	O
+experience	O
+The	O
+authors	O
+evaluated	O
+magnetic	O
+resonance	O
+-LRB-	O
+MR	O
+-RRB-	O
+imaging	O
+with	O
+high	O
+spectral	O
+and	O
+spatial	O
+resolutions	O
+-LRB-	O
+HSSR	O
+-RRB-	O
+of	O
+water	O
+and	O
+fat	O
+in	O
+breasts	O
+of	O
+healthy	B-KEY
+volunteers	I-KEY
+-LRB-	O
+n	O
+=	O
+6	O
+-RRB-	O
+and	O
+women	B-KEY
+with	O
+suspicious	B-KEY
+lesions	I-KEY
+-LRB-	O
+n	O
+=	O
+6	O
+-RRB-	O
+.	O
+Fat	B-KEY
+suppression	I-KEY
+,	O
+edge	B-KEY
+delineation	I-KEY
+,	O
+and	O
+image	B-KEY
+texture	I-KEY
+were	O
+improved	O
+on	O
+MR	O
+images	O
+derived	O
+from	O
+HSSR	O
+data	O
+compared	O
+with	O
+those	O
+on	O
+conventional	O
+MR	O
+images	O
+.	O
+HSSR	O
+MR	O
+imaging	O
+data	O
+acquired	O
+before	O
+and	O
+after	O
+contrast	B-KEY
+medium	I-KEY
+injection	I-KEY
+showed	O
+spectrally	O
+inhomogeneous	O
+changes	O
+in	O
+the	O
+water	B-KEY
+resonances	I-KEY
+in	O
+small	B-KEY
+voxels	I-KEY
+that	O
+were	O
+not	O
+detectable	O
+with	O
+conventional	O
+MR	O
+imaging	O
+
+Happily	O
+ever	O
+after	O
+:	O
+plateauing	B-KEY
+as	O
+a	O
+means	O
+for	O
+long-term	B-KEY
+career	I-KEY
+satisfaction	I-KEY
+Little	O
+did	O
+I	O
+know	O
+when	O
+I	O
+attended	O
+Judith	O
+Bardwick	O
+'s	O
+presentation	O
+on	O
+plateauing	B-KEY
+at	O
+the	O
+ALA	O
+annual	O
+convention	O
+in	O
+1988	O
+that	O
+it	O
+would	O
+turn	O
+out	O
+to	O
+be	O
+one	O
+of	O
+the	O
+most	O
+valuable	O
+sessions	O
+I	O
+would	O
+attend	O
+at	O
+any	O
+library	O
+conference	O
+,	O
+since	O
+it	O
+has	O
+enabled	O
+me	O
+to	O
+understand	O
+the	O
+phenomenon	O
+of	O
+plateauing	B-KEY
+and	O
+to	O
+use	O
+the	O
+strategies	O
+she	O
+suggested	O
+to	O
+rejuvenate	O
+my	O
+career	O
+and	O
+personal	B-KEY
+life	I-KEY
+continually	O
+.	O
+Key	O
+concepts	O
+and	O
+solutions	O
+from	O
+her	O
+book	O
+and	O
+from	O
+other	O
+literature	O
+on	O
+plateauing	B-KEY
+are	O
+summarized	O
+and	O
+examples	O
+given	O
+as	O
+to	O
+how	O
+I	O
+incorporated	O
+them	O
+into	O
+my	O
+life	O
+
+SPARC	B-KEY
+ignites	O
+scholarly	O
+publishing	O
+During	O
+the	O
+past	O
+several	O
+years	O
+,	O
+initiatives	B-KEY
+which	O
+bring	O
+together	O
+librarians	O
+,	O
+researchers	O
+,	O
+university	O
+administrators	O
+and	O
+independent	O
+publishers	O
+have	O
+re-invigorated	O
+the	O
+scholarly	O
+publishing	O
+marketplace	O
+.	O
+These	O
+initiatives	B-KEY
+take	O
+advantage	O
+of	O
+electronic	O
+technology	O
+and	O
+show	O
+great	O
+potential	O
+for	O
+restoring	O
+science	O
+to	O
+scientists	O
+.	O
+The	O
+author	O
+outlines	O
+SPARC	B-KEY
+-LRB-	O
+the	O
+Scholarly	B-KEY
+Publishing	I-KEY
+and	I-KEY
+Academic	I-KEY
+Resources	I-KEY
+Coalition	I-KEY
+-RRB-	O
+,	O
+an	O
+initiative	B-KEY
+to	O
+make	O
+scientific	O
+journals	O
+more	O
+accessible	O
+
+A	O
+review	O
+of	O
+methodologies	O
+used	O
+in	O
+research	O
+on	O
+cadastral	B-KEY
+development	O
+World-wide	O
+,	O
+much	O
+attention	O
+has	O
+been	O
+given	O
+to	O
+cadastral	B-KEY
+development	O
+.	O
+As	O
+a	O
+consequence	O
+of	O
+experiences	O
+made	O
+during	O
+recent	O
+decades	O
+,	O
+several	O
+authors	O
+have	O
+stated	O
+the	O
+need	O
+for	O
+research	O
+in	O
+the	O
+domain	O
+of	O
+cadastre	B-KEY
+and	O
+proposed	O
+methodologies	O
+to	O
+be	O
+used	O
+.	O
+The	O
+paper	O
+contributes	O
+to	O
+the	O
+acceptance	O
+of	O
+research	B-KEY
+methodologies	I-KEY
+needed	O
+for	O
+cadastral	B-KEY
+development	O
+,	O
+and	O
+thereby	O
+enhances	O
+theory	O
+in	O
+the	O
+cadastral	B-KEY
+domain	O
+.	O
+The	O
+paper	O
+reviews	O
+nine	O
+publications	O
+on	O
+cadastre	B-KEY
+and	O
+identifies	O
+the	O
+methodologies	O
+used	O
+.	O
+The	O
+review	O
+focuses	O
+on	O
+the	O
+institutional	O
+,	O
+social	O
+,	O
+political	O
+and	O
+economic	B-KEY
+aspects	I-KEY
+of	O
+cadastral	B-KEY
+development	O
+,	O
+rather	O
+than	O
+on	O
+the	O
+technical	O
+aspects	O
+.	O
+The	O
+main	O
+conclusion	O
+is	O
+that	O
+the	O
+methodologies	O
+used	O
+are	O
+largely	O
+those	O
+of	O
+the	O
+social	B-KEY
+sciences	I-KEY
+.	O
+That	O
+agrees	O
+with	O
+the	O
+notion	O
+that	O
+cadastre	B-KEY
+relates	O
+as	O
+much	O
+to	O
+people	O
+and	O
+institutions	O
+,	O
+as	O
+it	O
+relates	O
+to	O
+land	O
+,	O
+and	O
+that	O
+cadastral	B-KEY
+systems	O
+are	O
+shaped	O
+by	O
+social	O
+,	O
+political	O
+and	O
+economic	B-KEY
+conditions	I-KEY
+,	O
+as	O
+well	O
+as	O
+technology	O
+.	O
+Since	O
+the	O
+geodetic	B-KEY
+survey	I-KEY
+profession	I-KEY
+has	O
+been	O
+the	O
+keeper	O
+of	O
+the	O
+cadastre	B-KEY
+,	O
+geodetic	B-KEY
+surveyors	I-KEY
+will	O
+have	O
+to	O
+deal	O
+ever	O
+more	O
+with	O
+social	B-KEY
+science	I-KEY
+matters	O
+,	O
+a	O
+fact	O
+that	O
+universities	O
+will	O
+have	O
+to	O
+consider	O
+
+Asymptotic	B-KEY
+normality	I-KEY
+for	O
+the	O
+K/sub	O
+phi	O
+/	O
+-	O
+divergence	O
+goodness-of-fit	O
+tests	O
+In	O
+this	O
+paper	O
+for	O
+a	O
+wide	O
+class	O
+of	O
+goodness-of-fit	O
+statistics	O
+based	O
+K/sub	O
+phi	O
+/	O
+-	O
+divergences	O
+,	O
+the	O
+asymptotic	B-KEY
+normality	I-KEY
+is	O
+established	O
+under	O
+the	O
+assumption	O
+n/m/sub	O
+n	O
+/	O
+to	O
+a	O
+in	O
+-LRB-	O
+0	O
+,	O
+infinity	O
+-RRB-	O
+,	O
+where	O
+n	O
+denotes	O
+sample	O
+size	O
+and	O
+m/sub	O
+n	O
+/	O
+the	O
+number	O
+of	O
+cells	O
+.	O
+This	O
+result	O
+is	O
+extended	O
+to	O
+contiguous	O
+alternatives	O
+to	O
+study	O
+asymptotic	B-KEY
+efficiency	I-KEY
+
+A	O
+study	O
+of	O
+hospitality	O
+and	O
+tourism	O
+information	O
+technology	O
+education	B-KEY
+and	O
+industrial	O
+applications	O
+The	O
+purpose	O
+of	O
+this	O
+study	O
+was	O
+to	O
+examine	O
+the	O
+subject	O
+relevance	O
+of	O
+information	O
+technology	O
+-LRB-	O
+IT	O
+-RRB-	O
+in	O
+hospitality	B-KEY
+and	I-KEY
+tourism	I-KEY
+management	I-KEY
+programs	I-KEY
+with	O
+skills	O
+deployed	O
+in	O
+the	O
+workplace	O
+.	O
+This	O
+study	O
+aimed	O
+at	O
+investigating	O
+graduates	B-KEY
+'	O
+transition	O
+from	O
+education	B-KEY
+to	O
+employment	B-KEY
+,	O
+and	O
+to	O
+determine	O
+how	O
+well	O
+they	O
+appear	O
+to	O
+be	O
+equipped	O
+to	O
+meet	O
+the	O
+needs	O
+of	O
+the	O
+hospitality	O
+and	O
+tourism	B-KEY
+industry	I-KEY
+.	O
+One	O
+hundred	O
+and	O
+seventeen	O
+graduates	B-KEY
+responded	O
+to	O
+a	O
+mail	B-KEY
+survey	I-KEY
+.	O
+These	O
+graduates	B-KEY
+rated	O
+the	O
+importance	O
+of	O
+IT	B-KEY
+skills	I-KEY
+in	O
+the	O
+workplace	O
+,	O
+the	O
+level	O
+of	O
+IT	B-KEY
+teaching	I-KEY
+in	O
+hotel	O
+and	O
+tourism	O
+management	O
+programs	O
+,	O
+and	O
+the	O
+self-competence	O
+level	O
+in	O
+IT	O
+.	O
+This	O
+study	O
+concluded	O
+that	O
+a	O
+gap	O
+exists	O
+between	O
+the	O
+IT	B-KEY
+skills	I-KEY
+required	O
+at	O
+work	O
+and	O
+those	O
+acquired	O
+at	O
+university	B-KEY
+
+On	O
+the	O
+accuracy	O
+of	O
+polynomial	B-KEY
+interpolation	I-KEY
+in	O
+Hilbert	B-KEY
+space	I-KEY
+with	O
+disturbed	B-KEY
+nodal	I-KEY
+values	I-KEY
+of	O
+the	O
+operator	O
+The	O
+interpolation	O
+accuracy	O
+of	O
+polynomial	B-KEY
+operators	I-KEY
+in	O
+a	O
+Hilbert	B-KEY
+space	I-KEY
+with	O
+a	O
+measure	O
+is	O
+estimated	O
+when	O
+nodal	O
+values	O
+of	O
+these	O
+operators	O
+are	O
+given	O
+approximately	O
+
+The	O
+perceived	O
+utility	O
+of	O
+human	O
+and	O
+automated	B-KEY
+aids	O
+in	O
+a	O
+visual	O
+detection	O
+task	O
+Although	O
+increases	O
+in	O
+the	O
+use	O
+of	O
+automation	B-KEY
+have	O
+occurred	O
+across	O
+society	O
+,	O
+research	O
+has	O
+found	O
+that	O
+human	B-KEY
+operators	I-KEY
+often	O
+underutilize	O
+-LRB-	O
+disuse	O
+-RRB-	O
+and	O
+overly	O
+rely	O
+on	O
+-LRB-	O
+misuse	O
+-RRB-	O
+automated	B-KEY
+aids	O
+-LRB-	O
+Parasuraman-Riley	O
+-LRB-	O
+1997	O
+-RRB-	O
+-RRB-	O
+.	O
+Nearly	O
+275	O
+Cameron	O
+University	O
+students	O
+participated	O
+in	O
+1	O
+of	O
+3	O
+experiments	O
+performed	O
+to	O
+examine	O
+the	O
+effects	O
+of	O
+perceived	O
+utility	O
+-LRB-	O
+Dzindolet	O
+et	O
+al.	O
+-LRB-	O
+2001	O
+-RRB-	O
+-RRB-	O
+on	O
+automation	B-KEY
+use	O
+in	O
+a	O
+visual	B-KEY
+detection	I-KEY
+task	I-KEY
+and	O
+to	O
+compare	O
+reliance	O
+on	O
+automated	B-KEY
+aids	O
+with	O
+reliance	O
+on	O
+humans	O
+.	O
+Results	O
+revealed	O
+a	O
+bias	O
+for	O
+human	B-KEY
+operators	I-KEY
+to	O
+rely	O
+on	O
+themselves	O
+.	O
+Although	O
+self-report	O
+data	O
+indicate	O
+a	O
+bias	O
+toward	O
+automated	B-KEY
+aids	O
+over	O
+human	O
+aids	O
+,	O
+performance	O
+data	O
+revealed	O
+that	O
+participants	O
+were	O
+more	O
+likely	O
+to	O
+disuse	O
+automated	O
+aids	O
+than	O
+to	O
+disuse	O
+human	O
+aids	O
+.	O
+This	O
+discrepancy	O
+was	O
+accounted	O
+for	O
+by	O
+assuming	O
+human	B-KEY
+operators	I-KEY
+have	O
+a	O
+``	O
+perfect	O
+automation	B-KEY
+''	O
+schema	O
+.	O
+Actual	O
+or	O
+potential	O
+applications	O
+of	O
+this	O
+research	O
+include	O
+the	O
+design	O
+of	O
+future	O
+automated	B-KEY
+decision	O
+aids	O
+and	O
+training	O
+procedures	O
+for	O
+operators	O
+relying	O
+on	O
+such	O
+aids	O
+
+A	O
+digital-driving	O
+system	O
+for	O
+smart	O
+vehicles	O
+In	O
+the	O
+wake	O
+of	O
+the	O
+computer	O
+and	O
+information	O
+technology	O
+revolutions	O
+,	O
+vehicles	O
+are	O
+undergoing	O
+dramatic	O
+changes	O
+in	O
+their	O
+capabilities	O
+and	O
+how	O
+they	O
+interact	O
+with	O
+drivers	O
+.	O
+Although	O
+some	O
+vehicles	O
+can	O
+decide	O
+to	O
+either	O
+generate	O
+warnings	O
+for	O
+the	O
+human	O
+driver	O
+or	O
+control	O
+the	O
+vehicle	O
+autonomously	O
+,	O
+they	O
+must	O
+usually	O
+make	O
+these	O
+decisions	O
+in	O
+real	O
+time	O
+with	O
+only	O
+incomplete	O
+information	O
+.	O
+So	O
+,	O
+human	O
+drivers	O
+must	O
+still	O
+maintain	O
+control	O
+over	O
+the	O
+vehicle	O
+.	O
+I	O
+sketch	O
+a	O
+digital	O
+driving	O
+behavior	O
+model	O
+.	O
+By	O
+simulating	O
+and	O
+analyzing	O
+driver	O
+behavior	O
+during	O
+different	O
+maneuvers	B-KEY
+such	O
+as	O
+lane	B-KEY
+changing	I-KEY
+,	O
+lane	B-KEY
+following	I-KEY
+,	O
+and	O
+traffic	B-KEY
+avoidance	I-KEY
+,	O
+researchers	O
+participating	O
+in	O
+the	O
+Beijing	O
+Institute	O
+of	O
+Technology	O
+'s	O
+digital-driving	O
+project	O
+will	O
+be	O
+able	O
+to	O
+examine	O
+the	O
+possible	O
+correlations	O
+or	O
+causal	O
+relations	O
+between	O
+the	O
+smart	O
+vehicle	O
+,	O
+IVISs	O
+,	O
+the	O
+intelligent	B-KEY
+road-traffic-information	O
+network	O
+,	O
+and	O
+the	O
+driver	O
+.	O
+We	O
+aim	O
+to	O
+successfully	O
+demonstrate	O
+that	O
+a	O
+digital-driving	O
+system	O
+can	O
+provide	O
+a	O
+direction	O
+for	O
+developing	O
+human-centered	B-KEY
+smart	I-KEY
+vehicles	I-KEY
+
+Using	O
+extended	B-KEY
+logic	I-KEY
+programming	I-KEY
+for	O
+alarm-correlation	B-KEY
+in	O
+cellular	B-KEY
+phone	I-KEY
+networks	I-KEY
+Alarm	O
+correlation	O
+is	O
+a	O
+necessity	O
+in	O
+large	B-KEY
+mobile	I-KEY
+phone	I-KEY
+networks	I-KEY
+,	O
+where	O
+the	O
+alarm	O
+bursts	O
+resulting	O
+from	O
+severe	O
+failures	O
+would	O
+otherwise	O
+overload	O
+the	O
+network	B-KEY
+operators	I-KEY
+.	O
+We	O
+describe	O
+how	O
+to	O
+realize	O
+alarm-correlation	B-KEY
+in	O
+cellular	B-KEY
+phone	I-KEY
+networks	I-KEY
+using	O
+extended	B-KEY
+logic	I-KEY
+programming	I-KEY
+.	O
+To	O
+this	O
+end	O
+,	O
+we	O
+describe	O
+an	O
+algorithm	O
+and	O
+system	O
+solving	O
+the	O
+problem	O
+,	O
+a	O
+model	O
+of	O
+a	O
+mobile	O
+phone	O
+network	O
+application	O
+,	O
+and	O
+a	O
+detailed	O
+solution	O
+for	O
+a	O
+specific	O
+scenario	O
+
+Generic	B-KEY
+simulation	I-KEY
+approach	O
+for	O
+multi-axis	O
+machining	O
+.	O
+Part	O
+2	O
+:	O
+model	B-KEY
+calibration	I-KEY
+and	O
+feed	B-KEY
+rate	I-KEY
+scheduling	I-KEY
+For	O
+Part	O
+1	O
+see	O
+ibid	O
+.	O
+vol	O
+.124	O
+-LRB-	O
+2002	O
+-RRB-	O
+.	O
+This	O
+is	O
+the	O
+second	O
+part	O
+of	O
+a	O
+two-part	O
+paper	O
+presenting	O
+a	O
+new	O
+methodology	O
+for	O
+analytically	O
+simulating	O
+multi-axis	O
+machining	O
+of	O
+complex	B-KEY
+sculptured	I-KEY
+surfaces	I-KEY
+.	O
+The	O
+first	O
+section	O
+of	O
+this	O
+paper	O
+offers	O
+a	O
+detailed	O
+explanation	O
+of	O
+the	O
+model	B-KEY
+calibration	I-KEY
+procedure	O
+.	O
+A	O
+new	O
+methodology	O
+is	O
+presented	O
+for	O
+accurately	O
+determining	O
+the	O
+cutting	B-KEY
+force	I-KEY
+coefficients	I-KEY
+for	O
+multi-axis	O
+machining	O
+.	O
+The	O
+force	B-KEY
+model	I-KEY
+presented	O
+in	O
+Part	O
+1	O
+is	O
+reformulated	O
+so	O
+that	O
+the	O
+cutting	B-KEY
+force	I-KEY
+coefficients	I-KEY
+account	O
+for	O
+the	O
+effects	O
+of	O
+feed	O
+rate	O
+,	O
+cutting	O
+speed	O
+,	O
+and	O
+a	O
+complex	O
+cutting	B-KEY
+edge	I-KEY
+design	I-KEY
+.	O
+Experimental	O
+results	O
+are	O
+presented	O
+for	O
+the	O
+calibration	O
+procedure	O
+.	O
+Model	O
+verification	O
+tests	O
+were	O
+conducted	O
+with	O
+these	O
+cutting	B-KEY
+force	I-KEY
+coefficients	I-KEY
+.	O
+These	O
+tests	O
+demonstrate	O
+that	O
+the	O
+predicted	O
+forces	O
+are	O
+within	O
+5	O
+%	O
+of	O
+experimentally	O
+measured	O
+forces	O
+.	O
+Simulated	O
+results	O
+are	O
+also	O
+shown	O
+for	O
+predicting	O
+dynamic	O
+cutting	O
+forces	O
+and	O
+static/dynamic	O
+tool	O
+deflection	O
+.	O
+The	O
+second	O
+section	O
+of	O
+the	O
+paper	O
+discusses	O
+how	O
+the	O
+modeling	O
+methodology	O
+can	O
+be	O
+applied	O
+for	O
+feed	B-KEY
+rate	I-KEY
+scheduling	I-KEY
+in	O
+an	O
+industrial	O
+application	O
+.	O
+A	O
+case	O
+study	O
+for	O
+process	O
+optimization	B-KEY
+of	O
+machining	O
+an	O
+airfoil-like	O
+surface	O
+is	O
+used	O
+for	O
+demonstration	O
+.	O
+Based	O
+on	O
+the	O
+predicted	O
+instantaneous	O
+chip	O
+load	O
+and/or	O
+a	O
+specified	O
+force	O
+constraint	O
+,	O
+the	O
+feed	B-KEY
+rate	I-KEY
+scheduling	I-KEY
+is	O
+utilized	O
+to	O
+increase	O
+the	O
+metal	B-KEY
+removal	I-KEY
+rate	I-KEY
+.	O
+The	O
+feed	B-KEY
+rate	I-KEY
+scheduling	I-KEY
+implementation	O
+results	O
+in	O
+a	O
+30	O
+%	O
+reduction	O
+in	O
+machining	O
+time	O
+for	O
+the	O
+airfoil-like	O
+surface	O
+
+The	O
+art	O
+of	O
+the	O
+cross-sell	B-KEY
+-LSB-	O
+accounting	B-KEY
+software	I-KEY
+-RSB-	O
+With	O
+the	O
+market	O
+for	O
+accounting	B-KEY
+software	I-KEY
+nearing	O
+saturation	O
+,	O
+vendors	O
+are	O
+training	O
+resellers	B-KEY
+in	O
+the	O
+subtleties	O
+of	O
+the	O
+cross-sell	B-KEY
+.	O
+The	O
+rewards	O
+can	O
+be	O
+great	O
+.	O
+The	O
+key	O
+is	O
+knowing	O
+when	O
+to	O
+focus	O
+,	O
+and	O
+when	O
+to	O
+partner	O
+
+Human	O
+face	O
+detection	O
+in	O
+visual	B-KEY
+scenes	I-KEY
+using	O
+neural	B-KEY
+networks	I-KEY
+This	O
+paper	O
+presents	O
+a	O
+neural	B-KEY
+network	I-KEY
+based	O
+face	B-KEY
+detection	I-KEY
+system	I-KEY
+.	O
+Our	O
+objective	O
+is	O
+to	O
+design	O
+a	O
+system	O
+that	O
+can	O
+detect	O
+human	O
+faces	O
+in	O
+visual	B-KEY
+scenes	I-KEY
+at	O
+high	O
+searching	O
+speed	O
+and	O
+accuracy	O
+.	O
+We	O
+used	O
+a	O
+neural	B-KEY
+network	I-KEY
+with	O
+a	O
+simple	O
+structure	O
+but	O
+trained	O
+using	O
+face	O
+and	O
+non-face	O
+samples	O
+preprocessed	O
+by	O
+several	O
+methods	O
+-LRB-	O
+position	O
+normalization	O
+,	O
+histogram	O
+equalization	O
+,	O
+etc.	O
+-RRB-	O
+to	O
+attain	O
+high	O
+accuracy	O
+,	O
+then	O
+pruned	O
+the	O
+size	O
+of	O
+the	O
+neural	B-KEY
+network	I-KEY
+so	O
+that	O
+it	O
+could	O
+run	O
+faster	O
+and	O
+reduced	O
+the	O
+total	O
+search	O
+area	O
+of	O
+a	O
+target	O
+visual	B-KEY
+scene	I-KEY
+using	O
+the	O
+skin	B-KEY
+color	I-KEY
+detector	I-KEY
+.	O
+Skin	O
+color	O
+detection	O
+assumes	O
+that	O
+faces	O
+reside	O
+only	O
+in	O
+skin	O
+color	O
+regions	O
+.	O
+The	O
+system	O
+design	O
+is	O
+made	O
+up	O
+of	O
+two	O
+parts	O
+:	O
+the	O
+face	B-KEY
+detecting	I-KEY
+system	I-KEY
+that	O
+detects	O
+the	O
+faces	O
+,	O
+and	O
+the	O
+searching	O
+speed	O
+improving	O
+system	O
+.	O
+Speed	O
+improvement	O
+is	O
+achieved	O
+by	O
+reducing	O
+the	O
+face	O
+locator	O
+network	O
+size	O
+using	O
+the	O
+structural	O
+learning	O
+with	O
+knowledge	O
+and	O
+by	O
+reducing	O
+the	O
+face	O
+search	O
+area	O
+using	O
+the	O
+skin	O
+color	O
+detection	O
+system	O
+.	O
+Faster	O
+training	O
+of	O
+the	O
+neural	B-KEY
+networks	I-KEY
+was	O
+also	O
+achieved	O
+using	O
+variable	O
+step	O
+sizes	O
+
+Differential	B-KEY
+and	O
+integral	B-KEY
+calculus	O
+on	O
+discrete	O
+time	B-KEY
+series	I-KEY
+data	O
+It	O
+has	O
+been	O
+found	O
+that	O
+discontinuity	O
+plays	O
+a	O
+crucial	O
+role	O
+in	O
+natural	B-KEY
+evolutions	I-KEY
+-LRB-	O
+Lin	O
+1998	O
+-RRB-	O
+.	O
+In	O
+this	O
+presentation	O
+,	O
+we	O
+will	O
+generalize	O
+the	O
+idea	O
+of	O
+integration	B-KEY
+and	O
+differentiation	B-KEY
+,	O
+we	O
+developed	O
+in	O
+calculus	O
+,	O
+to	O
+the	O
+study	O
+of	O
+time	B-KEY
+series	I-KEY
+in	O
+the	O
+hope	O
+that	O
+the	O
+problem	O
+of	O
+outliers	B-KEY
+and	O
+discontinuities	O
+can	O
+be	O
+resolved	O
+more	O
+successfully	O
+than	O
+simply	O
+deleting	O
+the	O
+outliers	B-KEY
+and	O
+avoiding	O
+discontinuities	O
+from	O
+the	O
+overall	O
+data	O
+analysis	O
+.	O
+In	O
+general	O
+,	O
+appearances	O
+of	O
+outliers	B-KEY
+tend	O
+to	O
+mean	O
+existence	O
+of	O
+discontinuities	O
+,	O
+explosive	O
+growth	O
+or	O
+decline	O
+in	O
+the	O
+evolution	O
+.	O
+At	O
+the	O
+same	O
+time	O
+,	O
+our	O
+approach	O
+can	O
+be	O
+employed	O
+to	O
+partially	O
+overcome	O
+the	O
+problem	O
+of	O
+not	O
+having	O
+enough	O
+data	O
+values	O
+in	O
+any	O
+available	O
+time	B-KEY
+series	I-KEY
+.	O
+At	O
+the	O
+end	O
+,	O
+we	O
+will	O
+look	O
+at	O
+some	O
+real-life	O
+problems	O
+of	O
+prediction	B-KEY
+in	O
+order	O
+to	O
+see	O
+the	O
+power	O
+of	O
+this	O
+new	O
+approach	O
+
+The	O
+development	O
+of	O
+CASC	B-KEY
+-LSB-	O
+automated	B-KEY
+theorem	I-KEY
+proving	I-KEY
+-RSB-	O
+Researchers	O
+who	O
+make	O
+theoretical	O
+advances	O
+also	O
+need	O
+some	O
+way	O
+to	O
+demonstrate	O
+that	O
+an	O
+advance	O
+really	O
+does	O
+have	O
+general	O
+,	O
+overall	O
+positive	O
+consequences	O
+for	O
+system	B-KEY
+performance	I-KEY
+.	O
+For	O
+this	O
+it	O
+is	O
+necessary	O
+to	O
+evaluate	O
+the	O
+system	O
+on	O
+a	O
+set	O
+of	O
+problems	O
+that	O
+is	O
+sufficiently	O
+large	O
+and	O
+diverse	O
+to	O
+be	O
+somehow	O
+representative	O
+of	O
+the	O
+intended	O
+application	O
+area	O
+as	O
+a	O
+whole	O
+.	O
+It	O
+is	O
+only	O
+a	O
+small	O
+step	O
+from	O
+system	B-KEY
+evaluation	I-KEY
+to	O
+a	O
+communal	O
+system	O
+competition	O
+.	O
+The	O
+CADE	B-KEY
+ATP	I-KEY
+System	I-KEY
+Competition	I-KEY
+-LRB-	O
+CASC	B-KEY
+-RRB-	O
+has	O
+been	O
+run	O
+annually	O
+since	O
+1996	O
+.	O
+Any	O
+competition	O
+is	O
+difficult	O
+to	O
+design	O
+and	O
+organize	O
+in	O
+the	O
+first	O
+instance	O
+,	O
+and	O
+to	O
+then	O
+run	O
+over	O
+the	O
+years	O
+.	O
+In	O
+order	O
+to	O
+obtain	O
+the	O
+full	O
+benefits	O
+of	O
+a	O
+competition	O
+,	O
+a	O
+thoroughly	O
+organized	O
+event	O
+,	O
+with	O
+an	O
+unambiguous	O
+and	O
+motivated	O
+design	O
+,	O
+is	O
+necessary	O
+.	O
+For	O
+some	O
+issues	O
+relevant	O
+to	O
+the	O
+CASC	B-KEY
+design	O
+,	O
+inevitable	O
+constraints	O
+have	O
+emerged	O
+.	O
+For	O
+other	O
+issues	O
+there	O
+have	O
+been	O
+several	O
+choices	O
+,	O
+and	O
+decisions	O
+have	O
+had	O
+to	O
+be	O
+made	O
+.	O
+This	O
+paper	O
+describes	O
+the	O
+evolution	O
+of	O
+CASC	B-KEY
+,	O
+paying	O
+particular	O
+attention	O
+to	O
+its	O
+design	O
+,	O
+design	O
+changes	O
+,	O
+and	O
+organization	O
+
+Dependence	B-KEY
+graphs	I-KEY
+:	O
+dependence	O
+within	O
+and	O
+between	O
+groups	O
+This	O
+paper	O
+applies	O
+the	O
+two-party	B-KEY
+dependence	I-KEY
+theory	I-KEY
+-LRB-	O
+Castelfranchi	O
+,	O
+Cesta	O
+and	O
+Miceli	O
+,	O
+1992	O
+,	O
+in	O
+Y.	O
+Demazeau	O
+and	O
+E.	O
+Werner	O
+-LRB-	O
+Eds	O
+.	O
+-RRB-	O
+Decentralized	O
+AI-3	O
+,	O
+Elsevier	O
+,	O
+North	O
+Holland	O
+-RRB-	O
+to	O
+modelling	O
+multiagent	O
+and	O
+group	B-KEY
+dependence	I-KEY
+.	O
+These	O
+have	O
+theoretical	O
+potentialities	O
+for	O
+the	O
+study	O
+of	O
+emerging	B-KEY
+groups	I-KEY
+and	O
+collective	B-KEY
+structures	I-KEY
+,	O
+and	O
+more	O
+generally	O
+for	O
+understanding	O
+social	O
+and	O
+organisational	B-KEY
+complexity	I-KEY
+,	O
+and	O
+practical	O
+utility	O
+for	O
+both	O
+social-organisational	O
+and	O
+agent	B-KEY
+systems	I-KEY
+purposes	O
+.	O
+In	O
+the	O
+paper	O
+,	O
+the	O
+dependence	O
+theory	O
+is	O
+extended	O
+to	O
+describe	O
+multiagent	O
+links	O
+,	O
+with	O
+a	O
+special	O
+reference	O
+to	O
+group	O
+and	O
+collective	O
+phenomena	O
+,	O
+and	O
+is	O
+proposed	O
+as	O
+a	O
+framework	O
+for	O
+the	O
+study	O
+of	O
+emerging	O
+social	O
+structures	O
+,	O
+such	O
+as	O
+groups	O
+and	O
+collectives	O
+.	O
+In	O
+order	O
+to	O
+do	O
+so	O
+,	O
+we	O
+propose	O
+to	O
+extend	O
+the	O
+notion	O
+of	O
+dependence	B-KEY
+networks	I-KEY
+-LRB-	O
+applied	O
+to	O
+a	O
+single	O
+agent	O
+-RRB-	O
+to	O
+dependence	B-KEY
+graphs	I-KEY
+-LRB-	O
+applied	O
+to	O
+an	O
+agency	O
+-RRB-	O
+.	O
+In	O
+its	O
+present	O
+version	O
+,	O
+the	O
+dependence	O
+theory	O
+is	O
+argued	O
+to	O
+provide	O
+-LRB-	O
+a	O
+-RRB-	O
+a	O
+theoretical	O
+instrument	O
+for	O
+the	O
+study	O
+of	O
+social	B-KEY
+complexity	I-KEY
+,	O
+and	O
+-LRB-	O
+b	O
+-RRB-	O
+a	O
+computational	O
+system	O
+for	O
+managing	O
+the	O
+negotiation	O
+process	O
+in	O
+competitive	O
+contexts	O
+and	O
+for	O
+monitoring	O
+complexity	O
+in	O
+organisational	O
+and	O
+other	O
+cooperative	O
+contexts	O
+
+Advanced	B-KEY
+aerostatic	I-KEY
+stability	I-KEY
+analysis	I-KEY
+of	O
+cable-stayed	B-KEY
+bridges	I-KEY
+using	O
+finite-element	O
+method	O
+Based	O
+on	O
+the	O
+concept	O
+of	O
+limit	B-KEY
+point	I-KEY
+instability	I-KEY
+,	O
+an	O
+advanced	O
+nonlinear	O
+finite-element	O
+method	O
+that	O
+can	O
+be	O
+used	O
+to	O
+analyze	O
+the	O
+aerostatic	O
+stability	O
+of	O
+cable-stayed	B-KEY
+bridges	I-KEY
+is	O
+proposed	O
+.	O
+Both	O
+geometric	B-KEY
+nonlinearity	I-KEY
+and	O
+three	O
+components	O
+of	O
+wind	B-KEY
+loads	I-KEY
+are	O
+considered	O
+in	O
+this	O
+method	O
+.	O
+The	O
+example	O
+bridge	O
+is	O
+the	O
+second	O
+Santou	O
+Bay	O
+cable-stayed	B-KEY
+bridge	I-KEY
+with	O
+a	O
+main	O
+span	O
+length	O
+of	O
+518	O
+m	O
+built	O
+in	O
+China	O
+.	O
+Aerostatic	O
+stability	O
+of	O
+the	O
+example	O
+bridge	O
+is	O
+investigated	O
+using	O
+linear	O
+and	O
+proposed	O
+methods	O
+.	O
+The	O
+effect	O
+of	O
+pitch	B-KEY
+moment	I-KEY
+coefficient	I-KEY
+on	O
+the	O
+aerostatic	O
+stability	O
+of	O
+the	O
+bridge	O
+has	O
+been	O
+studied	O
+.	O
+The	O
+results	O
+show	O
+that	O
+the	O
+aerostatic	O
+instability	O
+analyses	O
+of	O
+cable-stayed	B-KEY
+bridges	I-KEY
+based	O
+on	O
+the	O
+linear	O
+method	O
+considerably	O
+overestimate	O
+the	O
+wind-resisting	O
+capacity	O
+of	O
+cable-stayed	B-KEY
+bridges	I-KEY
+.	O
+The	O
+proposed	O
+method	O
+is	O
+highly	O
+accurate	O
+and	O
+efficient	O
+.	O
+Pitch	B-KEY
+moment	I-KEY
+coefficient	I-KEY
+has	O
+a	O
+major	O
+effect	O
+on	O
+the	O
+aerostatic	O
+stability	O
+of	O
+cable-stayed	B-KEY
+bridges	I-KEY
+.	O
+Finally	O
+,	O
+the	O
+aerostatic	B-KEY
+failure	I-KEY
+mechanism	I-KEY
+of	O
+cable-stayed	B-KEY
+bridges	I-KEY
+is	O
+explained	O
+by	O
+tracing	O
+the	O
+aerostatic	O
+instability	O
+path	O
+
+Ant	B-KEY
+colony	I-KEY
+optimization	I-KEY
+and	O
+stochastic	B-KEY
+gradient	I-KEY
+descent	I-KEY
+We	O
+study	O
+the	O
+relationship	O
+between	O
+the	O
+two	O
+techniques	O
+known	O
+as	O
+ant	B-KEY
+colony	I-KEY
+optimization	I-KEY
+-LRB-	O
+ACO	O
+-RRB-	O
+and	O
+stochastic	B-KEY
+gradient	I-KEY
+descent	I-KEY
+.	O
+More	O
+precisely	O
+,	O
+we	O
+show	O
+that	O
+some	O
+empirical	B-KEY
+ACO	I-KEY
+algorithms	I-KEY
+approximate	O
+stochastic	B-KEY
+gradient	I-KEY
+descent	I-KEY
+in	O
+the	O
+space	O
+of	O
+pheromones	B-KEY
+,	O
+and	O
+we	O
+propose	O
+an	O
+implementation	O
+of	O
+stochastic	B-KEY
+gradient	I-KEY
+descent	I-KEY
+that	O
+belongs	O
+to	O
+the	O
+family	O
+of	O
+ACO	O
+algorithms	O
+.	O
+We	O
+then	O
+use	O
+this	O
+insight	O
+to	O
+explore	O
+the	O
+mutual	O
+contributions	O
+of	O
+the	O
+two	O
+techniques	O
+
+Performance	B-KEY
+,	O
+design	O
+and	O
+control	O
+of	O
+a	O
+series-parallel	O
+-LRB-	O
+CL/sup	O
+2	O
+/	O
+-	O
+type	O
+-RRB-	O
+resonant	O
+DC/DC	O
+converter	O
+The	O
+three-element	B-KEY
+resonant	I-KEY
+network	I-KEY
+has	O
+various	O
+topological	O
+alternatives	O
+,	O
+one	O
+of	O
+which	O
+,	O
+a	O
+prospective	O
+compound	O
+topology	O
+,	O
+is	O
+investigated	O
+in	O
+detail	O
+.	O
+The	O
+converter	O
+uses	O
+one	O
+capacitor	B-KEY
+-LRB-	O
+C	O
+-RRB-	O
+and	O
+two	O
+inductors	B-KEY
+-LRB-	O
+L/sup	O
+2	O
+/	O
+-RRB-	O
+,	O
+to	O
+form	O
+a	O
+compound	O
+type	O
+CL/sup	O
+2	O
+/	O
+network	O
+.	O
+Various	O
+advantages	O
+and	O
+limitations	O
+of	O
+the	O
+converter	O
+are	O
+detailed	O
+,	O
+and	O
+a	O
+new	O
+design	B-KEY
+procedure	I-KEY
+for	O
+such	O
+converters	O
+is	O
+also	O
+introduced	O
+.	O
+The	O
+converter	O
+may	O
+be	O
+controlled	O
+by	O
+varying	O
+the	O
+switching	B-KEY
+frequency	I-KEY
+or	O
+by	O
+pulse-width	B-KEY
+modulation	I-KEY
+.	O
+An	O
+experimental	O
+prototype	O
+has	O
+been	O
+produced	O
+and	O
+an	O
+excellent	O
+performance	B-KEY
+in	O
+the	O
+lagging	O
+power-factor	O
+mode	O
+has	O
+been	O
+confirmed	O
+
+Transformation	O
+rules	O
+and	O
+strategies	O
+for	O
+functional-logic	B-KEY
+programs	I-KEY
+This	O
+paper	O
+abstracts	O
+the	O
+contents	O
+of	O
+a	O
+PhD	O
+dissertation	O
+entitled	O
+`	O
+Transformation	O
+Rules	O
+and	O
+Strategies	O
+for	O
+Functional-Logic	B-KEY
+Programs	I-KEY
+'	O
+which	O
+has	O
+been	O
+recently	O
+defended	O
+.	O
+These	O
+techniques	O
+are	O
+based	O
+on	O
+fold/unfold	O
+transformations	O
+and	O
+they	O
+can	O
+be	O
+used	O
+to	O
+optimize	O
+integrated	O
+-LRB-	O
+functional-logic	O
+-RRB-	O
+programs	O
+for	O
+a	O
+wide	O
+class	O
+of	O
+applications	O
+.	O
+Experimental	B-KEY
+results	I-KEY
+show	O
+that	O
+typical	O
+examples	O
+in	O
+the	O
+field	O
+of	O
+artificial	B-KEY
+intelligence	I-KEY
+are	O
+successfully	O
+enhanced	O
+by	O
+our	O
+transformation	O
+system	O
+SYNTH	B-KEY
+.	O
+The	O
+thesis	O
+presents	O
+the	O
+first	O
+approach	O
+of	O
+these	O
+methods	O
+for	O
+declarative	B-KEY
+languages	I-KEY
+that	O
+integrate	O
+the	O
+best	O
+features	O
+from	O
+functional	O
+and	O
+logic	B-KEY
+programming	I-KEY
+
+A	O
+humane	B-KEY
+tool	I-KEY
+for	O
+aiding	O
+computer	B-KEY
+science	I-KEY
+advisors	I-KEY
+,	O
+computer	B-KEY
+science	I-KEY
+students	I-KEY
+,	O
+and	O
+parents	B-KEY
+Over	O
+the	O
+past	O
+few	O
+years	O
+,	O
+the	O
+computer	O
+science	O
+department	O
+faculty	O
+at	O
+Baylor	O
+has	O
+observed	O
+that	O
+some	O
+students	O
+who	O
+perform	O
+adequately	O
+during	O
+the	O
+freshman	O
+and	O
+sophomore	B-KEY
+years	I-KEY
+have	O
+substantial	O
+difficulty	O
+during	O
+the	O
+junior	O
+and	O
+senior	O
+years	O
+of	O
+study	O
+.	O
+Baylor	B-KEY
+University	I-KEY
+is	O
+an	O
+institution	O
+committed	O
+to	O
+being	O
+caring	O
+of	O
+its	O
+students	O
+.	O
+The	O
+objective	O
+for	O
+this	O
+study	O
+grew	O
+out	O
+of	O
+these	O
+two	O
+realities	O
+.	O
+There	O
+are	O
+three	O
+objectives	O
+of	O
+this	O
+research	O
+.	O
+One	O
+objective	O
+is	O
+to	O
+identify	O
+students	O
+,	O
+no	O
+later	O
+than	O
+the	O
+sophomore	B-KEY
+year	I-KEY
+,	O
+who	O
+are	O
+less	O
+likely	O
+to	O
+succeed	O
+as	O
+computer	B-KEY
+science	I-KEY
+majors	I-KEY
+.	O
+A	O
+second	O
+objective	O
+is	O
+to	O
+accomplish	O
+this	O
+identification	O
+by	O
+using	O
+data	O
+from	O
+seniors	O
+majoring	O
+in	O
+computer	O
+science	O
+.	O
+A	O
+third	O
+objective	O
+is	O
+to	O
+begin	O
+to	O
+use	O
+this	O
+information	O
+at	O
+the	O
+end	O
+of	O
+their	O
+sophomore	B-KEY
+year	I-KEY
+when	O
+meeting	O
+with	O
+a	O
+computer	O
+science	O
+faculty	O
+advisor	O
+.	O
+A	O
+regression	B-KEY
+study	I-KEY
+is	O
+conducted	O
+on	O
+the	O
+data	O
+from	O
+all	O
+students	O
+classified	O
+as	O
+seniors	O
+,	O
+majoring	O
+in	O
+computer	O
+science	O
+in	O
+May	O
+2001	O
+,	O
+showing	O
+grades	O
+in	O
+six	O
+freshman	O
+and	O
+sophomore	O
+courses	O
+,	O
+and	O
+showing	O
+grades	O
+for	O
+at	O
+least	O
+five	O
+junior	O
+or	O
+senior	O
+level	O
+computer	O
+science	O
+courses	O
+.	O
+These	O
+students	O
+and	O
+their	O
+course	B-KEY
+performance	I-KEY
+data	I-KEY
+constituted	O
+the	O
+study	O
+sample	O
+
+Tax	O
+forms	O
+:	O
+CD	O
+or	O
+not	O
+CD	O
+?	O
+The	O
+move	O
+from	O
+CD	O
+to	O
+the	O
+Web	B-KEY
+looks	O
+unstoppable	O
+.	O
+Besides	O
+counting	O
+how	O
+many	O
+thousands	O
+of	O
+electronic	B-KEY
+tax	I-KEY
+forms	I-KEY
+they	O
+offer	O
+,	O
+vendors	O
+are	O
+rapidly	O
+moving	O
+those	O
+documents	O
+to	O
+the	O
+Web	B-KEY
+
+Modeling	O
+and	O
+simulating	O
+practices	O
+,	O
+a	O
+work	O
+method	O
+for	O
+work	O
+systems	O
+design	O
+Work	O
+systems	O
+involve	O
+people	O
+engaging	O
+in	O
+activities	O
+over	O
+time-not	O
+just	O
+with	O
+each	O
+other	O
+,	O
+but	O
+also	O
+with	O
+machines	O
+,	O
+tools	O
+,	O
+documents	O
+,	O
+and	O
+other	O
+artifacts	O
+.	O
+These	O
+activities	O
+often	O
+produce	O
+goods	O
+,	O
+services	O
+,	O
+or-as	O
+is	O
+the	O
+case	O
+in	O
+the	O
+work	O
+system	O
+described	O
+in	O
+this	O
+article-scientific	O
+data	O
+.	O
+Work	O
+systems	O
+and	O
+work	O
+practice	O
+evolve	O
+slowly	O
+over	O
+time	O
+.	O
+The	O
+integration	O
+and	O
+use	O
+of	O
+technology	O
+,	O
+the	O
+distribution	O
+and	O
+collocation	O
+of	O
+people	O
+,	O
+organizational	O
+roles	O
+and	O
+procedures	O
+,	O
+and	O
+the	O
+facilities	O
+where	O
+the	O
+work	O
+occurs	O
+largely	O
+determine	O
+this	O
+evolution	O
+
+Taming	O
+the	O
+paper	O
+tiger	O
+-LSB-	O
+paperwork	B-KEY
+organization	I-KEY
+-RSB-	O
+Generally	O
+acknowledged	O
+as	O
+a	O
+critical	O
+problem	O
+for	O
+many	O
+information	B-KEY
+professionals	I-KEY
+,	O
+the	O
+massive	O
+flow	O
+of	O
+documents	O
+,	O
+paper	O
+trails	O
+,	O
+and	O
+information	O
+needs	O
+efficient	O
+and	O
+dependable	O
+approaches	O
+for	O
+processing	O
+and	O
+storing	O
+and	O
+finding	O
+items	O
+and	O
+information	O
+
+A	O
+six-degree-of-freedom	B-KEY
+precision	I-KEY
+motion	I-KEY
+stage	I-KEY
+This	O
+article	O
+presents	O
+the	O
+design	B-KEY
+and	O
+performance	B-KEY
+evaluation	I-KEY
+of	O
+a	O
+six-degree-of-freedom	O
+piezoelectrically	B-KEY
+actuated	I-KEY
+fine	I-KEY
+motion	I-KEY
+stage	I-KEY
+that	O
+will	O
+be	O
+used	O
+for	O
+three	O
+dimensional	O
+error	O
+compensation	O
+of	O
+a	O
+long-range	B-KEY
+translation	I-KEY
+mechanism	I-KEY
+.	O
+Development	O
+of	O
+a	O
+single	O
+element	O
+,	O
+piezoelectric	O
+linear	O
+displacement	O
+actuator	O
+capable	O
+of	O
+translations	O
+of	O
+1.67	O
+mu	O
+m	O
+with	O
+900	B-KEY
+V	I-KEY
+potential	O
+across	O
+the	O
+electrodes	O
+and	O
+under	O
+a	O
+27.4	O
+N	O
+axial	O
+load	O
+and	O
+0.5	O
+mm	O
+lateral	O
+distortion	O
+is	O
+presented	O
+.	O
+Finite	B-KEY
+element	I-KEY
+methods	I-KEY
+have	O
+been	O
+developed	O
+and	O
+used	O
+to	O
+evaluate	O
+resonant	B-KEY
+frequencies	I-KEY
+of	O
+the	O
+stage	B-KEY
+platform	I-KEY
+and	O
+the	O
+complete	O
+assembly	O
+with	O
+and	O
+without	O
+a	O
+platform	B-KEY
+payload	I-KEY
+.	O
+In	O
+general	O
+,	O
+an	O
+error	O
+of	O
+approximately	O
+10.0	O
+%	O
+between	O
+the	O
+finite	O
+element	O
+results	O
+and	O
+the	O
+experimentally	O
+measured	O
+values	O
+were	O
+observed	O
+.	O
+The	O
+complete	O
+fine	O
+motion	O
+stage	O
+provided	O
+approximately	O
++	O
+or-0	O
+.93	O
+mu	O
+m	O
+of	O
+translation	O
+and	O
++	O
+or-38	O
+.0	O
+mu	O
+rad	O
+of	O
+rotation	O
+in	O
+all	O
+three	O
+planes	O
+of	O
+motion	O
+using	O
+an	O
+excitation	O
+range	O
+of	O
+1000	B-KEY
+V	I-KEY
+.	O
+An	O
+impulse	B-KEY
+response	I-KEY
+indicating	O
+a	O
+fundamental	B-KEY
+mode	I-KEY
+resonance	I-KEY
+at	O
+162	B-KEY
+Hz	I-KEY
+was	O
+measured	O
+with	O
+a	O
+0.650	O
+kg	O
+payload	O
+rigidly	O
+mounted	O
+to	O
+the	O
+top	O
+of	O
+the	O
+stage	O
+
+Product	B-KEY
+development	I-KEY
+:	O
+using	O
+a	O
+3D	B-KEY
+computer	I-KEY
+model	I-KEY
+to	O
+optimize	O
+the	O
+stability	O
+of	O
+the	O
+Rocket	B-KEY
+TM	I-KEY
+powered	I-KEY
+wheelchair	I-KEY
+A	O
+three-dimensional	O
+-LRB-	O
+3D	O
+-RRB-	O
+lumped-parameter	O
+model	O
+of	O
+a	O
+powered	O
+wheelchair	O
+was	O
+created	O
+to	O
+aid	O
+the	O
+development	O
+of	O
+the	O
+Rocket	O
+prototype	O
+wheelchair	O
+and	O
+to	O
+help	O
+explore	O
+the	O
+effect	O
+of	O
+innovative	B-KEY
+design	I-KEY
+features	I-KEY
+on	O
+its	O
+stability	O
+.	O
+The	O
+model	O
+was	O
+developed	O
+using	O
+simulation	O
+software	O
+,	O
+specifically	O
+Working	O
+Model	O
+3D	O
+.	O
+The	O
+accuracy	O
+of	O
+the	O
+model	O
+was	O
+determined	O
+by	O
+comparing	O
+both	O
+its	O
+static	O
+stability	O
+angles	O
+and	O
+dynamic	O
+behavior	O
+as	O
+it	O
+passed	O
+down	O
+a	O
+4.8-cm	O
+-LRB-	O
+1.9	O
+''	O
+-RRB-	O
+road	O
+curb	O
+at	O
+a	O
+heading	O
+of	O
+45	O
+degrees	O
+with	O
+the	O
+performance	O
+of	O
+the	O
+actual	O
+wheelchair	O
+.	O
+The	O
+model	O
+'s	O
+predictions	O
+of	O
+the	O
+static	O
+stability	O
+angles	O
+in	O
+the	O
+forward	O
+,	O
+rearward	O
+,	O
+and	O
+lateral	O
+directions	O
+were	O
+within	O
+9.3	O
+,	O
+7.1	O
+,	O
+and	O
+3.8	O
+%	O
+of	O
+the	O
+measured	O
+values	O
+,	O
+respectively	O
+.	O
+The	O
+average	B-KEY
+absolute	I-KEY
+error	I-KEY
+in	O
+the	O
+predicted	B-KEY
+position	I-KEY
+of	O
+the	O
+wheelchair	O
+as	O
+it	O
+moved	O
+down	O
+the	O
+curb	O
+was	O
+2.2	O
+cm/m	O
+-LRB-	O
+0.9	O
+''	O
+per	O
+3	O
+'	O
+3	O
+''	O
+-RRB-	O
+traveled	O
+.	O
+The	O
+accuracy	O
+was	O
+limited	O
+by	O
+the	O
+inability	O
+to	O
+model	O
+soft	O
+bodies	O
+,	O
+the	O
+inherent	O
+difficulties	O
+in	O
+modeling	O
+a	O
+statically	B-KEY
+indeterminate	I-KEY
+system	I-KEY
+,	O
+and	O
+the	O
+computing	B-KEY
+time	I-KEY
+.	O
+Nevertheless	O
+,	O
+it	O
+was	O
+found	O
+to	O
+be	O
+useful	O
+in	O
+investigating	O
+the	O
+effect	O
+of	O
+eight	O
+design	O
+alterations	O
+on	O
+the	O
+lateral	O
+stability	O
+of	O
+the	O
+wheelchair	O
+.	O
+Stability	O
+was	O
+quantified	O
+by	O
+determining	O
+the	O
+static	O
+lateral	O
+stability	O
+angles	O
+and	O
+the	O
+maximum	O
+height	O
+of	O
+a	O
+road	O
+curb	O
+over	O
+which	O
+the	O
+wheelchair	O
+could	O
+successfully	O
+drive	O
+on	O
+a	O
+diagonal	B-KEY
+heading	I-KEY
+.	O
+The	O
+model	O
+predicted	O
+that	O
+the	O
+stability	O
+was	O
+more	O
+dependent	O
+on	O
+the	O
+configuration	O
+of	O
+the	O
+suspension	O
+system	O
+than	O
+on	O
+the	O
+dimensions	O
+and	O
+weight	B-KEY
+distribution	I-KEY
+of	O
+the	O
+wheelchair	O
+.	O
+Furthermore	O
+,	O
+for	O
+the	O
+situations	O
+and	O
+design	O
+alterations	O
+studied	O
+,	O
+predicted	O
+improvements	O
+in	O
+static	O
+stability	O
+were	O
+not	O
+correlated	O
+with	O
+improvements	O
+in	O
+dynamic	O
+stability	O
+
+Stability	B-KEY
+of	O
+Runge-Kutta	B-KEY
+methods	I-KEY
+for	O
+delay	B-KEY
+integro-differential	I-KEY
+equations	I-KEY
+We	O
+study	O
+stability	B-KEY
+of	O
+Runge-Kutta	O
+-LRB-	O
+RK	O
+-RRB-	O
+methods	O
+for	O
+delay	B-KEY
+integro-differential	I-KEY
+equations	I-KEY
+with	O
+a	O
+constant	B-KEY
+delay	I-KEY
+on	O
+the	O
+basis	O
+of	O
+the	O
+linear	O
+equation	O
+du/dt	O
+=	O
+Lu	O
+-LRB-	O
+t	O
+-RRB-	O
++	O
+Mu	O
+-LRB-	O
+t	O
+-	O
+tau	O
+-RRB-	O
++	O
+K	O
+integral	O
+/	O
+sub	O
+t	O
+-	O
+tau	O
+/	O
+/	O
+sup	O
+t	O
+/	O
+u	O
+-LRB-	O
+theta	O
+-RRB-	O
+d	O
+theta	O
+,	O
+where	O
+L	O
+,	O
+M	O
+,	O
+K	O
+are	O
+constant	O
+complex	O
+matrices	O
+.	O
+In	O
+particular	O
+,	O
+we	O
+show	O
+that	O
+the	O
+same	O
+result	O
+as	O
+in	O
+the	O
+case	O
+K	O
+=	O
+0	O
+-LRB-	O
+Koto	O
+,	O
+1994	O
+-RRB-	O
+holds	O
+for	O
+this	O
+test	O
+equation	O
+,	O
+i.e.	O
+,	O
+every	O
+A-stable	O
+RK	O
+method	O
+preserves	O
+the	O
+delay-independent	O
+stability	B-KEY
+of	O
+the	O
+exact	O
+solution	O
+whenever	O
+a	O
+step-size	O
+of	O
+the	O
+form	O
+h	O
+=	O
+tau	O
+/	O
+m	O
+is	O
+used	O
+,	O
+where	O
+m	O
+is	O
+a	O
+positive	O
+integer	O
+
+Least	B-KEY
+load	I-KEY
+dispatching	I-KEY
+algorithm	I-KEY
+for	O
+parallel	B-KEY
+Web	I-KEY
+server	I-KEY
+nodes	I-KEY
+A	O
+least	B-KEY
+load	I-KEY
+dispatching	I-KEY
+algorithm	I-KEY
+for	O
+distributing	O
+requests	O
+to	O
+parallel	B-KEY
+Web	I-KEY
+server	I-KEY
+nodes	I-KEY
+is	O
+described	O
+.	O
+In	O
+this	O
+algorithm	O
+,	O
+the	O
+load	O
+offered	O
+to	O
+a	O
+node	O
+by	O
+a	O
+request	O
+is	O
+estimated	O
+based	O
+on	O
+the	O
+expected	O
+transfer	B-KEY
+time	I-KEY
+of	O
+the	O
+corresponding	O
+reply	O
+through	O
+the	O
+Internet	B-KEY
+.	O
+This	O
+loading	O
+information	O
+is	O
+then	O
+used	O
+by	O
+the	O
+algorithm	O
+to	O
+identify	O
+the	O
+least	O
+load	O
+node	O
+of	O
+the	O
+Web	O
+site	O
+.	O
+By	O
+using	O
+this	O
+algorithm	O
+,	O
+each	O
+request	O
+will	O
+always	O
+be	O
+sent	O
+for	O
+service	O
+at	O
+the	O
+earliest	O
+possible	O
+time	O
+.	O
+Performance	O
+comparison	O
+using	O
+NASA	O
+and	O
+ClarkNet	B-KEY
+access	I-KEY
+logs	I-KEY
+between	O
+the	O
+proposed	O
+algorithm	O
+and	O
+commonly	O
+used	O
+dispatching	O
+algorithms	O
+is	O
+performed	O
+.	O
+The	O
+results	O
+show	O
+that	O
+the	O
+proposed	O
+algorithm	O
+gives	O
+10	O
+%	O
+higher	O
+throughput	B-KEY
+than	O
+that	O
+of	O
+the	O
+commonly	O
+used	O
+random	O
+and	O
+round-robin	B-KEY
+dispatching	I-KEY
+algorithms	I-KEY
+
+Data	B-KEY
+mining	I-KEY
+efforts	O
+increase	O
+business	O
+productivity	B-KEY
+and	O
+efficiency	B-KEY
+The	O
+use	O
+and	O
+acquisition	O
+of	O
+information	O
+is	O
+a	O
+key	O
+part	O
+of	O
+the	O
+way	O
+any	O
+business	O
+makes	O
+money	O
+.	O
+Data	B-KEY
+mining	I-KEY
+technologies	O
+provide	O
+greater	O
+insight	O
+into	O
+how	O
+this	O
+information	O
+can	O
+be	O
+better	O
+used	O
+and	O
+more	O
+effectively	O
+acquired	O
+.	O
+Steven	O
+Kudyba	O
+,	O
+an	O
+expert	O
+in	O
+the	O
+field	O
+of	O
+data	B-KEY
+mining	I-KEY
+technologies	O
+,	O
+shares	O
+his	O
+expertise	O
+in	O
+an	O
+interview	O
+
+A	O
+characterization	O
+of	O
+generalized	B-KEY
+Pareto	I-KEY
+distributions	I-KEY
+by	O
+progressive	B-KEY
+censoring	I-KEY
+schemes	I-KEY
+and	O
+goodness-of-fit	B-KEY
+tests	I-KEY
+In	O
+this	O
+paper	O
+we	O
+generalize	O
+a	O
+characterization	O
+property	O
+of	O
+generalized	B-KEY
+Pareto	I-KEY
+distributions	I-KEY
+,	O
+which	O
+is	O
+known	O
+for	O
+ordinary	B-KEY
+order	I-KEY
+statistics	I-KEY
+,	O
+to	O
+arbitrary	O
+schemes	O
+of	O
+progressive	B-KEY
+type-II	I-KEY
+censored	I-KEY
+order	I-KEY
+statistics	I-KEY
+.	O
+Various	O
+goodness-of-fit	B-KEY
+tests	I-KEY
+for	O
+generalized	B-KEY
+Pareto	I-KEY
+distributions	I-KEY
+based	O
+on	O
+progressively	O
+censored	O
+data	O
+statistics	O
+are	O
+discussed	O
+
+Nonlinear	B-KEY
+adaptive	I-KEY
+control	I-KEY
+via	O
+sliding-mode	O
+state	O
+and	O
+perturbation	B-KEY
+observer	I-KEY
+The	O
+paper	O
+presents	O
+a	O
+nonlinear	B-KEY
+adaptive	I-KEY
+controller	I-KEY
+-LRB-	O
+NAC	B-KEY
+-RRB-	O
+for	O
+single-input	O
+single-output	O
+feedback	O
+linearisable	O
+nonlinear	O
+systems	O
+.	O
+A	O
+sliding-mode	O
+state	O
+and	O
+perturbation	B-KEY
+observer	I-KEY
+is	O
+designed	O
+to	O
+estimate	O
+the	O
+system	O
+states	O
+and	O
+perturbation	O
+which	O
+includes	O
+the	O
+combined	O
+effect	O
+of	O
+system	O
+nonlinearities	O
+,	O
+uncertainties	O
+and	O
+external	B-KEY
+disturbances	I-KEY
+.	O
+The	O
+NAC	B-KEY
+design	O
+does	O
+not	O
+require	O
+the	O
+details	O
+of	O
+the	O
+nonlinear	O
+system	O
+model	O
+and	O
+full	O
+system	O
+states	O
+.	O
+It	O
+possesses	O
+an	O
+adaptation	O
+capability	O
+to	O
+deal	O
+with	O
+system	O
+parameter	B-KEY
+uncertainties	I-KEY
+,	O
+unmodelled	B-KEY
+system	I-KEY
+dynamics	I-KEY
+and	O
+external	B-KEY
+disturbances	I-KEY
+.	O
+The	O
+convergence	B-KEY
+of	O
+the	O
+observer	O
+and	O
+the	O
+stability	O
+analysis	O
+of	O
+the	O
+controller/observer	O
+system	O
+are	O
+given	O
+.	O
+The	O
+proposed	O
+control	O
+scheme	O
+is	O
+applied	O
+for	O
+control	O
+of	O
+a	O
+synchronous	O
+generator	O
+,	O
+in	O
+comparison	O
+with	O
+a	O
+state-feedback	B-KEY
+linearising	I-KEY
+controller	I-KEY
+-LRB-	O
+FLC	B-KEY
+-RRB-	O
+.	O
+Simulation	O
+study	O
+is	O
+carried	O
+out	O
+based	O
+on	O
+a	O
+single-generator	B-KEY
+infinite-bus	I-KEY
+power	I-KEY
+system	I-KEY
+to	O
+show	O
+the	O
+performance	O
+of	O
+the	O
+controller/observer	O
+system	O
+
+Driving	O
+the	O
+NKK	B-KEY
+Smartswitch	I-KEY
+.2	O
+.	O
+Graphics	O
+and	O
+text	B-KEY
+Whether	O
+your	O
+message	B-KEY
+is	O
+one	O
+of	O
+workplace	O
+safety	O
+or	O
+world	O
+peace	O
+,	O
+the	O
+long	O
+nights	O
+of	O
+brooding	O
+over	O
+ways	O
+to	O
+tell	O
+the	O
+world	O
+are	O
+over	O
+.	O
+Part	O
+1	O
+described	O
+the	O
+basic	O
+interface	O
+to	O
+drive	O
+the	O
+Smartswitch	O
+.	O
+Part	O
+2	O
+adds	O
+the	O
+bells	O
+and	O
+whistles	O
+to	O
+allow	O
+both	O
+text	B-KEY
+and	O
+messages	B-KEY
+to	O
+be	O
+placed	O
+anywhere	O
+on	O
+the	O
+screen	O
+.	O
+It	O
+considers	O
+character	B-KEY
+generation	I-KEY
+,	O
+graphic	B-KEY
+generation	I-KEY
+and	O
+the	O
+user	B-KEY
+interface	I-KEY
+
+Copyright	O
+of	O
+electronic	O
+publishing	O
+With	O
+the	O
+spreading	O
+of	O
+the	O
+Internet	B-KEY
+and	O
+the	O
+wide	O
+use	O
+of	O
+computers	O
+,	O
+electronic	O
+publishing	O
+is	O
+becoming	O
+an	O
+indispensable	O
+measure	O
+to	O
+gain	O
+knowledge	O
+and	O
+skills	O
+.	O
+Meanwhile	O
+,	O
+copyright	O
+is	O
+facing	O
+much	O
+more	O
+infringement	O
+than	O
+ever	O
+in	O
+this	O
+electronic	B-KEY
+environment	I-KEY
+.	O
+So	O
+,	O
+it	O
+is	O
+a	O
+key	O
+factor	O
+to	O
+effectively	O
+protect	O
+copyright	O
+of	O
+electronic	O
+publishing	O
+to	O
+foster	O
+the	O
+new	O
+publication	O
+fields	O
+.	O
+The	O
+paper	O
+analyzes	O
+the	O
+importance	O
+of	O
+copyright	O
+,	O
+the	O
+main	O
+causes	O
+for	O
+copyright	B-KEY
+infringement	I-KEY
+in	O
+electronic	O
+publishing	O
+,	O
+and	O
+presents	O
+viewpoints	O
+on	O
+the	O
+definition	O
+and	O
+application	O
+of	O
+fair	B-KEY
+use	I-KEY
+of	O
+a	O
+copyrighted	B-KEY
+work	I-KEY
+and	O
+thinking	O
+of	O
+some	O
+means	O
+to	O
+combat	O
+breach	O
+of	O
+copyright	O
+
+Knowledge	B-KEY
+model	I-KEY
+reuse	I-KEY
+:	O
+therapy	O
+decision	O
+through	O
+specialisation	O
+of	O
+a	O
+generic	O
+decision	O
+model	O
+We	O
+present	O
+the	O
+definition	O
+of	O
+the	O
+therapy	B-KEY
+decision	I-KEY
+task	I-KEY
+and	O
+its	O
+associated	O
+Heuristic	O
+Multi-Attribute	O
+-LRB-	O
+HM	O
+-RRB-	O
+solving	O
+method	O
+,	O
+in	O
+the	O
+form	O
+of	O
+a	O
+KADS-style	B-KEY
+specification	I-KEY
+.	O
+The	O
+goal	O
+of	O
+the	O
+therapy	B-KEY
+decision	I-KEY
+task	I-KEY
+is	O
+to	O
+identify	O
+the	O
+ideal	O
+therapy	O
+,	O
+for	O
+a	O
+given	O
+patient	O
+,	O
+in	O
+accordance	O
+with	O
+a	O
+set	O
+of	O
+objectives	O
+of	O
+a	O
+diverse	O
+nature	O
+constituting	O
+a	O
+global	B-KEY
+therapy-evaluation	I-KEY
+framework	I-KEY
+in	O
+which	O
+considerations	O
+such	O
+as	O
+patient	B-KEY
+preferences	I-KEY
+and	O
+quality-of-life	O
+results	O
+are	O
+integrated	O
+.	O
+We	O
+give	O
+a	O
+high-level	O
+overview	O
+of	O
+this	O
+task	O
+as	O
+a	O
+specialisation	O
+of	O
+the	O
+generic	O
+decision	O
+task	O
+,	O
+and	O
+additional	O
+decomposition	O
+methods	O
+for	O
+the	O
+subtasks	O
+involved	O
+.	O
+These	O
+subtasks	O
+possess	O
+some	O
+reflective	O
+capabilities	O
+for	O
+reasoning	B-KEY
+about	O
+self-models	O
+,	O
+particularly	O
+the	O
+learning	B-KEY
+subtask	I-KEY
+,	O
+which	O
+incrementally	O
+corrects	O
+and	O
+refines	O
+the	O
+model	O
+used	O
+to	O
+assess	O
+the	O
+effects	O
+of	O
+the	O
+therapies	O
+.	O
+This	O
+work	O
+illustrates	O
+the	O
+process	O
+of	O
+reuse	O
+in	O
+the	O
+framework	O
+of	O
+AI	O
+software	B-KEY
+development	I-KEY
+methodologies	I-KEY
+such	O
+as	O
+KADS-CommonKADS	O
+in	O
+order	O
+to	O
+obtain	O
+new	O
+-LRB-	O
+more	O
+specialised	O
+but	O
+still	O
+generic	O
+-RRB-	O
+components	O
+for	O
+the	O
+analysis	O
+libraries	O
+developed	O
+in	O
+this	O
+context	O
+.	O
+In	O
+order	O
+to	O
+maximise	O
+reuse	O
+benefits	O
+,	O
+where	O
+possible	O
+,	O
+the	O
+therapy	B-KEY
+decision	I-KEY
+task	I-KEY
+and	O
+HM	O
+method	O
+have	O
+been	O
+defined	O
+in	O
+terms	O
+of	O
+regular	O
+components	O
+from	O
+the	O
+earlier-mentioned	O
+libraries	O
+.	O
+To	O
+emphasise	O
+the	O
+importance	O
+of	O
+using	O
+a	O
+rigorous	O
+approach	O
+to	O
+the	O
+modelling	O
+of	O
+domain	O
+and	O
+method	O
+ontologies	B-KEY
+,	O
+we	O
+make	O
+extensive	O
+use	O
+of	O
+the	O
+semi-formal	O
+object-oriented	B-KEY
+analysis	I-KEY
+notation	I-KEY
+UML	B-KEY
+,	O
+together	O
+with	O
+its	O
+associated	O
+constraint	B-KEY
+language	I-KEY
+OCL	B-KEY
+,	O
+to	O
+illustrate	O
+the	O
+ontology	B-KEY
+of	O
+the	O
+decision	O
+method	O
+and	O
+the	O
+corresponding	O
+specific	O
+one	O
+of	O
+the	O
+therapy	O
+decision	O
+domain	O
+,	O
+the	O
+latter	O
+being	O
+a	O
+refinement	O
+via	O
+inheritance	O
+of	O
+the	O
+former	O
+
+Solution	O
+of	O
+the	O
+reconstruction	O
+problem	O
+of	O
+a	O
+source	O
+function	O
+in	O
+the	O
+coagulation-fragmentation	O
+equation	O
+We	O
+study	O
+the	O
+problem	O
+of	O
+reconstructing	O
+a	O
+source	O
+function	O
+in	O
+the	O
+kinetic	B-KEY
+coagulation-fragmentation	I-KEY
+equation	I-KEY
+.	O
+The	O
+study	O
+is	O
+based	O
+on	O
+optimal	B-KEY
+control	I-KEY
+methods	I-KEY
+,	O
+the	O
+solvability	B-KEY
+theory	O
+of	O
+operator	B-KEY
+equations	I-KEY
+,	O
+and	O
+the	O
+use	O
+of	O
+iteration	B-KEY
+algorithms	I-KEY
+
+Too	O
+much	O
+middleware	O
+The	O
+movement	O
+from	O
+client-server	B-KEY
+computing	I-KEY
+to	O
+multi-tier	B-KEY
+computing	I-KEY
+has	O
+created	O
+a	O
+potpourri	O
+of	O
+so-called	O
+middleware	B-KEY
+systems	I-KEY
+,	O
+including	O
+application	B-KEY
+servers	I-KEY
+,	O
+workflow	B-KEY
+products	I-KEY
+,	O
+EAI	B-KEY
+systems	I-KEY
+,	O
+ETL	B-KEY
+systems	I-KEY
+and	O
+federated	B-KEY
+data	I-KEY
+systems	I-KEY
+.	O
+We	O
+argue	O
+that	O
+the	O
+explosion	O
+in	O
+middleware	O
+has	O
+created	O
+a	O
+myriad	O
+of	O
+poorly	B-KEY
+integrated	I-KEY
+systems	I-KEY
+with	O
+overlapping	B-KEY
+functionality	I-KEY
+.	O
+The	O
+world	O
+would	O
+be	O
+well	O
+served	O
+by	O
+considerable	O
+consolidation	O
+,	O
+and	O
+we	O
+present	O
+some	O
+of	O
+the	O
+ways	O
+this	O
+might	O
+happen	O
+.	O
+Some	O
+of	O
+the	O
+points	O
+covered	O
+in	O
+the	O
+article	O
+have	O
+been	O
+previously	O
+explored	O
+by	O
+P.	O
+Bernstein	O
+-LRB-	O
+1996	O
+-RRB-	O
+
+Tool	O
+and	O
+process	O
+improvements	O
+from	O
+MFC	B-KEY
+control	I-KEY
+system	I-KEY
+technology	I-KEY
+A	O
+new	O
+approach	O
+to	O
+MFC	O
+calibration	B-KEY
+links	O
+the	O
+physical	O
+parameters	O
+of	O
+nitrogen	O
+to	O
+the	O
+physical	O
+characteristics	O
+of	O
+various	O
+process	O
+gases	O
+.	O
+This	O
+precludes	O
+the	O
+conventional	O
+need	O
+for	O
+surrogate	O
+gases	O
+.	O
+What	O
+results	O
+is	O
+a	O
+physics-based	O
+tuning	B-KEY
+algorithm	I-KEY
+and	O
+enhanced	O
+digital	B-KEY
+control	I-KEY
+system	O
+that	O
+enables	O
+rearranging	O
+and	O
+gas	O
+change	O
+of	O
+digital	O
+MFCs	O
+.	O
+The	O
+end	O
+result	O
+should	O
+be	O
+better	O
+process	B-KEY
+control	I-KEY
+through	O
+more	O
+accurate	O
+gas	B-KEY
+flow	I-KEY
+.	O
+The	O
+new	O
+method	O
+also	O
+decreases	O
+the	O
+number	O
+of	O
+MFC	O
+spare	O
+parts	O
+required	O
+to	O
+back	O
+up	O
+a	O
+fab	O
+
+Development	O
+through	O
+gaming	O
+Mainstream	O
+observers	O
+commonly	O
+underestimate	O
+the	O
+role	O
+of	O
+fringe	O
+activities	O
+in	O
+propelling	O
+science	O
+and	O
+technology	O
+.	O
+Well-known	O
+examples	O
+are	O
+how	O
+wars	O
+have	O
+fostered	O
+innovation	O
+in	O
+areas	O
+such	O
+as	O
+communications	O
+,	O
+cryptography	O
+,	O
+medicine	O
+and	O
+aerospace	O
+;	O
+and	O
+how	O
+erotica	O
+has	O
+been	O
+a	O
+major	O
+factor	O
+in	O
+pioneering	O
+visual	O
+media	O
+,	O
+from	O
+the	O
+first	O
+printed	O
+books	O
+to	O
+photography	O
+,	O
+cinematography	O
+,	O
+videotape	O
+,	O
+or	O
+the	O
+latest	O
+online	O
+video	O
+streaming	O
+.	O
+The	O
+article	O
+aims	O
+to	O
+be	O
+a	O
+sampler	O
+of	O
+a	O
+less	O
+controversial	O
+,	O
+but	O
+still	O
+often	O
+underrated	O
+,	O
+symbiosis	O
+between	O
+scientific	B-KEY
+computing	I-KEY
+and	O
+computing	O
+for	O
+leisure	B-KEY
+and	O
+entertainment	B-KEY
+
+Statistical	O
+analysis	O
+of	O
+nonlinearly	O
+reconstructed	O
+near-infrared	O
+tomographic	O
+images	O
+.	O
+I.	O
+Theory	O
+and	O
+simulations	O
+Near-infrared	O
+-LRB-	O
+NIR	O
+-RRB-	O
+diffuse	O
+tomography	O
+is	O
+an	O
+emerging	O
+method	O
+for	O
+imaging	O
+the	O
+interior	O
+of	O
+tissues	O
+to	O
+quantify	O
+concentrations	O
+of	O
+hemoglobin	B-KEY
+and	O
+exogenous	O
+chromophores	O
+noninvasively	O
+in	O
+vivo	O
+.	O
+It	O
+often	O
+exploits	O
+an	O
+optical	B-KEY
+diffusion	I-KEY
+model-based	I-KEY
+image	I-KEY
+reconstruction	I-KEY
+algorithm	I-KEY
+to	O
+estimate	O
+spatial	O
+property	O
+values	O
+from	O
+measurements	O
+of	O
+the	O
+light	B-KEY
+flux	I-KEY
+at	O
+the	O
+surface	O
+of	O
+the	O
+tissue	O
+.	O
+In	O
+this	O
+study	O
+,	O
+mean-squared	B-KEY
+error	I-KEY
+-LRB-	O
+MSE	O
+-RRB-	O
+over	O
+the	O
+image	O
+is	O
+used	O
+to	O
+evaluate	O
+methods	O
+for	O
+regularizing	O
+the	O
+ill-posed	O
+inverse	O
+image	O
+reconstruction	O
+problem	O
+in	O
+NIR	O
+tomography	O
+.	O
+Estimates	O
+of	O
+image	O
+bias	O
+and	O
+image	O
+standard	O
+deviation	O
+were	O
+calculated	O
+based	O
+upon	O
+100	O
+repeated	O
+reconstructions	O
+of	O
+a	O
+test	B-KEY
+image	I-KEY
+with	O
+randomly	B-KEY
+distributed	I-KEY
+noise	I-KEY
+added	O
+to	O
+the	O
+light	B-KEY
+flux	I-KEY
+measurements	O
+.	O
+It	O
+was	O
+observed	O
+that	O
+the	O
+bias	B-KEY
+error	I-KEY
+dominates	O
+at	O
+high	O
+regularization	O
+parameter	O
+values	O
+while	O
+variance	O
+dominates	O
+as	O
+the	O
+algorithm	O
+is	O
+allowed	O
+to	O
+approach	O
+the	O
+optimal	B-KEY
+solution	I-KEY
+.	O
+This	O
+optimum	O
+does	O
+not	O
+necessarily	O
+correspond	O
+to	O
+the	O
+minimum	O
+projection	O
+error	O
+solution	O
+,	O
+but	O
+typically	O
+requires	O
+further	O
+iteration	O
+with	O
+a	O
+decreasing	B-KEY
+regularization	I-KEY
+parameter	I-KEY
+to	O
+reach	O
+the	O
+lowest	B-KEY
+image	I-KEY
+error	I-KEY
+.	O
+Increasing	O
+measurement	O
+noise	O
+causes	O
+a	O
+need	O
+to	O
+constrain	O
+the	O
+minimum	O
+regularization	O
+parameter	O
+to	O
+higher	O
+values	O
+in	O
+order	O
+to	O
+achieve	O
+a	O
+minimum	O
+in	O
+the	O
+overall	O
+image	O
+MSE	O
+
+Natural	B-KEY
+language	I-KEY
+from	O
+artificial	B-KEY
+life	I-KEY
+This	O
+article	O
+aims	O
+to	O
+show	O
+that	O
+linguistics	B-KEY
+,	O
+in	O
+particular	O
+the	O
+study	O
+of	O
+the	O
+lexico-syntactic	B-KEY
+aspects	I-KEY
+of	O
+language	O
+,	O
+provides	O
+fertile	O
+ground	O
+for	O
+artificial	B-KEY
+life	I-KEY
+modeling	O
+.	O
+A	O
+survey	O
+of	O
+the	O
+models	O
+that	O
+have	O
+been	O
+developed	O
+over	O
+the	O
+last	O
+decade	O
+and	O
+a	O
+half	O
+is	O
+presented	O
+to	O
+demonstrate	O
+that	O
+ALife	B-KEY
+techniques	O
+have	O
+a	O
+lot	O
+to	O
+offer	O
+an	O
+explanatory	O
+theory	O
+of	O
+language	O
+.	O
+It	O
+is	O
+argued	O
+that	O
+this	O
+is	O
+because	O
+much	O
+of	O
+the	O
+structure	O
+of	O
+language	O
+is	O
+determined	O
+by	O
+the	O
+interaction	O
+of	O
+three	O
+complex	O
+adaptive	B-KEY
+systems	I-KEY
+:	O
+learning	B-KEY
+,	O
+culture	B-KEY
+,	O
+and	O
+biological	B-KEY
+evolution	I-KEY
+.	O
+Computational	B-KEY
+simulation	I-KEY
+,	O
+informed	O
+by	O
+theoretical	O
+linguistics	B-KEY
+,	O
+is	O
+an	O
+appropriate	O
+response	O
+to	O
+the	O
+challenge	O
+of	O
+explaining	O
+real	O
+linguistic	B-KEY
+data	O
+in	O
+terms	O
+of	O
+the	O
+processes	O
+that	O
+underpin	O
+human	O
+language	O
+
+Pitch	B-KEY
+post-processing	I-KEY
+technique	I-KEY
+based	O
+on	O
+robust	B-KEY
+statistics	I-KEY
+A	O
+novel	O
+pitch	B-KEY
+post-processing	I-KEY
+technique	I-KEY
+based	O
+on	O
+robust	B-KEY
+statistics	I-KEY
+is	O
+proposed	O
+.	O
+Performances	O
+in	O
+terms	O
+of	O
+pitch	B-KEY
+error	I-KEY
+rates	I-KEY
+and	O
+pitch	B-KEY
+contours	I-KEY
+show	O
+the	O
+superiority	O
+of	O
+the	O
+proposed	O
+method	O
+compared	O
+with	O
+the	O
+median	B-KEY
+filtering	I-KEY
+technique	O
+.	O
+Further	O
+improvement	O
+is	O
+achieved	O
+through	O
+incorporating	O
+an	O
+uncertainty	B-KEY
+term	I-KEY
+in	O
+the	O
+robust	B-KEY
+statistics	I-KEY
+model	O
+
+Risk	B-KEY
+theory	I-KEY
+with	O
+a	O
+nonlinear	B-KEY
+dividend	I-KEY
+barrier	I-KEY
+In	O
+the	O
+framework	O
+of	O
+classical	O
+risk	B-KEY
+theory	I-KEY
+we	O
+investigate	O
+a	O
+surplus	B-KEY
+process	I-KEY
+in	O
+the	O
+presence	O
+of	O
+a	O
+nonlinear	B-KEY
+dividend	I-KEY
+barrier	I-KEY
+and	O
+derive	O
+equations	O
+for	O
+two	O
+characteristics	O
+of	O
+such	O
+a	O
+process	O
+,	O
+the	O
+probability	B-KEY
+of	I-KEY
+survival	I-KEY
+and	O
+the	O
+expected	O
+sum	O
+of	O
+discounted	B-KEY
+dividend	I-KEY
+payments	I-KEY
+.	O
+Number-theoretic	B-KEY
+solution	I-KEY
+techniques	O
+are	O
+developed	O
+for	O
+approximating	O
+these	O
+quantities	O
+and	O
+numerical	B-KEY
+illustrations	I-KEY
+are	O
+given	O
+for	O
+exponential	B-KEY
+claim	I-KEY
+sizes	I-KEY
+and	O
+a	O
+parabolic	B-KEY
+dividend	I-KEY
+barrier	I-KEY
+
+Analysis	O
+of	O
+exclusively	B-KEY
+kinetic	I-KEY
+two-link	I-KEY
+underactuated	I-KEY
+mechanical	I-KEY
+systems	I-KEY
+Analysis	O
+of	O
+exclusively	B-KEY
+kinetic	I-KEY
+two-link	I-KEY
+underactuated	I-KEY
+mechanical	I-KEY
+systems	I-KEY
+is	O
+undertaken	O
+.	O
+It	O
+is	O
+first	O
+shown	O
+that	O
+such	O
+systems	O
+are	O
+not	O
+full-state	O
+feedback	O
+linearizable	O
+around	O
+any	O
+equilibrium	B-KEY
+point	I-KEY
+.	O
+Also	O
+,	O
+the	O
+equilibrium	B-KEY
+points	I-KEY
+for	O
+which	O
+the	O
+system	O
+is	O
+small-time	O
+locally	O
+controllable	O
+-LRB-	O
+STLC	O
+-RRB-	O
+is	O
+at	O
+most	O
+a	O
+one-dimensional	B-KEY
+submanifold	I-KEY
+.	O
+A	O
+concept	O
+less	O
+restrictive	O
+than	O
+STLC	O
+,	O
+termed	O
+the	O
+small-time	B-KEY
+local	I-KEY
+output	I-KEY
+controllability	I-KEY
+-LRB-	O
+STLOC	O
+-RRB-	O
+is	O
+introduced	O
+,	O
+the	O
+satisfaction	O
+of	O
+which	O
+guarantees	O
+that	O
+a	O
+chosen	O
+configuration	O
+output	O
+can	O
+be	O
+controlled	O
+at	O
+its	O
+desired	O
+value	O
+.	O
+It	O
+is	O
+shown	O
+that	O
+the	O
+class	O
+of	O
+systems	O
+considered	O
+is	O
+STLOC	O
+,	O
+if	O
+the	O
+inertial	O
+coupling	O
+between	O
+the	O
+input	O
+and	O
+output	O
+is	O
+nonzero	O
+.	O
+Also	O
+,	O
+in	O
+such	O
+a	O
+case	O
+,	O
+the	O
+system	O
+is	O
+nonminimum	B-KEY
+phase	I-KEY
+.	O
+An	O
+example	O
+section	O
+illustrates	O
+all	O
+the	O
+results	O
+presented	O
+
+Optimal	B-KEY
+time	I-KEY
+of	O
+switching	O
+between	O
+portfolios	B-KEY
+of	I-KEY
+securities	I-KEY
+Optimal	B-KEY
+time	I-KEY
+of	O
+switching	O
+between	O
+several	O
+portfolios	B-KEY
+of	I-KEY
+securities	I-KEY
+are	O
+found	O
+for	O
+the	O
+purpose	O
+of	O
+profit	B-KEY
+maximization	I-KEY
+.	O
+Two	O
+methods	O
+of	O
+their	O
+determination	O
+are	O
+considered	O
+.	O
+The	O
+cases	O
+with	O
+three	O
+and	O
+n	O
+portfolios	O
+are	O
+studied	O
+in	O
+detail	O
+
+Laptops	B-KEY
+zip	O
+to	O
+2	O
+GHz-plus	O
+Intel	O
+'s	O
+Pentium	O
+4-M	O
+processor	O
+has	O
+reached	O
+the	O
+coveted	O
+2-GHz	O
+mark	O
+,	O
+and	O
+speed-hungry	O
+mobile	B-KEY
+users	O
+will	O
+be	O
+tempted	O
+to	O
+buy	O
+a	O
+laptop	B-KEY
+with	O
+the	O
+chip	O
+.	O
+However	O
+,	O
+while	O
+our	O
+exclusive	O
+tests	O
+found	O
+2-GHz	O
+P4-M	O
+notebooks	B-KEY
+among	O
+the	O
+fastest	O
+units	O
+we	O
+'ve	O
+tested	O
+,	O
+the	O
+new	O
+models	O
+failed	O
+to	O
+make	O
+dramatic	O
+gains	O
+compared	O
+with	O
+those	O
+based	O
+on	O
+Intel	O
+'s	O
+1.8-GHz	O
+mobile	B-KEY
+chip	O
+.	O
+Since	O
+2-GHz	O
+notebooks	B-KEY
+carry	O
+a	O
+hefty	O
+price	O
+premium	O
+,	O
+buyers	O
+seeking	O
+both	O
+good	O
+performance	O
+and	O
+a	O
+good	O
+price	O
+might	O
+prefer	O
+a	O
+1.8-GHz	O
+unit	O
+instead	O
+
+The	O
+development	O
+and	O
+evaluation	O
+of	O
+a	O
+fuzzy	B-KEY
+logic	I-KEY
+expert	I-KEY
+system	I-KEY
+for	O
+renal	B-KEY
+transplantation	I-KEY
+assignment	I-KEY
+:	O
+Is	O
+this	O
+a	O
+useful	O
+tool	O
+?	O
+Allocating	O
+donor	B-KEY
+kidneys	I-KEY
+to	O
+patients	O
+is	O
+a	O
+complex	O
+,	O
+multicriteria	B-KEY
+decision-making	I-KEY
+problem	I-KEY
+which	O
+involves	O
+not	O
+only	O
+medical	O
+,	O
+but	O
+also	O
+ethical	O
+and	O
+political	O
+issues	O
+.	O
+In	O
+this	O
+paper	O
+,	O
+a	O
+fuzzy	B-KEY
+logic	I-KEY
+expert	I-KEY
+system	I-KEY
+approach	O
+was	O
+proposed	O
+as	O
+an	O
+innovative	O
+way	O
+to	O
+deal	O
+with	O
+the	O
+vagueness	O
+and	O
+complexity	O
+faced	O
+by	O
+medical	O
+doctors	O
+in	O
+kidney	B-KEY
+allocation	I-KEY
+decision	I-KEY
+making	I-KEY
+.	O
+A	O
+pilot	O
+fuzzy	B-KEY
+logic	I-KEY
+expert	I-KEY
+system	I-KEY
+for	O
+kidney	O
+allocation	O
+was	O
+developed	O
+and	O
+evaluated	O
+in	O
+comparison	O
+with	O
+two	O
+existing	O
+allocation	O
+algorithms	O
+:	O
+a	O
+priority	B-KEY
+sorting	I-KEY
+system	I-KEY
+used	O
+by	O
+multiple	O
+organ	O
+retrieval	O
+and	O
+exchange	O
+-LRB-	O
+MORE	O
+-RRB-	O
+in	O
+Canada	O
+and	O
+a	O
+point	B-KEY
+scoring	I-KEY
+systems	I-KEY
+used	O
+by	O
+united	B-KEY
+network	I-KEY
+for	I-KEY
+organ	I-KEY
+sharing	I-KEY
+-LRB-	O
+UNOS	O
+-RRB-	O
+in	O
+US	O
+.	O
+Our	O
+simulated	B-KEY
+experiment	I-KEY
+based	O
+on	O
+real	O
+data	O
+indicated	O
+that	O
+the	O
+fuzzy	O
+logic	O
+system	O
+can	O
+represent	O
+the	O
+expert	O
+'s	O
+thinking	O
+well	O
+in	O
+handling	O
+complex	O
+tradeoffs	O
+,	O
+and	O
+overall	O
+,	O
+the	O
+fuzzy	O
+logic	O
+derived	O
+recommendations	O
+were	O
+more	O
+acceptable	O
+to	O
+the	O
+expert	O
+than	O
+those	O
+from	O
+the	O
+MORE	O
+and	O
+UNOS	O
+algorithms	O
+
+Approximate	B-KEY
+relaxed	I-KEY
+descent	I-KEY
+method	I-KEY
+for	O
+optimal	B-KEY
+control	I-KEY
+problems	I-KEY
+We	O
+consider	O
+an	O
+optimal	B-KEY
+control	I-KEY
+problem	I-KEY
+for	O
+systems	O
+governed	O
+by	O
+ordinary	B-KEY
+differential	I-KEY
+equations	I-KEY
+with	O
+control	O
+constraints	O
+.	O
+Since	O
+no	O
+convexity	O
+assumptions	O
+are	O
+made	O
+on	O
+the	O
+data	O
+,	O
+the	O
+problem	O
+is	O
+reformulated	O
+in	O
+relaxed	O
+form	O
+.	O
+The	O
+relaxed	O
+state	O
+equation	O
+is	O
+discretized	O
+by	O
+the	O
+implicit	B-KEY
+trapezoidal	I-KEY
+scheme	I-KEY
+and	O
+the	O
+relaxed	O
+controls	O
+are	O
+approximated	O
+by	O
+piecewise	O
+constant	O
+relaxed	O
+controls	O
+.	O
+We	O
+then	O
+propose	O
+a	O
+combined	O
+descent	O
+and	O
+discretization	O
+method	O
+that	O
+generates	O
+sequences	O
+of	O
+discrete	O
+relaxed	O
+controls	O
+and	O
+progressively	O
+refines	O
+the	O
+discretization	O
+.	O
+Since	O
+here	O
+the	O
+adjoint	O
+of	O
+the	O
+discrete	B-KEY
+state	I-KEY
+equation	I-KEY
+is	O
+not	O
+defined	O
+,	O
+we	O
+use	O
+,	O
+at	O
+each	O
+iteration	O
+,	O
+an	O
+approximate	O
+derivative	O
+of	O
+the	O
+cost	O
+functional	O
+defined	O
+by	O
+discretizing	O
+the	O
+continuous	O
+adjoint	O
+equation	O
+and	O
+the	O
+integral	O
+involved	O
+by	O
+appropriate	O
+trapezoidal	B-KEY
+schemes	I-KEY
+.	O
+It	O
+is	O
+proved	O
+that	O
+accumulation	O
+points	O
+of	O
+sequences	O
+constructed	O
+by	O
+this	O
+method	O
+satisfy	O
+the	O
+strong	O
+relaxed	O
+necessary	O
+conditions	O
+for	O
+optimality	O
+for	O
+the	O
+continuous	O
+problem	O
+.	O
+Finally	O
+,	O
+the	O
+computed	O
+relaxed	O
+controls	O
+can	O
+be	O
+easily	O
+approximated	O
+by	O
+piecewise	O
+constant	O
+classical	O
+controls	O
+
+An	O
+algorithm	B-KEY
+combining	O
+neural	B-KEY
+networks	I-KEY
+with	O
+fundamental	B-KEY
+parameters	I-KEY
+An	O
+algorithm	B-KEY
+combining	O
+neural	B-KEY
+networks	I-KEY
+with	O
+the	O
+fundamental	B-KEY
+parameters	I-KEY
+equations	O
+-LRB-	O
+NNFP	O
+-RRB-	O
+is	O
+proposed	O
+for	O
+making	O
+corrections	O
+for	O
+non-linear	O
+matrix	O
+effects	O
+in	O
+x-ray	O
+fluorescence	O
+analysis	O
+.	O
+In	O
+the	O
+algorithm	B-KEY
+,	O
+neural	B-KEY
+networks	I-KEY
+were	O
+applied	O
+to	O
+relate	O
+the	O
+concentrations	O
+of	O
+components	O
+to	O
+both	O
+the	O
+measured	O
+intensities	B-KEY
+and	O
+the	O
+relative	O
+theoretical	O
+intensities	B-KEY
+calculated	O
+by	O
+the	O
+fundamental	B-KEY
+parameter	I-KEY
+equations	O
+.	O
+The	O
+NNFP	B-KEY
+algorithm	I-KEY
+is	O
+compared	O
+with	O
+the	O
+classical	O
+theoretical	O
+correction	O
+models	O
+,	O
+including	O
+the	O
+fundamental	O
+parameters	O
+approach	O
+,	O
+the	O
+Lachance-Traill	O
+model	O
+,	O
+a	O
+hyperbolic	O
+function	O
+model	O
+and	O
+the	O
+COLA	O
+algorithm	O
+.	O
+For	O
+an	O
+alloy	B-KEY
+system	I-KEY
+with	O
+15	O
+measured	O
+elements	O
+,	O
+in	O
+most	O
+cases	O
+,	O
+the	O
+prediction	O
+errors	O
+of	O
+the	O
+NNFP	B-KEY
+algorithm	I-KEY
+are	O
+lower	O
+than	O
+those	O
+of	O
+the	O
+fundamental	O
+parameters	O
+approach	O
+,	O
+the	O
+Lachance-Traill	O
+model	O
+,	O
+the	O
+hyperbolic	O
+function	O
+model	O
+and	O
+the	O
+COLA	O
+algorithm	O
+separately	O
+.	O
+If	O
+there	O
+are	O
+the	O
+serious	O
+matrix	O
+effects	O
+,	O
+such	O
+as	O
+matrix	O
+effects	O
+among	O
+Cr	B-KEY
+,	O
+Fe	B-KEY
+and	O
+Ni	B-KEY
+,	O
+the	O
+NNFP	B-KEY
+algorithm	I-KEY
+generally	O
+decreased	O
+predictive	O
+errors	O
+as	O
+compared	O
+with	O
+the	O
+classical	O
+models	O
+,	O
+except	O
+for	O
+the	O
+case	O
+of	O
+Cr	O
+by	O
+the	O
+fundamental	O
+parameters	O
+approach	O
+.	O
+The	O
+main	O
+reason	O
+why	O
+the	O
+NNFP	B-KEY
+algorithm	I-KEY
+has	O
+generally	O
+a	O
+better	O
+predictive	O
+ability	O
+than	O
+the	O
+classical	O
+theoretical	O
+correction	O
+models	O
+might	O
+be	O
+that	O
+neural	O
+networks	O
+can	O
+better	O
+calibrate	O
+the	O
+non-linear	O
+matrix	O
+effects	O
+in	O
+a	O
+complex	O
+multivariate	O
+system	O
+
+Hypothesis-based	B-KEY
+concept	I-KEY
+assignment	I-KEY
+in	O
+software	B-KEY
+maintenance	I-KEY
+Software	B-KEY
+maintenance	I-KEY
+accounts	O
+for	O
+a	O
+significant	O
+proportion	O
+of	O
+the	O
+lifetime	B-KEY
+cost	I-KEY
+of	O
+a	O
+software	O
+system	O
+.	O
+Software	O
+comprehension	O
+is	O
+required	O
+in	O
+many	O
+parts	O
+of	O
+the	O
+maintenance	O
+process	O
+and	O
+is	O
+one	O
+of	O
+the	O
+most	O
+expensive	O
+activities	O
+.	O
+Many	O
+tools	O
+have	O
+been	O
+developed	O
+to	O
+help	O
+the	O
+maintainer	O
+reduce	O
+the	O
+time	O
+and	O
+cost	O
+of	O
+this	O
+task	O
+,	O
+but	O
+of	O
+the	O
+numerous	O
+tools	O
+and	O
+methods	O
+available	O
+one	O
+group	O
+has	O
+received	O
+relatively	O
+little	O
+attention	O
+:	O
+those	O
+using	O
+plausible	O
+reasoning	O
+to	O
+address	O
+the	O
+concept	O
+assignment	O
+problem	O
+.	O
+We	O
+present	O
+a	O
+concept	O
+assignment	O
+method	O
+for	O
+COBOL	B-KEY
+II	I-KEY
+:	O
+hypothesis-based	B-KEY
+concept	I-KEY
+assignment	I-KEY
+-LRB-	O
+HB-CA	O
+-RRB-	O
+.	O
+An	O
+implementation	O
+of	O
+a	O
+prototype	O
+tool	O
+is	O
+described	O
+,	O
+and	O
+results	O
+from	O
+a	O
+comprehensive	O
+evaluation	O
+using	O
+commercial	O
+COBOL	B-KEY
+II	I-KEY
+sources	O
+are	O
+summarised	O
+.	O
+In	O
+particular	O
+,	O
+we	O
+identify	O
+areas	O
+of	O
+a	O
+standard	O
+maintenance	O
+process	O
+where	O
+such	O
+methods	O
+would	O
+be	O
+appropriate	O
+,	O
+and	O
+discuss	O
+the	O
+potential	O
+cost	O
+savings	O
+that	O
+may	O
+result	O
+
+Quantized-State	O
+Systems	O
+:	O
+A	O
+DEVS-approach	O
+for	O
+continuous	O
+system	O
+simulation	O
+A	O
+new	O
+class	O
+of	O
+dynamical	B-KEY
+systems	I-KEY
+,	O
+Quantized	B-KEY
+State	I-KEY
+Systems	I-KEY
+or	O
+QSS	O
+,	O
+is	O
+introduced	O
+in	O
+this	O
+paper	O
+.	O
+QSS	O
+are	O
+continuous	B-KEY
+time	I-KEY
+systems	I-KEY
+where	O
+the	O
+input	O
+trajectories	O
+are	O
+piecewise	B-KEY
+constant	I-KEY
+functions	I-KEY
+and	O
+the	O
+state	O
+variable	O
+trajectories	O
+-	O
+being	O
+themselves	O
+piecewise	O
+linear	O
+functions	O
+-	O
+are	O
+converted	O
+into	O
+piecewise	B-KEY
+constant	I-KEY
+functions	I-KEY
+via	O
+a	O
+quantization	O
+function	O
+equipped	O
+with	O
+hysteresis	O
+.	O
+It	O
+is	O
+shown	O
+that	O
+QSS	O
+can	O
+be	O
+exactly	O
+represented	O
+and	O
+simulated	O
+by	O
+a	O
+discrete	B-KEY
+event	I-KEY
+model	I-KEY
+,	O
+within	O
+the	O
+framework	O
+of	O
+the	O
+DEVS-approach	O
+.	O
+Further	O
+,	O
+it	O
+is	O
+shown	O
+that	O
+QSS	O
+can	O
+be	O
+used	O
+to	O
+approximate	O
+continuous	O
+systems	O
+,	O
+thus	O
+allowing	O
+their	O
+discrete-event	B-KEY
+simulation	I-KEY
+in	O
+opposition	O
+to	O
+the	O
+classical	O
+discrete-time	O
+simulation	O
+.	O
+It	O
+is	O
+also	O
+shown	O
+that	O
+in	O
+an	O
+approximating	O
+QSS	O
+,	O
+some	O
+stability	O
+properties	O
+of	O
+the	O
+original	O
+system	O
+are	O
+conserved	O
+and	O
+the	O
+solutions	O
+of	O
+the	O
+QSS	O
+go	O
+to	O
+the	O
+solutions	O
+of	O
+the	O
+original	O
+system	O
+when	O
+the	O
+quantization	O
+goes	O
+to	O
+zero	O
+
+Breaking	O
+the	O
+myths	O
+of	O
+rewards	B-KEY
+:	O
+an	O
+exploratory	O
+study	O
+of	O
+attitudes	O
+about	O
+knowledge	B-KEY
+sharing	I-KEY
+Many	O
+CEO	O
+and	O
+managers	O
+understand	O
+the	O
+importance	O
+of	O
+knowledge	B-KEY
+sharing	I-KEY
+among	O
+their	O
+employees	O
+and	O
+are	O
+eager	O
+to	O
+introduce	O
+the	O
+knowledge	B-KEY
+management	I-KEY
+paradigm	O
+in	O
+their	O
+organizations	O
+.	O
+However	O
+little	O
+is	O
+known	O
+about	O
+the	O
+determinants	O
+of	O
+the	O
+individual	O
+'s	O
+knowledge	B-KEY
+sharing	I-KEY
+behavior	O
+.	O
+The	O
+purpose	O
+of	O
+this	O
+study	O
+is	O
+to	O
+develop	O
+an	O
+understanding	O
+of	O
+the	O
+factors	O
+affecting	O
+the	O
+individual	O
+'s	O
+knowledge	B-KEY
+sharing	I-KEY
+behavior	O
+in	O
+the	O
+organizational	O
+context	O
+.	O
+The	O
+research	O
+model	O
+includes	O
+various	O
+constructs	O
+based	O
+on	O
+social	B-KEY
+exchange	I-KEY
+theory	I-KEY
+,	O
+self-efficacy	B-KEY
+,	O
+and	O
+theory	B-KEY
+of	I-KEY
+reasoned	I-KEY
+action	I-KEY
+.	O
+Research	O
+results	O
+from	O
+the	O
+field	O
+survey	O
+of	O
+467	O
+employees	O
+of	O
+four	O
+large	O
+,	O
+public	B-KEY
+organizations	I-KEY
+show	O
+that	O
+expected	O
+associations	O
+and	O
+contribution	O
+are	O
+the	O
+major	O
+determinants	O
+of	O
+the	O
+individual	O
+'s	O
+attitude	O
+toward	O
+knowledge	B-KEY
+sharing	I-KEY
+.	O
+Expected	O
+rewards	B-KEY
+,	O
+believed	O
+by	O
+many	O
+to	O
+be	O
+the	O
+most	O
+important	O
+motivating	O
+factor	O
+for	O
+knowledge	B-KEY
+sharing	I-KEY
+,	O
+are	O
+not	O
+significantly	O
+related	O
+to	O
+the	O
+attitude	O
+toward	O
+knowledge	B-KEY
+sharing	I-KEY
+.	O
+As	O
+expected	O
+,	O
+positive	O
+attitude	O
+toward	O
+knowledge	B-KEY
+sharing	I-KEY
+is	O
+found	O
+to	O
+lead	O
+to	O
+positive	O
+intention	O
+to	O
+share	O
+knowledge	O
+and	O
+,	O
+finally	O
+,	O
+to	O
+actual	O
+knowledge	B-KEY
+sharing	I-KEY
+behaviors	O
+
+Eliminating	O
+counterevidence	O
+with	O
+applications	O
+to	O
+accountable	B-KEY
+certificate	O
+management	O
+This	O
+paper	O
+presents	O
+a	O
+method	O
+to	O
+increase	O
+the	O
+accountability	B-KEY
+of	O
+certificate	O
+management	O
+by	O
+making	O
+it	O
+intractable	O
+for	O
+the	O
+certification	B-KEY
+authority	I-KEY
+-LRB-	O
+CA	O
+-RRB-	O
+to	O
+create	O
+contradictory	O
+statements	O
+about	O
+the	O
+validity	O
+of	O
+a	O
+certificate	O
+.	O
+The	O
+core	O
+of	O
+the	O
+method	O
+is	O
+a	O
+new	O
+primitive	O
+,	O
+undeniable	O
+attester	B-KEY
+,	O
+that	O
+allows	O
+someone	O
+to	O
+commit	O
+to	O
+some	O
+set	O
+S	O
+of	O
+bitstrings	B-KEY
+by	O
+publishing	O
+a	O
+short	O
+digest	O
+of	O
+S	O
+and	O
+to	O
+give	O
+attestations	B-KEY
+for	O
+any	O
+x	O
+that	O
+it	O
+is	O
+or	O
+is	O
+not	O
+a	O
+member	O
+of	O
+S	O
+.	O
+Such	O
+an	O
+attestation	B-KEY
+can	O
+be	O
+verified	O
+by	O
+obtaining	O
+in	O
+an	O
+authenticated	O
+way	O
+the	O
+published	B-KEY
+digest	I-KEY
+and	O
+applying	O
+a	O
+verification	B-KEY
+algorithm	I-KEY
+to	O
+the	O
+triple	O
+of	O
+the	O
+bitstring	B-KEY
+,	O
+the	O
+attestation	B-KEY
+and	O
+the	O
+digest	O
+.	O
+The	O
+most	O
+important	O
+feature	O
+of	O
+this	O
+primitive	O
+is	O
+the	O
+intractability	O
+of	O
+creating	O
+two	O
+contradictory	B-KEY
+proofs	I-KEY
+for	O
+the	O
+same	O
+candidate	O
+element	O
+x	O
+and	O
+digest	O
+.	O
+We	O
+give	O
+an	O
+efficient	O
+construction	O
+for	O
+undeniable	O
+attesters	B-KEY
+based	O
+on	O
+authenticated	B-KEY
+search	I-KEY
+trees	I-KEY
+.	O
+We	O
+show	O
+that	O
+the	O
+construction	O
+also	O
+applies	O
+to	O
+sets	O
+of	O
+more	O
+structured	B-KEY
+elements	I-KEY
+.	O
+We	O
+also	O
+show	O
+that	O
+undeniable	O
+attesters	B-KEY
+exist	O
+iff	O
+collision-resistant	B-KEY
+hash	I-KEY
+functions	I-KEY
+exist	O
+
+Quadratic	B-KEY
+interpolation	I-KEY
+on	O
+spheres	O
+Riemannian	O
+quadratics	O
+are	O
+C/sup	O
+1	O
+/	O
+curves	O
+on	O
+Riemannian	B-KEY
+manifolds	I-KEY
+,	O
+obtained	O
+by	O
+performing	O
+the	O
+quadratic	O
+recursive	O
+deCastlejeau	O
+algorithm	O
+in	O
+a	O
+Riemannian	O
+setting	O
+.	O
+They	O
+are	O
+of	O
+interest	O
+for	O
+interpolation	O
+problems	O
+in	O
+Riemannian	B-KEY
+manifolds	I-KEY
+,	O
+such	O
+as	O
+trajectory-planning	B-KEY
+for	O
+rigid	B-KEY
+body	I-KEY
+motion	I-KEY
+.	O
+Some	O
+interpolation	O
+properties	O
+of	O
+Riemannian	O
+quadratics	O
+are	O
+analysed	O
+when	O
+the	O
+ambient	B-KEY
+manifold	I-KEY
+is	O
+a	O
+sphere	O
+or	O
+projective	O
+space	O
+,	O
+with	O
+the	O
+usual	O
+Riemannian	O
+metrics	O
+
+Holding	O
+on	O
+-LSB-	O
+workflow	O
+&	O
+content	O
+management	O
+-RSB-	O
+Marc	O
+Fresko	O
+of	O
+Cornwell	B-KEY
+Management	I-KEY
+Consultants	I-KEY
+says	O
+`	O
+think	O
+ahead	O
+'	O
+when	O
+developing	O
+your	O
+electronic	B-KEY
+records	I-KEY
+management	I-KEY
+policy	I-KEY
+
+Impact	O
+of	O
+user	B-KEY
+satisfaction	I-KEY
+and	O
+trust	B-KEY
+on	O
+virtual	B-KEY
+team	I-KEY
+members	I-KEY
+Pressured	O
+by	O
+the	O
+growing	O
+need	O
+for	O
+fast	O
+response	O
+times	O
+,	O
+mass	O
+customization	O
+,	O
+and	O
+globalization	O
+,	O
+many	O
+organizations	O
+are	O
+turning	O
+to	O
+flexible	O
+organizational	O
+forms	O
+,	O
+such	O
+as	O
+virtual	O
+teams	O
+.	O
+Virtual	O
+teams	O
+consist	O
+of	O
+cooperative	O
+relationships	O
+supported	O
+by	O
+information	B-KEY
+technology	I-KEY
+to	O
+overcome	O
+limitations	O
+of	O
+time	O
+and/or	O
+location	O
+.	O
+Virtual	O
+teams	O
+require	O
+their	O
+members	O
+to	O
+rely	O
+heavily	O
+on	O
+the	O
+use	O
+of	O
+information	B-KEY
+technology	I-KEY
+and	O
+trust	B-KEY
+in	O
+coworkers	O
+.	O
+This	O
+study	O
+investigates	O
+the	O
+impacts	O
+that	O
+the	O
+reliance	O
+on	O
+information	B-KEY
+technology	I-KEY
+-LRB-	O
+operationalized	O
+in	O
+our	O
+study	O
+via	O
+the	O
+user	B-KEY
+satisfaction	I-KEY
+construct	O
+-RRB-	O
+and	O
+trust	B-KEY
+have	O
+on	O
+the	O
+job	B-KEY
+satisfaction	I-KEY
+of	O
+virtual	B-KEY
+team	I-KEY
+members	I-KEY
+.	O
+The	O
+study	O
+findings	O
+reveal	O
+that	O
+both	O
+user	B-KEY
+satisfaction	I-KEY
+and	O
+trust	B-KEY
+are	O
+positively	O
+related	O
+to	O
+job	B-KEY
+satisfaction	I-KEY
+in	O
+virtual	O
+teams	O
+,	O
+while	O
+system	O
+use	O
+was	O
+not	O
+found	O
+to	O
+play	O
+a	O
+significant	O
+role	O
+.	O
+These	O
+findings	O
+emphasize	O
+that	O
+organizations	O
+seeking	O
+the	O
+benefits	O
+of	O
+flexible	O
+,	O
+IT-enabled	O
+virtual	O
+teams	O
+must	O
+consider	O
+both	O
+the	O
+level	O
+of	O
+trust	O
+among	O
+colleagues	O
+,	O
+and	O
+the	O
+users	O
+'	O
+satisfaction	O
+with	O
+the	O
+information	O
+technology	O
+on	O
+which	O
+virtual	O
+teams	O
+rely	O
+
+A	O
+uniform	O
+framework	O
+for	O
+regulating	O
+service	O
+access	O
+and	O
+information	B-KEY
+release	I-KEY
+on	O
+the	O
+Web	O
+The	O
+widespread	O
+use	O
+of	O
+Internet-based	O
+services	O
+is	O
+increasing	O
+the	O
+amount	O
+of	O
+information	O
+-LRB-	O
+such	O
+as	O
+user	O
+profiles	O
+-RRB-	O
+that	O
+clients	O
+are	O
+required	O
+to	O
+disclose	O
+.	O
+This	O
+information	B-KEY
+demand	I-KEY
+is	O
+necessary	O
+for	O
+regulating	O
+access	O
+to	O
+services	O
+,	O
+and	O
+functionally	O
+convenient	O
+-LRB-	O
+e.g.	O
+,	O
+to	O
+support	O
+service	O
+customization	O
+-RRB-	O
+,	O
+but	O
+it	O
+has	O
+raised	O
+privacy-related	O
+concerns	O
+which	O
+,	O
+if	O
+not	O
+addressed	O
+,	O
+may	O
+affect	O
+the	O
+users	O
+disposition	O
+to	O
+use	O
+network	B-KEY
+services	I-KEY
+.	O
+At	O
+the	O
+same	O
+time	O
+,	O
+servers	O
+need	O
+to	O
+regulate	O
+service	O
+access	O
+without	O
+disclosing	O
+entirely	O
+the	O
+details	O
+of	O
+their	O
+access	B-KEY
+control	I-KEY
+policy	I-KEY
+.	O
+There	O
+is	O
+therefore	O
+a	O
+pressing	O
+need	O
+for	O
+privacy-aware	B-KEY
+techniques	I-KEY
+to	O
+regulate	O
+access	O
+to	O
+services	O
+open	O
+to	O
+the	O
+network	O
+.	O
+We	O
+propose	O
+an	O
+approach	O
+for	O
+regulating	O
+service	O
+access	O
+and	O
+information	B-KEY
+disclosure	I-KEY
+on	O
+the	O
+Web	O
+.	O
+The	O
+approach	O
+consists	O
+of	O
+a	O
+uniform	B-KEY
+formal	I-KEY
+framework	I-KEY
+to	O
+formulate	O
+-	O
+and	O
+reason	B-KEY
+about	O
+-	O
+both	O
+service	O
+access	O
+and	O
+information	B-KEY
+disclosure	I-KEY
+constraints	O
+.	O
+It	O
+also	O
+provides	O
+a	O
+means	O
+for	O
+parties	O
+to	O
+communicate	O
+their	O
+requirements	O
+while	O
+ensuring	O
+that	O
+no	O
+private	O
+information	O
+be	O
+disclosed	O
+and	O
+that	O
+the	O
+communicated	O
+requirements	O
+are	O
+correct	O
+with	O
+respect	O
+to	O
+the	O
+constraints	O
+
+Switching	B-KEY
+controller	I-KEY
+design	I-KEY
+via	O
+convex	B-KEY
+polyhedral	I-KEY
+Lyapunov	I-KEY
+functions	I-KEY
+We	O
+propose	O
+a	O
+systematic	O
+switching	B-KEY
+control	I-KEY
+design	I-KEY
+method	O
+for	O
+a	O
+class	O
+of	O
+nonlinear	B-KEY
+discrete	I-KEY
+time	I-KEY
+hybrid	I-KEY
+systems	I-KEY
+.	O
+The	O
+novelty	O
+of	O
+the	O
+adopted	O
+approach	O
+is	O
+in	O
+the	O
+fact	O
+that	O
+unlike	O
+conventional	O
+control	O
+the	O
+control	O
+burden	O
+is	O
+shifted	O
+to	O
+a	O
+logical	O
+level	O
+thus	O
+creating	O
+the	O
+need	O
+for	O
+the	O
+development	O
+of	O
+new	O
+analysis/design	O
+methods	O
+
+A	O
+parareal	O
+in	O
+time	B-KEY
+procedure	I-KEY
+for	O
+the	O
+control	O
+of	O
+partial	O
+differential	O
+equations	O
+We	O
+have	O
+proposed	O
+in	O
+a	O
+previous	O
+note	O
+a	O
+time	B-KEY
+discretization	I-KEY
+for	O
+partial	O
+differential	O
+evolution	B-KEY
+equation	I-KEY
+that	O
+allows	O
+for	O
+parallel	O
+implementations	O
+.	O
+This	O
+scheme	O
+is	O
+here	O
+reinterpreted	O
+as	O
+a	O
+preconditioning	B-KEY
+procedure	I-KEY
+on	O
+an	O
+algebraic	B-KEY
+setting	I-KEY
+of	O
+the	O
+time	B-KEY
+discretization	I-KEY
+.	O
+This	O
+allows	O
+for	O
+extending	O
+the	O
+parallel	O
+methodology	O
+to	O
+the	O
+problem	O
+of	O
+optimal	B-KEY
+control	I-KEY
+for	O
+partial	O
+differential	O
+equations	O
+.	O
+We	O
+report	O
+a	O
+first	O
+numerical	O
+implementation	O
+that	O
+reveals	O
+a	O
+large	O
+interest	O
+
+DEVS	O
+simulation	O
+of	O
+distributed	O
+intrusion	B-KEY
+detection	O
+systems	O
+An	O
+intrusion	B-KEY
+detection	O
+system	O
+-LRB-	O
+IDS	O
+-RRB-	O
+attempts	O
+to	O
+identify	O
+unauthorized	O
+use	O
+,	O
+misuse	O
+,	O
+and	O
+abuse	O
+of	O
+computer	O
+and	O
+network	O
+systems	O
+.	O
+As	O
+intrusions	B-KEY
+become	O
+more	O
+sophisticated	O
+,	O
+dealing	O
+with	O
+them	O
+moves	O
+beyond	O
+the	O
+scope	O
+of	O
+one	O
+IDS	B-KEY
+.	I-KEY
+The	O
+need	O
+arises	O
+for	O
+systems	O
+to	O
+cooperate	O
+with	O
+one	O
+another	O
+,	O
+to	O
+manage	O
+diverse	O
+attacks	O
+across	O
+networks	O
+.	O
+The	O
+feature	O
+of	O
+recent	O
+attacks	O
+is	O
+that	O
+the	O
+packet	O
+delivery	O
+is	O
+moderately	O
+slow	O
+,	O
+and	O
+the	O
+attack	O
+sources	O
+and	O
+attack	O
+targets	O
+are	O
+distributed	O
+.	O
+These	O
+attacks	O
+are	O
+called	O
+``	O
+stealthy	O
+attacks	O
+.	O
+''	O
+To	O
+detect	O
+these	O
+attacks	O
+,	O
+the	O
+deployment	O
+of	O
+distributed	O
+IDSs	O
+is	O
+needed	O
+.	O
+In	O
+such	O
+an	O
+environment	O
+,	O
+the	O
+ability	O
+of	O
+an	O
+IDS	B-KEY
+to	I-KEY
+share	O
+advanced	O
+information	O
+about	O
+these	O
+attacks	O
+is	O
+especially	O
+important	O
+.	O
+In	O
+this	O
+research	O
+,	O
+the	O
+IDS	B-KEY
+model	I-KEY
+exploits	O
+blacklist	O
+facts	O
+to	O
+detect	O
+the	O
+attacks	O
+that	O
+are	O
+based	O
+on	O
+either	O
+slow	O
+or	O
+highly	O
+distributed	O
+packets	O
+.	O
+To	O
+maintain	O
+the	O
+valid	O
+blacklist	O
+facts	O
+in	O
+the	O
+knowledge	O
+base	O
+of	O
+each	O
+IDS	B-KEY
+,	I-KEY
+the	O
+model	O
+should	O
+communicate	O
+with	O
+the	O
+other	O
+IDSs	O
+.	O
+When	O
+attack	O
+level	O
+goes	O
+beyond	O
+the	O
+interaction	O
+threshold	O
+,	O
+ID	O
+agents	O
+send	O
+interaction	O
+messages	O
+to	O
+ID	O
+agents	O
+in	O
+other	O
+hosts	O
+.	O
+Each	O
+agent	O
+model	O
+is	O
+developed	O
+as	O
+an	O
+interruptible	O
+atomic-expert	O
+model	O
+in	O
+which	O
+the	O
+expert	B-KEY
+system	I-KEY
+is	O
+embedded	O
+as	O
+a	O
+model	O
+component	O
+
+Optimal	O
+and	O
+safe	O
+ship	B-KEY
+control	I-KEY
+as	O
+a	O
+multi-step	O
+matrix	O
+game	O
+The	O
+paper	O
+describes	O
+the	O
+process	O
+of	O
+the	O
+safe	O
+ship	B-KEY
+control	I-KEY
+in	O
+a	O
+collision	O
+situation	O
+using	O
+a	O
+differential	B-KEY
+game	I-KEY
+model	O
+with	O
+j	O
+participants	O
+.	O
+As	O
+an	O
+approximated	O
+model	O
+of	O
+the	O
+manoeuvring	O
+process	O
+,	O
+a	O
+model	O
+of	O
+a	O
+multi-step	O
+matrix	O
+game	O
+is	O
+adopted	O
+here	O
+.	O
+RISKTRAJ	B-KEY
+computer	I-KEY
+program	I-KEY
+is	O
+designed	O
+in	O
+the	O
+Matlab	O
+language	O
+in	O
+order	O
+to	O
+determine	O
+the	O
+ship	O
+'s	O
+trajectory	O
+as	O
+a	O
+certain	O
+sequence	O
+of	O
+manoeuvres	O
+executed	O
+by	O
+altering	O
+the	O
+course	O
+and	O
+speed	O
+,	O
+in	O
+the	O
+online	B-KEY
+navigator	I-KEY
+decision	B-KEY
+support	I-KEY
+system	I-KEY
+.	O
+These	O
+considerations	O
+are	O
+illustrated	O
+with	O
+examples	O
+of	O
+a	O
+computer	O
+simulation	O
+of	O
+the	O
+safe	O
+ship	O
+'s	O
+trajectories	O
+in	O
+real	O
+situation	O
+at	O
+sea	O
+when	O
+passing	O
+twelve	O
+of	O
+the	O
+encountered	O
+objects	O
+
+Solving	O
+the	O
+multiple	B-KEY
+competitive	I-KEY
+facilities	I-KEY
+location	I-KEY
+problem	I-KEY
+In	O
+this	O
+paper	O
+we	O
+propose	O
+five	O
+heuristic	B-KEY
+procedures	I-KEY
+for	O
+the	O
+solution	O
+of	O
+the	O
+multiple	B-KEY
+competitive	I-KEY
+facilities	I-KEY
+location	I-KEY
+problem	I-KEY
+.	O
+A	O
+franchise	O
+of	O
+several	O
+facilities	O
+is	O
+to	O
+be	O
+located	O
+in	O
+a	O
+trade	O
+area	O
+where	O
+competing	O
+facilities	O
+already	O
+exist	O
+.	O
+The	O
+objective	O
+is	O
+to	O
+maximize	O
+the	O
+market	O
+share	O
+captured	O
+by	O
+the	O
+franchise	O
+as	O
+a	O
+whole	O
+.	O
+We	O
+perform	O
+extensive	O
+computational	B-KEY
+tests	I-KEY
+and	O
+conclude	O
+that	O
+a	O
+two-step	O
+heuristic	B-KEY
+procedure	I-KEY
+combining	O
+simulated	O
+annealing	O
+and	O
+an	O
+ascent	O
+algorithm	O
+provides	O
+the	O
+best	O
+solutions	O
+
+Convergence	O
+of	O
+Toland	O
+'s	O
+critical	O
+points	O
+for	O
+sequences	O
+of	O
+DC	O
+functions	O
+and	O
+application	O
+to	O
+the	O
+resolution	O
+of	O
+semilinear	B-KEY
+elliptic	I-KEY
+problems	I-KEY
+We	O
+prove	O
+that	O
+if	O
+a	O
+sequence	O
+-LRB-	O
+f/sub	O
+n	O
+/	O
+-RRB-	O
+/	O
+sub	O
+n	O
+/	O
+of	O
+DC	O
+functions	O
+-LRB-	O
+difference	O
+of	O
+two	O
+convex	O
+functions	O
+-RRB-	O
+converges	O
+to	O
+a	O
+DC	O
+function	O
+f	O
+in	O
+some	O
+appropriate	O
+way	O
+and	O
+if	O
+u/sub	O
+n	O
+/	O
+is	O
+a	O
+critical	O
+point	O
+of	O
+f/sub	O
+n	O
+/	O
+,	O
+in	O
+the	O
+sense	O
+described	O
+by	O
+Toland	O
+-LRB-	O
+1978	O
+,	O
+1979	O
+-RRB-	O
+,	O
+and	O
+is	O
+such	O
+that	O
+-LRB-	O
+u/sub	O
+n	O
+/	O
+-RRB-	O
+/	O
+sub	O
+n	O
+/	O
+converges	O
+to	O
+u	O
+,	O
+then	O
+u	O
+is	O
+a	O
+critical	O
+point	O
+of	O
+f	O
+,	O
+still	O
+in	O
+Toland	O
+'s	O
+sense	O
+.	O
+We	O
+also	O
+build	O
+a	O
+new	O
+algorithm	O
+which	O
+searches	O
+for	O
+this	O
+critical	O
+point	O
+u	O
+and	O
+then	O
+apply	O
+it	O
+in	O
+order	O
+to	O
+compute	O
+the	O
+solution	O
+of	O
+a	O
+semilinear	B-KEY
+elliptic	I-KEY
+equation	I-KEY
+
+Bandwidth	O
+vs.	O
+gains	O
+design	O
+of	O
+H/sub	B-KEY
+infinity	I-KEY
+/	I-KEY
+tracking	I-KEY
+controllers	I-KEY
+for	O
+current-fed	B-KEY
+induction	I-KEY
+motors	I-KEY
+Describes	O
+a	O
+systematic	O
+procedure	O
+for	O
+designing	O
+speed	O
+and	O
+rotor	O
+flux	O
+norm	O
+tracking	O
+H/sub	O
+infinity	O
+/	O
+.	O
+controllers	O
+with	O
+unknown	B-KEY
+load	I-KEY
+torque	I-KEY
+disturbances	I-KEY
+for	O
+current-fed	B-KEY
+induction	I-KEY
+motors	I-KEY
+.	O
+A	O
+new	O
+effective	O
+design	B-KEY
+tool	I-KEY
+is	O
+developed	O
+to	O
+allow	O
+selection	O
+of	O
+the	O
+control	O
+gains	O
+so	O
+as	O
+to	O
+adjust	O
+the	O
+disturbances	O
+'	O
+rejection	O
+capability	O
+of	O
+the	O
+controllers	O
+in	O
+the	O
+face	O
+of	O
+the	O
+bandwidth	B-KEY
+requirements	I-KEY
+of	O
+the	O
+closed-loop	B-KEY
+system	I-KEY
+.	O
+Application	O
+of	O
+the	O
+proposed	O
+design	O
+procedure	O
+is	O
+demonstrated	O
+in	O
+a	O
+case	O
+study	O
+,	O
+and	O
+the	O
+results	O
+of	O
+numerical	O
+simulations	O
+illustrate	O
+the	O
+satisfactory	O
+performance	O
+achievable	O
+even	O
+in	O
+presence	O
+of	O
+rotor	O
+resistance	O
+uncertainty	O
+
+Solution	O
+of	O
+a	O
+Euclidean	B-KEY
+combinatorial	I-KEY
+optimization	I-KEY
+problem	I-KEY
+by	O
+the	O
+dynamic-programming	O
+method	O
+A	O
+class	O
+of	O
+Euclidean	B-KEY
+combinatorial	I-KEY
+optimization	I-KEY
+problems	I-KEY
+is	O
+selected	O
+that	O
+can	O
+be	O
+solved	O
+by	O
+the	O
+dynamic	B-KEY
+programming	I-KEY
+method	I-KEY
+.	O
+The	O
+problem	O
+of	O
+allocation	O
+of	O
+servicing	O
+enterprises	O
+is	O
+solved	O
+as	O
+an	O
+example	O
+
+Where	O
+have	O
+all	O
+the	O
+PC	B-KEY
+makers	I-KEY
+gone	O
+?	O
+PC	B-KEY
+makers	I-KEY
+are	O
+dwindling	O
+.	O
+If	O
+you	O
+are	O
+planning	O
+to	O
+make	O
+a	O
+PC	B-KEY
+purchase	I-KEY
+soon	O
+,	O
+here	O
+are	O
+a	O
+few	O
+things	O
+to	O
+look	O
+out	O
+for	O
+before	O
+you	O
+buy	O
+
+Adaptive	B-KEY
+array	I-KEY
+antenna	I-KEY
+based	O
+on	O
+radial	B-KEY
+basis	I-KEY
+function	I-KEY
+network	I-KEY
+as	O
+multiuser	B-KEY
+detection	I-KEY
+for	O
+WCDMA	O
+An	O
+adaptive	B-KEY
+array	I-KEY
+antenna	I-KEY
+is	O
+proposed	O
+based	O
+on	O
+the	O
+radial	O
+basis	O
+function	O
+-LRB-	O
+RBF	O
+-RRB-	O
+network	O
+as	O
+a	O
+multiuser	O
+detector	O
+for	O
+a	O
+WCDMA	O
+system	O
+.	O
+The	O
+proposed	O
+system	O
+calculates	O
+the	O
+optimal	B-KEY
+combining	I-KEY
+weight	I-KEY
+coefficients	I-KEY
+using	O
+sample	B-KEY
+matrix	I-KEY
+inversion	I-KEY
+with	O
+a	O
+common	O
+correlation	B-KEY
+matrix	I-KEY
+algorithm	I-KEY
+and	O
+obtains	O
+the	O
+channel	B-KEY
+response	I-KEY
+vector	I-KEY
+using	O
+the	O
+RBF	O
+output	O
+signal	O
+
+Non-nested	O
+multi-level	B-KEY
+solvers	I-KEY
+for	O
+finite	O
+element	O
+discretisations	O
+of	O
+mixed	O
+problems	O
+We	O
+consider	O
+a	O
+general	O
+framework	O
+for	O
+analysing	O
+the	O
+convergence	O
+of	O
+multi-grid	B-KEY
+solvers	I-KEY
+applied	O
+to	O
+finite	B-KEY
+element	I-KEY
+discretisations	I-KEY
+of	O
+mixed	B-KEY
+problems	I-KEY
+,	O
+both	O
+of	O
+conforming	O
+and	O
+nonconforming	O
+type	O
+.	O
+As	O
+a	O
+basic	O
+new	O
+feature	O
+.	O
+our	O
+approach	O
+allows	O
+to	O
+use	O
+different	O
+finite	B-KEY
+element	I-KEY
+discretisations	I-KEY
+on	O
+each	O
+level	O
+of	O
+the	O
+multi-grid	O
+hierarchy	O
+.	O
+Thus	O
+,	O
+in	O
+our	O
+multi-level	O
+approach	O
+,	O
+accurate	O
+higher	O
+order	O
+finite	B-KEY
+element	I-KEY
+discretisations	I-KEY
+can	O
+be	O
+combined	O
+with	O
+fast	O
+multi-level	O
+solvers	O
+based	O
+on	O
+lower	O
+order	O
+-LRB-	O
+nonconforming	O
+-RRB-	O
+finite	O
+element	O
+discretisations	O
+.	O
+This	O
+leads	O
+to	O
+the	O
+design	O
+of	O
+efficient	O
+multi-level	B-KEY
+solvers	I-KEY
+for	O
+higher	O
+order	O
+finite	B-KEY
+element	I-KEY
+discretisations	I-KEY
+
+An	O
+interactive	B-KEY
+self-replicator	I-KEY
+implemented	O
+in	O
+hardware	O
+Self-replicating	B-KEY
+loops	O
+presented	O
+to	O
+date	O
+are	O
+essentially	O
+worlds	O
+unto	O
+themselves	O
+,	O
+inaccessible	O
+to	O
+the	O
+observer	O
+once	O
+the	O
+replication	O
+process	O
+is	O
+launched	O
+.	O
+We	O
+present	O
+the	O
+design	O
+of	O
+an	O
+interactive	B-KEY
+self-replicating	I-KEY
+loop	O
+of	O
+arbitrary	O
+size	O
+,	O
+wherein	O
+the	O
+user	O
+can	O
+physically	O
+control	O
+the	O
+loop	O
+'s	O
+replication	O
+and	O
+induce	O
+its	O
+destruction	O
+.	O
+After	O
+introducing	O
+the	O
+BioWall	B-KEY
+,	O
+a	O
+reconfigurable	B-KEY
+electronic	I-KEY
+wall	I-KEY
+for	O
+bio-inspired	B-KEY
+applications	I-KEY
+,	O
+we	O
+describe	O
+the	O
+design	O
+of	O
+our	O
+novel	O
+loop	O
+and	O
+delineate	O
+its	O
+hardware	B-KEY
+implementation	I-KEY
+in	O
+the	O
+wall	O
+
+Integration	O
+is	O
+LIMS	B-KEY
+inspiration	O
+For	O
+software	B-KEY
+manufacturers	I-KEY
+,	O
+blessings	O
+come	O
+in	O
+the	O
+form	O
+of	O
+fast-moving	O
+application	O
+areas	O
+.	O
+In	O
+the	O
+case	O
+of	O
+LIMS	B-KEY
+,	O
+biotechnology	B-KEY
+is	O
+still	O
+in	O
+the	O
+driving	O
+seat	O
+,	O
+inspiring	O
+developers	O
+to	O
+maintain	O
+consistently	O
+rapid	O
+and	O
+creative	O
+levels	O
+of	O
+innovation	O
+.	O
+Current	O
+advancements	O
+are	O
+no	O
+exception	O
+.	O
+Integration	O
+and	O
+linking	O
+initiatives	O
+are	O
+still	O
+popular	O
+and	O
+much	O
+of	O
+the	O
+activity	O
+appears	O
+to	O
+be	O
+coming	O
+from	O
+a	O
+very	O
+productive	O
+minority	O
+
+The	O
+use	O
+of	O
+visual	O
+search	O
+for	O
+knowledge	O
+gathering	O
+in	O
+image	O
+decision	O
+support	O
+This	O
+paper	O
+presents	O
+a	O
+new	O
+method	O
+of	O
+knowledge	O
+gathering	O
+for	O
+decision	O
+support	O
+in	O
+image	O
+understanding	O
+based	O
+on	O
+information	O
+extracted	O
+from	O
+the	O
+dynamics	O
+of	O
+saccadic	O
+eye	O
+movements	O
+.	O
+The	O
+framework	O
+involves	O
+the	O
+construction	O
+of	O
+a	O
+generic	O
+image	B-KEY
+feature	I-KEY
+extraction	O
+library	O
+,	O
+from	O
+which	O
+the	O
+feature	O
+extractors	O
+that	O
+are	O
+most	O
+relevant	O
+to	O
+the	O
+visual	O
+assessment	O
+by	O
+domain	B-KEY
+experts	I-KEY
+are	O
+determined	O
+automatically	O
+through	O
+factor	O
+analysis	O
+.	O
+The	O
+dynamics	O
+of	O
+the	O
+visual	O
+search	O
+are	O
+analyzed	O
+by	O
+using	O
+the	O
+Markov	B-KEY
+model	I-KEY
+for	O
+providing	O
+training	B-KEY
+information	I-KEY
+to	O
+novices	O
+on	O
+how	O
+and	O
+where	O
+to	O
+look	O
+for	O
+image	B-KEY
+features	I-KEY
+.	O
+The	O
+validity	O
+of	O
+the	O
+framework	O
+has	O
+been	O
+evaluated	O
+in	O
+a	O
+clinical	O
+scenario	O
+whereby	O
+the	O
+pulmonary	B-KEY
+vascular	I-KEY
+distribution	I-KEY
+on	O
+Computed	O
+Tomography	O
+images	O
+was	O
+assessed	O
+by	O
+experienced	B-KEY
+radiologists	I-KEY
+as	O
+a	O
+potential	O
+indicator	O
+of	O
+heart	O
+failure	O
+.	O
+The	O
+performance	O
+of	O
+the	O
+system	O
+has	O
+been	O
+demonstrated	O
+by	O
+training	O
+four	O
+novices	O
+to	O
+follow	O
+the	O
+visual	B-KEY
+assessment	I-KEY
+behavior	I-KEY
+of	O
+two	O
+experienced	B-KEY
+observers	I-KEY
+.	O
+In	O
+all	O
+cases	O
+,	O
+the	O
+accuracy	O
+of	O
+the	O
+students	O
+improved	O
+from	O
+near	B-KEY
+random	I-KEY
+decision	I-KEY
+making	I-KEY
+-LRB-	O
+33	O
+%	O
+-RRB-	O
+to	O
+accuracies	O
+ranging	O
+from	O
+50	O
+%	O
+to	O
+68	O
+%	O
+
+Turning	O
+telecommunications	B-KEY
+call	I-KEY
+details	I-KEY
+to	O
+churn	O
+prediction	O
+:	O
+a	O
+data	O
+mining	O
+approach	O
+As	O
+deregulation	B-KEY
+,	O
+new	O
+technologies	O
+,	O
+and	O
+new	O
+competitors	O
+open	O
+up	O
+the	O
+mobile	B-KEY
+telecommunications	I-KEY
+industry	I-KEY
+,	O
+churn	O
+prediction	O
+and	O
+management	O
+has	O
+become	O
+of	O
+great	O
+concern	O
+to	O
+mobile	B-KEY
+service	I-KEY
+providers	I-KEY
+.	O
+A	O
+mobile	B-KEY
+service	I-KEY
+provider	I-KEY
+wishing	O
+to	O
+retain	O
+its	O
+subscribers	O
+needs	O
+to	O
+be	O
+able	O
+to	O
+predict	O
+which	O
+of	O
+them	O
+may	O
+be	O
+at-risk	O
+of	O
+changing	O
+services	O
+and	O
+will	O
+make	O
+those	O
+subscribers	O
+the	O
+focus	O
+of	O
+customer	B-KEY
+retention	I-KEY
+efforts	I-KEY
+.	O
+In	O
+response	O
+to	O
+the	O
+limitations	O
+of	O
+existing	O
+churn-prediction	O
+systems	O
+and	O
+the	O
+unavailability	O
+of	O
+customer	B-KEY
+demographics	I-KEY
+in	O
+the	O
+mobile	O
+telecommunications	O
+provider	O
+investigated	O
+,	O
+we	O
+propose	O
+,	O
+design	O
+,	O
+and	O
+experimentally	O
+evaluate	O
+a	O
+churn-prediction	O
+technique	O
+that	O
+predicts	O
+churning	O
+from	O
+subscriber	B-KEY
+contractual	I-KEY
+information	I-KEY
+and	O
+call	B-KEY
+pattern	I-KEY
+changes	I-KEY
+extracted	O
+from	O
+call	O
+details	O
+.	O
+This	O
+proposed	O
+technique	O
+is	O
+capable	O
+of	O
+identifying	O
+potential	O
+churners	O
+at	O
+the	O
+contract	O
+level	O
+for	O
+a	O
+specific	O
+prediction	O
+time-period	O
+.	O
+In	O
+addition	O
+,	O
+the	O
+proposed	O
+technique	O
+incorporates	O
+the	O
+multi-classifier	B-KEY
+class-combiner	I-KEY
+approach	I-KEY
+to	O
+address	O
+the	O
+challenge	O
+of	O
+a	O
+highly	O
+skewed	B-KEY
+class	I-KEY
+distribution	I-KEY
+between	O
+churners	O
+and	O
+non-churners	O
+.	O
+The	O
+empirical	O
+evaluation	O
+results	O
+suggest	O
+that	O
+the	O
+proposed	O
+call-behavior-based	O
+churn-prediction	O
+technique	O
+exhibits	O
+satisfactory	O
+predictive	O
+effectiveness	O
+when	O
+more	O
+recent	O
+call	O
+details	O
+are	O
+employed	O
+for	O
+the	O
+churn	O
+prediction	O
+model	O
+construction	O
+.	O
+Furthermore	O
+,	O
+the	O
+proposed	O
+technique	O
+is	O
+able	O
+to	O
+demonstrate	O
+satisfactory	O
+or	O
+reasonable	O
+predictive	O
+power	O
+within	O
+the	O
+one-month	O
+interval	O
+between	O
+model	O
+construction	O
+and	O
+churn	O
+prediction	O
+.	O
+Using	O
+a	O
+previous	O
+demographics-based	O
+churn-prediction	O
+system	O
+as	O
+a	O
+reference	O
+,	O
+the	O
+lift	B-KEY
+factors	I-KEY
+attained	O
+by	O
+our	O
+proposed	O
+technique	O
+appear	O
+largely	O
+satisfactory	O
+
+Mathematical	O
+aspects	O
+of	O
+computer-aided	B-KEY
+share	I-KEY
+trading	I-KEY
+We	O
+consider	O
+problems	O
+of	O
+statistical	B-KEY
+analysis	I-KEY
+of	O
+share	B-KEY
+prices	I-KEY
+and	O
+propose	O
+probabilistic	B-KEY
+characteristics	I-KEY
+to	O
+describe	O
+the	O
+price	B-KEY
+series	I-KEY
+.	O
+We	O
+discuss	O
+three	O
+methods	O
+of	O
+mathematical	B-KEY
+modelling	I-KEY
+of	O
+price	B-KEY
+series	I-KEY
+with	O
+given	O
+probabilistic	B-KEY
+characteristics	I-KEY
+
+The	O
+XML	B-KEY
+typechecking	I-KEY
+problem	I-KEY
+When	O
+an	O
+XML	B-KEY
+document	I-KEY
+conforms	O
+to	O
+a	O
+given	O
+type	O
+-LRB-	O
+e.g.	O
+a	O
+DTD	O
+or	O
+an	O
+XML	O
+schema	O
+type	O
+-RRB-	O
+it	O
+is	O
+called	O
+a	O
+valid	B-KEY
+document	O
+.	O
+Checking	O
+if	O
+a	O
+given	O
+XML	B-KEY
+document	I-KEY
+is	O
+valid	B-KEY
+is	O
+called	O
+the	O
+validation	B-KEY
+problem	O
+,	O
+and	O
+is	O
+typically	O
+performed	O
+by	O
+a	O
+parser	O
+-LRB-	O
+hence	O
+,	O
+validating	B-KEY
+parser	O
+-RRB-	O
+,	O
+more	O
+precisely	O
+it	O
+is	O
+performed	O
+right	O
+after	O
+parsing	O
+,	O
+by	O
+the	O
+same	O
+program	O
+module	O
+.	O
+In	O
+practice	O
+however	O
+,	O
+XML	B-KEY
+documents	I-KEY
+are	O
+often	O
+generated	O
+dynamically	O
+,	O
+by	O
+some	O
+program	O
+:	O
+checking	O
+whether	O
+all	O
+XML	B-KEY
+documents	I-KEY
+generated	O
+by	O
+the	O
+program	O
+are	O
+valid	B-KEY
+WRT	O
+a	O
+given	O
+type	O
+is	O
+called	O
+the	O
+typechecking	O
+problem	O
+.	O
+While	O
+a	O
+validation	B-KEY
+analyzes	O
+an	O
+XML	B-KEY
+document	I-KEY
+,	O
+a	O
+type	O
+checker	O
+analyzes	O
+a	O
+program	O
+,	O
+and	O
+the	O
+problem	O
+'s	O
+difficulty	O
+is	O
+a	O
+function	O
+of	O
+the	O
+language	O
+in	O
+which	O
+that	O
+program	O
+is	O
+expressed	O
+.	O
+The	O
+XML	B-KEY
+typechecking	I-KEY
+problem	I-KEY
+has	O
+been	O
+investigated	O
+recently	O
+and	O
+the	O
+XQuery	B-KEY
+Working	O
+Group	O
+adopted	O
+some	O
+of	O
+these	O
+techniques	O
+for	O
+typechecking	O
+XQuery	B-KEY
+.	O
+All	O
+these	O
+techniques	O
+,	O
+however	O
+,	O
+have	O
+limitations	O
+which	O
+need	O
+to	O
+be	O
+understood	O
+and	O
+further	O
+explored	O
+and	O
+investigated	O
+.	O
+We	O
+define	O
+the	O
+XML	B-KEY
+typechecking	I-KEY
+problem	I-KEY
+,	O
+and	O
+present	O
+current	O
+approaches	O
+to	O
+typechecking	O
+,	O
+discussing	O
+their	O
+limitations	O
+
+Component	O
+support	O
+in	O
+PLT	B-KEY
+scheme	I-KEY
+PLT	B-KEY
+Scheme	I-KEY
+-LRB-	O
+DrScheme	O
+and	O
+MzScheme	O
+-RRB-	O
+supports	O
+the	O
+Component	B-KEY
+Object	I-KEY
+Model	I-KEY
+-LRB-	O
+COM	O
+-RRB-	O
+standard	O
+with	O
+two	O
+pieces	O
+of	O
+software	O
+.	O
+The	O
+first	O
+piece	O
+is	O
+MzCOM	B-KEY
+,	O
+a	O
+COM	O
+class	O
+that	O
+makes	O
+a	O
+Scheme	O
+evaluator	O
+available	O
+to	O
+COM	O
+clients	O
+.	O
+With	O
+MzCOM	B-KEY
+,	O
+programmers	O
+can	O
+embed	O
+Scheme	O
+code	O
+in	O
+programs	O
+written	O
+in	O
+mainstream	O
+languages	O
+such	O
+as	O
+C++	O
+or	O
+Visual	O
+BASIC	O
+.	O
+Some	O
+applications	O
+can	O
+also	O
+be	O
+used	O
+as	O
+MzCOM	B-KEY
+clients	O
+.	O
+The	O
+other	O
+piece	O
+of	O
+component-support	O
+software	O
+is	O
+MysterX	O
+,	O
+which	O
+makes	O
+COM	O
+classes	O
+available	O
+to	O
+PLT	B-KEY
+Scheme	I-KEY
+programs	O
+.	O
+When	O
+needed	O
+,	O
+MysterX	O
+uses	O
+a	O
+programmable	O
+Web	B-KEY
+browser	I-KEY
+to	O
+display	O
+COM	O
+objects	O
+.	O
+We	O
+describe	O
+the	O
+technical	O
+issues	O
+encountered	O
+in	O
+building	O
+these	O
+two	O
+systems	O
+and	O
+sketch	O
+some	O
+applications	O
+
+The	O
+pedagogy	B-KEY
+of	O
+on-line	O
+learning	O
+:	O
+a	O
+report	O
+from	O
+the	O
+University	O
+of	O
+the	O
+Highlands	O
+and	O
+Islands	O
+Millennium	O
+Institute	O
+Authoritative	O
+sources	O
+concerned	O
+with	O
+computer-aided	B-KEY
+learning	I-KEY
+,	O
+resource-based	B-KEY
+learning	I-KEY
+and	O
+on-line	O
+learning	O
+and	O
+teaching	B-KEY
+are	O
+generally	O
+agreed	O
+that	O
+,	O
+in	O
+addition	O
+to	O
+subject	O
+matter	O
+expertise	O
+and	O
+technical	B-KEY
+support	I-KEY
+,	O
+the	O
+quality	O
+of	O
+the	O
+learning	O
+materials	O
+and	O
+the	O
+learning	O
+experiences	O
+of	O
+students	O
+are	O
+critically	O
+dependent	O
+on	O
+the	O
+application	O
+of	O
+pedagogically	O
+sound	O
+theories	O
+of	O
+learning	O
+and	O
+teaching	B-KEY
+and	O
+principles	O
+of	O
+course	O
+design	O
+.	O
+The	O
+University	B-KEY
+of	I-KEY
+the	I-KEY
+Highlands	I-KEY
+and	I-KEY
+Islands	I-KEY
+Project	I-KEY
+-LRB-	O
+UHIMI	O
+-RRB-	O
+is	O
+developing	O
+``	O
+on-line	O
+learning	O
+''	O
+on	O
+a	O
+large	O
+scale	O
+.	O
+These	O
+developments	O
+have	O
+been	O
+accompanied	O
+by	O
+a	O
+comprehensive	O
+programme	O
+of	O
+staff	B-KEY
+development	I-KEY
+.	O
+A	O
+major	O
+emphasis	O
+of	O
+the	O
+programme	O
+is	O
+concerned	O
+with	O
+ensuring	O
+that	O
+course	O
+developers	O
+and	O
+tutors	O
+are	O
+pedagogically	O
+aware	O
+.	O
+This	O
+paper	O
+reviews	O
+-LRB-	O
+i	O
+-RRB-	O
+what	O
+is	O
+meant	O
+by	O
+``	O
+on-line	O
+learning	O
+''	O
+in	O
+the	O
+UHIMI	O
+context	O
+-LRB-	O
+ii	O
+-RRB-	O
+the	O
+theories	O
+of	O
+learning	O
+and	O
+teaching	B-KEY
+and	O
+principles	O
+of	O
+course	O
+design	O
+that	O
+inform	O
+the	O
+staff	B-KEY
+development	I-KEY
+programme	O
+and	O
+-LRB-	O
+iii	O
+-RRB-	O
+a	O
+review	O
+of	O
+progress	O
+to	O
+date	O
+
+Hamiltonian	B-KEY
+modelling	I-KEY
+and	O
+nonlinear	B-KEY
+disturbance	I-KEY
+attenuation	I-KEY
+control	I-KEY
+of	O
+TCSC	O
+for	O
+improving	O
+power	B-KEY
+system	I-KEY
+stability	I-KEY
+To	O
+tackle	O
+the	O
+obstacle	O
+of	O
+applying	O
+passivity-based	B-KEY
+control	I-KEY
+-LRB-	O
+PBC	O
+-RRB-	O
+to	O
+power	O
+systems	O
+,	O
+an	O
+affine	O
+non-linear	O
+system	O
+widely	O
+existing	O
+in	O
+power	O
+systems	O
+is	O
+formulated	O
+as	O
+a	O
+standard	O
+Hamiltonian	O
+system	O
+using	O
+a	O
+pre-feedback	B-KEY
+method	I-KEY
+.	O
+The	O
+port	O
+controlled	O
+Hamiltonian	O
+with	O
+dissipation	O
+-LRB-	O
+PCHD	O
+-RRB-	O
+model	O
+of	O
+a	O
+thyristor	B-KEY
+controlled	I-KEY
+serial	I-KEY
+compensator	I-KEY
+-LRB-	O
+TCSC	O
+-RRB-	O
+is	O
+then	O
+established	O
+corresponding	O
+with	O
+a	O
+revised	O
+Hamiltonian	B-KEY
+function	I-KEY
+.	O
+Furthermore	O
+,	O
+employing	O
+the	O
+modified	O
+Hamiltonian	B-KEY
+function	I-KEY
+directly	O
+as	O
+the	O
+storage	B-KEY
+function	I-KEY
+,	O
+a	O
+non-linear	O
+adaptive	O
+L/sub	O
+2	O
+/	O
+gain	O
+control	O
+method	O
+is	O
+proposed	O
+to	O
+solve	O
+the	O
+problem	O
+of	O
+L/sub	O
+2	O
+/	O
+gain	O
+disturbance	O
+attenuation	O
+for	O
+this	O
+Hamiltonian	O
+system	O
+with	O
+parametric	B-KEY
+perturbations	I-KEY
+.	O
+Finally	O
+,	O
+simulation	O
+results	O
+are	O
+presented	O
+to	O
+verify	O
+the	O
+validity	O
+of	O
+the	O
+proposed	O
+controller	O
+
+Pontryagin	B-KEY
+maximum	I-KEY
+principle	I-KEY
+of	O
+optimal	B-KEY
+control	I-KEY
+governed	O
+by	O
+fluid	B-KEY
+dynamic	I-KEY
+systems	O
+with	O
+two	O
+point	O
+boundary	O
+state	B-KEY
+constraint	I-KEY
+We	O
+study	O
+the	O
+optimal	B-KEY
+control	I-KEY
+problem	O
+subject	O
+to	O
+the	O
+semilinear	B-KEY
+equation	I-KEY
+with	O
+a	O
+state	B-KEY
+constraint	I-KEY
+.	O
+We	O
+prove	O
+certain	O
+theorems	O
+and	O
+give	O
+examples	O
+of	O
+state	B-KEY
+constraints	I-KEY
+so	O
+that	O
+the	O
+maximum	O
+principle	O
+holds	O
+.	O
+The	O
+main	O
+difficulty	O
+of	O
+the	O
+problem	O
+is	O
+to	O
+make	O
+the	O
+sensitivity	O
+analysis	O
+of	O
+the	O
+state	O
+with	O
+respect	O
+to	O
+the	O
+control	O
+caused	O
+by	O
+the	O
+unboundedness	O
+and	O
+nonlinearity	O
+of	O
+an	O
+operator	O
+
+Unlocking	O
+the	O
+potential	O
+of	O
+videoconferencing	B-KEY
+I	O
+propose	O
+in	O
+this	O
+paper	O
+to	O
+show	O
+,	O
+through	O
+a	O
+number	O
+of	O
+case	B-KEY
+studies	I-KEY
+,	O
+that	O
+videoconferencing	B-KEY
+is	O
+user-friendly	O
+,	O
+cost-effective	O
+,	O
+time-effective	O
+and	O
+life-enhancing	O
+for	O
+people	O
+of	O
+all	O
+ages	O
+and	O
+abilities	O
+and	O
+that	O
+it	O
+requires	O
+only	O
+a	O
+creative	O
+and	O
+imaginative	O
+approach	O
+to	O
+unlock	O
+its	O
+potential	O
+.	O
+I	O
+believe	O
+that	O
+these	O
+benefits	B-KEY
+need	O
+not	O
+,	O
+and	O
+should	O
+not	O
+,	O
+be	O
+restricted	O
+to	O
+the	O
+education	B-KEY
+sector	O
+.	O
+My	O
+examples	O
+will	O
+range	O
+from	O
+simple	O
+storytelling	O
+,	O
+through	O
+accessing	O
+international	O
+experts	O
+,	O
+professional	O
+development	O
+and	O
+distance	O
+learning	O
+in	O
+a	O
+variety	O
+of	O
+forms	O
+,	O
+to	O
+the	O
+use	O
+of	O
+videoconferencing	B-KEY
+for	O
+virtual	O
+meetings	O
+and	O
+planning	O
+sessions	O
+.	O
+In	O
+some	O
+cases	O
+,	O
+extracts	O
+from	O
+the	O
+reactions	O
+and	O
+responses	O
+of	O
+the	O
+participants	O
+will	O
+be	O
+included	O
+to	O
+illustrate	O
+the	O
+impact	O
+of	O
+the	O
+medium	O
+
+Maintaining	O
+e-commerce	O
+E-commerce	O
+over	O
+the	O
+Web	O
+has	O
+created	O
+a	O
+relatively	O
+new	O
+type	O
+of	O
+information	O
+system	O
+.	O
+So	O
+it	O
+is	O
+hardly	O
+surprising	O
+that	O
+little	O
+attention	O
+has	O
+been	O
+given	O
+to	O
+the	O
+maintenance	O
+of	O
+such	O
+systems-and	O
+even	O
+less	O
+to	O
+attempting	O
+to	O
+develop	O
+them	O
+with	O
+future	O
+maintenance	O
+in	O
+mind	O
+.	O
+But	O
+there	O
+are	O
+various	O
+ways	O
+e-commerce	O
+systems	O
+can	O
+be	O
+developed	O
+to	O
+reduce	O
+future	O
+maintenance	O
+
+Numerical	O
+solution	O
+of	O
+forward	O
+and	O
+backward	O
+problem	O
+for	O
+2-D	O
+heat	B-KEY
+conduction	I-KEY
+equation	O
+For	O
+a	O
+two-dimensional	O
+heat	B-KEY
+conduction	I-KEY
+problem	O
+,	O
+we	O
+consider	O
+its	O
+initial	B-KEY
+boundary	I-KEY
+value	I-KEY
+problem	I-KEY
+and	O
+the	O
+related	O
+inverse	B-KEY
+problem	I-KEY
+of	O
+determining	O
+the	O
+initial	B-KEY
+temperature	I-KEY
+distribution	I-KEY
+from	O
+transient	B-KEY
+temperature	I-KEY
+measurements	I-KEY
+.	O
+The	O
+conditional	B-KEY
+stability	I-KEY
+for	O
+this	O
+inverse	B-KEY
+problem	I-KEY
+and	O
+the	O
+error	B-KEY
+analysis	I-KEY
+for	O
+the	O
+Tikhonov	B-KEY
+regularization	I-KEY
+are	O
+presented	O
+.	O
+An	O
+implicit	O
+inversion	O
+method	O
+,	O
+which	O
+is	O
+based	O
+on	O
+the	O
+regularization	O
+technique	O
+and	O
+the	O
+successive	O
+over-relaxation	O
+-LRB-	O
+SOR	O
+-RRB-	O
+iteration	O
+process	O
+,	O
+is	O
+established	O
+.	O
+Due	O
+to	O
+the	O
+explicit	O
+difference	O
+scheme	O
+for	O
+a	O
+direct	O
+heat	O
+problem	O
+developed	O
+in	O
+this	O
+paper	O
+,	O
+the	O
+inversion	O
+process	O
+is	O
+very	O
+efficient	O
+,	O
+while	O
+the	O
+application	O
+of	O
+SOR	O
+technique	O
+makes	O
+our	O
+inversion	O
+convergent	O
+rapidly	O
+.	O
+Numerical	O
+results	O
+illustrating	O
+our	O
+method	O
+are	O
+also	O
+given	O
+
+Multi-output	O
+regression	O
+using	O
+a	O
+locally	B-KEY
+regularised	I-KEY
+orthogonal	I-KEY
+least-squares	I-KEY
+algorithm	I-KEY
+The	O
+paper	O
+considers	O
+data	B-KEY
+modelling	I-KEY
+using	O
+multi-output	B-KEY
+regression	I-KEY
+models	I-KEY
+.	O
+A	O
+locally	O
+regularised	O
+orthogonal	O
+least-squares	O
+-LRB-	O
+LROLS	O
+-RRB-	O
+algorithm	O
+is	O
+proposed	O
+for	O
+constructing	O
+sparse	O
+multi-output	B-KEY
+regression	I-KEY
+models	I-KEY
+that	O
+generalise	O
+well	O
+.	O
+By	O
+associating	O
+each	O
+regressor	O
+in	O
+the	O
+regression	O
+model	O
+with	O
+an	O
+individual	O
+regularisation	O
+parameter	O
+,	O
+the	O
+ability	O
+of	O
+the	O
+multi-output	O
+orthogonal	O
+least-squares	O
+-LRB-	O
+OLS	O
+-RRB-	O
+model	O
+selection	O
+to	O
+produce	O
+a	O
+parsimonious	B-KEY
+model	I-KEY
+with	O
+a	O
+good	O
+generalisation	O
+performance	O
+is	O
+greatly	O
+enhanced	O
+
+Medical	O
+image	O
+computing	O
+at	O
+the	O
+Institute	B-KEY
+of	I-KEY
+Mathematics	I-KEY
+and	I-KEY
+Computer	I-KEY
+Science	I-KEY
+in	I-KEY
+Medicine	I-KEY
+,	O
+University	B-KEY
+Hospital	I-KEY
+Hamburg-Eppendorf	I-KEY
+The	O
+author	O
+reviews	O
+the	O
+history	O
+of	O
+medical	O
+image	O
+computing	O
+at	O
+his	O
+institute	O
+,	O
+summarizes	O
+the	O
+achievements	O
+,	O
+sketches	O
+some	O
+of	O
+the	O
+difficulties	B-KEY
+encountered	I-KEY
+,	O
+and	O
+draws	O
+conclusions	O
+that	O
+might	O
+be	O
+of	O
+interest	O
+especially	O
+to	O
+people	O
+new	O
+to	O
+the	O
+field	O
+.	O
+The	O
+origin	O
+and	O
+history	O
+section	O
+provides	O
+a	O
+chronology	O
+of	O
+this	O
+work	O
+,	O
+emphasizing	O
+the	O
+milestones	O
+reached	O
+during	O
+the	O
+past	O
+three	O
+decades	O
+.	O
+In	O
+accordance	O
+with	O
+the	O
+author	O
+'s	O
+group	O
+'s	O
+focus	O
+on	O
+imaging	O
+,	O
+the	O
+paper	O
+is	O
+accompanied	O
+by	O
+many	O
+pictures	O
+,	O
+some	O
+of	O
+which	O
+,	O
+he	O
+thinks	O
+,	O
+are	O
+of	O
+historical	B-KEY
+value	I-KEY
+
+Designing	O
+human-centered	O
+distributed	O
+information	O
+systems	O
+Many	O
+computer	O
+systems	O
+are	O
+designed	O
+according	O
+to	O
+engineering	O
+and	O
+technology	O
+principles	O
+and	O
+are	O
+typically	O
+difficult	O
+to	O
+learn	O
+and	O
+use	O
+.	O
+The	O
+fields	O
+of	O
+human-computer	B-KEY
+interaction	I-KEY
+,	O
+interface	B-KEY
+design	I-KEY
+,	O
+and	O
+human	B-KEY
+factors	I-KEY
+have	O
+made	O
+significant	O
+contributions	O
+to	O
+ease	O
+of	O
+use	O
+and	O
+are	O
+primarily	O
+concerned	O
+with	O
+the	O
+interfaces	O
+between	O
+systems	O
+and	O
+users	O
+,	O
+not	O
+with	O
+the	O
+structures	O
+that	O
+are	O
+often	O
+more	O
+fundamental	O
+for	O
+designing	O
+truly	O
+human-centered	O
+systems	O
+.	O
+The	O
+emerging	O
+paradigm	O
+of	O
+human-centered	O
+computing	O
+-LRB-	O
+HCC	O
+-RRB-	O
+-	O
+which	O
+has	O
+taken	O
+many	O
+forms-offers	O
+a	O
+new	O
+look	O
+at	O
+system	O
+design	O
+.	O
+HCC	O
+requires	O
+more	O
+than	O
+merely	O
+designing	O
+an	O
+artificial	B-KEY
+agent	I-KEY
+to	O
+supplement	O
+a	O
+human	B-KEY
+agent	I-KEY
+.	O
+The	O
+dynamic	O
+interactions	O
+in	O
+a	O
+distributed	O
+system	O
+composed	O
+of	O
+human	O
+and	O
+artificial	O
+agents-and	O
+the	O
+context	O
+in	O
+which	O
+the	O
+system	O
+is	O
+situated-are	O
+indispensable	O
+factors	O
+.	O
+While	O
+we	O
+have	O
+successfully	O
+applied	O
+our	O
+methodology	O
+in	O
+designing	O
+a	O
+prototype	O
+of	O
+a	O
+human-centered	O
+intelligent	O
+flight-surgeon	O
+console	O
+at	O
+NASA	B-KEY
+Johnson	I-KEY
+Space	I-KEY
+Center	I-KEY
+,	O
+this	O
+article	O
+presents	O
+a	O
+methodology	O
+for	O
+designing	O
+human-centered	B-KEY
+computing	I-KEY
+systems	I-KEY
+using	O
+electronic	O
+medical	O
+records	O
+-LRB-	O
+EMR	O
+-RRB-	O
+systems	O
+
+Electronic	B-KEY
+books	I-KEY
+:	O
+reports	O
+of	O
+their	O
+death	O
+have	O
+been	O
+exaggerated	O
+E-books	B-KEY
+will	O
+survive	O
+,	O
+but	O
+not	O
+in	O
+the	O
+consumer	O
+market	O
+-	O
+at	O
+least	O
+not	O
+until	O
+reading	O
+devices	O
+become	O
+much	O
+cheaper	O
+and	O
+much	O
+better	O
+in	O
+quality	O
+-LRB-	O
+which	O
+is	O
+not	O
+likely	O
+to	O
+happen	O
+soon	O
+-RRB-	O
+.	O
+Library	B-KEY
+Journal	I-KEY
+'s	O
+review	O
+of	O
+major	O
+events	O
+of	O
+the	O
+year	O
+2001	O
+noted	O
+that	O
+two	O
+requirements	O
+for	O
+the	O
+success	O
+of	O
+E-books	B-KEY
+were	O
+development	O
+of	O
+a	O
+sustainable	O
+business	O
+model	O
+and	O
+development	O
+of	O
+better	O
+reading	O
+devices	O
+.	O
+The	O
+E-book	B-KEY
+revolution	O
+has	O
+therefore	O
+become	O
+more	O
+of	O
+an	O
+evolution	O
+.	O
+We	O
+can	O
+look	O
+forward	O
+to	O
+further	O
+developments	O
+and	O
+advances	O
+in	O
+the	O
+future	O
+
+A	O
+novel	O
+preterm	B-KEY
+respiratory	I-KEY
+mechanics	I-KEY
+active	I-KEY
+simulator	I-KEY
+to	O
+test	O
+the	O
+performances	O
+of	O
+neonatal	B-KEY
+pulmonary	I-KEY
+ventilators	I-KEY
+A	O
+patient	B-KEY
+active	I-KEY
+simulator	I-KEY
+is	O
+proposed	O
+which	O
+is	O
+capable	O
+of	O
+reproducing	O
+values	O
+of	O
+the	O
+parameters	O
+of	O
+pulmonary	O
+mechanics	O
+of	O
+healthy	B-KEY
+newborns	I-KEY
+and	O
+preterm	B-KEY
+pathological	I-KEY
+infants	I-KEY
+.	O
+The	O
+implemented	O
+prototype	O
+is	O
+able	O
+to	O
+:	O
+-LRB-	O
+a	O
+-RRB-	O
+let	O
+the	O
+operator	O
+choose	O
+the	O
+respiratory	O
+pattern	O
+,	O
+times	O
+of	O
+apnea	O
+,	O
+episodes	O
+of	O
+cough	O
+,	O
+sobs	O
+,	O
+etc.	O
+,	O
+-LRB-	O
+b	O
+-RRB-	O
+continuously	O
+regulate	O
+and	O
+control	O
+the	O
+parameters	O
+characterizing	O
+the	O
+pulmonary	O
+system	O
+;	O
+and	O
+,	O
+finally	O
+,	O
+-LRB-	O
+c	O
+-RRB-	O
+reproduce	O
+the	O
+attempt	O
+of	O
+breathing	O
+of	O
+a	O
+preterm	O
+infant	O
+.	O
+Taking	O
+into	O
+account	O
+both	O
+the	O
+limitation	O
+due	O
+to	O
+the	O
+chosen	O
+application	O
+field	O
+and	O
+the	O
+preliminary	O
+autocalibration	B-KEY
+phase	I-KEY
+automatically	O
+carried	O
+out	O
+by	O
+the	O
+proposed	O
+device	O
+,	O
+accuracy	B-KEY
+and	O
+reliability	B-KEY
+on	O
+the	O
+order	O
+of	O
+1	O
+%	O
+is	O
+estimated	O
+.	O
+The	O
+previously	O
+indicated	O
+value	O
+has	O
+to	O
+be	O
+considered	O
+satisfactory	O
+in	O
+light	O
+of	O
+the	O
+field	O
+of	O
+application	O
+and	O
+the	O
+small	O
+values	O
+of	O
+the	O
+simulated	O
+parameters	O
+.	O
+Finally	O
+,	O
+the	O
+achieved	O
+metrological	O
+characteristics	O
+allow	O
+the	O
+described	O
+neonatal	O
+simulator	O
+to	O
+be	O
+adopted	O
+as	O
+a	O
+reference	O
+device	O
+to	O
+test	O
+performances	O
+of	O
+neonatal	O
+ventilators	O
+and	O
+,	O
+more	O
+specifically	O
+,	O
+to	O
+measure	O
+the	O
+time	O
+elapsed	O
+between	O
+the	O
+occurrence	O
+of	O
+a	O
+potentially	O
+dangerous	O
+condition	O
+to	O
+the	O
+patient	O
+and	O
+the	O
+activation	O
+of	O
+the	O
+corresponding	O
+alarm	O
+of	O
+the	O
+tested	O
+ventilator	O
+
+Isogenous	O
+of	O
+the	O
+elliptic	O
+curves	O
+over	O
+the	O
+rationals	B-KEY
+An	O
+elliptic	O
+curve	O
+is	O
+a	O
+pair	O
+-LRB-	O
+E	O
+,	O
+O	O
+-RRB-	O
+,	O
+where	O
+E	O
+is	O
+a	O
+smooth	B-KEY
+projective	I-KEY
+curve	I-KEY
+of	O
+genus	O
+1	O
+and	O
+O	O
+is	O
+a	O
+point	O
+of	O
+E	O
+,	O
+called	O
+the	O
+point	O
+at	O
+infinity	O
+.	O
+Every	O
+elliptic	O
+curve	O
+can	O
+be	O
+given	O
+by	O
+a	O
+Weierstrass	B-KEY
+equation	I-KEY
+E	O
+:	O
+y/sup	O
+2	O
+/	O
++	O
+a/sub	O
+1/xy	O
++	O
+a/sub	O
+3/y	O
+=	O
+x/sup	O
+3	O
+/	O
++	O
+a/sub	O
+2/x/sup	O
+2	O
+/	O
++	O
+a/sub	O
+4/x	O
++	O
+a/sub	O
+6	O
+/	O
+.	O
+Let	O
+Q	O
+be	O
+the	O
+set	O
+of	O
+rationals	B-KEY
+.	O
+E	O
+is	O
+said	O
+to	O
+be	O
+defined	O
+over	O
+Q	O
+if	O
+the	O
+coefficients	O
+a/sub	O
+i	O
+/	O
+,	O
+i	O
+=	O
+1	O
+,	O
+2	O
+,	O
+3	O
+,	O
+4	O
+,	O
+6	O
+are	O
+rationals	B-KEY
+and	O
+O	O
+is	O
+defined	O
+over	O
+Q.	O
+Let	O
+E/Q	O
+be	O
+an	O
+elliptic	O
+curve	O
+and	O
+let	O
+E	O
+-LRB-	O
+Q	O
+-RRB-	O
+/	O
+sub	O
+tors	O
+/	O
+be	O
+the	O
+torsion	O
+group	O
+of	O
+points	O
+of	O
+E	O
+defined	O
+over	O
+Q	O
+.	O
+The	O
+theorem	O
+of	O
+Mazur	O
+asserts	O
+that	O
+E	O
+-LRB-	O
+Q	O
+-RRB-	O
+/	O
+sub	O
+tors	O
+/	O
+is	O
+one	O
+of	O
+the	O
+following	O
+15	O
+groups	O
+E	O
+-LRB-	O
+Q	O
+-RRB-	O
+/	O
+sub	O
+tors	O
+/	O
+-LCB-	O
+Z/mZ	O
+,	O
+Z/mZ	O
+*	O
+Z/2mZ	O
+,	O
+m	O
+,	O
+=	O
+1	O
+,	O
+2	O
+,	O
+...	O
+,	O
+10	O
+,	O
+12	O
+,	O
+m	O
+=	O
+1	O
+,	O
+2	O
+,	O
+3	O
+,	O
+4	O
+.	O
+We	O
+say	O
+that	O
+an	O
+elliptic	O
+curve	O
+E	O
+'	O
+/	O
+Q	O
+is	O
+isogenous	O
+to	O
+the	O
+elliptic	O
+curve	O
+E	O
+if	O
+there	O
+is	O
+an	O
+isogeny	O
+,	O
+i.e.	O
+a	O
+morphism	O
+phi	O
+:	O
+E	O
+to	O
+E	O
+'	O
+such	O
+that	O
+phi	O
+-LRB-	O
+O	O
+-RRB-	O
+=	O
+O	O
+,	O
+where	O
+O	O
+is	O
+the	O
+point	O
+at	O
+infinity	O
+.	O
+We	O
+give	O
+an	O
+explicit	B-KEY
+model	I-KEY
+of	O
+all	O
+elliptic	O
+curves	O
+for	O
+which	O
+E	O
+-LRB-	O
+Q	O
+-RRB-	O
+/	O
+sub	O
+tors	O
+/	O
+is	O
+in	O
+the	O
+form	O
+Z/mZ	O
+where	O
+m	O
+=	O
+9,10,12	O
+or	O
+Z/2Z	O
+*	O
+Z/2mZ	O
+where	O
+m	O
+=	O
+4	O
+,	O
+according	O
+to	O
+Mazur	O
+'s	O
+theorem	O
+.	O
+Moreover	O
+,	O
+for	O
+every	O
+family	O
+of	O
+such	O
+elliptic	O
+curves	O
+,	O
+we	O
+give	O
+an	O
+explicit	B-KEY
+model	I-KEY
+of	O
+all	O
+their	O
+isogenous	O
+curves	O
+with	O
+cyclic	B-KEY
+kernels	I-KEY
+consisting	O
+of	O
+rational	B-KEY
+points	O
+
+The	O
+theory	O
+of	O
+information	O
+reversal	O
+The	O
+end	O
+of	O
+the	O
+industrial	B-KEY
+age	I-KEY
+coincides	O
+with	O
+the	O
+advent	O
+of	O
+the	O
+information	B-KEY
+society	I-KEY
+as	O
+the	O
+next	O
+model	O
+of	O
+social	O
+and	O
+economic	B-KEY
+organization	I-KEY
+,	O
+which	O
+brings	O
+about	O
+significant	O
+changes	O
+in	O
+the	O
+way	O
+modern	O
+man	O
+conceives	O
+work	O
+and	O
+the	O
+social	O
+environment	O
+.	O
+The	O
+functional	O
+basis	O
+of	O
+the	O
+new	O
+model	O
+is	O
+pivoted	O
+upon	O
+the	O
+effort	O
+to	O
+formulate	O
+the	O
+theory	O
+on	O
+the	O
+violent	O
+reversal	O
+of	O
+the	O
+basic	O
+relationship	O
+between	O
+man	O
+and	O
+information	O
+,	O
+and	O
+isolate	O
+it	O
+as	O
+one	O
+of	O
+the	O
+components	O
+for	O
+the	O
+creation	O
+of	O
+the	O
+new	O
+electronic	O
+reality	O
+.	O
+The	O
+objective	O
+of	O
+the	O
+theory	O
+of	O
+reversal	O
+is	O
+to	O
+effectively	O
+contribute	O
+to	O
+the	O
+formulation	O
+of	O
+a	O
+new	O
+definition	O
+consideration	O
+in	O
+regards	O
+to	O
+the	O
+concept	O
+of	O
+the	O
+emerging	O
+information	B-KEY
+society	I-KEY
+.	O
+In	O
+order	O
+to	O
+empirically	O
+apply	O
+the	O
+theory	O
+of	O
+reversal	O
+,	O
+we	O
+examine	O
+a	O
+case	B-KEY
+study	I-KEY
+based	O
+on	O
+the	O
+example	O
+of	O
+the	O
+digital	B-KEY
+library	I-KEY
+
+Fast	O
+,	O
+accurate	O
+and	O
+stable	O
+simulation	O
+of	O
+power	O
+electronic	O
+systems	O
+using	O
+virtual	B-KEY
+resistors	I-KEY
+and	O
+capacitors	O
+Simulation	O
+of	O
+power	O
+electronic	O
+circuits	O
+remains	O
+a	O
+problem	O
+due	O
+to	O
+the	O
+high	O
+level	O
+of	O
+stiffness	O
+brought	O
+about	O
+by	O
+the	O
+modelling	O
+of	O
+switches	O
+as	O
+biresistors	O
+i.e.	O
+very	O
+low	O
+turn-on	B-KEY
+resistance	I-KEY
+and	O
+very	O
+high	B-KEY
+turn-off	I-KEY
+resistance	I-KEY
+.	O
+The	O
+merits	O
+and	O
+drawbacks	O
+of	O
+two	O
+modelling	O
+methods	O
+that	O
+address	O
+this	O
+problem	O
+are	O
+discussed	O
+.	O
+A	O
+modelling	O
+solution	O
+for	O
+ensuring	O
+numerically	O
+stable	O
+,	O
+accurate	O
+and	O
+fast	O
+simulation	O
+of	O
+power	O
+electronic	O
+systems	O
+is	O
+proposed	O
+.	O
+The	O
+solution	O
+enables	O
+easy	O
+connectivity	O
+between	O
+power	O
+electronic	O
+elements	O
+in	O
+the	O
+simulation	O
+model	O
+.	O
+It	O
+involves	O
+the	O
+modelling	O
+of	O
+virtual	O
+capacitance	O
+at	O
+switching	B-KEY
+nodes	I-KEY
+to	O
+soften	O
+voltage	O
+discontinuity	O
+due	O
+to	O
+the	O
+switch	O
+current	O
+suddenly	O
+going	O
+to	O
+zero	O
+.	O
+Undesirable	O
+ringing	B-KEY
+effects	I-KEY
+that	O
+may	O
+arise	O
+due	O
+to	O
+the	O
+interaction	O
+between	O
+the	O
+virtual	O
+capacitance	O
+and	O
+circuit	O
+inductance	O
+are	O
+eliminated	O
+by	O
+modelling	O
+virtual	O
+damping	O
+resistors	O
+in	O
+parallel	O
+to	O
+inductors	O
+that	O
+are	O
+adjacent	O
+to	O
+switching	O
+elements	O
+.	O
+A	O
+midpoint	O
+configuration	O
+method	O
+is	O
+also	O
+introduced	O
+for	O
+modelling	O
+shunt	O
+capacitors	O
+.	O
+A	O
+DC	B-KEY
+traction	I-KEY
+system	I-KEY
+is	O
+simulated	O
+using	O
+this	O
+modelling	O
+strategy	O
+and	O
+the	O
+results	O
+are	O
+included	O
+.	O
+Simulation	O
+results	O
+obtained	O
+using	O
+this	O
+modelling	O
+strategy	O
+are	O
+validated	O
+by	O
+comparison	O
+with	O
+the	O
+established	O
+mesh	B-KEY
+analysis	I-KEY
+technique	I-KEY
+of	O
+modelling	O
+.	O
+The	O
+simulation	O
+performance	O
+is	O
+also	O
+compared	O
+with	O
+the	O
+Power	O
+System	O
+Blockset	O
+commercial	O
+software	O
+
+On	O
+a	O
+general	B-KEY
+constitutive	I-KEY
+description	I-KEY
+for	O
+the	O
+inelastic	O
+and	O
+failure	B-KEY
+behavior	I-KEY
+of	O
+fibrous	B-KEY
+laminates	I-KEY
+.	O
+I.	O
+Lamina	B-KEY
+theory	I-KEY
+It	O
+is	O
+well	O
+known	O
+that	O
+a	O
+structural	B-KEY
+design	I-KEY
+with	O
+isotropic	B-KEY
+materials	I-KEY
+can	O
+only	O
+be	O
+accomplished	O
+based	O
+on	O
+a	O
+stress	B-KEY
+failure	I-KEY
+criterion	I-KEY
+.	O
+This	O
+is	O
+,	O
+however	O
+,	O
+generally	O
+not	O
+true	O
+with	O
+laminated	O
+composites	B-KEY
+.	O
+Only	O
+when	O
+the	O
+laminate	O
+is	O
+subjected	O
+to	O
+an	O
+in-plane	B-KEY
+load	I-KEY
+,	O
+can	O
+the	O
+ultimate	O
+failure	O
+of	O
+the	O
+laminate	O
+correspond	O
+to	O
+its	O
+last-ply	B-KEY
+failure	I-KEY
+,	O
+and	O
+hence	O
+a	O
+stress	B-KEY
+failure	I-KEY
+criterion	I-KEY
+may	O
+be	O
+sufficient	O
+to	O
+detect	O
+the	O
+maximum	O
+load	O
+that	O
+can	O
+be	O
+sustained	O
+by	O
+the	O
+laminate	O
+.	O
+Even	O
+in	O
+such	O
+a	O
+case	O
+,	O
+the	O
+load	O
+shared	O
+by	O
+each	O
+lamina	O
+in	O
+the	O
+laminate	O
+can	O
+not	O
+be	O
+correctly	O
+determined	O
+if	O
+the	O
+lamina	O
+instantaneous	B-KEY
+stiffness	I-KEY
+matrix	I-KEY
+is	O
+inaccurately	O
+provided	O
+,	O
+since	O
+the	O
+lamina	O
+is	O
+always	O
+statically	O
+indeterminate	O
+in	O
+the	O
+laminate	O
+.	O
+If	O
+,	O
+however	O
+,	O
+the	O
+laminate	O
+is	O
+subjected	O
+to	O
+a	O
+lateral	B-KEY
+load	I-KEY
+,	O
+its	O
+ultimate	O
+failure	O
+occurs	O
+before	O
+last-ply	B-KEY
+failure	I-KEY
+and	O
+use	O
+of	O
+the	O
+stress	B-KEY
+failure	I-KEY
+criterion	I-KEY
+is	O
+no	O
+longer	O
+sufficient	O
+;	O
+an	O
+additional	O
+critical	O
+deflection	O
+or	O
+curvature	O
+condition	O
+must	O
+also	O
+be	O
+employed	O
+.	O
+This	O
+necessitates	O
+development	O
+of	O
+an	O
+efficient	O
+constitutive	O
+relationship	O
+for	O
+laminated	O
+composites	B-KEY
+in	O
+order	O
+that	O
+the	O
+laminate	O
+strains/deflections	O
+up	O
+to	O
+ultimate	O
+failure	O
+can	O
+be	O
+accurately	O
+calculated	O
+.	O
+A	O
+general	B-KEY
+constitutive	I-KEY
+description	I-KEY
+for	O
+the	O
+thermomechanical	B-KEY
+response	I-KEY
+of	O
+a	O
+fibrous	B-KEY
+laminate	I-KEY
+up	O
+to	O
+ultimate	O
+failure	O
+with	O
+applications	O
+to	O
+various	O
+fibrous	B-KEY
+laminates	I-KEY
+is	O
+presented	O
+in	O
+the	O
+two	O
+papers	O
+.	O
+The	O
+constitutive	O
+relationship	O
+is	O
+obtained	O
+by	O
+combining	O
+classical	O
+lamination	O
+theory	O
+with	O
+a	O
+recently	O
+developed	O
+bridging	O
+micromechanics	B-KEY
+model	I-KEY
+,	O
+through	O
+a	O
+layer-by-layer	B-KEY
+analysis	I-KEY
+.	O
+This	O
+paper	O
+focuses	O
+on	O
+lamina	O
+analysis	O
+
+Adaptive	O
+multiresolution	O
+approach	O
+for	O
+solution	O
+of	O
+hyperbolic	O
+PDEs	O
+This	O
+paper	O
+establishes	O
+an	O
+innovative	O
+and	O
+efficient	O
+multiresolution	B-KEY
+adaptive	I-KEY
+approach	I-KEY
+combined	O
+with	O
+high-resolution	B-KEY
+methods	I-KEY
+,	O
+for	O
+the	O
+numerical	B-KEY
+solution	I-KEY
+of	O
+a	O
+single	O
+or	O
+a	O
+system	O
+of	O
+partial	O
+differential	O
+equations	O
+.	O
+The	O
+proposed	O
+methodology	O
+is	O
+unconditionally	O
+bounded	O
+-LRB-	O
+even	O
+for	O
+hyperbolic	O
+equations	O
+-RRB-	O
+and	O
+dynamically	O
+adapts	O
+the	O
+grid	O
+so	O
+that	O
+higher	O
+spatial	B-KEY
+resolution	I-KEY
+is	O
+automatically	O
+allocated	O
+to	O
+domain	O
+regions	O
+where	O
+strong	B-KEY
+gradients	I-KEY
+are	O
+observed	O
+,	O
+thus	O
+possessing	O
+the	O
+two	O
+desired	O
+properties	O
+of	O
+a	O
+numerical	O
+approach	O
+:	O
+stability	B-KEY
+and	O
+accuracy	B-KEY
+.	O
+Numerical	O
+results	O
+for	O
+five	O
+test	O
+problems	O
+are	O
+presented	O
+which	O
+clearly	O
+show	O
+the	O
+robustness	B-KEY
+and	O
+cost	B-KEY
+effectiveness	I-KEY
+of	O
+the	O
+proposed	O
+method	O
+
+Design	O
+of	O
+a	O
+stroke	B-KEY
+dependent	I-KEY
+damper	I-KEY
+for	O
+the	O
+front	B-KEY
+axle	I-KEY
+suspension	I-KEY
+of	O
+a	O
+truck	O
+using	O
+multibody	B-KEY
+system	I-KEY
+dynamics	I-KEY
+and	O
+numerical	B-KEY
+optimization	I-KEY
+A	O
+stroke	B-KEY
+dependent	I-KEY
+damper	I-KEY
+is	O
+designed	O
+for	O
+the	O
+front	B-KEY
+axle	I-KEY
+suspension	I-KEY
+of	O
+a	O
+truck	O
+.	O
+The	O
+damper	O
+supplies	O
+extra	O
+damping	B-KEY
+for	O
+inward	B-KEY
+deflections	I-KEY
+rising	O
+above	O
+4	O
+cm	O
+.	O
+In	O
+this	O
+way	O
+the	O
+damper	O
+should	O
+reduce	O
+extreme	B-KEY
+suspension	I-KEY
+deflections	I-KEY
+without	O
+deteriorating	O
+the	O
+comfort	O
+of	O
+the	O
+truck	O
+.	O
+But	O
+the	O
+question	O
+is	O
+which	O
+stroke	O
+dependent	O
+damping	B-KEY
+curve	O
+yields	O
+the	O
+best	O
+compromise	O
+between	O
+suspension	O
+deflection	O
+working	O
+space	O
+and	O
+comfort	O
+.	O
+Therefore	O
+an	O
+optimization	O
+problem	O
+is	O
+defined	O
+to	O
+minimize	O
+the	O
+maximum	O
+inward	O
+suspension	O
+deflection	O
+subject	O
+to	O
+constraints	O
+on	O
+the	O
+chassis	B-KEY
+acceleration	I-KEY
+for	O
+three	O
+typical	O
+road	B-KEY
+undulations	I-KEY
+.	O
+The	O
+optimization	O
+problem	O
+is	O
+solved	O
+using	O
+sequential	B-KEY
+linear	I-KEY
+programming	I-KEY
+-LRB-	O
+SLP	O
+-RRB-	O
+and	O
+multibody	O
+dynamics	O
+simulation	O
+software	O
+.	O
+Several	O
+optimization	O
+runs	O
+have	O
+been	O
+carried	O
+out	O
+for	O
+a	O
+small	O
+two	O
+degree	O
+of	O
+freedom	O
+vehicle	O
+model	O
+and	O
+a	O
+large	O
+full-scale	B-KEY
+model	I-KEY
+of	O
+the	O
+truck	B-KEY
+semi-trailer	I-KEY
+combination	I-KEY
+.	O
+The	O
+results	O
+show	O
+that	O
+the	O
+stroke	O
+dependent	O
+damping	B-KEY
+can	O
+reduce	O
+large	O
+deflections	O
+at	O
+incidental	B-KEY
+road	I-KEY
+disturbances	I-KEY
+,	O
+but	O
+that	O
+the	O
+optimum	O
+stroke	O
+dependent	O
+damping	B-KEY
+curve	O
+is	O
+related	O
+to	O
+the	O
+acceleration	B-KEY
+bound	I-KEY
+.	O
+By	O
+means	O
+of	O
+vehicle	B-KEY
+model	I-KEY
+simulation	I-KEY
+and	O
+numerical	B-KEY
+optimization	I-KEY
+we	O
+have	O
+been	O
+able	O
+to	O
+quantify	O
+this	O
+trade-off	O
+between	O
+suspension	O
+deflection	O
+working	O
+space	O
+and	O
+truck	B-KEY
+comfort	I-KEY
+
+Decentralized	O
+adaptive	O
+output	O
+feedback	O
+stabilization	O
+for	O
+a	O
+class	O
+of	O
+interconnected	O
+systems	O
+with	O
+unknown	O
+bound	O
+of	O
+uncertainties	O
+The	O
+problem	O
+of	O
+adaptive	B-KEY
+decentralized	I-KEY
+stabilization	I-KEY
+for	O
+a	O
+class	O
+of	O
+linear	O
+time-invarying	O
+large-scale	O
+systems	O
+with	O
+nonlinear	O
+interconnectivity	O
+and	O
+uncertainties	O
+is	O
+discussed	O
+.	O
+The	O
+bounds	O
+of	O
+uncertainties	O
+are	O
+assumed	O
+to	O
+be	O
+unknown	O
+.	O
+For	O
+such	O
+uncertain	B-KEY
+dynamic	I-KEY
+systems	I-KEY
+,	O
+an	O
+adaptive	O
+decentralized	O
+controller	O
+is	O
+presented	O
+.	O
+The	O
+resulting	O
+closed-loop	B-KEY
+systems	I-KEY
+are	O
+asymptotically	O
+stable	O
+in	O
+theory	O
+.	O
+Moreover	O
+,	O
+an	O
+adaptive	O
+decentralized	O
+control	O
+scheme	O
+is	O
+given	O
+.	O
+The	O
+scheme	O
+ensures	O
+the	O
+closed-loop	B-KEY
+systems	I-KEY
+exponentially	O
+practically	O
+stable	O
+and	O
+can	O
+be	O
+used	O
+in	O
+practical	O
+engineering	O
+.	O
+Finally	O
+,	O
+simulations	O
+show	O
+that	O
+the	O
+control	O
+scheme	O
+is	O
+effective	O
+
+Strong	B-KEY
+completeness	I-KEY
+of	O
+lattice-valued	B-KEY
+logic	I-KEY
+This	O
+paper	O
+shows	O
+strong	B-KEY
+completeness	I-KEY
+of	O
+the	O
+system	O
+L	O
+for	O
+lattice	O
+valued	O
+logic	O
+given	O
+by	O
+S.	O
+Titani	O
+-LRB-	O
+1999	O
+-RRB-	O
+,	O
+in	O
+which	O
+she	O
+formulates	O
+a	O
+lattice-valued	B-KEY
+set	I-KEY
+theory	I-KEY
+by	O
+introducing	O
+the	O
+logical	O
+implication	O
+which	O
+represents	O
+the	O
+order	B-KEY
+relation	I-KEY
+on	O
+the	O
+lattice	O
+.	O
+Syntax	B-KEY
+and	O
+semantics	B-KEY
+concerned	O
+are	O
+described	O
+and	O
+strong	B-KEY
+completeness	I-KEY
+is	O
+proved	O
+
+Organizational	B-KEY
+design	I-KEY
+,	O
+information	B-KEY
+transfer	I-KEY
+,	O
+and	O
+the	O
+acquisition	O
+of	O
+rent-producing	B-KEY
+resources	I-KEY
+Within	O
+the	O
+resource-based	O
+view	O
+of	O
+the	O
+firm	O
+,	O
+a	O
+dynamic	O
+story	O
+has	O
+emerged	O
+in	O
+which	O
+the	O
+knowledge	O
+accumulated	O
+over	O
+the	O
+history	O
+of	O
+a	O
+firm	O
+and	O
+embedded	O
+in	O
+organizational	O
+routines	O
+and	O
+structures	O
+influences	O
+the	O
+firm	O
+'s	O
+ability	O
+to	O
+recognize	O
+the	O
+value	O
+of	O
+new	O
+resources	O
+and	O
+capabilities	O
+.	O
+This	O
+paper	O
+explores	O
+the	O
+possibility	O
+of	O
+firms	O
+to	O
+select	O
+organizational	B-KEY
+designs	I-KEY
+that	O
+increase	O
+the	O
+likelihood	O
+that	O
+they	O
+will	O
+recognize	O
+and	O
+value	O
+rent-producing	B-KEY
+resources	I-KEY
+and	O
+capabilities	O
+.	O
+A	O
+computational	B-KEY
+model	I-KEY
+is	O
+developed	O
+to	O
+study	O
+the	O
+tension	O
+between	O
+an	O
+organization	O
+'s	O
+desire	O
+to	O
+explore	O
+its	O
+environment	O
+for	O
+new	O
+capabilities	O
+and	O
+the	O
+organization	O
+'s	O
+need	O
+to	O
+exploit	O
+existing	O
+capabilities	O
+.	O
+Support	O
+is	O
+provided	O
+for	O
+the	O
+proposition	O
+that	O
+integration	O
+,	O
+both	O
+externally	O
+and	O
+internally	O
+,	O
+is	O
+an	O
+important	O
+source	O
+of	O
+dynamic	O
+capability	O
+.	O
+The	O
+model	O
+provides	O
+greater	O
+insight	O
+into	O
+the	O
+tradeoffs	O
+between	O
+these	O
+two	O
+forms	O
+of	O
+integration	O
+and	O
+suggests	O
+when	O
+one	O
+form	O
+may	O
+be	O
+preferred	O
+over	O
+another	O
+.	O
+In	O
+particular	O
+,	O
+evidence	O
+is	O
+provided	O
+that	O
+in	O
+uncertain	B-KEY
+environments	I-KEY
+,	O
+the	O
+ability	O
+to	O
+explore	O
+possible	O
+alternatives	O
+is	O
+critical	O
+while	O
+in	O
+more	O
+certain	B-KEY
+environments	I-KEY
+,	O
+the	O
+ability	O
+to	O
+transfer	O
+information	O
+internally	O
+is	O
+paramount	O
+
+Existence	B-KEY
+theorems	I-KEY
+for	O
+nonconvex	B-KEY
+problems	I-KEY
+of	O
+variational	B-KEY
+calculus	I-KEY
+A	O
+solution	O
+to	O
+a	O
+variational	B-KEY
+calculus	I-KEY
+problem	O
+is	O
+studied	O
+under	O
+the	O
+conditions	O
+of	O
+integrant	B-KEY
+convexity	I-KEY
+.	O
+The	O
+existence	B-KEY
+theorem	I-KEY
+is	O
+proved	O
+.	O
+As	O
+an	O
+example	O
+,	O
+a	O
+function	O
+is	O
+given	O
+,	O
+which	O
+satisfies	O
+all	O
+the	O
+conditions	O
+of	O
+the	O
+theorem	O
+but	O
+is	O
+not	O
+convex	O
+
+Ecological	B-KEY
+interface	I-KEY
+design	I-KEY
+:	O
+progress	O
+and	O
+challenges	O
+Ecological	B-KEY
+interface	I-KEY
+design	I-KEY
+-LRB-	O
+EID	O
+-RRB-	O
+is	O
+a	O
+theoretical	O
+framework	O
+for	O
+designing	O
+human-computer	B-KEY
+interfaces	I-KEY
+for	O
+complex	O
+socio-technical	O
+systems	O
+.	O
+Its	O
+primary	O
+aim	O
+is	O
+to	O
+support	O
+knowledge	O
+workers	O
+in	O
+adapting	O
+to	O
+change	O
+and	O
+novelty	O
+.	O
+This	O
+literature	O
+review	O
+shows	O
+that	O
+in	O
+situations	O
+requiring	O
+problem	O
+solving	O
+,	O
+EID	O
+improves	O
+performance	O
+when	O
+compared	O
+with	O
+current	O
+design	O
+approaches	O
+in	O
+industry	B-KEY
+.	O
+EID	O
+has	O
+been	O
+applied	O
+to	O
+industry-scale	O
+problems	O
+in	O
+a	O
+broad	O
+variety	O
+of	O
+application	O
+domains	O
+-LRB-	O
+e.g.	O
+,	O
+process	O
+control	O
+,	O
+aviation	O
+,	O
+computer	O
+network	O
+management	O
+,	O
+software	O
+engineering	O
+,	O
+medicine	O
+,	O
+command	O
+and	O
+control	O
+,	O
+and	O
+information	O
+retrieval	O
+-RRB-	O
+and	O
+has	O
+consistently	O
+led	O
+to	O
+the	O
+identification	O
+of	O
+new	O
+information	O
+requirements	O
+.	O
+An	O
+experimental	O
+evaluation	O
+of	O
+EID	O
+using	O
+a	O
+full-fidelity	O
+simulator	O
+with	O
+professional	O
+workers	O
+has	O
+yet	O
+to	O
+be	O
+conducted	O
+,	O
+although	O
+some	O
+are	O
+planned	O
+.	O
+Several	O
+significant	O
+challenges	O
+remain	O
+as	O
+obstacles	O
+to	O
+the	O
+confident	O
+use	O
+of	O
+EID	O
+in	O
+industry	B-KEY
+.	O
+Promising	O
+paths	O
+for	O
+addressing	O
+these	O
+outstanding	O
+issues	O
+are	O
+identified	O
+.	O
+Actual	O
+or	O
+potential	O
+applications	O
+of	O
+this	O
+research	O
+include	O
+improving	O
+the	O
+safety	O
+and	O
+productivity	B-KEY
+of	O
+complex	O
+socio-technical	O
+systems	O
+
+Automatic	O
+extraction	O
+of	O
+eye	O
+and	O
+mouth	O
+fields	O
+from	O
+a	O
+face	O
+image	O
+using	O
+eigenfeatures	B-KEY
+and	O
+ensemble	O
+networks	O
+This	O
+paper	O
+presents	O
+a	O
+novel	O
+algorithm	O
+for	O
+the	O
+extraction	O
+of	O
+the	O
+eye	O
+and	O
+mouth	O
+-LRB-	O
+facial	O
+features	O
+-RRB-	O
+fields	O
+from	O
+2D	B-KEY
+gray	I-KEY
+level	I-KEY
+images	I-KEY
+.	O
+Eigenfeatures	B-KEY
+are	O
+derived	O
+from	O
+the	O
+eigenvalues	B-KEY
+and	O
+eigenvectors	B-KEY
+of	O
+the	O
+binary	B-KEY
+edge	I-KEY
+data	I-KEY
+set	I-KEY
+constructed	O
+from	O
+eye	O
+and	O
+mouth	O
+fields	O
+.	O
+Such	O
+eigenfeatures	B-KEY
+are	O
+ideal	O
+features	O
+for	O
+finely	O
+locating	O
+fields	O
+efficiently	O
+.	O
+The	O
+eigenfeatures	B-KEY
+are	O
+extracted	O
+from	O
+a	O
+set	O
+of	O
+the	O
+positive	O
+and	O
+negative	O
+training	B-KEY
+samples	I-KEY
+for	O
+facial	O
+features	O
+and	O
+are	O
+used	O
+to	O
+train	O
+a	O
+multilayer	B-KEY
+perceptron	I-KEY
+-LRB-	O
+MLP	O
+-RRB-	O
+whose	O
+output	O
+indicates	O
+the	O
+degree	O
+to	O
+which	O
+a	O
+particular	O
+image	O
+window	O
+contains	O
+the	O
+eyes	O
+or	O
+the	O
+mouth	O
+within	O
+itself	O
+.	O
+An	O
+ensemble	O
+network	O
+consisting	O
+of	O
+a	O
+multitude	O
+of	O
+independent	O
+MLPs	O
+was	O
+used	O
+to	O
+enhance	O
+the	O
+generalization	B-KEY
+performance	O
+of	O
+a	O
+single	O
+MLP	O
+.	O
+It	O
+was	O
+experimentally	O
+verified	O
+that	O
+the	O
+proposed	O
+algorithm	O
+is	O
+robust	O
+against	O
+facial	O
+size	O
+and	O
+even	O
+slight	O
+variations	O
+of	O
+the	O
+pose	O
+
+John	B-KEY
+McCarthy	I-KEY
+:	O
+father	B-KEY
+of	I-KEY
+AI	I-KEY
+If	O
+John	B-KEY
+McCarthy	I-KEY
+,	O
+the	O
+father	B-KEY
+of	I-KEY
+AI	I-KEY
+,	O
+were	O
+to	O
+coin	O
+a	O
+new	O
+phrase	O
+for	O
+``	O
+artificial	B-KEY
+intelligence	I-KEY
+''	O
+today	O
+,	O
+he	O
+would	O
+probably	O
+use	O
+``	O
+computational	B-KEY
+intelligence	I-KEY
+.	O
+''	O
+McCarthy	O
+is	O
+not	O
+just	O
+the	O
+father	B-KEY
+of	I-KEY
+AI	I-KEY
+,	O
+he	O
+is	O
+also	O
+the	O
+inventor	O
+of	O
+the	O
+Lisp	B-KEY
+-LRB-	O
+list	B-KEY
+processing	I-KEY
+-RRB-	O
+language	O
+.	O
+The	O
+author	O
+considers	O
+McCarthy	O
+'s	O
+conception	O
+of	O
+Lisp	B-KEY
+and	O
+discusses	O
+McCarthy	O
+'s	O
+recent	O
+research	O
+that	O
+involves	O
+elaboration	B-KEY
+tolerance	I-KEY
+,	O
+creativity	B-KEY
+by	O
+machines	O
+,	O
+free	B-KEY
+will	I-KEY
+of	O
+machines	O
+,	O
+and	O
+some	O
+improved	O
+ways	O
+of	O
+doing	O
+situation	B-KEY
+calculus	I-KEY
+
+Dedekind	B-KEY
+zeta-functions	I-KEY
+and	O
+Dedekind	B-KEY
+sums	I-KEY
+In	O
+this	O
+paper	O
+we	O
+use	O
+Dedekind	O
+zeta	O
+functions	O
+of	O
+two	O
+real	B-KEY
+quadratic	I-KEY
+number	I-KEY
+fields	I-KEY
+at	O
+-1	O
+to	O
+denote	O
+Dedekind	B-KEY
+sums	I-KEY
+of	O
+high	O
+rank	O
+.	O
+Our	O
+formula	O
+is	O
+different	O
+from	O
+that	O
+of	O
+Siegel	O
+'s	O
+-LRB-	O
+1969	O
+-RRB-	O
+.	O
+As	O
+an	O
+application	O
+,	O
+we	O
+get	O
+a	O
+polynomial	B-KEY
+representation	I-KEY
+of	O
+zeta	O
+/	O
+sub	O
+K	O
+/	O
+-LRB-	O
+-1	O
+-RRB-	O
+=	O
+zeta	O
+/	O
+sub	O
+K	O
+/	O
+-LRB-	O
+-1	O
+-RRB-	O
+=	O
+1/45	O
+-LRB-	O
+26n/sup	O
+3	O
+/	O
+-	O
+41n	O
++	O
+or	O
+-	O
+9	O
+-RRB-	O
+,	O
+n	O
+identical	O
+to	O
++	O
+or-2	O
+-LRB-	O
+mod	O
+5	O
+-RRB-	O
+,	O
+where	O
+K	O
+=	O
+Q	O
+-LRB-	O
+square	O
+root	O
+-LRB-	O
+5q	O
+-RRB-	O
+-RRB-	O
+,	O
+prime	O
+q	O
+=	O
+4n/sup	O
+2	O
+/	O
++	O
+1	O
+,	O
+and	O
+the	O
+class	O
+number	O
+of	O
+quadratic	O
+number	O
+field	O
+K/sub	O
+2	O
+/	O
+=	O
+Q	O
+-LRB-	O
+square	O
+root	O
+q	O
+-RRB-	O
+is	O
+1	O
+
+Technology	O
+in	O
+distance	B-KEY
+education	I-KEY
+:	O
+a	O
+global	B-KEY
+perspective	I-KEY
+to	O
+alternative	O
+delivery	O
+mechanisms	O
+Technology	O
+is	O
+providing	O
+a	O
+positive	O
+impact	O
+on	O
+delivery	O
+mechanisms	O
+employed	O
+in	O
+distance	B-KEY
+education	I-KEY
+at	O
+the	O
+university	O
+level	O
+.	O
+Some	O
+institutions	O
+are	O
+incorporating	O
+distance	B-KEY
+education	I-KEY
+as	O
+a	O
+way	O
+to	O
+extend	O
+the	O
+classroom	O
+.	O
+Other	O
+institutions	O
+are	O
+investigating	O
+new	O
+delivery	O
+mechanisms	O
+,	O
+which	O
+support	O
+a	O
+revised	O
+perspective	O
+on	O
+education	O
+.	O
+These	O
+latter	O
+institutions	O
+are	O
+revising	O
+their	O
+processes	O
+for	O
+interacting	O
+with	O
+students	O
+,	O
+and	O
+taking	O
+a	O
+more	O
+``	O
+learner	O
+centered	O
+''	O
+approach	O
+to	O
+the	O
+delivery	O
+of	O
+education	O
+.	O
+This	O
+article	O
+discusses	O
+the	O
+impact	O
+of	O
+technology	O
+on	O
+the	O
+delivery	O
+mechanisms	O
+employed	O
+in	O
+distance	B-KEY
+education	I-KEY
+.	O
+A	O
+framework	O
+is	O
+proposed	O
+here	O
+,	O
+which	O
+presents	O
+a	O
+description	O
+of	O
+alternative	O
+modes	O
+of	O
+generic	O
+delivery	O
+mechanisms	O
+.	O
+It	O
+is	O
+suggested	O
+that	O
+those	O
+institutions	O
+,	O
+which	O
+adopt	O
+a	O
+delivery	O
+mechanism	O
+employing	O
+an	O
+asynchronous	B-KEY
+mode	I-KEY
+,	O
+can	O
+gain	O
+the	O
+most	O
+benefit	O
+from	O
+technology	O
+.	O
+This	O
+approach	O
+seems	O
+to	O
+represent	O
+the	O
+only	O
+truly	O
+innovative	O
+use	O
+of	O
+technology	O
+in	O
+distance	B-KEY
+education	I-KEY
+.	O
+The	O
+approach	O
+creates	O
+a	O
+student-oriented	O
+environment	O
+while	O
+maintaining	O
+high	O
+levels	O
+of	O
+interaction	O
+,	O
+both	O
+of	O
+which	O
+are	O
+factors	O
+that	O
+contribute	O
+to	O
+student	B-KEY
+satisfaction	I-KEY
+with	O
+their	O
+overall	O
+educational	O
+experience	O
+
+Development	O
+of	O
+computer-mediated	O
+teaching	O
+resources	O
+for	O
+tourism	O
+distance	O
+education	O
+:	O
+the	O
+University	B-KEY
+of	I-KEY
+Otago	I-KEY
+model	O
+This	O
+article	O
+presents	O
+a	O
+qualitative	O
+account	O
+of	O
+the	O
+development	O
+of	O
+computer-mediated	B-KEY
+tourism	I-KEY
+distance	I-KEY
+learning	I-KEY
+resources	I-KEY
+.	O
+A	O
+distance	O
+learning	O
+model	O
+was	O
+developed	O
+at	O
+the	O
+Centre	O
+for	O
+Tourism	O
+,	O
+University	B-KEY
+of	I-KEY
+Otago	I-KEY
+-LRB-	O
+New	O
+Zealand	O
+-RRB-	O
+in	O
+1998-1999	O
+.	O
+The	O
+article	O
+reviews	O
+the	O
+development	O
+of	O
+this	O
+Internet-based	B-KEY
+learning	I-KEY
+resource	I-KEY
+explaining	O
+the	O
+design	O
+and	O
+development	O
+of	O
+programme	B-KEY
+links	I-KEY
+-LRB-	O
+providing	O
+study	O
+information	O
+for	O
+students	O
+-RRB-	O
+and	O
+paper	B-KEY
+links	I-KEY
+-LRB-	O
+course	O
+material	O
+and	O
+learning	O
+features	O
+-RRB-	O
+.	O
+The	O
+design	O
+of	O
+course	O
+material	O
+is	O
+reviewed	O
+with	O
+emphasis	O
+given	O
+to	O
+consistency	O
+of	O
+presentation	O
+between	O
+papers	O
+.	O
+The	O
+template	O
+for	O
+course	O
+material	O
+is	O
+described	O
+and	O
+illustrated	O
+and	O
+the	O
+article	O
+concludes	O
+with	O
+an	O
+overview	O
+of	O
+important	O
+design	O
+considerations	O
+
+Parcel	B-KEY
+boundary	I-KEY
+identification	I-KEY
+with	O
+computer-assisted	O
+boundary	O
+overlay	O
+process	O
+for	O
+Taiwan	B-KEY
+The	O
+study	O
+investigates	O
+the	O
+design	O
+of	O
+a	O
+process	O
+for	O
+parcel	B-KEY
+boundary	I-KEY
+identification	I-KEY
+with	O
+cadastral	B-KEY
+map	I-KEY
+overlay	I-KEY
+using	O
+the	O
+principle	O
+of	O
+least	O
+squares	O
+.	O
+The	O
+objective	O
+of	O
+this	O
+research	O
+is	O
+to	O
+provide	O
+an	O
+objective	B-KEY
+tool	I-KEY
+for	O
+boundary	B-KEY
+identification	I-KEY
+survey	I-KEY
+.	O
+The	O
+proposed	O
+process	O
+includes	O
+an	O
+adjustment	B-KEY
+model	I-KEY
+,	O
+a	O
+weighting	B-KEY
+scheme	I-KEY
+,	O
+and	O
+other	O
+related	O
+operations	O
+.	O
+A	O
+numerical	O
+example	O
+is	O
+included	O
+
+On	O
+lag	B-KEY
+windows	I-KEY
+connected	O
+with	O
+Jacobi	B-KEY
+polynomials	I-KEY
+Lag	B-KEY
+windows	I-KEY
+whose	O
+corresponding	O
+spectral	B-KEY
+windows	I-KEY
+are	O
+Jacobi	B-KEY
+polynomials	I-KEY
+or	O
+sums	O
+of	O
+Jacobi	B-KEY
+polynomials	I-KEY
+are	O
+introduced	O
+.	O
+The	O
+bias	O
+and	O
+variance	O
+of	O
+their	O
+spectral	B-KEY
+density	I-KEY
+estimators	I-KEY
+are	O
+investigated	O
+and	O
+their	O
+window	B-KEY
+bandwidth	I-KEY
+and	O
+characteristic	B-KEY
+exponent	I-KEY
+are	O
+determined	O
+
+The	O
+effects	O
+of	O
+technology	O
+on	O
+midcareer	B-KEY
+librarians	I-KEY
+This	O
+article	O
+investigates	O
+technology	B-KEY
+competency	I-KEY
+requirements	I-KEY
+in	O
+the	O
+library	B-KEY
+profession	I-KEY
+.	O
+Using	O
+the	O
+position	O
+advertisements	O
+in	O
+American	O
+Libraries	O
+in	O
+five-year	O
+increments	O
+over	O
+a	O
+twenty-year	O
+period	O
+-LRB-	O
+1970-1990	O
+-RRB-	O
+,	O
+the	O
+article	O
+examines	O
+and	O
+evaluates	O
+the	O
+advertised	O
+qualifications	O
+of	O
+positions	O
+and	O
+attempts	O
+to	O
+see	O
+if	O
+midcareer	O
+librarians-especially	O
+those	O
+who	O
+have	O
+achieved	O
+their	O
+degree	O
+prior	O
+to	O
+the	O
+change	O
+in	O
+MLS	O
+curriculum	O
+that	O
+currently	O
+emphasizes	O
+technology-are	O
+``	O
+effective	O
+''	O
+librarians	O
+in	O
+the	O
+present	O
+and	O
+future	O
+job	B-KEY
+market	I-KEY
+
+What	O
+'s	O
+best	O
+practice	O
+for	O
+open	B-KEY
+access	I-KEY
+?	O
+The	O
+business	B-KEY
+of	O
+publishing	O
+journals	O
+is	O
+in	O
+transition	O
+.	O
+Nobody	O
+knows	O
+exactly	O
+how	O
+it	O
+will	O
+work	O
+in	O
+the	O
+future	O
+,	O
+but	O
+everybody	O
+knows	O
+that	O
+the	O
+electronic	B-KEY
+publishing	I-KEY
+revolution	O
+will	O
+ensure	O
+it	O
+wo	O
+n't	O
+work	O
+as	O
+it	O
+does	O
+now	O
+.	O
+This	O
+knowledge	O
+has	O
+provoked	O
+a	O
+growing	O
+sense	O
+of	O
+nervous	O
+anticipation	O
+among	O
+those	O
+concerned	O
+,	O
+some	O
+edgy	O
+and	O
+threatened	O
+by	O
+potential	O
+changes	O
+to	O
+their	O
+business	B-KEY
+,	O
+others	O
+excited	O
+by	O
+the	O
+prospect	O
+of	O
+change	O
+and	O
+opportunity	O
+.	O
+The	O
+paper	O
+discusses	O
+the	O
+open	B-KEY
+publishing	I-KEY
+model	I-KEY
+for	O
+dissemination	O
+of	O
+research	O
+
+Explicit	O
+solutions	O
+for	O
+transcendental	B-KEY
+equations	I-KEY
+A	O
+simple	O
+method	O
+to	O
+formulate	O
+an	O
+explicit	O
+expression	O
+for	O
+the	O
+roots	O
+of	O
+any	O
+analytic	O
+transcendental	O
+function	O
+is	O
+presented	O
+.	O
+The	O
+method	O
+is	O
+based	O
+on	O
+Cauchy	O
+'s	O
+integral	O
+theorem	O
+and	O
+uses	O
+only	O
+basic	O
+concepts	O
+of	O
+complex	B-KEY
+integration	I-KEY
+.	O
+A	O
+convenient	O
+method	O
+for	O
+numerically	O
+evaluating	O
+the	O
+exact	O
+expression	O
+is	O
+presented	O
+.	O
+The	O
+application	O
+of	O
+both	O
+the	O
+formulation	O
+and	O
+evaluation	O
+of	O
+the	O
+exact	O
+expression	O
+is	O
+illustrated	O
+for	O
+several	O
+classical	O
+root	B-KEY
+finding	I-KEY
+problems	O
+
+Cutting	O
+the	O
+cord	O
+-LSB-	O
+wireless	O
+health	O
+care	O
+-RSB-	O
+More	O
+and	O
+more	O
+healthcare	B-KEY
+executives	O
+are	O
+electing	O
+to	O
+cut	O
+the	O
+cord	O
+to	O
+their	O
+existing	O
+computer	O
+systems	O
+by	O
+implementing	O
+mobile	O
+technology	O
+.	O
+The	O
+allure	O
+of	O
+information	O
+anywhere	O
+,	O
+anytime	O
+is	O
+intoxicating	O
+,	O
+demonstrated	O
+by	O
+the	O
+cell	O
+phones	O
+and	O
+personal	O
+digital	O
+assistants	O
+-LRB-	O
+PDAs	O
+-RRB-	O
+that	O
+adorn	O
+today	O
+'s	O
+professionals	O
+.	O
+The	O
+utility	O
+and	O
+convenience	O
+of	O
+these	O
+devices	O
+is	O
+undeniable	O
+.	O
+But	O
+what	O
+is	O
+the	O
+best	O
+strategy	O
+for	O
+implementing	O
+a	O
+mobile	O
+solution	O
+within	O
+a	O
+healthcare	B-KEY
+enterprise	O
+,	O
+be	O
+it	O
+large	O
+or	O
+small-and	O
+under	O
+what	O
+circumstances	O
+?	O
+What	O
+types	O
+of	O
+healthcare	B-KEY
+workers	O
+benefit	O
+most	O
+from	O
+mobile	O
+technology	O
+?	O
+And	O
+how	O
+state-of-the-art	O
+is	O
+security	B-KEY
+for	O
+wireless	O
+applications	O
+and	O
+devices	O
+?	O
+These	O
+are	O
+the	O
+questions	O
+that	O
+healthcare	B-KEY
+executives	O
+are	O
+asking-and	O
+should	O
+be	O
+asking-as	O
+they	O
+evaluate	O
+mobile	O
+solutions	O
+
+A	O
+regularized	B-KEY
+conjugate	I-KEY
+gradient	I-KEY
+method	I-KEY
+for	O
+symmetric	B-KEY
+positive	I-KEY
+definite	I-KEY
+system	I-KEY
+of	O
+linear	B-KEY
+equations	I-KEY
+A	O
+class	O
+of	O
+regularized	B-KEY
+conjugate	I-KEY
+gradient	I-KEY
+methods	I-KEY
+is	O
+presented	O
+for	O
+solving	O
+the	O
+large	B-KEY
+sparse	I-KEY
+system	I-KEY
+of	O
+linear	B-KEY
+equations	I-KEY
+of	O
+which	O
+the	O
+coefficient	B-KEY
+matrix	I-KEY
+is	O
+an	O
+ill-conditioned	O
+symmetric	O
+positive	O
+definite	O
+matrix	O
+.	O
+The	O
+convergence	B-KEY
+properties	I-KEY
+of	O
+these	O
+methods	O
+are	O
+discussed	O
+in	O
+depth	O
+,	O
+and	O
+the	O
+best	O
+possible	O
+choices	O
+of	O
+the	O
+parameters	O
+involved	O
+in	O
+the	O
+new	O
+methods	O
+are	O
+investigated	O
+in	O
+detail	O
+.	O
+Numerical	O
+computations	O
+show	O
+that	O
+the	O
+new	O
+methods	O
+are	O
+more	O
+efficient	O
+and	O
+robust	O
+than	O
+both	O
+classical	B-KEY
+relaxation	I-KEY
+methods	I-KEY
+and	O
+classical	B-KEY
+conjugate	I-KEY
+direction	I-KEY
+methods	I-KEY
+
+Riccati-based	B-KEY
+preconditioner	I-KEY
+for	O
+computing	O
+invariant	B-KEY
+subspaces	I-KEY
+of	O
+large	B-KEY
+matrices	I-KEY
+This	O
+paper	O
+introduces	O
+and	O
+analyzes	O
+the	O
+convergence	O
+properties	O
+of	O
+a	O
+method	O
+that	O
+computes	O
+an	O
+approximation	O
+to	O
+the	O
+invariant	B-KEY
+subspace	I-KEY
+associated	O
+with	O
+a	O
+group	O
+of	O
+eigenvalues	B-KEY
+of	O
+a	O
+large	O
+not	O
+necessarily	O
+diagonalizable	B-KEY
+matrix	I-KEY
+.	O
+The	O
+method	O
+belongs	O
+to	O
+the	O
+family	O
+of	O
+projection	B-KEY
+type	I-KEY
+methods	I-KEY
+.	O
+At	O
+each	O
+step	O
+,	O
+it	O
+refines	O
+the	O
+approximate	O
+invariant	B-KEY
+subspace	I-KEY
+using	O
+a	O
+linearized	O
+Riccati	O
+'s	O
+equation	O
+which	O
+turns	O
+out	O
+to	O
+be	O
+the	O
+block	O
+analogue	O
+of	O
+the	O
+correction	O
+used	O
+in	O
+the	O
+Jacobi-Davidson	B-KEY
+method	I-KEY
+.	O
+The	O
+analysis	O
+conducted	O
+in	O
+this	O
+paper	O
+shows	O
+that	O
+the	O
+method	O
+converges	O
+at	O
+a	O
+rate	O
+quasi-quadratic	O
+provided	O
+that	O
+the	O
+approximate	O
+invariant	B-KEY
+subspace	I-KEY
+is	O
+close	O
+to	O
+the	O
+exact	O
+one	O
+.	O
+The	O
+implementation	O
+of	O
+the	O
+method	O
+based	O
+on	O
+multigrid	B-KEY
+techniques	I-KEY
+is	O
+also	O
+discussed	O
+and	O
+numerical	O
+experiments	O
+are	O
+reported	O
+
+Time-domain	B-KEY
+reconstruction	I-KEY
+for	O
+thermoacoustic	B-KEY
+tomography	I-KEY
+in	O
+a	O
+spherical	B-KEY
+geometry	I-KEY
+Reconstruction-based	O
+microwave-induced	O
+thermoacoustic	B-KEY
+tomography	I-KEY
+in	O
+a	O
+spherical	O
+configuration	O
+is	O
+presented	O
+.	O
+Thermoacoustic	O
+waves	O
+from	O
+biological	B-KEY
+tissue	I-KEY
+samples	I-KEY
+excited	O
+by	O
+microwave	O
+pulses	O
+are	O
+measured	O
+by	O
+a	O
+wide-band	B-KEY
+unfocused	I-KEY
+ultrasonic	I-KEY
+transducer	I-KEY
+,	O
+which	O
+is	O
+set	O
+on	O
+a	O
+spherical	O
+surface	O
+enclosing	O
+the	O
+sample	O
+.	O
+Sufficient	O
+data	O
+are	O
+acquired	O
+from	O
+different	O
+directions	O
+to	O
+reconstruct	O
+the	O
+microwave	O
+absorption	O
+distribution	O
+.	O
+An	O
+exact	B-KEY
+reconstruction	I-KEY
+solution	I-KEY
+is	O
+derived	O
+and	O
+approximated	O
+to	O
+a	O
+modified	B-KEY
+backprojection	I-KEY
+algorithm	I-KEY
+.	O
+Experiments	O
+demonstrate	O
+that	O
+the	O
+reconstructed	B-KEY
+images	I-KEY
+agree	O
+well	O
+with	O
+the	O
+original	O
+samples	O
+.	O
+The	O
+spatial	O
+resolution	O
+of	O
+the	O
+system	O
+reaches	O
+0.5	B-KEY
+mm	I-KEY
+
+Computing	O
+grid	O
+unlocks	O
+research	O
+Under	O
+the	O
+UK	O
+government	O
+'s	O
+spending	O
+review	O
+in	O
+2000	O
+the	O
+Office	O
+of	O
+Science	O
+and	O
+Technology	O
+was	O
+allocated	O
+Pounds	O
+98m	O
+to	O
+establish	O
+a	O
+three	O
+year	O
+e-science	B-KEY
+research	O
+and	O
+development	O
+programme	O
+.	O
+The	O
+programme	O
+has	O
+a	O
+bold	O
+vision	O
+:	O
+to	O
+change	O
+the	O
+dynamic	O
+of	O
+the	O
+way	O
+science	O
+is	O
+undertaken	O
+.	O
+The	O
+term	O
+`	O
+e-science	B-KEY
+'	O
+was	O
+introduced	O
+by	O
+John	O
+Taylor	O
+,	O
+director	O
+general	O
+of	O
+research	O
+councils	O
+in	O
+the	O
+Office	O
+of	O
+Science	O
+and	O
+Technology	O
+.	O
+He	O
+saw	O
+many	O
+areas	O
+of	O
+science	O
+becoming	O
+increasingly	O
+reliant	O
+on	O
+new	O
+ways	O
+of	O
+collaborative	B-KEY
+,	O
+multidisciplinary	O
+,	O
+interorganisation	O
+working	O
+.	O
+E-science	B-KEY
+is	O
+intended	O
+to	O
+capture	O
+these	O
+new	O
+modes	O
+of	O
+working	O
+.	O
+There	O
+are	O
+two	O
+major	O
+components	O
+to	O
+the	O
+programme	O
+:	O
+the	O
+science	O
+,	O
+and	O
+the	O
+infrastructure	O
+to	O
+support	O
+that	O
+science	O
+.	O
+The	O
+infrastructure	O
+is	O
+generally	O
+referred	O
+to	O
+as	O
+the	O
+Grid	O
+.	O
+The	O
+choice	O
+of	O
+name	O
+resonates	O
+with	O
+the	O
+idea	O
+of	O
+a	O
+future	O
+in	O
+which	O
+computing	B-KEY
+resources	I-KEY
+and	O
+storage	O
+,	O
+as	O
+well	O
+as	O
+expensive	O
+scientific	O
+facilities	O
+and	O
+software	B-KEY
+,	O
+can	O
+be	O
+accessed	O
+on	O
+demand	O
+,	O
+like	O
+electricity	O
+.	O
+Open	B-KEY
+source	I-KEY
+prototypes	I-KEY
+of	O
+the	O
+middleware	B-KEY
+are	O
+available	O
+and	O
+under	O
+development	O
+as	O
+part	O
+of	O
+the	O
+e-science	B-KEY
+programme	O
+and	O
+other	O
+international	O
+efforts	O
+
+An	O
+optimization	B-KEY
+based	I-KEY
+approach	I-KEY
+to	O
+the	O
+train	O
+operator	O
+scheduling	O
+problem	O
+at	O
+Singapore	O
+MRT	O
+Singapore	B-KEY
+Mass	I-KEY
+Rapid	I-KEY
+Transit	I-KEY
+-LRB-	O
+SMRT	O
+-RRB-	O
+operates	O
+two	O
+train	O
+lines	O
+with	O
+83	O
+kilometers	O
+of	O
+track	O
+and	O
+48	O
+stations	O
+.	O
+A	O
+total	O
+of	O
+77	O
+trains	O
+are	O
+in	O
+operation	O
+during	O
+peak	O
+hours	O
+and	O
+41	O
+during	O
+off-peak	O
+hours	O
+.	O
+We	O
+report	O
+on	O
+an	O
+optimization	B-KEY
+based	I-KEY
+approach	I-KEY
+to	O
+develop	O
+a	O
+computerized	B-KEY
+train-operator	I-KEY
+scheduling	I-KEY
+system	I-KEY
+that	O
+has	O
+been	O
+implemented	O
+at	O
+SMRT	O
+.	O
+The	O
+approach	O
+involves	O
+a	O
+bipartite	B-KEY
+matching	I-KEY
+algorithm	I-KEY
+for	O
+the	O
+generation	O
+of	O
+night	B-KEY
+duties	I-KEY
+and	O
+a	O
+tabu	B-KEY
+search	I-KEY
+algorithm	I-KEY
+for	O
+the	O
+generation	O
+of	O
+day	B-KEY
+duties	I-KEY
+.	O
+The	O
+system	O
+automates	O
+the	O
+train-operator	O
+scheduling	O
+process	O
+at	O
+SMRT	O
+and	O
+produces	O
+favorable	O
+schedules	O
+in	O
+comparison	O
+with	O
+the	O
+manual	O
+process	O
+.	O
+It	O
+is	O
+also	O
+able	O
+to	O
+handle	O
+the	O
+multiple	O
+objectives	O
+inherent	O
+in	O
+the	O
+crew	B-KEY
+scheduling	I-KEY
+system	I-KEY
+.	O
+While	O
+trying	O
+to	O
+minimize	O
+the	O
+system	O
+wide	O
+crew-related	O
+costs	O
+,	O
+the	O
+system	O
+is	O
+also	O
+able	O
+to	O
+address	O
+concern	O
+with	O
+respect	O
+to	O
+the	O
+number	O
+of	O
+split	O
+duties	O
+
+Two-scale	B-KEY
+curved	I-KEY
+element	I-KEY
+method	I-KEY
+for	O
+elliptic	B-KEY
+problems	I-KEY
+with	O
+small	B-KEY
+periodic	I-KEY
+coefficients	I-KEY
+This	O
+paper	O
+is	O
+concerned	O
+with	O
+the	O
+second	B-KEY
+order	I-KEY
+elliptic	I-KEY
+problems	I-KEY
+with	O
+small	O
+periodic	O
+coefficients	O
+on	O
+a	O
+bounded	O
+domain	O
+with	O
+a	O
+curved	O
+boundary	O
+.	O
+A	O
+two-scale	B-KEY
+curved	I-KEY
+element	I-KEY
+method	I-KEY
+which	O
+couples	O
+linear	B-KEY
+elements	I-KEY
+and	O
+isoparametric	B-KEY
+elements	I-KEY
+is	O
+proposed	O
+.	O
+The	O
+error	B-KEY
+estimate	I-KEY
+is	O
+obtained	O
+over	O
+the	O
+given	O
+smooth	O
+domain	O
+.	O
+Furthermore	O
+an	O
+additive	B-KEY
+Schwarz	I-KEY
+method	I-KEY
+is	O
+provided	O
+for	O
+the	O
+isoparametric	B-KEY
+element	I-KEY
+method	O
+
+Current-mode	O
+fully-programmable	O
+piece-wise-linear	O
+block	O
+for	O
+neuro-fuzzy	O
+applications	O
+A	O
+new	O
+method	O
+to	O
+implement	O
+an	O
+arbitrary	B-KEY
+piece-wise-linear	I-KEY
+characteristic	I-KEY
+in	O
+current	B-KEY
+mode	I-KEY
+is	O
+presented	O
+.	O
+Each	O
+of	O
+the	O
+breaking	B-KEY
+points	I-KEY
+and	O
+each	O
+slope	O
+is	O
+separately	B-KEY
+controllable	I-KEY
+.	O
+As	O
+an	O
+example	O
+a	O
+block	O
+that	O
+implements	O
+an	O
+N-shaped	B-KEY
+piece-wise-linearity	I-KEY
+has	O
+been	O
+designed	O
+.	O
+The	O
+N-shaped	O
+block	O
+operates	O
+in	O
+the	O
+subthreshold	B-KEY
+region	I-KEY
+and	O
+uses	O
+only	O
+ten	O
+transistors	O
+.	O
+These	O
+characteristics	O
+make	O
+it	O
+especially	O
+suitable	O
+for	O
+large	O
+arrays	O
+of	O
+neuro-fuzzy	B-KEY
+systems	I-KEY
+where	O
+the	O
+number	O
+of	O
+transistors	O
+and	O
+power	B-KEY
+consumption	I-KEY
+per	O
+cell	O
+is	O
+an	O
+important	O
+concern	O
+.	O
+A	O
+prototype	O
+of	O
+this	O
+block	O
+has	O
+been	O
+fabricated	O
+in	O
+a	O
+0.35	O
+mu	O
+m	O
+CMOS	B-KEY
+technology	O
+.	O
+The	O
+functionality	O
+and	O
+programmability	O
+of	O
+this	O
+circuit	O
+has	O
+been	O
+verified	O
+through	O
+experimental	O
+results	O
+
+Rats	O
+,	O
+robots	O
+,	O
+and	O
+rescue	O
+In	O
+early	O
+May	O
+,	O
+media	O
+inquiries	O
+started	O
+arriving	O
+at	O
+my	O
+office	O
+at	O
+the	O
+Center	O
+for	O
+Robot-Assisted	B-KEY
+Search	I-KEY
+and	I-KEY
+Rescue	I-KEY
+-LRB-	O
+www.crasar.org	O
+-RRB-	O
+.	O
+Because	O
+I	O
+'m	O
+CRASAR	O
+'s	O
+director	O
+,	O
+I	O
+thought	O
+the	O
+press	O
+was	O
+calling	O
+to	O
+follow	O
+up	O
+on	O
+the	O
+recent	O
+humanitarian	O
+award	O
+given	O
+to	O
+the	O
+center	O
+'s	O
+founder	O
+,	O
+John	O
+Blitch	O
+,	O
+for	O
+successfully	O
+using	O
+small	O
+,	O
+backpackable	O
+robots	O
+at	O
+the	O
+World	O
+Trade	O
+Center	O
+disaster	O
+.	O
+Instead	O
+,	O
+I	O
+found	O
+they	O
+were	O
+asking	O
+me	O
+to	O
+comment	O
+on	O
+the	O
+``	O
+roborats	O
+''	O
+study	O
+in	O
+the	O
+2	O
+May	O
+2002	O
+Nature	O
+.	O
+In	O
+this	O
+study	O
+,	O
+rats	O
+with	O
+medial	O
+force	O
+brain	O
+implants	O
+underwent	O
+operant	O
+conditioning	O
+to	O
+force	O
+them	O
+into	O
+a	O
+form	O
+of	O
+guided	O
+behavior	O
+,	O
+one	O
+aspect	O
+of	O
+which	O
+was	O
+thought	O
+useful	O
+for	O
+search	O
+and	O
+rescue	O
+.	O
+The	O
+article	O
+'s	O
+closing	O
+comment	O
+suggested	O
+that	O
+a	O
+guided	B-KEY
+rat	I-KEY
+could	O
+serve	O
+as	O
+both	O
+a	O
+mobile	B-KEY
+robot	I-KEY
+and	O
+a	O
+biological	B-KEY
+sensor	I-KEY
+.	O
+Although	O
+a	O
+roboticist	O
+by	O
+training	O
+,	O
+I	O
+'m	O
+committed	O
+to	O
+any	O
+technology	O
+that	O
+will	O
+help	O
+save	O
+lives	O
+while	O
+reducing	O
+the	O
+risk	O
+to	O
+rescuers	O
+.	O
+But	O
+rats	O
+?	O
+
+Phase	O
+transition	O
+for	O
+parking	B-KEY
+blocks	I-KEY
+,	O
+Brownian	B-KEY
+excursion	I-KEY
+and	O
+coalescence	B-KEY
+In	O
+this	O
+paper	O
+,	O
+we	O
+consider	O
+hashing	B-KEY
+with	O
+linear	B-KEY
+probing	I-KEY
+for	O
+a	O
+hashing	B-KEY
+table	O
+with	O
+m	O
+places	O
+,	O
+n	O
+items	O
+-LRB-	O
+n	O
+<	O
+m	O
+-RRB-	O
+,	O
+and	O
+l	O
+=	O
+m-n	O
+empty	O
+places	O
+.	O
+For	O
+a	O
+noncomputer	O
+science-minded	O
+reader	O
+,	O
+we	O
+shall	O
+use	O
+the	O
+metaphore	O
+of	O
+n	O
+cars	O
+parking	O
+on	O
+m	O
+places	O
+:	O
+each	O
+car	O
+c/sub	O
+i	O
+/	O
+chooses	O
+a	O
+place	O
+p/sub	O
+i	O
+/	O
+at	O
+random	O
+,	O
+and	O
+if	O
+p/sub	O
+i	O
+/	O
+is	O
+occupied	O
+,	O
+c/sub	O
+i	O
+/	O
+tries	O
+successively	O
+p/sub	O
+i	O
+/	O
++1	O
+,	O
+p/sub	O
+i	O
+/	O
++2	O
+,	O
+until	O
+it	O
+finds	O
+an	O
+empty	O
+place	O
+.	O
+Pittel	O
+-LSB-	O
+42	O
+-RSB-	O
+proves	O
+that	O
+when	O
+l/m	O
+goes	O
+to	O
+some	O
+positive	O
+limit	O
+beta	O
+<	O
+1	O
+,	O
+the	O
+size	O
+B/sub	O
+1	O
+/	O
+/	O
+sup	O
+m	O
+,	O
+l	O
+/	O
+of	O
+the	O
+largest	O
+block	O
+of	O
+consecutive	O
+cars	O
+satisfies	O
+2	O
+-LRB-	O
+beta	O
+-1	O
+-	O
+log	O
+beta	O
+-RRB-	O
+B/sub	O
+1	O
+/	O
+/	O
+sup	O
+m	O
+,	O
+l	O
+/	O
+=	O
+2	O
+log	O
+m-3	O
+log	O
+log	O
+m	O
++	O
+Xi	O
+/	O
+sub	O
+m	O
+/	O
+,	O
+where	O
+Xi	O
+/	O
+sub	O
+m	O
+/	O
+converges	O
+weakly	O
+to	O
+an	O
+extreme-value	O
+distribution	O
+.	O
+In	O
+this	O
+paper	O
+we	O
+examine	O
+at	O
+which	O
+level	O
+for	O
+n	O
+a	O
+phase	O
+transition	O
+occurs	O
+between	O
+B/sub	O
+1	O
+/	O
+/	O
+sup	O
+m	O
+,	O
+l	O
+/	O
+=	O
+o	O
+-LRB-	O
+m	O
+-RRB-	O
+and	O
+m-B/sub	O
+1	O
+/	O
+/	O
+sup	O
+m	O
+,	O
+l	O
+/	O
+=	O
+o	O
+-LRB-	O
+m	O
+-RRB-	O
+.	O
+The	O
+intermediate	O
+case	O
+reveals	O
+an	O
+interesting	O
+behavior	O
+of	O
+sizes	O
+of	O
+blocks	O
+,	O
+related	O
+to	O
+the	O
+standard	O
+additive	O
+coalescent	B-KEY
+in	O
+the	O
+same	O
+way	O
+as	O
+the	O
+sizes	O
+of	O
+connected	O
+components	O
+of	O
+the	O
+random	O
+graph	O
+are	O
+related	O
+to	O
+the	O
+multiplicative	O
+coalescent	B-KEY
+