Simulation of large-scale numerical substructure in real-time dynamic hybrid testing

A solution scheme is proposed in this paper for an existing RTDHT system to simulate large-scale finite element （FE） numerical substructures. The analysis of the FE numerical substructure is split into response analysis and signal generation tasks, and executed in two different target computers in real-time. One target computer implements the response analysis task, wherein a large time-step is used to solve the FE substructure, and another target computer implements the signal generation task, wherein an interpolation program is used to generate control signals in a small time-step to meet the input demand of the controller. By using this strategy, the scale of the FE numerical substructure simulation may be increased significantly. The proposed scheme is initially verified by two FE numerical substructure models with 98 and 1240 degrees of freedom （DOFs）. Thereafter, RTDHTs of a single frame-foundation structure are implemented where the foundation, considered as the numerical substructure, is simulated by the FE model with 1240 DOFs. Good agreements between the results of the RTDHT and those from the FE analysis in ABAQUS are obtained.

An Efficient Crash Recovery Technique for Real-Time Main Memory Database

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.

Validation concurrency control protocol in parallel real-time database systems

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.

Real-time rendering of large-scale static scene

In virtual simulation application, it is often necessary to use Open GL to render large-scale 3D static scenes including urban architectures. Each scene unit generally has individual vertex data and texture. For large-scale data set, it is hard to render all scene units simultaneously. We need to render part of the scene separately, which is called the scene partition and culling. In general, we partition the whole scene into different units on the CPU. We present a scheme that optimize the GPU rendering pipeline to cull the large-scale static scene, which will reduce the CPU suspending time and take full advantage of GPU computing advantages to speed up the rendering efficiency.

A dynamic crash recovery scheme for distributed real-time database systems

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.

Real-Time Memory Data Optimization Mechanism of Edge IoT Agent

With the full development of disk-resident databases(DRDB)in recent years,it is widely used in business and transactional applications.In long-term use,some problems of disk databases are gradually exposed.For applications with high real-time requirements,the performance of using disk database is not satisfactory.In the context of the booming development of the Internet of things,domestic real-time databases have also gradually developed.Still,most of them only support the storage,processing,and analysis of data values with fewer data types,which can not fully meet the current industrial process control system data types,complex sources,fast update speed,and other needs.Facing the business needs of efficient data collection and storage of the Internet of things,this paper optimizes the transaction processing efficiency and data storage performance of the memory database,constructs a lightweight real-time memory database transaction processing and data storage model,realizes a lightweight real-time memory database transaction processing and data storage model,and improves the reliability and efficiency of the database.Through simulation,we proved that the cache hit rate of the cache replacement algorithm proposed in this paper is higher than the traditional LRU(Least Recently Used)algorithm.Using the cache replacement algorithm proposed in this paper can improve the performance of the system cache.

Efficient Routing Protection Algorithm in Large-Scale Networks

With an increasing urgent demand for fast recovery routing mechanisms in large-scale networks,minimizing network disruption caused by network failure has become critical.However,a large number of relevant studies have shown that network failures occur on the Internet inevitably and frequently.The current routing protocols deployed on the Internet adopt the reconvergence mechanism to cope with network failures.During the reconvergence process,the packets may be lost because of inconsistent routing information,which reduces the network’s availability greatly and affects the Internet service provider’s(ISP’s)service quality and reputation seriously.Therefore,improving network availability has become an urgent problem.As such,the Internet Engineering Task Force suggests the use of downstream path criterion(DC)to address all single-link failure scenarios.However,existing methods for implementing DC schemes are time consuming,require a large amount of router CPU resources,and may deteriorate router capability.Thus,the computation overhead introduced by existing DC schemes is significant,especially in large-scale networks.Therefore,this study proposes an efficient intra-domain routing protection algorithm(ERPA)in large-scale networks.Theoretical analysis indicates that the time complexity of ERPA is less than that of constructing a shortest path tree.Experimental results show that ERPA can reduce the computation overhead significantly compared with the existing algorithms while offering the same network availability as DC.

An Efficient Secure Real-Time Concurrency Control Protocol

Secure real-time databases must simultaneously satisfy two requirements in guaranteeing data security and minimizing the missing deadlines ratio of transactions. However, these two requirements can conflict with each other and achieve one requirement is to sacrifice the other. This paper presents a secure real-time concurrency control protocol based on optimistic method. The concurrency control protocol incorporates security constraints in a real-time optimistic concurrency control protocol and makes a suitable tradeoff between security and real-time requirements by introducing secure influence factor and real-time influence factor. The experimental results show the concurrency control protocol achieves data security without degrading real-time perform ance significantly.

Research on Real-time Data Sharing in Power Integrated Automation System

The Power Integrated Automation System has a large amount of the real-time data, it needs to achieve data sharing in different modules in its own system, sometimes even needs to be shared with the other systems. The thesis discusses the characteristics and the ways of the real-time data sharing in the first place. Then, it compares the merits and drawbacks in different ways. Besides, it gives a viable resolution in different aspects, such as the design of the real-time database, the framework of the communication system and the design of the communication software, as well as the real-time data sharing in different systems.

