Fabry-Pérto (FP) cavity is the essential component of ultra-stable laser (USL) for gravitational wave detection, which couples multi-physic (Optical/Thermal/Mechanics) fields and requires ultra-high precision. To satisfy the requirements of precise and efficient design, a multi-physic coupling optimization method for fixing cubic FP cavity based on data learning is proposed. A multi-physic model for the cubic FP cavity is established and the performance is obtained by finite element analysis. The key performance indices (V, wF, wF) and key design variables (d, l, F) are determined considering the features of the FP cavity. The 49 sets of data by orthogonal experiment are acquired for the establishment and comparison of different data learning models (NN, RSF, KRG). The result turns out that the neural network has the best performance. Based on NSGA-II, the Pareto optimal front is obtained and the optimal combination of design variables is finally determined as {5,32,250}. The performance after optimization has proven to be a great improvement, of which the displacement under the fixing force and vibration test are decreased by more than 60%. The optimization strategy can not only help the design of the FP cavity but also enlighten other optimization fields.

With recent advancements in network technology and spread of Internet, use of social network services and Internet of Things devices has flourished, leading to a continuous generation of large volumes of graph stream data, where changes, such as additions or deletions of vertices and edges occur over time. Additionally, owing to the need for efficient use of storage space and security requirements, graph stream data compression has become essential in various applications. Even though various studies on graph compression methods have been conducted, most of them do not fully reflect the dynamic characteristics of graph streams and complexity of large graphs. In this paper, we propose a compression scheme using provenance data to efficiently process and analyze large graph stream data. It obtains provenance data by analyzing graph stream data and builds a pattern dictionary based on this to perform dictionary-based compression. By improving the existing dictionary-based graph compression methods, it enables more efficient dictionary management through tracking pattern changes and evaluating their importance using provenance. Furthermore, it considers the relationships among sub-patterns using an FP-tree and performs pattern dictionary management that updates pattern scores based on time. Our experiments show that the proposed scheme outperforms existing graph compression methods in key performance metrics, such as compression rate and processing time.