Search results

This study aims to propose a unique algorithm-based hysteresis current control technique (HCCT) for induction motor using a single-phase voltage source inverter (SPVSI) to eliminate both sub and inter harmonics (SIH) and electromagnetic interference (EMI). The total harmonic distortion (THD) of the load current also reduces in comparison to standard HCCT and modified technique-based existing HCCT.

Matlab simulation has been carried out to develop an SPVSI model and the unique algorithm-based HCCT. The same platform has also been used to develop a few existing HCCTs such as standard, dual-band and modified. The switching frequency and harmonic analysis of load currents for all the HCCTs have been compared in the paper. The hardware implementation of the proposed algorithm-based HCCT was also verified and compared with the simulation results.

The proposed unique algorithm-based HCCT provides the benefits of both unipolar and bipolar switching techniques. It reduces the switching frequency as unipolar switching scheme and eliminates the EMI. It also reduces THD and nullifies SIH of the load current. This enables an improvement in the overall performance and efficiency of the motor.

This proposed HCCT eliminates the SIH and improves the overall efficiency of the motor, hence can prevent overheating, vibration, acoustic noise, pulsating torque and braking of the rotor shaft of the motor and increasing the reliability of the system.

It can be implemented for the motors that are used in household applications and electric vehicles through one-phase inverter.

This proposed HCCT has detected the zero crossing point of reference current, allowed samples and shifted the necessary amount of hysteresis band at zero crossing region to eliminate SIH and THD.

This study aims to present a novel Genetic Algorithm-Based Design Model (GABDM) to provide reduced-risk areas, namely, a “safe footprint,” in interior spaces during earthquakes. This study focuses on housing interiors as the space where inhabitants spend most of their daily lives.

The GABDM uses the genetic algorithm as a method, the Nondominated Sorting Genetic Algorithm II algorithm, and the Wallacei X evolutionary optimization engine. The model setup, including inputs, constraints, operations and fitness functions, is presented, as is the algorithmic model’s running procedure. Following the development phase, GABDM is tested with a sample housing interior designed by the authors based on the literature related to earthquake risk in interiors. The implementation section is organized to include two case studies.

The implementation of GABDM resulted in optimal “safe footprint” solutions for both case studies. However, the results show that the fitness functions achieved in Case Study 1 differed from those achieved in Case Study 2. Furthermore, Case Study 2 has generated more successful (higher ranking) “safe footprint” alternatives with its proposed furniture system.

This study presents an original approach to dealing with earthquake risks in the context of interior design, as well as the development of a design model (GABDM) that uses a generative design method to reduce earthquake risks in interior spaces. By introducing the concept of a “safe footprint,” GABDM contributes explicitly to the prevention of earthquake risk. GABDM is adaptable to other architectural typologies that involve footprint and furniture relationships.

The vehicle routing problem (VRP) has been widely investigated during last decades to reduce logistics costs and improve service level. In addition, many researchers have realized the importance of green logistic system design in decreasing environmental pollution and achieving sustainable development.

In this paper, a bi-objective mathematical model is developed for the capacitated electric VRP with time windows and partial recharge. The first objective deals with minimizing the route to reduce the costs related to vehicles, while the second objective minimizes the delay of arrival vehicles to depots based on the soft time window. A hybrid metaheuristic algorithm including non-dominated sorting genetic algorithm (NSGA-II) and teaching-learning-based optimization (TLBO), called NSGA-II-TLBO, is proposed for solving this problem. The Taguchi method is used to adjust the parameters of algorithms. Several numerical instances in different sizes are solved and the performance of the proposed algorithm is compared to NSGA-II and multi-objective simulated annealing (MOSA) as two well-known algorithms based on the five indexes including time, mean ideal distance (MID), diversity, spacing and the Rate of Achievement to two objectives Simultaneously (RAS).

The results demonstrate that the hybrid algorithm outperforms terms of spacing and RAS indexes with p-value <0.04. However, MOSA and NSGA-II algorithms have better performance in terms of central processing unit (CPU) time index. In addition, there is no meaningful difference between the algorithms in terms of MID and diversity indexes. Finally, the impacts of changing the parameters of the model on the results are investigated by performing sensitivity analysis.

In this research, an environment-friendly transportation system is addressed by presenting a bi-objective mathematical model for the routing problem of an electric capacitated vehicle considering the time windows with the possibility of recharging.

This paper aims to propose a bed and breakfast (B&B) recommendation method that takes into account review timeliness and user preferences to help consumers choose the most satisfactory B&B.

