检索结果-内蒙古大学图书馆

Dominant Technology Identification Model Based on Patent Information Toward Sustainable Energy Development

IEEE ACCESS 2019年 7卷 141374-141385页

作者： Wang, Hongying Sun, Bing Wang, Peng Harbin Engn Univ Sch Econ & Management Harbin 150001 Heilongjiang Peoples R China Nanjing Univ Aeronaut & Astronaut Coll Elect & Informat Engn Nanjing 210016 Jiangsu Peoples R China

Sustainable energy offers advantages of continuous regeneration, sustainable utilization, and inexhaustibility and plays an important role in the development of the world. In recent years, research on sustainable energy has become an important focus;however, leading sustainable energy technology deserves more attention. Identifying the dominant technology is significant for the decision-making and strategic layout of enterprises. In contrast to traditional technology identification methods, this study proposes a visual analysis model based on the patent-citation relationship. The visual analysis presented in this paper is divided into two parts: In the first part, the patent mutual citation data is input into the visualization software Gephi to identify the leading technology at the visual processing stage. Then, the pagerank algorithm is used to cross contrast the technical value and build the leading technology recognition model. The second part verifies the accuracy of the visual model and evaluates the technical value of each patent using the following five indexes: number of patent cited, patent number of the same family, scope of patent coverage, claim number of each patent, and number of patent litigation. Data of three sustainable energy technologies from the Worldwide Patent Statistical Database (PATSTAT) from 1900 to 2017 were used: solar power generation technology, hydroelectric power generation technology and wind power generation technology. The visual model correctly identified the leading technology. The results also explained the choice of the pagerank algorithm and the five indicators are most scientific and reasonable for the identification of dominant technology.

关键词： Patents Wind power generation Visualization Data visualization Databases Hydroelectric power generation Wind energy Gephi leading technology identification pagerank algorithm sustainable energy

来源：评论

学校读者我要写书评

暂无评论

Heat fl ow random walks in biomolecular systems using symbolic transfer entropy and graph theory

引用

JOURNAL OF MOLECULAR GRAPHICS & MODELLING 2021年 104卷 107838-107838页

作者： Kamberaj, Hiqmet Int Balkan Univ Dept Comp Engn Makedonsko Kosovska Brigada BB Skopje North Macedonia

This study combines the information-and graph-theoretic measures to investigate the cluster modulation of the amino acid residues and nucleotides at complex biomolecular interfaces. The symbolic transfer entropy is used as an information-theoretic measure. I also used graph theory to obtain information and heat flow weighted digraph models used to study the topology of information and heat flow paths at complex biomolecular interfaces. I introduce the graph-theoretic measures, such as the influence score and betweenness centrality, to identify the most influential amino acid and nucleotide sequences as sources of the information and absorb centers of the structure's heat flow. pagerank-like random walks algorithm is used to analyze the network of amino acid and nucleotide sequences at the protein-RNA interface combined with weighted digraph models. The cluster analysis using graph theoretic measures revealed the modular molecular structure and the mechanism of the binding interface. In this study, the first benchmark system is an intuitive directed information flow network used to test the algorithms, and the second benchmark is a protein-RNA complex system. The approach was able to identify the most influential amino acid residues and nucleotides. Furthermore, the statistical cluster analysis using graph-theoretic measures revealed the modular molecular structure and the binding mechanism at the interface. (C) 2021 Elsevier Inc. All rights reserved.

关键词： Information flow Heat flow Transfer entropy Graph theory pagerank algorithm

来源：评论

学校读者我要写书评

暂无评论

Community privacy estimation method based on key node method in space social Internet of Things

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2019年第10期15卷

作者： Chen, Guobin Huang, Tangsen Chongqing Technol & Business Univ Rongzhi Coll Chongqing Key Lab Spatial Informat Data Min & Big Chongqing Peoples R China Hunan Univ Sci & Engn Sch Elect & Informat Engn Yongzhou 425199 Peoples R China

