Punching Shear Behavior of RC Slab-Column Connections with Nonrectangular Columns

This paper present an experimental study on the RC slab-column connections with nonrectangular columns, namely cross-shaped column, T-shaped column and L-shaped column. The punching shear deformation and strength characteristics of slab-column connections with nonrectangular columns under punching shear load are investigated. Nine specimens with the three kinds of nonrectangular columns and two reference specimens with square columns are tested. The tested ultimate loads, deformations, and failure modes of specimens are presented and discussed. Test results reveal that the punching shear strength and ductility of the connections with nonrectangular columns are higher than those of the corresponding connections with square columns, and also prove that the application of nonrectangular columns to flat-plate structure was feasible. Based on the test results, one method of calculating punching shear strength of connections with nonrectangular columns is proposed, which conforms with the current design practice of China. The test results on the punching shear strength are compared with the predictions of the formulas proposed by codes of several different countrie; and the predictions given by ACI code and China code are found to be conservative as the reinforcement ratio is increased.

THREE-DIMENSIONAL FINITE ELEMENT DELAUNAY MESH GENERATION BY A PERFECTED NODE CONNECTION METHOD

How to automatically generate three-dimensional finite element Delaunay mesh by a peifected node connection method is introduced, where nodes are generated based on existing elements, instead of independence of node creation and elements generation in traditional node connection method. Therefore, Ihe the difficulty about how to automatically create nodes in the traditional method is overcome.

Issues and Challenges in Node Connectivity in Mobile Ad Hoc Networks: A Holistic Review

One of the fundamental properties of an ad hoc network is its connectivity. Maintaining connectivity in wireless networks is extremely difficult due to dynamic changing topology of MANETs. There are several techniques to understand the connectivity level for a given network topology. In this paper, we examine the existing methods and discuss the issues and challenges that are still insurmountable in order to enhance the connectivity properties of wireless multi hop networks.

Expression of connective tissue growth factor in tumor tissues is an independent predictor of poor prognosis in patients with gastric cancer

AIM: To examine the expression of connective tissue growth factor (CTGF), also known as CCN2, in gastric carcinoma (GC), and the correlation between the expression of CTGF, clinicopathologic features and clinical outcomes of patients with GC. METHODS: One hundred and twenty-two GC patients were included in the present study. All patients were followed up for at least 5 years. Proteins of CTGF were detected using the Powervision two-step immunostaining method. RESULTS: Of the specimens from 122 GC patients analyzed for CTGF expression, 58 (58/122, 47.5%) had a high CTGF expression in cytoplasm of gastric carcinoma cells and 64 (64/122, 52.5%) had a low CTGF expression. Patients with a high CTGF expression showed a higher incidence of lymph node metastasis than those with a low CTGF expression (P = 0.032). Patients with a high CTGF expression had significantly lower 5-year survival rate than those with a low CTGF expression (27.6% vs 46.9%, P = 0.0178), especially those staging Ⅰ+Ⅱ+Ⅲ (35.7% vs 65.2%, P = 0.0027). CONCLUSION: GC patients with an elevated CTGF expression have more lymph node metastases and a shorter survival time. CTGF seems to be an independent prognostic factor for the successful differentiation of high-risk GC patients staging Ⅰ+Ⅱ+Ⅲ. Over-expression of CTGF in human GC cells results in an increased aggressive ability.

Distributed Connectivity Restoration Strategy for Movable Sensor Networks

Failure of one or multiple critical nodes may partition wireless sensor networks into disjoint segments, and thus brings negative effect on the applications. We propose DCRS, a Distributed Connectivity Restoration Strategy to tolerate the failure of one critical node. Because of the energy restriction of sensor nodes, the energy overhead of the recovery process should be minimized to extend the lifetime of the network. To achieve it, we first design a novel algorithm to identify 2-critical nodes only relying on the positional information of 1-hop neighbors and some 2-hop neighbors, and then we present the criteria to select an appropriate backup for each critical node. Finally, we improve the cascaded node movement algorithm by determining whether a node can move to another non-adjacent node directly or not to reduce the number of nodes moved. The effectiveness of DCRS is validated through extensive simulation experiments.

