標(biāo)題: Titlebook: Network Algorithms, Data Mining, and Applications; NET, Moscow, Russia, Ilya Bychkov,Valery A. Kalyagin,Oleg Prokopyev Conference proceedin [打印本頁] 作者: Hoover 時(shí)間: 2025-3-21 16:27
書目名稱Network Algorithms, Data Mining, and Applications影響因子(影響力)
書目名稱Network Algorithms, Data Mining, and Applications影響因子(影響力)學(xué)科排名
書目名稱Network Algorithms, Data Mining, and Applications網(wǎng)絡(luò)公開度
書目名稱Network Algorithms, Data Mining, and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Network Algorithms, Data Mining, and Applications被引頻次
書目名稱Network Algorithms, Data Mining, and Applications被引頻次學(xué)科排名
書目名稱Network Algorithms, Data Mining, and Applications年度引用
書目名稱Network Algorithms, Data Mining, and Applications年度引用學(xué)科排名
書目名稱Network Algorithms, Data Mining, and Applications讀者反饋
書目名稱Network Algorithms, Data Mining, and Applications讀者反饋學(xué)科排名
作者: endocardium 時(shí)間: 2025-3-21 22:50 作者: harmony 時(shí)間: 2025-3-22 02:35
Hamoud S. Bin-Obaid,Theodore B. Trafalisined network traffic. However, it is difficult to capture and estimate the volume of network traffic due to its time-varying nature. In this paper, we study the network traffic estimation scheme to estimate the fine-grained network traffic. Firstly, the network traffic is constructed as a time serie作者: NATTY 時(shí)間: 2025-3-22 04:59
Dmitry I. Ignatov,Polina Ivanova,Albina Zamaletdinovanting fast simulation frameworks to estimate runtimes always results in tremendous slow-downs. In this paper, a quantization is done regarding the minimal overhead that can be expected when adding architectural models to a fast JIT enhanced emulation. Previous work is only focused on new approaches 作者: contrast-medium 時(shí)間: 2025-3-22 12:16 作者: 無聊點(diǎn)好 時(shí)間: 2025-3-22 16:50
Oxana Mikhailova,Galina Gradoselskaya,Alexander Kharlamovior and improvements in teamwork performance; however, it is necessary to continue researching their impact on the organization and patient safety (Levine et al (eds), The comprehensive textbook of healthcare simulation. Springer, New York, 2013; Salas et al, J Hum Factors Ergonom Soc 48(2): 392–412作者: jet-lag 時(shí)間: 2025-3-22 19:26
Tamara Shcheglova,Galina Gradoselskaya,Ilia Karpovngs lag behind in the literature, even more when comes the necessity to implement them in mass. So, the problem is the following: in a context of simulation-based training, how might we conduct debriefings which enable effective reflection for learners and how to do this on a large scale? This chapt作者: Keshan-disease 時(shí)間: 2025-3-23 00:59
Dmitry Zaytsev,Gregory Khvatsky,Nikita Talovsky,Valentina Kuskovas between how learning is conceptualized and how simulation-based training programs are implemented. For research in education, learning theories circumscribe the phenomena that are examined. They have a substantial impact on methods, data analysis and interpretations of the results. We believe that作者: 皮薩 時(shí)間: 2025-3-23 04:04 作者: 外科醫(yī)生 時(shí)間: 2025-3-23 08:50 作者: 作繭自縛 時(shí)間: 2025-3-23 13:04
Graph Clustering Via Intra-Cluster Density Maximizationted to each other but sparsely connected to the rest of the graph. There are many different approaches to clustering in the literature. However, in this article, we formulate the clustering problem as a combinatorial optimization problem. Our main contribution is a novel problem formulation that max作者: minion 時(shí)間: 2025-3-23 15:26 作者: 親愛 時(shí)間: 2025-3-23 21:06 作者: Valves 時(shí)間: 2025-3-24 00:38 作者: Substitution 時(shí)間: 2025-3-24 03:53 作者: GUEER 時(shí)間: 2025-3-24 08:59 作者: Arb853 時(shí)間: 2025-3-24 13:22
Network Structure and Scheme Analysis of the Russian Language Segment of Wikipediaom Wikipedia is actively used in different approaches to create universal semantic networks. In the current research we created a network of the Russian language segment of Wikipedia and conducted an analysis of its structure. In our network Wikipedia articles and categories are regarded as nodes an作者: 排出 時(shí)間: 2025-3-24 16:03 作者: disparage 時(shí)間: 2025-3-24 21:59 作者: 固定某物 時(shí)間: 2025-3-25 00:05 作者: LITHE 時(shí)間: 2025-3-25 04:59 作者: 失敗主義者 時(shí)間: 2025-3-25 07:40
Social Mechanisms of the Subject Area Formation. The Case of “Digital Economy”t and semantic areas. In this article, a wide range of texts about the digital economy was analyzed, making it possible to show the thematic structure of this subject area. Central and peripheral concepts were identified to characterize theoretical core concepts and related topics clarifying the app作者: intrigue 時(shí)間: 2025-3-25 13:43
Methodology for Measuring Polarization of Political Discourse: Case of Comparing Oppositional and PaFacebook, VKontakte, and LiveJournal were analyzed, and 35 000 most frequent speech markers were processed, of which 1800 markers were selected for analysis. The alternative method to TF–IDF metric for specific text markers identification is proposed. The features of oppositional discourse in compar作者: 激怒 時(shí)間: 2025-3-25 16:31
Network Analysis Methodology of Policy Actors Identification and Power Evaluation (The Case of the Utext parsing and mining, and producing networks with analysis of the text processing results. We used the example of the Russian Unified State Exam, as the real case of policy formulation and implementation, to test the proposed methodology. The methodology was shown to have great potential for veri作者: 噴油井 時(shí)間: 2025-3-25 22:46
Network Structure and Scheme Analysis of the Russian Language Segment of Wikipedia the trend. We found that these artifacts were induced by using navigation templates in Wikipedia articles. For eliminating these artifacts, we include a new type of nodes and links, representing Wikipedia templates and their references, into the Wikipedia network scheme. It enables separating artic作者: EXALT 時(shí)間: 2025-3-26 01:07
The Existence and Uniqueness Theorem for Initial-Boundary Value Problem of the Same Class of Integroass of Integro-differential equations will attract great attention for further research. The solution of the nonlinear problem has a curious nontrivial property, and the existence and uniqueness theorem of the original problem will help to justify the application of various applications to her.作者: faddish 時(shí)間: 2025-3-26 06:31
2194-1009 lysis of large-scale networks. Machine learning techniques in network settings including community detection, clustering, andbiclustering algorithms are presented with applications to social network analysis..978-3-030-37159-3978-3-030-37157-9Series ISSN 2194-1009 Series E-ISSN 2194-1017 作者: Anonymous 時(shí)間: 2025-3-26 09:29
Pierre Miasnikof,Leonidas Pitsoulis,Anthony J. Bonner,Yuri Lawryshyn,Panos M. Pardalos作者: 溫室 時(shí)間: 2025-3-26 15:28
Anna Averchenkova,Alina Akhmetzyanova,Konstantin Sudarikov,Stanislav Petrov,Ilya Makarov,Mikhail Pen作者: 暫時(shí)休息 時(shí)間: 2025-3-26 20:49 作者: 羞辱 時(shí)間: 2025-3-27 01:00
ble system’s request logs. In particular, we greatly improve the prediction model based on machine learning. Our use case is a commercial alarm system in productive use, developed and maintained by the GSelectronic company in Germany. We experimentally demonstrate that our improvements significantly作者: FILTH 時(shí)間: 2025-3-27 05:05
date its behaviour, and check that the control system guarantees the supply of drinking water to a city, using the data obtained from that city as input. Through the simulator it is possible to analyse and represent different configurations of the control system over an infrastructure, thus being ab作者: Ligneous 時(shí)間: 2025-3-27 05:42
Hamoud S. Bin-Obaid,Theodore B. Trafaliserformance of our proposed scheme, we construct a simulation platform and compare our scheme with that of the other methods in an SDN simulation platform. The simulation results indicate that our approach is effective and our method can reflect the network traffic characteristics.作者: Hyaluronic-Acid 時(shí)間: 2025-3-27 12:18
Dmitry I. Ignatov,Polina Ivanova,Albina Zamaletdinovan the test platforms, an academic and a commercial processor simulator were evaluated. The resulting average relative runtimes of the minimal introduced overhead are determined to be between 2.24 and 8.09 meaning that an emulation takes twice to eight times as long with instrumentation enabled.作者: 迅速成長 時(shí)間: 2025-3-27 14:10
Galina Gradoselskaya,Ilia Karpov,Tamara Shcheglovaservatory” mode of engagement appears, the aim of which is to preserve the conditions for perpetuating the action and capacities of each officer cadet..This research leads to the formulation of principles for the design of trainings whose aim is to prepare professionals to deal with the unknown, the作者: Communal 時(shí)間: 2025-3-27 20:23 作者: Morose 時(shí)間: 2025-3-28 01:15 作者: deadlock 時(shí)間: 2025-3-28 06:09 作者: Fracture 時(shí)間: 2025-3-28 09:53 作者: Halfhearted 時(shí)間: 2025-3-28 14:01
Collaborator Recommender Systemay to find such collaborators. In this paper, we propose a recommender system for the scientists from the Higher School of Economics university to help them find co-authors for their prospective studies.作者: Sinus-Rhythm 時(shí)間: 2025-3-28 17:56 作者: 自制 時(shí)間: 2025-3-28 20:44
Conference proceedings 2020018. The conference brought together scientists, engineers, and researchers from academia, industry, and government.?.Contributions in this book focus on the development of network algorithms for data mining and its applications. Researchers and students in mathematics, economics, statistics, comput作者: Acetabulum 時(shí)間: 2025-3-29 02:23 作者: inflame 時(shí)間: 2025-3-29 06:39
Computational Complexity of SRIC and LRIC Indices consideration. Our main focus is on the performance of SRIC and LRIC indices. We propose several modes on how to decrease the computational complexity of these indices. The runtime comparison of the sequential and parallel computation of the proposed models is also given.作者: deciduous 時(shí)間: 2025-3-29 07:43 作者: fringe 時(shí)間: 2025-3-29 15:15
Social Mechanisms of the Subject Area Formation. The Case of “Digital Economy”twork modeling in the Text Analyst) and the analysis of semantic networks. The results, approaches, and methods of this study could be used during the investigation of the other large thematic fields related to new ideological currents, being developed as an element of social design and management.作者: 我悲傷 時(shí)間: 2025-3-29 18:50
Methodology for Measuring Polarization of Political Discourse: Case of Comparing Oppositional and Pas to understand social models and attitudes embedded in the discourse and the subsequent behavior of representatives of these groups. On the other hand, it is possible to extend a set of keywords for text search of a certain political orientation, based on the obtained results.作者: 縮減了 時(shí)間: 2025-3-29 21:29 作者: Uncultured 時(shí)間: 2025-3-30 01:06 作者: 坦白 時(shí)間: 2025-3-30 06:49
A Survey on Variable Neighborhood Search Methods for Supply Network Inventoryothers. In this chapter, we present recent successful applications of variable neighborhood search (VNS) for the efficient solution of such problems, review the state-of-the-art solution methods, and also discuss some future research directions.作者: AIL 時(shí)間: 2025-3-30 10:23 作者: Exterior 時(shí)間: 2025-3-30 13:35 作者: 含沙射影 時(shí)間: 2025-3-30 20:06 作者: 謊言 時(shí)間: 2025-3-30 21:20
Mapping of Politically Active Groups on Social Networks of Russian Regions (On the Example of Karachy the author’s method of grain clustering. Each cluster was analyzed by social network analysis methods. The most influential persons and social movements are shown, and features of their network activity were investigated.作者: 鴕鳥 時(shí)間: 2025-3-31 00:56
Mixed Integer Programming for Searching Maximum Quasi-Bicliquesy. An alternative model inspired by biclustering is formulated and tested; this model simultaneously maximises both the size of the quasi-biclique and its density, using the least-square criterion similar to the one exploited by triclustering ..作者: Embolic-Stroke 時(shí)間: 2025-3-31 09:04
978-3-030-37159-3Springer Nature Switzerland AG 2020作者: 昏暗 時(shí)間: 2025-3-31 12:18 作者: 租約 時(shí)間: 2025-3-31 15:25 作者: 寡頭政治 時(shí)間: 2025-3-31 19:05
Springer Proceedings in Mathematics & Statisticshttp://image.papertrans.cn/n/image/662762.jpg作者: ETCH 時(shí)間: 2025-4-1 00:17
https://doi.org/10.1007/978-3-030-37157-9Network algorithms; Clusters; Information Theory; graph dissimilarities; Metaheuristics; Large-Scale Grap作者: ARBOR 時(shí)間: 2025-4-1 03:08
