Minimum mass convective fins with variable heat transfer coefficients

Pontryagin's maximum principles are applied to obtain the solution of minimum mass convective fins with variable heat transfer coefficients. It is shown that the volume and the width of the fin are uniquely related to the specified heat transfer rate and the properties of the material. For a power law spatial variation of the heat transfer coefficient, the results are set forth in a dimensionless form and they are given in tables or graphs, in order to aid design procedures. Several properties relating to the optimum volume, base thickness and the width of the fins with the properties of the material are also discussed. The method can also be used to solve problems of minimum mass fins having restricted width, often encountered in practice.     

Some results on the Induced Matching Partition Number of Product Graphs

The induced matching partition number of graph G is the minimum integer k such that there exists a k-partition (V1,V2,…Vk) of V(G) such that,for each i(1≤i≤k),G[Vi]is 1-regular.In this paper,we study the induced matching partition number of product graphs. We provide a lower bound and an upper bound for the induced matching partition number of product graphs, and exact results are given for some special product graphs.     

On generic forms of complementary graphs

Each graph may be associated with a certain function called its generic form. If one knows the generic forms of given graphs, then one can easily determine the number of spanning trees in graphs obtained from a complete multi-graph either (1) by adding, or (2) by deleting the edges of disjoint copies of the given graphs. Our obejective here is to give a proof of a simple and useful relation between the generic forms of graphs that are complementary with respect to a complete multi-graph.     

Improved equalization and joint iterative detection

Intersymbol interference (ISI) degrades the bit error rate (BER) performance of sequential detectors such as maximum likelihood sequence detection (MLSD) and the maximum a posteriori (MAP) algorithm due to minimum distance reduction. This paper describes a novel rotation method that can increase the minimum distance and results in significant improvement in the BER performance for binary PSK and 4QAM systems when operating over severe ISI channels. Simulation results show that this method can improve the BER performance of systems employing MLSD and MAP turbo equalization by up to 4.6 dB compared to existing approaches including known precoding schemes.     

Multiple graphs clustering by gradient flow method

The core issue of multiple graphs clustering is to find clusters of vertices from graphs such that these clusters are well-separated in each graph and clusters are consistent across different graphs. The problem can be formulated as a multiple orthogonality constrained optimization model which can be shown to be a relaxation of a multiple graphs cut problem. The resulting optimization problem can be solved by a gradient flow iterative method. The convergence of the proposed iterative scheme can be established. Numerical examples are presented to demonstrate the effectiveness of the proposed method for solving multiple graphs clustering problems in terms of clustering accuracy and computational efficiency.     

1961-2012年云南省极端气温时空演变规律研究

利用云南省122个气象观测站1961-2012年逐月极值气温资料,采用线性趋势分析等方法分析1961-2012年云南省四季和年极端气温的变化趋势特征。结果表明:低纬高原地区年平均最高(最低)气温及四季最高(最低)气温的空间分布呈现北低南高的形式,整体上从滇西北向南随纬度的降低而增加,表现出明显的地区差异,最高(最低)气温的高值区域主要分布在河谷地区、云南南部地区,最高气温和最低气温的分布特征不仅受复杂地形的影响,而且还与观测站的海拔高度有关。最高(最低)气温低值区域主要分布在滇西北、滇东北;云南年平均最高气温与夏、秋、冬季最高气温的变化趋势基本相似,春季最高(最低)气温的变化具有明显的区域特征。除局部地区有降温外,升温趋势是最大的特点,升温最快的区域在滇西北。云南最高气温和最低气温的变化均呈明显的增温趋势,而最低气温的变化速度比最高气温的升温幅度快,说明云南的冷事件在减少,暖事件在增多。最高气温和最低气温的突变时间分别发生在2001年和1993年,最高气温的极大值出现在2010年,而最低气温的最大值也发生在2010年。不同气候类型代表站极端气温具有年代际和年际变化周期;极端气温发生的突变时间不同,而部分代表站的极端气温并未发生突变。     

Cascade embedding model for knowledge graph inference and retrieval