Multiple Node Placement Strategy for Efficient Routing in Wireless Sensor Networks

The advances in recent technology have lead to the development of wireless sensor nodes forming a wireless network, which over the years is used from military application to industry, household, medical etc. The deployment pattern of sensor nodes in Wireless Sensor Network (WSN) is always random for most of the applications. Such technique will lead to ineffective utilization of the network;for example fewer nodes are located at far distance and dense nodes are located at some reason and part of the region may be without the surveillance of any node, where the networks do consume additional energy or even may not transfer the data. The proposed work is intended to develop the optimized network by effective placement of nodes in circular and grid pattern, which we call as uniformity of nodes to be compared with random placement of nodes. Each of the nodes is in optimized positions at uniform distance with neighbors, followed by running a energy efficient routing algorithm that saves an additional energy further to provide connectivity management by connecting all the nodes. Simulation results are compared with the random placement of nodes, the residual energy of a network, lifetime of a network, energy consumption of a network shows a definite improvement for uniform network as that of with the random network.

Precise Asymptotic Distribution of the Number of Isolated Nodes in Wireless Networks with Lognormal Shadowing

In this paper, we study the connectivity of multihop wireless networks under the log-normal shadowing model by investigating the precise distribution of the number of isolated nodes. Under such a realistic shadowing model, all previous known works on the distribution of the number of isolated nodes were obtained only based on simulation studies or by ignoring the important boundary effect to avoid the challenging technical analysis, and thus cannot be applied to any practical wireless networks. It is extremely challenging to take the complicated boundary effect into consideration under such a realistic model because the transmission area of each node is an irregular region other than a circular area. Assume that the wireless nodes are represented by a Poisson point process with densitynover a unit-area disk, and that the transmission power is properly chosen so that the expected node degree of the network equals lnn + ξ (n), where ξ (n) approaches to a constant ξ as n →?∞. Under such a shadowing model with the boundary effect taken into consideration, we proved that the total number of isolated nodes is asymptotically Poisson with mean e$ {-ξ}. The Brun’s sieve is utilized to derive the precise asymptotic distribution. Our results can be used as design guidelines for any practical multihop wireless network where both the shadowing and boundary effects must be taken into consideration.

An Efficient Connectivity Restoration Technique(ECRT)for Wireless Sensor Network

Node failure in Wireless Sensor Networks(WSNs)is a fundamental problem because WSNs operate in hostile environments.The failure of nodes leads to network partitioning that may compromise the basic operation of the sensor network.To deal with such situations,a rapid recovery mechanism is required for restoring inter-node connectivity.Due to the immense importance and need for a recovery mechanism,several different approaches are proposed in the literature.However,the proposed approaches have shortcomings because they do not focus on energy-efficient operation and coverage-aware mechanisms while performing connectivity restoration.Moreover,most of these approaches rely on the excessive mobility of nodes for restoration connectivity that affects both coverage and energy consumption.This paper proposes a novel technique called ECRT(Efficient Connectivity Restoration Technique).This technique is capable of restoring connectivity due to single and multiple node failures.ECRT achieves energy efficiency by transmitting a minimal number of control packets.It is also coverage-aware as it relocates minimal nodes while trying to restore connectivity.With the help of extensive simulations,it is proven that ECRT is effective in connectivity restoration for single and multiple node failures.Results also show that ECRT exchanges a much smaller number of packets than other techniques.Moreover,it also yields the least reduction in field coverage,proving its versatility for connectivity restoration.

Detection of influential nodes with multi-scale information

