Research on the Sequence Planning of Manufacturing Feature Based on the Node Importance of Complex Network

2021 ◽  
Author(s):  
Bin Cheng ◽  
Dingjie Guan ◽  
Bingxue Jing
Keyword(s):  
Complex Network ◽  
Sequence Planning ◽  
Node Importance ◽  
Feature Based ◽  
Manufacturing Feature

Feature-Based Machining Precedence Reasoning and Sequence Planning

1998 ◽  
Author(s):  
Yong Se Kim ◽  
Eric Wang ◽  
Choong Soo Lee ◽  
Hyung Min Rho
Keyword(s):  
Feature Recognition ◽  
Search Space ◽  
Machining Process ◽  
Planning System ◽  
Process Information ◽  
Computer Aided Process Planning ◽  
Sequence Planning ◽  
Precedence Relations ◽  
Feature Based ◽  
Form Features

Abstract This paper presents a feature-based method to support machining sequence planning. Precedence relations among machining operations are systematically generated based on geometric information, tolerance specifications, and machining expertise. The feature recognition method using Alternating Sum of Volumes With Partitioning (ASVP) Decomposition is applied to obtain a Form Feature Decomposition (FFD) of a part model. Form features are classified into a taxonomy of atomic machining features, to which machining process information has been associated. Geometry-based precedence relations between features are systematically generated using the face dependency information obtained by ASVP Decomposition and the features’ associated machining process information. Multiple sets of precedence relations are generated as alternative precedence trees, based on the feature types and machining process considerations. These precedence trees are further enhanced with precedence relations from tolerance specifications and machining expertise. Machining sequence planning is performed for each of these precedence trees, applying a matrix-based method to reduce the search space while minimizing the number of tool changes. The precedence trees may then be evaluated based on machining cost and other criteria. The precedence reasoning module and operation sequence planning module are currently being implemented within a comprehensive Computer-Aided Process Planning system.

Analyses of the response of a complex weighted network to nodes removal strategies considering links weight: The case of the Beijing urban road system

2018 ◽  
Vol 32 (05) ◽  
pp. 1850067 ◽  
Author(s):  
Michele Bellingeri ◽  
Zhe-Ming Lu ◽  
Davide Cassi ◽  
Francesco Scotognella
Keyword(s):  
Complex Network ◽  
Real World ◽  
Road Traffic ◽  
Network Efficiency ◽  
Weighted Network ◽  
Node Importance ◽  
Connected Cluster ◽  
Binary Network ◽  
Binary Networks ◽  
Weighted Rank

Complex network response to node loss is a central question in different fields of science ranging from physics, sociology, biology to ecology. Previous studies considered binary networks where the weight of the links is not accounted for. However, in real-world networks the weights of connections can be widely different. Here, we analyzed the response of real-world road traffic complex network of Beijing, the most prosperous city in China. We produced nodes removal attack simulations using classic binary node features and we introduced weighted ranks for node importance. We measured the network functioning during nodes removal with three different parameters: the size of the largest connected cluster (LCC), the binary network efficiency (Bin EFF) and the weighted network efficiency (Weg EFF). We find that removing nodes according to weighted rank, i.e. considering the weight of the links as a number of taxi flows along the roads, produced in general the highest damage in the system. Our results show that: (i) in order to model Beijing road complex networks response to nodes (intersections) failure, it is necessary to consider the weight of the links; (ii) to discover the best attack strategy, it is important to use nodes rank accounting links weight.

Node Importance Evaluation of Anti-Missile Networks

2013 ◽  
Vol 765-767 ◽  
pp. 1098-1102
Author(s):  
Yu Xia ◽  
Fei Peng
Keyword(s):  
Complex Networks ◽  
Complex Network ◽  
Evaluation Method ◽  
Simulation Experiments ◽  
Node Importance ◽  
Correlation Degree ◽  
Evaluation Algorithm

