Search

Internet of Things (IoT) systems generate a vast volume of data to process, and the volume of data generated by the IoT will continue to expand exponentially in the future. Due to the large-scale nature of such systems and their geographically distributed nature, how to optimally place operators and brokers for data processing across cloud, fog, and edge is the main concern of this paper. Furthermore, in the past, IoT systems relied on cloud-based brokers. If the communication between operators in an IoT application has to be regulated by a broker located in the cloud, the advantages brought by the processing of nodes located at the edge and the fog may be neglected. We consider various factors, such as the impact of different network topologies on operators and brokers, the needs of IoT application users, the performance of sensor layers, and the location characteristics of IoT sensors. In diverse placement strategies, the characteristics of the broker have been given special attention. This paper considers the combined architecture of the operator and broker on the edge, fog, and cloud as an optimization problem of minimizing computational processing and data transmission cost. We propose jointly placing the IoT application's operator and broker on the edge, fog, and cloud nodes. Then we proposed two algorithms: the low-complexity heuristic algorithm named GREEDY and the genetic algorithm called GA. Simulation results show that, in most situations, the GA placement method outperforms others and provides a near-optimal solution. [ABSTRACT FROM AUTHOR]

Demand for imaging of large area targets by space-based assets such as constellations of Earth Observation Satellites (EOS) is on the rise for different applications. The area targets coverage cannot be achieved by a single satellite in a single observation opportunity, as the region for imaging spreads wider than the coverage swaths of imaging sensors. Hence, the imaging satellites are scheduled in a cooperative way to achieve maximum coverage of the area in a given planning time horizon. The scheduling algorithms also aim to maximize or minimize some specific objectives of interest while simultaneously complying with all resource constraints for an efficient use of precious space resources. As the current generation satellites are highly agile, there are many ways of choosing an imaging location in the target area for each single observation opportunity of a satellite. Even though the possible imaging region in continuous space is discretized into a finite number of strips for each observation, the huge combinatorial search space formed with all satellites' imaging opportunities makes the problem intractable. Thus, the area target imaging scheduling is a complex combinatorial NP-hard optimization problem. Many exact and heuristic methods were evolved to provide a solution to this scheduling problem. Even though the exact methods solve the problem to optimality, they are limited to smaller problem instances because of the high computational complexities involved in those methods. More focus is seen in the literature on heuristic approaches as they guarantee scheduling performance with feasible solutions within an acceptable computational complexity. This paper presents our efficient heuristic approach proposed for the scheduling problem for imaging a large area target using a constellation of multiple satellites. Our approach is an extension of a widely used greedy approach in combination with insights from dynamic programming. In this paper, first we addressed the scheduling problem by describing it in detail and formulating it into a non-linear integer programming problem, considering the multi-objectives of achieving maximum coverage and minimum imaging resolution. The solution to the problem comprises two phases, namely the area decomposition phase and the scheduling phase. In the area decomposition phase, the area target is divided into strips dynamically for each observation opportunity of a satellite. Then exact observation period of each strip is computed using a simplified semi-analytical computational method. In the scheduling phase, we applied our heuristic search strategy, namely Forward and Backward Heuristic Search (FBHS) to obtain a near optimal solution within an acceptable computational time. Through the extensive simulations conducted under various scenarios, the effectiveness of the proposed method is verified in comparison with the baseline greedy approach. • The large area target imaging scheduling for multiple satellites is a complex combinatorial NP hard optimization problem. • Greedy algorithm, which guarantee the scheduling performance, is a widely used method. • Forward and Backward Heuristic Search method is proposed for area target image scheduling. [ABSTRACT FROM AUTHOR]

Graph coloring is a fundamental topic in graph theory that requires an assignment of labels (or colors) to vertices or edges subject to various constraints. We focus on the harmonious coloring of a graph, which is a proper vertex coloring such that for every two distinct colors i, j at most one pair of adjacent vertices are colored with i and j. This type of coloring is edge-distinguishing and has potential applications in transportation networks, computer networks, airway network systems. The results presented in this paper fall into two categories: in the first part of the paper we are concerned with the computational aspects of finding a minimum harmonious coloring and in the second part we determine the exact value of the harmonious chromatic number for some particular graphs and classes of graphs. More precisely, in the first part we show that finding a minimum harmonious coloring for arbitrary graphs is APX-hard and that the natural greedy algorithm is a p n)-approximation. In the second part, we determine the exact value of the harmonious chromatic number for all 3-regular planar graphs of diameter 3 and some cycle-related graphs. [ABSTRACT FROM AUTHOR]

The problem of finding a maximum size matching in a graph (known as the maximum matching problem) is one of the most classical problems in computer science. Despite a significant body of work dedicated to the study of this problem in the data stream model, the state-of-the-art single-pass semi-streaming algorithm for it is still a simple greedy algorithm that computes a maximal matching, and this way obtains 1 / 2 -approximation. Some previous works described two/three-pass algorithms that improve over this approximation ratio by using their second and third passes to improve the above mentioned maximal matching. One contribution of this paper continues this line of work by presenting new three-pass semi-streaming algorithms that work along these lines and obtain improved approximation ratios of 0.6111 and 0.5694 for triangle-free and general graphs, respectively. Unfortunately, a recent work Konrad and Naidu (Approximation, randomization, and combinatorial optimization. Algorithms and techniques, APPROX/RANDOM 2021, August 16–18, 2021. LIPIcs, vol 207, pp 19:1–19:18, 2021. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.19) shows that the strategy of constructing a maximal matching in the first pass and then improving it in further passes has limitations. Additionally, this technique is unlikely to get us closer to single-pass semi-streaming algorithms obtaining a better than 1 / 2 -approximation. Therefore, it is interesting to come up with algorithms that do something else with their first pass (we term such algorithms non-maximal-matching-first algorithms). No such algorithms were previously known, and the main contribution of this paper is describing such algorithms that obtain approximation ratios of 0.5384 and 0.5555 in two and three passes, respectively, for general graphs. The main significance of our results is not in the numerical improvements, but in demonstrating the potential of non-maximal-matching-first algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes a novel energy management strategy satisfying real-time and highly efficient energy management strategies for fuel cell hybrid electric vehicles (FCHEVs). The strategy is based on model predictive control (MPC), which integrates long short-term memory (LSTM) and dynamic programming (DP). A high-precision powertrain model of the investigated FCHEV is established for subsequent simulations. After training under several typical working conditions, LSTM is designed to forecast future power demands of the entire vehicle. Using the prediction results, the DP algorithm calculates the control scheme based on model predictive control. Considering the economy and durability of power sources, the results of four different control strategies are compared: thermostat, power following, traditional DP, and MPC. The MPC proposed in this paper reduces the total usage cost per 100 km on the test set by 9%, 33.5%, and −4.6%. • The economy and durability of vehicular fuel cell system are both considered. • The LSTM neural network is imported into MPC theory for vehicular power prediction. • The key parameters of MPC and LSTM are determined by referring to the greedy algorithm. • The computational load in MPC optimisation is reduced by simplifying DP algorithm. • The real-time performance of the supposed EMS on-board is validated. [ABSTRACT FROM AUTHOR]