This paper proposes a B&B ranking method based on improved intuitionistic fuzzy sets. First, text mining and cluster analysis are combined to identify the concerns of consumers and construct an attribute set. Second, an attribute-level-based text sentiment analysis is established. The authors propose an improved intuitionistic fuzzy set, which is more in line with the actual situation of sentiment analysis of online reviews. Next, subjective-objective combinatorial assignments are applied, considering the consumers’ preferences. Finally, the vlsekriterijumska optimizacija i kompromisno resenje (VIKOR) algorithm, based on the improved score function, is advised to evaluate B&Bs.

A case study is presented to illustrate the use of the proposed method. Comparative analysis with other multi-attribute decision-making (MADM) methods proves the effectiveness and superiority of the VIKOR algorithm based on the improved intuitionistic fuzzy sets proposed in this paper.

Proposing a B&B recommendation method that takes into account review timeliness and user customization is the innovation of this paper. In this approach, the authors propose improved intuitionistic fuzzy sets. Compared with the traditional intuitionistic fuzzy set, the improved intuitionistic fuzzy set increases the abstention membership, which is more in line with the actual situation of attribute-level sentiment analysis of online reviews.

LeftTube – a loosely connected community of left-leaning content creators on YouTube – includes a subsection of video essayists that conduct scholarly work seemingly adjacent to critical research. Exploring this digital community of critical scholars may precipate opportunities for collaboration and reciprocal learning to better academic qualitative research approaches. Therefore, the purpose of this exploratory study is to (1) examine if and how this digital community engages in critical scholarship, and (2) initiate a call for academic qualitative scholars to watch this digital space as a potential source of collaboration, an opportunity for co-learning and consideration for inclusion in the qualitative “big tent”.

Using an algorithm-based sampling procedure, 143 videos were sampled across 23 Black women content creators. Videos were analyzed for characteristics of critical research using multimodal-ethnographic semiotic analysis.

Findings suggest that 11 strategies of critical scholarship were used with themes of knowledge production and ethical framework. Such results indicate that this subsection of LeftTube video essayists are conducting critical scholarship.

The most significant implication is the expansion of the qualitative “big tent” to include international social media content creators who conduct social science research. This would have many benefits to academic qualitative researchers, including learning how the studied community (1) makes critical scholarship impactful and influential in civil discourse, (2) mobilizes critical language, and (3) resists neoliberal and capitalist systems attempting to marginalize critical research.

Privacy and security of personal data is the prime concern in any communication. Security algorithms play a crucial role in privacy preserving and are used extensively. Therefore, these algorithms need to be effective as well as energy-efficient. Advanced Encryption Standards (AES) is one of the efficient security algorithms. The principal purpose of this research is to design Energy efficient implementation of AES, as it is one of the important aspects for a step toward green computing.

This paper presents a low voltage complementary metal oxide semiconductor (LVCMOS) based energy efficient architecture for AES encryption algorithm on Field Programmable Gate Array (FPGA) platform. The experiments are performed for five different FPGAs at different input/output standards of LVCMOS. Experiments are performed separately at two frequencies (default and 1.6 GHz).

The comparative study of total on-chip power consumption for different frequency suggested that LVCMOS12 performed best for all the FPGAs. Also, Kintex-7 Low Voltage was found to be the best performing FPGA. At 1.6 GHz frequency, the authors observed 55% less on-chip power consumption when switched from Artix-7 with LVCMOS33 (maximum power consuming combination) to Kintex-7 Low Voltage with LVCMOS12. Mathematical models are developed for the proposed design.

The green implementation of AES algorithm based on LVCMOS standards has not been explored yet by researchers. The energy efficient implementation of AES will certainly be beneficial for society as it will consume less power and dissipate lesser heat to environment.

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.

The purpose of this study is to designed a robot odometry based on three dimensional (3D) laser point cloud data, inertial measurement unit (IMU) data and real-time kinematic (RTK) data in underground spatial features and gravity fluctuations environment. This method improves the mapping accuracy in two types of underground space: multi-layer space and large-scale scenarios.

An IMU–Laser–RTK fusion mapping algorithm based on Iterative Kalman Filter was proposed, and the observation equation and Jacobian matrix were derived. Aiming at the problem of inaccurate gravity estimation, the optimization of gravity is transformed into the optimization of SO(3), which avoids the problem of gravity over-parameterization.

Compared with the optimization method, the computational cost is reduced. Without relying on the wheel speed odometer, the robot synchronization localization and 3D environment modeling for multi-layer space are realized. The performance of the proposed algorithm is tested and compared in two types of underground space, and the robustness and accuracy in multi-layer space and large-scale scenarios are verified. The results show that the root mean square error of the proposed algorithm is 0.061 m, which achieves higher accuracy than other algorithms.

Based on the problem of large loop and low feature scale, this algorithm can better complete the map loop and self-positioning, and its root mean square error is more than double compared with other methods. The method proposed in this paper can better complete the autonomous positioning of the robot in the underground space with hierarchical feature degradation, and at the same time, an accurate 3D map can be constructed for subsequent research.

