Automatic Generation Research Articles

Random subspace ensemble-based detection of false data injection attacks in automatic generation control systems

Automatic Generation Control (AGC) systems in smart grids are increasingly vulnerable to cyber-attacks, particularly False Data Injection (FDI) attacks, due to their reliance on information and communication technologies. These vulnerabilities pose significant threats to the reliable operation of power systems. To address this challenge, this research paper introduces the machine learning (ML) based cyberattack detection technique designed to identify FDI attacks with the highest accuracy proficiently. The study involves a comprehensive analysis of three features: the original discrete signal feature, the cycle-to-cycle-based feature, and the sample-to-sample-based feature. These features are utilized for detecting FDI attacks and distinguishing them from normal load variations. The research meticulously collects data by simulating diverse FDI attacks, including step attacks, pulse attacks, random attacks, and normal load variation cases on an AGC power system. Four ML classifiers are selected and compared for the classification task. The simulation results reveal that the sample-to-sample-based feature proves highly effective in distinguishing FDI attacks compared to the original signal and cycle-to-cycle-based features. Notably, the results indicate that the random subspace ensemble (RaSE) classifier, utilizing sample-to-sample-based features, effectively identifies and classifies all normal and FDI attacks. This research provides valuable insights into the potential of ML techniques for enhancing FDI attack detection in the AGC of power systems. It provides a potential pathway for overcoming the limitations associated with traditional model-based FDI detection methods.

From human explanations to explainable AI: Insights from constrained optimization

Many complex decision-making scenarios encountered in the real-world, including energy systems and infrastructure planning, can be formulated as constrained optimization problems. Solutions for these problems are often obtained using white-box solvers based on linear program representations. Even though these algorithms are well understood and the optimality of the solution is guaranteed, explanations for the solutions are still necessary to build trust and ensure the implementation of policies. Solution algorithms represent the problem in a high-dimensional abstract space, which does not translate well to intuitive explanations for lay people. Here, we report three studies in which we pose constrained optimization problems in the form of a computer game to participants. In the game, called Furniture Factory, participants manage a company that produces furniture. In two qualitative studies, we first elicit representations and heuristics with concurrent explanations and validate their use in post-hoc explanations. We analyze the complexity of the explanations given by participants to gain a deeper understanding of how complex cognitively adequate explanations should be. Based on insights from the analysis of the two qualitative studies, we formalize strategies that in combination can act as descriptors for participants’ behavior and optimal solutions. We match the strategies to decisions in a large behavioral dataset (>150 participants) gathered in a third study, and compare the complexity of strategy combinations to the complexity featured in participants’ explanations. Based on the analyses from these three studies, we discuss how these insights can inform the automatic generation of cognitively adequate explanations in future AI systems.

An automatic generation approach of process model based on feature knowledge and geometric modeling

Traditional process planning applies knowledge to convert design information within the part model into process information. This information is then displayed by manually drawing two-dimensional (2D) process cards from multiple views, illustrating the geometric design and the process details. However, this method has revealed several issues, including poor efficiency, information misinterpretation, and the potential for manual drawing errors. This traditional approach hampers the integration of manufacturing information across engineering software. It exacerbates the digital divide between computer-aided design (CAD), computer-aided process planning (CAPP), and computer-aided manufacturing (CAM). To address these issues, this study proposes an automated approach for creating three-dimensional (3D) process models based on feature knowledge and geometric modeling. The 3-axis milling features are recognized as the machining objects from the boundary representation (B-Rep) part model. Geometric and parameter knowledge for modeling is derived from the machining step. In the proposed approach, two geometric modeling methods are investigated to construct feature state volumes (FSVs). The first method utilizes FSV modeling to simulate the shape of unmachined features before rough machining, while the second method utilizes FSV modeling to construct the shape of machined features before finishing machining. The case studies illustrate that the proposed approach can construct FSVs for various machining states and autonomously generate process models. In digital manufacturing, this approach assists process planners in intuitively evaluating the reasonableness of process routes. Additionally, it provides the essential driving geometry required for the autonomous generation of tool paths.

An Automatic Generation Method of Maintenance Worker Schedules at a Railroad Terminal Station by Tabu Search

