高校媒体公关存在的问题与对策研究

近年来,随着信息时代社会的日新月异,高等教育事业驶入快速发展的轨道,社会对高校的关注度越来越高,高校间的竞争越来越激烈,在这种生存环境下,如何加强高校和校外社会媒体的关系,扩大高校的社会形象和知名度,提高高校的品牌价值和竞争力,已经成为新时期摆在众多高校面前的一个崭新课题。本文将公共关系这一重要的现代理论嫁接在高等学校,以跨学科的眼光和思路来探讨当前高校媒体公关存在的问题,并提出相应的对策,希望对新形势下开展高校媒体公关提供一定的参考。     

A new method of characterization for stratified thermal energy stores

A new method for characterization of stratified thermal energy stores (TES) that integrates both the first law and the second law concerns is presented here. The first law concern is incorporated into a quantity called energy response factor and the second law concern into an entropy generation ratio. A product of these two quantities is at the heart of the TES efficiency definitions. This approach removes the overemphasis of the existing methods either on the first or the second law of thermodynamics which often biases the characterization results. The information about the evolution of the temperature field of the system in time is the prerequisite of the new method. It may be obtained from experiments or from suitable numerical simulations. The current method can be easily integrated into computational fluid dynamic (CFD) simulations and thus facilitate CFD-based design analysis. As an example of such CFD-integrated analysis, a large-scale hot water seasonal heat store is numerically studied to identify the effects of aspect ratio, containment shape, internal structures, and containment size on their efficiency. The results suggest the effectiveness of the new method in deriving useful design insights.     

高层建筑损伤识别中的补偿算法

本文在已有研究工作的基础上，提出了处理激励测量信息不完备情况下的补偿算法。此方法主要针对高层建筑动力检测中强迫激励的情况，是一种基于时域的识别方法，该方法实际上是利用客观工程实际中结构系统激励所具有的物理持征作为识别计算的辅助条件，来解决测量信息的不完备性问题。算例分析表明了该方法的可行性。     

Development of an integrated model for airflow in building spaces

In building energy simulation, an integrated modelling of airflow in the building needed. Therefore, in this paper two approaches are used for building energy simulation: zonal network for modelling of the building segments and Computational Fluid Dynamics (CFD) for modelling of the airflow. It is noted that a synchronize solution process is needed for the building and the CFD equation-sets. For this purpose an iterative procedure is used to corresponding solution of these equations.     

Synthesizing plans that contain actions with context-dependent effects1

This paper presents a method of solving planning problems that involve actions whose effects change according to the situations in which they are performed. The approach is an extension of the conventional planning methodology in which plans are constructed through an iterative process of scanning for goals that are not yet satisfied, inserting actions to achieve them, and introducing subgoals to these actions. This methodology was originally developed under the assumption that one would be dealing exclusively with actions that produce the same effects in every situation. The extension involves introducing additional subgoals to actions above and beyond the preconditions of execution normally introduced. These additional subgoals, called secondary preconditions, ensure that the actions are performed in contexts conducive to producing the effects we desire. This paper defines and analyzes secondary preconditions from a mathematically rigorous standpoint and demonstrates how they can be derived from regression operators.     

Applications of the 4×4 determinant method and the POLYGON ENGINE

In the first half of the paper, various types of processing pertaining to a polygon, using the 4×4 determinant theories are explained along with a new containment test algorithm of a point in a polygon. In the latter half of the paper, a general-purpose geometric processor, the POLYGON ENGINE, is presented which can deal with various types of interference problems, such as Boolean operations in solid modelling, hidden line and surface eliminations, ray tracing and so on. It is, a successor of the TRIANGLE PROCESSOR and is also based upon the 4×4 determinant theories [4–6]. While the TRIANGLE PROCESSOR processes a triangulated polygon on a triangle-by-triangle basis, the POLYGON ENGINE can treat a polygon without triangulation. The latter is expected to be more functional, more efficient and easier to use.     

Casual reasoning in planning1

Reasoning about actions necessarily involves tracking the truth of assertions about the world over time. The SIPE planning system retains the efficiency of the STRIPS assumption for this while enhancing expressive power by allowing the specification of a causl theory. Separation of knowledge about causality from knowledge about actions relieves operators of much of their representational burden and allows them to be applicable in a wide range of contexts. The implementation of causal theories is described, together with examples and evaluations of the system's expressive power and efficiency.     

示例学习的扩张矩阵理论

本文提出示例学习的一种计算理论,扩张矩阵论.根据这个理论,示例学习中一些主要最优化问题被证明是NP难题,并给出这些难题的近似解法及下界的估计.     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.