检索结果-南通市图书馆

A tree structure Storage Model of BOM

在线全文

学校读者我要写书评

暂无评论

Systems Science and Systems Engineering 2002年第1期11卷 55-60页

作者： JIGuo-li FreddieTsui 等 Dept. of Auto. Xiamen Univ.Xiamen361005China Tops Datacom Limited HongkongChina

Through the analysis of BOM and in comparison with other storage forms, a tree-structure storage model has been proposed. It use two tables to record parent components and child components respectively. Each table has a location point combined by three fields. And other link fields in the child component table present the relationship between levels of a product tree. Compared with Gozintograph mode, the BOM design on tree structure has many advantages.

关键词： BOM tree structure assembly component

Effects of Different Water and Fertilizer Combinations on tree structure,Leaf Parameters and Photosynthesis of Apple Saplings

在线全文

学校读者我要写书评

暂无评论

Agricultural Biotechnology 2014年第6期3卷 4-7,13页

作者： Ru CHEN Jinzheng WANG Xiaomin XUE Peixian NIE Guiping WANG Shandong Institute of Pomology

[ Objective] This study aimed to investigate the effects of different water and fertilizer combinations on apple saplings. [ Method] ＇ Tianhong 2＇ Fuji /SH40/Malus robusta Rehd. was used as the experimental material to analyze the effects of different irrigation modes and combinations of basal fertilizer and dressing fertilizer on tree structure, leaf parameters and photosynthesis of apple saplings. [ Result] The results showed that different water and fertilizer combinations ex- hibited varying effects on tree structure, leaf parameters and photosynthesis of apple saplings. To be specific, applying 432 000 kg/hm2 basal fertilizer, 480 kg/hm2 urea and 915 kg/hmz organic fertilizer ＋ 0 ＋ 915 kg/hm2 organic fertilizer as dressing fertilizer, and 1% urea as leaf fertilizer was conducive to promoting growth of branches and leaves, increasing leaf thickness, individual leaf area and SPAD, and improving photosynthesis of apple saplings under half root irrigation and whole root irrigation conditions. In addition, the effects were more significant under whole root irrigation conditions. [ Conclusion] Selecting the appropriate water and fertilizer combination is conducive to the growth of apple saplings.

关键词： Water and fertilizer Apple saplings tree structure Leaf parameters Photosynthesis

Analysis of Short-Shoot Fuji Apple tree structure and Correlative Factors

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Asian Agricultural Research 2017年第6期9卷 86-88页

作者： Jie HAO Xiangmin SUO Xueying LI Liang WEI Xinmin YAN Xian’ge WANG Jianzhong FENG Shijiazhuang Pomology Institute Hebei Academy of Agriculture and Forestry Sciences Hebei Provincial Department of Land and Resources

In order to clarify the correlation between short-shoot Fuji apple tree structure and different factors under different trimming and pruning modes,we investigate the trunk taperingness of free-spindle short-shoot Fuji and slender-spindle short-shoot Fuji,respectively,as well as the total thickness,average thickness,total length and average length of small main branches in the standard demonstration apple garden in Xingtang County of Hebei Province. By SPSS analysis,we study the correlation between trunk taperingness of trees with different shapes and the growth indices of their small main branches. The results show that the trunk taperingness of free-spindle short-shoot Fuji apple is negatively correlated with the total thickness,average thickness,total length and average length of small main branches,but the correlation is not significant; the trunk taperingness of slender-spindle short-shoot Fuji apple is negatively correlated with the total thickness but positively correlated with other factors,and the correlation with average length reaches a significant level. The results of this study can provide a scientific basis for guiding the high-density dwarf rootstock short-shoot Fuji apple tree trimming technology.

关键词： Short-shoot Fuji tree structure Analysis of correlative factors

The Infinity tree: Representing Infinities of Real Numbers with Countably Infinite tree structures

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Advances in Pure Mathematics 2023年第4期13卷 198-205页

作者： Philip C. Jackson TalaMind LLC Troy MI USA

This paper discusses how the infinite set of real numbers between 0 and 1 could be represented by a countably infinite tree structure which would avoid Cantor’s diagonalization argument that the set of real numbers is not countably infinite. Likewise, countably infinite tree structures could represent all real numbers, and all points in any number of dimensions in multi-dimensional spaces. The objective of this paper is not to overturn previous research based on Cantor’s argument, but to suggest that this situation may be treated as a definitional or axiomatic choice. This paper proposes a “non-Cantorian” branch of cardinality theory, representing all these infinities with countably infinite tree structures. This approach would be consistent with the Continuum Hypothesis.

关键词： Infinity Countable Diagonalization Real Numbers tree structure Infinity tree Continuum Hypothesis

tree-based differential evolution algorithm for QoS multicast routing

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2011年第4期18卷 76-81页

作者： KONG Sun CHEN Zeng-qiang Department of Automation Nankai University Tianjin 300071 China