The identification of influential nodes in complex networks is one of the most exciting topics in network science.The latest work successfully compares each node using local connectivity and weak tie theory from a new perspective.We study the structural properties of networks in depth and extend this successful node evaluation from single-scale to multi-scale.In particular,one novel position parameter based on node transmission efficiency is proposed,which mainly depends on the shortest distances from target nodes to high-degree nodes.In this regard,the novel multi-scale information importance(MSII)method is proposed to better identify the crucial nodes by combining the network's local connectivity and global position information.In simulation comparisons,five state-of-the-art algorithms,i.e.the neighbor nodes degree algorithm(NND),betweenness centrality,closeness centrality,Katz centrality and the k-shell decomposition method,are selected to compare with our MSII.The results demonstrate that our method obtains superior performance in terms of robustness and spreading propagation for both real-world and artificial networks.

Coordinated node scheduling for energy-conserving in large wireless sensor networks

Aiming at developing a node scheduling protocol for sensor networks with fewer active nodes,we propose a coordinated node scheduling protocol based on the presentation of a solution and its optimization to determine whether a node is redundant.The proposed protocol can reduce the number of working nodes by turning off as many redundant nodes as possible without degrading the coverage and connectivity.The simulation result shows that our protocol outperforms the peer with respect to the working node number and dynamic coverage percentage.

CNR:A Cluster-Based Solution for Connectivity Restoration for Mobile WSNs

Wireless Sensor Networks(WSNs)are an integral part of the Internet of Things(IoT)and are widely used in a plethora of applications.Typically,sensor networks operate in harsh environments where human intervention is often restricted,which makes battery replacement for sensor nodes impractical.Node failure due to battery drainage or harsh environmental conditions poses serious challenges to the connectivity of the network.Without a connectivity restoration mechanism,node failures ultimately lead to a network partition,which affects the basic function of the sensor network.Therefore,the research community actively concentrates on addressing and solving the challenges associated with connectivity restoration in sensor networks.Since energy is a scarce resource in sensor networks,it becomes the focus of research,and researchers strive to propose new solutions that are energy efficient.The common issue that is well studied and considered is how to increase the network’s life span by solving the node failure problem and achieving efficient energy utilization.This paper introduces a Clusterbased Node Recovery(CNR)connectivity restoration mechanism based on the concept of clustering.Clustering is a well-known mechanism in sensor networks,and it is known for its energy-efficient operation and scalability.The proposed technique utilizes a distributed cluster-based approach to identify the failed nodes,while Cluster Heads(CHs)play a significant role in the restoration of connectivity.Extensive simulations were conducted to evaluate the performance of the proposed technique and compare it with the existing techniques.The simulation results show that the proposed technique efficiently addresses node failure and restores connectivity by moving fewer nodes than other existing connectivity restoration mechanisms.The proposed mechanism also yields an improved field coverage as well as a lesser number of packets exchanged as compared to existing state-of-the-art mechanisms.

An Optimal Cluster Head and Gateway Node Selection with Fault Tolerance

In Mobile Ad Hoc Networks(MANET),Quality of Service(QoS)is an important factor that must be analysed for the showing the better performance.The Node Quality-based Clustering Algorithm using Fuzzy-Fruit Fly Optimiza-tion for Cluster Head and Gateway Selection(NQCAFFFOCHGS)has the best network performance because it uses the Improved Weighted Clustering Algo-rithm(IWCA)to cluster the network and the FFO algorithm,which uses fuzzy-based network metrics to select the best CH and entryway.However,the major drawback of the fuzzy system was to appropriately select the membership func-tions.Also,the network metrics related to the path or link connectivity were not considered to effectively choose the CH and gateway.When learning fuzzy sets,this algorithm employs a new Continuous Action-set Learning Automata(CALA)approach that correctly modifies and chooses the fuzzy membership functions.Despite the fact that it extends the network’s lifespan,it does not assist in the detection of defective nodes in the routing route.Because of this,a new Fault Tolerance(NQCAEFFFOCHGS-FT)mechanism based on the Distributed Connectivity Restoration(DCR)mechanism is proposed,which allows the net-work to self-heal as a consequence of the algorithm’s self-healing capacity.Because of the way this method is designed,node failures may be utilised to rebuild the network topology via the use of cascaded node moves.Founded on the fractional network information and topologic overhead related with each node,the DCR is suggested as an alternative to the DCR.When compared to the NQCAFFFOCHGS algorithm,the recreation results display that the proposed NQCAEFFFOCHGS-FT algorithm improves network performance in terms of end-to-end delay,energy consumption,Packet Loss Ratio(PLR),Normalized Routing Overhead(NRO),and Balanced Load Index(BLI).

