Distributed quantum computing (DQC) is a promising way to achieve large-scale quantum computing. However, mapping large-sized quantum circuits in DQC is a challenging job; for example, it is difficult to find an ideal cutting and mapping solution when many qubits, complicated qubit operations, and diverse QPUs are involved. In this study, we propose LarQucut, a new quantum circuit cutting and mapping approach for large-sized circuits in DQC. LarQucut has several new designs. (1) LarQucut can have cutting solutions that use fewer cuts, and it does not cut a circuit into independent sub-circuits, therefore reducing the overall cutting and computing overheads. (2) LarQucut finds isomorphic sub-circuits and reuses their execution results. So, LarQucut can reduce the number of sub-circuits that need to be executed to reconstruct the large circuit's output, reducing the time spent on sampling the sub-circuits. (3) We design an adaptive quantum circuit mapping approach, which identifies qubit interaction patterns and accordingly enables the best-fit mapping policy in DQC. The experimental results show that, for large circuits with hundreds to thousands of qubits in DQC, LarQucut can provide a better cutting and mapping solution with lower overall overheads and achieves results closer to the ground truth.

This article proposes iSwap , a new memory page swap mechanism that reduces the ineffective I/O swap operations and improves the QoS for applications with a high priority in cloud environments. iSwap works in the OS kernel. iSwap accurately learns the reuse patterns for memory pages and makes the swap decisions accordingly to avoid ineffective operations. In the cases where memory pressure is high, iSwap compresses pages that belong to the latency-critical (LC) applications (or high-priority applications) and keeps them in main memory, avoiding I/O operations for these LC applications to ensure QoS, and iSwap evicts low-priority applications’ pages out of main memory. iSwap has a low overhead and works well for cloud applications with large memory footprints. We evaluate iSwap on Intel x86 and ARM platforms. The experimental results show that iSwap can significantly reduce ineffective swap operations (8.0%–19.2%) and improve the QoS for LC applications (36.8%–91.3%) in cases where memory pressure is high, compared with the latest LRU-based approach widely used in modern OSes.

A core work of the science and technology management system is to support the integration and utilization of massive data from distributed systems using data warehouse technology. In this paper, we focus on this work. First, we introduce the background of science and technology management by illustrating the scheme of project management business flows. Then, to define the science and technology data structure, we propose a customized star model in which we add various dimensional tables to connect the different attributes with science and technology projects. Particularly, a 4-D data cube is introduced to satisfy complicated query conditions in science and technology domain. Furthermore, to integrate data from distributed systems, we propose an architecture of data warehouse of science and technology projects (STPDW)-a five layered system that gathers raw data from the science and technology management systems, and processes the data in a standard workflow by using Extract Transform and Load (ETL) tools with predefined rules. Finally, a prototype system has also been designed to achieve the functionality of the STPDW.

The key problem in the fine management of science and technology is to model the behavior characteristics of scientific and technical personnel and then find groups through various related cooperative relationships. Aiming at the analysis of team relationship of scientific and technical personnel data, this paper proposed a method to recognize the group of scientific and technological personnel based on relational graph. The relationship model of scientific and technological personnel was designed, and based on this, the relational graph was constructed with the relationship identification and extraction from source data. A frequent item mining algorithm based on Hadoop was proposed, which enabled getting the group of scientific and technological personnel by mining and analysis of data in relational graph. In this paper, the proposed method was experimented on both open and private data sets, and compared with several classical algorithms. The results showed that the method proposed in this paper has a significant improvement in execution efficiency.

The recent trend of "everything as a service", is fostering the Internet of services (IoS) and will promote the emergence of service operation. Service operation provides the business and technical base for advanced business models. Service monitoring is a crucial issue for the guaranteed service delivery in service operation. However, most service monitoring approaches are specific and focus on IT level. The challenge of how to monitor diverse business aspect of service simply and flexibly needs to be overcome. In this paper, we present a model-driven approach for service monitoring from business perspective. In the approach, a business-oriented service monitoring metamodel is put forward to define various monitoring models on demand. The model can flexibly specify the monitored information in both business level and IT level and the monitoring process. Also, a service monitor is implemented through model-driven way which brings the scalability to its implementation.

The growing need for an integrated view of information from different sources has led to the concept of information resource integration. In this paper, a Service Oriented approach for Information Resource Integration called SOIRI is introduced. Information services are put forward as basic elements in the SOIRI approach to realize information resource integration. A design method for information services is put forward, the metadata based management of information services is discussed, and a mediation way for information services access is given, also the SOIRI system for the approach is implemented, all of which contribute to the SOIRI approach. A real project utilizing the SOIRI approach is also discussed in the paper.