Note: Interpolation for evaluation of a two-dimensional spatial profile of plasma densities at low gas pressures

An interpolation algorithm for the evaluation of the spatial profile of plasma densities in a cylindrical reactor was developed for low gas pressures. The algorithm is based on a collisionless two-dimensional fluid model. Contrary to the collisional case, i.e., diffusion fluid model, the fitting algorithm depends on the aspect ratio of the cylindrical reactor. The spatial density profile of the collisionless fitting algorithm is presented in two-dimensional images and compared with the results of the diffusion fluid model.     

Are Stereotypes Relative to Gender Usage Applicable to Virtual Worlds?

Common stereotypes of virtual game or community users are often portrayed as young and socially inept male addicts. Recent studies, however, defy many of the common prejudices about game or community users. As an extension of recent research, this study looks at gender differences in Virtual Worlds and finds that female users are actually a driving force behind the recent success of online communities. The study results indicate that female users more actively participate in social life, information seeking, and building activities in Virtual Worlds than their male counterparts. Similarly, female users have greater appreciation for the value of Virtual Worlds, although both male and female users recognize Virtual Worlds as a highly useful entertainment tool.     

A study of optimal viewing distance in a parallax barrier 3D display

The optimal viewing distance was proposed as a parameter for designing a parallax barrier 3D display. It can be designed based on simple geometric method and by considering the pitches of image display pixels and parallax barrier, or even including the aperture ratios of the image display pixels and parallax barrier. It can be analyzed by using ray tracing method. By considering the optical refraction index of the cover glass, the angular behavior of the system becomes more realistic; however, the geometric method is difficult to be used. We propose a revised method for estimating the view distance and angular behavior. In this paper, we have demonstrated a designated eye position (DEP) for each view and shown that multiple DEPs make a circular curve around the center of the display. We prove the new concept by comparing the optical ray tracing calculations and optical measurement.     

Integrated Use of a Continuous Simulation Model and Multi-Attribute Decision-Making for Ranking Urban Watershed Management Alternatives

The objective of this paper is to introduce a continuous simulation-based screening procedure for ranking urban watershed management alternatives using multi-attribute decision making (MADM). The procedure integrates continuous urban runoff simulation results from the United States Environmental Protection Agency’s Storm Water Management Model (SWMM) with the use of an alternative evaluation index (AEI) and MADM techniques, following the driver-pressure-state-impact-response (DPSIR) approach. The analytic hierarchy process estimates the weights of the criteria, and SWMM results are used to quantify the effects of the management alternatives on water quantity and quality metrics. In addition, the tendency of AEI to reflect resident preferences toward management objectives is incorporated to include stakeholder participation in the decision-making process. This systematic decision support process is demonstrated for a Korean urban watershed. According to the AEI, seven alternatives were divided into three groups: poor (0∼0.3), acceptable (0.3∼0.6), and good (0.6∼1). The use of multiple MADM techniques provided a consistency check. The demonstration illustrates the ability of the continuous simulation-based MADM approach to provide decision makers with a ranking of suitable urban watershed management alternatives which incorporate stakeholder feedback.     

Application of load balancing based on symmetric balanced incomplete block design to random networks

In a load balancing algorithm [O. Lee, M. Anshel, I. Chung, Design of an efficient load balancing algorithm on distributed networks by employing symmetric balanced incomplete block design, IEE Proceedings - Communications 151 (6) (2004) 535-538] based on the SBIBD (Symmetric Balanced Incomplete Block Design), each node receives global workload information by only two round message exchange with traffic overhead, where v is the number of nodes. It is very efficient and works well only when v=p²+p+1 is used for a prime number p. In this paper, we generated a special incidence structure using the SBIBD and then propose a new load balancing algorithm, which executes well for an arbitrary number of nodes. To accomplish this, we add a number of links to nodes in order for each node to receive more than 80% of the workload information by two round message exchange. For performance of our algorithm, we carried out an experiment for the number of nodes, w, which was up to 5000. Traffic overhead is less than in a round and standard deviation of traffic overhead shows that each node has a mostly well-balanced amount of traffic.     

Image mosaicking for polyhedral scene and in particular singly visible surfaces

Image mosaic construction is about stitching together a number of images about the same scene to construct a single image with a larger field of view. The majority of the previous work was rooted at the use of a single image-to-image mapping termed planar homography for representing the imaged scene. However, the mapping is applicable only to cases where the imaged scene is either a single planar surface, or very distant from the cameras, or imaged under a pure rotation of the camera, and that greatly limits the range of applications of the mosaicking methods. This paper presents a novel mosaicking solution for scenes that are polyhedral (thus consisting of multiple surfaces) and that are pictured possibly in closed range of the camera. The solution has two major advantages. First, it requires only a few correspondences over the entire scene, not correspondences over every surface patch in it to work. Second, it conquers a seemingly impossible task—warping image data of surfaces that are visible in only one of the input images, which we refer to as the singly visible surfaces, to another viewpoint to constitute the mosaic there. We also provide a detail analysis of what determines whether a singly visible surface could be mosaicked or not. Experimental results on real image data are presented to illustrate the performance of the method.     

A scalable algorithm for mining maximal frequent sequences using a sample

In this paper, we propose an efficient scalable algorithm for mining Maximal Sequential Patterns using Sampling (MSPS). The MSPS algorithm reduces much more search space than other algorithms because both the subsequence infrequency-based pruning and the supersequence frequency-based pruning are applied. In MSPS, a sampling technique is used to identify long frequent sequences earlier, instead of enumerating all their subsequences. We propose how to adjust the user-specified minimum support level for mining a sample of the database to achieve better overall performance. This method makes sampling more efficient when the minimum support is small. A signature-based method and a hash-based method are developed for the subsequence infrequency-based pruning when the seed set of frequent sequences for the candidate generation is too big to be loaded into memory. A prefix tree structure is developed to count the candidate sequences of different sizes during the database scanning, and it also facilitates the customer sequence trimming. Our experiments showed MSPS has very good performance and better scalability than other algorithms. Congnan Luo received the B.E. degree in Computer Science from Tsinghua University, Beijing, P.R. China, in 1997, the M.S. degree in Computer Science from the Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China, in 2000, and the Ph.D. degree in Computer Science and Engineering from Wright State University, Dayton, OH, in 2006. Currently he is a technical staff at the Teradata division of NCR in San Diego, CA, and his research interests include data mining, machine learning, and databases. Soon M. Chung received the B.S. degree in Electronic Engineering from Seoul National University, Korea, in 1979, the M.S. degree in Electrical Engineering from Korea Advanced Institute of Science and Technology, Korea, in 1981, and the Ph.D. degree in Computer Engineering from Syracuse University, Syracuse, New York, in 1990. He is currently a Professor in the Department of Computer Science and Engineering at Wright State University, Dayton, OH. His research interests include database, data mining, Grid computing, text mining, XML, and parallel and distributed processing.     

A Randomized Linear-Work EREW PRAM Algorithm to Find a Minimum Spanning Forest

We present a randomized EREW PRAM algorithm to find a minimum spanning forest in a weighted undirected graph. On an n -vertex graph the algorithm runs in o(( log n) ^{1+ ɛ} ) expected time for any ɛ >0 and performs linear expected work. This is the first linear-work, polylog-time algorithm on the EREW PRAM for this problem. This also gives parallel algorithms that perform expected linear work on two general-purpose models of parallel computation—the QSM and the BSP.