Joan C Olson ([email protected]) Christopher F Cuff ([email protected]) Slawomir Lukomski ([email protected]) Ewa Lukomska ([email protected]) Yeremi Canizales ([email protected]) Bei WU ([email protected]) Richard J Crout ([email protected]) John G Thomas ([email protected]) Daniel W McNeil ([email protected]) Robert J Weyant ([email protected]) Mary L Marazita ([email protected]) B...

We propose a novel method for discovering shape regions that strongly correlate with user-prescribed tags. For example, given a collection of chairs tagged as either “has armrest” or “lacks armrest”, our system correctly highlights the armrest regions as the main distinctive parts between the two chair types. To obtain point-wise predictions from shape-wise tags we develop a novel neural networ...

In this note, we prove the periodic homogenization for a family of nonlinear nonlocal “elliptic” equations with oscillatory coefficients. Such equations include, but are not limited to Bellman equations for the control of pure jump processes and the Isaacs equations for differential games of pure jump processes. The existence of an effective equation and convergence the solutions of the family ...

Writing secure, trusted software for UNIX platforms is difficult. There are a number of approaches to enabling more secure development, but it is apparent that the current set of solutions are neither achieving acceptance nor having sufficient impact. In this paper, we introduce a library to address a particularly difficult problem in secure code development: partitioning processes to isolate p...

The need of reverting the effects of updates on the affected documents arises in many contexts, ranging from undos in transactional applications to versioning systems. In this paper, we investigate this issue for XQuery Update expressions, relying on the Pending Update List (PUL) obtained from the evaluation of an expression on a document. Specifically, we introduce an inversion operator, that,...

A type of oscillation modeled on BMO is introduced to characterize norm compactness in L 1. This result is used to characterize the bounded linear operators from L 1 into a Banach space X that map weakly convergent sequences onto norm convergent sequences (i.e. are Dunford-Pettis). This characterization is used to study the geometry of Banach spaces X with the property that all bounded linear o...

In this document an idea is submitted how IP and ARP can be used on inhomogeneous FDDI networks (FDDI networks with single MAC and dual MAC stations) by introducing a new protocol layer in the protocol suite of the dual MAC stations. Thus two dual MAC stations are able to do a load splitting across the two rings and use the double bandwidth of 200 Mbits/s as single MAC stations. The new layer i...

The classical Ramsey theorem was generalized in two major ways: to the dual Ramsey theorem, by Graham and Rothschild, and to Ramsey theorems for trees, initially by Deuber and Leeb. Bringing these two lines of thought together, we prove the dual Ramsey theorem for trees. Galois connections between partial orders are used in formulating this theorem, while the abstract approach to Ramsey theory,...

In database replication, primary-copy systems sort out easily the problem of keeping replicate data consistent by allowing only updates at the primary copy. While this kind of systems are very efficient with workloads dominated by read-only transactions, the update-everywhere approach is more suitable for heavy update loads. However, it behaves worse when dealing with workloads dominated by rea...

For a systematic erasure code, update complexity (UC) is defined as the maximum number of parity blocks needed to be changed when some information blocks are updated. Locally repairable codes (LRCs) have been recently proposed and used in real-world distributed storage systems. In this paper, update complexity of optimal LRCs is studied and both lower and upper bounds on UC are established in t...