Cyber-physical systems (CPSs) are designed to in-tegrate computation and physical processes through constantly interacting with the physical environment. The complexity and uncertainty of the environment often come up...
Cyber-physical systems (CPSs) are designed to in-tegrate computation and physical processes through constantly interacting with the physical environment. The complexity and uncertainty of the environment often come up with unpredictable situations, which place high demands on the dynamic adaptability of CPSs. Further, as the environment evolves, the CPS needs to constantly evolve itself to adapt to the changing environment. This paper presents a research plan that aims to develop a novel framework to address CPS design challenges under uncertain environments. We propose to utilize evolutionary computation and reinforcement learning techniques to design control policies that can adapt to the dynamic changes and uncertainties of the environment. Further, novel testing and evaluation approaches that can generate test cases while adapting to dynamic changes in the system and the environment will be explored.
We have seen rapid development of autonomous driving systems (ADSs) in recent years. These systems place high requirements on safety and reliability for their mass adoption, and ADS testing is one of the crucial appro...
We have seen rapid development of autonomous driving systems (ADSs) in recent years. These systems place high requirements on safety and reliability for their mass adoption, and ADS testing is one of the crucial approaches to ensure the success of ADSs. To this end, this paper presents RLTester, a novel ADS testing approach, which adopts reinforcement learning (RL) to learn critical environment configurations (i.e., test scenarios) of the operating environment of ADSs that could reveal their unsafe behaviors. To generate diverse and critical test scenarios, we defined 142 environment configuration actions, and adopted the Time- To-Collision metric to construct the reward function. Our evaluation shows that RLTester discovered a total of 256 collisions, of which 192 are unique collisions, and took on average 11.59 seconds for each collision. Further, RLTester is effective in generating more diverse test scenarios compared to a state-of-the art approach, DeepCollision.
Little research has been done for artificial intelligence applications of semiconductor backend. This study aims to develop a deep learning based fault diagnosis framework as prognostics and health management (PHM) so...
详细信息
We characterize the taxis enhancement of swimming bacteria by collective migration without apparent clustering. We confine a dilute Salmonella suspension in a shallow channel and evaluate the thermotaxis response to l...
详细信息
We characterize the taxis enhancement of swimming bacteria by collective migration without apparent clustering. We confine a dilute Salmonella suspension in a shallow channel and evaluate the thermotaxis response to local heating and diffusion. By combining cell tracking analysis and numerical simulation based on simple modeling, we show that the alignment interaction suppresses orientation fluctuation, strengthens migration bias, and also prevents the dispersion of accumulated population. The results show a prominent example of how a collective motion of active matter implements a biological function.
We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes ar...
详细信息
We propose a bond-percolation model intended to describe the consumption, and eventual exhaustion, of resources in transport networks. Edges forming minimum-length paths connecting demanded origin-destination nodes are removed if below a certain budget. As pairs of nodes are demanded and edges are removed, the macroscopic connected component of the graph disappears, i.e., the graph undergoes a percolation transition. Here, we study such a shortest-path-percolation transition in homogeneous random graphs where pairs of demanded origin-destination nodes are randomly generated, and fully characterize it by means of finite-size scaling analysis. If budget is finite, the transition is identical to the one of ordinary percolation, where a single giant cluster shrinks as edges are removed from the graph; for infinite budget, the transition becomes more abrupt than the one of ordinary percolation, being characterized by the sudden fragmentation of the giant connected component into a multitude of clusters of similar size.
As global road infrastructure expands rapidly, especially in developing countries, maintaining the quality and safety of these roads becomes critical. However, many routes lack detours, and the swift deterioration of ...
详细信息
Weighted vertex cover(WVC)is one of the most important combinatorial optimization *** this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted *** first...
详细信息
Weighted vertex cover(WVC)is one of the most important combinatorial optimization *** this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted *** first model the WVC problem as a general game on weighted *** the framework of a game,we newly define several cover states to describe the WVC ***,we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums(SNEs)of the ***,we propose a game-based asynchronous algorithm(GAA),which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial ***,we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms,termed the improved game-based asynchronous algorithm(IGAA),in which we prove that it can obtain a better solution to the WVC problem than using a the ***,numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms.
Hepatocellular carcinoma (HCC) is one of the most difficult diseases to be treated fundamentally in the medical field in today's world, and the recurrence rate of HCC has been increasing year by year in recent yea...
详细信息
Patients with knee arthropathy suffer from pain owing to damage at the knee joint cartilage and experience difficulty in walking as the condition worsens. As one of treatments of knee arthropathy, an implantation of c...
详细信息
Change detection(CD)is becoming indispensable for unmanned aerial vehicles(UAVs),especially in the domain of water landing,rescue and ***,even the most advanced models require large amounts of data for model training ...
详细信息
Change detection(CD)is becoming indispensable for unmanned aerial vehicles(UAVs),especially in the domain of water landing,rescue and ***,even the most advanced models require large amounts of data for model training and ***,sufficient labeled images with different imaging conditions are *** by computer graphics,we present a cloning method to simulate inland-water scene and collect an auto-labeled simulated *** simulated dataset consists of six challenges to test the effects of dynamic background,weather,and noise on change detection ***,we propose an image translation framework that translates simulated images to synthetic *** framework uses shared parameters(encoder and generator)and 22×22 receptive fields(discriminator)to generate realistic synthetic images as model training *** experimental results indicate that:1)different imaging challenges affect the performance of change detection models;2)compared with simulated images,synthetic images can effectively improve the accuracy of supervised models.
暂无评论