杜绝插头板工艺导线残留的设计改善

简述插头板传统工艺导线设计工艺的弊端,提出了新的设计理念,避开传统观念的插头前端添加工艺导线,而是采用板内寻找网络连接点,建立新的制作流程,实现插头镀金的这一最新理念,从根源上解决了插头工艺导线设计的难题。

Modeling and Robustness of Knowledge Network in Supply Chain

The growth and evolution of the knowledge network in supply chain can be characterized by dynamic growth clustering and non-homogeneous degree distribution.The networks with the above characteristics are also known as scale-free networks.In this paper,the knowledge network model in supply chain is established,in which the preferential attachment mechanism based on the node strength is adopted to simulate the growth and evolution of the network.The nodes in the network have a certain preference in the choice of a knowledge partner.On the basis of the network model,the robustness of the three network models based on different preferential attachment strategies is investigated.The robustness is also referred to as tolerances when the nodes are subjected to random destruction and malicious damage.The simulation results of this study show that the improved network has higher connectivity and stability.

Evolution Process of Urban Spatial Pattern in Hubei Province Based on DMSP/OLS Nighttime Light Data

This paper intends to investigate the urban spatial patterns of Hubei Province and its evolution from three different perspectives: urban nodes, urban connections and urban clusters. The research adopts nighttime light imagery of cities in Hubei Province, the viewpoint of ′point-axis-area′ in the ′point-axis system′ theory, and employs light index model, gravity model and social network analysis. The findings are as follows: 1) In terms of urban nodes, the urbanization process of Hubei has been carried out mainly on the basis of external expansion rather than internal increasing. The polarization trend of urban connection network is strengthening. 2) As for urban connections, the estimation of urban connections using light index model is capable of containing various actual flow, and the connections are getting increasingly closer. 3) In regard to urban groups, seven urban groups of varying sizes have formed. On that basis, three stable and relatively independent urban groups as the centers, namely Wuchang, Yichang and Xiangyang emerge as well. But the structures of ′Wuhan Metropolitan Area′, ′Yichang-Jingzhou-Jingmen City Group′ and ′Xiangyang-Shiyen-Suizhou City Group′, which are defined by local development strategy in Hubei Province, are different from the above three urban groups.

Available capacity and robust wireless mesh connectivity of TDD-based networks

This paper addresses the available capacity and robust connectivity of time division duplex based wireless mesh networks （TDD-based WMNs）. A stochastic model is presented for TDD-based WMNs. Considering the parameters that affect the network performance like ratio of control slots number to data slots number, collision probability, node density and average hopcounts, the availa- ble capacity for each node is inferred. Meanwhile, the order of transmission range for robust connec- tivity of large scale WMNs is derived. With the stochastic model and inferred available capacity per node, the performance of TDD-based WMNs using IEEE 802.16 standard is analyzed under various conditions. Simulation results indicate that the available capacity of IEEE 802.16-based TDD-based WMNs and the theoretical result have the same increasing and decreasing trend as the node density increases. Simulation results also illustrate the optimal value of the ratio of control slots number to data slots number that maximizes the available capacity.

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.

Epidemic Spreading Model Based on Social Active Degree in Social Networks

In this paper,an improved Susceptible-Infected-Susceptible(SIS) epidemic spreading model is proposed in order to provide a theoretical method to analyze and predict the spreading of diseases.This model is based on the following ideas:in social networks,the contact probability between nodes is decided by their social distances and their active degrees.The contact probability of two indirectly connected nodes is decided by the shortest path between them.Theoretical analysis and simulation experiment were conducted to evaluate the performance of this improved model.Because the proposed model is independent of the network structure,simulation experiments were done in several kinds of networks,namely the ER network,the random regular network,the WS small world network,and the BA scale-free network,in order to study the influences of certain factors have on the epidemic spreading,such as the social contact active degree,the network structure,the average degree,etc.This improved model provides an idea for studying the spreading rule of computer virus,attitudes,fashion styles and public opinions in social networks.

Modeling Dynamic Evolution of Online Friendship Network

In this paper,we study the dynamic evolution of friendship network in SNS(Social Networking Site).Our analysis suggests that an individual joining a community depends not only on the number of friends he or she has within the community,but also on the friendship network generated by those friends.In addition,we propose a model which is based on two processes:first,connecting nearest neighbors;second,strength driven attachment mechanism.The model reflects two facts:first,in the social network it is a universal phenomenon that two nodes are connected when they have at least one common neighbor;second,new nodes connect more likely to nodes which have larger weights and interactions,a phenomenon called strength driven attachment(also called weight driven attachment).From the simulation results,we find that degree distribution P(k),strength distribution P(s),and degree-strength correlation are all consistent with empirical data.