Search Results (28)

A game problem of structural design is defined as a problem of playing against external circumstances. There are two classes of players, namely the “ordinal” and “cardinal” players. The ordinal players, designated as the “operator” and “nature”, endeavor to, respectively, minimize or maximize the payoff function, operating within the constraints of limited resources. The fundamental premise of this study is that the action of player “nature” is a priori unknown. Statistical decision theory addresses decision-making scenarios where these probabilities, whether or not they are known, must be considered. The solution to the substratum game is expressed as a value of the game “against nature”. The structural optimization extension of the game considers the value of the game “against nature” as the function of certain parameters. Thus, the value of the game is contingent upon the design parameters. The cardinal players, “designers”, choose the design parameters. There are two formulations of optimization. For the single cardinal player, the pursuit of the maximum and minimum values of the game reduces the problem of optimal design. In the second formulation, there are multiple cardinal players with conflicting objectives. Accordingly, the superstratum game emerges, which addresses the interests of the superstratum players. Finally, the optimal design problems for games with closed forms are presented. The game formulations could be applied for optimal design with uncertain loading, considering “nature” as the source of uncertainty. Full article

The cryptocurrency market offers attractive but risky investment opportunities, characterized by rapid growth, extreme volatility, and uncertainty. Traditional risk management models, which rely on probabilistic assumptions and historical data, often fail to capture the market’s unique dynamics and unpredictability. In response to these challenges, this paper introduces a novel portfolio optimization model tailored for the cryptocurrency market, leveraging a credibilistic CVaR framework. CVaR was chosen as the primary risk measure because it is a downside risk measure that focuses on extreme losses, making it particularly effective in managing the heightened risk of significant downturns in volatile markets like cryptocurrencies. The model employs credibility theory and trapezoidal fuzzy variables to more accurately capture the high levels of uncertainty and volatility that characterize digital assets. Unlike traditional probabilistic approaches, this model provides a more adaptive and precise risk management strategy. The proposed approach also incorporates practical constraints, including cardinality and floor and ceiling constraints, ensuring that the portfolio remains diversified, balanced, and aligned with real-world considerations such as transaction costs and regulatory requirements. Empirical analysis demonstrates the model’s effectiveness in constructing well-diversified portfolios that balance risk and return, offering significant advantages for investors in the rapidly evolving cryptocurrency market. This research contributes to the field of investment management by advancing the application of sophisticated portfolio optimization techniques to digital assets, providing a robust framework for managing risk in an increasingly complex financial landscape. Full article

Traditional mean-variance (MV) models, considered effective in stable conditions, often prove inadequate in uncertain market scenarios. Therefore, there is a need for more robust and better portfolio optimization methods to handle the fluctuations and uncertainties in asset returns and covariances. This study aims to perform a Systematic Literature Review (SLR) on robust portfolio mean-variance (RPMV) in stock investment utilizing genetic algorithms (GAs). The SLR covered studies from 1995 to 2024, allowing a thorough analysis of the evolution and effectiveness of robust portfolio optimization methods over time. The method used to conduct the SLR followed the Preferred Reporting Items for Systematic Reviews and Meta-Analysis (PRISMA) guidelines. The result of the SLR presented a novel strategy to combine robust optimization methods and a GA in order to enhance RPMV. The uncertainty parameters, cardinality constraints, optimization constraints, risk-aversion parameters, robust covariance estimators, relative and absolute robustness, and parameters adopted were unable to develop portfolios capable of maintaining performance despite market uncertainties. This led to the inclusion of GAs to solve the complex optimization problems associated with RPMV efficiently, as well as fine-tuning parameters to improve solution accuracy. In three papers, the empirical validation of the results was conducted using historical data from different global capital markets such as Hang Seng (Hong Kong), Data Analysis Expressions (DAX) 100 (Germany), the Financial Times Stock Exchange (FTSE) 100 (U.K.), S&P 100 (USA), Nikkei 225 (Japan), and the Indonesia Stock Exchange (IDX), and the results showed that the RPMV model optimized with a GA was more stable and provided higher returns compared with traditional MV models. Furthermore, the proposed method effectively mitigated market uncertainties, making it a valuable tool for investors aiming to optimize portfolios under uncertain conditions. The implications of this study relate to handling uncertainty in asset returns, dynamic portfolio parameters, and the effectiveness of GAs in solving portfolio optimization problems under uncertainty, providing near-optimal solutions with relatively lower computational time. Full article