部分包覆钢-混凝土组合梁柱节点抗震性能试验研究

为研究不同连接构造的部分包覆钢-混凝土组合梁柱节点(PEC梁柱节点)的抗震性能,对2个PEC梁柱节点试件进行了拟静力加载试验,研究了低周往复荷载作用下PEC梁柱节点试件的破坏现象、滞回曲线、骨架曲线、延性、耗能能力和刚度退化等抗震性能。结果表明:强轴连接PEC梁柱节点的滞回曲线呈梭形和弓形,在达到极限承载力后仍能保持一定的延性和耗能能力;弱轴连接PEC梁柱节点牛腿与梁间的焊缝处发生破坏,未展现出预期的耗能能力,PEC梁仍在弹塑性状态,没有达到极限状态;PEC梁柱节点核心区混凝土替换为加劲肋板后,试件仍具有较好的承载力、延性和耗能能力,刚度退化规律无明显变化,且强轴连接节点与弱轴连接节点刚度变化规律基本一致;PEC柱牛腿设计过短会导致焊缝连接处断裂,试件延性和耗能能力得不到发挥,剩余刚度较大。

西安城市展示中心长悬挑、大跨度钢结构设计

西安城市展示中心由南馆、北馆和连桥组成,其中南馆悬挑长度62m,连桥跨度150m。结合建筑方案特点,南馆与连桥采用整层钢桁架结构体系,结构布置与建筑形态高度契合。介绍了南馆、连桥、穹顶、屋面等位置的结构布置情况,明确了超限项和抗震性能目标,对于多杆件复杂交汇钢节点进行有限元分析。针对南馆、连桥屋楼盖振动舒适度不足,设计布置了调谐质量阻尼器(TMD),实测减振效果显著。对连桥提升过程进行施工模拟,结果表明该过程增加了连桥挠度,需要考虑提前起拱。对超长连体结构温度和地震行波效应进行分析,根据结果对连桥楼板配筋和局部框架柱进行了加强。大震弹塑性分析与防连续倒塌分析结果表明,结构满足“大震不倒”的性能目标,结构冗余度较高,具有良好的防连续倒塌能力。

基于灾害演化网络的泥石流风险评估方法研究

为准确地进行泥石流灾害演化风险评估、关键节点的定量识别,构建了基于灾害演化网络、结合随机过程的风险评估模型。通过构建灾害演化网络分析灾害链演化规律和灾害节点的影响程度,引入概率随机分布描述致灾节点发生概率和灾害节点的可能性,并将致灾节点发生概率,灾害节点发生后的影响程度和发生可能性进行耦合,识别灾害网络演化关键节点。将该方法应用于四川汶川板子沟地区泥石流后,结果表明:在四川汶川板子沟地区泥石流灾害演化中,风险控制的关键点分别是阻止泥石流入侵居民聚集地,减少交通受阻和救援受阻,与实际救援现场情况相符。研究结果可以为更有效地进行泥石流灾害应急救援提供一定的理论支撑。

融合二连通模体结构信息的节点分类算法