Based on the research of social network and the Internet of Things, a new research topic in the field of Internet of Things, Social Internet of Things is gradually formed. The SIoT applies the research results of SIoT from different aspects of the Internet of Things, and solves the specific problems in the research of Internet of Things, which brings new opportunities for the development of the Internet of Things. With the development of the Internet of Things technology, in the spatial social Internet of Things structure, user information includes sensitive attributes and non-sensitive attribute information. This information can be inferred from public user information to infer the information of the private user and even speculate on sensitive attributes. This article proposes an information speculation method based on the core users of spatial social networks, and estimates the non-core user information through the core user public information. First, the user's spatial social network is divided into communities, and the core nodes of the community in the spatial social network are calculated by pagerank algorithm and the convergence of the algorithm is proved. Then, through the public information of the core nodes divided by the community in the space social network, the private information of relevant users to these core nodes can be speculated. Finally, by experimental analyzing the community structures of SIoT (Social Internet of Things) like Twitter, Sina Weibo, ER random networks, and NW small-world network, and making 5%, 10%, 15%, 20% information anonymous respectively in these four kinds of networks, we can analyze their clustering coefficient, Q-modularity and properties. Finally, the key node information of the four spatial social structures is speculated to analyze the effectiveness of the proposed method. Compared with the non-core speculation method, this method has advantages in speculative information integrity and time.

关键词： Internet of Things Social Internet of Things sensitive attributes speculation community partitioning pagerank algorithm

来源：评论

学校读者我要写书评

暂无评论

Evaluation Method of Product Form Design Elements Based on Complex Network Theory

World Scientific Research Journal

引用

World Scientific Research Journal 2021年第9期7卷 257-270页

作者： Shifeng Liu Shutao Zhang Shijie Wang Fan Wang Hongqian Wang

There are logic structure and value law in product form design. In order to explore the content and the complex mechanism of communication in the product form design, this paper studies the interaction between design elements and the importance of nodes in the integration process of product form design elements from the perspective of complex networks, so as to assist designers to design scientifically and efficiently. First, based on the complex network theory, the collaborative network model of product form design elements is constructed with product form design elements as nodes. Second, on the basis of the model, the evaluation indexes of node importance of product form design elements are constructed, and the triangular intuitionistic fuzzy numbers evaluation method is introduced to evaluate the importance of network nodes. Then the pagerank algorithm is used to modify the evaluation results. Finally, the front face of Audi is taken as an example to illustrate the whole research process.

关键词： Complex network Product form design elements Triangular intuitionistic fuzzy evaluation pagerank algorithm

来源：评论

学校读者我要写书评

暂无评论

GBSR: Graph-based suspiciousness refinement for improving fault localization

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2024年 218卷

作者： Li, Zheng Li, Mingyu Wu, Shumei Xu, Shunqing Chen, Xiang Liu, Yong Beijing Univ Chem Technol Coll Informat Sci & Technol Beijing Peoples R China Nantong Univ Sch Informat Sci & Technol Nantong Peoples R China

Fault Localization (FL) is an important and time-consuming phase of software debugging. The essence of FL lies in the process of calculating the suspiciousness of different program entities (e.g., statements) and generating a ranking list to guide developers in their code inspection. Nonetheless, a prevalent challenge within existing FL methodologies is the propensity for program entities with analogous execution information to receive a similar suspiciousness. This phenomenon can lead to confusion among developers, thereby reducing the effectiveness of debugging significantly. To alleviate this issue, we introduce fine-grained contextual information (such as partial code structural, coverage, and features from mutation analysis) to enrich the characteristics of program entities. Graphical structures are proposed to organize such information, where the passed and failed tests are constructed separately with the consideration of their differential impacts. In order to support the analysis of multidimensional features and the representation of large-scale programs, the pagerank algorithm is adopted to compute each program entity's weight. Rather than altering the fundamental FL process, we leverage these computed weights to refine the suspiciousness produced by various FL techniques, thereby providing developers with a more precise and actionable ranking of potential fault locations. The proposed strategy Graph-Based Suspiciousness Refinement (GBSR) is evaluated on 243 real-world faulty programs from the Defects4J. The results demonstrate that GBSR can improve the accuracy of various FL techniques. Specifically, for the refinement with traditional SBFL and MBFL techniques, the number of faults localized by the first position of the ranking list ( Top-1) is increased by 189% and 68%, respectively. Furthermore, GBSR can also boost the state-of-the-art learning-based FL technique Grace by achieving a 2.8% performance improvement in Top-1.

关键词： Fault localization Suspiciousness refinement Graph-based representation Mutation analysis pagerank algorithm

来源：评论

学校读者我要写书评

