Urban buildings and urban traffic network are considered as the vital arteries of cities which have particular effects especially after the crisis in the search and rescue operations. The aim of this study is to deter...Urban buildings and urban traffic network are considered as the vital arteries of cities which have particular effects especially after the crisis in the search and rescue operations. The aim of this study is to determine the vulnerability of urban areas especially, buildings and traffic networks using multicriteria geographic information systems and decisionmaking methods. As there are many effective criteria on the seismic vulnerability that they have uncertain and vague properties, the method of this paper is applying fuzzy ordered weighted average(OWA) to model the seismic vulnerability of urban buildings and traffic networks in the most optimistic and pessimistic states. The study area is district 6 of Tehran that is affected by the four major faults, and thus will be threatened by the earthquakes. The achieved results illustrated the vulnerability with different degrees of risk levels including very high, high, medium, low and very low. The results show that in the most optimistic case 14% and in the pessimistic case 1% of buildings tolerate in very low vulnerability. The vulnerability of urban street network also indicates that in the optimistic case 12% and in the pessimistic case at most 9% of the area are in appropriate condition and the North and NorthEast of the study area are more vulnerable than South of it.展开更多
The shortest path planning issure is critical for dynamic traffic assignment and route guidance in intelligent transportation systems. In this paper, a Particle Swarm Optimization (PSO) algorithm with priority-based e...The shortest path planning issure is critical for dynamic traffic assignment and route guidance in intelligent transportation systems. In this paper, a Particle Swarm Optimization (PSO) algorithm with priority-based encoding scheme based on fluid neural network (FNN) to search for the shortest path in stochastic traffic networks is introduced. The proposed algorithm overcomes the weight coefficient symmetry restrictions of the traditional FNN and disadvantage of easily getting into a local optimum for PSO. Simulation experiments have been carried out on different traffic network topologies consisting of 15-65 nodes and the results showed that the proposed approach can find the optimal path and closer sub-optimal paths with good success ratio. At the same time, the algorithms greatly improve the convergence efficiency of fluid neuron network.展开更多
Seeking shortest travel times through smart algorithms may not only optimize the travel times but also reduce carbon emissions, such as CO2, CO and Hydro-Carbons. It can also result in reduced driver frustrations and ...Seeking shortest travel times through smart algorithms may not only optimize the travel times but also reduce carbon emissions, such as CO2, CO and Hydro-Carbons. It can also result in reduced driver frustrations and can increase passenger expectations of consistent travel times, which in turn points to benefits in overall planning of day schedules. Fuel consumption savings are another benefit from the same. However, attempts to elect the shortest path as an assumption of quick travel times, often work counter to the very objective intended and come with the risk of creating a “Braess Paradox” which is about congestion resulting when several drivers attempt to elect the same shortest route. The situation that arises has been referred to as the price of anarchy! We propose algorithms that find multiple shortest paths between an origin and a destination. It must be appreciated that these will not yield the exact number of Kilometers travelled, but favourable weights in terms of travel times so that a reasonable allowable time difference between the multiple shortest paths is attained when the same Origin and Destinations are considered and favourable responsive routes are determined as variables of traffic levels and time of day. These routes are selected on the paradigm of route balancing, re-routing algorithms and traffic light intelligence all coming together to result in optimized consistent travel times whose benefits are evenly spread to all motorist, unlike the Entropy balanced k shortest paths (EBkSP) method which favours some motorists on the basis of urgency. This paper proposes a Fully Balanced Multiple-Candidate shortest path (FBMkP) by which we model in SUMO to overcome the computational overhead of assigning priority differently to each travelling vehicle using intelligence at intersections and other points on the vehicular network. The FBMkP opens up traffic by fully balancing the whole network so as to benefit every motorist. Whereas the EBkSP reserves some routes for cars on high priority, our algorithm distributes the benefits of smart routing to all vehicles on the network and serves the road side units such as induction loops and detectors from having to remember the urgency of each vehicle. Instead, detectors and induction loops simply have to poll the destination of the vehicle and not any urgency factor. The minimal data being processed significantly reduce computational times and the benefits all vehicles. The multiple-candidate shortest paths selected on the basis of current traffic status on each possible route increase the efficiency. Routes are fewer than vehicles so possessing weights of routes is smarter than processing individual vehicle weights. This is a multi-objective function project where improving one factor such as travel times improves many more cost, social and environmental factors.展开更多
The aim of this work is mathematical education through the knowledge system and mathematical modeling. A net model of formation of mathematical knowledge as a deductive theory is suggested here. Within this model the ...The aim of this work is mathematical education through the knowledge system and mathematical modeling. A net model of formation of mathematical knowledge as a deductive theory is suggested here. Within this model the formation of deductive theory is represented as the development of a certain informational space, the elements of which are structured in the form of the orientated semantic net. This net is properly metrized and characterized by a certain system of coverings. It allows injecting net optimization parameters, regulating qualitative aspects of knowledge system under consideration. To regulate the creative processes of the formation and realization of mathematical know- edge, stochastic model of formation deductive theory is suggested here in the form of branching Markovian process, which is realized in the corresponding informational space as a semantic net. According to this stochastic model we can get correct foundation of criterion of optimization creative processes that leads to “great main points” strategy (GMP-strategy) in the process of realization of the effective control in the research work in the sphere of mathematics and its applications.展开更多
Traffic sign recognition (TSR, or Road Sign Recognition, RSR) is one of the Advanced Driver Assistance System (ADAS) devices in modern cars. To concern the most important issues, which are real-time and resource effic...Traffic sign recognition (TSR, or Road Sign Recognition, RSR) is one of the Advanced Driver Assistance System (ADAS) devices in modern cars. To concern the most important issues, which are real-time and resource efficiency, we propose a high efficiency hardware implementation for TSR. We divide the TSR procedure into two stages, detection and recognition. In the detection stage, under the assumption that most German traffic signs have red or blue colors with circle, triangle or rectangle shapes, we use Normalized RGB color transform and Single-Pass Connected Component Labeling (CCL) to find the potential traffic signs efficiently. For Single-Pass CCL, our contribution is to eliminate the “merge-stack” operations by recording connected relations of region in the scan phase and updating the labels in the iterating phase. In the recognition stage, the Histogram of Oriented Gradient (HOG) is used to generate the descriptor of the signs, and we classify the signs with Support Vector Machine (SVM). In the HOG module, we analyze the required minimum bits under different recognition rate. The proposed method achieves 96.61% detection rate and 90.85% recognition rate while testing with the GTSDB dataset. Our hardware implementation reduces the storage of CCL and simplifies the HOG computation. Main CCL storage size is reduced by 20% comparing to the most advanced design under typical condition. By using TSMC 90 nm technology, the proposed design operates at 105 MHz clock rate and processes in 135 fps with the image size of 1360 × 800. The chip size is about 1 mm2 and the power consumption is close to 8 mW. Therefore, this work is resource efficient and achieves real-time requirement.展开更多
Protein Secondary Structure Prediction (PSSP) is considered as one of the major challenging tasks in bioinformatics, so many solutions have been proposed to solve that problem via trying to achieve more accurate predi...Protein Secondary Structure Prediction (PSSP) is considered as one of the major challenging tasks in bioinformatics, so many solutions have been proposed to solve that problem via trying to achieve more accurate prediction results. The goal of this paper is to develop and implement an intelligent based system to predict secondary structure of a protein from its primary amino acid sequence by using five models of Neural Network (NN). These models are Feed Forward Neural Network (FNN), Learning Vector Quantization (LVQ), Probabilistic Neural Network (PNN), Convolutional Neural Network (CNN), and CNN Fine Tuning for PSSP. To evaluate our approaches two datasets have been used. The first one contains 114 protein samples, and the second one contains 1845 protein samples.展开更多
“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algo-rithms. Many authors focus on propagation delays with the distance vector but ignore the status information an...“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algo-rithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adap-tive routing (DT-TTAR) algorithm is proposed in this paper. This routing algorithm incorporates both inher-ent dynamics of network topology and variations of traffic load in inter-satellite links. The next hop decision is made by the adaptive link cost metric, depending on arrival rates, time slots and locations of source-destination pairs. Through comprehensive analysis, we derive computation formulas of the main per-formance indexes. Meanwhile, the performances are evaluated through a set of simulations, and compared with other static and adaptive routing mechanisms as a reference. The results show that the proposed DT-TTAR algorithm has better performance of end-to-end delay than other algorithms, especially in high traffic areas.展开更多
This paper presents a distributed optimization strategy for large-scale traffic network based on fog computing. Different from the traditional cloud-based centralized optimization strategy, the fog-based distributed o...This paper presents a distributed optimization strategy for large-scale traffic network based on fog computing. Different from the traditional cloud-based centralized optimization strategy, the fog-based distributed optimization strategy distributes its computing tasks to individual sub-processors, thus significantly reducing computation time. A traffic model is built and a series of communication rules between subsystems are set to ensure that the entire transportation network can be globally optimized while the subsystem is achieving its local optimization. Finally, this paper numerically simulates the operation of the traffic network by mixed-Integer programming, also, compares the advantages and disadvantages of the two optimization strategies.展开更多
In this paper, performance of three classifiers for classification of five mental tasks were investigated. Wavelet Packet Transform (WPT) was used for feature extraction of the relevant frequency bands from raw Electr...In this paper, performance of three classifiers for classification of five mental tasks were investigated. Wavelet Packet Transform (WPT) was used for feature extraction of the relevant frequency bands from raw Electroencephalograph (EEG) signal. The three classifiers namely used were Multilayer Back propagation Neural Network, Support Vector Machine and Radial Basis Function Neural Network. In MLP-BP NN five training methods used were a) Gradient Descent Back Propagation b) Levenberg-Marquardt c) Resilient Back Propagation d) Conjugate Learning Gradient Back Propagation and e) Gradient Descent Back Propagation with movementum.展开更多
Long-term traffic flow prediction is a crucial component of intelligent transportation systems within intelligent networks,requiring predictive models that balance accuracy with low-latency and lightweight computation...Long-term traffic flow prediction is a crucial component of intelligent transportation systems within intelligent networks,requiring predictive models that balance accuracy with low-latency and lightweight computation to optimize trafficmanagement and enhance urban mobility and sustainability.However,traditional predictivemodels struggle to capture long-term temporal dependencies and are computationally intensive,limiting their practicality in real-time.Moreover,many approaches overlook the periodic characteristics inherent in traffic data,further impacting performance.To address these challenges,we introduce ST-MambaGCN,a State-Space-Based Spatio-Temporal Graph Convolution Network.Unlike conventionalmodels,ST-MambaGCN replaces the temporal attention layer withMamba,a state-space model that efficiently captures long-term dependencies with near-linear computational complexity.The model combines Chebyshev polynomial-based graph convolutional networks(GCN)to explore spatial correlations.Additionally,we incorporate a multi-temporal feature capture mechanism,where the final integrated features are generated through the Hadamard product based on learnable parameters.This mechanism explicitly models shortterm,daily,and weekly traffic patterns to enhance the network’s awareness of traffic periodicity.Extensive experiments on the PeMS04 and PeMS08 datasets demonstrate that ST-MambaGCN significantly outperforms existing benchmarks,offering substantial improvements in both prediction accuracy and computational efficiency for long-term traffic flow prediction.展开更多
The most important elements of “intellectual networks” (Smart Grid) are the systems of monitoring the parameters of electrical equipment. Information-measuring systems (IMS), which described in this paper, were prop...The most important elements of “intellectual networks” (Smart Grid) are the systems of monitoring the parameters of electrical equipment. Information-measuring systems (IMS), which described in this paper, were proposed to use together with rapid digital protection against short-circuit regimes in transformer windings. This paper presents an application’s experience of LVI-testing, some results of the use of Frequency Response Analysis (FRA) to check the condition of transformer windings and infra-red control results of electrical equipment. The LVI method and short-circuit inductive reactance measurements are sensitive for detecting such faults as radial, axial winding deformations, a twisting of low-voltage or regulating winding, a losing of winding’s pressing and others.展开更多
Accurate short-term traffic flow prediction plays a crucial role in intelligent transportation system (ITS), because it can assist both traffic authorities and individual travelers make better decisions. Previous rese...Accurate short-term traffic flow prediction plays a crucial role in intelligent transportation system (ITS), because it can assist both traffic authorities and individual travelers make better decisions. Previous researches mostly focus on shallow traffic prediction models, which performances were unsatisfying since short-term traffic flow exhibits the characteristics of high nonlinearity, complexity and chaos. Taking the spatial and temporal correlations into consideration, a new traffic flow prediction method is proposed with the basis on the road network topology and gated recurrent unit (GRU). This method can help researchers without professional traffic knowledge extracting generic traffic flow features effectively and efficiently. Experiments are conducted by using real traffic flow data collected from the Caltrans Performance Measurement System (PEMS) database in San Diego and Oakland from June 15, 2017 to September 27, 2017. The results demonstrate that our method outperforms other traditional approaches in terms of mean absolute percentage error (MAPE), symmetric mean absolute percentage error (SMAPE) and root mean square error (RMSE).展开更多
In a given district, the accessibility of any point should be the synthetically evaluation of the internal and external accessibilities. Using MapX component and Delphi, the author presents an information system to ca...In a given district, the accessibility of any point should be the synthetically evaluation of the internal and external accessibilities. Using MapX component and Delphi, the author presents an information system to calculate and analyze regional accessibility according to the shortest travel time, generating thus a mark diffusing figure. Based on land traffic network, this paper assesses the present and the future regional accessibilities of sixteen major cities in the Yangtze River Delta. The result shows that the regional accessibility of the Yangtze River Delta presents a fan with Shanghai as its core. The top two most accessible cities are Shanghai and Jiaxing, and the bottom two ones are Taizhou （Zhejiang province） and Nantong With the construction of Sutong Bridge, Hangzhouwan Bridge and Zhoushan Bridge, the regional internal accessibility of all cities will be improved. Especially for Shaoxing, Ningbo and Taizhou （Jiangsu province）, the regional internal accessibility will be decreased by one hour, and other cities will be shortened by about 25 minutes averagely. As the construction of Yangkou Harbor in Nantong, the regional external accessibility of the harbor cities in Jiangsu province will be speeded up by about one hour.展开更多
We consider the extension of network lifetime of battery driven wireless sensor networks by splitting the sensing area into uniform clusters and implementing heterogeneous modulation schemes at different members of th...We consider the extension of network lifetime of battery driven wireless sensor networks by splitting the sensing area into uniform clusters and implementing heterogeneous modulation schemes at different members of the clusters. A cross-layer optimization has been proposed to reduce total energy expenditure of the network;at network layer, routing is done through uniform clusters;at MAC layer, each sensor node of the cluster is assigned fixed or variable time slots and at physical layer different member of the clusters is assigned different modulation techniques. MATLAB simulation proved substantial network lifetime gains.展开更多
The concept of Network Centric Therapy represents an amalgamation of wearable and wireless inertial sensor systems and machine learning with access to a Cloud computing environment. The advent of Network Centric Thera...The concept of Network Centric Therapy represents an amalgamation of wearable and wireless inertial sensor systems and machine learning with access to a Cloud computing environment. The advent of Network Centric Therapy is highly relevant to the treatment of Parkinson’s disease through deep brain stimulation. Originally wearable and wireless systems for quantifying Parkinson’s disease involved the use a smartphone to quantify hand tremor. Although originally novel, the smartphone has notable issues as a wearable application for quantifying movement disorder tremor. The smartphone has evolved in a pathway that has made the smartphone progressively more cumbersome to mount about the dorsum of the hand. Furthermore, the smartphone utilizes an inertial sensor package that is not certified for medical analysis, and the trial data access a provisional Cloud computing environment through an email account. These concerns are resolved with the recent development of a conformal wearable and wireless inertial sensor system. This conformal wearable and wireless system mounts to the hand with the profile of a bandage by adhesive and accesses a secure Cloud computing environment through a segmented wireless connectivity strategy involving a smartphone and tablet. Additionally, the conformal wearable and wireless system is certified by the FDA of the United States of America for ascertaining medical grade inertial sensor data. These characteristics make the conformal wearable and wireless system uniquely suited for the quantification of Parkinson’s disease treatment through deep brain stimulation. Preliminary evaluation of the conformal wearable and wireless system is demonstrated through the differentiation of deep brain stimulation set to “On” and “Off” status. Based on the robustness of the acceleration signal, this signal was selected to quantify hand tremor for the prescribed deep brain stimulation settings. Machine learning classification using the Waikato Environment for Knowledge Analysis (WEKA) was applied using the multilayer perceptron neural network. The multilayer perceptron neural network achieved considerable classification accuracy for distinguishing between the deep brain stimulation system set to “On” and “Off” status through the quantified acceleration signal data obtained by this recently developed conformal wearable and wireless system. The research achievement establishes a progressive pathway to the future objective of achieving deep brain stimulation capabilities that promote closed-loop acquisition of configuration parameters that are uniquely optimized to the individual through extrinsic means of a highly conformal wearable and wireless inertial sensor system and machine learning with access to Cloud computing resources.展开更多
Traffic network is an importance asp ect of researching controllable parameters of an urban spatial morpholo-gy.Based on GIS,traffic network str ucture complexity can be understood by using fractal geometry in which t...Traffic network is an importance asp ect of researching controllable parameters of an urban spatial morpholo-gy.Based on GIS,traffic network str ucture complexity can be understood by using fractal geometry in which th e length-radius dimension describes change of network density,and ramification-radius dimension describes complexity and accessibility of urban network.It i s propitious to analyze urban traffic network and to understand dynamic c hange process of traffic network using expanding f ractal-dimension quantification.Meanwhile the length-radius dimension and ramifica-tion-radius dimension could be rega rd as reference factor of quantitative describing urban traffic network.展开更多
The flourishing complex network theory has aroused increasing interest in studying the properties of real-world networks. Based on the traffic network of Chang-Zhu Tan urban agglomeration in central China, some basic ...The flourishing complex network theory has aroused increasing interest in studying the properties of real-world networks. Based on the traffic network of Chang-Zhu Tan urban agglomeration in central China, some basic network topological characteristics were computed with data collected from local traffic maps, which showed that the traffic networks were small-world networks with strong resilience against failure; more importantly, the investigations of as- sortativity coefficient and average nearestlneighbour degree implied the disassortativity of the traffic networks. Since traffic network hierarchy as an important basic property has been neither studied intensively nor proved quantitatively, the authors are inspired to analyse traffic network hierarchy with disassortativity and to finely characterize hierarchy in the traffic networks by using the n-degree-n-clustering coefficient relationship. Through numerical results and analyses an exciting conclusion is drawn that the traffic networks exhibit a significant hierarchy, that is, the traffic networks are proved to be hierarchically organized. The result provides important information and theoretical groundwork for optimal transport planning.展开更多
critical for guiding treatment and improving patient outcomes.Traditional molecular subtyping via immuno-histochemistry(IHC)test is invasive,time-consuming,and may not fully represent tumor heterogeneity.This study pr...critical for guiding treatment and improving patient outcomes.Traditional molecular subtyping via immuno-histochemistry(IHC)test is invasive,time-consuming,and may not fully represent tumor heterogeneity.This study proposes a non-invasive approach using digital mammography images and deep learning algorithm for classifying breast cancer molecular subtypes.Four pretrained models,including two Convolutional Neural Networks(MobileNet_V3_Large and VGG-16)and two Vision Transformers(ViT_B_16 and ViT_Base_Patch16_Clip_224)were fine-tuned to classify images into HER2-enriched,Luminal,Normal-like,and Triple Negative subtypes.Hyperparameter tuning,including learning rate adjustment and layer freezing strategies,was applied to optimize performance.Among the evaluated models,ViT_Base_Patch16_Clip_224 achieved the highest test accuracy(94.44%),with equally high precision,recall,and F1-score of 0.94,demonstrating excellent generalization.MobileNet_V3_Large achieved the same accuracy but showed less training stability.In contrast,VGG-16 recorded the lowest performance,indicating a limitation in its generalizability for this classification task.The study also highlighted the superior performance of the Vision Transformer models over CNNs,particularly due to their ability to capture global contextual features and the benefit of CLIP-based pretraining in ViT_Base_Patch16_Clip_224.To enhance clinical applicability,a graphical user interface(GUI)named“BCMS Dx”was developed for streamlined subtype prediction.Deep learning applied to mammography has proven effective for accurate and non-invasive molecular subtyping.The proposed Vision Transformer-based model and supporting GUI offer a promising direction for augmenting diagnostic workflows,minimizing the need for invasive procedures,and advancing personalized breast cancer management.展开更多
Over the last few years, the Internet of Things (IoT) has become an omnipresent term. The IoT expands the existing common concepts, anytime and anyplace to the connectivity for anything. The proliferation in IoT offer...Over the last few years, the Internet of Things (IoT) has become an omnipresent term. The IoT expands the existing common concepts, anytime and anyplace to the connectivity for anything. The proliferation in IoT offers opportunities but may also bear risks. A hitherto neglected aspect is the possible increase in power consumption as smart devices in IoT applications are expected to be reachable by other devices at all times. This implies that the device is consuming electrical energy even when it is not in use for its primary function. Many researchers’ communities have started addressing storage ability like cache memory of smart devices using the concept called—Named Data Networking (NDN) to achieve better energy efficient communication model. In NDN, memory or buffer overflow is the common challenge especially when internal memory of node exceeds its limit and data with highest degree of freshness may not be accommodated and entire scenarios behaves like a traditional network. In such case, Data Caching is not performed by intermediate nodes to guarantee highest degree of freshness. On the periodical updates sent from data producers, it is exceedingly demanded that data consumers must get up to date information at cost of lease energy. Consequently, there is challenge in maintaining tradeoff between freshness energy consumption during Publisher-Subscriber interaction. In our work, we proposed the architecture to overcome cache strategy issue by Smart Caching Algorithm for improvement in memory management and data freshness. The smart caching strategy updates the data at precise interval by keeping garbage data into consideration. It is also observed from experiment that data redundancy can be easily obtained by ignoring/dropping data packets for the information which is not of interest by other participating nodes in network, ultimately leading to optimizing tradeoff between freshness and energy required.展开更多
With the increasing requirements of the multicast services in the whole data traffic service, the optical multicast technology becomes a key technology supporting wide bandwidth and high speed multicasting communicati...With the increasing requirements of the multicast services in the whole data traffic service, the optical multicast technology becomes a key technology supporting wide bandwidth and high speed multicasting communication. The transmission efficiency, capacity and robustness of optical multicast network can be further improved by introducing network coding technology into optical multicast networks. Meanwhile, facing to demand of emerging rate-variable multi-granularity multicast service, a multi-path transmission scheme based on network coding for routing and spectrum allocation (RSA) is proposed. It can not only allocate spectrum resources effectively and flexibly for various-rate multicast traffic, but also balance the network load, improve network throughput and reduce transmission blocking rate. In this paper, RSA problem is decomposed into two subproblems, namely routing allocation based on network coding and spectrum allocation based on maximum spectrum first (MSF) strategy, which are solved sequentially. Simulation experiments are carried out to analyze transmission performance with proposed RSA scheme. The simulation results show that the proposed RSA mechanism can allocate spectrum resources efficiently and flexibly for multi-granularity multicast traffic. Compared with RSA schemes based on shortest path tree (SPT) and minimal spanning tree (MST), the proposed RSA scheme is more efficient for spectrum resource utilization and load balancing, and spectrum resource is saved more than 20%.展开更多
文摘Urban buildings and urban traffic network are considered as the vital arteries of cities which have particular effects especially after the crisis in the search and rescue operations. The aim of this study is to determine the vulnerability of urban areas especially, buildings and traffic networks using multicriteria geographic information systems and decisionmaking methods. As there are many effective criteria on the seismic vulnerability that they have uncertain and vague properties, the method of this paper is applying fuzzy ordered weighted average(OWA) to model the seismic vulnerability of urban buildings and traffic networks in the most optimistic and pessimistic states. The study area is district 6 of Tehran that is affected by the four major faults, and thus will be threatened by the earthquakes. The achieved results illustrated the vulnerability with different degrees of risk levels including very high, high, medium, low and very low. The results show that in the most optimistic case 14% and in the pessimistic case 1% of buildings tolerate in very low vulnerability. The vulnerability of urban street network also indicates that in the optimistic case 12% and in the pessimistic case at most 9% of the area are in appropriate condition and the North and NorthEast of the study area are more vulnerable than South of it.
文摘The shortest path planning issure is critical for dynamic traffic assignment and route guidance in intelligent transportation systems. In this paper, a Particle Swarm Optimization (PSO) algorithm with priority-based encoding scheme based on fluid neural network (FNN) to search for the shortest path in stochastic traffic networks is introduced. The proposed algorithm overcomes the weight coefficient symmetry restrictions of the traditional FNN and disadvantage of easily getting into a local optimum for PSO. Simulation experiments have been carried out on different traffic network topologies consisting of 15-65 nodes and the results showed that the proposed approach can find the optimal path and closer sub-optimal paths with good success ratio. At the same time, the algorithms greatly improve the convergence efficiency of fluid neuron network.
文摘Seeking shortest travel times through smart algorithms may not only optimize the travel times but also reduce carbon emissions, such as CO2, CO and Hydro-Carbons. It can also result in reduced driver frustrations and can increase passenger expectations of consistent travel times, which in turn points to benefits in overall planning of day schedules. Fuel consumption savings are another benefit from the same. However, attempts to elect the shortest path as an assumption of quick travel times, often work counter to the very objective intended and come with the risk of creating a “Braess Paradox” which is about congestion resulting when several drivers attempt to elect the same shortest route. The situation that arises has been referred to as the price of anarchy! We propose algorithms that find multiple shortest paths between an origin and a destination. It must be appreciated that these will not yield the exact number of Kilometers travelled, but favourable weights in terms of travel times so that a reasonable allowable time difference between the multiple shortest paths is attained when the same Origin and Destinations are considered and favourable responsive routes are determined as variables of traffic levels and time of day. These routes are selected on the paradigm of route balancing, re-routing algorithms and traffic light intelligence all coming together to result in optimized consistent travel times whose benefits are evenly spread to all motorist, unlike the Entropy balanced k shortest paths (EBkSP) method which favours some motorists on the basis of urgency. This paper proposes a Fully Balanced Multiple-Candidate shortest path (FBMkP) by which we model in SUMO to overcome the computational overhead of assigning priority differently to each travelling vehicle using intelligence at intersections and other points on the vehicular network. The FBMkP opens up traffic by fully balancing the whole network so as to benefit every motorist. Whereas the EBkSP reserves some routes for cars on high priority, our algorithm distributes the benefits of smart routing to all vehicles on the network and serves the road side units such as induction loops and detectors from having to remember the urgency of each vehicle. Instead, detectors and induction loops simply have to poll the destination of the vehicle and not any urgency factor. The minimal data being processed significantly reduce computational times and the benefits all vehicles. The multiple-candidate shortest paths selected on the basis of current traffic status on each possible route increase the efficiency. Routes are fewer than vehicles so possessing weights of routes is smarter than processing individual vehicle weights. This is a multi-objective function project where improving one factor such as travel times improves many more cost, social and environmental factors.
文摘The aim of this work is mathematical education through the knowledge system and mathematical modeling. A net model of formation of mathematical knowledge as a deductive theory is suggested here. Within this model the formation of deductive theory is represented as the development of a certain informational space, the elements of which are structured in the form of the orientated semantic net. This net is properly metrized and characterized by a certain system of coverings. It allows injecting net optimization parameters, regulating qualitative aspects of knowledge system under consideration. To regulate the creative processes of the formation and realization of mathematical know- edge, stochastic model of formation deductive theory is suggested here in the form of branching Markovian process, which is realized in the corresponding informational space as a semantic net. According to this stochastic model we can get correct foundation of criterion of optimization creative processes that leads to “great main points” strategy (GMP-strategy) in the process of realization of the effective control in the research work in the sphere of mathematics and its applications.
文摘Traffic sign recognition (TSR, or Road Sign Recognition, RSR) is one of the Advanced Driver Assistance System (ADAS) devices in modern cars. To concern the most important issues, which are real-time and resource efficiency, we propose a high efficiency hardware implementation for TSR. We divide the TSR procedure into two stages, detection and recognition. In the detection stage, under the assumption that most German traffic signs have red or blue colors with circle, triangle or rectangle shapes, we use Normalized RGB color transform and Single-Pass Connected Component Labeling (CCL) to find the potential traffic signs efficiently. For Single-Pass CCL, our contribution is to eliminate the “merge-stack” operations by recording connected relations of region in the scan phase and updating the labels in the iterating phase. In the recognition stage, the Histogram of Oriented Gradient (HOG) is used to generate the descriptor of the signs, and we classify the signs with Support Vector Machine (SVM). In the HOG module, we analyze the required minimum bits under different recognition rate. The proposed method achieves 96.61% detection rate and 90.85% recognition rate while testing with the GTSDB dataset. Our hardware implementation reduces the storage of CCL and simplifies the HOG computation. Main CCL storage size is reduced by 20% comparing to the most advanced design under typical condition. By using TSMC 90 nm technology, the proposed design operates at 105 MHz clock rate and processes in 135 fps with the image size of 1360 × 800. The chip size is about 1 mm2 and the power consumption is close to 8 mW. Therefore, this work is resource efficient and achieves real-time requirement.
文摘Protein Secondary Structure Prediction (PSSP) is considered as one of the major challenging tasks in bioinformatics, so many solutions have been proposed to solve that problem via trying to achieve more accurate prediction results. The goal of this paper is to develop and implement an intelligent based system to predict secondary structure of a protein from its primary amino acid sequence by using five models of Neural Network (NN). These models are Feed Forward Neural Network (FNN), Learning Vector Quantization (LVQ), Probabilistic Neural Network (PNN), Convolutional Neural Network (CNN), and CNN Fine Tuning for PSSP. To evaluate our approaches two datasets have been used. The first one contains 114 protein samples, and the second one contains 1845 protein samples.
文摘“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algo-rithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adap-tive routing (DT-TTAR) algorithm is proposed in this paper. This routing algorithm incorporates both inher-ent dynamics of network topology and variations of traffic load in inter-satellite links. The next hop decision is made by the adaptive link cost metric, depending on arrival rates, time slots and locations of source-destination pairs. Through comprehensive analysis, we derive computation formulas of the main per-formance indexes. Meanwhile, the performances are evaluated through a set of simulations, and compared with other static and adaptive routing mechanisms as a reference. The results show that the proposed DT-TTAR algorithm has better performance of end-to-end delay than other algorithms, especially in high traffic areas.
基金supported by the Natural Science Foundation of China under Grant 61873017 and Grant 61473016in part by the Beijing Natural Science Foundation under Grant Z180005supported in part by the National Research Foundation of South Africa under Grant 113340in part by the Oppenheimer Memorial Trust Grant
文摘This paper presents a distributed optimization strategy for large-scale traffic network based on fog computing. Different from the traditional cloud-based centralized optimization strategy, the fog-based distributed optimization strategy distributes its computing tasks to individual sub-processors, thus significantly reducing computation time. A traffic model is built and a series of communication rules between subsystems are set to ensure that the entire transportation network can be globally optimized while the subsystem is achieving its local optimization. Finally, this paper numerically simulates the operation of the traffic network by mixed-Integer programming, also, compares the advantages and disadvantages of the two optimization strategies.
文摘In this paper, performance of three classifiers for classification of five mental tasks were investigated. Wavelet Packet Transform (WPT) was used for feature extraction of the relevant frequency bands from raw Electroencephalograph (EEG) signal. The three classifiers namely used were Multilayer Back propagation Neural Network, Support Vector Machine and Radial Basis Function Neural Network. In MLP-BP NN five training methods used were a) Gradient Descent Back Propagation b) Levenberg-Marquardt c) Resilient Back Propagation d) Conjugate Learning Gradient Back Propagation and e) Gradient Descent Back Propagation with movementum.
基金supported byNationalNatural Science Foundation of China,GrantNo.62402046the Beijing Forestry University Science and Technology Innovation Project under Grant No.BLX202358.
文摘Long-term traffic flow prediction is a crucial component of intelligent transportation systems within intelligent networks,requiring predictive models that balance accuracy with low-latency and lightweight computation to optimize trafficmanagement and enhance urban mobility and sustainability.However,traditional predictivemodels struggle to capture long-term temporal dependencies and are computationally intensive,limiting their practicality in real-time.Moreover,many approaches overlook the periodic characteristics inherent in traffic data,further impacting performance.To address these challenges,we introduce ST-MambaGCN,a State-Space-Based Spatio-Temporal Graph Convolution Network.Unlike conventionalmodels,ST-MambaGCN replaces the temporal attention layer withMamba,a state-space model that efficiently captures long-term dependencies with near-linear computational complexity.The model combines Chebyshev polynomial-based graph convolutional networks(GCN)to explore spatial correlations.Additionally,we incorporate a multi-temporal feature capture mechanism,where the final integrated features are generated through the Hadamard product based on learnable parameters.This mechanism explicitly models shortterm,daily,and weekly traffic patterns to enhance the network’s awareness of traffic periodicity.Extensive experiments on the PeMS04 and PeMS08 datasets demonstrate that ST-MambaGCN significantly outperforms existing benchmarks,offering substantial improvements in both prediction accuracy and computational efficiency for long-term traffic flow prediction.
文摘The most important elements of “intellectual networks” (Smart Grid) are the systems of monitoring the parameters of electrical equipment. Information-measuring systems (IMS), which described in this paper, were proposed to use together with rapid digital protection against short-circuit regimes in transformer windings. This paper presents an application’s experience of LVI-testing, some results of the use of Frequency Response Analysis (FRA) to check the condition of transformer windings and infra-red control results of electrical equipment. The LVI method and short-circuit inductive reactance measurements are sensitive for detecting such faults as radial, axial winding deformations, a twisting of low-voltage or regulating winding, a losing of winding’s pressing and others.
基金Supported by the Support Program of the National 12th Five Year-Plan of China(2015BAK25B03)
文摘Accurate short-term traffic flow prediction plays a crucial role in intelligent transportation system (ITS), because it can assist both traffic authorities and individual travelers make better decisions. Previous researches mostly focus on shallow traffic prediction models, which performances were unsatisfying since short-term traffic flow exhibits the characteristics of high nonlinearity, complexity and chaos. Taking the spatial and temporal correlations into consideration, a new traffic flow prediction method is proposed with the basis on the road network topology and gated recurrent unit (GRU). This method can help researchers without professional traffic knowledge extracting generic traffic flow features effectively and efficiently. Experiments are conducted by using real traffic flow data collected from the Caltrans Performance Measurement System (PEMS) database in San Diego and Oakland from June 15, 2017 to September 27, 2017. The results demonstrate that our method outperforms other traditional approaches in terms of mean absolute percentage error (MAPE), symmetric mean absolute percentage error (SMAPE) and root mean square error (RMSE).
基金National Natural Science Foundation of China, No.40371044 No.70573053
文摘In a given district, the accessibility of any point should be the synthetically evaluation of the internal and external accessibilities. Using MapX component and Delphi, the author presents an information system to calculate and analyze regional accessibility according to the shortest travel time, generating thus a mark diffusing figure. Based on land traffic network, this paper assesses the present and the future regional accessibilities of sixteen major cities in the Yangtze River Delta. The result shows that the regional accessibility of the Yangtze River Delta presents a fan with Shanghai as its core. The top two most accessible cities are Shanghai and Jiaxing, and the bottom two ones are Taizhou （Zhejiang province） and Nantong With the construction of Sutong Bridge, Hangzhouwan Bridge and Zhoushan Bridge, the regional internal accessibility of all cities will be improved. Especially for Shaoxing, Ningbo and Taizhou （Jiangsu province）, the regional internal accessibility will be decreased by one hour, and other cities will be shortened by about 25 minutes averagely. As the construction of Yangkou Harbor in Nantong, the regional external accessibility of the harbor cities in Jiangsu province will be speeded up by about one hour.
文摘We consider the extension of network lifetime of battery driven wireless sensor networks by splitting the sensing area into uniform clusters and implementing heterogeneous modulation schemes at different members of the clusters. A cross-layer optimization has been proposed to reduce total energy expenditure of the network;at network layer, routing is done through uniform clusters;at MAC layer, each sensor node of the cluster is assigned fixed or variable time slots and at physical layer different member of the clusters is assigned different modulation techniques. MATLAB simulation proved substantial network lifetime gains.
文摘The concept of Network Centric Therapy represents an amalgamation of wearable and wireless inertial sensor systems and machine learning with access to a Cloud computing environment. The advent of Network Centric Therapy is highly relevant to the treatment of Parkinson’s disease through deep brain stimulation. Originally wearable and wireless systems for quantifying Parkinson’s disease involved the use a smartphone to quantify hand tremor. Although originally novel, the smartphone has notable issues as a wearable application for quantifying movement disorder tremor. The smartphone has evolved in a pathway that has made the smartphone progressively more cumbersome to mount about the dorsum of the hand. Furthermore, the smartphone utilizes an inertial sensor package that is not certified for medical analysis, and the trial data access a provisional Cloud computing environment through an email account. These concerns are resolved with the recent development of a conformal wearable and wireless inertial sensor system. This conformal wearable and wireless system mounts to the hand with the profile of a bandage by adhesive and accesses a secure Cloud computing environment through a segmented wireless connectivity strategy involving a smartphone and tablet. Additionally, the conformal wearable and wireless system is certified by the FDA of the United States of America for ascertaining medical grade inertial sensor data. These characteristics make the conformal wearable and wireless system uniquely suited for the quantification of Parkinson’s disease treatment through deep brain stimulation. Preliminary evaluation of the conformal wearable and wireless system is demonstrated through the differentiation of deep brain stimulation set to “On” and “Off” status. Based on the robustness of the acceleration signal, this signal was selected to quantify hand tremor for the prescribed deep brain stimulation settings. Machine learning classification using the Waikato Environment for Knowledge Analysis (WEKA) was applied using the multilayer perceptron neural network. The multilayer perceptron neural network achieved considerable classification accuracy for distinguishing between the deep brain stimulation system set to “On” and “Off” status through the quantified acceleration signal data obtained by this recently developed conformal wearable and wireless system. The research achievement establishes a progressive pathway to the future objective of achieving deep brain stimulation capabilities that promote closed-loop acquisition of configuration parameters that are uniquely optimized to the individual through extrinsic means of a highly conformal wearable and wireless inertial sensor system and machine learning with access to Cloud computing resources.
文摘Traffic network is an importance asp ect of researching controllable parameters of an urban spatial morpholo-gy.Based on GIS,traffic network str ucture complexity can be understood by using fractal geometry in which th e length-radius dimension describes change of network density,and ramification-radius dimension describes complexity and accessibility of urban network.It i s propitious to analyze urban traffic network and to understand dynamic c hange process of traffic network using expanding f ractal-dimension quantification.Meanwhile the length-radius dimension and ramifica-tion-radius dimension could be rega rd as reference factor of quantitative describing urban traffic network.
基金supported by the National Natural Science Foundation of China (Grant No. 60964006)the Scientific Research Innovation Fund Project for Graduate Student of Hunan,China (Grant No.3340-74236000003)the Open Program of State Key Laboratory of Rail Traffic Control and Safety (Beijing Jiaotong University),China (Grant No.2007K-0027)
文摘The flourishing complex network theory has aroused increasing interest in studying the properties of real-world networks. Based on the traffic network of Chang-Zhu Tan urban agglomeration in central China, some basic network topological characteristics were computed with data collected from local traffic maps, which showed that the traffic networks were small-world networks with strong resilience against failure; more importantly, the investigations of as- sortativity coefficient and average nearestlneighbour degree implied the disassortativity of the traffic networks. Since traffic network hierarchy as an important basic property has been neither studied intensively nor proved quantitatively, the authors are inspired to analyse traffic network hierarchy with disassortativity and to finely characterize hierarchy in the traffic networks by using the n-degree-n-clustering coefficient relationship. Through numerical results and analyses an exciting conclusion is drawn that the traffic networks exhibit a significant hierarchy, that is, the traffic networks are proved to be hierarchically organized. The result provides important information and theoretical groundwork for optimal transport planning.
基金funded by the Ministry of Higher Education(MoHE)Malaysia through the Fundamental Research Grant Scheme—Early Career Researcher(FRGS-EC),grant number FRGSEC/1/2024/ICT02/UNIMAP/02/8.
文摘critical for guiding treatment and improving patient outcomes.Traditional molecular subtyping via immuno-histochemistry(IHC)test is invasive,time-consuming,and may not fully represent tumor heterogeneity.This study proposes a non-invasive approach using digital mammography images and deep learning algorithm for classifying breast cancer molecular subtypes.Four pretrained models,including two Convolutional Neural Networks(MobileNet_V3_Large and VGG-16)and two Vision Transformers(ViT_B_16 and ViT_Base_Patch16_Clip_224)were fine-tuned to classify images into HER2-enriched,Luminal,Normal-like,and Triple Negative subtypes.Hyperparameter tuning,including learning rate adjustment and layer freezing strategies,was applied to optimize performance.Among the evaluated models,ViT_Base_Patch16_Clip_224 achieved the highest test accuracy(94.44%),with equally high precision,recall,and F1-score of 0.94,demonstrating excellent generalization.MobileNet_V3_Large achieved the same accuracy but showed less training stability.In contrast,VGG-16 recorded the lowest performance,indicating a limitation in its generalizability for this classification task.The study also highlighted the superior performance of the Vision Transformer models over CNNs,particularly due to their ability to capture global contextual features and the benefit of CLIP-based pretraining in ViT_Base_Patch16_Clip_224.To enhance clinical applicability,a graphical user interface(GUI)named“BCMS Dx”was developed for streamlined subtype prediction.Deep learning applied to mammography has proven effective for accurate and non-invasive molecular subtyping.The proposed Vision Transformer-based model and supporting GUI offer a promising direction for augmenting diagnostic workflows,minimizing the need for invasive procedures,and advancing personalized breast cancer management.
文摘Over the last few years, the Internet of Things (IoT) has become an omnipresent term. The IoT expands the existing common concepts, anytime and anyplace to the connectivity for anything. The proliferation in IoT offers opportunities but may also bear risks. A hitherto neglected aspect is the possible increase in power consumption as smart devices in IoT applications are expected to be reachable by other devices at all times. This implies that the device is consuming electrical energy even when it is not in use for its primary function. Many researchers’ communities have started addressing storage ability like cache memory of smart devices using the concept called—Named Data Networking (NDN) to achieve better energy efficient communication model. In NDN, memory or buffer overflow is the common challenge especially when internal memory of node exceeds its limit and data with highest degree of freshness may not be accommodated and entire scenarios behaves like a traditional network. In such case, Data Caching is not performed by intermediate nodes to guarantee highest degree of freshness. On the periodical updates sent from data producers, it is exceedingly demanded that data consumers must get up to date information at cost of lease energy. Consequently, there is challenge in maintaining tradeoff between freshness energy consumption during Publisher-Subscriber interaction. In our work, we proposed the architecture to overcome cache strategy issue by Smart Caching Algorithm for improvement in memory management and data freshness. The smart caching strategy updates the data at precise interval by keeping garbage data into consideration. It is also observed from experiment that data redundancy can be easily obtained by ignoring/dropping data packets for the information which is not of interest by other participating nodes in network, ultimately leading to optimizing tradeoff between freshness and energy required.
文摘With the increasing requirements of the multicast services in the whole data traffic service, the optical multicast technology becomes a key technology supporting wide bandwidth and high speed multicasting communication. The transmission efficiency, capacity and robustness of optical multicast network can be further improved by introducing network coding technology into optical multicast networks. Meanwhile, facing to demand of emerging rate-variable multi-granularity multicast service, a multi-path transmission scheme based on network coding for routing and spectrum allocation (RSA) is proposed. It can not only allocate spectrum resources effectively and flexibly for various-rate multicast traffic, but also balance the network load, improve network throughput and reduce transmission blocking rate. In this paper, RSA problem is decomposed into two subproblems, namely routing allocation based on network coding and spectrum allocation based on maximum spectrum first (MSF) strategy, which are solved sequentially. Simulation experiments are carried out to analyze transmission performance with proposed RSA scheme. The simulation results show that the proposed RSA mechanism can allocate spectrum resources efficiently and flexibly for multi-granularity multicast traffic. Compared with RSA schemes based on shortest path tree (SPT) and minimal spanning tree (MST), the proposed RSA scheme is more efficient for spectrum resource utilization and load balancing, and spectrum resource is saved more than 20%.
