This paper presents a novel interactive mesh deformation method that can achieve various dynamic material effects, including elastic membrane and cloth effects. In our framework, a mesh is encoded by some differential...
详细信息
With the mature technology of software component and software architecture, software reuse has achieved significant progress. However, dynamic reusing software architecture such as in the condition of changing require...
详细信息
XP (eXtreme Programming) has become popular for IID (Iteration and Increment Development). It is suitable for small teams, lightweight projects and vague/volatile requirements. However, some challenges are left to dev...
详细信息
ISBN:
(纸本)1595933751
XP (eXtreme Programming) has become popular for IID (Iteration and Increment Development). It is suitable for small teams, lightweight projects and vague/volatile requirements. However, some challenges are left to developers when they desire to practise XP. A critical one of them is constructing the release plan and negotiating it with customers. In this paper, we propose a risk-driven method for XP release planning. It has been applied in a case study and the results show the method is feasible and effective. XP practicers can follow it to decide a suitable release plan and control the development process. Copyright 2006 ACM.
Using microphotoluminescence (μ−PL), in dilute N GaAs1−xNx alloys, we observe a PL band far above the bandgap E0 with its peak energy following the so-called E+ transition, but with contribution from perturbed GaAs h...
Using microphotoluminescence (μ−PL), in dilute N GaAs1−xNx alloys, we observe a PL band far above the bandgap E0 with its peak energy following the so-called E+ transition, but with contribution from perturbed GaAs host states in a broad spectral range (>100meV). This finding is in sharp contrast to the general understanding that E+ is associated with a well-defined conduction band level (either L1c or Nx). Beyond this insight regarding the strong perturbation of the GaAs band structure caused by N incorporation, we demonstrate that a small amount of isoelectronic doping in conjunction with μ−PL allows direct observation of above-bandgap transitions that are not usually accessible by PL.
We report our work on evaluating performance of several MPI Allgather algorithms on Fast Ethernet. These algorithms are ring, recursive doubling, Bruck, and neighbor exchange. The first three algorithms are widely use...
详细信息
ISBN:
(纸本)0769524869
We report our work on evaluating performance of several MPI Allgather algorithms on Fast Ethernet. These algorithms are ring, recursive doubling, Bruck, and neighbor exchange. The first three algorithms are widely used today. The neighbor exchange algorithm which was recently proposed by the authors incorporates pair-wise exchange, and is expected to perform better with certain configurations, mainly when using TCP/IP over Ethernet. We tested the four algorithms on terascale Linux clusters DeepComp 6800 and DAWNING 4000A using TCP/IP over Fast Ethernet. Results show that our neighbor exchange algorithm performs the best for long messages, the ring algorithm performs the best for medium-size messages and the recursive doubling algorithm performs the best for short messages.
A novel estimator for integer frequency offset estimation of OFDM systems is derived, which is based on the maximum likelihood (ML) technique and exploits the differential information between two consecutive blocks of...
详细信息
ISBN:
(纸本)0780382463
A novel estimator for integer frequency offset estimation of OFDM systems is derived, which is based on the maximum likelihood (ML) technique and exploits the differential information between two consecutive blocks of OFDM data symbols in the frequency domain. The reason why the ML estimator has better performance than the conventional method is analyzed. How to select the differential sequence is also studied. By computer simulations, the performance of the ML estimator is compared with that of the conventional method for the additive white Gaussian noise (AWGN) channel and the multipath fading channel. The simulation results are in good agreement with the analytical study.
Much research has been done mainly in testcase generation and its effect for com-binatorial design approach for testing. This letter presents an algorithm for fault diagnosis basedon the approach. It can conclude that...
详细信息
Much research has been done mainly in testcase generation and its effect for com-binatorial design approach for testing. This letter presents an algorithm for fault diagnosis basedon the approach. It can conclude that the factors, which cause errors, must be in a very smallrange through analyzing the test cases after testing, and retesting with some complementary testcases. The algorithm can provide a very efficient and valuable guidance for the debugging andtesting of software.
Coverage analysis is a structural testing technique that helps to eliminate gaps in atest suite and determines when to stop testing. To compute test coverage, this letter proposes anew concept coverage about variables...
详细信息
Coverage analysis is a structural testing technique that helps to eliminate gaps in atest suite and determines when to stop testing. To compute test coverage, this letter proposes anew concept coverage about variables, based on program slicing. By adding powers accordingto their importance, the users can focus on the important variables to obtain higher test *** letter presents methods to compute basic coverage based on program structure graphs. Inmost cases, the coverage obtained in the letter is bigger than that obtained by a traditionalmeasure, because the coverage about a variable takes only the related codes into account.
To provide system designer a valid measure to evaluate the structure complexityof class diagrams objectively, this letter first proposes a method to transform a class diagramsinto a weighted class dependence graph, th...
详细信息
To provide system designer a valid measure to evaluate the structure complexityof class diagrams objectively, this letter first proposes a method to transform a class diagramsinto a weighted class dependence graph, then presents a structure complexity measure for classdiagrams based on entropy distance.
暂无评论