Role-based access control (RBAC) is a widely adopted access control model in various domains for defining security management. Role mining is closely related to role-based access control, as the latter employs role assignments to offer a flexible and scalable approach to managing permissions within an organization. The edge role mining problem (Edge RMP), a variant of the role mining problem (RMP), has long been recognized as an effective strategy for role assignment. Role mining, which groups users with similar access permissions into the same role, bears some resemblance to symmetry. Symmetry categorizes objects or graphics with identical characteristics into one group. Both involve a certain form of “classification” or “induction”. Edge-RMP reduces the associations between users and permissions, thereby lowering the security risks faced by the system. While an algorithm based on Boolean matrix factorization exists for this problem, it fails to further refine the resulting user–role assignment (UA) and role–permission assignment (PA) relationships. Additionally, this algorithm does not address constraint-related issues, such as cardinality constraints, user exclusion constraints, and user capabilities. Furthermore, it demonstrates significant redundancy of roles when handling large datasets, leaving room for further optimization of Edge-RMP results. To address these concerns, this paper proposes the MFC-RMA algorithm based on Boolean matrix factorization. The method achieves significant optimization of Edge-RMP results by handling relationships between roles possessing various permissions. Furthermore, this paper clusters, compresses, modifies, and optimizes the original data based on the similarity between users, ensuring its usability for role mining. Both theoretical and practical considerations are taken into account for different types of constraints, and algorithms are devised to reallocate roles incorporating these constraints, thereby generating UA and PA matrices. The proposed approach yields optimal numbers of generated roles and the sum of the minimum number of generated edges to address the aforementioned issues. Experimental results demonstrate that the algorithm reduces management overhead, provides efficient execution results, and ensures the accuracy of generated roles. Full article

The complexity of historical data in financial markets and the uncertainty of the future, as well as the idea that investors always expect the least risk and the greatest return. This study presents a multi-period fractional portfolio model in a fuzzy environment, taking into account the limitations of asset quantity, asset position, transaction cost, and inter-period investment. This is a mixed integer programming NP-hard problem. To overcome the problem, an improved genetic algorithm (IGA) is presented. The IGA contribution mostly involves the following three points: (i) A cardinal constraint processing approach is presented for the cardinal constraint conditions in the model; (ii) Logistic chaotic mapping was implemented to boost the initial population diversity; (iii) An adaptive golden section variation probability formula is developed to strike the right balance between exploration and development. To test the model’s logic and the performance of the proposed algorithm, this study picks stock data from the Shanghai Stock Exchange 50 for simulated investing and examines portfolio strategies under various limitations. In addition, the numerical results of simulated investment are compared and analyzed, and the results show that the established models are in line with the actual market situation and the designed algorithm is effective, and the probability of obtaining the optimal value is more than 37.5% higher than other optimization algorithms. Full article

This research aims to show the effects of adding cardinality constraints to limit the number of different cross-sections used in simultaneous sizing and shape optimization of truss structures. The optimal solutions for sizing and shape optimized trusses result in a generally high, and impractical, number of different cross-sections being used. This paper presents the influence of constraining the number of different cross-sections used on the optimal results to bring the scientific results closer to the applicable results. The savings achieved using the cardinality constraint are expected to manifest in more than just the minimization of weight but in all the other aspects of truss construction, such as labor, assembly time, total weld length, surface area to be treated, transport, logistics, and so on. It is expected that the optimal weight of the structures would be greater than when not using this constraint; however, it would still be below conventionally sized structures and have the added benefits derived from the simplicity and elegance of the solution. The results of standard test examples for each different cardinality constraint value are shown and compared to the same examples using only a single cross-section on all bars and the overall optimal solution, which does not have the cardinality constraint. An additional comparison is made with results of just the sizing optimization from previously published research where authors first used the same cardinality constraint. Full article

As an unsupervised data representation neural network, auto-encoder (AE) has shown great potential in denoising, dimensionality reduction, and data reconstruction. Many AE-based background (BKG) modeling methods have been developed for hyperspectral anomaly detection (HAD). However, their performance is subject to their unbiased reconstruction of BKG and target pixels. This article presents a rather different low rank and sparse matrix decomposition (LRaSMD) method based on AE, named auto-encoder and independent target (AE-IT), for hyperspectral anomaly detection. First, the encoder weight matrix, obtained by a designed AE network, is utilized to construct a projector for generating a low-rank component in the encoder subspace. By adaptively and reasonably determining the number of neurons in the latent layer, the designed AE-based method can promote the reconstruction of BKG. Second, to ensure independence and representativeness, the component in the encoder orthogonal subspace is made into a sphere and followed by finding of unsupervised targets to construct an anomaly space. In order to mitigate the influence of noise on anomaly detection, sparse cardinality (SC) constraint is enforced on the component in the anomaly space for obtaining the sparse anomaly component. Finally, anomaly detector is constructed by combining Mahalanobi distance and multi-components, which include encoder component and sparse anomaly component, to detect anomalies. The experimental results demonstrate that AE-IT performs competitively compared to the LRaSMD-based models and AE-based approaches. Full article