In this paper, a fault feature extraction method based on the combination of computational order tracking (COT) and variational mode decomposition (VMD) is proposed to solve the problem of fault feature extraction in a gearbox under variable speed conditions. First, a speed estimation method based on a forward-backward greedy algorithm and Fourier fitting is proposed to solve the speed estimation problem under variable speed conditions. Then, a feature extraction method based on COT, VMD, and fast kurtometry is proposed. COT is used to calculate the order. After the signal is decomposed by VMD, a fast kurtogram is used to filter the modal components with obvious fault features so as to extract fault features. Finally, combined with the analysis of actual equipment examples, the experimental results show that steady-state filtering can effectively filter the background noise and improve the signal-to-noise ratio. The rotation speed estimated by the forward–backward greedy algorithm and Fourier fitting is very close to the actual speed, which verifies that the method proposed in this paper can effectively solve the problem of fault feature extraction of a gearbox under variable speed conditions. [ABSTRACT FROM AUTHOR]

In the online facility assignment problem OFA (k , { c i } i = 1 k) , there exist k servers s 1 , ... , s k on a metric space where each s i has an integer capacity c i and a request arrives one-by-one. The task of an online algorithm is to irrevocably match a current request with one of the servers with vacancies before the next request arrives. As special cases for OFA (k , { c i } i = 1 k) , we consider OFA (k , { c i } i = 1 k) on a line , which is denoted by OFAL (k , { c i } i = 1 k) and OFAL eq (k , { c i } i = 1 k) , where the latter is the case of OFAL (k , { c i } i = 1 k) with equidistant servers. In this paper, we perform the competitive analysis for the above problems. As a natural generalization of the greedy algorithm grdy, we introduce a class of algorithms called MPFS (Most Preferred Free Servers) and show that any MPFS algorithm has the capacity-insensitive property, i.e., for any MPFS algorithm alg for OFA (k , { c i } i = 1 k) , if alg is c -competitive when c 1 = ⋯ = c k = 1 , then alg is c -competitive for general { c i } i = 1 k . By applying the capacity-insensitive property of the greedy algorithm grdy, we derive the matching upper and lower bounds 4 k − 5 on the competitive ratio of grdy for OFAL eq (k , { c i } i = 1 k). To investigate the capability of MPFS algorithms, we show that the competitive ratio of any MPFS algorithm alg for OFAL eq (k , { c i } i = 1 k) is at least 2 k − 1. Then, we propose a new MPFS algorithm idas (Interior Division for Adjacent Servers) for OFAL (k , { c i } i = 1 k) and show that the competitive ratio of idas for OFAL eq (k , { c i } i = 1 k) is at most 2 k − 1 , i.e., idas for OFAL eq (k , { c i } i = 1 k) is best possible in all the MPFS algorithms. We also give numerical experiments to investigate the performance of idas and grdy and show that idas performs better than grdy for distribution of request sequences with locality. [ABSTRACT FROM AUTHOR]

Navigation resource allocation for low-earth-orbit (LEO) constellations refers to the optimal allocation of navigational assets when the number and allocation of satellites in the LEO constellation have been determined. LEO constellations can not only transmit navigation enhancement signals but also enable space-based monitoring (SBM) for real-time assessment of GNSS signal quality. However, proximity in the frequencies of LEO navigation signals and SBM can lead to significant interference, necessitating isolated transmission and reception. This separation requires that SBM and navigation signal transmission be carried out by different satellites within the constellation, thus demanding a strategic allocation of satellite resources. Given the vast number of satellites and their rapid movement, the visibility among LEO, medium-earth-orbit (MEO), and geostationary orbit (GEO) satellites is highly dynamic, presenting substantial challenges in resource allocation due to the computational intensity involved. Therefore, this paper proposes an optimal allocation algorithm for LEO constellation navigation resources based on dynamic programming. In this algorithm, a network model for the allocation of navigation resources in LEO constellations is initially established. Under the constraints of visibility time windows and onboard transmission and reception isolation, the objective is set to minimize the number of LEO satellites used while achieving effective navigation signal transmission and SBM. The constraints of resource allocation and the mathematical expression of the optimization objective are derived. A dynamic programming approach is then employed to determine the optimal resource allocation scheme. Analytical results demonstrate that compared to Greedy and Divide-and-Conquer algorithms, this algorithm achieves the highest resource utilization rate and the lowest computational complexity, making it highly valuable for future resource allocation in LEO constellations. [ABSTRACT FROM AUTHOR]

The estimation of spatiotemporal data from limited sensor measurements is a required task across many scientific disciplines. In this paper, we consider the use of mobile sensors for estimating spatiotemporal data via Kalman filtering. The sensor selection problem, which aims to optimize the placement of sensors, leverages innovations in greedy algorithms and low-rank subspace projection to provide model-free, data-driven estimates. Alternatively, Kalman filter estimation balances model-based information and sparsely observed measurements to collectively make better estimation with limited sensors. It is especially important with mobile sensors to utilize historical measurements. We show that mobile sensing along dynamic trajectories can achieve the equivalent performance of a larger number of stationary sensors, with performance gains related to three distinct timescales: (i) the timescale of the spatiotemporal dynamics, (ii) the velocity of the sensors, and (iii) the rate of sampling. Taken together, these timescales strongly influence how well-conditioned the estimation task is. We draw connections between the Kalman filter performance and the observability of the state space model and propose a greedy path planning algorithm based on minimizing the condition number of the observability matrix. This approach has better scalability and computational efficiency compared to previous works. Through a series of examples of increasing complexity, we show that mobile sensing along our paths improves Kalman filter performance in terms of better limiting estimation and faster convergence. Moreover, it is particularly effective for spatiotemporal data that contain spatially localized structures, whose features are captured along dynamic trajectories. [ABSTRACT FROM AUTHOR]

The motivation of task scheduling in heterogeneous computing systems is the optimal management of heterogeneous distributed resources as well as the exploitation of system capabilities. Energy consumption is one of the most important issues in dealing with task scheduling in heterogeneous distributed systems. In addition to energy, the task completion time and the task cost have also been added to the concerns of the users. Since the nature of computing systems is heterogeneous and dynamic, task scheduling with traditional methods is inefficient. Meta-heuristic approaches for task scheduling in heterogeneous distributed systems are open problems that have attracted the attention of researchers. So far, many meta-heuristic approaches have addressed the task scheduling problem. However, most of these algorithms are developed for homogeneous systems and optimize only one of the quality-of-service parameters. With this motivation, this paper presents an optimization for energy-aware design of task scheduling in heterogeneous distributed systems using meta-heuristic approaches. We simultaneously consider several parameters such as energy, task completion time and task execution cost for task scheduling. The Harris Hawk Optimization (HHO) algorithm is considered for the optimization task due to its adaptability to large search spaces. We combine HHO with a greedy algorithm to avoid local optima and early convergence. The evaluation of the proposed method has been done through numerical simulations. Experimental results show promising performance of the proposed method in terms of energy consumption. [ABSTRACT FROM AUTHOR]