An Automatic Generation Method of Maintenance Worker Schedules at a Railroad Terminal Station by Tabu Search

SAT solver-driven approach for validating local electron counting rule

Determining large, complex surface structures is essential for understanding and modeling crystal growth. For semiconductor surfaces, the electron counting (EC) rule is known to be useful for predicting surface stability. In this study, a scheme is proposed to automatically determine if a sampled surface structure locally satisfies the EC rule using a Boolean Satisfiability Problem (SAT) solver. This automatic determination is demonstrated on the GaN(0001)-(6 × 6) surface system with H and Ga adsorption as an example. The scheme is also applicable to the automatic generation of surface structures that are expected to be relatively stable, and is expected to accelerate the study of large and complex surface structures of various semiconductor materials.

Dance2Music-Diffusion: leveraging latent diffusion models for music generation from dance videos

With the rapid development of social networks, short videos have become a popular form of content, especially dance videos. In this context, research on automatically generating music for dance videos shows significant practical value. However, existing studies face challenges such as limited richness in music timbre and lack of synchronization with dance movements. In this paper, we propose Dance2Music-Diffusion, a novel framework for music generation from dance videos using latent diffusion models. Our approach includes a motion encoder module for extracting motion features and a music diffusion generation module for generating latent music representations. By integrating dance type monitoring and latent diffusion techniques, our framework outperforms existing methods in generating complex and rich dance music. We conducted objective and subjective evaluations of the results produced by various existing models on the AIST++ dataset. Our framework shows outstanding performance in terms of beat recall rate, consistency with GT beats, and coordination with dance movements. This work represents the state of the art in automatic music generation from dance videos, is easy to train, and has implications for enhancing entertainment experiences and inspiring innovative dance productions. Sample videos of our generated music and dance can be viewed at https://youtu.be/eCvLdLdkX-Y. The code is available at https://github.com/hellto/dance2music-diffusion.

WoTs-TDGV: Thing Description Generator and Validator

The breakneck evolution of the Web of Things (WoT) has led to a burgeoning demand for reliable tools that facilitate the automatic generation and validation of Thing Descriptions (TD). However, emerging tools that generate or validate TD automatically have suffered from abounding limitations and constraints. In this paper, we propose and implement an automatic web-based Thing Description Generator and Validator (TDGV) application. TDGV automates and simplifies TDs generation while ensuring the compliance with the WoT standards. The application generates more accurate thing description results. In order to evaluate the usability of the TDGV, a Concurrent Think-aloud usability study was conducted with a sample of 150 developers. The study revealed positive feedback regarding the user interface and the TDGV usability. The study results highlight areas for enhancement, such as TDGV navigation. TDGV is a convenient and robust Thing Description Generator and Validator web application. It provides a valuable tool for users in the WoT domain, enabling them to automatically and easily generate and validate TDs.

Efficient SpMM Accelerator for Deep Learning: Sparkle and Its Automated Generator

Deep learning (DL) technology has made breakthroughs in a wide range of intelligent tasks, such as vision, language, recommendation systems, and so on. Sparse matrix multiplication (SpMM) is the key computation kernel of most sparse models. Conventional computing platforms, such as CPUs, GPUs, and AI chips with regular processing units, are unable to effectively support sparse computation due to their fixed structure and instruction sets. This work extends Sparkle, an accelerator architecture, which is developed specifically for processing SpMM in DL. During the balanced data loading process, some modifications are implemented to enhance the flexibility of the Sparkle architecture. Additionally, a Sparkle generator is proposed to accommodate diverse resource constraints and facilitate adaptable deployment. Leveraging Sparkle’s structural parameters and template-based design methods, the generator enables automatic Sparkle circuit generation under varying parameters. An instantiated Sparkle accelerator is implemented on the Xilinx xqvu11p FPGA platform with a specific configuration. Compared to the state-of-the-art SpMM accelerator SIGMA, the Sparkle accelerator instance improves the sparse computing efficiency by about 10 to 20 \(\%\) . Furthermore, the Sparkle instance achieved 7.76 \(\times\) higher performance over the Nvidia Orin NX GPU. More instances of accelerators with different parameters were evaluated, demonstrating that the Sparkle architecture can effectively accelerate SpMM.