The carousel greedy algorithm (CG) was proposed several years ago as a generalized greedy algorithm. In this paper, we implement CG to solve linear regression problems with a cardinality constraint on the number of features. More specifically, we introduce a default version of CG that has several novel features. We compare its performance against stepwise regression and more sophisticated approaches using integer programming, and the results are encouraging. For example, CG consistently outperforms stepwise regression (from our preliminary experiments, we see that CG improves upon stepwise regression in 10 of 12 cases), but it is still computationally inexpensive. Furthermore, we show that the approach is applicable to several more general feature selection problems. Full article

Recently, the Hypervolume Newton Method (HVN) has been proposed as a fast and precise indicator-based method for solving unconstrained bi-objective optimization problems with objective functions. The HVN is defined on the space of (vectorized) fixed cardinality sets of decision space vectors for a given multi-objective optimization problem (MOP) and seeks to maximize the hypervolume indicator adopting the Newton–Raphson method for deterministic numerical optimization. To extend its scope to non-convex optimization problems, the HVN method was hybridized with a multi-objective evolutionary algorithm (MOEA), which resulted in a competitive solver for continuous unconstrained bi-objective optimization problems. In this paper, we extend the HVN to constrained MOPs with in principle any number of objectives. Similar to the original variant, the first- and second-order derivatives of the involved functions have to be given either analytically or numerically. We demonstrate the applicability of the extended HVN on a set of challenging benchmark problems and show that the new method can be readily applied to solve equality constraints with high precision and to some extent also inequalities. We finally use HVN as a local search engine within an MOEA and show the benefit of this hybrid method on several benchmark problems. Full article

Portfolio optimization is an activity for balancing return and risk. In this paper, we used mean-variance (M-V) portfolio models with buy-in threshold and cardinality constraints. This model can be formulated as a mixed integer nonlinear programming (MINLP) problem. To solve this constrained mean-variance portfolio optimization problem, we propose the use of a modified spiral optimization algorithm (SOA). Then, we use Bartholomew-Biggs and Kane’s data to validate our proposed algorithm. The results show that our proposed algorithm can be an efficient tool for solving this portfolio optimization problem. Full article

The declaration of the coronavirus disease 2019 (COVID-19) pandemic led to the enforcement of national lockdowns in several countries. While lockdowns are generally effective in containing the spread of infectious diseases, they are associated with negative impacts on livelihoods. Although evidence suggests that urban informal sector populations in low-resource settings bore the brunt of the adverse economic effects of COVID-19 lockdowns, there is little on how they survived. The article provides insights into the survival mechanisms of urban informal sector populations during a COVID-19 lockdown. Data are from narrative interviews with 30 residents of Kampala City and surrounding areas. We found that the COVID-19 lockdown chiefly jeopardized the livelihoods of urban residents through job loss and reduced incomes. Affected individuals and households primarily survived by making improvisations such as adjusting expenditures and reconfiguring their livelihoods. The cardinal elements of the informal sector, such as limited regulation, served as both a facilitator and constraint to survival. Therefore, the informal sector is an important buffer against livelihood shocks in situations of crisis. However, its inherent limitations imply that promoting livelihood resilience among urban residents during lockdowns and similar shocks may necessitate harnessing both formal and informal safety nets. Full article

Seasonal influenza (also known as flu) is responsible for considerable morbidity and mortality across the globe. The three recognized pathogens that cause epidemics during the winter season are influenza A, B and C. The influenza virus is particularly dangerous due to its mutability. Vaccines are an effective tool in preventing seasonal influenza, and their formulas are updated yearly according to the WHO recommendations. However, in order to facilitate decision-making in the planning of the intervention, policymakers need information on the projected costs and quantities related to introducing the influenza vaccine in order to help governments obtain an optimal allocation of the vaccine each year. In this paper, an approach based on a Controlled Elitism Non-Dominated Sorting Genetic Algorithm (CENSGA) model is introduced to optimize the allocation of the influenza vaccination. A bi-objective model is formulated to control the infection volume, and reduce the unit cost of the vaccination campaign. An SIR (Susceptible–Infected–Recovered) model is employed for representing a potential epidemic. The model constraints are based on the epidemiological model, time management and vaccine quantity. A two-phase optimization process is proposed: guardian control followed by contingent controls. The proposed approach is an evolutionary metaheuristic multi-objective optimization algorithm with a local search procedure based on a hash table. Moreover, in order to optimize the scheduling of a set of policies over a predetermined time to form a complete campaign, an extended CENSGA is introduced with a variable-length chromosome (VLC) along with mutation and crossover operations. To validate the applicability of the proposed CENSGA, it is compared with the classical Non-Dominated Sorting Genetic Algorithm (NSGA-II). The results indicate that optimal vaccination campaigns with compromise tradeoffs between the two conflicting objectives can be designed effectively using CENSGA, providing policymakers with a number of alternatives to accommodate the best strategies. The results are analyzed using graphical and statistical comparisons in terms of cardinality, convergence, distribution and spread quality metrics, illustrating that the proposed CENSGA is effective and useful for determining the optimal vaccination allocation campaigns. Full article

