Identifying hotspot words associated with disease symptoms is paramount for disease prevention and diagnosis. In this study, we propose a novel method for hotspot word recognition in disease symptoms, integrating contextual weights and co-occurrence information. First, we establish the MDERank model, which incorporates contextual weights. This model identifies words that align well with comprehensive weights, forming a collection of disease symptom words. Next, we construct a graph network for disease symptom words within each time period. Utilizing the graph attention network model, we incorporate word co-occurrence degree to identify potential hotspot words associated with disease symptoms. We conducted experiments using user-generated posts from the Dingxiangyuan Forum as our data source. The results demonstrate that our proposed method significantly improves the extraction quality of disease symptom words compared to other existing methods. Furthermore, the performance of our constructed recognition model for disease symptom hotspot words surpasses that of alternative models.
{"title":"Recognition of Hotspot Words for Disease Symptoms Incorporating Contextual Weight and Co-Occurrence Degree","authors":"Qingxue Liu, Lifang Wang, Yuan Chang, Jixuan Zhang","doi":"10.1155/2024/7863381","DOIUrl":"https://doi.org/10.1155/2024/7863381","url":null,"abstract":"Identifying hotspot words associated with disease symptoms is paramount for disease prevention and diagnosis. In this study, we propose a novel method for hotspot word recognition in disease symptoms, integrating contextual weights and co-occurrence information. First, we establish the MDERank model, which incorporates contextual weights. This model identifies words that align well with comprehensive weights, forming a collection of disease symptom words. Next, we construct a graph network for disease symptom words within each time period. Utilizing the graph attention network model, we incorporate word co-occurrence degree to identify potential hotspot words associated with disease symptoms. We conducted experiments using user-generated posts from the Dingxiangyuan Forum as our data source. The results demonstrate that our proposed method significantly improves the extraction quality of disease symptom words compared to other existing methods. Furthermore, the performance of our constructed recognition model for disease symptom hotspot words surpasses that of alternative models.","PeriodicalId":22091,"journal":{"name":"Scientific Programming","volume":"44 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140575200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Modelica is a very powerful language to simulate a very large set of systems, including electrical, thermal, mechanical, fluidic, control, and has already been used very extensively for several purposes, as the several Modelica conferences testify. Despite of this large literature, no paper seems to be available regarding the use of Modelica for real-time applications or hardware-in-the loop (HIL). This is a field where applications may be very fruitful. In this paper, the possibility of creating mixed software–hardware experiences (i.e., HIL), through combination of a Modelica program, the related simulation tool, a LabVIEW program, and the corresponding hardware is demonstrated. This demonstration is made using as an example a partial simulator of an electric vehicle running in a stand-alone PC, which communicates via User Datagram Protocol (UDP) packets with another PC running the LabVIEW program, which in turn is physically connected with the hardware-under-test. The obtained results are satisfying, given the inherent delay times due to the UDP communication.
{"title":"An Example of Modelica–LabVIEW Communication Usage to Implement Hardware-in-the-Loop Experiments","authors":"Massimo Ceraolo, Mirko Marracci","doi":"10.1155/2024/9648349","DOIUrl":"https://doi.org/10.1155/2024/9648349","url":null,"abstract":"Modelica is a very powerful language to simulate a very large set of systems, including electrical, thermal, mechanical, fluidic, control, and has already been used very extensively for several purposes, as the several Modelica conferences testify. Despite of this large literature, no paper seems to be available regarding the use of Modelica for real-time applications or hardware-in-the loop (HIL). This is a field where applications may be very fruitful. In this paper, the possibility of creating mixed software–hardware experiences (i.e., HIL), through combination of a Modelica program, the related simulation tool, a LabVIEW program, and the corresponding hardware is demonstrated. This demonstration is made using as an example a partial simulator of an electric vehicle running in a stand-alone PC, which communicates via User Datagram Protocol (UDP) packets with another PC running the LabVIEW program, which in turn is physically connected with the hardware-under-test. The obtained results are satisfying, given the inherent delay times due to the UDP communication.","PeriodicalId":22091,"journal":{"name":"Scientific Programming","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139689666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The quality of collision detection algorithm directly affects the performance of the whole simulation system. To address the low efficiency and low accuracy in detecting the collisions of flexible cloths in virtual environments, this paper proposes an oriented bounding box (OBB) algorithm with a simplified model, tree structure for a root-node double bounding box, and continuous collision detection algorithm incorporating an OpenNN-based neural network optimization. First, for objects interacting with the cloths with more complex modeling, the model is simplified with a surface simplification algorithm based on the quadric error metrics, and the simplified model is used to construct an OBB. Second, a bounding box technique commonly used for collision detection is improved, and a root-node double bounding box algorithm is proposed to reduce the construction time for the bounding box. Finally, neural networks are used to optimize the continuous collision detection algorithm, as neural networks can efficiently process large amounts of data and remove disjoint collision pairs. An experiment shows that the construction of an OBB using the simplified model is almost identical to that of the original model, but the taken to construct the OBB is reduced by a factor of approximately 2.7. For the same cloth, it takes 5.51%–11.32% less time to run the root-node double bounding box algorithm than the traditional-hybrid bounding box algorithm. With an average removal rate nearly identical to that of the traditional filtering method, the elapsed time is reduced by 7%–11% by using the continuous collision detection algorithm based on an OpenNN neural network optimization. The simulation results are realistic and in line with the requirements for real-time cloth simulations.
{"title":"Deep Neural Network-Based Cloth Collision Detection Algorithm","authors":"Yanxia Jin, Zhiru Shi, Jing Yang, Yabian Liu, Xingyu Qiao, Ling Zhang","doi":"10.1155/2024/7889278","DOIUrl":"https://doi.org/10.1155/2024/7889278","url":null,"abstract":"The quality of collision detection algorithm directly affects the performance of the whole simulation system. To address the low efficiency and low accuracy in detecting the collisions of flexible cloths in virtual environments, this paper proposes an oriented bounding box (OBB) algorithm with a simplified model, tree structure for a root-node double bounding box, and continuous collision detection algorithm incorporating an OpenNN-based neural network optimization. First, for objects interacting with the cloths with more complex modeling, the model is simplified with a surface simplification algorithm based on the quadric error metrics, and the simplified model is used to construct an OBB. Second, a bounding box technique commonly used for collision detection is improved, and a root-node double bounding box algorithm is proposed to reduce the construction time for the bounding box. Finally, neural networks are used to optimize the continuous collision detection algorithm, as neural networks can efficiently process large amounts of data and remove disjoint collision pairs. An experiment shows that the construction of an OBB using the simplified model is almost identical to that of the original model, but the taken to construct the OBB is reduced by a factor of approximately 2.7. For the same cloth, it takes 5.51%–11.32% less time to run the root-node double bounding box algorithm than the traditional-hybrid bounding box algorithm. With an average removal rate nearly identical to that of the traditional filtering method, the elapsed time is reduced by 7%–11% by using the continuous collision detection algorithm based on an OpenNN neural network optimization. The simulation results are realistic and in line with the requirements for real-time cloth simulations.","PeriodicalId":22091,"journal":{"name":"Scientific Programming","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139481876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sci-Tech journals have long served as platforms for academic communication and the collision of ideas, facilitating advanced inventions and major discoveries in science. The speed of development and future prospects of a field in the current era can often be reflected by the quality and quantity of cutting-edge papers published in Sci-Tech journals within that field. Currently, the impact factor of Sci-Tech journals is a widely recognized journal evaluation index that comprehensively reflects the quality and influence of the journals under evaluation. However, traditional journal evaluation methods based on statistical formulas, while relatively simple and fast, have certain limitations. They are not comprehensive enough and do not support the comparison between journals from different disciplines. In recent times, researchers have delved into using multiple suitable indicators for comprehensive journal evaluation, attempting to understand the role each indicator plays in the evaluation process, such as the rank sum ratio. Our paper presents a new dataset constructed from data from journals across various fields obtained from the China Wanfang Literature Platform. We endeavor to explore a series of novel journal evaluation methods based on machine learning, including deep learning models. With these 9 methods, we aim to determine the contribution of 17 journal evaluation indicators to the impact factor and identify important factors that can further enhance the quality and influence of Sci-Tech journals, which has great guiding significance for the future development of journals.
{"title":"Study on Contribution of Different Journal Evaluation Indicators to Impact Factor Based on Machine Learning","authors":"Yan Ma, Yingkun Han, Haonan Zeng, Lei Ma","doi":"10.1155/2023/3198385","DOIUrl":"https://doi.org/10.1155/2023/3198385","url":null,"abstract":"Sci-Tech journals have long served as platforms for academic communication and the collision of ideas, facilitating advanced inventions and major discoveries in science. The speed of development and future prospects of a field in the current era can often be reflected by the quality and quantity of cutting-edge papers published in Sci-Tech journals within that field. Currently, the impact factor of Sci-Tech journals is a widely recognized journal evaluation index that comprehensively reflects the quality and influence of the journals under evaluation. However, traditional journal evaluation methods based on statistical formulas, while relatively simple and fast, have certain limitations. They are not comprehensive enough and do not support the comparison between journals from different disciplines. In recent times, researchers have delved into using multiple suitable indicators for comprehensive journal evaluation, attempting to understand the role each indicator plays in the evaluation process, such as the rank sum ratio. Our paper presents a new dataset constructed from data from journals across various fields obtained from the China Wanfang Literature Platform. We endeavor to explore a series of novel journal evaluation methods based on machine learning, including deep learning models. With these 9 methods, we aim to determine the contribution of 17 journal evaluation indicators to the impact factor and identify important factors that can further enhance the quality and influence of Sci-Tech journals, which has great guiding significance for the future development of journals.","PeriodicalId":22091,"journal":{"name":"Scientific Programming","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139068439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Breast cancer is a highly prevalent cancer. Triple-negative breast cancer (TNBC) is more likely to recur and metastasize than other subtypes of breast cancer. Research on the treatment of TNBC is of great importance, and accurate segmentation of the breast lesion area is an important step in the treatment of TNBC. Currently, the gold standard for tumor segmentation is still sketched manually by doctors, which requires expertise in the field of medical imaging and consumes a great deal of doctors’ time and energy. Automatic segmentation of breast cancer not only reduces the burden of doctors but also improves work efficiency. Therefore, it is of great significance to study the automatic segmentation technique for breast cancer lesion regions. In this paper, a deep-learning-based automatic segmentation algorithm for TNBC images is proposed. The experimental data were dynamic contrast-enhanced magnetic resonance imaging TNBC dataset provided by the Cancer Hospital of Zhengzhou University. The experiments were analyzed by comparing several models with UNet, Attention-UNet, ResUNet, and SegNet and using evaluation indexes such as Dice score and Iou. Compared to UNet, Attention-UNet, ResUNet, and SegNet, the proposed method improved the Dice score by 2.1%, 1.54%, 0.88%, and 9.65%, respectively. The experimental results show that the proposed deep-learning-based TNBC image segmentation model can effectively improve the segmentation performance of TNBC tumors.
{"title":"Image Segmentation of Triple-Negative Breast Cancer by Incorporating Multiscale and Parallel Attention Mechanisms","authors":"Qian Zhang, Junbiao Xiao, Bingjie Zheng","doi":"10.1155/2023/6629189","DOIUrl":"https://doi.org/10.1155/2023/6629189","url":null,"abstract":"Breast cancer is a highly prevalent cancer. Triple-negative breast cancer (TNBC) is more likely to recur and metastasize than other subtypes of breast cancer. Research on the treatment of TNBC is of great importance, and accurate segmentation of the breast lesion area is an important step in the treatment of TNBC. Currently, the gold standard for tumor segmentation is still sketched manually by doctors, which requires expertise in the field of medical imaging and consumes a great deal of doctors’ time and energy. Automatic segmentation of breast cancer not only reduces the burden of doctors but also improves work efficiency. Therefore, it is of great significance to study the automatic segmentation technique for breast cancer lesion regions. In this paper, a deep-learning-based automatic segmentation algorithm for TNBC images is proposed. The experimental data were dynamic contrast-enhanced magnetic resonance imaging TNBC dataset provided by the Cancer Hospital of Zhengzhou University. The experiments were analyzed by comparing several models with UNet, Attention-UNet, ResUNet, and SegNet and using evaluation indexes such as Dice score and Iou. Compared to UNet, Attention-UNet, ResUNet, and SegNet, the proposed method improved the Dice score by 2.1%, 1.54%, 0.88%, and 9.65%, respectively. The experimental results show that the proposed deep-learning-based TNBC image segmentation model can effectively improve the segmentation performance of TNBC tumors.","PeriodicalId":22091,"journal":{"name":"Scientific Programming","volume":"239 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138686412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Lin Deng, Yaping Wu, Xianjun Chen, Tian Li, Yun Chen
In the bidding process of government investment engineering projects, collusion between the government and bidders occurs repeatedly, which seriously affects the quality of engineering projects and the effectiveness of the government investment. Therefore, it is necessary to analyze and discuss the collusion between the government and bidders in government investment engineering projects, so as to provide a healthy and sustainable environment for the government investment engineering bidding market. There are two main types of collusion in engineering bidding: horizontal collusion and vertical collusion, and this paper focuses on the vertical collusion process in the engineering bidding process. A conceptual framework of the grey interest chain based on three stages of benefit creation, benefit distribution, and benefit realization was established, 15 major nodes in the grey interest chain were identified, and a grey interest chain control model was constructed, which further identified and classified the nodes into four levels: key nodes, important nodes, general nodes, and unimportant nodes. Finally, through the application of the model in the case, measures such as establishing a cracking mechanism for grey resource integration, increasing the supervision of grey interest chain, and strengthening post-bid audit are proposed. Measures such as including the preparation of bidding documents into the work assessment system and entrusting consulting units or third parties to prepare bidding documents are proposed to establish a crack mechanism for grey resource integration. In the benefit distribution stage, the penalties for the government and the bidders can be appropriately increased, the responsibilities of enterprises and project leaders can be implemented in the system on a reciprocal basis, and a perfect reputation mechanism information can be established. At the stage of benefit realization, the bidding system should be improved and post-bid audit should be strengthened to increase the difficulty of grey benefit realization. This paper will provide a reference for the prevention and governance of vertical collusion in bidding and tendering.
{"title":"Grey Interest Chain Identification and Control Model for Government Investment Engineering Projects Based on Node Identification","authors":"Lin Deng, Yaping Wu, Xianjun Chen, Tian Li, Yun Chen","doi":"10.1155/2023/3372820","DOIUrl":"https://doi.org/10.1155/2023/3372820","url":null,"abstract":"In the bidding process of government investment engineering projects, collusion between the government and bidders occurs repeatedly, which seriously affects the quality of engineering projects and the effectiveness of the government investment. Therefore, it is necessary to analyze and discuss the collusion between the government and bidders in government investment engineering projects, so as to provide a healthy and sustainable environment for the government investment engineering bidding market. There are two main types of collusion in engineering bidding: horizontal collusion and vertical collusion, and this paper focuses on the vertical collusion process in the engineering bidding process. A conceptual framework of the grey interest chain based on three stages of benefit creation, benefit distribution, and benefit realization was established, 15 major nodes in the grey interest chain were identified, and a grey interest chain control model was constructed, which further identified and classified the nodes into four levels: key nodes, important nodes, general nodes, and unimportant nodes. Finally, through the application of the model in the case, measures such as establishing a cracking mechanism for grey resource integration, increasing the supervision of grey interest chain, and strengthening post-bid audit are proposed. Measures such as including the preparation of bidding documents into the work assessment system and entrusting consulting units or third parties to prepare bidding documents are proposed to establish a crack mechanism for grey resource integration. In the benefit distribution stage, the penalties for the government and the bidders can be appropriately increased, the responsibilities of enterprises and project leaders can be implemented in the system on a reciprocal basis, and a perfect reputation mechanism information can be established. At the stage of benefit realization, the bidding system should be improved and post-bid audit should be strengthened to increase the difficulty of grey benefit realization. This paper will provide a reference for the prevention and governance of vertical collusion in bidding and tendering.","PeriodicalId":22091,"journal":{"name":"Scientific Programming","volume":"120 24","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134956890","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Credit-risk prediction is one of the challenging tasks in the banking industry. In this study, a hybrid convolutional neural network—support vector machine/random forest/decision tree (CNN—SVM/RF/DT) model has been proposed for efficient credit-risk prediction. We proposed four classifiers to develop the model. A fully connected layer with soft-max trained using an end-to-end process makes up the first classifier and by deleting the final fully connected with soft-max layer, the other three classifiers—a SVM, RF, and DT classifier stacked after the flattening layer. Different parameter values were considered and fine-tuned throughout testing to select appropriate parameters. In accordance with the experimental findings, a fully connected CNN and a hybrid CNN with SVM, DT, and RF, respectively, achieved a prediction performance of 86.70%, 98.60%, 96.90%, and 95.50%. According to the results, our suggested hybrid method exceeds the fully connected CNN in its ability to predict credit risk.
{"title":"Credit-Risk Prediction Model Using Hybrid Deep—Machine-Learning Based Algorithms","authors":"Tamiru Melese, Tesfahun Berhane, Abdu Mohammed, Assaye Walelgn","doi":"10.1155/2023/6675425","DOIUrl":"https://doi.org/10.1155/2023/6675425","url":null,"abstract":"Credit-risk prediction is one of the challenging tasks in the banking industry. In this study, a hybrid convolutional neural network—support vector machine/random forest/decision tree (CNN—SVM/RF/DT) model has been proposed for efficient credit-risk prediction. We proposed four classifiers to develop the model. A fully connected layer with soft-max trained using an end-to-end process makes up the first classifier and by deleting the final fully connected with soft-max layer, the other three classifiers—a SVM, RF, and DT classifier stacked after the flattening layer. Different parameter values were considered and fine-tuned throughout testing to select appropriate parameters. In accordance with the experimental findings, a fully connected CNN and a hybrid CNN with SVM, DT, and RF, respectively, achieved a prediction performance of 86.70%, 98.60%, 96.90%, and 95.50%. According to the results, our suggested hybrid method exceeds the fully connected CNN in its ability to predict credit risk.","PeriodicalId":22091,"journal":{"name":"Scientific Programming","volume":"12 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135589613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Aiming at the problems of large data dimension, more redundant data, and low accuracy in network traffic anomaly detection, a network traffic anomaly detection model (FR-APPSO BiLSTM) based on feature reduction and bidirectional long short-term memory (LSTM) neural network optimization is proposed. First, the feature dimensions are divided by hierarchical clustering according to the similarity distance between data features, and the features with high correlation are divided into the same feature subset. Second, an automatic encoder is used to reduce each feature subset, eliminating redundant information, and reducing the computational complexity of the detection data. Then, a particle swarm optimization algorithm based on adaptive updating of variables and dynamic adjustment of parameters (APPSO) is proposed, which is used to optimize the parameters of the bidirectional LSTM neural network (BiLSTM). Finally, the optimized BiLSTM is used as a classifier to model network traffic anomaly detection using the reduced feature data. Experiments based on NSL-KDD, UNSW-NB15, and CICIDS-2017 datasets show that the proposed FR-APPSO-BiLSTM model can effectively reduce data features, improve the accuracy of detection, and the performance of network traffic anomaly detection.
{"title":"Network Traffic Anomaly Detection Model Based on Feature Reduction and Bidirectional LSTM Neural Network Optimization","authors":"Hanqing Jiang, Shaopei Ji, Guanghui He, Xiaohu Li","doi":"10.1155/2023/2989533","DOIUrl":"https://doi.org/10.1155/2023/2989533","url":null,"abstract":"Aiming at the problems of large data dimension, more redundant data, and low accuracy in network traffic anomaly detection, a network traffic anomaly detection model (FR-APPSO BiLSTM) based on feature reduction and bidirectional long short-term memory (LSTM) neural network optimization is proposed. First, the feature dimensions are divided by hierarchical clustering according to the similarity distance between data features, and the features with high correlation are divided into the same feature subset. Second, an automatic encoder is used to reduce each feature subset, eliminating redundant information, and reducing the computational complexity of the detection data. Then, a particle swarm optimization algorithm based on adaptive updating of variables and dynamic adjustment of parameters (APPSO) is proposed, which is used to optimize the parameters of the bidirectional LSTM neural network (BiLSTM). Finally, the optimized BiLSTM is used as a classifier to model network traffic anomaly detection using the reduced feature data. Experiments based on NSL-KDD, UNSW-NB15, and CICIDS-2017 datasets show that the proposed FR-APPSO-BiLSTM model can effectively reduce data features, improve the accuracy of detection, and the performance of network traffic anomaly detection.","PeriodicalId":22091,"journal":{"name":"Scientific Programming","volume":"117 3‐4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135818531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Retracted: Ice and Snow Sports Education Based on 5G Cloud Computing to Improve the Social Adaptability of Southern University Students","authors":"Scientific Programming","doi":"10.1155/2023/9867894","DOIUrl":"https://doi.org/10.1155/2023/9867894","url":null,"abstract":"<jats:p />","PeriodicalId":22091,"journal":{"name":"Scientific Programming","volume":"1 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135270880","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Retracted: Research on Network Layer Recursive Reduction Model Compression for Image Recognition","authors":"Scientific Programming","doi":"10.1155/2023/9896261","DOIUrl":"https://doi.org/10.1155/2023/9896261","url":null,"abstract":"<jats:p />","PeriodicalId":22091,"journal":{"name":"Scientific Programming","volume":"65 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135270621","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：