The paper proves that an odd composite integer $N$ can be factorized in at most $O( 0.125u(log_2N)^2)$ searching steps if $N$ has a divisor of the form $2^a{u} +1$ or $2^a{u}-1$ with $a > 1$ being a positive integer and $u > 1$ being an odd integer. Theorems and corollaries are proved with detail mathematical reasoning. Algorithms to factorize the kind of odd composite integers are designed and tested by factoring certain Fermat numbers. The results in the paper are helpful to factorize the related kind of odd integers as well as some big Fermat numbers

The efficiency with which an integer may be factored into its prime factors determines several public key cryptosystems′ security in use today. Although there is a quantum-based technique with a polynomial time for integer factoring, on a traditional computer, there is no polynomial time algorithm. We investigate how to enhance the wheel factoring technique in this paper. Current wheel factorization algorithms rely on a very restricted set of prime integers as a base. In this study, we intend to adapt this notion to rely on a greater number of prime integers, resulting in a considerable improvement in the execution time. The experiments on composite numbers n reveal that the proposed algorithm improves on the existing wheel factoring algorithm by about 75%

Twin prime numbers are two prime numbers which have the difference of 2 exactly. In other words, twin primes is a pair of prime that has a prime gap of two. Sometimes the part “twin prime” is used for a pair of twin primes; an alternative name for this is prime twin or prime pair. Up to date there is no any valid proof/disproof for twin prime conjecture. Through this research paper, my attempt is to provide a valid proof for twin prime conjecture.

We propose a model for medium-term hydropower scheduling (MTHS) with variable head and uncertainty in inflow, reserve capacity, and energy price. With an increase of intermittent energy sources in the generation mix, it is expected that a flexible hydropower producer can obtain added profits by participating in other markets than just the energy market. To capture this added potential the hydropower system should be modeled with a higher level of details. In this context, we apply an algorithm based on stochastic dual dynamic programming (SDDP) to solve the nonconvex MTHS problem, and show that the use of Strengthened Benders (SB) cuts to represent the expected future profit (EFP) function provide accurate scheduling results for slightly nonconvex problems. A method to visualize the EFP function in a dynamic programming setting is provided, serving as a useful tool for a priori inspection of the EFP shape and its nonconvexity.

This paper answers the need to plan a cost-minimizing charging schedule for electric buses and proposes a three-stage procedure, which is oriented around the participation of electric buses aggregator in a day-ahead energy auction. First, optimization models are provided to determine charging availability expressed as minimum and maximum hourly energy requirements taking into account detailed, minutely characteristics and constraints of the charging equipment and the buses. Next, the auction model is formulated by considering aggregated bids submitted by the electric buses aggregator once the charging availability is determined. Hence, the day-ahead prices reflect the optimal schedules of auction participants, and the bus aggregator is safe against peak-hour charging. Finally, hourly auction-based schedules are disaggregated into optimal minutely charging schedules. Mixed-integer linear programming models are formulated for aggregation-disaggregation stages investigated in this paper, while the variables and constraints introduced into the auction model are linear. The proposed methodology has been verified on a recently published case study of a real-world bus service operated on The Ohio State University campus. We show that the auction-based charging of all 22 buses outperforms as-soon-as-possible schedules by 7% to even 28% of daily cost savings. Using the aggregated bids, buses can flexibly shift charges between high- and low-price periods while preserving constraints of the charging equipment and timetables.

In this paper, the author obtains an analytic exact form of Heaviside function, which is also known as Unit Step function and constitutes a fundamental concept of the Operational Calculus.In particulat, this function is explicitly expressed in a very simple manner by the aid of purely algebraic representations. The novelty of this work is that the proposed explicit formula is not performed in terms of non – elementary special functions, e.g. Dirac delta function or Error function and also is neither the limit of a function, nor the limit of a sequence of functions with point wise or uniform convergence. Hence, it may be much more appropriate and useful in the computational procedures which are inserted into Operational Calculus techniques and other engineering practices.