Influence maximization (IM) problem for messages propagation is an important topic in mobile social networks. The success of the spreading process depends on the mechanism for selection of the influential user. Beside selection of influential users, the computation and running time should be considered in this mechanism to ensure the accurecy and efficient. In this paper, considering that the overhead of exact computation varies nonlinearly with fluctuations in data size, random algorithm with smoother complexity change was designed to solve the IM problem in combination with greedy algorithm. Firstly, we proposed a method named two-hop neighbor network influence estimator to evaluate the influence of all nodes in the two-hop neighbor network. Then, we developed a novel greedy algorithm, the random walk probability cost-effective with lazy-forward (RWP-CELF) algorithm by modifying cost-effective with lazy-forward (CELF) with random algorithm, which uses 25–50 orders of magnitude less time than the state-of-the-art algorithms. We compared the influence spread effect of RWP-CELF on real datasets with a theoretically proven algorithm that is guaranteed to be approximately optimal. Experiments show that the spread effect of RWP-CELF is comparable to this algorithm, and the running time is much lower than this algorithm. [ABSTRACT FROM AUTHOR]

Let G be the complete Euclidean graph on a set of points embedded in the plane. Given a constant t > 1 , a spanning subgraph G ′ of G is said to be a t -spanner, or simply a spanner, if for any pair of nodes p , q in G there exists a t -path in G ′ , i.e., a path between p and q whose length is at most t times their distance in G. Gap-greedy spanner, proposed by Arya and Smid, is a light weight and bounded degree spanner in which a pair of points p , q is guaranteed to have a t -path, if there exists at least one edge with some special criteria in the spanner. Existing algorithms for computing the gap-greedy spanner determine the existence of such an edge for each pair of points by examining the edges of the spanner, which takes O (n) time, however in this paper, we have presented a method by which this task can be done in O (1) time. Using the proposed method and well-separated pair decomposition, we have proposed a linear-space algorithm that can compute the gap-greedy spanner in O (n 2) time. How to use the well-separated pair decomposition to compute this spanner was proposed by Bakhshesh and Farshi, however using an example, we have shown that one of the algorithms they have proposed for this purpose is incorrect. We have performed various experiments to measure the duration and amount of memory used by the algorithms for computing this spanner. The results of these experiments showed that the proposed method, without a significant effect on the amount of memory consumed compared to previous algorithms, leads to a significant acceleration in the construction time of this spanner. [ABSTRACT FROM AUTHOR]

The aim of this paper is to optimize the allocation of multiple advertisements on a Web banner, where the price of an advertisement depends on the location at the banner. This problem can be defined as a two-dimensional single orthogonal knapsack problem with a location-based pixel-price model. A formulation is proposed in which the problem is specified as a 0–1 integer programming problem. As this problem is NP-complete, we mainly focus on a heuristic approach to solve the problem. We propose two new heuristic algorithms: the reactive GRASP algorithm and the partitioning left-justified algorithm. Next to that, we present an exact algorithm that is able to solve small problem instances in a reasonable time. These newly presented algorithms are compared with respect to efficiency and effectiveness to existing algorithms that solve the problem without a location-based pixel-price model. To test the quality of the algorithms, we have executed two experiments. The results of these experiments show that overall the reactive GRASP algorithm is the most effective algorithm, whereas the greedy stripping algorithm is the most efficient. [ABSTRACT FROM AUTHOR]

In this paper, we present a thorough study of the regularized submodular maximization problem, in which the objective $ f:=g-\ell $ f := g − ℓ can be expressed as the difference between a submodular function and a modular function. This problem has drawn much attention in recent years. While existing works focuses on the case of g being monotone, we investigate the problem with a nonmonotone g. The main technique we use is to introduce a distorted objective function, which varies weights of the submodular component g and the modular component ℓ during the iterations of the algorithm. By combining the weighting technique and measured continuous greedy algorithm, we present an algorithm for the matroid-constrained problem, which has a provable approximation guarantee. In the cardinality-constrained case, we utilize random greedy algorithm and sampling technique together with the weighting technique to design two efficient algorithms. Moreover, we consider the unconstrained problem and propose a much simpler and faster algorithm compared with the algorithms for solving the problem with a cardinality constraint. [ABSTRACT FROM AUTHOR]

This paper studies the multi-trip vehicle routing problem with multiple time windows, which extends the multi-trip vehicle routing problem by deciding not only the sequence of customers that each vehicle serves but also the service time window of each customer. It also requires that the delivery service time is within the selected time windows and that the total demand of the customers served by the vehicle on each trip does not exceed the maximum carrying capacity. For solving the studied problem, we develop a mixed integer linear programming model with the objective of minimizing the total travel distance of vehicles and design a tailored iterative local search heuristic. Within the framework of the iterative local search, an improved Solomon greedy insertion algorithm suitable for multiple time windows and multi-trip scenarios is designed to generate the initial solution, and local search operators such as Or-opt and Relocate, as well as Random Exchange perturbation operations, are also developed. The experiment results demonstrate the effectiveness of the proposed model and algorithm and confirm that by providing customers with multiple time windows option, carriers can flexibly plan vehicle routes and select appropriate service time windows, thereby reducing the number of vehicles used and the total distance travelled and improve delivery success. [ABSTRACT FROM AUTHOR]

The multi-task allocation has become the key to be solved urgently in applying a coal gangue sorting robot system (CGSRS) in raw coal with high throughput. This paper constructs a multi-task allocation framework of CGSRS for time-varying raw coal flow (TVRCF), including task decomposition, task allocation, and collaborative strategy. Establish the TVRCF decomposition model using the tumbling time window method to obtain the gangue model. A multi-task allocation model based on M/M/s queuing model with impatient customers is proposed because arrival time, granularity, and spatial position of the gangue model are uncertain. By introducing trajectory function and designing benefit function, to solve environment states of sorting area. Creating an iterative mechanism for environment states based on the infinite Markov process, using service time and arrival time interval. An adaptive weights rule based on the greedy algorithm (GAW) is proposed to improve the benefit of multi-task allocation. Simulating 18 groups of TVRCF with 9 productivity. Experimental results show that the proposed framework suits the multi-task allocation of CGSRS to TVRCF. The GAW rule always ensures the optimal sorting rate, the near-optimal task completion success rate, and the manipulator utilization rate. In addition, the stability of the GAW rule is best. [ABSTRACT FROM AUTHOR]