Differential evolution （DE） algorithm has attracted more and more attention due to its fast optimization performance and good stability. When DE algorithm is applied into multi-constrained multicast routing optimization problem, a common solution to such problem is to merge the paths into a tree after finding paths from the source node to each destination node. This method maybe obtains the better result, but it can consume a lot of computational time. To solve the problem, a tree-based DE algorithm is introduced in this paper. The central operations of the algorithm are realized with tree structure. This method saves the time of finding paths and integrating them to construct a multicast tree. The experiments show that the proposed algorithm can achieve higher success rate than several common algorithms with much smaller running time for different networks.

关键词： quality of service (QoS) multicast routing DE tree structure

Document Clustering Based on Constructing Density tree

在线全文

学校读者我要写书评

暂无评论

Transactions of Tianjin University 2008年第1期14卷 21-26页

作者：戴维迪王文俊侯越先王英张璐 School of Computer Science and Technology Tianjin University School of Computer Software Tianjin University

This paper focuses on document clustering by clustering algorithm based on a DEnsitytree (CABDET) to improve the accuracy of clustering. The CABDET method constructs a density-based treestructure for every potential cluster by dynamically adjusting the radius of neighborhood according to local density. It avoids density-based spatial clustering of applications with noise (DBSCAN) ′s global density parameters and reduces input parameters to one. The results of experiment on real document show that CABDET achieves better accuracy of clustering than DBSCAN method. The CABDET algorithm obtains the max F-measure value 0.347 with the root node's radius of neighborhood 0.80, which is higher than 0.332 of DBSCAN with the radius of neighborhood 0.65 and the minimum number of objects 6.

关键词： document handling clustering tree structure vector space model

Hierarchically Switched Networks

在线全文

学校读者我要写书评

暂无评论

ZTE Communications 2010年第2期8卷 1-6页

作者： Oian Hualin E Yuepeng Computer Network Information Center of Chinese Academy of Sciences Beijing 100190 P. R. China

The Internet of today is facing serious challenges including lack of routing system scalability, unpredictable network behavior, uncertainty of data packet paths, poor control and manageability, unachieved Quality of Service （QoS）, vulnerability of network facilities to Distributed Denial-of-Service （DD^S） attacks, core router complexity, costliness, and high power consumption. All of these defects have their root causes in the routing system. This paper first proposes a new network architecture which combines network typology with addressing. It then highlights that reliability of the tree structure is guaranteed by the concepts of logical node and logical link. Furthermore, shortcut link technology makes tree topology more flexible, and IP routing can be replaced with IP switching. As a result, all flaws in the current Internet architecture can be overcome.

关键词： routing system network architecture Internet architecture Quality of Service network behavior tree structure reliability data packet technology high power complexity link flexible concepts control paper root node lack DDOS

Investigation of a Network Failure Problem with a Significant Path, from the Perspective of Crisis Management

在线全文

学校读者我要写书评

暂无评论

Journal of Mathematics and System Science 2014年第7期4卷 479-485页

作者： Jun-ichi Takeshita Hiroaki Mohri Research Institute of Science for Safety and Sustainability (RISS) National Institute of Advanced Industrial Sciene and Technology (AIST) 16-1 Onogawa Tsukuba Ibaraki 305-8569 JAPAN Faculty of Commerece Waseda University 1-6-1 Nishi-Waseda Shunjuku-ku Tokyo 169-8050 JAPAN

The objective of this study is to investigate a network failure problem with a significant path, emerging from the context of crisis management, such as in the case of natural disasters. For a given tree with m failed edges, we assume that we have sufficient resources to recover k edges of the m edges. Each node has a positive weight. In this situation, we consider which k edges should be fixed in order to maximize the sum of the weights of the nodes reachable from the significant path. In this paper, we formulate such a problem as a combinatorial problem. Further, we show that a part of our problem may be solved by translating it into the terms of the so-called tree knapsack problem.

关键词： Network failure graph tree structure combinatorial optimization risk management

A Multi-Objective Optimal Evolutionary Algorithm Based on tree-Ranking

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Wuhan University Journal of Natural Sciences 2003年第S1期8卷 207-211页

作者： Shi Chuan, Kang Li-shan, Li Yan, Yan Zhen-yuState Key Laboratory of Software Engineering, Wuhan University, Wuhan 430072, Hubei,China

Multi-objective optimal evolutionary algorithms (MOEAs) are a kind of new effective algorithms to solve Multi-objective optimal problem (MOP). Because ranking, a method which is used by most MOEAs to solve MOP, has some shortcoming s, in this paper, we proposed a new method using tree structure to express the relationship of solutions. Experiments prove that the method can reach the Pare-to front, retain the diversity of the population, and use less time.

关键词： multi-objective optimal problem multi-objective optimal evolutionary algorithm Pareto dominance tree structure dynamic space-compressed mutative operator