10354510
Using familiar single-user editors for collaborative editing
A number of real-time group editors have been developed as vehicles for investigating various technical issues in computer-supported cooperative work (CSCW). Excellent as they are in serving academic purposes, those research prototypes are not (and will probably not be) widely used by ordinary users for "serious" group editing activities. The reason is primarily that they are generally not as powerful or usable as single-user editors that people are already familiar with. In this paper, we propose an approach which converts existing single-user editors to group editors without modifying their source code. As a result, different editors such as Word and GVim can be shared by a group of distributed users to edit the same document simultaneously. Users can use familiar single-user editors for collaborative editing which are allowed to be heterogeneous. Towards this end we have been working on a research project called intelligent collaboration transparency or ICT to address related technical issues. Our work compared to existing application-sharing systems especially in that it is able to interoperate heterogeneous single-user applications. We report our latest progress on this project.
1347392
Explaining Low-Level Brightness-Contrast Illusions Using Disinhibition
Conventional Difference of Gaussian (DOG) filter is usually used to model the early stage of visual processing. However, convolution operation used with DOG does not explicitly account for the effects of disinhibition. Because of this, complex brightness-contrast (B-C) illusions such as the White’s effect cannot be explained using DOG filters. We discovered that a model based on lateral disinhibition in biological retinas allows us to explain subtle B-C illusions. Further, we show that a feedforward filter can be derived to achieve this operation in a single pass. The results suggest that contextual effects can be processed through recurrent disinhibition. Such a context sensitive structure might be employed to improve network robustness of visual capturing or displaying systems. Another potential application of this algorithm could be automatic detection and correction of perceived incoherences where accurate perception of intensity level is critical.
46180
Efficient visibility processing for projective texture mapping
Abstract Projective texture mapping is a powerful tool for image-based rendering. However, visibility information must be obtained in order to project correct textures onto the geometric sturcture. This paper presents a novel visibility algorithm for determining which polygons are visible from each camera position. It has object-space precision, but operates in both image-space and object-space to get better performance. It generates much less polygons than traditional object-space algorithms to help accelerate the speed of texture mapping. The techniques used to achieve these are conservative image-space occlusion testing and object-space shallow clipping . This algorithm has been successfully used to generate large-scale image-based rendering of a whole university campus, and image-based rendering of architectures under dynamic lighting.
31072695
Making XML document markup international
In name and in practice, the World-Wide Web (hereafter Web) is used around the World beyond English-speaking areas. This creates a tremendous need to internationalize standard terminology used in the technologies that make the Web possible. Existing efforts on XML internationalization (i18n) and localization (i10n) have focused on the content of XML documents instead of the terms used in markup (annotations) such as elements and attributes. The SGML standard ISO 8879 supports the use of Unicode (ISO 10646) throughout a document, including markups. However, most elements and attributes of XML documents are still defined in English, thereby limiting their use among non-English speakers. This paper presents an XSLT-based method that can completely localize the markup of XML documents into different natural languages. We also describe how the proposed technique can be applied to translation problems in programming (e.g. C and Java) or documentation (e.g. LATEX or other formatting languages) so that a program or a document can be converted to and from an XML format.
28175373
Mesh editing with poisson-based gradient field manipulation
In this paper, we introduce a novel approach to mesh editing with the Poisson equation as the theoretical foundation. The most distinctive feature of this approach is that it modifies the original mesh geometry implicitly through gradient field manipulation. Our approach can produce desirable and pleasing results for both global and local editing operations, such as deformation, object merging, and smoothing. With the help from a few novel interactive tools, these operations can be performed conveniently with a small amount of user interaction. Our technique has three key components, a basic mesh solver based on the Poisson equation, a gradient field manipulation scheme using local transforms, and a generalized boundary condition representation based on local frames. Experimental results indicate that our framework can outperform previous related mesh editing techniques.
12790826
SICTA: a 0.693 contention tree algorithm using successive interference cancellation
Contention tree algorithms have provable stability properties, and are known to achieve stable throughput as high as 0.487 for the infinite population Poisson model. A common feature in all these random access protocols is that collided packets at the receive-node are always discarded. In this paper, we derive a novel tree algorithm (TA) that we naturally term SICTA because it relies on successive interference cancellation to resolve collided packets. Performance metrics including throughput and delay are analyzed to establish that SICTA outperforms existing contention tree algorithms reaching 0.693 in stable throughput.
1353091
A Lightweight Approach to Semantic Web Service Synthesis
Web service technologies are becoming a new paradigm for distributed computing. With increasing number of web services available on the internet, there is an urgent need for information brokers that can autonomously integrate web services on behalf of a user. To this end, we propose web service specification, which defines what the service is but not how the service is implemented, and service synthesizer, which can dynamically synthesize the implementation of the specification from existing web services over the web.