Knowledge graphs are widely used in retrieval systems, question answering systems (QA), hypothesis generation systems, etc. Representation learning provides a way to mine knowledge graphs to detect missing relations; and translation-based embedding models are a popular form of representation model. Shortcomings of translation-based models however, limits their practicability as knowledge completion algorithms. The proposed model helps to address some of these shortcomings.The similarity between graph structural features of two entities was found to be correlated to the relations of those entities. This correlation can help to solve the problem caused by unbalanced relations and reciprocal relations. We used Node2vec, a graph embedding algorithm, to represent information related to an entity's graph structure, and we introduce a cascade model to incorporate graph embedding with knowledge embedding into a unified framework. The cascade model first refines feature representation in the first two stages (Local Optimization Stage), and then uses backward propagation to optimize parameters of all the stages (Global Optimization Stage). This helps to enhance the knowledge representation of existing translation-based algorithms by taking into account both semantic features and graph features and fusing them to extract more useful information. Besides, different cascade structures are designed to find the optimal solution to the problem of knowledge inference and retrieval.The proposed model was verified using three mainstream knowledge graphs: WIN18, FB15K and BioChem. Experimental results were validated using the hit@10 rate entity prediction task. The proposed model performed better than TransE, giving an average improvement of 2.7% on WN18, 2.3% on FB15k and 28% on BioChem. Improvements were particularly marked where there were problems with unbalanced relations and reciprocal relations. Furthermore, the stepwise-cascade structure is proved to be more effective and significantly outperforms other baselines.     

Non-weighted H∞ performance for 2-D FMLSS switched system with maximum and minimum dwell time

This paper investigates the H_∞ performance of two-dimensional (2-D) switched system represented by Fornasini–Marchesini local state-space (FMLSS) model with maximum and minimum dwell time approach. By using the multiple Lyapunov function approach, and designing a set of switching signals subject to maximum and minimum dwell time characteristic, respectively, for all stable subsystems or both stable and unstable subsystems exist, we give the sufficient condition on exponential stability of the given switched system, and propose the sufficient condition which can guarantee that the given switched system is exponentially stable and has a specified H_∞ disturbance attenuation level γ. All the results obtained are on normal noise attenuation index of strictly non-weighted form, which are better than the existing results on weak one of weighted form from the physical point of view. Finally, numerical examples are presented to display the effectiveness of the proposed results.     

Velocity observer design for the consensus in delayed robot networks

The consensus problem for networks of multiple agents consists in reaching an agreement between certain coordinates of interest using a distributed controller. It may be desirable that all the agents find a consensus at a given desired leader coordinate (Leader Follower Consensus Problem LFCP), or it may be only necessary that they agree at a certain coordinates value (Leaderless Consensus Problem LCP). Consensus has many practical applications in robot networks systems, where the interconnection of the agents may present variable time delays, hence rendering the stability analysis and control design more complex. Another problem that may arise is the possible lack of velocity measurements. In this work, a Proportional plus damping injection (P + d) controller together with a linear velocity observer is introduced. Our approach is able to solve both the LFCP and the LCP in networks of robots modeled as undirected weighted graphs with unknown asymmetric (bounded) variable time delays. Local (semi global) asymptotic stability is proven and simulation results are provided to test the performance of the proposed scheme.     

上海百余年来气温日间波动特征及城市化影响

基于上海市区(徐家汇)气象站1873年-2009年和上海10个郊县气象站1960年-2009年逐日气温数据,利用气候统计诊断方法分析了上海最高和最低气温在两日间(简称日间)的波动特征及城市化影响,结果表明:1873年-2009年期间,上海最高气温日间降温日数逐渐增多,升温日数逐渐减少,最低气温日间降温日数呈多-少-多-少的年际变化,日间升温日数则呈少-多-少-多的年际变化。上海最高气温日间降温和升温幅度、降温和升温≥5℃日数和最低气温日间降温幅度、降温≥5℃日数都呈现出先增加后减少的年际变化,最低气温日间升温幅度和升温≥5℃日数在20世纪30年代前变化很小,从20世纪60年代至今明显减少。上海城市化增加了最高气温的日间波动幅度,并减少了最低气温的日间波动幅度,使得最高气温日间升温≥5℃日数增加和日间降温≥5℃日数减缓减少,最低气温日间降温和日间升温≥5℃日数均减少。     

