Search results

The demand for electricity supply increases day by day due to the rapid growth in the number of industries and consumer devices. The electric power supply needs to be improved by properly arranging distributed generators (DGs). The purpose of this paper is to develop a methodology for optimum placement of DGs using novel algorithms that leads to loss minimization.

In this paper, a novel hybrid optimization is proposed to minimize the losses and improve the voltage profile. The hybridization of the optimization is done through the crow search (CS) algorithm and the black widow (BW) algorithm. The CS algorithm is used for finding some tie-line systems, DG locations, and the BW algorithm is used for finding the rest of the tie-line switches, DG sizes, unlike in usual hybrid optimization techniques.

The proposed technique is tested on two large-scale radial distribution networks (RDNs), like the 119-bus radial distribution system (RDS) and the 135 RDS, and compared with normal hybrid algorithms.

The main novelty of this hybridization is that it shares the parameters of the objective function. The losses of the RDN can be minimized by reconfiguration and incorporating compensating devices like DGs.

Because the dynamic characteristics of the stock market are nonlinear, it is unclear whether stock prices can be predicted. This paper aims to explore the predictability of the stock price index from a long-memory perspective. The authors propose hybrid models to predict the next-day closing price index and explore the policy effects behind stock prices. The paper aims to discuss the aforementioned ideas.

The authors found a long memory in the stock price index series using modified R/S and GPH tests, and propose an improved bi-directional gated recurrent units (BiGRU) hybrid network framework to predict the next-day stock price index. The proposed framework integrates (1) A de-noising module—Singular Spectrum Analysis (SSA) algorithm, (2) a predictive module—BiGRU model, and (3) an optimization module—Grid Search Cross-validation (GSCV) algorithm.

Three critical findings are long memory, fit effectiveness and model optimization. There is long memory (predictability) in the stock price index series. The proposed framework yields predictions of optimum fit. Data de-noising and parameter optimization can improve the model fit.

The empirical data are obtained from the financial data of listed companies in the Wind Financial Terminal. The model can accurately predict stock price index series, guide investors to make reasonable investment decisions, and provide a basis for establishing individual industry stock investment strategies.

If the index series in the stock market exhibits long-memory characteristics, the policy implication is that fractal markets, even in the nonlinear case, allow for a corresponding distribution pattern in the value of portfolio assets. The risk of stock price volatility in various sectors has expanded due to the effects of the COVID-19 pandemic and the R-U conflict on the stock market. Predicting future trends by forecasting stock prices is critical for minimizing financial risk. The ability to mitigate the epidemic’s impact and stop losses promptly is relevant to market regulators, companies and other relevant stakeholders.

Although long memory exists, the stock price index series can be predicted. However, price fluctuations are unstable and chaotic, and traditional mathematical and statistical methods cannot provide precise predictions. The network framework proposed in this paper has robust horizontal connections between units, strong memory capability and stronger generalization ability than traditional network structures. The authors demonstrate significant performance improvements of SSA-BiGRU-GSCV over comparison models on Chinese stocks.

This study develops a model and algorithm to solve the decentralized resource-constrained multi-project scheduling problem (DRCMPSP) and provides a suitable priority rule (PR) for coordinating global resource conflicts among multiple projects.

This study addresses the DRCMPSP, which respects the information privacy requirements of project agents; that is, there is no single manager centrally in charge of generating multi-project scheduling. Accordingly, a three-stage model was proposed for the decentralized management of multiple projects. To solve this model, a three-stage solution approach with a repeated negotiation mechanism was proposed.

The experimental results obtained using the Multi-Project Scheduling Problem LIBrary confirm that our approach outperforms existing methods, regardless of the average utilization factor (AUF). Comparative analysis revealed that delaying activities in the lower project makespan produces a lower average project delay. Furthermore, the new PR LMS performed better in problem subsets with AUF < 1 and large-scale subsets with AUF > 1.

A solution approach with a repeated-negotiation mechanism suitable for the DRCMPSP and a new PR for coordinating global resource allocation are proposed.

Routing protocol for low-power lossy network (RPL) being the de facto routing protocol used by low power lossy networks needs to provide adequate routing service to mobile nodes (MNs) in the network. As RPL is designed to work under constraint power requirements, its route updating frequency is not sufficient for MNs in the network. The purpose of this study is to ensure that MNs enjoy seamless connection throughout the network with minimal handover delay.

This study proposes a load balancing mobility aware secure hybrid – RPL in which static node (SN) identifies route using metrics like expected transmission count, and path delay and parent selection are further refined by working on remaining energy for identifying the primary route and queue availability for secondary route maintenance. MNs identify route with the help of smart timers and by using received signal strength indicator sampling of parent and neighbor nodes. In this work, MNs are also secured against rank attack in RPL.

This model produces favorable result in terms of packet delivery ratio, delay, energy consumption and number of living nodes in the network when compared with different RPL protocols with mobility support. The proposed model reduces packet retransmission in the network by a large margin by providing load balancing to SNs and seamless connection to MNs.

In this work, a novel algorithm was developed to provide seamless handover for MNs in network. Suitable technique was developed to provide load balancing to SNs in network by maintaining appropriate secondary route.

