瞬态加热环境下变厚度板温度场及热模态分析

瞬态加热会严重影响结构的固有振动特性. 以变厚度板为研究对象,进行热载状态下结构的瞬态温度场和振动特性分析. 计算结果表明,在加热过程中,结构温度发生显著变化并引起热应力,进一步影响到结构的固有振动特性.     

Searching for revolution in structural computing

The structural computing paradigm has been described as one that holds significant promise and potential for the developers of both applications and infrastructure services. At this stage in its development, however, structural computing can be viewed mainly as an evolutionary progression of research in the hypermedia field rather than as the revolutionary force it was anticipated to be. The field of structural computing is still a new one though. It may still possess revolutionary potential that has so far gone untapped. In order for its revolutionary potential to be realized, however, research is needed that focuses on the fundamental ideas that define and distinguish the structural computing field. Only through an examination and exploration of its essential features can the revolutionary potential of structural computing be assessed.     

Dynamic interval-based labeling scheme for efficient XML query and update processing

XML data can be represented by a tree or graph structure and XML query processing requires the information of structural relationships among nodes. The basic structural relationships are parent-child and ancestor-descendant, and finding all occurrences of these basic structural relationships in an XML data is clearly a core operation in XML query processing. Several node labeling schemes have been suggested to support the determination of ancestor-descendant or parent-child structural relationships simply by comparing the labels of nodes. However, the previous node labeling schemes have some disadvantages, such as a large number of nodes that need to be relabeled in the case of an insertion of XML data, huge space requirements for node labels, and inefficient processing of structural joins. In this paper, we propose the nested tree structure that eliminates the disadvantages and takes advantage of the previous node labeling schemes. The nested tree structure makes it possible to use the dynamic interval-based labeling scheme, which supports XML data updates with almost no node relabeling as well as efficient structural join processing. Experimental results show that our approach is efficient in handling updates with the interval-based labeling scheme and also significantly improves the performance of the structural join processing compared with recent methods.     

A formal approach to automating conceptual structural design,Part I: Methology

In the conceptual phase of structural design a designer develops and investigates many potential alternatives for safe and economic transfer of loads that are to be carried by the structure. A methodology for automating conceptual structural design is presented in this paper. Some of the salient aspects of the methodology are: (1) an explicit representation of the structural form, function, and behavior; (2) modeling the structural engineering domain as well as the strategy employed by expert designers; (3) usingcost/value ratio as an intrinsic measure of the merit of a design alternative; and (4) reduced reliance on heuristics with more emphasis on first principles and fundamental knowledge. The categories of knowledge that need to be represented in a computer system to support the reasoning for conceptual structural design are identified. The use of such knowledge is illustrated through examples based on several different types of structures. A constraint classification system (to organize the constraints that arise from structural and exogenous considerations) is also proposed.     

UnQL: a query language and algebra for semistructured data based on structural recursion

Abstract. This paper presents structural recursion as the basis of the syntax and semantics of query languages for semistructured data and XML. We describe a simple and powerful query language based on pattern matching and show that it can be expressed using structural recursion, which is introduced as a top-down, recursive function, similar to the way XSL is defined on XML trees. On cyclic data, structural recursion can be defined in two equivalent ways: as a recursive function which evaluates the data top-down and remembers all its calls to avoid infinite loops, or as a bulk evaluation which processes the entire data in parallel using only traditional relational algebra operators. The latter makes it possible for optimization techniques in relational queries to be applied to structural recursion. We show that the composition of two structural recursion queries can be expressed as a single such query, and this is used as the basis of an optimization method for mediator systems. Several other formal properties are established: structural recursion can be expressed in first-order logic extended with transitive closure; its data complexity is PTIME; and over relational data it is a conservative extension of the relational calculus. The underlying data model is based on value equality, formally defined with bisimulation. Structural recursion is shown to be invariant with respect to value equality. Received: July 9, 1999 / Accepted: December 24, 1999     

