Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time

Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free XML storage structures with as few scheme trees as possible. Redundancy-free XML structures guarantee both economy in storage space and the absence of update anomalies, and having the least number of scheme trees requires the fewest number of joins to navigate among the data elements. We know that the general problem is intractable. The problem may still be intractable even when the hypergraph is acyclic and each hyperedge is in Boyce–Codd normal form (BCNF). As we show here, however, given an acyclic hypergraph with each hyperedge in BCNF, a polynomial-time algorithm exists that generates a largest possible redundancy-free XML storage structure. Successively generating largest possible scheme trees from among hyperedges not already included in generated scheme trees constitutes a reasonable heuristic for finding the fewest possible scheme trees. For many practical cases, this heuristic finds the set of redundancy-free XML storage structures with the fewest number of scheme trees. In addition to a correctness proof and a complexity analysis showing that the algorithm is polynomial, we also give experimental results over randomly generated but appropriately constrained hypergraphs showing empirically that the algorithm is indeed polynomial.     

Probability of graphs with large spectral gap by multicanonical Monte Carlo

Graphs with large spectral gap are important in various fields such as biology, sociology and computer science. In designing such graphs, an important question is how the probability of graphs with large spectral gap behaves. A method based on multicanonical Monte Carlo is introduced to quantify the behavior of this probability, which enables us to calculate extreme tails of the distribution. The proposed method is successfully applied to random 3-regular graphs and large deviation probability is estimated.     

Efficient region-aware large graph construction towards scalable multi-label propagation

With fast growing number of images on photo-sharing websites such as Flickr and Picasa, it is in urgent need to develop scalable multi-label propagation algorithms for image indexing, management and retrieval. It has been well acknowledged that analysis in semantic region level may greatly improve image annotation performance compared to that in the holistic image level. However, region level approach increases the data scale to several orders of magnitude and proposes new challenges to most existing algorithms. In this work, we present a novel framework to effectively compute pairwise image similarity by accumulating the information of semantic image regions. Firstly, each image is encoded as Bag-of-Regions based on multiple image segmentations. Secondly, all image regions are separated into buckets with efficient locality-sensitive hashing (LSH) method, which guarantees high collision probabilities for similar regions. The k-nearest neighbors of each image and the corresponding similarities can be efficiently approximated with these indexed patches. Lastly, the sparse and region-aware image similarity matrix is fed into the multi-label extension of the entropic graph regularized semi-supervised learning algorithm [1]. In combination they naturally yield the capability of handling large-scale dataset. Extensive experiments on NUS-WIDE (260k images) and COREL-5k datasets validate the effectiveness and efficiency of our proposed framework for region-aware and scalable multi-label propagation.     

Normal shock boundary layer control with various vortex generator geometries

Various vortex generators which include ramp, split-ramp and a new hybrid concept “ramped-vane” are investigated under normal shock conditions with a diffuser at Mach number of 1.3. The dimensions of the computational domain were designed using Reynolds Average Navier–Stokes studies to be representative of the flow in an external-compression supersonic inlet. Using this flow geometry, various vortex generator concepts were studied with Implicit Large Eddy Simulation. In general, the ramped-vane provided increased vorticity compared to the other devices and reduced the separation length downstream of the device centerline. In addition, the size, edge gap and streamwise position respect to the shock were studied for the ramped-vane and it was found that a height of about half the boundary thickness and a large trailing edge gap yielded a fully attached flow downstream of the device. This ramped-vane also provided the largest reduction in the turbulent kinetic energy and pressure fluctuations. Additional benefits include negligible drag while the reductions in boundary layer displacement thickness and shape factor were seen compared to other devices.     

电磁流量计在分流支管中的应用

为解决目前国内电磁流量计无法同时满足高温、高压、耐腐蚀、大通径流量测量的难题,提出了利用小口径电磁流量计,通过测量分流支管中的流体流量,达到替代大口径电磁流量计测量大流量的目的。中还提出了延长电磁流量计使用寿命的措施。     

大型水轮机综合特性曲线处理的研究

水轮机设计的基础理论是相似理论。选型设计决定水轮机性能参数尺寸,其中最关键的技术是水轮机特性曲线的处理,即模型综合特性曲线和真机运动特性曲线的处理。本文应用CAD技术,提出了特性曲线处理算法,极大地提高了水轮机方案设计的效率。该算法已经应用于国家863／CIMS重点应用示范工程中。     

海量数据快速批量处理的研究与实现

对海量数据快速大批量抽取和大批量处理进行研究,给出根据不同要求指定的具有一定共性特征的数据集进行交互式批量处理和批量加工的实现方法。     

Free and forced convection boundary layer flow through a porous medium with large suction

An analytical study is made of the free and forced convection boundary layer flow past a porous medium bounded by a semi-infinite vertical porous plate. Locally similar solutions are then obtained by a perturbation method for large suction. Solutions for the velocity and temperature distributions are shown graphically for various suction velocities and values of the driving parameter G_r/R, where G_r is the Grashof number and R_e is the Reynolds number. The corresponding values of the skin friction coefficient and the Nusselt number are finally shown in tabular form.     

Irr: An algorithm for computing the smallest singular value of large scale matrices

For large-scale matrices, there is no practical algorithm to compute the smallest singular value with a satisfied relative accuracy. The widely used bidiagonalization Lanczos method can compute the largest singular value with good relative accuracy, but not the smallest one. In this paper we transform the smallest singular value of matrix A to the largest eigenvalue of (A^T A)^-1 and use Rayleigh-Ritz method, which is referred as Inverse-Rayleigh - Ritz (IRR) method. The technique computing quadratic form plays an important role in IRR. IRR takes no more flop cost and storage than Lanczos-like Krylov methods on A and gives more accurate results.