The purpose of this study is to ascertain whether implementation difficulty can be used in slot allocation model as a new mechanism for slightly weakening grandfather right. According to which, a linear integer programming model is designed to compare and analyze displacement, implementation difficulty and priority with different weights. Test results show that the implementation difficulty can be significantly reduced without causing excessive displacement and disruption of existing priorities, by weight setting while declared capacity is cleared. In addition to this, whether the movements are listed in order of descending priority or not have great impact on displacement and implementation difficulty within slot allocation model. Capacity is surely a key factor affecting displacement and implementation difficulties. This study contributes to propose a new mechanism for slightly weakening grandfather right, which can help decision makers to upgrade slot allocation policies.

Let $S=\left(s_1, \ldots, s_n\right)$ be a finite sequence of integers. Then $S$ is a Gilbreath sequence of length $n$, $S\in\mathbb{G}_n$, iff $s_1$ is even or odd and $s_2, \ldots, s_n$ are respectively odd or even and $\min\mathbb{K}_{\left(s_1, \ldots, s_m\right)}\leq s_{m+1}\leq\max\mathbb{K}_{\left(s_1, \ldots, s_m\right)}\forall m\in\left[\left.1, n\right)\right.$. This, applied to the order sequence of prime number $P$, defines Gilbreath polynomials and two integer sequences A347924 \cite{oeisA347924} and A347925 \cite{oeisA347925} which are used to prove that Gilbreath conjecture $GC$ is implied by $p_n-2^{n-1}\leqslant\mathcal{P}_{n-1}\left(1\right)$ where $\mathcal{P}_{n-1}\left(1\right)$ is the $n-1$-th Gilbreath polynomial at 1.

In this note we, first, recall that the sets of all representatives of some special ordinary residue classes become $\left( m,n\right) $-rings. Second, we introduce a possible $p$-adic analog of the residue class modulo a $p$-adic integer. Then, we find the relations which determine, when the representatives form a $\left( m,n\right) $-ring. At the very short spacetime scales such rings could lead to new symmetries of modern particle models.

In this paper, by using the q-integer, we introduce a new generalization of Fibonacci and Lucas sedenions called q-Fibonacci and q-Lucas sedenions. We present some fundamental properties of these type of sedenions such as Binet formulas, exponential generating fuctions, summation formulas, Catalan's identity, Cassini's identity and d'Ocagne's identity.

University course scheduling (UCS) is one of the most important and time-consuming issues that all educational institutions face yearly. Most of the existing techniques to model and solve UCS problems have applied approximate methods, which are different in terms of efficiency, performance, and optimization speed. Accordingly, this research aims to apply an exact optimization method to provide an optimal solution to the course scheduling problem. In other words, in this research, an integer programming model is presented to solve the USC problem. In this model, hard and soft constraints include the facilities of classrooms, courses of different levels and compression of students' curriculum, courses outside the faculty and planning for them, and the limited time allocated to the professors. The objective is to maximize the weighted sum of allocating available times to professors based on their preferences in all periods. To evaluate the presented model's feasibility, it is implemented using the GAMS software. Finally, the presented model is solved in a larger dimension using a real data set from a college in China and compared with the current program in the same college. The obtained results show that considering the mathematical model's constraints and objective function, the faculty courses' timetable is reduced from 4 days a week to 3 working days. Moreover, master courses are planned in two days, and the courses in the educational groups do not interfere with each other. Furthermore, by implementing the proposed model for the real case study, the maximum teaching hours of the professors are significantly reduced. The results demonstrate the efficiency of the proposed model and solution method in terms of optimization speed and solution accuracy.

We present a generalized state-space model formulation particularly motivated by an online scheduling perspective. Through these proposed generalizations, we enable a natural way to handle routinely encountered disturbances and a rich set of corresponding counter-decisions. Thereby, greatly simplifying and extending the possible application of mathematical programming based online scheduling solutions to diverse application settings.

