2820577
Localizing XML Documents through XSLT
Existing efforts on XML internationalization and localization have been focusing on the contents of XML documents instead of on the meta presentations such as tags and attributes. Although XML standard allows the use of unicode throughout a document including the meta level presentations, most tags and attributes of XML documents are still defined in English, which makes it difficult for native people to use. This paper presents a pure XSLT stylesheet to completely translate and localize XML documents into different natural languages. Furthermore, we also describe how this technique can be applied to translation problems in programming (e.g. C and Java) or documentation (e.g. LaTeX) languages when the program or the document can be converted to and from XML documents.
1921065
Partitioning loops with variable dependence distances
A new technique to parallelize loops with variable distance vectors is presented. The method extends previous methods in two ways. First, the present method makes it possible for array subscripts to be any linear combination of all loop indices. The solutions to the linear dependence equations established from such array subscripts are characterized by a pseudo distance matrix (PDM). Second, it allows us to exploit loop parallelism from the PDM by applying unimodular and partitioning transformations that preserve the lexicographical order of the dependent iterations. The algorithms to derive the PDM, to find a suitable loop transformation and to generate parallel code are described, showing that it is possible to parallelize a wider range of loops automatically.
9459993
From goals to aspects: discovering aspects from requirements goal models
Aspect-oriented programming (AOP) has been attracting much attention in the software engineering community by advocating that programs should be structured according to programmer concerns, such as "efficient use of memory". However, like other programming paradigms in their early days, AOP hasn't addressed yet earlier phases of software development. In particular, it is still an open question how one identifies aspects early on in the software development process. This work proposes an answer to this question. Specifically, we show that aspects can be discovered during goal-oriented requirements analysis. Our proposal includes a systematic process for discovering aspects from relationships between functional and nonfunctional goals. We illustrate the proposed process with a case study adapted from the literature.
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.
866390
Comparing Web Services with other Software Components
Software metrics are vital for the management of software development, especially when a new technology is being adopted and established practices have yet to emerge. As a kind of software components, Web service technology has flourished and attracted a flurry of research activities. Despite the vast amount of research on mechanisms of Web services, there have been little investigations of the overall nature of existing Web services from a software component point of view. This paper is the first attempt to compare Web services with other software components in terms of established metrics in software engineering, including object oriented metrics and interface metrics. In this study we conclude that there are statistical differences between the interface, variable name and other OO metrics when one compares a large sample of Web services with typical OO systems. The distributions obtained give insight into the typical characteristics of Web services and can be used to identify candidates for wrapping into Web services.
11507388
JPT: A Java Parallelization Tool
PVM is a succesfull programming environment for distributed computing in the languages C and Fortran. Recently several implementations of PVM for Java have been added, making PVM programming accessible to the Java community. 
 
With PVM for Java however, the user still needs to partition the problem, calculate the data partitioning and program the message passing and synchronization. In this paper, JPT is introduced, a parallelization tool which generates PVM code from a serial Java program. JPT automatically detects parallel loops and generates master and slave PVM programs.
44493552
Adaptation of the temporal receptive fields of macaque V1 neurons
Abstract Traditional view of macaque V1 neurons is that they are static spatiotemporal filters. This study shows that V1 neurons’ temporal receptive fields (kernels) are dynamic and adaptive. In order to study the adaptation of the kernels to a variety of stimuli, we developed a regression approach to recover kernels using naturalistic stimuli. Using this technique, we studied how the kernels of the V1 neurons in macaque monkeys adapt to the frequency bandwidth of naturalistic signals. We found that the temporal frequency tunings and the gains of the receptive fields of the neurons change according to the statistical context of the stimulus environment.
10850316
Modeling realistic virtual hairstyles
The author presents an effective method for modeling realistic curly hairstyles, taking into account both artificial hairstyling processes and natural curliness. The result is a detailed geometric model of hairs that can be rendered and animated via existing methods. Our technique exploits the analogy between hairs and a vector field; it interactively and efficiently models global and local hair flows by superimposing procedurally defined vector field primitives that have local influence. Usually only a very small number of vector field primitives are needed to model a complicated hairstyle. An initial model of hair strands is extracted from the superimposed vector fields by tracing their field lines. Random natural or artificial curliness can be added to the initial model through a parametric hair offset function with a randomized distribution of parameters over the scalp. Techniques for shearing and clustering are also designed to improve the overall appearance of the hair model. Our technique has been successfully applied to generate a variety of realistic hairstyles with different curliness and length distributions.
11395837
Information-Bearing Noncoherently Modulated Pilots for MIMO Training
In this correspondence, we deal with noncoherent communications over multiple-input-multiple-output (MIMO) wireless links. For a Rayleigh flat block-fading channel with M transmit- and N receive-antennas and a channel coherence interval of length T, it is well known that for TGtM, or, at high signal-to-noise-ratio (SNR) rhoGt1 and Mlesmin{N,lfloorT/2rfloor}, unitary space-time modulation (USTM) is capacity-achieving, but incurs exponential demodulation complexity in T. On the other hand, conventional training-based schemes that rely on known pilot symbols for channel estimation simplify the receiver design, but they induce certain SNR loss. To achieve desirable tradeoffs between performance and complexity, we propose a novel training approach where USTM symbols over a short length Ttau(<T) are used as pilots which carry information to the receiver, and coherent communication is used for the remainder of the block. This new approach considerably reduces the receiver complexity when Ttau is a small fraction of T, and recovers part of the SNR loss experienced by the conventional training-based schemes. When rhorarrinfin and TgesTtau ges2M=2Nrarrinfin, but the ratios alpha=M/T, alpha1 =Ttau/T are fixed, we obtain analytical expressions of the asymptotic SNR loss for both the conventional and new training-based approaches, serving as a guideline for practical designs
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.
3035412
On the Expected Number of Failures Detected by Subdomain Testing and Random Testing
We investigate the efficacy of subdomain testing and random testing using the expected number of failures detected (the E-measure) as a measure of effectiveness. Simple as it is, the E-measure does provide a great deal of useful information about the fault detecting capability of testing strategies. With the E-measure, we obtain new characterizations of subdomain testing, including several new conditions that determine whether subdomain testing is more or less effective than random testing. Previously, the efficacy of subdomain testing strategies has been analyzed using the probability of detecting at least one failure (the P-measure) for the special case of disjoint subdomains only. On the contrary, our analysis makes use of the E-measure and considers also the general case in which subdomains may or may not overlap. Furthermore, we discover important relations between the two different measures. From these relations, we also derive corresponding characterizations of subdomain testing in terms of the P-measure.