Identifying relevant variables among numerous potential predictors has been of primary interest in modern regression analysis. While stochastic search algorithms have surged as a dominant tool for Bayesian variable selection, when the number of potential predictors is large, their practicality is constantly challenged due to high computational cost as well as slow convergence. In this paper, we propose a new Bayesian variable selection scheme by using hybrid deterministic–deterministic variable selection (HD-DVS) algorithm that asymptotically ensures a rapid convergence to the global mode of the posterior model distribution. A key feature of HD-DVS is that it allows us to circumvent the iterative computation of inverse matrices, which is a common computational bottleneck in Bayesian variable selection. A simulation study is conducted to demonstrate that our proposed method outperforms existing Bayesian and frequentist methods. An analysis of the Bardet–Biedl syndrome gene expression data is presented to illustrate the applicability of HD-DVS to real data. [ABSTRACT FROM AUTHOR]

Aggregation and Orthogonal Frequency Division Multiple Access (OFDMA) are two fundamental features allowing access points and stations to benefit from the high physical transmission rates of the recent WiFi standards. They aim to pool frames with a unique overhead (mainly the physical header and the acknowledgment) to mitigate its impact on the throughput. Natural implementations of these features lead to nonFIFO (First In, First Out) service disciplines that may generate unfairness between frames. In this paper, we evaluate three stateless service disciplines that require a low level of resources (computation and memory). We prove that when OFDMA does not introduce additional delay, one of these greedy algorithms minimizes the overhead. Whereas this service discipline maximizes the system capacity, it generates strong unfairness between the stations. Instead, the two other algorithms may offer a good trade-off between capacity and fairness. These algorithms are evaluated through a theoretical framework and simulations that replay actual Wi-Fi traces. [ABSTRACT FROM AUTHOR]

In the context of the rapid development of the Internet of Vehicles, virtual reality, automatic driving and the industrial Internet, the terminal devices in the network show explosive growth. As a result, more and more information is generated from the edge of the network, which makes the data throughput increase dramatically in the mobile communication network. As the key technology of the fifth-generation mobile communication network, mobile edge caching technology which caches popular data to the edge server deployed at the edge of the network avoids the data transmission delay of the backhaul link and the occurrence of network congestion. With the growing scale of the network, distributing hot data from cloud servers to edge servers will generate huge energy consumption. To realize the green and sustainable development of the communication industry and reduce the energy consumption of distribution of data that needs to be cached in edge servers, we make the first attempt to propose and solve the problem of edge caching data distribution with minimum energy consumption (ECDDMEC) in this paper. First, we model and formulate the problem as a constrained optimization problem and then prove its NP-hardness. Subsequently, we design a greedy algorithm with computational complexity of O (n 2) to solve the problem approximately. Experimental results show that compared with the distribution strategy of each edge server directly requesting data from the cloud server, the strategy obtained by the algorithm can significantly reduce the energy consumption of data distribution. [ABSTRACT FROM AUTHOR]

With the rapid development of remote sensing technology, remote sensing products have found increasingly widespread applications across various fields. Nevertheless, as the volume of remote sensing image data continues to grow, traditional data retrieval techniques have encountered several challenges such as substantial query results, data overlap, and variations in data quality. Users need to manually browse and filter a large number of remote sensing datasets, which is a cumbersome and inefficient process. In order to cope with these problems of traditional remote sensing image retrieval methods, this paper proposes a remote sensing image retrieval algorithm for dense data (DD-RSIRA). The algorithm establishes evaluation metrics based on factors like imaging time, cloud coverage, and image coverage. The algorithm utilizes the global grids to create an ensemble coverage relation between images and grids. A locally optimal initial solution is obtained by a greedy algorithm, and then a local search is performed to search for the optimal solution by combining the strategies of weighted gain-loss scheme and novel mechanism. Ultimately, it achieves an optimal coverage of remote sensing images within the region of interest. In this paper, it is shown that the method obtains a smaller number of datasets with lower redundancy and higher data utilization and ensures the data quality to a certain extent in order to accurately meet the requirements of the regional coverage of remote sensing images. [ABSTRACT FROM AUTHOR]

This paper focuses on radio resource management (RRM) in multi-user dual-function radar communication (DFRC) systems using orthogonal frequency division multiplexing (OFDM) waveforms. We propose two RRM schemes, one from the perspective of sum rate maximization and the other from the perspective of user fairness maximization. These optimization problems are non-convex due to the presence of mixed integer terms, making them difficult to solve. To address these challenges, we have employed a decomposition approach to transform these two complex problems into separate, more readily solvable ones. In addressing the sum rate maximization problem, we initially introduce a heuristic greedy algorithm to obtain a resource allocation scheme that satisfies radar performance requirements. Subsequently, we utilize a cyclic iterative method along with KKT conditions to solve the sum rate maximization problem for communication users. Concerning the fairness maximization problem for communication users, we similarly employ a heuristic greedy algorithm to obtain a resource allocation scheme that meets radar performance constraints. Then utilize the Lagrangian dual method to solve the multi-user fairness maximization problem for communication users. Our experimental results confirm the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes a learning-based simulated annealing (LSA) algorithm to tackle the NP-hard unequal area facility layout problem (UA-FLP). The goal of UA-FLP is to optimize the material flow between facilities of different sizes to enhance manufacturing efficiency. The LSA algorithm incorporates a novel solution representation, an improved penalty function and a diverse set of neighborhood operators to refine the search space. By utilizing a reinforcement learning-based controller, LSA enables a flexible and efficient exploration through state detection and fast feedback. A two-stage greedy local search is employed to further exploit the search space and enhance solution quality. Additional features include temperature sampling generation to minimize parameter settings, a greedy initial solution production to relax infeasible restrictions. Experimental results on 16 well-known instances validate LSA's high proficiency compared to several state-of-the-art algorithms, and it exceeds 7 best-known solutions within a comparable time, particularly its excellent performance in large instances within a short execution time. [ABSTRACT FROM AUTHOR]

The significance of air quality monitoring for analyzing impact on public health is growing worldwide. A crucial part of smart city development includes deployment of suitable air pollution sensors at critical locations. Note that there are various air quality measurement instruments, ranging from expensive reference stations that provide accurate data to low-cost sensors that provide less accurate air quality measurements. In this research, we use a combination of sensors and monitors, which we call hybrid instruments, and focus on optimal placement of such instruments across a region. The objective of the problem is to maximize a satisfaction function that quantifies the weighted closeness of different regions to the places where such hybrid instruments are placed (here weights for different regions are quantified in terms of the relative population density and relative PM 2.5 concentration). Note that there can be several constraints such as those on budget, the minimum number of reference stations to be placed, or the set of important regions where at least one sensor should be placed. We develop two algorithms to solve this problem. The first one is a genetic algorithm that is a metaheuristic and that works on the principles of evolution. The second one is a greedy algorithm that selects the locally best choice in each iteration. We test these algorithms on different regions from India with varying sizes and other characteristics such as population distribution, PM 2.5 emissions, or available budget. The insights obtained from this paper can be used to quantitatively place reference stations and sensors in large cities rather than using ad hoc procedures or rules of thumb. [ABSTRACT FROM AUTHOR]