Pseudo bond graphs for generalized compartmental models in engineering and physiology

True bond graphs, which use effort and flow variables whose product is power, can in principle be used to describe all types of physical systems. However, many system models do not use power variables and yet can be represented usefully as pseudo bond graphs. Pseudo bond graphs have been used particularly for open systems in which it is convenient to consider control volumes or compartments with boundaries across which mass can flow. In this paper, we show how the bond graph methods used for conductive and convective heat transfer can be generalized to account for diffusion, convection, and accumulation of a variety of physical quantities and how pseudo bond graphs can aid in constructing and representing such models. These models are known in mathematical biology as “compartmental models” and it is a main contribution of this paper to show that the same pseudo bond graphs apply to thermofluid and physiological dynamic models. The bond graphs build in some conservation principles automatically and yet have the flexibility to incorporate general multiport laws when necessary. Thus the pseudo bond graphs can exhibit system structure as do other network graphs and are very general in nature.     

改进的基于均衡约束数学规划的分类模型

对基于均衡约束数学规划(MPEC)的数据分类模型进行改进.在确定数据所服从分布的密度函数(高斯混合模型来模拟)的参数时,使用β似然估计来代替原模型中的最大似然估计.新模型可以克服似然函数可能出现无界的现象,在计算上有更好的鲁棒性.对于所得MPEC分类模型,使用filterSQP方法将其作为非线性规划求解.数值试验显示了新模型的有效性.     

青藏高原地表辐射的气候特征

青藏高原由于条件艰苦,地面观测站点少,对其地表辐射整体特征的认识还较初步。本文利用全球能量与水分循环试验的地表辐射收支工程(GEWEX-SRB)提供的卫星资料反演的1983年7月到2005年6月的地表辐射资料,研究了青藏高原地表辐射的基本特征及云对辐射的影响。研究结果表明:①地表向下短波辐射全年均在高原西南部最大,在雅鲁藏布江下游最小;②地表向上短波辐射最大值主要出现在春季,而最小值出现的时间存在区域差异;③地表有效辐射全年均为正值,在高原西南部最大,东南部最小;④地表净辐射由南向北逐渐减少,夏季最大,冬季最小;⑤云的地表向下和向上短波辐射强迫均在高原东南部最大,西部最小;⑥云的地表向下长波辐射强迫在高原西部边缘地区最大,西南地区最小;⑦云的地表净辐射强迫春、夏季在整个高原均为负值,秋季在高原东南部为负值、西北部为正值,冬季在整个高原均为正值并且水平变化小。     

Finite-time general function consensus for multi-agent systems over signed digraphs

This paper solves the finite-time consensus problem for discrete time multi-agent systems (MASs) where agents update their values via linear iteration and the interactions between them are described by signed digraphs. A sufficient condition is presented that the agents can reach consensus on any given linear function of multiple initial signals in finite time, i.e., there exists an eventually positive Laplacian-based matrix associated with the underlying graph. We prove that the linear iterative framework “ratio consensus” developed for unsigned graphs in the literature can be extended to the computation for signed graphs with appropriate modifications. Our method weakens the limitation of the iterative framework on the “marginal Schur stability” of the weight matrix without increasing the computational complexity. Reaching average consensus on unsigned graphs as in the literature is regarded as a special case of our algorithm. Two illustrative examples are presented to demonstrate the correctness of the proposed results.     

1960年至2007年汾河流域气温年际和季节性变化特征分析

运用线性倾向分析、滑动平均法、Mann-Kendall法等数理分析方法,对山西省汾河流域19个气象站1960年-2007年的逐月气温资料进行了分析。研究表明:自1960年以来,汾河流域年平均气温、平均最高和最低气温均呈波动变化趋势,并有升高趋势,递增率分别为0.32℃/10a、0.13℃/10a和0.50℃/10a。同时,气温年较差呈减小趋势,近48年的气温年较差递减率为0.37℃/10a。此外,年平均气温、平均最高和最低气温发生趋暖突变的时间分别是1993年、1996年、1981年,且近15年是流域年平均气温发生上升的主要时段。气候趋暖还表现出在冬季气温的递增速率最大的特点。流域南北年均气温变化的区域差异并不是很明显,但就各区域的季节变化而言,春冬两季的年均气温变化则表现出明显的区域差异。     

