10484545
Visualizing the Iteration Space in PEFPT
Sufficient and precise semantic information is essential to interactive parallel programming. In this paper, we present a feasible implementation of the iteration space dependence graph and discuss relevant technical problems. Moreover, we give a further prospect of interactive loop parallelization guided by the graph.
5687277
A self-adaptive scheduling algorithm of on-demand broadcasts
In mobile wireless systems data on air can be accessed by a large number of mobile users. Many of these applications such as wireless internets and traffic information systems are pull-based, that is, they respond to on-demand user requests. In this paper, we study the scheduling problems of on-demand broadcast environments. Traditionally, the response time of the requests has been used as a performance measure. In this paper we consider the performance as the average cost of request composed of three kinds of costs—access time cost, tuning time cost, and cost of handling failure request. Our main contribution is a self-adaptive scheduling algorithm named LDFC, which computes the delay cost of data item as the priority for broadcast. It performs well compared with some previous algorithms in this context.
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.
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.
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.
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.
37474982
A Study on a Path-based Strategy for Selecting Black-box Generated Test Cases
Various black-box methods for the generation of test cases have been proposed in the literature. Many of these methods, including the category-partition method and the classification-tree method, follow the approach of partition testing, in which the input domain is partitioned into subdomains according to important aspects of the specification, and test cases are then derived from the subdomains. Though comprehensive in terms of these important aspects, execution of all the test cases so generated may not be feasible under the constraint of tight testing resources. In such circumstances, there is a need to select a smaller subset of test cases from the original test suite for execution. In this paper, we propose the use of white-box information to guide the selection of test cases from the original test suite generated by a black-box testing method. Furthermore, we have developed some techniques and algorithms to facilitate the implementation of our approach, and demonstrated its viability and benefits by means of a case study.
13369249
Reconstruction of 3-D Symmetric Curves from Perspective Images without Discrete Features
The shapes of many natural and man-made objects have curved contours. The images of such contours usually do not have sufficient distinctive features to apply conventional feature-based reconstruction algorithms. This paper shows that both the shape of curves in 3-D space and the camera poses can be accurately reconstructed from their perspective images with unknown point correspondences given that the curves have certain invariant properties such as symmetry. We show that in such cases the minimum number of views needed for a solution is remarkably small: one for planar curves and two for nonplanar curves (of arbitrary shapes), which is significantly less than what is required by most existing algorithms for general curves. Our solutions rely on minimizing the L 2-distance between the shapes of the curves reconstructed via the “epipolar geometry” of symmetric curves. Both simulations and experiments on real images are presented to demonstrate the effectiveness of our approach.
5719748
Leopard: A Locality Aware Peer-to-Peer System with No Hot Spot
Recent research [7,12,2] has shown that Internet hosts can be efficiently (i.e., without excessive measurements) mapped to a virtual (Euclidean) coordinate system, where the geometric distance between any two nodes in this virtual space approximates their real IP network distance (latency). Based on this result, in this paper, we propose an alternative approach that inherently incorporates a virtual coordinate system into a P2P network. In our system, called Leopard, a node is assigned a coordinate in the so-called node geo space as it joins the network, and obtains neighbor relationships that reflects network proximity from the beginning. The object id space and the node geo space are then “weaved” together via a novel technique called geographically-scoped hashing. Through analysis and simulation, we show three major desirable properties of Leopard to exemplify the power of this paradigm shift: i) a constant routing stretch, i.e., IP level network latency of object look-up is proportional to the distance between a requesting node and the target object; ii) always locates a near-by copy when multiple copies exist; and iii) effectively handles “flash crowd” traffic with near optimal load balancing.
7801331
FPGA implementation of digital filters synthesized using the frequency-response masking technique
The effective length of a filter designed using the frequency-response masking technique is very high and requires a very large number of delay elements. In this paper, we present some useful techniques for reducing the data transfer between the FPGA and external memory when the random logic are implemented using FPGA and the delay elements are implemented using external memory such as DRAM.
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.