자막 제공 서비스 앱의 UI/UX 개선 연구 - 청각 장애인을 위한 자막 자동 생성 앱 ‘이어줌’의 사용성 향상을 위한 제안

This study aims to improve users' video content accessibility, usability, and aesthetic satisfaction by analyzing the UI/UX of <Eeojum>, an app that provides an automatic subtitle creation service for the hearing impaired, in terms of functionality and usability. To this end, we conducted preliminary research on automatic subtitle generation apps, analyzed the environment and actual conditions of mobile use by hearing impaired people, and analyzed domestic and international app accessibility policies and public institution UI design guidelines. Based on this, we looked at the UI/UX characteristics of <Eeojum>, derived UI/UX improvement items to improve app accessibility quality and usability, and proposed improvements to the voice conversion app UI/UX design draft. The biggest goal was to simplify the structure of IA and strengthen the visual formability of the display to improve usability, presenting design guidelines aimed at improving usability for the hearing impaired, the main users.

CONTROL SYSTEMS SYNTHESIS FOR ROBOTS ON THE BASE OF MACHINE LEARNING BY SYMBOLIC REGRESSION

This paper presents a novel numerical method for solving the control system synthesis problem through the application of machine learning techniques, with a particular focus on symbolic regression. Symbolic regression is used to automate the development of control systems by constructing mathematical expressions that describe control functions based on system data. Unlike traditional methods, which often require manual programming and tuning, this approach leverages machine learning to discover optimal control solutions. The paper introduces a general framework for machine learning in control system design, with an emphasis on the use of evolutionary algorithms to optimize the generated control functions. The key contribution of this research lies in the development of an algorithm based on the principle of small variations in the baseline solution. This approach significantly enhances the efficiency of discovering optimal control functions by systematically exploring the solution space with minimal adjustments. The method allows for the automatic generation of control laws, reducing the need for manual coding, which is especially beneficial in the context of complex control systems, such as robotics. To demonstrate the applicability of the method, the research applies symbolic regression to the control synthesis of a mobile robot. The results of this case study show that symbolic regression can effectively automate the process of generating control functions, significantly reducing development time while improving accuracy. However, the paper also acknowledges certain limitations, including the computational demands required for symbolic regression and the challenges associated with real-time implementation in highly dynamic environments. These issues represent important areas for future research, where further optimization and hybrid approaches may enhance the method's practicality and scalability in real-world applications.

A Transfer Learning Approach for Arabic Image Captions

Background: Arabic image captioning (AIC) is the automatic generation of text descriptions in the Arabic language for images. Applies a transfer learning approach in deep learning to enhance computer vision and natural language processing. There are many datasets in English reverse other languages. Instead of, the Arabs researchers unanimously agreed that there is a lack of Arabic databases available in this field. Objective: This paper presents the improvement and processing of the available Arabic textual database using Google spreadsheets for translation and creation of AR. Flicker8k2023 dataset is an extension of the Arabic Flicker8k dataset available, it was uploaded to GitHub and made public for researches. Methods: An efficient model proposed using deep learning techniques by including two pre-training models (VGG16 and VGG19), to extract features from the images and build (LSTM and GRU) models to process textual prediction sequence. In addition to the effect of pre-processing the text in Arabic. Results: The adopted model outperforms better compared to the previous study in BLEU-1 from 33 to 40. Conclusions: This paper concluded that the biggest problem is the database available in the Arabic language. This paper has worked to increase the size of the text database from 24,276 to 32,364 thousand captions, where each image contains 4 captions.

Tactile Simultaneous Localization and Mapping Using Low-Cost, Wearable LiDAR