基于加权合著网络的结构洞特征分析

科研合作日趋频繁,形成了大量复杂的网络结构,如引文网络、共引网络及合著网络等,合著现象也越来越多。结构洞的发现有助于科研合作中提高团队整体的创新能力。目前对于合著网络的结构洞分析多为无权网络,为了研究合著者的紧密程度在结构洞分析中的作用,以加权的合著网络为研究对象,将权重引入到约束度中,并对现有的结构洞算法--HIS算法进行改进,提出一种基于加权约束度的结构洞挖掘算法（W_CIHIS算法）。用约束度作为衡量指标,将W_CIHIS算法与HIS算法应用到公共数据进行对比,实验结果表明提出的算法有很好的效果。     

Reachability matrix and relation to large-scale systems

A sequential derivation of the reachability matrix is given, related to graph theoretic considerations, and earlier results on the structural inverse of a matrix are reformulated on the basis of an observed duality. A relationship between a matrix, a full rank permutation matrix included in it and its reachability matrix are given, as well as a property of the reachability matrix of a product. A hypothesis on the reachability matrix, stating that it is ‘its own inverse’ and relating to the structural modal matrix, is confirmed and the reachability and the acyclic input-output reachable partitions of dynamic systems are discussed; forms relating them to structural controllability, structural observability and structural transfer function matrices are presented.     

Detecting vegetation structure using a kernel-based BRDF model

The magnitude of the anisotropy of vegetation is mainly determined by its spectral and structural features. It can be described by the bidirectional reflectance distribution function (BRDF). The parameters of physical BRDF models are related to the biophysical structural information. However, for a semiempirical kernel-based BRDF model, the relationship between BRDF parameters and vegetation structure is no longer as clear as with a physical BRDF model. To reveal this relationship, a structural scattering index (SSI) and a relative structural scattering index (RSSI) are derived based on the BRDF parameters in this paper. The investigation of SSI and RSSI show that they have both theoretical and practical meaning and can be used to distinguish different land cover types or to detect structural changes.     

Measuring the structural similarity among XML documents and DTDs

Measuring the structural similarity between an XML document and a DTD has many relevant applications that range from document classification and approximate structural queries on XML documents to selective dissemination of XML documents and document protection. The problem is harder than measuring structural similarity among documents, because a DTD can be considered as a generator of documents. Thus, the problem is to evaluate the similarity between a document and a set of documents. An effective structural similarity measure should face different requirements that range from considering the presence and absence of required elements, as well as the structure and level of the missing and extra elements to vocabulary discrepancies due to the use of synonymous or syntactically similar tags. In the paper, starting from these requirements, we provide a definition of the measure and present an algorithm for matching a document against a DTD to obtain their structural similarity. Finally, experimental results to assess the effectiveness of the approach are presented.     

Climbing parallel robot: a computational and experimental study of its performance around structural nodes

This paper presents a study of the kinematics and dynamics performance of a climbing parallel robot (CPR) to avoid nodes on structural frames. To avoid a structural node, a CPR can acquire some determined postures. A series of postures can be combined to generate the convenient movements to climb along the structural node. The postures of a CPR must be studied to detect its feasibility, because the postures can drive the robot near its singular configurations. Also, the forces originated in the actuators to evade the structural nodes are evaluated. Therefore, the goal of this paper is to show that a Stewart-Gough (S-G) parallel platform can be used as a climbing robot, because a CPR can avoid structural nodes easily and elegantly, in contrast with other types of robots. To support the simulation results presented in the first part of this paper, an experimental testbed has been developed to study the dynamic performance of the CPR prototype around a structural node. The results obtained are very interesting, and show that an industrial potential to use the parallel S-G robot as a climbing robot exists.     

Evolutionary natural frequency optimization of thin plate bending vibration problems