节点表示学习将图结构数据信息编码到低维的潜在空间中,在节点分类、聚类、链路预测等机器学习任务中被广泛应用。在复杂网络中,节点与节点之间不仅存在直接相连的低阶结构,也存在以特殊连接模式形成的高阶结构,称为模体。提出一种融合二连通模体结构信息的节点分类算法(FMI),利用节点间高阶二连通模体信息学习节点表示,完成节点分类任务。首先,统计网络中的二连通模体,利用其中信息提出一个节点重要性的度量指标——模体比值。根据模体比值计算采样概率进行邻域采样;构造一个带权辅助图以融合网络节点连接的低阶关系与高阶关系,对节点进行加权邻域聚合以得到节点表示。在5个数据集Cora、Citeseer、Pubmed、Wiki和DBLP上执行节点分类任务,与5种经典基准算法进行对比,所提算法FMI在准确度和F1-分数等指标上表现良好。

轻钢龙骨防火组合楼板梁板节点连接试验研究

轻钢龙骨防火组合楼板是一种新型的装配式楼板,因为自重较小,同时具有较大的承载力,板底板顶附层为防火楼板,具有较好的防火能力,该种楼板作为简支板直接放置于工字钢梁上,支座处无法传递负弯矩,因此在梁顶支座处会出现一条通缝,严重影响使用效果,同时简支板体系也不符合抗震规范的要求。本文提出一种新的支座处梁板节点连接方式,目的是通过合理连接,实现支座处能够传递负弯矩,由简支变为固结。试验采用液压千斤顶对试件施加静荷载,对11个全比例节点连接试件进行研究,考虑连接件搭接长度、连接件厚度、连接所用的自攻螺钉(螺栓)的数量,以及连接件尺寸对梁板连接节点承载力和挠度的影响,并对节点连接件与C型轻钢龙骨之间的变形协调能力做出了分析。研究表明,本文提出的以Z型钢为连接件的梁板节点连接方法安全可靠,可实现该新型楼板的双跨以及多跨连接。

加气混凝土复合保温外墙板连接节点试验研究

通过对钢管锚节点、套筒节点和新型F型节点进行的6组加气混凝土板四分点加载节点极限承载力试验,分析不同板厚下3种节点的节点强度、节点刚度等性能指标。研究表明:新型F型节点力学性能良好,连接可靠,节点极限承载力随板厚增加而增大。新型F型节点可较好地适用在加气混凝土复合保温外墙板体系中。

基于最大最小蚁群系统的车载自组网路由策略

城市车载自组织网络中具有拓扑变化频繁,车辆分布不均匀等特性,因此如何选择下一跳车辆和确定最优传输路径是在复杂城市环境下设计高效路由协议的两个具有挑战性的问题.针对目前车载自组网中基于地理位置的算法具有下一跳车辆选取不合理,数据的传输路径缺少整体规划等问题,提出了一种基于最大最小蚁群系统的车载自组网路由策略.首先,采用基于分段连通度的最大最小蚁群探索机制进行路径探索.其次,采用基于接收节点驱动的转发机制优化数据包在车辆之间的多跳转发方式.仿真结果表明,与经典的基于地理位置的GPSR协议和基于GPSR协议改进的MM-GPSR算法相比较,本算法在数据包投递率和平均端到端时延方面均优于对比算法.

自复位支撑钢框架摩擦装配式节点性能研究

自复位支撑在激活后具有较大的刚度和承载力,支撑连接节点及梁柱受力复杂,损伤风险高。提出了一种基于摩擦连接的自复位支撑钢框架装配式节点,利用摩擦滑移连接实现自复位支撑极限轴力可控,并为整体结构提供附加耗能。阐述了该摩擦装配式节点的构造、组装和工作原理,通过数值模拟对其抗震性能进行研究,并分析了该节点设计参数对其性能的影响。结果表明:采用该节点的自复位支撑钢框架滞回响应更为饱满,整体结构耗能能力提升了20.81%,节点对总水平剪力的实际限制作用达17.56%,有效减缓了节点区塑性发展。通过改变支撑连接节点的摩擦片摩擦系数和高强螺栓预紧力,能够实现起滑位移与起滑力可调。