暂无评论

A Faster Non-Linear Iteration Solver using Graph Computing and its Application in Power Flow Calculation

引用

Energy Procedia 2017年 142卷 2534-2540页

作者： Kewen Liu Guangyi Liu Kai Xie Zhiwei Wang Global Energy Interconnection Research Institute 102209 Beijing China Global Energy Interconnection Research Institute North Amercia 95134 San Jose CA United States

To solve large scale fast matrix calculation problems, a Non-Linear Iteration Solver (NLIS) based on a BSP model using a graph database & computing technology is proposed in this paper. A node and edge level parallel iterative algorithm is implemented by using a graph computing algorithm combined with a message passing mechanism. IEEE testing cases and actual operation data of a provincial power system in China are used to verify the method, then expand the MP 10790 to over 100k and 1 million nodes systems for the calculation stress test on a conventional server.

关键词： Graph theory graph database graph computing power system analysis graph data modeling pagerank algorithm Bulk Synchronous Parallel Computing Model

来源：评论

学校读者我要写书评

暂无评论

Strategies in scheduling marine protected area establishment in a network system

引用

ECOLOGICAL APPLICATIONS 2019年第1期29卷 1-10页

作者： Kininmonth, Stuart Weeks, Rebecca Abesamis, Rene A. Bernardo, Lawrence Patrick C. Beger, Maria Treml, Eric A. Williamson, David Pressey, Robert L. Stockholm Univ Stockholm Resilience Ctr Kraftriket Sweden Univ Oslo Ctr Ecol & Evolutionary Synth Oslo Norway Univ South Pacific Sch Marine Studies Suva Fiji James Cook Univ ARC Ctr Excellence Coral Reef Studies Townsville Qld Australia Silliman Univ Angelo King Ctr Res & Environm Mana Dumaguete Philippines Tokyo Inst Technol Nadaoka Lab Dept Civil Engn Tokyo Japan Univ Queensland Brisbane Qld Australia Univ Leeds Sch Biol Fac Biol Sci Leeds W Yorkshire England Univ Melbourne Melbourne Vic Australia Deakin Univ Sch Life & Environm Sci Geelong Vic Australia

Instantaneous implementation of systematic conservation plans at regional scales is rare. More typically, planned actions are applied incrementally over periods of years or decades. During protracted implementation, the character of the connected ecological system will change as a function of external anthropogenic pressures, local metapopulation processes, and environmental fluctuations. For heavily exploited systems, habitat quality will deteriorate as the plan is implemented, potentially influencing the schedule of protected area implementation necessary to achieve conservation objectives. Understanding the best strategy to adopt for applying management within a connected environment is desirable, especially given limited conservation resources. Here, we model the sequential application of no-take marine protected areas (MPAs) in the central Philippines within a metapopulation framework, using a range of network-based decision rules. The model was based on selecting 33 sites for protection from 101 possible sites over a 35-yr period. The graph-theoretic network criteria to select sites for protection included pagerank, maximum degree, closeness centrality, betweenness centrality, minimum degree, random, and historical events. We also included a dynamic strategy called colonization-extinction rate that was updated every year based on the changing capacity of each site to produce and absorb larvae. Each rule was evaluated in the context of achieving the maximum metapopulation mean lifetime at the conclusion of the implementation phase. MPAs were designated through the alteration of the extinction risk parameter. The highest ranked criteria were pagerank while the actual implementation from historical records ranked lowest. Our results indicate that protecting the sites ranked highest with regard to larval supply is likely to yield the highest benefit for fish abundance and fish metapopulation persistence. Model results highlighted the benefits of including network

关键词： conservation planning larval networks marine protected areas metapopulation pagerank algorithm Philippines scheduled implementation

来源：评论

学校读者我要写书评

暂无评论

A recommender model based on strong and weak social Ties: A Long-tail distribution perspective

引用

EXPERT SYSTEMS WITH APPLICATIONS 2021年 184卷 115483-115483页

作者： He, Wei-jun Ai, Dan-xiang Wu, ChienHsing Guangdong Univ Technol Sch Management 161 Yinglong Rd Guangzhou 510520 Guangdong Peoples R China Natl Univ Kaohsiung Dept Informat Management 700 Kaohsiung Univ Rd Kaohsiung 81148 Taiwan

