One-to-one disjoint path covers on multi-dimensional tori

The multi-dimensional torus is one of the most popular underlying topologies for massively parallel systems. In this study, we consider a non-bipartite n-dimensional torus where n≥2 and prove that for 1≤m≤2n, m vertex disjoint paths exist that cover all vertices between any two distinct vertices. In other words, we construct the one-to-one m-disjoint path cover of a non-bipartite torus for any m where 1≤m≤2n.     

Computing Only Minimal Answers in Disjunctive Deductive Databases

A method is presented for computing minimal answers of the form in disjunctive deductive databases under the disjunctive stable model semantics. Such answers are constructed by repeatedly extending partial answers. Our method is complete (in that every minimal answer can be computed) and does not admit redundancy (in the sense that every partial answer generated can be extended to a minimal answer), thus no non-minimal answer is generated. The method does not (necessarily) require the computation of models of the database in their entirety. A partitioning of the database into extensional and intensional components is employed in order to overcome the problems caused by the possible non-existence of disjunctive stable models, and a form of compilation is presented as a means of simplifying and improving the efficiency of the run-time computation, which then reduces to relatively trivial processing within the extensional database. In addition, the output from this compilation process has the significant advantage of being immune to updates to the extensional database. Other forms of database pre-processing are also considered, and three transformations are presented mapping a database onto an equivalent positive database, non-disjunctive database, and set of conditional facts.     

Efficient data dissemination using locale covers

Location-dependent data are central to many emerging applications, ranging from traffic information services to sensor networks. The standard pull- and push-based data dissemination models become unworkable since the data volumes and number of clients are high.We address this problem using locale covers, a subset of the original set of locations of interest, chosen to include at least one location in a suitably defined neighborhood of any client. Since location-dependent values are highly correlated with location, a query can be answered using a location close to the query point. Typical closeness measures might be Euclidean distance, or a $k$-nearest neighbor criterion.We show that location-dependent queries may be answered satisfactorily using locale covers. Our approach is independent of locations and speeds of clients, and is applicable to mobile clients.We also introduce a nested locale cover scheme that ensures fair access latencies, and allows clients to refine the accuracy of their information over time. We also prove two important results: one regarding the greedy algorithm for sensor covers and the other pertaining to randomized locale covers for $k$-nearest neighbor queries.     

Finding a minimal cover for binary images: An optimal parallel algorithm

Given a black-and-white image, represented by an array of n × n binary-valued pixels, we wish to cover the black pixels with aminimal set of (possibly overlapping) maximal squares. It was recently shown that obtaining aminimum square cover for a polygonal binary image with holes is NP-hard. We derive an optimal parallel algorithm for theminimal square cover problem, which for any desired computation timeT in [logn,n] runs on an EREW-PRAM with (n/T) processors. The cornerstone of our algorithm is a novel data structure, the cover graph, which compactly represents the covering relationships between the maximal squares of the image. The size of the cover graph is linear in the number of pixels. This algorithm has applications to problems in VLSI mask generation, incremental update of raster displays, and image compression.The research reported here forms part of the author's doctoral dissertion, submitted to Cornell University in May 1989. This work was partially supported by NSF Grant DC1-86-02256, IBM Agreement 12060043, and ONR Contract N00014-83-K-0640. A preliminary version of this paper was presented at the 26th Annual Allerton Conference on Communications, Control, and Computing, Monticello, IL, September 28–30, 1988.     

现浇单向板肋梁楼盖结构实荷试验

通过某工程实例，介绍了用水加载的方式对某框架结构现浇单向板肋梁楼盖进行结构实荷试验的全过程．     

Parametric analyses of evapotranspiration landfill covers in humid regions

Natural soils are more durable than almost all man-made materials. Evapotranspiration （ET） covers use vegetated soil layers to store water until it is either evaporated from the soil surface or transpired through vegetation. ETcovers rely on the water storage capacity of soil layer, rather than low permeability materials, to minimize percolation. While the use of ET covers in landfills increased over the last decade, they were mainly used in arid or semi-arid regions. At present, the use of ET covers has not been thoroughly investigated in humid areas. The purpose of this paper is to investigate the use of ETcovers in humid areas where there is an annual precipitation of more than 800 mm. Numerical analyses were carried out to investigate the influences of cover thickness, soil type, vegetation level and distribution of precipitation on performance of ET covers. Performance and applicability of capillary barriers and a new-type cover were analyzed. The results show that percolation decreases with an increasing cover thickness and an increasing vegetation level, but the increasing trend becomes unclear when certain thickness or LAI （leaf area index） is reached. Cover soil with a large capability of water storage is recommended to minimize percolation. ET covers are significantly influenced by distribution of precipitation and are more effective in areas where rainy season coincides with hot season. Capillary barriers are more efficient than monolithic covers. The new cover is better than the monolithic cover in performance and the final percolation is only 0.5% of the annual precipitation.     

拦截导弹热保护罩分离对红外窗口影响研究

高层防空拦截弹热保护罩的分离对红外窗口产生了巨大影响,该文采用可压雷诺平均Navier-Stokes方程、多块嵌套结构动网格技术和有限体积法模拟了热保护罩分离。采用FDS-ROE格式对Navier-Stokes方程进行离散,并通过LUSGS方法构造了二阶隐式的双时间推进格式。从而给出了分离过程中,由于激波干扰引起的红外...     

Surjections and coverings

This paper determines the necessary and sufficient condition under which a collection of sequence covers on a finite set can be induced by a surjection. The relationship of sequence covers and surjections to generalized decomposition of an automaton allowing feedback, is the same as the relationship of partitions and bijections to series-parallel decompositions. The condition determined is a natural, but complex generalization of the known condition for the series-parallel case.     

基于精确几何的曲梁分析新方法

在前期研究的直梁的独立覆盖分析方法基础上,提出曲梁的独立覆盖分析方法。采用实体分析模式,只需使多项式覆盖函数中的某些项不参与计算,就能模拟梁的基本假设,从而避免了推导曲梁控制方程及相应数值计算公式的复杂性。借助随中面参数方程变化的局部坐标系,并计算该坐标系的局部坐标和方向余弦关于整体坐标的导数,就能实现精确几何描述下的曲梁分析。采用常曲率的一段圆形曲梁和变曲率的一段椭圆形曲梁的算例,验证了方法的可行性。研究方法为曲梁和下一步的曲壳分析提供了全新的途径,也是除了等几何分析方法之外的实现几何保形性的新方式。     

《经济学人》中国主题封面设计的视觉权力表达研究

目的 研究《经济学人》中国主题封面设计的视觉权力表达。方法 基于图像学、传播学的研究方法,以《经济学人》（亚太版）中52期具有中国主题特征的封面设计为样本,研究图像和文字不同的语法属性和意义表达功能、权力合法化实现的途径、图文耦合权力的表达方式等。结论 封面图像和文字在耦合表达中已不再是简单的意义载体,而是媒体参与社会实践的政治手段,成为其试图以自己的观点、运用视觉话语方式影响受众的一种权力运作和表达形式。