Management of demand and capacity for airport operation is important. The effect of capacity setting on slot adjustment, maximum adjustment and flight delay has been extensively investigated and discussed in previous slot adjustment models. But its effect on characteristics of flight waves has not been studied deeply. At present, in order to resolve the problem that Linear Integer Programming (LIP) is limited in slot allocation due to its fast dimension growth and large memory consumption, the general practice is to optimize the slot application according to data-splitting technology. However, the relationship among data splitting method, capacity setting and characteristics of slot wave has not been investigated in detail, which limits the application of LIP in slot allocation. Through the detailed analysis and testing, we found that the waveform and amplitude of slot wave can be controlled and designed by appropriate virtual capacity settings, while the number of capacity constraints and the computing time is reduced by adopting appropriate data feeding method. Our research also provides clues for further research on the construction of the flight waves for airlines operating at specific airports in order to establish direct or indirect connectivity, and increase hit rate by using our approaches.

Refinery planning optimization is a challenging problem as regards handling the nonconvex bilinearity mainly due to pooling operations in processes such as crude oil distillation and product blending. This work investigates the performance of several representative piecewise-linear (or piecewise-affine) relaxation schemes (referred to as McCormick, bm, nf5, nf6t, and de (which is a new approach proposed based on eigenvector decomposition) that mainly give rise to mixed-integer optimization programs to convexify a bilinear term using predetermined univariate partitioning for instances of uniform and non-uniform partition sizes. Computational results show that applying these schemes give improved relaxation tightness than only applying convex and concave envelopes as estimators. Uniform partition sizes typically perform better in terms of relaxation solution quality and convergence behavior. It is also seen that there is a limit on the number of partitions that contributes to relaxation tightness, which does not necessarily correspond to a larger number of partitions, while a direct relation between relaxation size and tightness does not always hold for non-uniform partition sizes.

This paper introduces a method to achieve optimal Gaussian estimation even when operating with low precision numerical representations of the full covariance matrix, such as 16-bit integer or 32-bit single precision formats, instead of more expensive double precision floating point representations (64 bits). The approximation's numerical error is accurately estimated in a conservative manner, resulting in minimal covariance inflation. When combined with a compressed estimator like the GCKF (Global Compressed Kalman Filter), which performs global updates at low frequency, this approach produces estimates that are nearly identical to the optimal ones. The deviation between the results obtained using this new approach and those obtained with the standard GCKF (which operates in double precision) is negligible. This new method is particularly relevant in high-dimensional estimation problems that require high-frequency operation. By leveraging the compressed operation of the GCKF, the estimation process applies the necessary approximation only during low-frequency global updates, using the single precision format instead of the more expensive double precision representations. The introduced numerical approximation is accurately estimated while maintaining a conservative approach, resulting in minimal covariance inflation. When combined with the GCKF, which performs global updates at low frequency, the estimates produced are almost identical to the optimal ones. This approach is particularly useful in high-dimensional estimation problems that require high-frequency operation. By representing the full covariance matrix in a low precision numerical format and applying appropriate scaling, memory usage is significantly reduced, offering substantial benefits for high-dimensional estimation problems and enabling real-time smoothing processes in such cases. By reducing the memory requirements for storing the full covariance matrix, the CPU avoids encountering a high number of page faults, resulting in improved processing performance. Lastly, the experimental section verifies the performance of the proposed approach in a single precision (32-bit floating point) GCKF SLAM process, assessing expected values and standard deviations of marginal PDFs.

In this work, an algorithm for the scheduling of household appliances to reduce the energy cost and the peak-power consumption is proposed. The system architecture of a home energy management system (HEMS) is presented to operate the appliances. The dynamics of thermal and non-thermal appliances is represented into state-space model to formulate the scheduling task into a mixed-integer-linear-programming (MILP) optimization problem. Model predictive control (MPC) strategy is used to operate the appliances in real-time. The HEMS schedules the appliances in a dynamic manner without any a priori knowledge of the load-consumption pattern. At the same time, HEMS responds to the real-time electricity market and the external environmental conditions (solar radiation, ambient temperature etc). Simulation results exhibit the benefits of proposed HEMS by showing the reduction of up to 47% in electricity cost and up to 48% in peak power consumption.

Micro-grids’ operations offer local reliability; in the event of faults or low voltage/frequency events on the utility side, micro-grids can disconnect from the main grid and operate autonomously while providing the continued supply of power to local customers. With the ever-increasing penetration of renewable generation, however, the operations of micro-grids become increasingly complicated because of the associated fluctuations of voltages. As a result, transformer taps are adjusted frequently, thereby leading to the fast degradation of expensive tap-changer transformers. In the islanding mode, the difficulties also come from the drop of voltage and frequency upon disconnecting from the main grid. To appropriately model the above, the nonlinear AC power flow constraints are necessary. Computationally, the discrete nature of tap-changer operations and the stochasticity caused by renewables add two layers of difficulty on top of a complicated AC-OPF problem. To resolve the above computational difficulties, the main principles of the recently-developed "l1-proximal" Surrogate Lagrangian Relaxation are extended. Testing results based on 9-bus system demonstrate the efficiency of the method to obtain the exact feasible solutions for micro-grid operations thereby avoiding approximations inherent to existing methods, while demonstrating that through the optimization, 1. the number of tap changes is drastically reduced, and 2. the method is capable of handling networks with meshed topologies.

Abstract: Safety issues related to the electrification of more electric aircraft (MEA) need to be addressed because of the increasing complexity of aircraft electrical power systems and the growing number of safety-critical sub-systems that need to be powered. Managing the energy storage systems and the flexibility in the load-side plays an important role in preserving the system’s safety when facing an energy shortage. This paper presents a system-level centralized operation management strategy based on model predictive control (MPC) for MEA to schedule battery systems and exploit flexibility in the demand-side while satisfying time-varying operational requirements. The proposed online control strategy aims to maintain energy storage (ES) and prolong the battery life cycle, while minimizing load shedding, with fewer switching activities to improve devices lifetime and to avoid unnecessary transients. Using a mixed-integer linear programming (MILP) formulation, different objective functions are proposed to realize the control targets, with soft constraints improving the robustness of the model. Besides, an evaluation framework is proposed to analyze the effects of various objective functions and the prediction horizon on system performance, which provides the designers and users of MEA and other complex systems with new insights into operation management problem formulation.

Ultra-wideband wavelength division multiplexed networks enable operators to use more effectively the bandwidth offered by a single fiber pair and thus make significant savings, both in operational and capital expenditures. The main objective of this study is to minimize optical node resources, such as transponders, multiplexers and wavelength selective switches, needed to provide and maintain high quality of network services, in ultra-wideband wavelength division multiplexed networks, at low cost. A model based on integer programming is proposed, which includes a detailed description of optical network nodal resources. The developed optimization tools are used to study the ultra-wideband wavelength division multiplexed network performance when compared with the traditional C-band wavelength division multiplexed networks. The analysis is carried out for realistic networks of different dimensions and traffic demand sets.

In this work, the Pumped Storage Unit (PSU) is proposed to be integrated with wind-thermal generation system owned by a company whose aim is to maximize its profit through optimal self-scheduling of its units by finding the best bidding strategy in day-ahead energy market. The mathematical formulation of the scenario based unit-commitment and coordinated trading problem is formulated as a stochastic mixed integer linear program. The formulation takes into account several uncertain parameters; such as the wind power generation, energy market prices, and imbalances up/down prices. The expected total profit obtained from energy trading with and without coordinating pumped storage system (PSS) with thermal-wind generation system were compared, and a significant improvement in profit resulted from coordination was observed. Furthermore, coordination between PSS and wind-thermal generation improve the conditional value at risk (CVaR) which monitors the biding risk level.

In this paper, using the two integers that describe the stationary 2-dimensional wave and the charge quantization along with the balance between the Lorentz force and electrical force, we succeed in deriving the fractional quantum Hall effect and the integer quantum Hall effect; we find that the latter exists as a special case of the former. Moreover, using the derived expression describing the fractional quantum Hall effect, a relationship between the plateau in the resistivity of the sample and the applied magnetic field is obtained. The findings of this model agree well with experimental measurements. Because the two integers that describe the stationary 2-dimensional wave and the charge quantization along with the force balance have concrete physical meanings in this work, we could provide a clear picture of the origin of both the integer quantum Hall effect and the fractional quantum Hall effect.

In the paper, by the Faά di Bruno formula, several identities for the Bell polynomials of the second kind, and an inversion theorem, the authors simplify coefficients of two families of nonlinear ordinary differential equations for the generating function of the Catalan numbers and discover inverses of fifteen closely related lower triangular integer matrices.

Let $f\left(1\right)=1$ , and let $f(n+1)=2^{2^{f\left(n\right)}}$ for every positive integer n. We consider the following hypothesis: if a system S ⊆ {x_i · x_j = x_k : i, j, k ∈ {1, . . . , n}} ∪ {x_i + 1 = x_k : i, k ∈{1, . . . , n}} has only finitely many solutions in non-negative integers x₁, . . . , x_n, then each such solution (x₁, . . . , x_n) satisfies x₁, . . . , x_n ≤ f (2n). We prove: (1) the hypothesisimplies that there exists an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the heights of integer (non-negative integer, positive integer, rational) solutions, if the solution set is finite; (2) the hypothesis implies that there exists an algorithm for listing the Diophantine equations with infinitely many solutions in non-negative integers; (3) the hypothesis implies that the question whether or not a given Diophantine equation has only finitely many rational solutions is decidable by a single query to an oracle that decides whether or not a given Diophantine equation has a rational solution; (4) the hypothesis implies that the question whether or not a given Diophantine equation has only finitely many integer solutions is decidable by a single query to an oracle that decides whether or not a given Diophantine equation has an integer solution; (5) the hypothesis implies that if a set $\mathfrak{M}$ ⊆ has a finite-fold Diophantine representation, then $\mathfrak{M}$ is computable.

Low Power Wide Area Networks (LPWAN) enable a growing number of Internet-of-Things (IoT) applications with large geographical coverage, low bit-rate, and long lifetime requirements. LoRa (Long Range) is a well-known LPWAN technology that uses a proprietary Chirp Spread Spectrum (CSS) physical layer, while the upper layers are defined by an open standard - LoRaWAN. In this paper, we propose a simple yet effective method to improve the Quality-of-Service (QoS) of LoRa networks by fine-tuning specific radio parameters. Through a Mixed Integer Linear Programming (MILP) problem formulation, we find optimal settings for the Spreading Factor (SF) and Carrier Frequency (CF) radio parameters, considering the network traffic specifications as a whole, to improve the Data Extraction Rate (DER) and to reduce the packet collision rate and the energy consumption in LoRa networks. The effectiveness of the optimization procedure is demonstrated by simulations, using LoRaSim for different network scales. In relation to the traditional LoRa radio parameter assignment policies, our solution leads to an average increase of 6% in DER, and a number of collisions 13 times smaller. In comparison to networks with dynamic radio parameter assignment policies, there is an increase of 5%, 2.8%, and 2% of DER, and a number of collisions 11, 7.8 and 2.5 times smaller than equal-distribution, Tiurlikova's (SoTa), and random distribution, respectively. Regarding the network energy consumption metric, the proposed optimization obtained an average consumption similar to Tiurlikova's, and 2.8 times lower than the equal-distribution and random dynamic allocation policies. Furthermore, we approach the practical aspects of how to implement and integrate the optimization mechanism proposed in LoRa, guaranteeing backward compatibility with the standard protocol.

We prove: (1) the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable, (2) the set of all Diophantine equations which have at most finitely many solutions in positive integers is not recursively enumerable, (3) the set of all Diophantine equations which have at most finitely many integer solutions is not recursively enumerable, (4) analogous theorems hold for Diophantine equations D(x₁, …, x_p) = 0, where p ∈ N\{0} and for every i ∈ {1, …, p} the polynomial D(x₁, …, x_p) involves a monomial M with a non-zero coefficient such that x_i divides M, (5) the set of all Diophantine equations which have at most k variables (where k ≥ 9) and at most finitely many solutions in non-negative integers is not recursively enumerable.