Architectures in parametric component-based systems: Qualitative and quantitative modelling

One of the key aspects in component-based design is specifying the software architecture that characterizes the topology and the permissible interactions of the components of a system. To achieve well-founded design there is need to address both the qualitative and non-functional aspects of architectures. In this paper we study the qualitative and quantitative formal modelling of architectures applied on parametric component-based systems, that consist of an unknown number of instances of each component. Specifically, we introduce an extended propositional interaction logic and investigate its first-order level which serves as a formal language for the interactions of parametric systems. Our logics achieve to encode the execution order of interactions, which is a main feature in several important architectures, as well as to model recursive interactions. Moreover, we prove the decidability of equivalence, satisfiability, and validity of first-order extended interaction logic formulas, and provide several examples of formulas describing well-known architectures. We show the robustness of our theory by effectively extending our results for parametric weighted architectures. For this, we study the weighted counterparts of our logics over a commutative semiring, and we apply them for modelling the quantitative aspects of concrete architectures. Finally, we prove that the equivalence problem of weighted first-order extended interaction logic formulas is decidable in a large class of semirings, namely the class (of subsemirings) of skew fields.

CIPC: A Change Impact Propagation Computing Based Technique for Microservice Regression Testing Prioritization

Regression testing is the optimal technique that can be used in each iteration of microservice systems. However, regression testing prioritization is the only main method that gives better results. These techniques directly involve the processes of artifacts, data acquisition, analysis, and maintenance. The microservice systems have input data, which are difficult to obtain and control, while such processes are of high costs with impractical design. This paper gives a detailed study on testing prioritization technique, which is referred to as CIPC. As there are dependencies between services from API gateway logs, a novel CIPC algorithm is proposed, which is based on belief propagation. There are some rules that are directly affected by service changes. Therefore, the higher execution order of test case prioritizes CIPC, which is based on impact changes. Multiobjective prioritization algorithm is based on heuristic searching, in which sequence test cases are done by coverage. By evaluating the effectiveness of CIPC, the empirical study presents five microservice systems and four different techniques. The results describe that CIPC has improved fault detection rate with acceptable time and cost. The technique is more practical than typical artifacts, which are based on increments of system scales.

Feature Engineering for Motion Classification in Machine Vision

With the most advanced classification algorithms in the technological platform, the computational power requirement is on the surge. The paper hereby presents computationally trivial algorithms to simplify the process of computational intensive classifications techniques, especially in the Motion Classification arena. The proposed methods prove crucial in acting as a lightweight and computationally fast stepping stone to a fundamentally more significant application of Motion indexing and classification, Action recognition, and predictive analysis of motion energy. The algorithms classify the motions into linear, circular, or periodic motion types by following an appropriate execution order. They consider the tracked motion path of the object of interest as a sequence and use it as a starting point to perform all operations, resulting in a feature that can be classified into separate classes. Using a single parameter for classifying the motion engenders a faster and relatively more straightforward route to motion identification and elicits the algorithm’s uniqueness. Two algorithms are proposed, namely, Angle Derivative Technique and Determinant Method for classifying the motion into two classes (linear & circular). On the other hand, a different algorithm identifies periodic motion using the principle of correlation on the motion sequences. All the algorithms show an average accuracy of over 95%. It also elicited an average processing time of 15.6 ms and 19.86 ms for Angle Derivative Method and Determinant Method, respectively, and 31.2 ms for periodic motion on Intel(R) Core(TM) i3-5005U CPU @ 2.00 GHz and 8GB RAM. A dataset of camera-captured videos consisting of three motion types is used for testing while the proposed methods are trained on a dataset of motion described by mathematical equations with added 3σ noise levels.

Research and Design of Java Timing Processing Method

There are differences among programming languages. In contrast to C/C++ in Linux, standard Java timer has some issues, such as uncontrollable execution order, unpredictable start moment and running duration, when it’s applied to handle dense timing tasks. So it could not be directly used by some military applications with strict requirements on time sequence. In this paper, its root cause is analyzed, and then an improved method based on queue and delay feedback is presented, as well as its implementation flow chart. The test results show that, this method is able to not only ensure the correct execution order, but also reduce the uncontrollable delay. So it could satisfy the time sequence demand of military applications.

Public administration in the education system: Theoretical and methodological approaches and practical recommendations

The analysis of the prospects for improving the efficiency of public administration in education is conducted in the article. First of all, the concept of “public administration” was analyzed, its differences and similarities with the concept of public governance were determined. It was decided to determine the perspective of the study of public administration processes by the educational process, taking into account its orientation to public needs and a human-centered approach. The concept of public administration is theoretically designated as a set of processes for managing public systems in order to ensure the goals of sustainable development through the implementation of the functions of organization, execution, order and control. These functions are schematically presented and described in the article. To continue the analysis, trends in the development of the education system in Ukraine and abroad were identified. The problematic aspects have been analysed and prospects for their correction have been identified. Having analyzed, it was determined that the basic processes that require improvement in the public administration system in education are organizational, financial, reputation, and digitalization processes. An algorithm was developed to increase the implementation of the processes of public administration of educational processes, taking into account the basic requirements of society for the education system