This paper extends the evolutionary structural optimization method to the solution for maximizing the natural frequencies of bending vibration thin plates. Two kinds of constraint conditions are considered in the evolutionary structural optimization method. If the weight of a target structure is set as a constraint condition during the natural frequency optimization, the optimal structural topology can be found by removing the most ineffectively used material gradually from the initial design domain of a structure until the weight requirement is met for the target structure. However, if the specific value of a particular natural frequency is set as a constraint condition for a target structure, the optimal structural topology can be found by using a design chart. This design chart describes the evolutionary process of the structure and can be generated by the information associated with removing the most inefficiently used material gradually from the initial design domain of a structure until the minimum weight is met for maintaining the integrity of a structure. The main advantage in using the evolutionary structural optimization method lies in the fact that it is simple in concept and easy to be included into existing finite element codes. Through applying the extended evolutionary structural optimization method to the solution for the natural frequency optimization of a thin plate bending vibration problem, it has been demonstrated that the extended evolutionary structural optimization method is very useful in dealing with structural topology optimization problems.     

The stochastic finite-element method

A generic stochastic finite-element method for modeling structures is proposed as a means to analyze and design structures in a probabilistic framework. Stochastic differential and difference equation theory is applied in structures discretized with the finite-element methodology.Transient structural loads, idealized as stochastic processes, are incorporated into finite-element dynamic models with uncertain parameters. An estimate of the probability of failure based on known and established procedures in second-moment reliability analysis can be made with the aid of a transformation to gaussian space of the random variables that define structural reliability.The stochastic finite-element method will facilitate the use of probabilistic mathematical structural models for structural code development or design of important structures. It will also permit better estimation of structural reliability, which, when combined with risk analysis, could lead to improved decision-making processes.     

The equivalent static loads method for structural optimization does not in general generate optimal designs

The Equivalent Static Loads Method (ESLM) is an algorithm intended for dynamic response structural optimization. The algorithm attempts to solve a sequence of static response structural optimization problems approximating the original problem. It is argued in several published articles that if the ESLM converges, then it finds a KKT point of the considered dynamic structural response optimization problem. The theoretical convergence properties of the ESLM are however not as strong as previously reported. We propose and analyze easily reproducible counter examples based on a two-bar truss illustrating that the ESLM in general fails in finding optimal designs to the considered dynamic response problem.     

Three-dimensional quantitative structure-activity relationship for several bioactive peptides searched by a convex hull-comparative molecular field analysis approach

Three-dimensional (3D) convex hulls are computed for theoretically generated structures of a group of 18 bioactive tachykinin peptides. The number of peptides treated as a training set is 14, whereas that treated as a test set is four. The frequency of atoms of the same atomic type lying at the vertices of all the hulls computed for all the structures in a structural set is counted. Vertex atoms with non-zero frequency counted are collected together as a set of commonly exposed groups. These commonly exposed atoms are then treated as a set of correspondences for aligning all the other 13 structures in a structural set against a common template, which is the structure of the most potent peptide in the set using the FIT module of the SYBYL 6.6 program. Each aligned structural set is then analyzed by the comparative molecular field analysis (CoMFA) module using the C.3 probe having a charge of +1.0. The corresponding cross-validated r2 values range from -0.99 to 0.57 for a number of 73 structural sets studied. The comparative molecular similarity indices analysis (CoMSIA) module within the SYBYL 6.6 package is also used to analyze some of these aligned structural sets. Although the CoMSIA results are in accord with those of CoMFA, it is also found that the CoMFA results of several structural sets can be improved somewhat for conformations of the structures in the sets that are adjusted by constraint energy minimization and then constraint molecular dynamics simulation runs using distance constraints derived from some commonly exposed groups determined for them. This result further implies that the convex hull-CoMFA is a feasible approach to screen the bioactive conformations for molecules of this class.     

体数据中物体之间结构关系的描述方法

