The Pólya group of a number field is a particular subgroup of the ideal class group of that number field. In this article, we discuss some recent results on Pólya groups of number fields, their connection wi...
详细信息
The existing active power control methods which take single wind farm as a unit and regulate it independently cannot satisfy the complex control demand of large-scale wind power base. Therefore, wind farms are unitize...
详细信息
ISBN:
(纸本)9781467356688
The existing active power control methods which take single wind farm as a unit and regulate it independently cannot satisfy the complex control demand of large-scale wind power base. Therefore, wind farms are unitized as wind farm cluster (WFC) as a whole in this paper. An active power economic dispatch model of WFC considering short-term wind power prediction is proposed, which aims at maximizing the active power output of WFC while minimizing tie line power loss. As this dispatch model is a complicated integerprogramming problem with nonlinear constraints, it is transferred to the integer linear programming (ILP) problem and solved by commercial MILP solvers under the general algebraic modeling system (GAMS). Simulation results of an actual WFC in Northeast China proved the method to be effective and feasible.
Global routing is a critical step in VLSI physical design. This paper proposes a novel pathfinding model based on integer linear programming for VLSI global routing. The Lagrangian relaxation method combined with a di...
详细信息
ISBN:
(纸本)9798350323481
Global routing is a critical step in VLSI physical design. This paper proposes a novel pathfinding model based on integer linear programming for VLSI global routing. The Lagrangian relaxation method combined with a direction-aware weighted A*-algorithm is developed to quickly solve the model to obtain a better initial routing solution, which is further optimized by a designed multi-stage rip-up & rerouting algorithm. In each stage of rip-up & rerouting, different routing algorithms and cost functions are used to optimize the overflow and wire length. SPRoute and CUGR are two state-of-the-art global routers. Our proposed global routing algorithm outperforms SPRoute 1.0 & 2.0 in both the wire length and the number of vias on the ISPD08 benchmarks. On the ISPD18 benchmarks, compared to CUGR, our algorithm has about 5.1% reduction in the number of vias, and the average runtime is 4.89x speedup;compared to SPRoute 2.0, our algorithm has about 1.7% reduction on the average wire length, and the number of vias is comparable.
This paper introduces a novel compatibility attack to detect a steganographic message embedded in the DCT domain of a JPEG image at high-quality factors (close to 100). Because the JPEG compression is not a surjective...
详细信息
ISBN:
(纸本)9798400700545
This paper introduces a novel compatibility attack to detect a steganographic message embedded in the DCT domain of a JPEG image at high-quality factors (close to 100). Because the JPEG compression is not a surjective function, i.e. not every DCT blocks can be mapped from a pixel block, embedding a message in the DCT domain can create incompatible blocks. We propose a method to find such a block, which directly proves that a block has been modified during the embedding. This theoretical method provides many advantages such as being completely independent to Cover Source Mismatch, having good detection power, and perfect reliability since false alarms are impossible as soon as incompatible blocks are found. We show that finding an incompatible block is equivalent to proving the infeasibility of an integer linear programming problem. However, solving such a problem requires considerable computational power and has not been reached for 8x8 blocks. Instead, a timing attack approach is presented to perform steganalysis without potentially any false alarms for large computing power.
A global forcing set for maximal matchings of a graph G = (V(G), E(G)) is a set S subset of E(G) such that M-1 boolean AND S # M-2 boolean AND S for each pair of maximal matchings M-1 and M-2 of G. The smallest such s...
详细信息
A global forcing set for maximal matchings of a graph G = (V(G), E(G)) is a set S subset of E(G) such that M-1 boolean AND S # M-2 boolean AND S for each pair of maximal matchings M-1 and M-2 of G. The smallest such set is called a minimum global forcing set, its size being the global forcing number for maximal matchings phi(gm) (G) of G. In this paper, we establish lower and upper bounds on the forcing number for maximal matchings of the corona product of graphs. We also introduce an integer linear programming model for computing the forcing number for maximal matchings of graphs.
This study examines a method for deciphering the handwritten dancing men graphic shown in "The Dancing Men." We attempted to reproduce and explain Holmes's reasoning for the graphic cipher by using a mat...
详细信息
ISBN:
(纸本)9781665482639
This study examines a method for deciphering the handwritten dancing men graphic shown in "The Dancing Men." We attempted to reproduce and explain Holmes's reasoning for the graphic cipher by using a mathematical programming approach. Moreover, we studied the validity of Holmes's reasoning and demonstrated a procedure to decipher the cipher computationally. Herein, we propose a mathematical solution to clarify the ambiguity in Holmes' conjecture. Although the proposed method has not been implemented, its feasibility is confirmed through partial data creation and analysis.
Missing or incomplete data poses a significant challenge during data collection for forecasting, estimation, and decision-making purposes. Given the profound impact of data quality on the performance of machine learni...
详细信息
ISBN:
(纸本)9798350361513;9798350372304
Missing or incomplete data poses a significant challenge during data collection for forecasting, estimation, and decision-making purposes. Given the profound impact of data quality on the performance of machine learning algorithms, data imputation plays a crucial role in many applications. Considering potential dependencies between data attributes enhances the reliability of the imputation process. In this paper, we address this by incorporating fuzzy relaxation in the differential dependencies (DDs) among attributes and propose a novel fuzzy multi-objective linear (FMOL) model to achieve optimal imputation performance. The proposed model aims to maximize the imputation rate while minimizing violations of crisp DDs. We employ the Improved Zimmermann Method to solve the FMOL model effectively. Experimental results on the Kaggle dataset demonstrate that our proposed approach outperforms existing methods in terms of imputed fields and imputation accuracy.
The reduction of greenhouse gas emissions represents one of the major concerns worldwide. In telecommunications, the research community and the industry are developing various solutions to decrease the energy consumpt...
详细信息
ISBN:
(纸本)9781665475983
The reduction of greenhouse gas emissions represents one of the major concerns worldwide. In telecommunications, the research community and the industry are developing various solutions to decrease the energy consumption of infrastructures. In this paper, we focus on the energy efficiency of IP networks and, in particular, on energy-aware routing as a good complement to power management mechanisms inside routers. We present a safe energy-aware routing solution where the network controller leverages knowledge about device behaviors for power management to further increase energy savings. As energy saving mechanisms can impact network reliability, decisions are taken to avoid any disruption. First, we propose a mathematical model for the associated optimization problem, and then, we develop a hybrid Benders decomposition and Column generation algorithm to solve it. Finally, we present a performance evaluation on a real backbone network with two possible implementations of the solution.
The top two divisions of the Argentinean professional basketball system have since 2014-2015 used a season schedule format similar to that used by the NBA in which games are played all through the week, replacing the ...
详细信息
The top two divisions of the Argentinean professional basketball system have since 2014-2015 used a season schedule format similar to that used by the NBA in which games are played all through the week, replacing the previous setup where all games were scheduled on weekends. This change has confronted the Argentinean league organizers with new scheduling challenges, one of which is the assignment of referees to games. The present article addresses this assignment problem using a tool based on an integer linear programming model. The objective is to minimize the total cost of trips made by the referees while also satisfying a series of other conditions. The problem is broken down into a series of relatively small subproblems representing successive periods of the season, and the solution is obtained using a rolling horizon heuristic. The approach was tested by applying it to the First Division's 2015-2016 season, the last one before introducing the approach presented in this article, when referees were still assigned using manual methods. The travel costs simulated by the model were 26% lower than the total travel costs actually incurred under the manual assignments, and all of the restrictions that had been requested by league officials were satisfied. The model was used by the First Division for the 2016-2017 and 2017-2018 seasons and in 2017-2018 also by the Second Division.
The European regulatory framework establishes that the production of green hydrogen (H2) must be supported either from the electricity grid through a power purchase agreement (PPA), or from intermittent renewable ener...
详细信息
暂无评论