A collaborative filtering recommender model for E-commerce users (CF-S&WLT) is proposed that incorporates an improved pagerank algorithm, strong and weak social ties and long-tail distribution items. The main design feature of the CF-S&WLT model is the introduction of incentive coefficients for long-tail items based on triadic closure regulation. It was compared to three alternative models in terms of accuracy (precision and F-measure), diversity, and novelty of returned Top-N items. Results reveal that CF-S&WLT improved diversity and novelty by 20.1% and 3.8% respectively, but reduced precision by 3.7% based on a first dataset (DS1), and enhanced diversity (14.2%) and novelty (18.3%) while reducing precision cost by 4.6% using dataset DS2. Overall, the proposed CF-S&WLT model performs better than other models with respect to diversity and novelty while maintaining acceptable levels of accuracy.

关键词： Recommender systems Social ties pagerank algorithm Long-tail distributions

来源：评论

学校读者我要写书评

暂无评论

The Technical Research on the Assessment of Network Security Situation Based on D-S Evidence Theory

引用

APPLIED MATHEMATICS AND NONLINEAR SCIENCES 2022年第1期8卷 1177-1192页

作者： Chen, Jian Yang, Mingyuan Hussain, Rifat WuchanZhongda Digital Technol Co Ltd Hangzhou 310020 Peoples R China China Merchants Bank Co Ltd Credit Card Ctr Shanghai 200061 Peoples R China Appl Sci Univ Coll Adm Sci Eker Bahrain

With the increasing importance of network security, more attention is paid to the research on network security situation awareness, while network security situation assessment is the core of situation awareness. The existing situation assessment technology has many problems, such as unitary methodology, large-scale subjective factors and so on, affecting the accuracy of situation assessment. Combined with the traditional network security technology, this paper sets up a three-layer evaluation index system, and puts forward an overall network security situation evaluation model based on hidden Markov model, pagerank algorithm and D-S evidence theory, through which, the overall situation is evaluated after using different fusion algorithms in different fusion stages. The simulation result shows that the above assessment method is more accurate and efficient than the method using single model.

关键词： overall situation assessment hidden Markov model pagerank algorithm D-S evidence theory

来源：评论

学校读者我要写书评

暂无评论

Refining the accessibility evaluation of urban green spaces with multiple sources of mobility data: A case study in Shenzhen, China

引用

URBAN FORESTRY & URBAN GREENING 2022年第0期70卷 127550-127550页

作者： Zhang, Lu Chen, Pengfei Hui, Fengming Sun Yat Sen Univ Sch Geospatial Engn & Sci Guangzhou 510275 Guangdong Peoples R China Southern Marine Sci & Engn Guangdong Lab Zhuhai Zhuhai 519082 Guangdong Peoples R China Univ Corp Polar Res Beijing 100875 Peoples R China

Urban green space (UGS) is an important component of urban resources which contributes to human physical and mental health. Studies on the accessibility of UGS under the two-step floating catchment (2SFCA) framework have recently received much attention. However, the effects of people's actual mobility patterns have not been fully considered in current studies. Proposed in this study is an improved accessibility model called AM-Ga2SFCA, which refines the traditional Gaussian 2SFCA method with the actual mobility information extrac-ted from mobile phone big data and online map. A new attractiveness index of UGS is implemented by combining the popularity evaluated by the pagerank algorithm and the actual utilisation based on buffer analysis. In addition, realistic travel time between each demand point and UGS is retrieved from the online map, which is further introduced into AM-Ga2SFCA as the travel cost. A case study is conducted in Shenzhen, China to validate the proposed model. Results show that the accessibility of UGS is strongly correlated with regional urbanization level, for example, higher accessibility generally occurred in the region with developed transportation and rich green resources. From the perspective of age groups and travel modes, we found that the environmental justice issue had already occurred in Shenzhen especially for the non-elderly: under the walk mode, nearly 80% of the non-elderly only shared 20% of UGS whilst approximately 80% of the elderly shared 30% of UGS. However, taxi or private vehicles can effectively alleviate the aforementioned phenomenon by reducing the Gini index to less than 0.5. The proposed model is expected to advance the understanding of UGS accessibility and facilitate effective planning to reduce environmental justice.

关键词： pagerank algorithm Multiple travel modes Environmental justice Actual-Movement Ga2SFCA Elderly

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：