体数据中不同的物体之间存在不同的结构关系,如隐藏关系、拓扑关系等,不同结构关系是影响用户理解体数据的重要特征之一。从分析体数据中物体之间关系入手,提出一个有效的体绘制应当定义一个从数据到绘制的映射,以便将数据中物体之间的每种关系映射到绘制空间。然后提出描述体数据中物体之间典型结构关系的体绘制方法。在绘制空间对物体之间的不同关系的描述增强了用户对体数据的理解,并拓展了体绘制在体数据分析中的功能。     

Controlling failure using structural fuses for predictable progressive failure of composite laminates

Structural fuses have been used to bias and control failures in structural applications where predictability of the progressive failure or collapse response is important. Tailoring structural fuses by trial and error in large structures that have numerous possible load and failure paths is not possible because the optimum failure sequence is not known a priori. Using nondeterministic methods to tailor structural fuses is computationally expensive. A procedure for developing deterministic measures to optimize structural fuses is presented here. The progressive failure of composite laminates is used for demonstration. Structural fuses are optimized using a reliability optimization. The failure response characteristics of the laminate with optimum structural fuses are used to identify deterministic measures that correlate with high progressive failure predictability. The deterministic measures are validated by using them as surrogate design criteria in a deterministic optimization to optimize structural fuses that control failure and improve progressive failure predictability. The improvement in predictability of the deterministic optimum design achieved by using optimized structural fuses is better than that obtained by optimizing the ply angles of the laminate explicitly for predictability.     

Quantifying Structural Time Varying Changes in Helical Data

Spiral structures are one of the most difficult patterns to classify. Spiral time series data has a helical movement with time that is both difficult to predict as well as classify. This paper focusses on how structural information about spirals can be useful in providing critical information to a neural network for their recognition. Results are presented on neural network solutions to the classical two-spiral problem by extracting structural and rotational information from the spiral training data. The results show that in both two and three dimensions, the spirals can be easily recognised by neural networks if they are trained on the temporal structural changes.     

XML文档的相似测度和结构索引研究

提出了一个可用于定量度量XML文档间差异的方法(称为XED距离)。利用结点间的模拟关系，一个XML文档可以表示为一棵精简的、带权重的结构索引树，两个XML文档间的相似度可以通过计算它们的索引树间的编辑距离来测定，利用索引树可以大大提高判定两个XML文档结构相似度的效率，XED距离测度可用于XML文档的结构搜索、XML文档聚类、XML文档结构抽取、XML文档的变换检测以及XML视图的增量计算和维护等。     

Representation and structural difficulty in genetic programming

Standard tree-based genetic programming suffers from a structural difficulty problem in that it is unable to search effectively for solutions requiring very full or very narrow trees. This deficiency has been variously explained as a consequence of restrictions imposed by the tree structure or as a result of the numerical distribution of tree shapes. We show that by using a different tree-based representation and local (insertion and deletion) structural modification operators, that this problem can be almost eliminated even with trivial (stochastic hill-climbing) search methods, thus eliminating the above explanations. We argue, instead, that structural difficulty is a consequence of the large step size of the operators in standard genetic programming, which is itself a consequence of the fixed-arity property embodied in its representation.     

基于递归投影的结构性网络嵌入

近些年来,在网络嵌入（network embedding）领域的大多数研究都着眼于基于网络节点邻接关系的社区身份,如node2vec和DeepWalk;而基于网络拓扑结构的结构身份研究则十分匮乏,前沿方法如struc2vec等,通常效率很低。提出了递归结构性网络嵌入（recurrent structural network embedding,RSNE）,一种新颖而高效的结构特征学习方法。RSNE递归式地把节点的结构身份定义为其邻居结构身份的非线性投影。为了避免退化为基于邻接关系的聚类,采用了一种有效而鲁棒的初始化方法。理论分析显示RSNE在时间复杂度上显著优于现有的结构性网络嵌入方法,可视化与量化实验结果也表明RSNE在分类准确性和鲁棒性上达到了最新方法相同或更好的效果,同时消耗的计算时间与空间消耗也远远更少。