Climate change is a problem that concerns all of us. Despite the information produced by organizations such as the Expert Team on Climate Change Detection and Indices and the United Nations, only a few cities have been planned taking into account the climate changes indices. This paper aims to study climatic variations, how climate conditions might change in the future and how these changes will affect the activities and living conditions in cities, specifically focusing on Mexico city.

In this approach, two distinct machine learning regression models, k-Nearest Neighbors and Support Vector Regression, were used to predict variations in climate change indices within select urban areas of Mexico city. The calculated indices are based on maximum, minimum and average temperature data collected from the National Water Commission in Mexico and the Scientific Research Center of Ensenada. The methodology involves pre-processing temperature data to create a training data set for regression algorithms. It then computes predictions for each temperature parameter and ultimately assesses the performance of these algorithms based on precision metrics scores.

This paper combines a geospatial perspective with computational tools and machine learning algorithms. Among the two regression algorithms used, it was observed that k-Nearest Neighbors produced superior results, achieving an R² score of 0.99, in contrast to Support Vector Regression, which yielded an R² score of 0.74.

The full potential of machine learning algorithms has not been fully harnessed for predicting climate indices. This paper also identifies the strengths and weaknesses of each algorithm and how the generated estimations can then be considered in the decision-making process.

In the era of artificial intelligence (AI), algorithms have gained unprecedented importance. Scientific studies have shown that algorithms are frequently mentioned in papers, making mention frequency a classical indicator of their popularity and influence. However, contemporary methods for evaluating influence tend to focus solely on individual algorithms, disregarding the collective impact resulting from the interconnectedness of these algorithms, which can provide a new way to reveal their roles and importance within algorithm clusters. This paper aims to build the co-occurrence network of algorithms in the natural language processing field based on the full-text content of academic papers and analyze the academic influence of algorithms in the group based on the features of the network.

We use deep learning models to extract algorithm entities from articles and construct the whole, cumulative and annual co-occurrence networks. We first analyze the characteristics of algorithm networks and then use various centrality metrics to obtain the score and ranking of group influence for each algorithm in the whole domain and each year. Finally, we analyze the influence evolution of different representative algorithms.

The results indicate that algorithm networks also have the characteristics of complex networks, with tight connections between nodes developing over approximately four decades. For different algorithms, algorithms that are classic, high-performing and appear at the junctions of different eras can possess high popularity, control, central position and balanced influence in the network. As an algorithm gradually diminishes its sway within the group, it typically loses its core position first, followed by a dwindling association with other algorithms.

To the best of the authors’ knowledge, this paper is the first large-scale analysis of algorithm networks. The extensive temporal coverage, spanning over four decades of academic publications, ensures the depth and integrity of the network. Our results serve as a cornerstone for constructing multifaceted networks interlinking algorithms, scholars and tasks, facilitating future exploration of their scientific roles and semantic relations.

Project scheduling plays an essential role in the implementation of a project due to the limitation of resources in practical projects. However, the existing research tend to focus on finding suitable algorithms to solve various scheduling problems and fail to find the potential scheduling rules in these optimal or near-optimal solutions, that is, the possible intrinsic relationships between attributes related to the scheduling of activity sequences. Data mining (DM) is used to analyze and interpret data to obtain valuable information stored in large-scale data. The goal of this paper is to use DM to discover scheduling concepts and obtain a set of rules that approximate effective solutions to resource-constrained project scheduling problems. These rules do not require any search and simulation, which have extremely low time complexity and support real-time decision-making to improve planning/scheduling.

The resource-constrained project scheduling problem can be described as scheduling a group of interrelated activities to optimize the project completion time and other objectives while satisfying the activity priority relationship and resource constraints. This paper proposes a new approach to solve the resource-constrained project scheduling problem by combining DM technology and the genetic algorithm (GA). More specifically, the GA is used to generate various optimal project scheduling schemes, after that C4.5 decision tree (DT) is adopted to obtain valuable knowledge from these schemes for further predicting and solving new scheduling problems.

In this study, the authors use GA and DM technology to analyze and extract knowledge from a large number of scheduling schemes, and determine the scheduling rule set to minimize the completion time. In order to verify the application effect of the proposed DT classification model, the J30, J60 and J120 datasets in PSPLIB are used to test the validity of the scheduling rules. The results show that DT can readily duplicate the excellent performance of GA for scheduling problems of different scales. In addition, the DT prediction model developed in this study is applied to a high-rise residential project consisting of 117 activities. The results show that compared with the completion time obtained by GA, the DT model can realize rapid adjustment of project scheduling problem to deal with the dynamic environment interference. In a word, the data-based approach is feasible, practical and effective. It not only captures the knowledge contained in the known optimal scheduling schemes, but also helps to provide a flexible scheduling decision-making approach for project implementation.