Enhancing the robustness of complex networks is of great practical significance as it ensures the stable operation of infrastructure systems. We measure its robustness by examining the size of the largest connected component of the network after initial attacks. However, traditional research on network robustness enhancement has mainly focused on low-order networks, with little attention given to higher-order networks, particularly higher-low order coupling networks(the largest connected component of the network must exist in both higher-order and low-order networks). To address this issue, this paper proposes robust optimization methods for higher-low order coupled networks based on the greedy algorithm and the simulated annealing algorithm. By comparison, we found that the simulated annealing algorithm performs better. The proposed method optimizes the topology of the low-order network and the higher-order network by randomly reconnecting the edges, thereby enhancing the robustness of the higher-order and low-order coupled network. The experiments were conducted on multiple real networks to evaluate the change in the robustness coefficient before and after network optimization. The results demonstrate that the proposed method can effectively improve the robustness of both low-order and higher-order networks, ultimately enhancing the robustness of higher-low order coupled networks. [ABSTRACT FROM AUTHOR]

Heat exchanger network (HEN) synthesis is a vibrant research field in process system engineering, with substantial contributions to energy conservation and emissions reduction initiatives. The optimal design of a heat exchanger network is not an easy task due to the abundance of local optima in the solution space caused by the non-linear, non-convex, and discontinuous nature of the problem. Generally, several heuristic algorithms employ a greedy evolutionary mechanism, optimize through greedily accepting the decrease in the objective function, and converge to obtain the optimal solution. The Random Walk algorithm has a simple evolutionary mechanism, is prone to mutation, and exhibits high flexibility. However, the algorithm's inherent persistent greediness in searching restrict the scope of the search. Thus, this paper proposes an anti-greedy concept based on the Random Walk method to serve as the basis of a new synthesis approach called the Anti-greedy Random Walk algorithm. Two strategies are proposed in the algorithm, which broaden the solution domain by slowing down rapid unit reduction and accepting imperfect solutions, respectively. One strategy is to thoroughly search for the integer and continuous variables of the HEN problem by covering a much larger search space. Another is to escape the local extrema and move forward to discover more possibilities. Quantitative data demonstrates the algorithm's ability to avoid the local extrema and enhance the search effectiveness. Three different scales of classical cases are used in this work and the obtained results are superior to the published ones. [Display omitted] • An improved Random Walk algorithm is presented for heat exchanger network synthesis. • Two anti-greedy strategies are proposed from an objective and structural perspective. • Both integer and continuous variables are explored by covering a larger search space. • Three benchmark cases were solved with better results than previously literature. [ABSTRACT FROM AUTHOR]

Theoretical studies on evolutionary algorithms have developed vigorously in recent years. Many such algorithms have theoretical guarantees in both running time and approximation ratio. Some approximation mechanism seems to be inherently embedded in many evolutionary algorithms. In this paper, we identify such a relation by proposing a unified analysis framework for a global simple multiobjective evolutionary algorithm (GSEMO) and apply it on a minimum weight general cover problem, which is general enough to subsume many important problems including the minimum submodular cover problem in which the submodular function is real-valued, and the minimum connected dominating set problem for which the potential function is nonsubmodular. We show that GSEMO yields theoretically guaranteed approximation ratios matching those achievable by a greedy algorithm in expected polynomial time when the potential function g is polynomial in the input size and the minimum gap between different g-values is a constant. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by National Natural Science Foundation of China [11771013, U20A2068]; Zhejiang Provincial Natural Science Foundation of China [LD19A010001]. [ABSTRACT FROM AUTHOR]

In problems such as variable selection and graph estimation, models are characterized by Boolean logical structure such as the presence or absence of a variable or an edge. Consequently, false-positive error or false-negative error can be specified as the number of variables/edges that are incorrectly included or excluded in an estimated model. However, there are several other problems such as ranking, clustering, and causal inference in which the associated model classes do not admit transparent notions of false-positive and false-negative errors due to the lack of an underlying Boolean logical structure. In this paper, we present a generic approach to endow a collection of models with partial order structure, which leads to a hierarchical organization of model classes as well as natural analogs of false-positive and false-negative errors. We describe model selection procedures that provide false-positive error control in our general setting, and we illustrate their utility with numerical experiments. [ABSTRACT FROM AUTHOR]

Regarding the issue of information freshness in systems that aid in data collection using unmanned aerial vehicles (UAVs), a data collection algorithm that is based on freshness and UAV assistance is proposed. Under the limitations of wireless sensor node communication distance and UAV parameters, the optimization problem of minimizing the average spatial correlation age of information (SCAoI) of all nodes in the area is set up. This problem is solved by optimizing the number of clusters, UAV flight trajectories, and the order of data collection from cluster member nodes. The maximum communication distance of the nodes is used as the cluster formation radius, and the maximum-minimum distance clustering algorithm is used to cluster the nodes in the region to obtain the minimum number of clusters. After it has been proven that the trajectory optimization problem in this study is NP-hard, the ant colony algorithm is applied to obtain the minimum flight time and the corresponding trajectory. By using the greedy algorithm to determine the member nodes in the sequence of data collection for a cluster, the instantaneous SCAoI of the UAV arriving at the cluster head is solved. Simulation results show that the proposed algorithm in this paper can effectively improve the freshness of data and reduce the average SCAoI of the system compared with the algorithm in the comparative literature, reducing the average SCAoI by about 61%. [ABSTRACT FROM AUTHOR]

The concept of jump system, introduced by Bouchet and Cunningham (1995), is a set of integer points satisfying a certain exchange property. We consider the minimization of a separable convex function on a jump system. It is known that the problem can be solved by a greedy algorithm. In this paper, we are interested in whether the greedy algorithm has the geodesic property, which means that the trajectory of the solutions generated by the algorithm is a geodesic from the initial solution to a nearest optimal solution. We show that a special implementation of the greedy algorithm enjoys the geodesic property, while the original algorithm does not. As a corollary to this, we present a new greedy algorithm for linear optimization on a delta-matroid and show that the algorithm has the geodesic property. [ABSTRACT FROM AUTHOR]

Models play a major role in model-based development and serve as the main artifacts that stakeholders aim to achieve. As it is difficult to develop good-quality models, repositories of models start emerging for reuse purposes. Yet, these repositories face several challenges, such as model representation, scalability, heterogeneity, and how to search for models. In this paper, we aim to address the challenge of querying model repositories by proposing a generic search framework that looks for models that match the intention of the user. The framework is based on a greedy search approach using a similarity function that considers type similarity, structure similarity, and label similarity. We evaluate the framework's efficiency on different model types: UML class diagrams, Human Know-How, and ME maps. We further compare it with existing alternatives. The evaluation indicates that the framework achieved high performance within a bounded time, and the framework can be adapted to different modeling languages for searching related, reusable models. [ABSTRACT FROM AUTHOR]

