There is a high demand of space-efficient algorithms in builtin or embedded softwares. In this paper, we consider the problem of designing space-efficient algorithms for computing the maximum area empty rectangle (MER) among a set of points inside a rectangular region R in 2D. We first propose an inplace algorithm for computing the priority search tree with a set of n points in R using O(logn) ...

We present evidence of the efficiency in an emergent futures market before, during and following the Asian crisis. Our approach is to comprehensively test price formation and informational efficiency in markets which play a leading role in the price discovery process. Our contribution is to examine the impact of the Asian crisis from a derivative markets perspective, thereby furthering the deba...

As the call for this workshop stated: "Place has become a hot topic in GIScience". But what is place, and what are the implications of developing place-based methods? In my talk, I set out an agenda for place-based methods, and particularly for retrieval based on place. In doing so, I explore how unstructured text and tagged images can, firstly, inform methods which seek to take account of noti...

In this paper we propose an architecture for using crossorganization information sharing to identify members of a group of hosts enslaved for malicious purposes on the Internet. We root our system in so-called “detectives”— savvy network monitors like sophisticated intrusion detection systems or honeyfarms that have a deep understanding of malicious behavior. We augment information from these d...

We present a new proof of Stembridge’s theorem about the enumeration of totally symmetric plane partitions using the methodology suggested in the recent Koutschan-Kauers-Zeilberger semi-rigorous proof of the Andrews-Robbins q-TSPP conjecture. Our proof makes heavy use of computer algebra and is completely automatic. We describe new methods that make the computations feasible in the first place....

Selections are often carried out using toolbars that are located far away from the location of the cursor. To reduce the time to make these selections, researchers have proposed in-place toolbars such as Toolglasses or popup palettes. Even though in-place toolbars have been known for a long time, there are factors influencing their performance that have not been investigated. To explore the sub...

I present a general purpose model of the brain, called Self-Aware and Self-Effecting (SASE) model. Rooted in the biological genomic equivalence principle, our model proposes a general-purpose cell-centered in-place learning scheme to handle all levels of brain development and operation, from the cell level all the way to the brain level. It clarifies five necessary “chunks” of the brain “puzzle...

Mind uploading speculation and debate often concludes that a procedure described as gradual inplace replacement preserves personal identity while a procedure described as destructive scanand-copy produces some other identity in the target substrate such that personal identity is lost along with the biological brain. This paper demonstrates a chain of reasoning that establishes metaphysical equi...

For efficient data integration of all data the XML based platform myBSMLStudio2003 is discussed and developed here. It integrates XQuery capabilities, automatic scripting updates for sequence annotation and a JESS expert system shell for functional annotation. In the context of genome annotation platforms in place (GenDB, PEDANT) these different tools and approaches presented here allow improve...

We study the problem of determining the complexity of optimal comparison-based in-place sorting when the key length, k, is not a constant. We present the first algorithm for lexicographically sorting n keys in O(nk+n log n) time using O(1) auxiliary data locations, which is simultaneously optimal in time and space.