This paper proposes a novel knowledge-based project scheduling approach. In previous studies, intelligent optimization algorithm is often used to solve the project scheduling problem. However, although these intelligent optimization algorithms can generate a set of effective solutions for problem instances, they are unable to explain the process of decision-making, nor can they identify the characteristics of good scheduling decisions generated by the optimization process. Moreover, their calculation is slow and complex, which is not suitable for planning and scheduling complex projects. In this study, the set of effective solutions of problem instances is taken as the training dataset of DM algorithm, and the extracted scheduling rules can provide the prediction and solution of new scheduling problems. The proposed method focuses on identifying the key parameters of a specific dynamic scheduling environment, which can not only reproduces the scheduling performance of the original algorithm well, but also has the ability to make decisions quickly under the dynamic interference construction scenario. It is helpful for project managers to implement quick decisions in response to construction emergencies, which is of great practical significance for improving the flexibility and efficiency of construction projects.

This paper aims to create and evaluate a model for cryptocurrency adoption by investigating how age, education, and gender impact Behavioural Intention. A hybrid approach that combined partial least squares structural equation modeling (PLS-SEM) and artificial neural network (ANN) was used for the purpose.

This study uses a multi-analytical hybrid approach, combining PLS-SEM and ANN to illustrate the impact of various identified variables on behavioral intention toward using cryptocurrency. Multi-group analysis (MGA) is applied to determine whether different data groups of age, gender and education have significant differences in the parameter estimates that are specific to each group.

The findings indicate that Social Influence (SI) has the greatest impact on Behavioral Intention (BI), which suggests that the viewpoints and recommendations of influential and well-known individuals can serve as a motivating factor to invest in cryptocurrencies. Furthermore, education was found to be a moderating factor in the relationship found between behavioral intention and design.

Prior studies on technology adoption have utilized superficial SEM and ANN methods, whereas a more effective outcome has been suggested by implementing a dual-stage PLS-SEM and ANN approach utilizing a deep neural network architecture. This methodology can enhance the accuracy of nonlinear connections in the model and augment the deep learning capacity.

The research is based on the Unified Theory of Acceptance and Use of Technology (UTAUT2) and expands upon this model by integrating elements of design and trust. This is an important addition, as design can influence individuals' willingness to try new technologies, while trust is a critical factor in determining whether individuals will adopt and use new technology.

Cryptocurrencies are a relatively new phenomenon in India, and their use and adoption have grown significantly in recent years. However, this development has not been without controversy, as the implications of cryptocurrencies for society, the economy and governance remain uncertain. The results reveal that social influence is an important predictor for the adoption of cryptocurrency in India, and this can help financial institutions and regulators in making policy decisions accordingly.

Given the emerging nature of cryptocurrency adoption in India, there is certainly a need for further empirical research in this area. The current study aims to address this research gap and achieve the following objectives: (a) to determine if a dual-stage PLS-SEM and ANN analysis utilizing deep learning techniques can yield more comprehensive research findings than a PLS-SEM approach and (b) to identify variables that can forecast the intention to adopt cryptocurrency.

Project portfolio risk (PPR) management plays an important role in promoting the smooth implementation of a project portfolio (PP). Accurate PPR prediction helps managers cope with risks timely in complicated PP environments. However, studies on accurate PPR impact degree prediction, which consists of both risk occurrence probabilities and risk impact consequences considering project interactions, are limited. This study aims to model PPR prediction and expand PPR prediction tools.

In this study, the authors build a PPR prediction model based on a genetic algorithm and back-propagation neural network (GA-BPNN) integrated with entropy-trapezoidal fuzzy numbers. Then, the authors verify the proposed model with real data and obtain PPR impact degrees.

The test results indicate that the proposed method achieves an average absolute error of 0.002 and an average prediction accuracy rate of 97.8%. The former is reduced by 0.038, while the latter is improved by 32.1% when compared with the results of the original BPNN model. Finally, the authors conduct an index sensitivity analysis for identifying critical risks to effectively control them.

This study develops a hybrid PPR prediction model that integrates a GA-BPNN with entropy-trapezoidal fuzzy numbers. The authors use this model to predict PPR impact degrees, which consist of both risk occurrence probabilities and risk impact consequences considering project interactions. The results provide insights into PPR management.

Historical bazaars, a huge treasure of Iranian culture, art and economy, are places for social capital development. Un-supervised management in past decades has led to the demolition and change of historical bazaars and negligence of its different aspects. The present research aims to investigate the resilience of historical bazaars preserving their identity and different developments.

The artificial neural network (ANN) has been applied to investigate the resilience of historical bazaars. This model consists of three main networks for evaluating the resilience of historical networks in terms of adaptability, variability and reactivity.

The ANN proposed to evaluate the resilience of historic bazaars based on the mentioned factors is efficient. By calculating mean squared error (MSE), the model accuracy for evaluating adaptability, variability and reactivity were obtained at 7.62e-25, 2.91e-24 and 1.51e-24. The correlation coefficient was obtained at a significance level of 99%. This indicates the considerable effectiveness of the artificial intelligence model in modeling and predicting the qualitative properties of historical bazaars resilience.

This paper clarifies indexes and components of resilience in terms of adaptability, variability and reactivity. Then, the ANN model is obtained with the least error and very high accuracy that predict the resilience of historical bazaars.