In recent years, the issue of maximizing submodular functions has attracted much interest from research communities. However, most submodular functions are specified in a set function. Meanwhile, recent advancements have been studied for maximizing a diminishing return submodular (DR-submodular) function on the integer lattice. Because plenty of publications show that the DR-submodular function has wide applications in optimization problems such as sensor placement impose problems, optimal budget allocation, social network, and especially machine learning. In this research, we propose two main streaming algorithms for the problem of maximizing a monotone DR-submodular function under cardinality constraints. Our two algorithms, which are called $\mathsf{StrDRS}\mathsf{1}$ and $\mathsf{StrDRS}\mathsf{2}$, have $(1/2-ϵ)$, $(1-1/e-ϵ)$ of approximation ratios and $O(\frac{n}{ϵ}log\left(\frac{logB}{ϵ}\right)logk)$, $O(\frac{n}{ϵ}logB)$, respectively. We conducted several experiments to investigate the performance of our algorithms based on the budget allocation problem over the bipartite influence model, an instance of the monotone submodular function maximization problem over the integer lattice. The experimental results indicate that our proposed algorithms not only provide solutions with a high value of the objective function, but also outperform the state-of-the-art algorithms in terms of both the number of queries and the running time. Full article

Constraint-induced movement therapy (CIMT) has been delivered in the stroke population to improve lower-extremity functions. However, its efficacy on prime components of functional ambulation, such as gait speed, balance, and cardiovascular outcomes, is ambiguous. The present review aims to delineate the effect of various lower-extremity CIMT (LECIMT) protocols on gait speed, balance, and cardiovascular outcomes. Material and methods: The databases used to collect relevant articles were EBSCO, PubMed, PEDro, Science Direct, Scopus, MEDLINE, CINAHL, and Web of Science. For this analysis, clinical trials involving stroke populations in different stages of recovery, >18 years old, and treated with LECIMT were considered. Only ten studies were included in this review, as they fulfilled the inclusion criteria. The effect of CIMT on gait speed and balance outcomes was accomplished using a random or fixed-effect model. CIMT, when compared to controlled interventions, showed superior or similar effects. The effect of LECIMT on gait speed and balance were non-significant, with mean differences (SMDs) of 0.13 and 4.94 and at 95% confidence intervals (Cis) of (−0.18–0.44) and (−2.48–12.37), respectively. In this meta-analysis, we observed that despite the fact that several trials claimed the efficacy of LECIMT in improving lower-extremity functions, gait speed and balance did not demonstrate a significant effect size favoring LECIMT. Therefore, CIMT treatment protocols should consider the patient’s functional requirements, cardinal principles of CIMT, and cardiorespiratory parameters. Full article

The dearth of cardinal data on species presence, dispersion, abundance, and habitat prerequisites, besides the threats impeded by escalating human pressure has enormously affected biodiversity conservation. The innovative concept of eDNA, has been introduced as a way of overcoming many of the difficulties of rigorous conventional investigations, and is hence becoming a prominent and novel method for assessing biodiversity. Recently the demand for eDNA in ecology and conservation has expanded exceedingly, despite the lack of coordinated development in appreciation of its strengths and limitations. Therefore it is pertinent and indispensable to evaluate the extent and significance of eDNA-based investigations in terrestrial habitats and to classify and recognize the critical considerations that need to be accounted before using such an approach. Presented here is a brief review to summarize the prospects and constraints of utilizing eDNA in terrestrial ecosystems, which has not been explored and exploited in greater depth and detail in such ecosystems. Given these obstacles, we focused primarily on compiling the most current research findings from journals accessible in eDNA analysis that discuss terrestrial ecosystems (2012–2022). In the current evaluation, we also review advancements and limitations related to the eDNA technique. Full article