276 results on '"Large scale network"'
Search Results
2. Performance of IEEE 802.15.4 beaconless-enabled protocol for low data rate ad hoc wireless sensor networks
- Author
-
Iqbal, Muhamad Syamsu, Al-Raweshidy, H., and Abbod, M.
- Subjects
621.382 ,Network simulator NS-2 ,Hidden nodes problem ,Large scale network ,Power efficiency ,Network bottleneck problem - Abstract
This thesis focuses on the enhancement of the IEEE 802.15.4 beaconless-enabled MAC protocol as a solution to overcome the network bottleneck, less flexible nodes, and more energy waste at the centralised wireless sensor networks (WSN). These problems are triggered by mechanism of choosing a centralised WSN coordinator to start communication and manage the resources. Unlike IEEE 802.11 standard, the IEEE 802.15.4 MAC protocol does not include method to overcome hidden nodes problem. Moreover, understanding the behaviour and performance of a large-scale WSN is a very challenging task. A comparative study is conducted to investigate the performance of the proposed ad hoc WSN both over the low data rate IEEE 802.15.4 and the high data rate IEEE 802.11 standards. Simulation results show that, in small-scale networks, ad hoc WSN over 802.15.4 outperforms the WSN where it improves 4-key performance indicators such as throughput, PDR, packet loss, and energy consumption by up to 22.4%, 17.1%, 34.1%, and 43.2%, respectively. Nevertheless, WSN achieves less end-to-end delay; in this study, it introduces by up to 2.0 ms less delay than that of ad hoc WSN. Furthermore, the ad hoc wireless sensor networks work well both over IEEE 802.15.4 and IEEE 802.11 protocols in small-scale networks with low traffic loads. The performance of IEEE 802.15.4 declines for the higher payload size since this standard is dedicated to low rate wireless personal access networks. A deep performance investigation of the IEEE 802.15.4 beaconless-enabled wireless sensor network (BeWSN) in hidden nodes environment has been conducted and followed by an investigation of network overhead on ad hoc networks over IEEE 802.11 protocol. The result of investigation evinces that the performance of beaconless-enabled ad hoc wireless sensor networks deteriorates as indicated by the degradation of throughput and packet reception by up to 72.66 kbps and 35.2%, respectively. In relation to end-to-end delay, however, there is no significant performance deviation caused by hidden nodes appearance. On the other hand, preventing hidden node effect by implementing RTS/CTS mechanism introduces significant overhead on the network that applies low packet size. Therefore, this handshaking method is not suitable for low rate communications protocol such as IEEE 802.15.4 standard. An evaluation study of a 101-node large-scale beaconless-enabled wireless sensor networks over IEEE 802.15.4 protocol has been carried out after the nodes deployment model was arranged. From the experiment, when the number of connection densely increases, then the probability of packet delivery decreases by up to 40.5% for the low payload size and not less than of 44.5% for the upper payload size. Meanwhile, for all sizes of payload applied to the large-scale ad hoc wireless sensor network, it points out an increasing throughput whilst the network handles more connections among sensor nodes. In term of dropped packet, it confirms that a fewer data drops at smaller number of connecting nodes on the network where the protocol outperforms not less than of 34% for low payload size of 30 Bytes. The similar trend obviously happens on packet loss. In addition, the simulation results show that the smaller payload size performs better than the bigger one in term of network latency, where the payload size of 30 Bytes contributes by up to 41.7% less delay compared with the contribution of the payload size of 90 Bytes.
- Published
- 2016
3. Development of a Connected Vehicle Dynamic Freeway Variable Speed Controller
- Author
-
Hossam M. Abdelghaffar, Maha Elouni, Youssef Bichiou, and Hesham A. Rakha
- Subjects
Connected vehicles ,large scale network ,sliding control ,speed harmonization ,variable speed control ,Electrical engineering. Electronics. Nuclear engineering ,TK1-9971 - Abstract
Traffic congestion is a major challenge in urban areas, and is associated with longer travel times, increased vehicle emissions, and numerous vehicle crashes. Creating an efficient mobility system is difficult, given that each driver is usually trying to optimize their individual trip within the network without accounting for other road users. However, new technologies in modern vehicles, especially connected vehicle technologies, make it increasingly possible to find solutions to network efficiency problems. Connected technologies allow data sharing between vehicles, allowing for greater system optimization. This work takes advantage of connectivity to develop a global framework to increase transportation network efficiency and address the aforementioned challenges. To enhance mobility, this paper presents a dynamic freeway speed controller based on the sliding mode theory, which uses the fundamental equations governing traffic dynamics in combination with variable speed limit control in order to provide advisory speeds for connected vehicles. Simulation results on a downtown Los Angeles network show significant reductions in trip times and delays both on freeways (where the control was activated) and network-wide (i.e., freeways and other roadways). Specifically, the results for the entire network showed a 12.17% reduction in travel time and a 20.67% reduction in total delay. These results had the secondary effect of reducing fuel consumption and therefore CO2 emissions by 2.6% and 3.3%, respectively. The results for the freeway network alone showed a 20.48% reduction in travel time and a 21.63% reduction in queued vehicles. These results reveal the significant potential benefits of using the proposed speed harmonization controller on real large-scale networks.
- Published
- 2020
- Full Text
- View/download PDF
4. How to Couple Two Networks for a Smart Grid
- Author
-
Kaixuan Wang, Yan Qiao, and Ningzhe Xing
- Subjects
Community detection ,large scale network ,random coupling scheme ,smart grid ,simulation network ,Electrical engineering. Electronics. Nuclear engineering ,TK1-9971 - Abstract
Smart grids, which are composed of reciprocal power grids and communication networks, have revolutionized the traditional electrical section. Interdependent smart grids have attracted many researchers to the cascade scheme. However, the strategy of coupling two networks has been neglected. The construction of a real coupled network has been infeasible due to the economic cost and network scale for researchers. Therefore, coupling two networks to simulate a real network is fundamental for a smart grid. In this paper, we propose a model for the coupled network, analyze the characteristic of power network, and focus on the coupling strategy. Next, we leverage a classic community detection algorithm to form a local network. A new local positive degree coupling algorithm was proposed based on community detection to create a coupled network. A numerical experiment demonstrates that our coupling algorithm outperforms the previous random coupling scheme. In addition, the local positive degree coupling algorithm can be extended to other cyber-physical systems with slight changes for future studies.
- Published
- 2018
- Full Text
- View/download PDF
5. Path-Based Dynamic User Equilibrium Model with Applications to Strategic Transportation Planning.
- Author
-
Javani, Babak and Babazadeh, Abbas
- Subjects
TRANSPORTATION planning ,TRAFFIC assignment ,INFORMATION storage & retrieval systems ,EQUILIBRIUM - Abstract
This study proposes an analytical capacity constrained dynamic traffic assignment (DTA) model along with an efficient path-based algorithm. The model can be applied to analyzing dynamic traffic demand management (TDM) strategies, but its specific feature is allowing for an evaluation of advanced traveler information systems (ATIS) within the strategic transportation planning framework. It is an extension of a former DTA model, where each link is given an infinite capacity and is assumed to be completely traversed inside any time interval it is reach by a path. Thereby, the length of time intervals should be very longer than the link travel times, and the link capacity constraints are overlooked. The paper rests on three key ideas to overcome these restrictions: (1) adding path-link fraction variables to the base model, allowing path flows to spread out over time intervals on long links; (2) uniformly dividing each link into smaller parts (segments), so that each part is more likely to be traversed inside a time interval; (3) imposing a dynamic penalty function on each link, thereby the capacity constraint can be included. The proposed DTA algorithm decomposes the augmented model in terms of origin-destination (OD) pairs and departure time intervals, and utilizes a dynamic column generation technique for generating active paths between the OD pairs. The optimal solution to a one-link network demonstrates that the model is able to approximate the dynamic flow propagation over a link with sensible accuracy. Besides, investigation of the results for a small test network reveals that the algorithm performs very well in computing temporal link flows and queuing delays. Finally, numerical experiments on a real life network indicate that the algorithm converges sufficiently fast and provides path information for each time interval. The network is further used to show the algorithm is capable of assessing a dynamic TDM strategy as well as an ATIS system. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
6. SDN-Based Application-Aware Segment Routing for Large-Scale Network
- Author
-
Abdelhamid Mellouk, Sami Souihi, Van Tong, and Hai Anh Tran
- Subjects
Control and Systems Engineering ,Computer Networks and Communications ,Computer science ,business.industry ,Large scale network ,Electrical and Electronic Engineering ,Routing (electronic design automation) ,business ,Computer Science Applications ,Information Systems ,Computer network - Published
- 2022
7. Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
- Author
-
Zhang, Peng, Jiang, Tao, Li, Angsheng, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Xu, Dachuan, editor, Du, Donglei, editor, and Du, Dingzhu, editor
- Published
- 2015
- Full Text
- View/download PDF
8. Individual Influence Maximization via Link Recommendation
- Author
-
Ma, Guowei, Liu, Qi, Chen, Enhong, Xiang, Biao, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Dong, Xin Luna, editor, Yu, Xiaohui, editor, Li, Jian, editor, and Sun, Yizhou, editor
- Published
- 2015
- Full Text
- View/download PDF
9. Some Introductory Notes on Random Graphs
- Author
-
Fagnani, Fabio, Fosson, Sophie M., Ravazzi, Chiara, Mascolo, Elvira, Series editor, Kumar, P.R., Wainwright, Martin J., Zecchina, Riccardo, Fagnani, Fabio, editor, Fosson, Sophie M., editor, and Ravazzi, Chiara, editor
- Published
- 2015
- Full Text
- View/download PDF
10. Concluding Remarks and Future Directions
- Author
-
Nabi-Abdolyousefi, Marzieh and Nabi-Abdolyousefi, Marzieh
- Published
- 2014
- Full Text
- View/download PDF
11. On the Reliability of Network Measurement Techniques Used for Malware Traffic Analysis (Transcript of Discussion)
- Author
-
Nagaraja, Shishir, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Christianson, Bruce, editor, Malcolm, James, editor, Matyáš, Vashek, editor, Švenda, Petr, editor, Stajano, Frank, editor, and Anderson, Jonathan, editor
- Published
- 2014
- Full Text
- View/download PDF
12. Accurate End-to-End Delay Bound Analysis for Large-Scale Network Via Experimental Comparison
- Author
-
Xiao Hong, Hongwen Yang, and Yuehong Gao
- Subjects
Computer Networks and Communications ,Computer science ,Large scale network ,Real-time computing ,End-to-end delay ,Electrical and Electronic Engineering ,Software - Published
- 2022
13. A Comparison of Methods for Community Detection in Large Scale Networks
- Author
-
da Fonseca Vieira, Vinícius, Evsukoff, Alexandre Gonçalves, Menezes, Ronaldo, editor, Evsukoff, Alexandre, editor, and González, Marta C., editor
- Published
- 2013
- Full Text
- View/download PDF
14. An IDS Visualization System for Anomalous Warning Events
- Author
-
Kimura, Satoshi, Inaba, Hiroyuki, and Lee, Roger, editor
- Published
- 2013
- Full Text
- View/download PDF
15. High Throughput Computing Application to Transport Modeling
- Author
-
Mesbah, Mahmoud, Sarvi, Majid, Tan, Jefferson, Karimirad, Fateme, Gaol, Ford Lumban, editor, and Nguyen, Quang Vinh, editor
- Published
- 2012
- Full Text
- View/download PDF
16. Spectra: Robust Estimation of Distribution Functions in Networks
- Author
-
Borges, Miguel, Jesus, Paulo, Baquero, Carlos, Almeida, Paulo Sérgio, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Göschka, Karl Michael, editor, and Haridi, Seif, editor
- Published
- 2012
- Full Text
- View/download PDF
17. Synthesizing Brain-network-inspired Interconnections for Large-scale Network-on-chips
- Author
-
HuangJinglei, QiXu, GeMengke, NiXiaobing, KangYi, ChenSong, and WuFeng
- Subjects
FOS: Computer and information sciences ,Brain network ,Modularity (networks) ,Network on a chip ,Computer science ,Distributed computing ,Large scale network ,Hardware Architecture (cs.AR) ,Electrical and Electronic Engineering ,Complex network ,Computer Science - Hardware Architecture ,Computer Graphics and Computer-Aided Design ,Computer Science Applications - Abstract
Brain network is a large-scale complex network with scale-free, small-world, and modularity properties, which largely supports this high-efficiency massive system. In this paper, we propose to synthesize brain-network-inspired interconnections for large-scale network-on-chips. Firstly, we propose a method to generate brain-network-inspired topologies with limited scale-free and power-law small-world properties, which have a low total link length and extremely low average hop count approximately proportional to the logarithm of the network size. In addition, given the large-scale applications and the modular topology, we present an application mapping method, including task mapping and deterministic deadlock-free routing, to minimize the power consumption and hop count. Finally, a cycle-accurate simulator BookSim2 is used to validate the architecture performance with different synthetic traffic patterns and large-scale test cases, including real-world communication networks for the graph processing application. Experiments show that, compared with other topologies and methods, the NoC design generated by the proposed method presents significantly lower average hop count and lower average latency. Especially in graph processing applications with a power-law and tightly coupled inter-core communication, the brain-network-inspired NoC has up to 70% lower average hop count and 75% lower average latency than mesh-based NoCs., Comment: 19 pages, 15 figures, 8 tables, accepted by ACM TODAES
- Published
- 2021
18. Synthesis of passive interconnections in mass chains achieving a scale-free performance
- Author
-
Kaoru Yamamoto
- Subjects
0209 industrial biotechnology ,Scale (ratio) ,Computer science ,Mechanical Engineering ,Large scale network ,02 engineering and technology ,Topology ,Condensed Matter::Mesoscopic Systems and Quantum Hall Effect ,Physics::Classical Physics ,Mass chain ,Physics::Geophysics ,020303 mechanical engineering & transports ,020901 industrial engineering & automation ,0203 mechanical engineering ,Chain (algebraic topology) ,Control and Systems Engineering ,network synthesis ,Network synthesis filters ,large-scale network - Abstract
This article is concerned with the synthesis problem of passive mechanical admittances that connect masses in a chain. The mass chain is excited at one boundary point, and the admittances are designed to suppress the disturbance independent of the length of the chain. The scalar transfer functions from the disturbance to a given intermass displacement are studied. The disturbance rejection performance is optimised over a class of arbitrary positive real mechanical admittances. The resulting admittance is synthesised mechanically using springs, dampers, and inerters only.
- Published
- 2021
19. Affinity Propagation on Identifying Communities in Social and Biological Networks
- Author
-
Jia, Caiyan, Jiang, Yawen, Yu, Jian, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Goebel, Randy, editor, Siekmann, Jörg, editor, Wahlster, Wolfgang, editor, Bi, Yaxin, editor, and Williams, Mary-Anne, editor
- Published
- 2010
- Full Text
- View/download PDF
20. Finding Community Structure Based on Subgraph Similarity
- Author
-
Xiang, Biao, Chen, En-Hong, Zhou, Tao, Kacprzyk, Janusz, editor, Fortunato, Santo, editor, Mangioni, Giuseppe, editor, Menezes, Ronaldo, editor, and Nicosia, Vincenzo, editor
- Published
- 2009
- Full Text
- View/download PDF
21. DTR: Distributed Transaction Routing in a Large Scale Network
- Author
-
Sarr, Idrissa, Naacke, Hubert, Gançarski, Stéphane, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Palma, José M. Laginha M., editor, Amestoy, Patrick R., editor, Daydé, Michel, editor, Mattoso, Marta, editor, and Lopes, João Correia, editor
- Published
- 2008
- Full Text
- View/download PDF
22. Atypicalities in the developmental trajectory of cortico-striatal functional connectivity in autism spectrum disorder
- Author
-
Zenghui Ma, Xinzhou Tang, Jing-Ran Liu, Yanqing Guo, Jing Liu, Bin Lu, Liu Yang, Zhao-Zheng Ji, Yu-Lu Yang, Ting Mei, Chao-Gan Yan, Qingjiu Cao, Xue Li, Hui Wang, and Lingzi Xu
- Subjects
Brain Mapping ,Autism Spectrum Disorder ,Functional connectivity ,Large scale network ,Brain ,medicine.disease ,Magnetic Resonance Imaging ,Cognition ,Developmental trajectory ,Neuroimaging ,Autism spectrum disorder ,Neural Pathways ,mental disorders ,Developmental and Educational Psychology ,medicine ,Humans ,Autism ,Psychology ,Neuroscience - Abstract
The last decades of neuroimaging research has revealed atypical development of intrinsic functional connectivity within and between large-scale cortical networks in autism spectrum disorder, but much remains unknown about cortico-subcortical developmental connectivity atypicalities. This study examined cortico-striatal developmental intrinsic functional connectivity changes in autism spectrum disorder and explored how those changes may be correlated with autistic traits. We studied 49 individuals with autism spectrum disorder and 52 age-, sex-, and head motion–matched typically developing individuals (5–30 years old (14.0 ± 5.6)) using resting-state functional magnetic resonance imaging. Age-related differences in striatal intrinsic functional connectivity were compared between the two groups by adopting functional network–based parcellations of the striatum as seeds. Relative to typically developing individuals, autism spectrum disorder individuals showed atypical developmental changes in intrinsic functional connectivities between almost all striatal networks and sensorimotor network/default network, with connectivity increasing with age in the autism spectrum disorder group and decreasing or constant in typically developing individuals. Age-related degree centrality and voxel-mirrored homotopic connectivity atypicalities in sensorimotor network/default network and voxel-mirrored homotopic connectivity disruptions in striatal regions were also observed in autism spectrum disorder. Significant correlations were found between cortico-striatal intrinsic functional connectivities and Autism Diagnostic Observation Schedule communication/repetitive and restricted-behavior subscores in autism spectrum disorder. Our results indicated that developmental atypicalities of cortico-striatal intrinsic functional connectivities might contribute to the neuropathology of autism spectrum disorder. Lay abstract Autism spectrum disorder has long been conceptualized as a disorder of “atypical development of functional brain connectivity (which refers to correlations in activity levels of distant brain regions).” However, most of the research has focused on the connectivity between cortical regions, and much remains unknown about the developmental changes of functional connectivity between subcortical and cortical areas in autism spectrum disorder. We used the technique of resting-state functional magnetic resonance imaging to explore the developmental characteristics of intrinsic functional connectivity (functional brain connectivity when people are asked not to do anything) between subcortical and cortical regions in individuals with and without autism spectrum disorder aged 6–30 years. We focused on one important subcortical structure called striatum, which has roles in motor, cognitive, and affective processes. We found that cortico-striatal intrinsic functional connectivities showed opposite developmental trajectories in autism spectrum disorder and typically developing individuals, with connectivity increasing with age in autism spectrum disorder and decreasing or constant in typically developing individuals. We also found significant negative behavioral correlations between those atypical cortico-striatal intrinsic functional connectivities and autistic symptoms, such as social-communication deficits, and restricted/repetitive behaviors and interests. Taken together, this work highlights that the atypical development of cortico-subcortical functional connectivity might be largely involved in the neuropathological mechanisms of autism spectrum disorder.
- Published
- 2021
23. A Spark-based Method for Identifying Large-scale Network Burst Traffic
- Author
-
Jun Feng, Ben-Sheng Yun, Ya-Guan Qian, and Yu-Lu Sun
- Subjects
General Computer Science ,Computer science ,Large scale network ,Real-time computing ,Spark (mathematics) - Published
- 2021
24. Design and implementation of the data acquisition system of a large scale network based on four-in-one meters
- Author
-
Xie Bingshan, Wang Peng, Xiao Xiangning, and Su Xueyuan
- Subjects
Data acquisition ,Computer science ,Large scale network ,Real-time computing - Abstract
For households, water supply, power supply, pipeline gas and centralized heating are necessaries to maintain the normal life of a family. For Chinese urban families, water, electricity, gas, warm services are often provided by different government utility companies. Aimed at the shortage of the manual measurement of the above mentioned services‘ consumptions, a new mechanism using network metering devices is proposed in this paper. Based on the general network measurement mechanism and through analysis, this paper proposes using meter communication network as the public communication network of various metering devices, forming wireless mesh network by metering devices, constituting a virtual private network by the power company's network, and accessing to metering network based on SCEP protocol and certificates of devices. Under this new network measurement mechanism, a network routing optimization strategy, a data acquisition protocol based on IPv6 and a mesh network management system are designed, and preliminary experiments have been carried on. Experimental results show that the proposed mechanism can realize functions through the network, including the control of multi-measuring devices, topology discovery, data acquisition, fulfilling the multi-meter data acquisition system via network.
- Published
- 2021
25. A generic power flow formulation for flexible modeling and fast solving for large-scale unbalanced networks.
- Author
-
Bennani, Hakim, Chebak, Ahmed, and El Ouafi, Abderrazak
- Subjects
- *
ELECTRICAL load , *SYNCHRONOUS generators , *JACOBIAN matrices , *SPARSE matrices , *TEST systems , *FACTORIZATION - Abstract
• General method for power flow solutions of any electrical system. • This method requires only one symbolic factorization. • The numerical performance of the proposed method are compared with the same of popular methods. • Demonstrating the efficiency of proposed method with IEEE-8500 node test system. • Developing a new three-phase model for the synchronous generator by utilization of the GFMA formulation. This paper proposes a new three-phase power flow formulation for fast solving and systematic modeling based on generic formulation and modular approach. In this method, each component of the system is modeled independently as a subsystem while extra-equations are added to establish the connection between components. The augmented system equations are solved using Newton-like method and KLU sparse matrix solver. The mismatch equations are formulated with dynamic parameters to avoid the repetitive symbolic factorizations required after each change in nonzero pattern of the Jacobian matrix. Compared to conventional solution methods, the proposed solution is faster and offers greater modeling flexibility, which makes it more efficient for simulating complex and large-scale networks. The IEEE standard 34-bus and 8500-bus are used as test systems to evaluate the numerical performance, the convergence characteristics, and the accuracy of the results. The comparison with the traditional power flow methods shows significant reduction of resolution time without compromising on solution accuracy. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
26. A distributed community detection algorithm for large scale networks under stochastic block models.
- Author
-
Wu, Shihao, Li, Zhe, and Zhu, Xuening
- Subjects
- *
STOCHASTIC models , *SINGULAR value decomposition , *ALGORITHMS , *PYTHON programming language , *DISTRIBUTED algorithms , *COMPUTATIONAL complexity - Abstract
Community detection for large scale networks is of great importance in modern data analysis. In this work, we develop a distributed spectral clustering algorithm to handle this task. Specifically, we distribute a certain number of pilot network nodes on the master server and the others on worker servers. A spectral clustering algorithm is first conducted on the master to select pseudo centers. Next, the indexes of the pseudo centers are broadcasted to workers to complete the distributed community detection task using an SVD (singular value decomposition) type algorithm. The proposed distributed algorithm has three advantages. First, the communication cost is low, since only the indexes of pseudo centers are communicated. Second, no further iterative algorithm is needed on workers while a "one-shot" computation suffices. Third, both the computational complexity and the storage requirements are much lower compared to using the whole adjacency matrix. We develop a Python package DCD (The Python package is provided in https://github.com/Ikerlz/dcd.) to implement the distributed algorithm on a Spark system and establish theoretical properties with respect to the estimation accuracy and mis-clustering rates under the stochastic block model. Experiments on a variety of synthetic and empirical datasets are carried out to further illustrate the advantages of the methodology. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
27. HOIDS-Based Detection Method of Vicious Event in Large Networks
- Author
-
Lee, Dong Hwi, Kim, Jeom Goo, Kim, Kuinam J., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Zhou, Xiaobo, editor, Sokolsky, Oleg, editor, Yan, Lu, editor, Jung, Eun-Sun, editor, Shao, Zili, editor, Mu, Yi, editor, Lee, Dong Chun, editor, Kim, Dae Young, editor, Jeong, Young-Sik, editor, and Xu, Cheng-Zhong, editor
- Published
- 2006
- Full Text
- View/download PDF
28. Analyzing Peer-to-Peer Traffic’s Impact on Large Scale Networks
- Author
-
Yang, Mao, Dai, Yafei, Tian, Jing, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Alexandrov, Vassil N., editor, van Albada, Geert Dick, editor, Sloot, Peter M. A., editor, and Dongarra, Jack, editor
- Published
- 2006
- Full Text
- View/download PDF
29. Model and Estimation of Worm Propagation Under Network Partition
- Author
-
Wang, Ping, Fang, Binxing, Yun, Xiaochun, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Chen, Kefei, editor, Deng, Robert, editor, Lai, Xuejia, editor, and Zhou, Jianying, editor
- Published
- 2006
- Full Text
- View/download PDF
30. A Semi-reliable Multicast Protocol for Distributed Multimedia Applications in Large Scale Networks
- Author
-
Bortoleto, Christiane Montenegro, Lung, Lau Cheuk, Siqueira, Frank A., Bessani, Alysson Neves, da Silva Fraga, Joni, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Dough, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Dalmau Royo, Jordi, editor, and Hasegawa, Go, editor
- Published
- 2005
- Full Text
- View/download PDF
31. The Effects of Network Topology on Epidemic Algorithms
- Author
-
Acosta-Elías, Jesús, Pineda, Ulises, Luna-Rivera, Jose Martin, Stevens-Navarro, Enrique, Campos-Canton, Isaac, Navarro-Moldes, Leandro, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Laganá, Antonio, editor, Gavrilova, Marina L., editor, Kumar, Vipin, editor, Mun, Youngsong, editor, Tan, C. J. Kenneth, editor, and Gervasi, Osvaldo, editor
- Published
- 2004
- Full Text
- View/download PDF
32. A Location Transparent Multi-agent System with Terminal Mobility Support
- Author
-
Hosokawa, Akira, Kinoshita, Kazuhiko, Yamai, Nariyoshi, Murakami, Koso, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, and Kahng, Hyun-Kook, editor
- Published
- 2003
- Full Text
- View/download PDF
33. On-Line Simulation of Large Scale Networks
- Author
-
Pottmeier, Andreas, Chrobok, Roland, Wahle, Joachim, Schreckenberg, Michael, Chamoni, Peter, editor, Leisten, Rainer, editor, Martin, Alexander, editor, Minnemann, Joachim, editor, and Stadtler, Hartmut, editor
- Published
- 2002
- Full Text
- View/download PDF
34. Evaluation of Reinforcement Learning Signalling Strategies on the large-scale network of Nicosia
- Author
-
Haris Ballis and Loukas Dimitriou
- Subjects
050210 logistics & transportation ,Computer science ,Large scale network ,Demand patterns ,05 social sciences ,0211 other engineering and technologies ,Effective management ,02 engineering and technology ,General Medicine ,Urban road ,Traffic signal ,Signalling ,Risk analysis (engineering) ,021105 building & construction ,0502 economics and business ,Reinforcement learning ,Implementation - Abstract
Efficient utilization of urban road networks has been in the epicenter of researchers’ attention for many decades already. Nowadays, many cities rely on traffic-responsive strategies for the effective management of traffic flows. However, state of the art methodologies, based on Artificial Intelligence (AI), have started challenging the currently implemented solutions. Reinforcement Learning (RL) stands as one of the most promising AI-based methodologies aiming at the optimization of traffic signal controlling. Since the first appearance of relevant RL methodologies, numerous implementation strategies have been suggested. Nonetheless, these approaches are usually evaluated under ideal or simplistic conditions (e.g. toy networks, unrealistic demand patterns, etc.) thus lack the ability to assess the effectiveness of RL-based signaling optimization under realistic conditions. The currently presented study bridges this gap by evaluating a plethora of RL-based implementations under fully realistic urban demand conditions as manifested in the large-scale road network of Nicosia, Cyprus.
- Published
- 2021
35. Ensuring Cyber Resilience of Large-Scale Network Infrastructure Using the Ant Algorithm
- Author
-
K. V. Kudinov and E. Yu. Pavlenko
- Subjects
021110 strategic, defence & security studies ,Control and Systems Engineering ,Computer science ,Large scale network ,Signal Processing ,0211 other engineering and technologies ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,02 engineering and technology ,Resilience (network) ,Algorithm ,Software - Abstract
Application of the ant algorithm for ensuring the cyber resilience of a distributed system in conditions of various types of cyber attacks is considered. The principle of operation of the ant algorithm is described, a mathematical model of the network infrastructure is developed, and possible types of cyberattacks are determined within the framework of the model. The results of the experimental studies demonstrated the applicability of the ant algorithm for ensuring the cyber resilience of large-scale networks.
- Published
- 2020
36. A New Approach for Secure Multicast Routing in a Large Scale Network
- Author
-
Shim, Young-Chul, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Qing, Sihan, editor, Okamoto, Tatsuaki, editor, and Zhou, Jianying, editor
- Published
- 2001
- Full Text
- View/download PDF
37. Application of Connected and Automated Vehicles in a Large-Scale Network by Considering Vehicle-to-Vehicle and Vehicle-to-Infrastructure Technology
- Author
-
Hasibur Rahman and Mohamed Abdel-Aty
- Subjects
050210 logistics & transportation ,Computer science ,Mechanical Engineering ,Large scale network ,05 social sciences ,010501 environmental sciences ,Vehicle-to-vehicle ,Vehicle to infrastructure ,01 natural sciences ,Automotive engineering ,0502 economics and business ,Mobile communication systems ,0105 earth and related environmental sciences ,Civil and Structural Engineering ,Market penetration - Abstract
Application of connected and automated vehicles (CAVs) is expected to have a significant impact on traffic safety and mobility. Although several studies evaluated the effectiveness of CAVs in a small roadway segment, there is a lack of studies analyzing the impact of CAVs in a large-scale network by considering both freeways and arterials. Therefore, the objective of this study is to analyze the effectiveness of CAVs at the network level by utilizing both vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication technologies. Also, the study proposed a new signal control algorithm through V2I technology to elevate the performance of CAVs at intersections. A car-following model named cooperative adaptive cruise control was utilized to approximate the driving behavior of CAVs in the Aimsun Next microsimulation environment. For the testbed, the research team selected Orlando central business district area in Florida, U.S. To this end, the impacts of CAVs were evaluated based on traffic efficiency (e.g., travel time rate [TTR], speed, and average approach delay, etc.) and safety surrogates (e.g., standard deviation of speed, real-time crash-risk models for freeways and arterials, time exposed time-to-collision). The results showed that the application of CAVs reduced TTR significantly compared with the base condition even with the low market penetration level. Also, the proposed signal control algorithm reduced the approach delay for 94% of the total intersections present in the network. Moreover, safety evaluation results showed a significant improvement of traffic safety in the freeways and arterials under CAV conditions with different market penetration rates.
- Published
- 2020
38. Finding Dense Components in Large-Scale Network Using Randomized Binary Search Tree
- Author
-
Dang Hai Pham, Anh Phuc Trinh, and Thi Thuy Dung Phan
- Subjects
Computer science ,Binary search tree ,Large scale network ,Algorithm ,MathematicsofComputing_DISCRETEMATHEMATICS - Abstract
Given a simple undirected graph G=(V, E), the density of a subgraph on vertex set S is defined as a ratio between the number of edges |E(S)| and the number of vertices |S|, where E(S) is the set of edges induced by vertices in S. Finding the maximum density subgraph has become an intense study in recent years, especially in the social network era. Being based on a greedy algorithm that connects with a suitable graph data structure, we have reduced its time complexity by using a randomized binary search tree, also called treap. We make the complexity analysis in both time and memory requirements, including computational experiments in large scale real networks.
- Published
- 2020
39. Large-scale network motif analysis using compression
- Author
-
Peter Bloem, Steven de Rooij, Artificial intelligence, Network Institute, and Knowledge Representation and Reasoning
- Subjects
Random graph ,FOS: Computer and information sciences ,Computer Science - Machine Learning ,Motifs ,Computer Networks and Communications ,Computer science ,Null model ,Large scale network ,Minimum description length ,02 engineering and technology ,Computer Science Applications ,Machine Learning (cs.LG) ,ComputingMethodologies_PATTERNRECOGNITION ,020204 information systems ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,Network analysis ,Motif (music) ,Algorithm ,Information Systems - Abstract
We introduce a new method for finding network motifs. Subgraphs are motifs when their frequency in the data is high compared to the expected frequency under a null model. To compute this expectation, a full or approximate count of the occurrences of a motif is normally repeated on as many as 1000 random graphs sampled from the null model; a prohibitively expensive step. We use ideas from the minimum description length literature to define a new measure of motif relevance. With our method, samples from the null model are not required. Instead we compute the probability of the data under the null model and compare this to the probability under a specially designed alternative model. With this new relevance test, we can search for motifs by random sampling, rather than requiring an accurate count of all instances of a motif. This allows motif analysis to scale to networks with billions of links.
- Published
- 2020
40. Integrated simulation-based dynamic traffic and transit assignment model for large-scale network
- Author
-
Baher Abdulhai, Amer Shalaby, and Islam Kamel
- Subjects
050210 logistics & transportation ,Computer science ,Large scale network ,Distributed computing ,0502 economics and business ,05 social sciences ,0202 electrical engineering, electronic engineering, information engineering ,020201 artificial intelligence & image processing ,02 engineering and technology ,Simulation based ,Transit (satellite) ,General Environmental Science ,Civil and Structural Engineering - Abstract
Although the traffic and transit assignment processes are intertwined, the interactions between them are usually ignored in practice, especially for large-scale networks. In this paper, we build a simulation-based traffic and transit assignment model that preserves the interactions between the two assignment processes for the large-scale network of the Greater Toronto Area during the morning peak. This traffic assignment model is dynamic, user-equilibrium seeking, and includes surface transit routes. It utilizes the congested travel times, determined by the dynamic traffic assignment, rather than using predefined timetables. Unlike the static transit assignment models, the proposed transit model distinguishes between different intervals within the morning peak by using the accurate demand, transit schedule, and time-based road level-of-service. The traffic and transit assignment models are calibrated against actual field observations. The resulting dynamic model is suitable for testing different demand management strategies that impose dynamic changes on multiple modes simultaneously.
- Published
- 2020
41. Toward equity in large-scale network-level pavement maintenance and rehabilitation scheduling using water cycle and genetic algorithms
- Author
-
Amirhossein Fani, Amir Golroo, and Hamed Naseri
- Subjects
050210 logistics & transportation ,Rehabilitation ,Computer science ,Large scale network ,medicine.medical_treatment ,05 social sciences ,0211 other engineering and technologies ,Pavement management ,Pavement maintenance ,02 engineering and technology ,Scheduling (computing) ,Transport engineering ,Mechanics of Materials ,021105 building & construction ,0502 economics and business ,medicine ,Meta heuristic ,Water cycle ,Limited resources ,Civil and Structural Engineering - Abstract
Appropriate pavement maintenance is of great importance due to the increasing deterioration of pavements and limited resources. Nowadays, highway agencies face large-scale networks. The management ...
- Published
- 2020
42. Integration of Departure Time Choice Modeling and Dynamic Origin–Destination Demand Estimation in a Large-Scale Network
- Author
-
Hai L. Vu, Meead Saberi, and Sajjad Shafiei
- Subjects
050210 logistics & transportation ,Mathematical optimization ,Computer science ,Mechanical Engineering ,Large scale network ,0502 economics and business ,05 social sciences ,Demand estimation ,010501 environmental sciences ,Link (knot theory) ,01 natural sciences ,0105 earth and related environmental sciences ,Civil and Structural Engineering - Abstract
Time-dependent origin–destination (OD) demand estimation using link traffic data in a large-scale network is a highly underdetermined problem. As a result, providing an accurate initial solution is crucial for obtaining a more reliable estimated demand. In this paper, we discuss the necessity of having a comprehensive demand profiling model that considers the spatial differences of OD pairs and we demonstrate its application in the calibration of large-scale traffic assignment models. First, we apply a departure choice model that adds a time dimension to the OD demand flows concerning their spatial differences. The time-profiled demand is then fed into the time-dependent OD demand estimation problem for further adjustment. Results show that in addition to reducing the error between simulation outputs and the observed link counts, the estimated demand profile more accurately reflects the spatial correlation of the OD pairs in the large-scale network being studied. Results provide practical insights into deployment and calibration of simulation-based dynamic traffic assignment models.
- Published
- 2020
43. Two-mode network autoregressive model for large-scale networks
- Author
-
Danyang Huang, Xuening Zhu, Hansheng Wang, and Feifei Wang
- Subjects
Economics and Econometrics ,Scale (ratio) ,Autoregressive model ,Computer science ,Applied Mathematics ,Large scale network ,Autocorrelation ,Mode (statistics) ,Estimator ,Sample (statistics) ,Type (model theory) ,Algorithm - Abstract
A two-mode network refers to a network where the nodes are classified into two distinct types, and edges can only exist between nodes of different types. In analysis of two-mode networks, one important objective is to explore the relationship between responses of two types of nodes. To this end, we propose a network autoregressive model for two-mode networks. Different network autocorrelation coefficients are allowed. To estimate the model, a quasi-maximum likelihood estimator is developed with high computational cost. To alleviate the computational burden, a least squares estimator is proposed, which is applicable in large-scale networks. The least squares estimator can be viewed as one particular type of generalized methods of moments estimator. The theoretical properties of both estimators are investigated. The finite sample performances are assessed through simulations and a real data example.
- Published
- 2020
44. Enhanced Cluster Head Selection Approach for small scale and large scale network in WSN for improving energy efficiency
- Author
-
Selvalakshmi M and Jeyakumar M K
- Subjects
Scale (ratio) ,Computer science ,Large scale network ,Distributed computing ,General Engineering ,Cluster (physics) ,Head (vessel) ,Selection (genetic algorithm) ,Efficient energy use - Published
- 2020
45. Development of a Connected Vehicle Dynamic Freeway Variable Speed Controller
- Author
-
Youssef Bichiou, Hossam M. Abdelghaffar, Hesham A. Rakha, and Maha Elouni
- Subjects
Electronic speed control ,General Computer Science ,Computer science ,Speed limit ,General Engineering ,large scale network ,Flow network ,variable speed control ,Automotive engineering ,Reduction (complexity) ,Connected vehicles ,Variable (computer science) ,Traffic congestion ,Control theory ,speed harmonization ,Fuel efficiency ,sliding control ,General Materials Science ,lcsh:Electrical engineering. Electronics. Nuclear engineering ,lcsh:TK1-9971 - Abstract
Traffic congestion is a major challenge in urban areas, and is associated with longer travel times, increased vehicle emissions, and numerous vehicle crashes. Creating an efficient mobility system is difficult, given that each driver is usually trying to optimize their individual trip within the network without accounting for other road users. However, new technologies in modern vehicles, especially connected vehicle technologies, make it increasingly possible to find solutions to network efficiency problems. Connected technologies allow data sharing between vehicles, allowing for greater system optimization. This work takes advantage of connectivity to develop a global framework to increase transportation network efficiency and address the aforementioned challenges. To enhance mobility, this paper presents a dynamic freeway speed controller based on the sliding mode theory, which uses the fundamental equations governing traffic dynamics in combination with variable speed limit control in order to provide advisory speeds for connected vehicles. Simulation results on a downtown Los Angeles network show significant reductions in trip times and delays both on freeways (where the control was activated) and network-wide (i.e., freeways and other roadways). Specifically, the results for the entire network showed a 12.17% reduction in travel time and a 20.67% reduction in total delay. These results had the secondary effect of reducing fuel consumption and therefore CO2 emissions by 2.6% and 3.3%, respectively. The results for the freeway network alone showed a 20.48% reduction in travel time and a 21.63% reduction in queued vehicles. These results reveal the significant potential benefits of using the proposed speed harmonization controller on real large-scale networks.
- Published
- 2020
46. Investigating network effects of DBS with fMRI
- Author
-
Robert Jech and Karsten Mueller
- Subjects
Subthalamic nucleus ,Motor task ,Deep brain stimulation ,Resting state fMRI ,business.industry ,medicine.medical_treatment ,Large scale network ,Functional connectivity ,Basal ganglia ,Thalamus ,medicine ,business ,Neuroscience - Published
- 2022
47. Subjective Uncontrollability over Aversive Events Reduces Working Memory Performance and Related Large-Scale Network Interactions
- Author
-
Lars Schwabe and Nadine Wanke
- Subjects
Adult ,Male ,Cognitive Neuroscience ,Learned helplessness ,Young Adult ,Cellular and Molecular Neuroscience ,Salience (neuroscience) ,Avoidance Learning ,medicine ,Humans ,Prefrontal cortex ,medicine.diagnostic_test ,Working memory ,Large scale network ,Brain ,Cognition ,Fear ,Magnetic Resonance Imaging ,Electric Stimulation ,Memory, Short-Term ,medicine.anatomical_structure ,Female ,Nerve Net ,Functional magnetic resonance imaging ,Psychology ,Psychomotor Performance ,Parahippocampal gyrus ,Cognitive psychology - Abstract
Lack of control over significant events may induce a state of learned helplessness that is characterized by cognitive, motivational, and affective deficits. Although highly relevant in the pathogenesis of several mental disorders, the extent of the cognitive deficits induced by experiences of uncontrollability and the neural mechanisms underlying such deficits in humans remain poorly understood. Using functional magnetic resonance imaging (fMRI), we tested here whether uncontrollability over aversive events impairs subsequent working memory performance and, if so, which neural processes are involved in such deficits. We assessed working memory and the involved neurocircuitry in the MRI scanner before and after participants underwent a task in which they could either learn to avoid electric shocks or had no instrumental control over shocks. Our results show that subjective, but not objective, uncontrollability over aversive events impaired working memory performance. This impact of subjective uncontrollability was linked to altered prefrontal and parahippocampal activities and connectivity as well as decreased crosstalk between frontoparietal executive and salience networks. Our findings show that the perceived uncontrollability over aversive events, rather than the aversive events themselves or the actual, objective control over them, disrupts subsequent working memory processes, most likely through altered crosstalk between prefrontal, temporal, and parietal areas.
- Published
- 2019
48. Resilient State Management in Large Scale Networks
- Author
-
Huang, Yangcheng, Bhatti, Saleem N., Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, de Meer, Hermann, editor, and Bhatti, Nina, editor
- Published
- 2005
- Full Text
- View/download PDF
49. Experience with chorus
- Author
-
Bac, Christian, Bernard, Guy, Conan, Denis, Nguyen, Quang Hong, Taconet, Chantal, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Bartosek, Miroslav, editor, Staudek, Jan, editor, and Wiedermann, Jirí, editor
- Published
- 1995
- Full Text
- View/download PDF
50. CNTM-01. Evaluating Traditional and Non-Traditional Eloquent Areas in Patients with Brain Tumors: Large-scale Network Analysis Using a Machine Learning-Based Platform
- Author
-
Ashish H. Shah, Daniel G Eichberg, Alexis Morell, Ricardo J. Komotar, Victor M. Lu, Evan Luther, and Michael E. Ivan
- Subjects
Cancer Research ,Oncology ,business.industry ,Computer science ,Large scale network ,In patient ,Sno Maximal Safe Brain Tumor Resection: Intraoperative Visualization and the Connectome Conference ,Neurology (clinical) ,Artificial intelligence ,business ,Machine learning ,computer.software_genre ,computer - Abstract
BACKGROUND Developing mapping tools that allow identification of traditional or non-traditional eloquent areas is necessary to minimize the risk of postoperative neurologic deficits. The objective of our study is to evaluate the use of a novel cloud-based platform that uses machine learning to identify cerebral networks in patients with brain tumors. METHODS We retrospectively included all adult patients who underwent surgery for brain tumor resection or thermal ablation at our Institution between the 16th of February and the 15th of May of 2021. Pre and postoperative contrast-enhanced MRI with T1-weighted and high-resolution Diffusion Tensor Imaging (DTI) sequences were uploaded into the Quicktome platform. After processing the data, we categorized the integrity of seven large-scale brain networks: sensorimotor, visual, ventral attention, central executive, default mode, dorsal attention and limbic. Affected networks were correlated with pre and postoperative clinical data, including neurologic deficits. RESULTS Thirty-five (35) patients were included in the study. The average age of the sample was 63.2 years, and 51.4% (n=18) were females. The most affected network was the central executive network (40%), followed by the dorsal attention and default mode networks (31.4%), while the least affected were the visual (11%) and ventral attention networks (17%). Patients with preoperative deficits showed a significantly higher number of altered networks before the surgery (p=0.021), compared to patients without deficits. In addition, we found that patients without neurologic deficits had an average of 2.06 large-scale networks affected, with 75% of them not being related to traditional eloquent areas as the sensorimotor, language or visual circuits. CONCLUSIONS The Quicktome platform is a practical tool that allows automatic visualization of large-scale brain networks in patients with brain tumors. Although further studies are needed, it may assist in the surgical management of traditional and non-traditional eloquent areas.
- Published
- 2021
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.