Variance reduction in large graph sampling

The norm of practice in estimating graph properties is to use uniform random node (RN) samples whenever possible. Many graphs are large and scale-free, inducing large degree variance and estimator variance. This paper shows that random edge (RE) sampling and the corresponding harmonic mean estimator for average degree can reduce the estimation variance significantly. First, we demonstrate that the degree variance, and consequently the variance of the RN estimator, can grow almost linearly with data size for typical scale-free graphs. Then we prove that the RE estimator has a variance bounded from above. Therefore, the variance ratio between RN and RE samplings can be very large for big data. The analytical result is supported by both simulation studies and 18 real networks. We observe that the variance reduction ratio can be more than a hundred for some real networks such as Twitter. Furthermore, we show that random walk (RW) sampling is always worse than RE sampling, and it can reduce the variance of RN method only when its performance is close to that of RE sampling.     

对称矩阵特征向量的神经网络求解

对已有的一种用于求解正定矩阵特征向量（特征值得数为１）的人工神经网络进行了研究。通过细致的数学分析，得出用这种网络同样能求出一般对称矩阵最大（最小）特征值对应的特征向量。     

桩墙结构的颗粒流数值模拟研究

利用PFC2D（particle flow code in two dimensions）平台和内置的fish语言,对桩墙、支撑等围护结构可以通过利用颗粒圆筒和平行粘结（the parallel-bond model）本构模型建立数值模型进行数值试验。通过对数值模型的端部施加各种荷载数值试验和三弯点应力数值试验,分别得到其变形、最大应力和弯矩,并与理论解进行对比,结果证明了颗粒流PFC2D能够用于分析围护结构在外荷载作用下的宏观力学响应,为颗粒流理论能够运用到复杂的结构分析中奠定了坚实的理论基础和合理的模拟途径。     

Event-triggered consensus for second-order multi-agent systems with sampled position data via impulsive control

In this paper, the sampled-data-based event-triggered (SDBET) consensus problem of second-order multi-agent systems (MASs) with sampled position data is studied via impulsive control. Firstly, two kinds of SDBET impulsive control protocols are proposed, both of which employ sampled position data only. Secondly, a novel SDBET transmission scheme is designed to ensure the maximum length of triggering intervals exists, which can be regulated by the parameters in the triggering function. Also, the Zeno behavior is naturally excluded under the SDBET transmission scheme. And by using the designed SDBET impulsive control scheme, consensus of second-order MASs can be achieved with lower transmission and control updating frequency than using the periodical impulsive control scheme. Thirdly, sufficient conditions on the communication topology, the length of triggering intervals and control gains are derived to achieve SDBET consensus. It is also shown that to achieve consensus, both the maximum and minimum lengths of triggering intervals should be restricted. Also, a practical method for calculating the sampling period and other triggering parameters is given to ensure that the length of the triggering interval does not exceed the given range, and the SDBET transmission scheme is truly realized. Finally, some numerical examples are given to demonstrate the effectiveness of the theoretical results.     

Integration of complex objects and transitive relationships for information retrieval

In this paper we show that in advanced information retrieval (IR) applications capabilities for data aggregation, transitive computation and NF² (non-first normal form) relational computation are often necessary at the same time. We demonstrate that complex objects are naturally modeled as NF² relations, whereas structures like hierarchical thesauri must be modeled for transitive computation. Transitive processing cannot be supported by structurally static structures like NF² relations. We present a truly declarative query interface, which integrates data aggregation, transitive computation and NF² relational computation. Thus the interface supports the retrieval and structural manipulation of complex objects (e.g. documents and bibliographic references), their retrieval through transitive relationships (e.g. thesauri, citations) and data aggregation based on their components (e.g. citation counts, author productivity). Most importantly, users can formulate queries on a high abstraction level without mastering actual programming or database techniques.