In recent years, wireless sensor networks (WSNs), as the underlying basic interface of the Internet of Things, have developed rapidly, and the performance requirements of WSNs are constantly improved in various application environments. However, in the practical application, the traditional wireless sensor network has the problem of uneven and limited energy consumption. To solve this problem, a non-uniform clustering algorithm based on node classification and multi-level data transmission (NCMLT) is proposed in this paper. The algorithm divides the nodes into S1 and S2 levels according to the distance from the base station, and transmits data in chain and cluster structures respectively, effectively combining the advantages of the two structures. In the stage of cluster head election, the threshold formula of low energy adaptive clustering hierarchy (LEACH) is improved, and the remaining energy of nodes and other factors are added into the candidate cluster head election function. When clustering, considering the rationality of the competitive radius, the distance and energy factors are adjusted to form non-uniform clustering, which reduces the energy cost of the network. Based on the greedy algorithm, the chain structure is constructed according to the defined chain head election formula, and the optimal chain node is selected by calculating the relay value of the cluster chain as the relay node for data transmission between the cluster head that is closer to the base station and the base station, and the data transmission distance between the nodes is optimized by means of hierarchical multi-hop. Through simulation experiments, compared with the energy-efficient uneven clustering algorithm (EEUC) and the uneven clustering routing algorithm based on ant colony optimization (URACO), the network lifetime of NCMLT algorithm is increased by 47.43% and 5.02%, respectively, which proves that NCMLT algorithm can effectively balance node energy consumption and extend network lifetime. [ABSTRACT FROM AUTHOR]

Participatory crowdsensing (PCS) is an innovative data sensing paradigm that leverages the sensors carried in mobile devices to collect large-scale environmental information and personal behavioral data with the user's participation. In PCS, task assignment and path planning pose complex challenges. Previous studies have only focused on the assignment of individual tasks, neglecting or overlooking the associations between tasks. In practice, users often tend to execute similar tasks when choosing assignments. Additionally, users frequently engage in tasks that do not match their abilities, leading to poor task quality or resource wastage. This paper introduces a multi-task assignment and path-planning problem (MTAPP), which defines utility as the ratio of a user's profit to the time spent on task execution. The optimization goal of MATPP is to maximize the utility of all users in the context of task assignment, allocate a set of task locations to a group of workers, and generate execution paths. To solve the MATPP, this study proposes a grade-matching degree and similarity-based mechanism (GSBM) in which the grade-matching degree determines the user's income. It also establishes a mathematical model, based on similarity, to investigate the impact of task similarity on user task completion. Finally, an improved ant colony optimization (IACO) algorithm, combining the ant colony and greedy algorithms, is employed to maximize total utility. The simulation results demonstrate its superior performance in terms of task coverage, average task completion rate, user profits, and task assignment rationality compared to other algorithms. [ABSTRACT FROM AUTHOR]

Integrated access and backhaul (IAB) networks offer transformative benefits, primarily their deployment flexibility in locations where fixed backhaul faces logistical or financial challenges. This flexibility is further enhanced by IAB's inherent ability for adaptive network expansion. However, existing IAB network planning models, which are grounded in the facility location problem and are predominantly addressed through linear programming, tend to neglect crucial geographical constraints. These constraints arise from the specific deployment constraints related to the positioning of IAB donors to the core network, and the geographic specificity required for IAB-node placements. These aspects expose an evident research void. To bridge this, our research introduces a geographically aware optimization methodology tailored for IAB deployments. In this paper, we detail strategies for both single-hop and multi-hop situations, concentrating on IAB donors distribution and geographical constraints. Uniquely in this study, we employ the inherent data rate limitations of network nodes to determine the maximum feasible hops, differing from traditional fixed maximum hop count methods. We devise two optimization schemes for single-hop and multi-hop settings and introduce a greedy algorithm to effectively address the non-convex multi-hop challenge. Extensive simulations across various conditions (such as diverse donor numbers and node separations) were undertaken, with the outcomes assessed against the benchmark of the single-hop scenario's optimal solution. Our findings reveal that the introduced algorithm delivers efficient performance for geographically constrained network planning. [ABSTRACT FROM AUTHOR]

This paper discusses trajectory planning for multiple UAVs in IoT networks to minimize the average Age of Information (AoI). First, using a graph theoretical approach, we present an explicit formula for the average AoI in both Hamiltonian and non-Hamiltonian cycles. These relations tie the upper bound of average AoI with Traveling Salesman Problem (TSP) as well as provide a mechanism to improve AoI in a given flight trajectory by means of creating new cycles around a specific set of IoT devices. Further, we give a lower bound for the average AoI. Secondly, we propose a heuristic algorithm for trajectory planning based on unsupervised clustering. The IoT networks are divided into k subsets and for each of them, a tour is found by a greedy algorithm. Then, the tours are merged together to find the best set of tours for each UAV in terms of average AoI. Moreover, some optimizations are applied on each flight trajectory to improve the average AoI. The evaluation results show that our scheme is efficient compared to both the baseline greedy approach and TSP optimal tour. [ABSTRACT FROM AUTHOR]

Industry 5.0 advocates for a sustainable industry, particularly in terms of energy. One of the most fundamental elements of comprehension is knowing when the systems are operated, as this is key to locating energy intensive subsystems and operations. Such knowledge is often lacking in practice. Activation statuses can be recovered from sensor data though. Some non-intrusive sensors (accelerometers, current sensors, etc.) acquire mixed signals containing information about multiple actuators at once. This paper considers different industrial settings in which the identification of binary sub-system activation sequences is sought. In this context, source signals are assumed to be quasi-stationary and they may be correlated. Existing methods either restrict these assumptions, e.g. , by imposing orthogonality or noise characteristics, or lift them using additional assumptions, typically using nonlinear transforms. This paper addresses these limitations, and introduces the unsupervised complex semi-binary matrix factorization (ℂ SBMF) as its main contribution. In particular, we show that the exact recovery of source activation sequences from non-intrusive sensor data is intrinsically tied to the presence of problematic phase shifts, the causes of which are detailed. A greedy algorithm is proposed, iteratively resynchronizing sources to converge towards the maximum decomposition of each operation despite these phase shifts. The ℂ SBMF is verified and compared to existing techniques on synthetic use cases, then validated on experimental data with signals of different nature. To that occasion, the CAFFEINE dataset for unsupervised time series multi-label classification is introduced. [ABSTRACT FROM AUTHOR]