Tactile maps are widely recognized as useful tools for mobility training and the rehabilitation of visually impaired individuals. However, current tactile maps lack real-time versatility and are limited because of high manufacturing and design costs. In this study, we introduce a device (i.e., ClaySight) that enhances the creation of automatic tactile map generation, as well as a model for wearable devices that use low-cost laser imaging, detection, and ranging (LiDAR,) used to improve the immediate spatial knowledge of visually impaired individuals. Our system uses LiDAR sensors to (1) produce affordable, low-latency tactile maps, (2) function as a day-to-day wayfinding aid, and (3) provide interactivity using a wearable device. The system comprises a dynamic mapping and scanning algorithm and an interactive handheld 3D-printed device that houses the hardware. Our algorithm accommodates user specifications to dynamically interact with objects in the surrounding area and create map models that can be represented with haptic feedback or alternative tactile systems. Using economical components and open-source software, the ClaySight system has significant potential to enhance independence and quality of life for the visually impaired.

Research on automatic generation technology of double helix-shaped conformal cooling channels for injection mold

Research on automatic generation technology of double helix-shaped conformal cooling channels for injection mold

Dynamical Sphere Regrouping Particle Swarm Optimization Programming: An Automatic Programming Algorithm Avoiding Premature Convergence

Symbolic regression plays a crucial role in machine learning and data science by allowing the extraction of meaningful mathematical models directly from data without imposing a specific structure. This level of adaptability is especially beneficial in scientific and engineering fields, where comprehending and articulating the underlying data relationships is just as important as making accurate predictions. Genetic Programming (GP) has been extensively utilized for symbolic regression and has demonstrated remarkable success in diverse domains. However, GP’s heavy reliance on evolutionary mechanisms makes it computationally intensive and challenging to handle. On the other hand, Particle Swarm Optimization (PSO) has demonstrated remarkable performance in numerical optimization with parallelism, simplicity, and rapid convergence. These attributes position PSO as a compelling option for Automatic Programming (AP), which focuses on the automatic generation of programs or mathematical models. Particle Swarm Programming (PSP) has emerged as an alternative to Genetic Programming (GP), with a specific emphasis on harnessing the efficiency of PSO for symbolic regression. However, PSP remains unsolved due to the high-dimensional search spaces and local optimal regions in AP, where traditional PSO can encounter issues such as premature convergence and stagnation. To tackle these challenges, we introduce Dynamical Sphere Regrouping PSO Programming (DSRegPSOP), an innovative PSP implementation that integrates DSRegPSO’s dynamical sphere regrouping and momentum conservation mechanisms. DSRegPSOP is specifically developed to deal with large-scale, high-dimensional search spaces featuring numerous local optima, thus proving effective behavior for symbolic regression tasks. We assess DSRegPSOP by generating 10 mathematical expressions for mapping points from functions with varying complexity, including noise in position and cost evaluation. Moreover, we also evaluate its performance using real-world datasets. Our results show that DSRegPSOP effectively addresses the shortcomings of PSO in PSP by producing mathematical models entirely generated by AP that achieve accuracy similar to other machine learning algorithms optimized for regression tasks involving numerical structures. Additionally, DSRegPSOP combines the benefits of symbolic regression with the efficiency of PSO.

Cadastral-to-Agricultural: A Study on the Feasibility of Using Cadastral Parcels for Agricultural Land Parcel Delineation

Agricultural land parcels (ALPs) are essential for effective agricultural management, influencing activities ranging from crop yield estimation to policy development. However, traditional methods of ALP delineation are often labor-intensive and require frequent updates due to the dynamic nature of agricultural practices. Additionally, the significant variations across different regions and the seasonality of agriculture pose challenges to the automatic generation of accurate and timely ALP labels for extensive areas. This study introduces the cadastral-to-agricultural (Cad2Ag) framework, a novel approach that utilizes cadastral data as training labels to train deep learning models for the delineation of ALPs. Cadastral parcels, which are relatively widely available and stable elements in land management, serve as proxies for ALP delineation. Employing an adapted U-Net model, the framework automates the segmentation process using remote sensing images and geographic information system (GIS) data. This research evaluates the effectiveness of the proposed Cad2Ag framework in two U.S. regions—Indiana and California—characterized by diverse agricultural conditions. Through rigorous evaluation across multiple scenarios, the study explores diverse scenarios to enhance the accuracy and efficiency of ALP delineation. Notably, the framework demonstrates effective ALP delineation across different geographic contexts through transfer learning when supplemented with a small set of clean labels, achieving an F1-score of 0.80 and an Intersection over Union (IoU) of 0.67 using only 200 clean label samples. The Cad2Ag framework’s ability to leverage automatically generated, extensive, free training labels presents a promising solution for efficient ALP delineation, thereby facilitating effective management of agricultural land.