Multiple Wirelessly Powered Sensing Platform Scheduling Algorithm Based on Dynamic Priority Preemption

The available energy of a wirelessly powered sensing platform is not enough, and there are constant real-time tasks to join the wirelessly powered sensing platform to run. So the wirelessly powered sensing system composed of many wirelessly powered sensing platforms is easy to enter the overloaded state, which may cause some tasks not to be executed on time. Therefore, to obtain as much task value as possible for the wirelessly powered sensing system when it is under the overloaded state, it is essential to design a reasonable task scheduling algorithm to arrange the task execution order. In this paper, we propose a policy named Wirelessly Dynamic Allocation Priority (WDAP) policy suitable for the wirelessly powered sensing system. The proposed WDAP is divided into a dynamic task priority allocation policy and a dynamic node priority allocation policy. Firstly, this paper analyzes the dynamic value density based on task value and execution time, studies the urgency of execution according to the execution time and the remaining idle time, and proposes the energy intensity through the task energy consumption and execution time. Based on the three impact factors of dynamic value density, urgency, and energy intensity, a policy for dynamic task priority allocation is proposed. Then, a policy for dynamic node priority allocation is proposed by combining the available energy and the energy acquisition speed of the nodes. Finally, the algorithm suitable for the wirelessly powered sensing system is proposed named Wirelessly Dynamic Real-time Task Scheduling (WDRTS) algorithm based on the WDAP. The algorithm clarifies the execution order of each task, responds to high-priority tasks first, and effectively guarantees task benefits. The experimental results show that compared with the main algorithms used in the literature among which is Generalized Earliest Deadline First, the WDRTS algorithm reduces the number of preemptive tasks by at least 36.49% and increases the successful scheduling rate of tasks by at least 15.17% and the overall system task income by at least 16.37% under high load.

Multijob Associated Task Scheduling for Cloud Computing Based on Task Duplication and Insertion

With the emergence and development of various computer technologies, many jobs processed in cloud computing systems consist of multiple associated tasks which follow the constraint of execution order. The task of each job can be assigned to different nodes for execution, and the relevant data are transmitted between nodes to complete the job processing. The computing or communication capabilities of each node may be different due to processor heterogeneity, and hence, a task scheduling algorithm is of great significance for job processing performance. An efficient task scheduling algorithm can make full use of resources and improve the performance of job processing. The performance of existing research on associated task scheduling for multiple jobs needs to be improved. Therefore, this paper studies the problem of multijob associated task scheduling with the goal of minimizing the jobs’ makespan. This paper proposes a task Duplication and Insertion algorithm based on List Scheduling (DILS) which incorporates dynamic finish time prediction, task replication, and task insertion. The algorithm dynamically schedules tasks by predicting the completion time of tasks according to the scheduling of previously scheduled tasks, replicates tasks on different nodes, reduces transmission time, and inserts tasks into idle time slots to speed up task execution. Experimental results demonstrate that our algorithm can effectively reduce the jobs’ makespan.

The Implementation of Verdict Execution on Providing Maḍiyah Maintenance Following Divorce According to Islamic Law (Case Study in Syar’iyyah Court Banda Aceh)

The article discusses the procedures of filing a plea to execute verdicts on providing māḍiyah maintenance and the effort to implement the verdicts in Syar’iyyah Court Banda Aceh. The study was conducted with a qualitative approach and the collected data were analyzed with a descriptive-analysis method based on Islamic law perspective. The result shows that the procedure and the legal effort to file an execution toward the verdict related to māḍiyah maintenance in Syar’iyyah Court are distinguished into two types of divorce, i.e. talak divorce and filed divorce. In talak divorce, the execution of the verdict related to maintenance is conducted during the reading of the talak pledge. In the filed divorce, the ex-wife’s lawsuit related to maintenance which is neglected by the ex-husband is entitled to be legally sued through filing a plea on execution. The phases as follows: (1) the ex-wife files a plea of execution to the court, (2) pay the execution cost, (3) aanmaning (a warning to the defendant), (4) the ex-husband and ex-wife comply with the summons by the court, (5) the court establishes executorial beslag (executing confiscation), (6) the court establishes an execution order, (7) an auction. According to the Islamic perspective, the execution of māḍiyah maintenance can be conducted following the ex-wife’s lawsuit to the court. The execution of māḍiyah maintenance can be performed by the court based on the valid provisions of executing māḍiyah maintenance in Syar’iyah Court upon consideration of benefit and expediency principles.

A comparative evaluation of techniques for N-way joins in wireless sensors networks

In wireless sensors networks, data are sensed and recorded as databases, and then acceded by relational queries. Joins are queries that are largely used. Joins collect data from several nodes’ table. These are operations that typically consume a lot of energy because they generate a large number of messages in the network. Researchers worked to decrease this consumed energy. Many strategies were proposed in this way, but most of them addressed only binary joins. N-way joins received few interests. N-way joins perform join operations between more than two tables. They cause greater energy consumption. Additionally, the number of execution order is very important; it grows exponentially with the number of considered tables.