On the Jurisdiction of Foreign Divorce Cases in China

This article takes China’s jurisdiction over foreign-related divorce cases as an entry point, and systematically expounds the provisions of China’s foreign-related divorce jurisdiction. According to my country’s regulations, my country’s jurisdiction over a foreign-related divorce is vertically divided into direct jurisdiction and indirect jurisdiction, and horizontally divided into personal Jurisdiction, territorial jurisdiction, exclusive jurisdiction, and jurisdiction by agreement. In my country’s Civil Procedure Law and related judicial interpretations, the domicile of the “plaintiff is the defendant” and the location of the plaintiff under certain circumstances is the main focus. The general solution path of the case; At the same time, my country's regulations on foreign-related divorce cases still have shortcomings, and there are still many areas that need to be improved. This article analyzes the shortcomings and the areas to be improved.

QoS Correlation-based Service Composition Algorithm for Multi-constraint Optimal Path

With the development of network service integration, in order to obtain a better quality of service (QoS) guarantee, In this Paper,We consider the characteristics of integrated network service composition and correlation, this paper proposes a approximate algorithm based on multi-constraint optimal path selection (MCOPS). We analyses the QoS correlation criteria, correlation ratios, and Skyline algorithms to calculate the optimal path by dynamic programming, record the path nodes, and obtain the optimal service composition path that meets the user's demand. Simulation results demonstrate the good performance of the proposed algorithm in both the average calculation time and the solution path quality.

Review of the Literature on Career Cognition in High School Students

This paper summarizes and summarizes the career cognition of high school students. Explore from the career cognitive level, education methods, understanding methods, and coping measures of high school students. It objectively describes the current situation and solution path of the career planning of high school students under the new college entrance examination reform.

CR CyberMar as a Solution Path towards Cybersecurity Soundness in Maritime Logistics Domain

Cybersecurity is now considered as one of the main challenges for the maritime sector. At the same time, the maritime transport industry remains one of the most relevant and driving sectors for the global economy in terms of both the number and operations of active companies, and infrastructure and investments, thanks to the policies pushed to attract the latter. Maritime information systems, whether on board ships or in ports, are numerous, built with standard components available on the market and in many cases designed without factoring in well the ever-growing cyber risk. Digital infrastructure has become essential in operating and managing systems critical to the safety and security of shipping and ports. Specifically, Cyber-MAR is focused upon the simulation and emulation of the real world of maritime systems (e.g. Logistics, Supply Chain). This research effort will examine the creation of a federated Cyber Range (CR Cyber-MAR) which will include various platforms and interconnected systems on board a vessel or ashore, in order to allow a hyper-realistic simulation of cyber-attacks and trying to assimilate them into real-life. Then the identified CR Cyber range will be integrated in the Cybersecurity training needs for different levels of operators. The investigation of the discussed topic will essentially use qualitative techniques, analysing data obtained from publications, official and commercial reports, and interviews of a targeted audience.

Detecting possibly frequent change-points: Wild Binary Segmentation 2 and steepest-drop model selection—rejoinder

Many existing procedures for detecting multiple change-points in data sequences fail in frequent-change-point scenarios. This article proposes a new change-point detection methodology designed to work well in both infrequent and frequent change-point settings. It is made up of two ingredients: one is “Wild Binary Segmentation 2” (WBS2), a recursive algorithm for producing what we call a ‘complete’ solution path to the change-point detection problem, i.e. a sequence of estimated nested models containing $$0, \ldots , T-1$$ 0 , … , T - 1 change-points, where T is the data length. The other ingredient is a new model selection procedure, referred to as “Steepest Drop to Low Levels” (SDLL). The SDLL criterion acts on the WBS2 solution path, and, unlike many existing model selection procedures for change-point problems, it is not penalty-based, and only uses thresholding as a certain discrete secondary check. The resulting WBS2.SDLL procedure, combining both ingredients, is shown to be consistent, and to significantly outperform the competition in the frequent change-point scenarios tested. WBS2.SDLL is fast, easy to code and does not require the choice of a window or span parameter.

A reduction heuristic for the all-colors shortest path problem

The All-Colors Shortest Path is a recently introduced NP-Hard optimization problem, in which a color is assigned to each vertex of an edge weighted graph, and the aim is to find the shortest path spanning all colors. The solution path can be not simple, that is it is possible to visit multiple times the same vertices if it is a convenient choice. The starting vertex can be constrained (ACSP) or not (ACSP-UE). We propose a reduction heuristic based on the transformation of any ACSP-UE instance into an Equality Generalized Traveling Salesman Problem one. Computational results show the algorithm to outperform the best previously known one.