in order to improve the efficiency and validity of node importance evaluation, a new evaluation method for node importance in complex networks was proposed based on node approach degree and node correlation degree. The basic idea of the method is that the larger the approach degree of a node is, the closer to center of a complex network the node is and the more important it is; the bigger the correlation degree of a node is, the more important the node is. An evaluation algorithm corresponding to the method was designed for the warship fleet cooperation anti-missile network. Finally, the validity of the proposed method was verified by simulation experiments.

Manufacturing Feature Based Dynamic Cost Estimation for Design

2004 ◽  
Author(s):  
Harshal Patwardhan ◽  
Karthik Ramani
Keyword(s):  
Cost Estimation ◽  
Estimation Methods ◽  
Design Stage ◽  
Design Parameters ◽  
User Requirements ◽  
Geometric Information ◽  
Early Stages ◽  
Feature Based ◽  
The Cost ◽  
Manufacturing Feature

Due to the ever-increasing competition in today’s global markets, the cost of the product is rapidly emerging as one of the most crucial factors in deciding the success of the product. Decisions made during the design stage affect as much as 70–80% of the final product cost. Hence, a manufacturing cost estimation tool that can be used by the designer concurrently during the design phase will be of maximum benefit. A literature study of the available cost estimation tools suggests that a majority of these tools are meant for use in the later stages of the product development lifecycle. In the early stages of a product lifecycle, the only information that is available to the designer is related to geometry and material. Hence, the cost estimation methods that have been developed with the intent of being used in the early stages of design make use of the geometric information available at that stage of the design. Most of the earlier models that use parametric cost estimation and features technology consider the design features in their implementation. However, such models fail to consider “manufacturing based features” such as cores and undercuts. These manufacturing based features are very important in deciding the manufacturability and the cost of the part. The Engineering Cost Advisory System (ECAS) is a knowledge-based system that presents cost advice to the designer at the design stage after considering various design parameters and user requirements. Some of these design parameters can be extracted via standard Application Programming Interfaces (APIs). Moreover, ECAS uses innovative techniques of geometric reasoning and the hybrid B-rep-voxel model approach to extract manufacturing feature-based geometric information directly from the CAD input. By considering the manufacturing based features along with the design parameters, the ECAS architecture is applicable to a much wider variety of manufacturing processes. The complexity of the part, which is derived from the geometric parameters (manufacturing based and design based) and other non-geometric user requirements (e.g. quantity, material), is used to estimate the manufacturing effort involved in process specific activities. The final cost is then estimated based on this manufacturing effort and considering the hourly rates of labor and other contextual resources as well as material rates.

scholarly journals Identifying Influential SLD Authoritative Name Servers on the Internet

2021 ◽  
Vol 9 ◽  
Author(s):  
Haiyan Xu ◽  
Zhaoxin Zhang ◽  
Bing Han ◽  
Jianen Yan
Keyword(s):  
Network Analysis ◽  
Partial Order ◽  
Complex Network ◽  
Evaluation Method ◽  
The Internet ◽  
Domain Name ◽  
Domain Names ◽  
Node Importance ◽  
Wide Range ◽  
Proper Operation

DNS plays an important role on the Internet. The addressing of most applications depends on the proper operation of DNS. The root servers and the top-level domain servers are relied upon by many domains on the Internet, and their security affects the whole Internet. As a result, more attention has been paid to the security of servers at these two levels. However, the security of second-level domains and their servers also needs to be brought to the forefront. This paper focuses on showing the complex resolving dependencies and identifying influential name servers for second-level domains. We start by detecting domain name resolution paths and building up a name dependency graph. Then we construct domain name resolution networks of different numbers and sizes, which are connected by a certain number of domain name resolution graphs. On this basis, the network is analyzed from the perspective of complex network analysis, and a multi-indicators node importance evaluation method based on partial order is proposed to identify the influential name servers of the network. Once these name servers are not properly configured and fail or are compromised by DDoS attacks, it will cause resolution failure for a wide range of domain names.

Sign in / Sign up

Export Citation Format

Share Document