检索结果-南通市图书馆

MATCHING RULE——AN IMPORTANT PRINCIPLE IN THE MOLECULAR SCIENCE

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1985年第10期30卷 1332-1337页

作者：陈梅芳 Institute of Precious Metals Kunming

Ⅰ. INTRODUCTION In nature there exists a matching rule, that is, some things can match each other. If A has matched with B, then A cannot match with a third thing C. This behaviour can be beautifully represented with the graph theory. From Fig. 1 it can be seen that in case a if 1 matches 2, 2 cannot match with 3, 3 can be matched only by 4. In

关键词： match behaviour things posed audio MATCHING RULE shortest ystem Feynman brought

Distribution of Deviation Distance to Alternative Fuel Stations

在线全文

学校读者我要写书评

暂无评论

American Journal of Operations Research 2013年第3期3卷 363-368页

作者： Masashi Miyagawa Department of Regional Social Management University of Yamanashi Kofu Japan

This paper derives the distribution of the deviation distance to visit an alternative fuel station. Distance is measured as the Euclidean distance on a continuous plane. The distribution explicitly considers the vehicle range and whether the round trip between origin and destination can be made. Three cases are examined: fuel is available at both origin and destination, fuel is available at either origin or destination, and fuel is available at neither origin nor destination. The analytical expressions for the distribution demonstrate how the vehicle range, the shortest distance, and the refueling availability at origin and destination affect the deviation distance. The distribution will thus be useful to estimate the number of vehicles refueled at a station.

关键词： Location Flow Demand Vehicle Range shortest Distance Round Trip

A DYNAMIC MODEL OF MULTIPLE PATH TRAFFIC ASSIGNMENT

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Southeast University(English Edition) 1991年第1期7卷 64-69页

作者：王炜 Research Institute of Transportation

A “Random shortest Path”traffic assignment model and its algorithm arepresented by simulating the trip-makers’route-choice characters,and the dynamic meth-od is introduced in the assignment *** is a ideal multiple path assignment modelwhich can be carried out by the dynamic method and static method,can better reflect boththe shortest path factor and the random factor in the route-choice,and is of reasonableassignment ***,both dynamic and static softwares particularly suited to thetraffic assignment of large and medium-sized transportation networks arc developed.

关键词： shortest path traffic distribution traffic and transport networks/dynamic route-choice traffic assignment

LDM (Layered Deployment Model): A Novel Framework to Deploy Sensors in an Irregular Terrain

在线全文

学校读者我要写书评

暂无评论

Wireless Sensor Network 2011年第6期3卷 189-197页

作者： Chandan Kr. Bhattacharyya Swapan Bhattacharya 不详

Deployment of sensors in any irregular terrain with 100% coverage and connectivity is a challenging issue in the field of Wireless Sensor Networks. Traditional deployments often assume homogeneous environments, which ignore the effect of terrain profile as well as the in-network obstacles situated randomly like buildings, trees, roads and so on. Proper deployment of sensors in such irregular region and its corresponding routing is one of the most fundamental challenges of Wireless Sensor Networks. In this work, we have considered that the terrain is irregular in shape and there may be obstacles within the terrain in any random position with any random shape, which is the reality in real world. With this novel framework, we have shown that an opti-mum deployment can be achieved in such irregular terrain without compromising coverage as well as con-nectivity between the sensor nodes for effective routing.

关键词： Wireless Sensor Networks Sensor Deployment shortest Path Routing Irregular Terrain

Dubins Waypoint Navigation of Small-Class Unmanned Aerial Vehicles

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Open Journal of Optimization 2019年第2期8卷 59-72页

作者： Larry M. Silverberg Dahan Xu Mechanical and Aerospace Engineering North Carolina State University Raleigh USA

This paper considers a variation on the Dubins path problem and proposes an improved waypoint navigation (WN) algorithm called Dubins waypoint navigation (DWN). Based on the Dubins path problem, an algorithm is developed that is updated in real-time with a horizon of three waypoints. The purpose of DWN is to overcome a problem that we find in existing WN for small-class fixed-wing unmanned aerial vehicles (UAV) of not accurately reaching waypoints. This problem results at times in high overshoot and, in the presence of wind disturbances, it can cause a vehicle to miss the waypoint and swirl around it. To prevent this, the DWN creates “new waypoints” that are in the background, called turning points. Examples illustrate the improvement of the performance of WN achieved using the DWN algorithm in terms of the targeting of waypoints while reducing fuel and time.

关键词： Dubins Path Waypoint Navigation Unmanned Aerial Vehicles Autonomy shortest Path Fuel Optimization

Research on LFS Algorithm in Software Network

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Software Engineering and Applications 2010年第2期3卷 185-189页

作者： Wei Wang Hai Zhao Hui Li Jun Zhang Peng Li Zheng Liu Naiming Guo Jian Zhu Bo Li Shuang Yu Hong Liu Kunzhan Yang 不详

Betweenness centrality helps researcher to master the changes of the system from the overall perspective in software network. The existing betweenness centrality algorithm has high time complexity but low accuracy. Therefore, Layer First Searching (LFS) algorithm is proposed that is low in time complexity and high in accuracy. LFS algorithm searches the nodes with the shortest to the designated node, then travels all paths and calculates the nodes on the paths, at last get the times of each node being traveled which is betweenness centrality. The time complexity of LFS algorithm is O(V2).

关键词： LFS Software Network the shortest Path Betweenness Centrality

ON THE CONSTRUCTION OF GEODETIC BLOCK WITH g≤(2d+1)

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1988年第3期33卷 227-230页

作者：毛经中 Central China Normal University Wuchang

K. R. Parthasarathy and N. Srinivasan have proposed the problem of how to construct a geodetic block with given diameter and given girth, that is, to construct a 2-connected graph G with given diameter d and given gir... 详细信息

关键词： shortest connected vertex blocks verified valued length symmetry uniqueness stated

Facilitating full and effective implementation of the Paris Agreement for carbon neutrality vision

在线全文

学校读者我要写书评

暂无评论

碳中和(英文) 2022年第1期1卷 620-623页

作者： Huaqing XU National Center for Climate Change Strategy and International Cooperation Beijing 100035China

The Paris Agreement,a landmark in the multilateral process of global climate governance,not only demonstrates the greatest inclusiveness and feasibility based on science and principles,but also points out the general direction of the global green and low-carbon *** Agreement has set a global goal to hold the increase in the global average temperature to well below 2 degrees Celsius above pre-industrial levels,and to pursue efforts to limit the temperature increase to 1.5 degrees Celsius by the end of the *** achieve this long-term objective,developed countries should take the lead in reducing emissions as soon as possible,which is fundamental to the achievement of net-zero global emissions at an early ***’s goal of striving to peak carbon dioxide emissions before 2030 and achieve carbon neutrality before 2060 shows its great ambition,strength,and responsibility as a major country,indicating that China is committed to realizing carbon neutrality from carbon peaking in the shortest time in global history,and will make greater efforts and contributions to achieve the goals set out in the Paris Agreement.

关键词： transition. carbon shortest

ON E. F. SCHMEICHEL-S. L. HAKIMI CONJECTURE ABOUT PLANAR GRAPHICAL DEGREE SEQUENCES

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Science Bulletin 1987年第3期32卷 145-146页

作者：毛经中 .

In this paper we only consider finite nonoriented graph without loops and double edges. All terminologies and notations not explained are the same as in [1].

关键词： explained 一曰汤加人 realization length shortest vertex triangle planar wrong