Alumni

By now, we've all heard that what makes social media "different" are such elements as essential two-way dialogues, grassroots-driven growth and that whole "community" element... There have been books all about "social currency," "social capital," "digital exchange," etc. - they have given us this "collaborative" outlook on social media. Not forgetting such essential lessons, I want to now focus back on the end consumer benefits - the "WiiFMs."

In view of the disadvantages of the traditional time-varying algorithm about nonstationary random vibration signal of a spacecraft with close spaced modal frequency. A process neural network (PNN) based on the empirical mode decomposition (EMD) method is put forward. First, the EMD method is utilized to decompose the signal into several intrinsic mode functions (IMFs). Then for each IMF, The PNN is established and time-varying auto-spectral density is obtained. Finally, the time-varying auto-spectral density of the signal can be reconstituted by linear superposing. The example results show the effectiveness of this new method in time-frequency analysis.

Canadian oil sands reserves are located in three major areas, Athabasca, Cold Lake and Peace River, in the Province of Alberta. According to Alberta's government, Canadian oil sands are the second largest source of oil in the world following Saudi Arabia, with proven reserves of over 168 billion barrels 1 as compared to Saudi Arabia's 264 billion barrels. 2 The Government of Alberta expects to increase production from 1.31 million barrels per day in 2008 to 3 million barrels per day in 2018. 3 The Alberta government owns 81% of the province's mineral rights; the remaining 19% are freehold mineral rights owned by the federal government on behalf of First Nations or in National Parks (11%), and by private individuals and companies (8%). 4 By contrast, the U.S. oil sands resource is fairly small. U.S. oil sands resources are spread over several states, with the Utah oil sands resource comprising 93% of the total domestic resource; Utah's oil sands resource is 11.5 billion barrels (of oil equivalent) of proven resources and an additional 20.7 billion barrels of unproven resources. 5 Domestic resources are spread across federal, state, private and tribal lands. 6 1 About 80% of the 170 billion barrels of remaining established reserves are suited for in-2 Government of Alberta, Energy, Facts and Statistics, http://www.energy.alberta.ca/OilSands/791.asp (accessed July 24, 2013). Measured in terms of resource "rent," the difference between the price of oil and the cost of producing it from the given resource, inclusive of opportunity costs, the "size" of the oil sands resource would be somewhat less, but still formidable.

In this work, by using the local node refinement technique purposed in [1, 2], and a quad-tree type algorithm [3, 4], we built a global refinement technique for Kansa's unsymmetric collocation approach. The proposed scheme is based on a cell by cell data structure, which by using the former local error estimator, iteratively refines the node density in regions with insufficient accuracy. We test our algorithm for steady state partial differential equations in one and two dimensions. By using thin-plate spline kernel functions, we found that the node refinement let us to reduce the approximation error and that the node insertion is only performed in regions where the analytical solution shows a high spatial variation. In addition, we found that the node refinement outperform in accuracy and number of nodes in comparison with the global classical Cartesian hrefinement technique.

We describe heterogeneous multi-CPU and multi-GPU implementations of Jacobi's iterative method for the 2-D Poisson equation on a structured grid, in both single-and doubleprecision. Properly tuned, our best implementation achieves 98% of the empirical streaming GPU bandwidth (66% of peak) on a NVIDIA C1060, and 78% on a C870. Motivated to find a still faster implementation, we further consider "wildly asynchronous" implementations that can reduce or even eliminate the synchronization bottleneck between iterations. In these versions, which are based on chaotic relaxation (Chazan and Miranker, 1969), we simply remove or delay synchronization between iterations. By doing so, we trade-off more flops, via more iterations to converge, for a higher degree of asynchronous parallelism. Our wild implementations on a GPU can be 1.2-2.5× faster than our best synchronized GPU implementation while achieving the same accuracy. Looking forward, this result suggests research on similarly "fast-and-loose" algorithms in the coming era of increasingly massive concurrency and relatively high synchronization or communication costs.

A novel method for detection of lines in a digital image used in line scale calibration process is described. The line images are recorded by a moving microscope and a CCD camera. This method is based on the center of the line instead of the edges of the line. Line detection is one of the most important problems in the line scale calibration. This method uses a Gabor filter for each row in the digital image. Likewise, based on robust statistics, some outlier points due to imperfections in the mark on the scale are ignored.

This report was prepared as an account of Government sponsored work. Neither the United States, nor the Commission, nor any person acting on behalf of the Commission: A. Makes any warranty or representation, expressed or implied, with respect to the accuracy, completeness, or usefulness of the information contained in this report, or that the use of any information, apparatus, method, or process disclosed in this report may not Infringe privately owned rights; or B. Assumes any liabilities with respect to the use of, or for damages resulting from the use of any Information, apparatus, method, or process disclosed in this report. As used in the above, "person acting on behalf of the Commission" includes any employee or contractor of the Commission, or employee of such contractor, to the extent that such employee or contractor of the Commission, or employee of such contractor prepares, disseminates, or provides access to, any information pursuant to his employment or contract with the Commission, or his employment with such contractor. This report has been reproduced directly from the best available copy.

The heavy lift launch vehicles (HLLV) proposed for use in constructing satellite pomer systems (SPS) mould deposit various contaminants in the middle atmosphere, contaminants that would conceivable have adverse effects on climate and upper air structure, l hese contaminants consist of the major constitutents of _ater vapor, hydrogen, carbon dioxide, and carbon monoxide, and the minor constituents of sulfur dioxide and nitric oxide in the rocket effluent, as oell as nitric oxide formed during reentry. To assess the magnitudes of the effects, ne_ models or modified existing models mere constructed.

Colored fringe pattern approach has been proposed to overcome the limitations of the sequential phase-shifting fringe pattern profilometry for dynamic measurements. However, the use of colored fringe patterns leads to a mayor problem, the color cross-talk, which has been considered to be equivalent to reconstructing the phase map from the fringe patterns with unknown phase shifts. Therefore, phase error is introduced when conventional phase-shifting algorithms with fixed phase shift values are used to retrieve the phase. To overcome the cross-talk issue, we propose the use of a fringe pattern normalization algorithm to achieve the intensity modulation balance among the different color channels and then the use of an advanced iterative algorithm to retrieve the phase. Simulations and experimental results show that the proposed procedure can significantly reduce the influence of the color cross-talk.

During the last years, there has been increased interest in developing efficient radial basis function (RBF) algorithms to solve partial differential problems of great scale. In this article, we are interested in solving large PDEs problems, whose solution presents rapid variations. Our main objective is to introduce a RBF dynamical domain decomposition algorithm which simultaneously performs a node adaptive strategy. This algorithm is based on the RBFs unsymmetric collocation setting. Numerical experiments performed with the multiquadric kernel function, for two stationary problems in two dimensions are presented. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2009

Recent numer ical studies have proved that multiquadric collo ca tion methods can achieve expo nen tial rate of conver gence for elliptic prob lems. Although some investi ga tions has been performed for time dependent prob lems, the influ ence of the shape param eter of the multiquadric kernel on the conver gence rate of these schemes has not been studied. In this article, we inves ti gate this issue and the influence of the Péclet number on the rate of conver gence for a convec tion diffu sion problem by using both an explicit and implicit multiquadric collo ca tion tech niques. We found that for low to moderate Péclet number an expo nen tial rate of convergence can be attained. In addi tion, we found that increasing the value of the Péclet number produces a value reduc tion of the coef fi cient that deter mines the expo nential rate of conver gence. More over, we numer i cally showed that the optimal value of the shape param eter decreases monotonically when the diffusive coefficient is reduced.