This paper introduces a collaborative allocation model designed for multiple UAVs and diverse targets in maritime combat situations. The model incorporates factors such as distance, angle, interception rate, and recognition rate to comprehensively represent the UAVs' overall damage advantage against targets. Given the complexity of real-world environments and real-time demands, large-scale UAV swarm missions necessitate swift and effective responses. To address this, the paper proposes a Two-Stage Greedy Auction Algorithm, enabling the rapid and efficient completion of cooperative strike tasks within large-scale UAV swarms while preventing deadlock occurrences. In the initial allocation stage, the entropy weight method is utilized to assess task advantages, ensuring a rational allocation criterion for various metrics during the strike process. Subsequently, to enhance the overall effective strike rate within all constraints, a reassignment algorithm is designed based on effective strike benefit indices and the initial assignment result. Simulation results demonstrate the algorithm's quick and stable running time in small-scale and large-scale scenarios. [ABSTRACT FROM AUTHOR]

In the present paper we identify those filtered probability spaces (Ω , F , (F n) , P) that determine already the martingale type of a Banach space X. We isolate intrinsic conditions on the filtration (F n) of purely atomic σ -algebras which determine that the upper ℓ p estimates ‖ f ‖ L p (Ω , X) p ⩽ C p (‖ E (f | F 0) ‖ L p (Ω , X) p + ∑ n = 1 ∞ ‖ E (f | F n) − E (f | F n − 1) ‖ L p (Ω , X) p) , f ∈ L p (Ω , X) imply that the Banach space X is of martingale type p. Our paper complements G. Pisier's investigation [12] and continues the work by S. Geiss and second named author in [3]. [ABSTRACT FROM AUTHOR]

With the development of economic globalization, distributed hybrid flow shop scheduling problem (DHFSSP) has become prevalent in realistic manufacturing systems. Moreover, to accord with the actual production scenarios and satisfy the requirement of manufacturing market, it is imperative to comprehensively explore various complex manufacturing scenarios (e.g., production assembly) and production-constrained resources (e.g., worker resources) in DHFSSP. However, the integration mode of DHFSSP, assembly shop problem (ASP), and dual-resource constraints (DRC) has not been reported in existing literature. Thus, to fill out this research gap, this paper first attempts to investigate DAHFSSP-DRC with minimization the total tardiness (T T D). To solve this problem, a mixed-integer linear programming (MILP) model and a knowledge-based iterated greedy algorithm (KBIG) are presented. The novelties of KBIG are as follows: (1) An efficient decoding is developed to improve the solution's quality; (2) A knowledge-based NEH (KB-NEH) initialization strategy is presented to generate an initial solution; (3) A knowledge-based destruction and construction is designed to improve the exploration capability; (4) A product-based local search is proposed to enhance the exploitation capability. Additionally, to validate the proposed model, we implement CPLEX to solve it on 24 small-sized instances. To verify the effectiveness of the proposed KBIG, extensive experiments are conducted to compare with other 7 comparison algorithms on 405 large-sized instances. Experimental results illustrate that KBIG is superior to its competitors. • This paper first investigates DAHFSSP-DRC with minimization TTD. • A MILP model and a KBIG are proposed for DAHFSSP-DRC. • The importance level of different knowledge is considered in KBIG. • Experimental results prove the effectiveness of MILP model and KBIG. [ABSTRACT FROM AUTHOR]

• A reflection model and an error transformation model are built to analyze the disturbances induced by MRVs in the captured fringe patterns. • The exposure time range of each pixel can be calculated pixel-by-pixel by setting a proper phase error threshold. • An efficient way to globally minimize the number of exposures based on the greedy algorithm is introduced. • Highly accurate point cloud integration (APCI) is adjusted to evaluate the reconstruction accuracy pixel by pixel, which can indicate the overall integrity of the highly-accurate point cloud. Fringe projection profilometry (FPP) has been widely applied to three-dimensional (3D) shape measurement with the advantages of non-contact and high accuracy. However, measuring the scenes of multi-reflective variations (MRVs) is still a tricky task for conventional FPP because the dark-field and saturation could lead to phase errors and reconstruction errors. In this paper, a novel high dynamic range (HDR) technique based on accurate pixel-by-pixel phase-error adjustment strategy is proposed, which is mainly focus on both accuracy and quality of the reconstruction. A reflection model and an error transformation model are built to analyze the disturbances induced by MRVs in the captured fringe patterns. By setting a proper phase error threshold, the exposure time range of each pixel can be calculated. Finally, a greedy algorithm is introduced to globally minimize the number of exposures. Experiments results have verified that our proposed method can improve both the measurement accuracy and accurate point cloud integrality (APCI) compared with conventional FPP and several HDR methods, making it suitable to be further applied in the HDR 3D shape measurement. [ABSTRACT FROM AUTHOR]

This paper presents a novel approach for distributed management of energy communities. The proposed method utilizes a stochastic profile steering algorithm as a greedy heuristic. The optimization process considers random parameters such as local forecasted demand, photovoltaic (PV) production, and the initial energy of electric vehicles (EVs) as embedded scenarios. Profile steering coordinates the flexible electricity assets within an energy community by determining the contribution of each prosumer's profile to the average value of the objective function. It iteratively selects the prosumer that contributes the most until no further improvements can be made. This process scales linearly with the number of controllable prosumers and can achieve various community-level objectives, such as maximizing self-sufficiency or minimizing aggregated cost-of-energy, even when dealing with non-convex optimization problems for modeling each prosumer's local energy management system. The outcome of the proposed method optimizes the average value of the community's objective while ensuring that grid limitations are met within a specified probability. The proposed method is evaluated through simulations involving small-scale communities (5 households) and large-scale communities (100 households). The results demonstrate the efficiency, flexibility, and scalability of the proposed method, as well as its ability to reschedule the aggregated demand to ensure that grid limits are not violated with at least a 95% probability. • A new approach for distributed power aggregation of energy communities is proposed. • Stochastic profile steering is used as the main algorithm. • Average community-level goals are optimized while meeting probabilistic grid limits. • Local forecasted demand, PV production, and EVs of prosumers are considered as random variables. • Results demonstrate the efficiency, flexibility, and scalability of the proposed method. [ABSTRACT FROM AUTHOR]

• The multi-model belief propagation method implemented using Gaussian mixture. • Extracting sensor association measurements using greedy algorithm. • Fusion of all association measurements using the belief iterative updating algorithm. • Multisensor-multitarget three-dimensional tracking simulation scenario with clutter. This paper presents a novel Gaussian mixture multi-model belief propagation (GMM-BP) filter for maneuvering multitarget tracking with multiple sensors. The filter is built upon the BP-based multisensor-multitarget tracking scheme, enabling accurate estimation of target numbers and states. It assumes linear Gaussian target motion, birth process, and sensor measurement models and utilizes the Gaussian mixture model to represent the target's marginal posterior probability density function. Additionally, multiple models are incorporated for target motion, enhancing the maneuvering target tracking capability. Closed-form recursions for means, covariances, and weights of Gaussian components in the filter are derived. To enhance scalability with the number of sensors, a simplified multi-sensor data fusion process is proposed, thereby preserving a linear relationship between Gaussian components and the number of sensors. The performance of the filter was evaluated in a three-dimensional (3D) simulated environment. Compared to the particle-implemented BP filter and the labeled multi-Bernoulli (LMB) filter, the proposed GMM-BP filter exhibited a significant improvement in computational efficiency while maintaining a high level of tracking accuracy. [ABSTRACT FROM AUTHOR]