The present paper aims at the multi-objective optimization of a reentrant hexagonal cell auxetic structure. In addition, a parametric analysis will be carried out to verify how each of the design factors impact each of the responses.

The multi-objective optimization of five different responses of an auxetic model was considered: mass, critical buckling load under compression effort, natural frequency, Poisson's ratio and failure load. The response surface methodology was applied, and a new meta-heuristic of optimization called the multi-objective Lichtenberg algorithm was applied to find the optimized configuration of the model. It was possible to increase the failure load by 26.75% in compression performance optimization. Furthermore, in the optimization of modal performance, it was possible to increase the natural frequency by 37.43%. Finally, all 5 responses analyzed simultaneously were optimized. In this case, it was possible to increase the critical buckling load by 42.55%, the failure load by 28.70% and reduce the mass and Poisson's ratio by 15.97 and 11%, respectively. This paper addresses something new in the scientific world to date when evaluating in a multi-objective optimization problem, the compression and modal performance of an auxetic reentrant model.

It was possible to find multi-objective optimized structures. It was possible to increase the critical buckling load by 42.82%, and the failure load in compression performance by 26.75%. Furthermore, in the optimization of modal performance, it was possible to increase the natural frequency by 37.43%, and decrease the mass by 15.97%. Finally, all 5 responses analyzed simultaneously were optimized. In this case, it was possible to increase the critical buckling load by 42.55%, increase the failure load by 28.70% and reduce the mass and Poisson's ratio by 15.97 and 11%, respectively.

There is no work in the literature to date that performed the optimization of 5 responses simultaneously of a reentrant hexagonal cell auxetic structure. This paper also presents an unprecedented statistical analysis in the literature that verifies how the design factors impact each of the responses.

Communities representing groups of agents with similar interests or functions are one of the essential features of complex networks. Finding communities in real-world networks is critical for analyzing complex systems in various areas ranging from collaborative information to political systems. Given the different characteristics of networks and the capability of community detection in handling a plethora of societal problems, community detection methods represent an emerging area of research. Contributing to this field, the authors propose a new community detection algorithm based on the hybridization of node and link granulation.

The proposed algorithm utilizes a rough set-theoretic concept called closure on networks. Initial sets are constructed by using neighborhood topology around the nodes as well as links and represented as two different categories of granules. Subsequently, the authors iteratively obtain the constrained closure of these sets. The authors use node mutuality and link mutuality as merging criteria for node and link granules, respectively, during the iterations. Finally, the constrained closure subsets of nodes and links are combined and refined using the Jaccard similarity coefficient and a local density function to obtain communities in a binary network.

Extensive experiments conducted on twelve real-world networks followed by a comparison with state-of-the-art methods demonstrate the viability and effectiveness of the proposed algorithm.

The study also contributes to the ongoing effort related to the application of soft computing techniques to model complex systems. The extant literature has integrated a rough set-theoretic approach with a fuzzy granular model (Kundu and Pal, 2015) and spectral clustering (Huang and Xiao, 2012) for node-centric community detection in complex networks. In contributing to this stream of work, the proposed algorithm leverages the unexplored synergy between rough set theory, node granulation and link granulation in the context of complex networks. Combined with experiments of network datasets from various domains, the results indicate that the proposed algorithm can effectively reveal co-occurring disjoint, overlapping and nested communities without necessarily assigning each node to a community.

This study carries important practical implications for complex adaptive systems in business and management sciences, in which entities are increasingly getting organized into communities (Jacucci et al., 2006). The proposed community detection method can be used for network-based fraud detection by enabling experts to understand the formation and development of fraudulent setups with an active exchange of information and resources between the firms (Van Vlasselaer et al., 2017). Products and services are getting connected and mapped in every walk of life due to the emergence of a variety of interconnected devices, social networks and software applications.

The proposed algorithm could be extended for community detection on customer trajectory patterns and design recommendation systems for online products and services (Ghose et al., 2019; Liu and Wang, 2017). In line with prior research, the proposed algorithm can aid companies in investigating the characteristics of implicit communities of bloggers or social media users for their services and products so as to identify peer influencers and conduct targeted marketing (Chau and Xu, 2012; De Matos et al., 2014; Zhang et al., 2016). The proposed algorithm can be used to understand the behavior of each group and the appropriate communication strategy for that group. For instance, a group using a specific language or following a specific account might benefit more from a particular piece of content than another group. The proposed algorithm can thus help in exploring the factors defining communities and confronting many real-life challenges.

This work is based on a theoretical argument that communities in networks are not only based on compatibility among nodes but also on the compatibility among links. Building up on the aforementioned argument, the authors propose a community detection method that considers the relationship among both the entities in a network (nodes and links) as opposed to traditional methods, which are predominantly based on relationships among nodes only.