Species selection for automatic chemical kinetic mechanism generation

AbstractMany important chemical kinetic systems require detailed chemical kinetic models to resolve. These detailed kinetic models can involve thousands of species and hundreds of thousands of chemical reactions, making them difficult to construct by hand. Modern automatic mechanism generation algorithms can mostly be divided into two classes: rule and rate based. Rule‐based generators choose species based on user defined constraints on species and reaction classes. Rate‐based generators generate a much larger set of potentially important species and reactions and then choose which ones to add based on running simulations of species and reactions deemed important and calculating the flux to potentially important species. In principle, the latter is preferable, as it requires the user to make far fewer assumptions about what is important in the system. However, while the effectiveness of the rate‐based approach has been demonstrated in a wide variety of systems, it has also been demonstrated to have difficulty picking up important low‐flux chemistries. Here we present a discussion of the challenges associated with rate‐based mechanism generation and new algorithms that are able to efficiently mitigate these challenges improving species selection during mechanism generation in a set of case studies.

Geometrically nonlinear analysis of layered beams using symbolic approach

This study presents a novel layered spatial beam model with discrete connections between layers, developed to accurately capture large displacements and rotations as well as finite strains. The formulation is characterized by simplicity, robustness and compatibility with automatic code generation, making it suitable for various applications. Key features of the model include the use of a piecewise constant strain field, the inclusion of discrete unknowns such as strains and stress resultants, and the efficient numerical implementation using the automatic code generation. The discrete connections between the layers of the model enable an efficient description of the interlaminar behaviour and the consideration of nonlinear constitutive properties. Numerical examples demonstrate the effectiveness and accuracy of the proposed approach and illustrate its potential for practical engineering applications.

Multi-part kinematic constraint prediction for automatic generation of CAD model assemblies using graph convolutional networks

This paper presents a machine learning-based approach to predict kinematic constraints between CAD models that have potentially never been assembled together before. During the learning phase, the algorithm is trained to predict the next-possible-constraints between a set of parts candidate to the assembly. Assemblies are represented in a new graph-based formalism that is capable of capturing features associated with parts, interfaces between parts and constraints between them. Using such a multi-level feature extraction strategy coupled to a state-by-state graph decomposition, the approach does not need to be trained on a large database. This formalism is used to model both the network input and output where the next-possible-constraints appear after evaluation. The core of the approach relies on a series of networks based on a link-prediction encoder–decoder architecture, integrating the capabilities of several convolutional networks trained in an end-to-end manner. A decision-making algorithm is added to post-process the output and drive the prediction process in finding one among the set of next-possible-constraints. This process is repeated until no more constraints can be added. The experimental results show that the proposed approach outperforms state-of-the-art methods on such assembly tasks. Although the state-by-state assembly algorithm is iterative, it still takes into account the whole set of parts as well as the whole set of constraints already predicted, and this makes it possible to handle constraint cycles, which is generally not possible when not considering multiple parts as input.

Research on Automatic Generation of Park Road Network Based on Skeleton Algorithm

Research on Automatic Generation of Park Road Network Based on Skeleton Algorithm

Design optimization of a three-dimensional hexagonal braiding technique

The three-dimensional hexagonal braiding technique, utilizing an individually controllable horn gear mechanism, enables the automatic generation of a wide range of intricate fabric preforms for structural composites. However, the limited yarn-carrying capacity and the potential risk of collisions between horn gears hinder the development of this type of braiding machine. This study proposes an optimized hexagonal braiding technique to enhance the machinery and control system, aiming to improve the yarn-carrying capacity and prevent collisions. Specifically, the optimization includes modifying the switch device, developing a new algorithm for controlling each horn gear, and designing a control panel to facilitate human–computer interaction. Additionally, simulations of various fabric structures demonstrate improved braiding capability compared to traditional hexagonal braiders. Moreover, a prototype braider is assembled, capable of automatically braiding diverse fabrics using the control system, thereby demonstrating its potential to manufacture complex composite preforms.