In the rapidly expanding field of e-commerce logistics, the optimisation of last-mile delivery solutions is paramount. This paper introduces a novel methodology that addresses this challenge by generating approximate Pareto fronts in a hybrid truck-drone delivery system. Specifically, we examine a generalized single truck multi-drone problem that allows multi-visit flight missions and rendezvous points distinct from launch locations. Our goal is providing decision-makers with a portfolio of optimal routing solutions that balance service time and environmental impact, criteria that are increasingly shaping decision-making in this domain. To achieve this, we introduce a bivector coding scheme inspired by flow-shop scheduling problems and implement a Simulated Annealing algorithm. This algorithm features an advanced stopping mechanism, negating the need for manual adjustments by utilizing a distinctive blend of a domination rate and a Kalman filter. Importantly, our framework employs an iterated greedy search algorithm to evolve from initial solutions towards identifying non-dominated solutions sets, which are then ranked using a hypervolume coefficient. To validate our methodology, we conduct a sensitivity analysis on two different size instances using a full factorial design of experiments. Our analysis reveals crucial insights into the impact of the number of drones, their autonomy, and their flight speed settings. From it, we conclude that it is a robust and adaptable framework for its practical application for obtaining Pareto fronts solutions among which picking the ultimate routing to be implemented. [ABSTRACT FROM AUTHOR]

Intrusion detection technology can actively detect abnormal behaviors in the network and is important to the security of Industrial Internet of Things (IIOT). However, there are some issues with the current intrusion detection technology for IIOT, such as extreme imbalance in the number of samples of different classes in the dataset, redundant and meaningless features in the samples, and the inability of traditional intrusion detection methods to meet the requirements of detection accuracy in the increasingly complex IIOT. In view of the extreme imbalance of classes, this paper applies the hierarchical clustering algorithm to the under-sampling technology, which reduces the number of majority samples while reducing the loss of information of majority samples, and solves the problem of missing detection and false detection of minority samples caused by sample imbalance. In order to avoid feature redundancy and interference, this paper proposes an optimal feature selection algorithm based on greedy thought. This algorithm can obtain the optimal feature subset of each type of data in the data set, thus eliminating redundant and interfering features. Aiming at the problem of insufficient detection ability of traditional detection methods, this paper proposes a deep neural network intrusion detection model based on the parallel connection of global and local subnetworks. This model obtains the overall benchmark detection of the dataset through the deep neural network, and then strengthens the detection effect of each subclass through the parallel connection of subnetworks, greatly improving the performance of the intrusion detection algorithm. The experimental results show that the method described in this paper can improve the intrusion detection for IIOT. [ABSTRACT FROM AUTHOR]

Convolution is a fundamental and computationally expensive primitive and finds ubiquitous in deep neural networks (DNNs). The evolving DNNs have spurred the emergence of numerous accelerators and they successfully achieve high throughput. However, for DNN inference with small batch sizes, the computational resources of the accelerators are often under-utilized, and the overhead of offloading is significant. Compared to accelerators, the CPU can better meet fast response requirements of inference, flexibly handle various models, and is suitable for various scenarios (from edge to data center). Therefore, CPU remains an attractive platform for DNN inference, despite the sub-optimal performance, and resource efficiency. In this paper, we propose CUTE, a scalable CPU-centric and ultra-utilized tensor engine for convolutions. It co-designs data flow and hardware architecture to leverage the data reuse and parallelism of convolutions. CUTE is composed of several small tensor elements (TEs) and two-level buffers. It employs a decoupled access-execution architecture and greedy strategy to feed data to TEs, enabling it to achieve ultra utilization and great scalability. CUTE is tightly coupled with the CPU to minimize offloading latency, thereby providing efficient convolution computing capabilities for the system. Experimental results show that under the same bandwidth, CUTE achieves an average performance improvement of 3.8x compared with the CPU AVX512 unit and 1.6x compared with the CPU AMX unit. Besides, CUTE achieves a speedup of 7.0x and 3.9x over Nvidia V100 GPU and Eyeriss accelerator respectively, due to higher utilization of computing units. [ABSTRACT FROM AUTHOR]

The maximization of non-negative monotone submodular functions under a certain constraint is intensively studied. However, there are few works considering the maximization of non-monotone non-submodular functions, which even might be negative. These functions also have many applications, such as optimal marketing for revenue maximization over social networks, budget allocation problems, and Epidemic transmission, etc. In our paper, we discuss the maximization of the non-monotone non-submodular functions under a knapsack constraint, which even might be negative, and explore the performance under the greedy algorithm. We obtain some improved approximate ratios, for the functions with different properties, such as the non-negative weak-monotone weak-submodular functions, and the weak-submodular weak-supermodular functions that might be negative. Moreover, we generalize the results to the functions with weak subadditivity and curvature. [ABSTRACT FROM AUTHOR]

Distributed scheduling problems have been extensively studied due to their critical roles in industrial applications. Most research focuses on identical distributed factories and the objective of minimizing the makespan, ignoring the widely existing heterogeneous factories and delivery targets in reality. This paper aims to establish a distributed heterogeneous flowshop scheduling scenario with the objective of minimizing total tardiness (DHPFSP-t), and solve it using an improved iterative greedy algorithm. A mixed-integer programming model and several problem-specific properties are proposed for this novel scheduling scenario. Based on the distributed heterogeneous characteristics of the problem, four constructive algorithms are established to quickly generate initial solutions. Among them, the better solution is selected as the initial solution of the iterative greedy algorithm. To enhance the performance of the iterative greedy algorithm, the concept of tabu memory is incorporated and novel destruction and local search processes are devised. Thorough experiments are conducted to verify the effectiveness of the mixed-integer programming model of the scenario, the constructive heuristics and the improved iterative greedy algorithm. The result confirms the validity of the proposed model and the good performance of the proposed method. • We study a distributed heterogeneous scheduling with total tardiness criterion. • Several problem-specific properties are proposed. • We present a tabu memory based iterated greedy algorithm. • We provide a benchmark and the best obtained solutions for the problem. [ABSTRACT FROM AUTHOR]

The Minimum Vertex Cover P roblem is the optimization problem of finding a vertex cover V c of minimal cardinality in a given graph. It is a classic NP-hard problem, and various algorithms have been suggested for it. In this paper, we start with a basic algorithm for solving the problem. Using a probabilistic idea, we use it to develop an improved algorithm. The algorithm is greedy; at each step it adds to the cover a vertex such that the expected cover size, if we continue randomly after this step, is minimal. We study the new algorithm theoretically and empirically, and run simulations to compare its performance to that of some algorithms of a similar nature. [ABSTRACT FROM AUTHOR]