The Multi-level Recovery of Main-memory Real-time Database Systems with ECBH

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.

An IoT-Based Aquaculture Monitoring System Using Firebase

Indonesia is a producer in the fisheries sector,with production reaching 14.8 million tons in 2022.The production potential of the fisheries sector can be optimally optimized through aquaculture management.One of the most important issues in aquaculture management is how to efficiently control the fish pond water conditions.IoT technology can be applied to support a fish pond aquaculture monitoring system,especially for catfish species(Siluriformes),in real-time and remotely.One of the technologies that can provide this convenience is the IoT.The problem of this study is how to integrate IoT devices with Firebase’s cloud data system to provide reliable and precise data,which makes it easy for fish cultivators to monitor fishpond conditions in real time and remotely.The IoT aquaculture fishpond monitoring use 3 parameters:(1)water temperature;(2)pHwater level;and(3)turbidity level of pond water.IoT devices use temperature sensors,pH sensors,and turbidity sensors,which are integrated with a microcontroller and Wi-Fi module.Data from sensor readings are sent to the Firebase cloud via theWi-Fi module so that it can be accessed in real time by end users with an Androidbased mobile app.The findings are(1)the IoT-based aquaculture monitoring system device has a low error rate in measuring temprature,pH,and turbidity with a percentage of 1.75%,1.94% and 9.78%,respectively.Overall,the total average error of the three components is 4.49%;(2)in cost analysis,IoT-based has a cost-effectiveness of 94.21% compared to labor costs.An IoT-based aquaculture monitoring system using Firebase can be effectively used as a technology for monitoring fish pond conditions in real-time and remotely for fish cultivators that contribute to providing an IoT-based aquaculture monitoring system that produces valid data,is precise,is easy to implement,and is a low-cost system.

A novel lightweight computerized ECG interpretation approach based on clinical 12-lead data

Although 12-lead electrocardiograms(ECGs)provide a wide range of spatiotemporal characteristics,interpreting them for arrhythmia detection is difficult due to a lack of reliable large-scale clinical datasets.Herein,we proposed an innovative lightweight computerized ECG interpretation approach based on 12-lead data.Our model was trained,validated,and tested on 53845 standard 12-lead ECG records collected at Shanghai First People’s Hospital in affiliation with Shanghai Jiao Tong University.The experiments revealed that our approach had a classification accuracy of 94.41%in the classification task of seven types of rhythms,which was markedly superior to related single-lead and 12-lead ECG classification methods.Moreover,the average receiver operating characteristic area under the curve reached a value of 0.940,and the precision values for sinus tachycardia and sinus bradycardia were 0.945 and 0.91,respectively,with specificity values of 0.996 and 0.994.By employing our boosting method,we were able to improve the accuracy to 94.85%.To investigate the performance degradation of the proposed neural network in some classes,an ECG cardiologist was enlisted to review questionable ECGs;this process provides a promising direction for network performance improvement.Therefore,the proposed computerized ECG interpretation approach has practical significance because it could help professional physicians analyze patients’heart conditions based on real-time 12-lead ECG or grade their disease severity in advance.

Functional optoacoustic neuro-tomography for scalable whole-brain monitoring of calcium indicators

Non-invasive observation of spatiotemporal activity of large neural populations distributed over entire brains is a longstanding goal of neuroscience.We developed a volumetric multispectral optoacoustic tomography platform for imaging neural activation deep in scattering brains.It can record 100 volumetric frames per second across scalable fields of view ranging between 50 and 1000 mm^(3) with respective spatial resolution of 35–200μm.Experiments performed in immobilized and freely swimming larvae and in adult zebrafish brains expressing the genetically encoded calcium indicator GCaMP5G demonstrate,for the first time,the fundamental ability to directly track neural dynamics using optoacoustics while overcoming the longstanding penetration barrier of optical imaging in scattering brains.The newly developed platform thus offers unprecedented capabilities for functional whole-brain observations of fast calcium dynamics;in combination with optoacoustics'well-established capacity for resolving vascular hemodynamics,it could open new vistas in the study of neural activity and neurovascular coupling in health and disease.

A Partition Checkpoint Strategy Based on Data Segment Priority

A partition checkpoint strategy based on data segment priority is presented to meet the timing constraints of the data and the transaction in embedded real-time main memory database systems（ERTMMDBS） as well as to reduce the number of the transactions missing their deadlines and the recovery time.The partition checkpoint strategy takes into account the characteristics of the data and the transactions associated with it;moreover,it partitions the database according to the data segment priority and sets the corresponding checkpoint frequency to each partition for independent checkpoint operation.The simulation results show that the partition checkpoint strategy decreases the ratio of trans-actions missing their deadlines.