This paper presents a method to assist in the tedious process of reconstructing ceramic vessels from excavated fragments. The method models the fragment borders as 3D curves and uses intrinsic differential anchor points on the curves. Corresponding anchors on different fragments are identified using absolute invariants and a longest string search technique. A rigid transformation is computed fr...

' I'l.1. III. I.II. II. I, II I I II.IIII PiI i,I. HI Shi 1.1..ii ii.i. kn. i nominated Whliilngton ai ih< nail ol iIn II gulail) •. hi dull ,i in. .mil' , ,MII mending hi > flvi ,. ai i< n hi id "i i he University*! i in.in. ml "i" I>I i Sht I" hilling | hi. terved na «, II at > i.. |>ii idi HI I HI iiii.in. i II.i. I", v II.I SIM I ..II. ,il lli. in,,..l crealivi ad luiiaiom i havi worked ..m...

The current publishing system with its merits and pitfalls is a mending topic for debate among scientists of various disciplines. Editors and reviewers alike, both face difficult decisions about the judgment of new scientific findings. Increasing interdisciplinary themes and rapidly changing dynamics in method development of each field make it difficult to be an "expert" with regard to all issu...

We present a method for mending strategies for GR(1) specifications. Given the addition or removal of edges from the game graph describing a problem (essentially transition rules in a GR(1) specification), we apply a μ-calculus formula to a neighborhood of states to obtain a “local strategy” that navigates around the invalidated parts of an original synthesized strategy. Our method may thus avo...

This paper lays a theoretical foundation for scaling fault tolerant tasks to large and diversiied networks, such as the Internet. In such networks, there are always parts of the network that failed. On the other hand, various subtasks interest only parts of the network, and it is desirable that those parts, if nonfaulty, do not suuer from faults in other parts. Our approach is to reene the prev...