Measuring software similarity base on software design artifacts has been one of the research topics in software engineering. Software similarity measurement is used in software reuse, clone detection, and learning ass...
详细信息
ISBN:
(纸本)9781728114743
Measuring software similarity base on software design artifacts has been one of the research topics in software engineering. Software similarity measurement is used in software reuse, clone detection, and learning assessment. Previous research focus on universal modeling language design artifacts. These design artifacts concern on the semantic and structure of a set of objects within a system and their interaction with themselves and objects outside the system. There are also design artifacts that model how data or information transformed into different forms, sizes, and time. This study focus on developing diagram similarity measurement base on one of those artifacts, i.e., object-oriented data flow diagrams. The measurement uses the greedy approach to calculate the similarity score of two diagrams using four elements derived from elements of object oriented data flow diagram, i.e. external entities, processes, data stores, and classes. The initial experimentation result shows that the proposed diagram similarity measurement is feasible.
In this work we report a parametric reduced order model (ROM) based on the proper orthogonal decomposition (POD) method with Galerkin projection for solving the system of time-domain Maxwell's equations. In partic...
详细信息
ISBN:
(数字)9780996007894
ISBN:
(纸本)9781728146331
In this work we report a parametric reduced order model (ROM) based on the proper orthogonal decomposition (POD) method with Galerkin projection for solving the system of time-domain Maxwell's equations. In particular, we introduce a residual-based estimation of the error associated with the ROM. Moreover, a greedy algorithm for the snapshot selection in the parameter space is developed. We investigate the behavior of the parametric POD-Galerkin ROM by considering the scattering of a plane wave by a 2-D multi-layer heterogeneous medium.
As a variant of the dominating set problem, the positive influence dominating set problem tries to find a set such that at least half neighbors of every node in the graph are included by it. Because this problem has w...
详细信息
ISBN:
(纸本)9781728118789
As a variant of the dominating set problem, the positive influence dominating set problem tries to find a set such that at least half neighbors of every node in the graph are included by it. Because this problem has wide applications in social networks, it has received more and more attention. This paper presents a fast greedy algorithm to solve the problem. Sufficient experiments on typical real networks show that compared with the existing algorithms, the quality of the solutions obtained by the algorithm is close to or even better, while the running time is greatly reduced. Especially, when the network becomes larger, the running time can be reduced by several orders of magnitude.
A modified simulated annealing algorithm is presented to improve data routing efficiency on mobile nodes, the feature of which is the use of the greedy choice principle to determine data route with the best value of t...
详细信息
ISBN:
(数字)9781728155661
ISBN:
(纸本)9781728155678
A modified simulated annealing algorithm is presented to improve data routing efficiency on mobile nodes, the feature of which is the use of the greedy choice principle to determine data route with the best value of the QoS parameter by deleting / adding nodes in it. To determine the effectiveness of the modified algorithm when creating a data transmission route between the nodes of the network used the concept of relative failure rate of the route. It is shown that the proposed algorithm provides more successful routing at network scalability than the greedy routing algorithm.
We generalize the well-known greedy approximation algorithm, by allowing gaps in the approximating sequence. We give examples of bases which are "quasi-greedy with gaps," in spite of failing to be quasi gree...
详细信息
We generalize the well-known greedy approximation algorithm, by allowing gaps in the approximating sequence. We give examples of bases which are "quasi-greedy with gaps," in spite of failing to be quasi greedy in the usual sense. However, we also show that for some classical bases (such as the normalized Haar basis in L-1, and the trigonometric'basis in L-p for p not equal 2), the greedy algorithm may diverge, even if gaps are introduced into the approximating sequence. (C) 2017 Elsevier Inc. All rights reserved.
Semester planner plays an essential role in students' society that might help students have self-discipline and determination to complete their studies. However, during the COVID-19 pandemic, they faced difficulty...
详细信息
Semester planner plays an essential role in students' society that might help students have self-discipline and determination to complete their studies. However, during the COVID-19 pandemic, they faced difficulty organizing time management and doing a manual schedule. It resulted in substantial disruptions in learning, internal assessment disturbances, and the cancellation of public evaluations. Hence, this research aims to optimize the recommended semester planner, Timetable Generator using a greedy algorithm to increase student productivity. We identified three-set control functions for each entered information: 1) validation for the inserted information to ensure valid data and no redundancy, 2) focus scale, and 3) the number of hours to finish the activity. We calculate the priority task sequence to achieve the best optimal solution. The greedy algorithm can solve the optimization problem with the best optimal solution for each situation. Then, we executed it to make a recommended semester planner. From the test conducted, the functionality shows all the features successfully passed. We validate using test accuracy for the system's reliability by evaluating it compared to the Brute Force algorithm, and the trends increase from 60% to 100%.
Seaborne loading is a commercial action that loads people and materials that need to be transported into maritime transport. The merits of this action directly affect the cost of goods. The indicators that judge the m...
详细信息
ISBN:
(纸本)9781450372619
Seaborne loading is a commercial action that loads people and materials that need to be transported into maritime transport. The merits of this action directly affect the cost of goods. The indicators that judge the merits of a transportation program mainly consider the tuotal loading time and the number of vehicles used. In order to solve the practical problems of the caravan transportation personnel and transportation vessels, this paper analyzes the transportation requirements and loading schemes of each caravan unit. The experimental results fully demonstrate the correctness of the model and the effectiveness of the loading algorithm. The follow-up study will focus on establishing a maritime loading model considering the simultaneous loading of all units, designing the berth configuration algorithm and the material loading algorithm. Under the premise of the shortest loading time, calculate the minimum material loading plan and material distribution for maritime transport scheme.
We study the optimal sampling set selection problem in sampling a noisy k-bandlimited graph signal. To minimize the effect of noise when trying to reconstruct a k-bandlimited graph signal from m samples, the optimal s...
详细信息
ISBN:
(纸本)9781538646588
We study the optimal sampling set selection problem in sampling a noisy k-bandlimited graph signal. To minimize the effect of noise when trying to reconstruct a k-bandlimited graph signal from m samples, the optimal sampling set selection problem has been shown to be equivalent to finding a m x k submatrix with the maximum smallest singular value, sigma(min) [3]. As the problem is NP-hard, we present a greedy algorithm inspired by a similar submatrix selection problem known in computer science and to which we add a local search refinement. We show that 1) in experiments, our algorithm finds a submatrix with larger sigma(min )than prior greedy algorithm [3], and 2) has a proven worst-case approximation ratio of 1/(1 + epsilon)k, where epsilon is a constant.
A 2-matching of a graph G is a spanning subgraph with maximum degree two. The size of a 2-matching U is the number of edges in U and this is at least n-(U) where n is the number of vertices of G and denotes the number...
详细信息
A 2-matching of a graph G is a spanning subgraph with maximum degree two. The size of a 2-matching U is the number of edges in U and this is at least n-(U) where n is the number of vertices of G and denotes the number of components. In this article, we analyze the performance of a greedy algorithm 2greedy for finding a large 2-matching on a random 3-regular graph. We prove that with high probability, the algorithm outputs a 2-matching U with (U) = Theta(n(1/5)).
Compressed sensing (CS) has been one of the great successes of applied mathematics in the last decade. This paper proposes a new method, combining the advantage of the Compressive Sampling Matching Pursuit (CoSaMP) al...
详细信息
Compressed sensing (CS) has been one of the great successes of applied mathematics in the last decade. This paper proposes a new method, combining the advantage of the Compressive Sampling Matching Pursuit (CoSaMP) algorithm and the Quasi-Newton Iteration Projection (QNIP) algorithm, for the recovery of sparse signal from underdetermined linear systems. To get the new algorithm, Quasi-Newton Projection Pursuit (QNPP), the least-squares technique in CoSaMP is used to accelerate convergence speed and QNIP is modified slightly. The convergence rate of QNPP is studied, under a certain condition on the restricted isometry constant of the measurement matrix, which is smaller than that of QNIP. The fast version of QNPP is also proposed which uses the Richardson's iteration to reduce computation time. The numerical results show that the proposed algorithms have higher recovery rate and faster convergence speed than existing techniques. (c) 2017 Elsevier B.V. All rights reserved.
暂无评论