A DMVOCC-MVDA （distributed multiversion optimistic concurrency control with multiversion dynamic adjustment） protocol was presented to process mobile distributed real-time transaction in mobile broadcast environment...A DMVOCC-MVDA （distributed multiversion optimistic concurrency control with multiversion dynamic adjustment） protocol was presented to process mobile distributed real-time transaction in mobile broadcast environments. At the mobile hosts, all transactions perform local pre-validation. The local pre-validation process is carried out against the committed transactions at the server in the last broadcast cycle. Transactions that survive in local pre-validation must be submitted to the server for local final validation. The new protocol eliminates conflicts between mobile read-only and mobile update transactions, and resolves data conflicts flexibly by using multiversion dynamic adjustment of serialization order to avoid unnecessary restarts of transactions. Mobile read-only transactions can be committed with no-blocking, and respond time of mobile read-only transactions is greatly shortened. The tolerance of mobile transactions of disconnections from the broadcast channel is increased. In global validation mobile distributed transactions have to do check to ensure distributed serializability in all participants. The simulation results show that the new concurrency control protocol proposed offers better performance than other protocols in terms of miss rate, restart rate, commit rate. Under high work load （think time is ls） the miss rate of DMVOCC-MVDA is only 14.6%, is significantly lower than that of other protocols. The restart rate of DMVOCC-MVDA is only 32.3%, showing that DMVOCC-MVDA can effectively reduce the restart rate of mobile transactions. And the commit rate of DMVOCC-MVDA is up to 61.2%, which is obviously higher than that of other protocols.展开更多
This paper formally defines and analyses the new notion of correctness called quasi serializability, and then outlines corresponding concurrency control protocol QDHP for distributed real-time databases. Finally, thro...This paper formally defines and analyses the new notion of correctness called quasi serializability, and then outlines corresponding concurrency control protocol QDHP for distributed real-time databases. Finally, through a series of simulation studies, it shows that using the new concurrency control protocol the performance of distributed real-time databases can be much improved.展开更多
In parallel real-time database systems, concurrency control protocols must satisfy time constraints as well as the integrity constraints. The authors present a validation concurrency control(VCC) protocol, which can e...In parallel real-time database systems, concurrency control protocols must satisfy time constraints as well as the integrity constraints. The authors present a validation concurrency control(VCC) protocol, which can enhance the performance of real-time concurrency control mechanism by reducing the number of transactions that might miss their deadlines, and compare the performance of validation concurrency control protocol with that of HP2PL(High priority two phase locking) protocol and OCC-TI-WAIT-50(Optimistic concurrency control-time interval-wait-50) protocol under shared-disk architecture by simulation. The simulation results reveal that the protocol the author presented can effectively reduce the number of transactions restarting which might miss their deadlines and performs better than HP2PL and OCC-TI-WAIT-50. It works well when arrival rate of transaction is lesser than threshold. However, due to resource contention the percentage of missing deadline increases sharply when arrival rate is greater than the threshold.展开更多
Recovery performance in the event of failures is very important for distributed real-time database systems. This paper presents a time-cognizant logging-based crash recovery scheme （TCLCRS） that aims at distributed ...Recovery performance in the event of failures is very important for distributed real-time database systems. This paper presents a time-cognizant logging-based crash recovery scheme （TCLCRS） that aims at distributed real-time databases, which adopts a main memory database as its ground support. In our scheme, each site maintains a real-time log for local transactions and the subtransactions, which execute at the site, and execte local checkpointing independently. Log records are stored in non-volatile high- speed store, which is divided into four different partitions based on transaction classes. During restart recovery after a site crash, partitioned crash recovery strategy is adopted to ensure that the site can be brought up before the entire local secondary database is reloaded in main memory. The partitioned crash recovery strategy not only guarantees the internal consistency to be recovered, but also guarantee the temporal consistency and recovery of the sates of physical world influenced by uncommitted transactions. Combined with two- phase commit protocol, TCLCRS can guarantee failure atomicity of distributed real-time transactions.展开更多
Most of the proposed concurrency control protocols for real time database systems are based on serializability theorem. Owing to the unique characteristics of real time database applications and the importance of sa...Most of the proposed concurrency control protocols for real time database systems are based on serializability theorem. Owing to the unique characteristics of real time database applications and the importance of satisfying the timing constraints of transactions, serializability is too strong as a correctness criterion and not suitable for real time databases in most cases. On the other hand, relaxed serializability including epsilon serializability and similarity serializability can allow more real time transactions to satisfy their timing constraints, but database consistency may be sacrificed to some extent. We thus propose the use of weak serializability(WSR) that is more relaxed than conflicting serializability while database consistency is maintained. In this paper, we first formally define the new notion of correctness called weak serializability. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol WDHP(weak serializable distributed high priority protocol) is outlined for distributed real time databases, where a new lock mode called mask lock mode is proposed for simplifying the condition of global consistency. Finally, through a series of simulation studies, it is shown that using the new concurrency control protocol the performance of distributed real time databases can be greatly improved.展开更多
Storing the whole database in the main-memory is a common method to processreal-time transaction in real-time database systems. The recovery mechanism of Main-memory Real-timeDatabase Systems (MMRTDBS) should reflect ...Storing the whole database in the main-memory is a common method to processreal-time transaction in real-time database systems. The recovery mechanism of Main-memory Real-timeDatabase Systems (MMRTDBS) should reflect the characteristics of the main-memory database andreal-time database because their structures are quite different from other conventional databasesystems. In this paper, therefore, we propose a multi-level recovery mechanism for main-memoryreal-time database systems with Extendable Chained Bucket Hashing (ECBH). Owing to the occurrence ofreal-time data in real-time systems, we should also consider it in our recovery mechanism .According to our performance test, this mechanism can improve the transaction concurrency, reducingtransactions ' deadline missing rate.展开更多
Database systems have consistently been prime targets for cyber-attacks and threats due to the critical nature of the data they store.Despite the increasing reliance on database management systems,this field continues...Database systems have consistently been prime targets for cyber-attacks and threats due to the critical nature of the data they store.Despite the increasing reliance on database management systems,this field continues to face numerous cyber-attacks.Database management systems serve as the foundation of any information system or application.Any cyber-attack can result in significant damage to the database system and loss of sensitive data.Consequently,cyber risk classifications and assessments play a crucial role in risk management and establish an essential framework for identifying and responding to cyber threats.Risk assessment aids in understanding the impact of cyber threats and developing appropriate security controls to mitigate risks.The primary objective of this study is to conduct a comprehensive analysis of cyber risks in database management systems,including classifying threats,vulnerabilities,impacts,and countermeasures.This classification helps to identify suitable security controls to mitigate cyber risks for each type of threat.Additionally,this research aims to explore technical countermeasures to protect database systems from cyber threats.This study employs the content analysis method to collect,analyze,and classify data in terms of types of threats,vulnerabilities,and countermeasures.The results indicate that SQL injection attacks and Denial of Service(DoS)attacks were the most prevalent technical threats in database systems,each accounting for 9%of incidents.Vulnerable audit trails,intrusion attempts,and ransomware attacks were classified as the second level of technical threats in database systems,comprising 7%and 5%of incidents,respectively.Furthermore,the findings reveal that insider threats were the most common non-technical threats in database systems,accounting for 5%of incidents.Moreover,the results indicate that weak authentication,unpatched databases,weak audit trails,and multiple usage of an account were the most common technical vulnerabilities in database systems,each accounting for 9%of vulnerabilities.Additionally,software bugs,insecure coding practices,weak security controls,insecure networks,password misuse,weak encryption practices,and weak data masking were classified as the second level of security vulnerabilities in database systems,each accounting for 4%of vulnerabilities.The findings from this work can assist organizations in understanding the types of cyber threats and developing robust strategies against cyber-attacks.展开更多
In the Engine CAD application system engineering database management system (ECAD-EDBMS) is the kernel. ECAD-EDBMS can manage and process the multimedia such as graphics, data, text, sound, image and video. It provide...In the Engine CAD application system engineering database management system (ECAD-EDBMS) is the kernel. ECAD-EDBMS can manage and process the multimedia such as graphics, data, text, sound, image and video. It provides the integrated environment and more functions for many subsystems of ECAD and engine designers. So it improves the design efficiency.展开更多
Along with process control,perception represents the main function performed by the Edge Layer of an Internet of Things(IoT)network.Many of these networks implement various applications where the response time does no...Along with process control,perception represents the main function performed by the Edge Layer of an Internet of Things(IoT)network.Many of these networks implement various applications where the response time does not represent an important parameter.However,in critical applications,this parameter represents a crucial aspect.One important sensing device used in IoT designs is the accelerometer.In most applications,the response time of the embedded driver software handling this device is generally not analysed and not taken into account.In this paper,we present the design and implementation of a predictable real-time driver stack for a popular accelerometer and gyroscope device family.We provide clear justifications for why this response time is extremely important for critical applications in the acquisition process of such data.We present extensive measurements and experimental results that demonstrate the predictability of our solution,making it suitable for critical real-time systems.展开更多
Transportation systems are experiencing a significant transformation due to the integration of advanced technologies, including artificial intelligence and machine learning. In the context of intelligent transportatio...Transportation systems are experiencing a significant transformation due to the integration of advanced technologies, including artificial intelligence and machine learning. In the context of intelligent transportation systems (ITS) and Advanced Driver Assistance Systems (ADAS), the development of efficient and reliable traffic light detection mechanisms is crucial for enhancing road safety and traffic management. This paper presents an optimized convolutional neural network (CNN) framework designed to detect traffic lights in real-time within complex urban environments. Leveraging multi-scale pyramid feature maps, the proposed model addresses key challenges such as the detection of small, occluded, and low-resolution traffic lights amidst complex backgrounds. The integration of dilated convolutions, Region of Interest (ROI) alignment, and Soft Non-Maximum Suppression (Soft-NMS) further improves detection accuracy and reduces false positives. By optimizing computational efficiency and parameter complexity, the framework is designed to operate seamlessly on embedded systems, ensuring robust performance in real-world applications. Extensive experiments using real-world datasets demonstrate that our model significantly outperforms existing methods, providing a scalable solution for ITS and ADAS applications. This research contributes to the advancement of Artificial Intelligence-driven (AI-driven) pattern recognition in transportation systems and offers a mathematical approach to improving efficiency and safety in logistics and transportation networks.展开更多
The increasing prevalence of violent incidents in public spaces has created an urgent need for intelligent surveillance systems capable of detecting dangerous objects in real time.While traditional video surveillance ...The increasing prevalence of violent incidents in public spaces has created an urgent need for intelligent surveillance systems capable of detecting dangerous objects in real time.While traditional video surveillance relies on human monitoring,this approach suffers from limitations such as fatigue and delayed response times.This study addresses these challenges by developing an automated detection system using advanced deep learning techniques to enhance public safety.Our approach leverages state-of-the-art convolutional neural networks(CNNs),specifically You Only Look Once version 4(YOLOv4)and EfficientDet,for real-time object detection.The system was trained on a comprehensive dataset of over 50,000 images,enhanced through data augmentation techniques to improve robustness across varying lighting conditions and viewing angles.Cloud-based deployment on Amazon Web Services(AWS)ensured scalability and efficient processing.Experimental evaluations demonstrated high performance,with YOLOv4 achieving 92%accuracy and processing images in 0.45 s,while EfficientDet reached 93%accuracy with a slightly longer processing time of 0.55 s per image.Field tests in high-traffic environments such as train stations and shopping malls confirmed the system’s reliability,with a false alarm rate of only 4.5%.The integration of automatic alerts enabled rapid security responses to potential threats.The proposed CNN-based system provides an effective solution for real-time detection of dangerous objects in video surveillance,significantly improving response times and public safety.While YOLOv4 proved more suitable for speed-critical applications,EfficientDet offered marginally better accuracy.Future work will focus on optimizing the system for low-light conditions and further reducing false positives.This research contributes to the advancement of AI-driven surveillance technologies,offering a scalable framework adaptable to various security scenarios.展开更多
The Yangtze River Valley(YRV) of China experienced record-breaking heatwaves in July and August 2022. The characteristics, causes, and impacts of this extreme event have been widely explored, but its seasonal predicta...The Yangtze River Valley(YRV) of China experienced record-breaking heatwaves in July and August 2022. The characteristics, causes, and impacts of this extreme event have been widely explored, but its seasonal predictability remains elusive. This study assessed the real-time one-month-lead prediction skill of the summer 2022 YRV heatwaves using 12operational seasonal forecast systems. Results indicate that most individual forecast systems and their multi-model ensemble(MME) mean exhibited limited skill in predicting the 2022 YRV heatwaves. Notably, after the removal of the linear trend, the predicted 2-m air temperature anomalies were generally negative in the YRV, except for the Met Office Glo Sea6 system, which captured a moderate warm anomaly. While the models successfully simulated the influence of La Ni?a on the East Asian–western North Pacific atmospheric circulation and associated YRV temperature anomalies, only Glo Sea6 reasonably captured the observed relationship between the YRV heatwaves and an atmospheric teleconnection extending from the North Atlantic to the Eurasian mid-to-high latitudes. Such an atmospheric teleconnection plays a crucial role in intensifying the YRV heatwaves. In contrast, other seasonal forecast systems and the MME predicted a distinctly different atmospheric circulation pattern, particularly over the Eurasian mid-to-high latitudes, and failed to reproduce the observed relationship between the YRV heatwaves and Eurasian mid-to-high latitude atmospheric circulation anomalies.These findings underscore the importance of accurately representing the Eurasian mid-to-high latitude atmospheric teleconnection for successful YRV heatwave prediction.展开更多
This paper aims to fuse two well-established and,at the same time,opposed control techniques,namely,model predictive control(MPC)and active disturbance rejection control(ADRC),to develop a dynamic motion controller fo...This paper aims to fuse two well-established and,at the same time,opposed control techniques,namely,model predictive control(MPC)and active disturbance rejection control(ADRC),to develop a dynamic motion controller for a laser beam steering system.The proposed technique uses the ADRC philosophy to lump disturbances and model uncertainties into a total disturbance.Then,the total disturbance is estimated via a discrete extended state disturbance observer(ESO),and it is used to(1)handle the system constraints in a quadratic optimization problem and(2)injected as a feedforward term to the plant to reject the total disturbance,together with the feedback term obtained by the MPC.The main advantage of the proposed approach is that the MPC is designed based on a straightforward integrator-chain model such that a simple convex optimization problem is performed.Several experiments show the real-time closed-loop performance regarding trajectory tracking and disturbance rejection.Owing to simplicity,the self-contained approach MPC+ESO becomes a Frugal MPC,which is computationally economical,adaptable,efficient,resilient,and suitable for applications where on-board computational resources are limited.展开更多
In the context of real-time fault-tolerant scheduling in multiprocessor systems, Primary-backup scheme plays an important role. A backup copy is always preferred to be executed as passive backup copy whenever possible...In the context of real-time fault-tolerant scheduling in multiprocessor systems, Primary-backup scheme plays an important role. A backup copy is always preferred to be executed as passive backup copy whenever possible because it can take the advantages of backup copy de-allocation technique and overloading technique to improve schedulability. In this paper, we propose a novel efficient fault-tolerant ratemonotonic best-fit algorithm efficient fault-tolerant rate-monotonic best-fit （ERMBF） based on multiprocessors systems to enhance the schedulability. Unlike existing scheduling algorithms that start scheduling tasks with only one processor. ERMBF pre-allocates a certain amount of processors before starting scheduling tasks, which enlarge the searching spaces for tasks. Besides, when a new processor is allocated, we reassign the task copies that have already been assigned to the existing processors in order to find a superior tasks assignment configuration. These two strategies are all aiming at making as many backup copies as possible to be executed as passive status. As a result, ERMBF can use fewer processors to schedule a set of tasks without losing real-time and fault-tolerant capabilities of the system. Simulation results reveal that ERMBF significantly improves the schedulability over existing, comparable algorithms in literature.展开更多
This paper presents an efficient recovery scheme suitable for real-time mainmemory database. In the recovery scheme, log records are stored in non-volatile RAM which is dividedinto four different partitions based on t...This paper presents an efficient recovery scheme suitable for real-time mainmemory database. In the recovery scheme, log records are stored in non-volatile RAM which is dividedinto four different partitions based on transaction types. Similarly, a main memory database isdivided into four partitions based data types. When the using ratio of log store area exceeds thethreshold value, checkpoint procedure is triggered. During executing checkpoint procedure, someuseless log records are deleted. During restart recovery after a crash, partition reloading policyis adopted to assure that critical data are reloaded and restored in advance, so that the databasesystem can be brought up before the entire database is reloaded into main memory. Therefore downtime is obvionsly reduced. Simulation experiments show our recovery scheme obviously improves thesystem performance, and does a favor to meet the dtadlints of real-time transactions.展开更多
Energy consumption has become a key metric for evaluating how good an embedded system is,alongside more performance metrics like respecting operation deadlines and speed of execution.Schedulability improvement is no l...Energy consumption has become a key metric for evaluating how good an embedded system is,alongside more performance metrics like respecting operation deadlines and speed of execution.Schedulability improvement is no longer the only metric by which optimality is judged.In fact,energy efficiency is becoming a preferred choice with a fundamental objective to optimize the system's lifetime.In this work,we propose an optimal energy efficient scheduling algorithm for aperiodic real-time jobs to reduce CPU energy consumption.Specifically,we apply the concept of real-time process scheduling to a dynamic voltage and frequency scaling(DVFS)technique.We address a variant of earliest deadline first(EDF)scheduling algorithm called energy saving-dynamic voltage and frequency scaling(ES-DVFS)algorithm that is suited to unpredictable future energy production and irregular job arrivals.We prove that ES-DVFS cannot attain a total value greater than C/ˆSα,whereˆS is the minimum speed of any job and C is the available energy capacity.We also investigate the implications of having in advance,information about the largest job size and the minimum speed used for the competitive factor of ES-DVFS.We show that such advance knowledge makes possible the design of semi-on-line algorithm,ES-DVFS∗∗,that achieved a constant competitive factor of 0.5 which is proved as an optimal competitive factor.The experimental study demonstrates that substantial energy savings and highest percentage of feasible job sets can be obtained through our solution that combines EDF and DVFS optimally under the given aperiodic jobs and energy models.展开更多
An excellent cardinality estimation can make the query optimiser produce a good execution plan.Although there are some studies on cardinality estimation,the prediction results of existing cardinality estimators are in...An excellent cardinality estimation can make the query optimiser produce a good execution plan.Although there are some studies on cardinality estimation,the prediction results of existing cardinality estimators are inaccurate and the query efficiency cannot be guaranteed as well.In particular,they are difficult to accurately obtain the complex relationships between multiple tables in complex database systems.When dealing with complex queries,the existing cardinality estimators cannot achieve good results.In this study,a novel cardinality estimator is proposed.It uses the core techniques with the BiLSTM network structure and adds the attention mechanism.First,the columns involved in the query statements in the training set are sampled and compressed into bitmaps.Then,the Word2vec model is used to embed the word vectors about the query statements.Finally,the BiLSTM network and attention mechanism are employed to deal with word vectors.The proposed model takes into consideration not only the correlation between tables but also the processing of complex predicates.Extensive experiments and the evaluation of BiLSTM-Attention Cardinality Estimator(BACE)on the IMDB datasets are conducted.The results show that the deep learning model can significantly improve the quality of cardinality estimation,which is a vital role in query optimisation for complex databases.展开更多
In the article, an experiment is aimed at clarifying the transfer efficiency of the database in the cloud infrastructure. The system was added to the control unit, which has guided the database search in the local par...In the article, an experiment is aimed at clarifying the transfer efficiency of the database in the cloud infrastructure. The system was added to the control unit, which has guided the database search in the local part or in the cloud. It is shown that the time data acquisition remains unchanged as a result of modification. Suggestions have been made about the use of the theory of dynamic systems to hybrid cloud database. The present work is aimed at attracting the attention of specialists in the field of cloud database to the apparatus control theory. The experiment presented in this article allows the use of the description of the known methods for solving important practical problems.展开更多
Virtualization has gained great acceptance in the server and cloud computing arena. In recent years, it has also been widely applied to real-time embedded systems with stringent timing constraints. We present a compre...Virtualization has gained great acceptance in the server and cloud computing arena. In recent years, it has also been widely applied to real-time embedded systems with stringent timing constraints. We present a comprehensive survey on real-time issues in virtualization for embedded systems, covering popular virtualization systems including KVM, Xen, L4 and others.展开更多
A new theory on the construction of optimal truncated Low-Dimensional Dynamical Systems (LDDSs) with different physical meanings has been developed, The physical properties of the optimal bases are reflected in the us...A new theory on the construction of optimal truncated Low-Dimensional Dynamical Systems (LDDSs) with different physical meanings has been developed, The physical properties of the optimal bases are reflected in the user-defined optimal conditions, Through the analysis of linear and nonlinear examples, it is shown that the LDDSs constructed by using the Proper Orthogonal Decomposition (POD) method are not the optimum. After comparing the errors of LDDSs based on the new theory POD and Fourier methods, it is concluded that the LDDSs based on the new theory are optimally truncated and catch the desired physical properties of the systems.展开更多
基金Project(20030533011)supported by the National Research Foundation for the Doctoral Program of Higher Education of China
文摘A DMVOCC-MVDA （distributed multiversion optimistic concurrency control with multiversion dynamic adjustment） protocol was presented to process mobile distributed real-time transaction in mobile broadcast environments. At the mobile hosts, all transactions perform local pre-validation. The local pre-validation process is carried out against the committed transactions at the server in the last broadcast cycle. Transactions that survive in local pre-validation must be submitted to the server for local final validation. The new protocol eliminates conflicts between mobile read-only and mobile update transactions, and resolves data conflicts flexibly by using multiversion dynamic adjustment of serialization order to avoid unnecessary restarts of transactions. Mobile read-only transactions can be committed with no-blocking, and respond time of mobile read-only transactions is greatly shortened. The tolerance of mobile transactions of disconnections from the broadcast channel is increased. In global validation mobile distributed transactions have to do check to ensure distributed serializability in all participants. The simulation results show that the new concurrency control protocol proposed offers better performance than other protocols in terms of miss rate, restart rate, commit rate. Under high work load （think time is ls） the miss rate of DMVOCC-MVDA is only 14.6%, is significantly lower than that of other protocols. The restart rate of DMVOCC-MVDA is only 32.3%, showing that DMVOCC-MVDA can effectively reduce the restart rate of mobile transactions. And the commit rate of DMVOCC-MVDA is up to 61.2%, which is obviously higher than that of other protocols.
基金the National Natural Science Foundation of China and the Commission of Science,Technokgy and Industry for National Defense
文摘This paper formally defines and analyses the new notion of correctness called quasi serializability, and then outlines corresponding concurrency control protocol QDHP for distributed real-time databases. Finally, through a series of simulation studies, it shows that using the new concurrency control protocol the performance of distributed real-time databases can be much improved.
文摘In parallel real-time database systems, concurrency control protocols must satisfy time constraints as well as the integrity constraints. The authors present a validation concurrency control(VCC) protocol, which can enhance the performance of real-time concurrency control mechanism by reducing the number of transactions that might miss their deadlines, and compare the performance of validation concurrency control protocol with that of HP2PL(High priority two phase locking) protocol and OCC-TI-WAIT-50(Optimistic concurrency control-time interval-wait-50) protocol under shared-disk architecture by simulation. The simulation results reveal that the protocol the author presented can effectively reduce the number of transactions restarting which might miss their deadlines and performs better than HP2PL and OCC-TI-WAIT-50. It works well when arrival rate of transaction is lesser than threshold. However, due to resource contention the percentage of missing deadline increases sharply when arrival rate is greater than the threshold.
基金Project supported by National Natural Science Foundation ofChina (Grant No .60203017) Defense Pre-research Projectof the"Tenth Five-Year-Plan"of China (Grant No .413150403)
文摘Recovery performance in the event of failures is very important for distributed real-time database systems. This paper presents a time-cognizant logging-based crash recovery scheme （TCLCRS） that aims at distributed real-time databases, which adopts a main memory database as its ground support. In our scheme, each site maintains a real-time log for local transactions and the subtransactions, which execute at the site, and execte local checkpointing independently. Log records are stored in non-volatile high- speed store, which is divided into four different partitions based on transaction classes. During restart recovery after a site crash, partitioned crash recovery strategy is adopted to ensure that the site can be brought up before the entire local secondary database is reloaded in main memory. The partitioned crash recovery strategy not only guarantees the internal consistency to be recovered, but also guarantee the temporal consistency and recovery of the sates of physical world influenced by uncommitted transactions. Combined with two- phase commit protocol, TCLCRS can guarantee failure atomicity of distributed real-time transactions.
文摘Most of the proposed concurrency control protocols for real time database systems are based on serializability theorem. Owing to the unique characteristics of real time database applications and the importance of satisfying the timing constraints of transactions, serializability is too strong as a correctness criterion and not suitable for real time databases in most cases. On the other hand, relaxed serializability including epsilon serializability and similarity serializability can allow more real time transactions to satisfy their timing constraints, but database consistency may be sacrificed to some extent. We thus propose the use of weak serializability(WSR) that is more relaxed than conflicting serializability while database consistency is maintained. In this paper, we first formally define the new notion of correctness called weak serializability. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol WDHP(weak serializable distributed high priority protocol) is outlined for distributed real time databases, where a new lock mode called mask lock mode is proposed for simplifying the condition of global consistency. Finally, through a series of simulation studies, it is shown that using the new concurrency control protocol the performance of distributed real time databases can be greatly improved.
文摘Storing the whole database in the main-memory is a common method to processreal-time transaction in real-time database systems. The recovery mechanism of Main-memory Real-timeDatabase Systems (MMRTDBS) should reflect the characteristics of the main-memory database andreal-time database because their structures are quite different from other conventional databasesystems. In this paper, therefore, we propose a multi-level recovery mechanism for main-memoryreal-time database systems with Extendable Chained Bucket Hashing (ECBH). Owing to the occurrence ofreal-time data in real-time systems, we should also consider it in our recovery mechanism .According to our performance test, this mechanism can improve the transaction concurrency, reducingtransactions ' deadline missing rate.
基金supported by the Deanship of Scientific Research,Vice Presidency for Graduate Studies and Scientific Research,King Faisal University,Saudi Arabia(Grant No.KFU242068).
文摘Database systems have consistently been prime targets for cyber-attacks and threats due to the critical nature of the data they store.Despite the increasing reliance on database management systems,this field continues to face numerous cyber-attacks.Database management systems serve as the foundation of any information system or application.Any cyber-attack can result in significant damage to the database system and loss of sensitive data.Consequently,cyber risk classifications and assessments play a crucial role in risk management and establish an essential framework for identifying and responding to cyber threats.Risk assessment aids in understanding the impact of cyber threats and developing appropriate security controls to mitigate risks.The primary objective of this study is to conduct a comprehensive analysis of cyber risks in database management systems,including classifying threats,vulnerabilities,impacts,and countermeasures.This classification helps to identify suitable security controls to mitigate cyber risks for each type of threat.Additionally,this research aims to explore technical countermeasures to protect database systems from cyber threats.This study employs the content analysis method to collect,analyze,and classify data in terms of types of threats,vulnerabilities,and countermeasures.The results indicate that SQL injection attacks and Denial of Service(DoS)attacks were the most prevalent technical threats in database systems,each accounting for 9%of incidents.Vulnerable audit trails,intrusion attempts,and ransomware attacks were classified as the second level of technical threats in database systems,comprising 7%and 5%of incidents,respectively.Furthermore,the findings reveal that insider threats were the most common non-technical threats in database systems,accounting for 5%of incidents.Moreover,the results indicate that weak authentication,unpatched databases,weak audit trails,and multiple usage of an account were the most common technical vulnerabilities in database systems,each accounting for 9%of vulnerabilities.Additionally,software bugs,insecure coding practices,weak security controls,insecure networks,password misuse,weak encryption practices,and weak data masking were classified as the second level of security vulnerabilities in database systems,each accounting for 4%of vulnerabilities.The findings from this work can assist organizations in understanding the types of cyber threats and developing robust strategies against cyber-attacks.
文摘In the Engine CAD application system engineering database management system (ECAD-EDBMS) is the kernel. ECAD-EDBMS can manage and process the multimedia such as graphics, data, text, sound, image and video. It provides the integrated environment and more functions for many subsystems of ECAD and engine designers. So it improves the design efficiency.
文摘Along with process control,perception represents the main function performed by the Edge Layer of an Internet of Things(IoT)network.Many of these networks implement various applications where the response time does not represent an important parameter.However,in critical applications,this parameter represents a crucial aspect.One important sensing device used in IoT designs is the accelerometer.In most applications,the response time of the embedded driver software handling this device is generally not analysed and not taken into account.In this paper,we present the design and implementation of a predictable real-time driver stack for a popular accelerometer and gyroscope device family.We provide clear justifications for why this response time is extremely important for critical applications in the acquisition process of such data.We present extensive measurements and experimental results that demonstrate the predictability of our solution,making it suitable for critical real-time systems.
基金funded by the Deanship of Scientific Research at Northern Border University,Arar,Saudi Arabia through research group No.(RG-NBU-2022-1234).
文摘Transportation systems are experiencing a significant transformation due to the integration of advanced technologies, including artificial intelligence and machine learning. In the context of intelligent transportation systems (ITS) and Advanced Driver Assistance Systems (ADAS), the development of efficient and reliable traffic light detection mechanisms is crucial for enhancing road safety and traffic management. This paper presents an optimized convolutional neural network (CNN) framework designed to detect traffic lights in real-time within complex urban environments. Leveraging multi-scale pyramid feature maps, the proposed model addresses key challenges such as the detection of small, occluded, and low-resolution traffic lights amidst complex backgrounds. The integration of dilated convolutions, Region of Interest (ROI) alignment, and Soft Non-Maximum Suppression (Soft-NMS) further improves detection accuracy and reduces false positives. By optimizing computational efficiency and parameter complexity, the framework is designed to operate seamlessly on embedded systems, ensuring robust performance in real-world applications. Extensive experiments using real-world datasets demonstrate that our model significantly outperforms existing methods, providing a scalable solution for ITS and ADAS applications. This research contributes to the advancement of Artificial Intelligence-driven (AI-driven) pattern recognition in transportation systems and offers a mathematical approach to improving efficiency and safety in logistics and transportation networks.
文摘The increasing prevalence of violent incidents in public spaces has created an urgent need for intelligent surveillance systems capable of detecting dangerous objects in real time.While traditional video surveillance relies on human monitoring,this approach suffers from limitations such as fatigue and delayed response times.This study addresses these challenges by developing an automated detection system using advanced deep learning techniques to enhance public safety.Our approach leverages state-of-the-art convolutional neural networks(CNNs),specifically You Only Look Once version 4(YOLOv4)and EfficientDet,for real-time object detection.The system was trained on a comprehensive dataset of over 50,000 images,enhanced through data augmentation techniques to improve robustness across varying lighting conditions and viewing angles.Cloud-based deployment on Amazon Web Services(AWS)ensured scalability and efficient processing.Experimental evaluations demonstrated high performance,with YOLOv4 achieving 92%accuracy and processing images in 0.45 s,while EfficientDet reached 93%accuracy with a slightly longer processing time of 0.55 s per image.Field tests in high-traffic environments such as train stations and shopping malls confirmed the system’s reliability,with a false alarm rate of only 4.5%.The integration of automatic alerts enabled rapid security responses to potential threats.The proposed CNN-based system provides an effective solution for real-time detection of dangerous objects in video surveillance,significantly improving response times and public safety.While YOLOv4 proved more suitable for speed-critical applications,EfficientDet offered marginally better accuracy.Future work will focus on optimizing the system for low-light conditions and further reducing false positives.This research contributes to the advancement of AI-driven surveillance technologies,offering a scalable framework adaptable to various security scenarios.
基金jointly supported by the National Key Research and Development Program of China (2023YFC3007503)the Joint Research Project for Meteorological Capacity Improvement (22NLTSZ002)+4 种基金the National Natural Science Foundations of China (Grant Nos.42375064, 41975102, 41730964, 42175047)the China Meteorological Administration Key Innovation Team for Climate Prediction (CMA2023ZD03)the Met Office Climate Science for Service Partnership (CSSP) China project under the International Science Partnerships Fund (ISPF)the Special Project of Innovation and Development of China Meteorological Administration (CXFZ2024J004)the China Yangtze Power Co.,Ltd.Research Project (Grant No.2423020054)。
文摘The Yangtze River Valley(YRV) of China experienced record-breaking heatwaves in July and August 2022. The characteristics, causes, and impacts of this extreme event have been widely explored, but its seasonal predictability remains elusive. This study assessed the real-time one-month-lead prediction skill of the summer 2022 YRV heatwaves using 12operational seasonal forecast systems. Results indicate that most individual forecast systems and their multi-model ensemble(MME) mean exhibited limited skill in predicting the 2022 YRV heatwaves. Notably, after the removal of the linear trend, the predicted 2-m air temperature anomalies were generally negative in the YRV, except for the Met Office Glo Sea6 system, which captured a moderate warm anomaly. While the models successfully simulated the influence of La Ni?a on the East Asian–western North Pacific atmospheric circulation and associated YRV temperature anomalies, only Glo Sea6 reasonably captured the observed relationship between the YRV heatwaves and an atmospheric teleconnection extending from the North Atlantic to the Eurasian mid-to-high latitudes. Such an atmospheric teleconnection plays a crucial role in intensifying the YRV heatwaves. In contrast, other seasonal forecast systems and the MME predicted a distinctly different atmospheric circulation pattern, particularly over the Eurasian mid-to-high latitudes, and failed to reproduce the observed relationship between the YRV heatwaves and Eurasian mid-to-high latitude atmospheric circulation anomalies.These findings underscore the importance of accurately representing the Eurasian mid-to-high latitude atmospheric teleconnection for successful YRV heatwave prediction.
基金support through his Master scholarshipThe Vicerrectoría de Investigación y Estudios de Posgrado(VIEP-BUAP)partially funded this work under grant number 00593-PV/2025.
文摘This paper aims to fuse two well-established and,at the same time,opposed control techniques,namely,model predictive control(MPC)and active disturbance rejection control(ADRC),to develop a dynamic motion controller for a laser beam steering system.The proposed technique uses the ADRC philosophy to lump disturbances and model uncertainties into a total disturbance.Then,the total disturbance is estimated via a discrete extended state disturbance observer(ESO),and it is used to(1)handle the system constraints in a quadratic optimization problem and(2)injected as a feedforward term to the plant to reject the total disturbance,together with the feedback term obtained by the MPC.The main advantage of the proposed approach is that the MPC is designed based on a straightforward integrator-chain model such that a simple convex optimization problem is performed.Several experiments show the real-time closed-loop performance regarding trajectory tracking and disturbance rejection.Owing to simplicity,the self-contained approach MPC+ESO becomes a Frugal MPC,which is computationally economical,adaptable,efficient,resilient,and suitable for applications where on-board computational resources are limited.
基金Supported by the National Basic Reseach Program of China (973 Program 2004 CB318200)
文摘In the context of real-time fault-tolerant scheduling in multiprocessor systems, Primary-backup scheme plays an important role. A backup copy is always preferred to be executed as passive backup copy whenever possible because it can take the advantages of backup copy de-allocation technique and overloading technique to improve schedulability. In this paper, we propose a novel efficient fault-tolerant ratemonotonic best-fit algorithm efficient fault-tolerant rate-monotonic best-fit （ERMBF） based on multiprocessors systems to enhance the schedulability. Unlike existing scheduling algorithms that start scheduling tasks with only one processor. ERMBF pre-allocates a certain amount of processors before starting scheduling tasks, which enlarge the searching spaces for tasks. Besides, when a new processor is allocated, we reassign the task copies that have already been assigned to the existing processors in order to find a superior tasks assignment configuration. These two strategies are all aiming at making as many backup copies as possible to be executed as passive status. As a result, ERMBF can use fewer processors to schedule a set of tasks without losing real-time and fault-tolerant capabilities of the system. Simulation results reveal that ERMBF significantly improves the schedulability over existing, comparable algorithms in literature.
文摘This paper presents an efficient recovery scheme suitable for real-time mainmemory database. In the recovery scheme, log records are stored in non-volatile RAM which is dividedinto four different partitions based on transaction types. Similarly, a main memory database isdivided into four partitions based data types. When the using ratio of log store area exceeds thethreshold value, checkpoint procedure is triggered. During executing checkpoint procedure, someuseless log records are deleted. During restart recovery after a crash, partition reloading policyis adopted to assure that critical data are reloaded and restored in advance, so that the databasesystem can be brought up before the entire database is reloaded into main memory. Therefore downtime is obvionsly reduced. Simulation experiments show our recovery scheme obviously improves thesystem performance, and does a favor to meet the dtadlints of real-time transactions.
文摘Energy consumption has become a key metric for evaluating how good an embedded system is,alongside more performance metrics like respecting operation deadlines and speed of execution.Schedulability improvement is no longer the only metric by which optimality is judged.In fact,energy efficiency is becoming a preferred choice with a fundamental objective to optimize the system's lifetime.In this work,we propose an optimal energy efficient scheduling algorithm for aperiodic real-time jobs to reduce CPU energy consumption.Specifically,we apply the concept of real-time process scheduling to a dynamic voltage and frequency scaling(DVFS)technique.We address a variant of earliest deadline first(EDF)scheduling algorithm called energy saving-dynamic voltage and frequency scaling(ES-DVFS)algorithm that is suited to unpredictable future energy production and irregular job arrivals.We prove that ES-DVFS cannot attain a total value greater than C/ˆSα,whereˆS is the minimum speed of any job and C is the available energy capacity.We also investigate the implications of having in advance,information about the largest job size and the minimum speed used for the competitive factor of ES-DVFS.We show that such advance knowledge makes possible the design of semi-on-line algorithm,ES-DVFS∗∗,that achieved a constant competitive factor of 0.5 which is proved as an optimal competitive factor.The experimental study demonstrates that substantial energy savings and highest percentage of feasible job sets can be obtained through our solution that combines EDF and DVFS optimally under the given aperiodic jobs and energy models.
基金supported by the National Natural Science Foundation of China under grant nos.61772091,61802035,61962006,61962038,U1802271,U2001212,and 62072311the Sichuan Science and Technology Program under grant nos.2021JDJQ0021 and 22ZDYF2680+7 种基金the CCF‐Huawei Database System Innovation Research Plan under grant no.CCF‐HuaweiDBIR2020004ADigital Media Art,Key Laboratory of Sichuan Province,Sichuan Conservatory of Music,Chengdu,China under grant no.21DMAKL02the Chengdu Major Science and Technology Innovation Project under grant no.2021‐YF08‐00156‐GXthe Chengdu Technology Innovation and Research and Development Project under grant no.2021‐YF05‐00491‐SNthe Natural Science Foundation of Guangxi under grant no.2018GXNSFDA138005the Guangdong Basic and Applied Basic Research Foundation under grant no.2020B1515120028the Science and Technology Innovation Seedling Project of Sichuan Province under grant no 2021006the College Student Innovation and Entrepreneurship Training Program of Chengdu University of Information Technology under grant nos.202110621179 and 202110621186.
文摘An excellent cardinality estimation can make the query optimiser produce a good execution plan.Although there are some studies on cardinality estimation,the prediction results of existing cardinality estimators are inaccurate and the query efficiency cannot be guaranteed as well.In particular,they are difficult to accurately obtain the complex relationships between multiple tables in complex database systems.When dealing with complex queries,the existing cardinality estimators cannot achieve good results.In this study,a novel cardinality estimator is proposed.It uses the core techniques with the BiLSTM network structure and adds the attention mechanism.First,the columns involved in the query statements in the training set are sampled and compressed into bitmaps.Then,the Word2vec model is used to embed the word vectors about the query statements.Finally,the BiLSTM network and attention mechanism are employed to deal with word vectors.The proposed model takes into consideration not only the correlation between tables but also the processing of complex predicates.Extensive experiments and the evaluation of BiLSTM-Attention Cardinality Estimator(BACE)on the IMDB datasets are conducted.The results show that the deep learning model can significantly improve the quality of cardinality estimation,which is a vital role in query optimisation for complex databases.
文摘In the article, an experiment is aimed at clarifying the transfer efficiency of the database in the cloud infrastructure. The system was added to the control unit, which has guided the database search in the local part or in the cloud. It is shown that the time data acquisition remains unchanged as a result of modification. Suggestions have been made about the use of the theory of dynamic systems to hybrid cloud database. The present work is aimed at attracting the attention of specialists in the field of cloud database to the apparatus control theory. The experiment presented in this article allows the use of the description of the known methods for solving important practical problems.
文摘Virtualization has gained great acceptance in the server and cloud computing arena. In recent years, it has also been widely applied to real-time embedded systems with stringent timing constraints. We present a comprehensive survey on real-time issues in virtualization for embedded systems, covering popular virtualization systems including KVM, Xen, L4 and others.
基金The project supported by the National Natural Science Foundation of ChinaLNM,Institute of Mechanics,CAS
文摘A new theory on the construction of optimal truncated Low-Dimensional Dynamical Systems (LDDSs) with different physical meanings has been developed, The physical properties of the optimal bases are reflected in the user-defined optimal conditions, Through the analysis of linear and nonlinear examples, it is shown that the LDDSs constructed by using the Proper Orthogonal Decomposition (POD) method are not the optimum. After comparing the errors of LDDSs based on the new theory POD and Fourier methods, it is concluded that the LDDSs based on the new theory are optimally truncated and catch the desired physical properties of the systems.
