Search

The present comment concerns the correct presentation of an algorithm proposed in the above paper for the glow-curve deconvolution in the case of continuous distribution of trapping states. Since most researchers would use directly the proposed algorithm as published, they should be notified of its correct formulation during the fitting of TL glow curves of materials with continuous trap distribution using this Equation. [ABSTRACT FROM AUTHOR]

This is the second paper in a series of two. The goal of the series is to give a polynomial-time algorithm for the 4-coloring problem and the 4-precoloring extension problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. Combined with previously known results, this completes the classification of the complexity of the 4-coloring problem for graphs with a connected forbidden induced subgraph. In this paper we give a polynomial time-algorithm that starts with a 4-precoloring of a graph with no induced six-vertex path and outputs a polynomial-sized collection of so-called excellent precolorings. Excellent precolorings are easier to handle than general ones, and, in addition, in order to determine whether the initial precoloring can be extended to the whole graph, it is enough to answer the same question for each of the excellent precolorings in the collection. The first paper in the series deals with excellent precolorings, thus providing a complete solution to the problem. [ABSTRACT FROM AUTHOR]

This is the first paper in a series whose goal is to give a polynomial-time algorithm for the 4-coloring problem and the 4-precoloring extension problem restricted to the class of graphs with no induced six-vertex path, thus proving a conjecture of Huang. Combined with previously known results, this completes the classification of the complexity of the 4-coloring problem for graphs with a connected forbidden induced subgraph. In this paper we give a polynomial-time algorithm that determines if a special kind of precoloring of a P6-free graph has a precoloring extension, and constructs such an extension if one exists. Combined with the main result of the second paper of the series, this gives a complete solution to the problem. [ABSTRACT FROM AUTHOR]

A reasonable method for estimating alighting stops can provide a data guarantee for schedule design and vehicle scheduling. However, few studies, to our best knowledge, have addressed this problem using the variable distance threshold for different types of passengers. This paper is based on available smart card data, and a two-stage algorithm is designed to obtain missing alighting stations in the entry-only urban public transportation system. This algorithm divides passengers into seven types, determines varying distance thresholds for different passengers, and includes five assumptions. Based on the first three assumptions, the corresponding subalgorithms are designed, respectively, constituting the first-stage algorithm, and the first match for all passengers' alighting stations is carried out. The second-stage algorithm is designed on the basis of the latter two assumptions. A secondary match is conducted on data that were not successfully matched in the first stage to ensure that alighting stops for all passengers are identified. The proposed methods are verified using urban public transport data from the city of Zhuhai as an example. Research results show that the drop-off stops where approximately 74% of passengers can be determined after matching the first-stage algorithm. The distance thresholds for various passengers are different, and the distance thresholds for the same type of passengers over different days are also different. Compared with the traditional fixed distance threshold, the variable distance threshold for various passengers proposed in this paper can improve the match rate of alighting station estimate, about 9%. By appropriately extending the distance thresholds for different passengers, the match rate for passengers who work or live in the suburbs can be further improved, which is in line with the actual travel status of such passengers. The second-stage algorithm can identify alighting sites for a single or unlinked trip. The efficiency of the methodology proposed in this study can meet the needs for practical applications, which may be applied to urban public transport systems. [ABSTRACT FROM AUTHOR]

Advancements in new technologies, a reduction in CO2 emissions, and the rising demand for energy are causing a growth in the share of renewable energy sources. In distribution networks, an increasing number of distributed generators (DGs) makes the utility grid's protection complex and demanding. Vector surge and rate-of-change-of-frequency are the established anti-islanding protection methods, recognizing that the standard paradigm for protection, involving distributed generation, cannot be set only once but has to be continuously updated following the requirements and changes in the system. One of the requirements is active participation in the preservation of system frequency and voltage, which can be interrupted if the DG trips and disconnects from the utility grid. Anti-islanding protection and spurious tripping can be avoided by implementing new algorithms and techniques. This paper presents a novel protection scheme based on a voltage frequency differential. The proposed algorithm employs remote and local frequency measurements in such a manner that, for the occurrence of a frequency difference, it is assumed that the DG is in an islanding state. In this article, we demonstrate the feasibility of the algorithm through numerical analysis of grid events and laboratory testing emulating real grid-measured values. The test results show that the algorithm is resilient to false tripping for non-islanding events and more reliable than conventional methods in islanding detection. The algorithm can be set to low-frequency differential values, drastically reducing the non-detection zone in any DG type, regardless of its size and voltage level at the point of common coupling. Unlike standard anti-islanding methods, the algorithm supports the ability of the DG to fault-ride through demand. [ABSTRACT FROM AUTHOR]

The purpose of this article is to present grassroots concepts and ideas about "the algorithm" in the religious context. The power and causality of algorithms are based on lines of computer code, making a society influenced by "black boxes" or "enigmatic technologies" (as they are incomprehensible to most people). On the other hand, the power of algorithms lies in the meanings that we attribute to them. The extent of the power, agency, and control that algorithms have over us depends on how much power, agency, and control we are willing to give to algorithms and artificial intelligence, which involves building the idea of their omnipotence. The key question is about the meanings and the ideas about algorithms that are circulating in society. This paper is focused on the analysis of "vernacular/folk" theories on algorithms, reconstructed based on posts made by the users of Polish Catholic forums. The qualitative analysis of online discourse makes it possible to point out several themes, i.e., according to the linguistic concept, "algorithm" is the source domain used in explanations of religious issues (God as the creator of the algorithm, the soul as the algorithm); algorithms and the effects of their work are combined with the individualization and personalization of religion; algorithms are perceived as ideological machines. [ABSTRACT FROM AUTHOR]

The paper considers algorithms for solving inverse scattering problems based on the discretization of the Gelfand–Levitan–Marchenko integral equations, associated with the system of nonlinear Schrödinger equations of the Manakov model. The numerical algorithm of the first order approximation for solving the scattering problem is reduced to the inversion of a series of nested block Toeplitz matrices using the Levinson-type bordering method. Increasing the approximation accuracy violates the Toeplitz structure of block matrices. Two algorithms are described that solve this problem for second order accuracy. One algorithm uses a block version of the Levinson bordering algorithm, which recovers the Toeplitz structure of the matrix by moving some terms of the systems of equations to the right-hand side. Another algorithm is based on the Toeplitz decomposition of an almost block-Toeplitz matrix and the Tyrtyshnikov bordering algorithm. The speed and accuracy of calculations using the presented algorithms are compared on an exact solution (the Manakov vector soliton). [ABSTRACT FROM AUTHOR]

Nowadays, web applications play central roles in information systems using the Internet. Then, client-side web programming using HTML, CSS, and JavaScript should be mastered first by novice students. Previously, we have presented the element fill-in-blank problem (EFP) for its self-study. An EFP instance requests to fill in the blank elements in the given source code by referring to the screenshots of the corresponding web page. The correctness of any answer is marked through string matching. However, these blanks were manually selected by considering the importance of elements and the uniqueness of their correct answers. In this paper, we propose a blank element selection algorithm to automatically generate a new EFP instance from a given source code for client-side web programming. We define the seven rules on blank element selections from the code, and implement the procedure in Python using the open source BeautifulSoup and regular expressions' ' For evaluations, we applied the algorithm to the 47 source codes used for manual generations and obtained the better EFP instances with more blanks. Besides, we verified the effectiveness by generating 10 new instances with the algorithm and assigning them to 40 students. In addition, we extended its application to three source codes for games and verified the effectiveness by assigning them to 20 students, to further validate the applicability of the algorithm in EFP instance generations. We also evaluated the relationships between the number of blanks, the number of lines in source codes, the submission times and answer rates of students to further assess the adaptability of the algorithm. These results allow us to measure the algorithm's versatility in generating a wide range of EFP instances and contributes to comprehensive understanding of instance difficulties and learning outcomes. [ABSTRACT FROM AUTHOR]

In schools, children are taught algorithm for extracting the square and cube roots of a number. However, they are not informed that Aryabhata (b. 476 CE) was the first Indian mathematician to present a systematic algorithm for the extraction of the square and cube root of a number. This algorithm has been succinctly presented by Aryabhata in two successive verses in the Ganitapada of his Aryabhatiyam composed in 499 CE. A careful study of the algorithm given by Aryabhata shows that it can be easily extended to find higher order roots. It also clearly reveals that the decimal place value system should have been in vogue in India for quite a long time before him, because this algorithm is heavily based on a thorough understanding of the decimal place value system. In our paper, we will discuss some of these aspects as well as outline how his algorithm can be extended to find the higher order roots. [ABSTRACT FROM AUTHOR]

This paper introduces methods for parallelizing the algorithm to enhance the efficiency of event recovery in Spin Physics Detector (SPD) experiments at the Nuclotron-based Ion Collider Facility (NICA). The problem of eliminating false tracks during the particle trajectory detection process remains a crucial challenge in overcoming performance bottlenecks in processing collider data generated in high volumes and at a fast pace. In this paper, we propose and show fast parallel false track elimination methods based on the introduced criterion of a clustering-based thresholding approach with a chi-squared quality-of-fit metric. The proposed strategy achieves a good trade-off between the effectiveness of track reconstruction and the pace of execution on today's advanced multicore computers. To facilitate this, a quality benchmark for reconstruction is established, using the root mean square (rms) error of spiral and polynomial fitting for the datasets identified as the subsequent track candidate by the neural network. Choosing the right benchmark enables us to maintain the recall and precision indicators of the neural network track recognition performance at a level that is satisfactory to physicists, even though these metrics will inevitably decline as the data noise increases. Moreover, it has been possible to improve the processing speed of the complete program pipeline by 6 times through parallelization of the algorithm, achieving a rate of 2000 events per second, even when handling extremely noisy input data. [ABSTRACT FROM AUTHOR]

Given several number sequences, determining the longest common subsequence is a classical problem in computer science. This problem has applications in bioinformatics, especially determining transposable genes. Nevertheless, related works only consider how to find one longest common subsequence. In this paper, we consider how to determine the uniqueness of the longest common subsequence. If there are multiple longest common subsequences, we also determine which number appears in all/some/none of the longest common subsequences. We focus on four scenarios: (1) linear sequences without duplicated numbers; (2) circular sequences without duplicated numbers; (3) linear sequences with duplicated numbers; (4) circular sequences with duplicated numbers. We develop corresponding algorithms and apply them to gene sequencing data. [ABSTRACT FROM AUTHOR]

• A computing method for constellation-to-ground coverage is investigated. • The maximum and minimum coverage regions are calculated. • Simulation results demonstrate the validity and effectiveness of the proposed algorithm. The issue of constellation-to-ground coverage is a research focus in Earth observation applications. Traditional calculations often rely on grid point methods or their derivatives, but these can be limited in their application, relatively costly, inefficient, and often do not account for potential errors. This paper proposes a novel, efficient method based on latitude strip division for calculating the ground area coverage of satellite constellations, capable of providing the upper and lower bounds of coverage ratio for any ground area. Initially, the ground target area is divided into several latitude strips, and the target area range is utilized to determine the longitude range of each latitude strip. Subsequently, the upper and lower bounds of coverage of each strip are calculated according to the satellite ground coverage range. On this basis, the coverage boundary function is defined and the coverage ratio is derived through comprehensive statistics analysis. Finally, depending on the accuracy of the latitude strip division, the precise coverage area and coverage ratio with upper and lower bounds are determined for instantaneous, continuous, and cumulative coverage problems. Numerical simulation experiments were carried out and compared with the traditional grid point method to validate the effectiveness and computational efficiency of this algorithm in addressing the coverage issue for arbitrarily shaped ground areas. When compared to the longitude strip method, it was confirmed that for ground areas where the longitude exceeds the latitude range, this approach offers superior computational efficiency than the latitude strip method. [ABSTRACT FROM AUTHOR]

This paper presents an original contribution regarding the improvement of the automatic EOL (End of Line) parallel testing process of electronic control units (ECU) in the automotive industry, by implementing an interwoven parallel testing algorithm to increase the testing quality. The new interwoven parallel test algorithm groups the tests into parallel test groups through which the defect of the pins in the connector is detected and at the same time allows the tests to be performed through the parallel test algorithm of all inputs and outputs. It combines the advantages of reduced test time with the detection of defects on the pins. The last part of the paper highlights the results obtained through the modeling of the interwoven testing algorithm and presents our conclusions that emerge from this case study. [ABSTRACT FROM AUTHOR]

Abstract: For positive integers , an -labeling of a digraph D is a function f from into the set of nonnegative integers such that if x is adjacent to y in D and if x is of distance two to y in D. Elements of the image of f are called labels. The -labeling problem is to determine the -number of a digraph D, which is the minimum of the maximum label used in an -labeling of D. This paper studies -numbers of digraphs. In particular, we determine -numbers of digraphs whose longest dipath is of length at most 2, and -numbers of ditrees having dipaths of length 4. We also give bounds for -numbers of bipartite digraphs whose longest dipath is of length 3. Finally, we present a linear-time algorithm for determining -numbers of ditrees whose longest dipath is of length 3. [Copyright &y& Elsevier]

The Industrial, Scientific, and Medical (ISM) frequency spectrum is used by the Wireless Local Area Network (WLAN) for its operation. Due to a limited number of available channels for WLAN operation, frequency channel assignment becomes very difficult. In WLAN, the access points (APs) are widely deployed, and because they share the same frequency, they start interfering with each other and causing more energy consumption. So WLAN frequency channels should be managed and assigned carefully to increase the energy efficiency of the wireless network. This paper proposes an energy-efficient channel assignment algorithm (EECAA) to improve the performance of the network. The suggested approach improves the network's energy efficiency in terms of global delay, packet data loss, and the count of data retransmissions. The extensive simulation study demonstrates that, when compared to the channel handoff scheme and D2MD channel allocation algorithm for various traffic and network conditions, the proposed EECAA method greatly increases network throughput. [ABSTRACT FROM AUTHOR]

There is a growing interest in the field of social sciences in the study of topics related to the so-called gig economy or platform economy and, among them, in the figure of the rider-a term that refers to the home delivery workers employed through digital platforms. In these platforms, the work of the riders is organized from algorithmic management logics, a mediation in which the panoptic quality of their forms of control and governmentality has tended to be emphasized. In contrast to these frameworks, this paper presents a theoretical-methodological approach that emphasizes the co-constitution-in an open agency- of the rider and the application, to ethnographically approach the everyday labor practices of riders. In the interest of exploring how algorithmic mediation functions in the diversity of riders' experiences, we analyze the coordination tasks responsible for producing the shared space-time geography and the flexible control strategies that mediate the application. The text describes how the algorithm generates a kind of scaffolding that defines directive spatiotemporalities in the riders' operations, within which the deliverers extend the landscape of calculability to those elements that the algorithm cannot consider and to those others that the rider must incorporate in order to make his activity compatible with the algorithmic logic. This article presents the initial results of an ethnography carried out in Madrid since September 2021 with riders from several of the main digital home delivery platforms: Glovo, Uber Eats, and Getir . Along with the fieldwork with riders, we interviewed four technologists in urban logistics. The results show that salaried riders have a less intense experience of the directive chronography of the algorithm, showing how autonomy is not necessarily equivalent to the riders' capability to choose. [ABSTRACT FROM AUTHOR]

Introduction. SMA is a life-threatening autosomal recessive, neuromuscular disorder that affects the nerve cells controlling the muscles. SMA is caused by mutations in the SMN1 gene and results in neuronal degeneration and muscular atrophy Early detection of SMA through newborn screening (NBS) is essential for preventing irreversible damage by selecting appropriate treatment and ensuring adequate follow-up. Aim: to implement genetic screening for spinal muscular atrophy (SMA) as a tool in the early diagnosis of spinal amyotrophy. Materials and methods. In the Human Molecular Genetics Laboratory at the Mother and Child Institute (IM&C), an algorithm has been implemented for genetic screening of SMA-associated mutations. This includes the collection of blood samples on filter paper cards from newborns and their analysis using molecular genetic methods such as real-time PCR and MLPA. Results. In order to implement the proposed algorithm, the necessary molecular genetic methods were employed, including real-time PCR method, for which specific probes and matrices were designed. The analysis set was validated using 10 samples with SMN1 exon 7 deletion and 10 samples without SMN1 exon 7 deletion. Furthermore, the MLPA method was implemented with the aim of confirming and assessing the copy number of SMN1/ SMN2 genes. After obtaining approval for the research design and protocol for this initiative, informed consent and acceptance forms were developed to confirm the participants' willingness to participate in the study, which were approved by the Research Ethics Committee of the USMF "N. Testemițanu". The minimum number of study participants was calculated using the EpiInfo 7.2.2.6 program, specifically the "StatCalc-Sample Size and Power" module, with a minimum sample size calculated to be 172 participants. Subsequently, 250 blood spot samples were collected from newborns, with 75 samples already undergoing genetic screening. Following the analysis of the results, no sample was declared to have a suspected SMA status. Conclusions. The implemented algorithm for newborn screening for SMA detects newborns affected by SMA caused by a homozygous deletion of SMN1 exon 7. SMA due to compound heterozygous mutations (approximately 5% of SMA individuals) is not detected by this test. Newborn screening can identify patients affected by SMA before the onset of symptoms and provides an opportunity for early therapeutic intervention. The implementation of genetic screening for SMA within Institute of Mother and Child offers the chance to assess its feasibility as an early diagnostic tool for SMA and its benefits for the healthcare system of the Republic of Moldova. [ABSTRACT FROM AUTHOR]

Objective: To characterize and validate the landscape of algorithms that use International Classification of Disease (ICD) codes to identify low‐acuity emergency department (ED) visits. Data Sources: Publicly available ED data from the National Hospital Ambulatory Medical Care Survey (NHAMCS). Study Design: We systematically searched for studies that specify algorithms consisting of ICD codes that identify preventable or low‐acuity ED visits. We classified ED visits in NHAMCS according to these algorithms and compared agreements using the Jaccard index. We then evaluated the performance of each algorithm using positive predictive value (PPV) and sensitivity, with the reference group specified using low‐acuity composite (LAC) criteria consisting of both triage and clinical components. In sensitivity analyses, we repeated our primary analysis using only triage or only clinical criteria for reference. Data Collection: We used the 2011–2017 NHAMCS data, totaling 163,576 observations before survey weighting and after dropping observations missing a primary diagnosis. We translated ICD‐9 codes (years 2011–2015) to ICD‐10 using a standard crosswalk. Principal Findings: We identified 15 papers with an original list of ICD codes used to identify preventable or low‐acuity ED presentations. These papers were published between 1992 and 2020, cited an average of 310 (SD 360) times, and included 968 (SD 1175) codes. Pairwise Jaccard similarity indices (0 = no overlap, 1 = perfect congruence) ranged from 0.01 to 0.82, with mean 0.20 (SD 0.13). When validated against the LAC reference group, the algorithms had an average PPV of 0.308 (95% CI [0.253, 0.364]) and sensitivity of 0.183 (95% CI [0.111, 0.256]). Overall, 2.1% of visits identified as low acuity by the algorithms died prehospital or in the ED, or needed surgery, critical care, or cardiac catheterization. Conclusions: Existing algorithms that identify low‐acuity ED visits lack congruence and are imperfect predictors of visit acuity. [ABSTRACT FROM AUTHOR]

The eruption of disruptive digital platforms is reshaping geographies of housing under the gaze of corporations and through the webs of algorithms. Engaging with interdisciplinary scholarship on informal housing across the Global North and South, we propose the term 'digital informalisation' to examine how digital platforms are engendering new and opaque ways of governing housing, presenting a theoretical and political blind spot. Focusing on rental housing, our paper unpacks the ways in which new forms of digital management of risk control access and filter populations. In contrast to progressive imaginaries of 'smart' technological mediation, practices of algorithmic redlining, biased tenant profiling and the management of risk in private tenancies and in housing welfare both introduce and extend discriminatory and exclusionary housing practices. The paper aims to contribute to research on informal housing in the Global North by examining digital mediation and its governance as key overlooked components of housing geographies beyond North and South dichotomies. [ABSTRACT FROM AUTHOR]

A good stacking method can increase the packaging utility rate and reduce production costs. Much research has focused on 2D arrangements for rectangular, circular, or irregular shapes and regularly shaped 3D objects such as rectangular boxes. Genetic algorithms, simulated annealing, and other heuristic algorithms have been proposed. Recent research on the stacking of irregular-shaped 3D stone pieces has focused on balancing one stone piece on top of others to form one or more vertical towers, given the geometry of the stone pieces and the number of stone pieces available for the task. Stacking irregular-shaped 3D objects in a package is common in industry. However, there has been relatively little emphasis on the development of algorithms for stacking irregular-shaped 3D objects in a fixed-size container without prior knowledge of the stone geometries and the number of pieces available, with the goal of packing as many stone pieces as possible while maintaining stability. In this paper, three heuristic algorithms are proposed to solve the problem of nesting irregularly shaped stone pieces in layers within a container. All three algorithms use the following approach: (1) approximate the alignment of irregular shapes to a cluster of straight lines; (2) arrange stones one by one at the approximated angles using a step-by-step process; (3) for stability, consider the weight of the stone pieces based on pixel calculations. An automated real-time stacking system—including sensors, pneumatic suction cups, webcams, conveyor, robot, and programmable logic controller—was developed to evaluate the proposed algorithms using space utilization, stability, and cycle time as measures of performance. The developed algorithms and an existing stacking algorithm (bottom left most, or BLM) were tested using 25 sequences of 30 randomly ordered stone pieces. Results suggest that the developed algorithms effectively solve the stone piece packing problem. All three were significantly better than the BLM algorithm in terms of space utilization and stability, and there was no difference in cycle time. Algorithm 3 was better than Algorithms 1 and 2. [ABSTRACT FROM AUTHOR]

In real-life scenarios, both the vertex weight and edge weight in a network are hard to define exactly. We can incorporate the fuzziness into a network to handle this type of uncertain situation. Here, we use triangular fuzzy number to describe the vertex weight and edge weight of a fuzzy network G. In this paper, we consider weighted k-domination problem in fuzzy network. The weighted k-domination (WKD) problem is to find a k dominating set D which minimizes the cost f (D) : = ∑u∈Dw (u) + ∑v∈V\D min {∑u∈Sw (uv) |S ⊆ N (v) ∩ D, |S| = k}. First, we put forward an integer linear programming model with a polynomial number of constrains for the WKD problem. If G is a cycle, we design a dynamic algorithm to determine its exact weighted 2-domination number. If G is a tree, we give a label algorithm to determine its exact weighted 2-domination number. Combining a primal-dual method and a greedy method, we put forward an approximation algorithm for general fuzzy network on the WKD problem. Finally, we describe an application of the WKD problem to police camp problem. [ABSTRACT FROM AUTHOR]

In this paper three algorithms of motion planning for two-input, one-chained nonholonomic systems are presented. The classical Murray-Sastry algorithm is compared with two original algorithms aimed at optimizing energy of controls. Based on the generalized CampbellBaker-Hausdorff-Dynkin formula applied to the systems, some observations are made concerning the optimal relationship between amplitudes and phases of harmonic controls. The observations help to optimize a selection of controls and to design new algorithms for planning a suboptimal trajectory between given boundary configurations. It was also shown that for those particular systems the generalized C-B-H-D formula is valid not only locally (as in a typical case) but also globally. Simulations performed on the five-dimensional chain system facilitate distinguishing the proposed algorithms from the Murray-Sastry algorithm and to illustrate their features. Systems in a chained form are important from a practical point of view as they are canonical for a class of systems transformable into this form. The most prominent among them are mobile robots with or without trailers. [ABSTRACT FROM AUTHOR]

This paper argues that the social power of algorithms comes to the fore through the narratives they generate about individuals. Proposing the notion of 'algorithmic emplotment', the article showcases the ways in which algorithms construct and tell narratives about us, participating in shaping people's encounters with the world and their perceptions of it. The concept denotes the processes through which data, people, experiences, and complex temporalities are ordered, woven together, and presented as coherent, frictionless narratives in the present. Through an analysis of the smartphone feature called Apple Memories, the paper seeks to highlight the narratives algorithms tell, how they are constructed, and the potential impacts they may have on everyday life. The concept of algorithmic emplotment is used to scrutinise the ways in which people's lives are rendered sequential, ordered, and ultimately meaningful and actionable by algorithmic processes. [ABSTRACT FROM AUTHOR]

The generation of mathematical models for the analysis of buildings with multiple thermal zones is a large and complex task. Furthermore, the order and complexity of the dynamical model are increased by the number of included thermal zones. To overcome this problem, this paper presents an algorithm to define the mathematical model automatically, using the geometric and physics parameters as inputs. Additionally, the spatial position of each thermal zone must be recorded in an arrangement called a contact matrix. The algorithm for modeling systems with multiple thermal zones is the main contribution of this work. This algorithm is presented in pseudocode format and as an annex, an implementation in MATLAB software. One of the advantages of this methodology is that it allows us to work with parallelepipeds and not necessarily cubic thermal zones. The algorithm allows us to generate mathematical models with symbolic variables, starting from the knowledge of how many thermal zones compose the system and its geometric organization. This information must be organized in a matrix arrangement called a contact matrix. Different arrays of thermal zones were constructed with wooden boxes to verify the functionality of the models generated with the algorithm. Each case provided information that allowed us to adjust the mathematical models and their simulations, obtaining a range of errors between experimental and simulated temperatures from 2.08 to 5.6 , depending on the number of thermal zones studied. [ABSTRACT FROM AUTHOR]

An interconnection network can be modelled as a connected graph G. The reliability of interconnection networks is critical for multiprocessor systems. Several conditional edge-connectivities have been introduced in the past for accurately reflecting various realistic network situations, with the h -extra edge-connectivity being one such conditional edge-connectivity. The h -extra edge-connectivity of G , denoted by λ h (G) , is the minimum cardinality of faulty edges whose deletion disconnects the graph G with each resulting component containing at least h processors. In general, for a connected graph G , determining whether the graph exists an h -extra edge-cut is N P -hard. The folded-crossed hypercube F C Q n is a variation of the crossed hypercube C Q n with N = 2 n processors. In this paper, after excavating the layer structure of folded-crossed hypercube, we investigate some recursive properties of λ h (F C Q n) , based on some recursive properties, an effective O (log (N)) algorithm of h -extra edge-connectivity of folded-crossed hypercube is designed, which can determine the exact value and the λ h -optimality of λ h (F C Q n) for each positive integer 1 ≤ h ≤ 2 n − 1 . Our results solve this problem thoroughly. [ABSTRACT FROM AUTHOR]

Immediate implant-based breast reconstruction in patients with large and ptotic breasts may be challenging due to skin redundancy. The use of a reduction mammoplasty pattern for the mastectomy skin excision has proven to be a reliable option for these patients as it allows for a better shape, projection, and symmetrization. This approach has been described in the literature for both one- and two-stage reconstruction with either sub- or pre-pectoral reconstruction with an acellular dermal matrix (ADM) or non-biological mesh. One-stage immediate breast reconstructions have a positive significant impact on patients' psychosocial well-being and quality of life. The purpose of this paper is to describe an institutional algorithm that allows one to perform one-stage implant-based breast reconstructions in patients with large and ptotic breasts. [ABSTRACT FROM AUTHOR]

Machine vision is a computer vision system that enables a computer to work on image-based inspection and analysis for different applications. In this computer vision, a camera and sensor were used to view an image for its analysis with the help of some sort of algorithms, then processed to infer the image-based data. Machine vision systems along with Python programs can be used for many interdisciplinary applications like weld inspection, online monitoring in manufacturing auto components etc. In this study, the "Edge detection python algorithm" was developed and run through "Google Colab" notebook to inspect the edges and the boundaries of samples like faying surface-modified friction welded dissimilar joints and a binder clip (paper clamp) to check any defects or cracks and straightness etc. With the help of this Python algorithm, the edge detection was done by Sobel, Scharr, and Prewit operators. An input image of the weld joint and the binder clip were converted into Otsu's binary threshold image. The matrix vision camera and the CMOS sensor were used in the machine vision set-up to take the images. This written algorithm is helpful to trace the edges of any kind of solids components. The edges of the binder clips and the weld joint/zone were detected. The binder clips were inspected under two different cases namely the clip in folding condition (Case I) and the binder clip in unfolding condition (Case II). The results showed a defect that was identified in the weld zone and no bending was in the binder clips. This kind of study is useful in manufacturing industries for quality inspection purposes with a new machine vision set up for online inspection of fabricated components like nuts and bolts etc. [ABSTRACT FROM AUTHOR]

• A network flow model of the VLSI processor array is constructed under row and column rerouting. • A new strategy for selecting the bottleneck row in the logic array using the minimum cutting technique is proposed. • The proposed schemes significantly reduce the interconnect redundancy of the logical subarray. The reconfiguration algorithms have been extensively investigated to ensure the reliability and stability for the processor arrays with faults. It is important to reduce the power consumption, capacitance and communication costs in the processors by reducing the interconnection length of the VLSI array. This paper discusses the reconfiguration problem of the high-performance VLSI processor array under the row and column rerouting constraints. A novel method, making use the idea of network flow, is proposed in this paper. Firstly, a network flow model of the VLSI processor array is constructed, such that the high-performance VLSI target array can be obtained by utilizing the minimal cost flow algorithm. Secondly, we propose a new strategy for bottleneck row selection in the logical array using the minimum cut technique, which can find a more suitable bottleneck row. Finally, we conducted reliable experiments to clearly reveal the efficiency of the new rerouting scheme and algorithm in reducing the number of long interconnects. The experimental results show that, for a host array with size of 256×256, the number of long interconnects in the subarray can be reduced by up to 79.22% and 55.88% without performance penalty for random faults with density of 1% and 25% respectively, when compared with state-of-the-art. In addition, the proposed scheme improves existing algorithm in terms of subarray size. On a 256×256 host array with 25% faulty density, the average improvement in subarray size is up to 3.77% compared with state-of-the-art. [ABSTRACT FROM AUTHOR]

Background: The idea of computational thinking is underpinned by the belief that anyone can learn and use the underlying concepts of computer science to solve everyday problems. However, most studies on the topic have investigated the development of computational thinking through programming activities, which are cognitively demanding. There is a dearth of evidence on how computational thinking augments everyday problem solving when it is decontextualized from programming. Objectives: In this study, we examined how computational thinking, when untangled from the haze of programming, is demonstrated in everyday problem solving, and investigated the features of such solvable problems. Methods: Using a multiple case study approach, we tracked how seven university students used computational thinking to solve the everyday problem of a route planning task as part of an 8‐week‐long Python programming course. Results and Conclusions: Computational thinking practices are latent in everyday problems, and intentionally structuring everyday problems is valuable for discovering the applicability of computational thinking. Decomposition and abstraction are prominent computational thinking components used to simplify everyday problem solving. Implications: It is important to strike a balance between the correctness of algorithms and simplification of the process of everyday problem solving. Lay Description: What is already known about this topic: Computational thinking is a problem solving skill.Computational thinking is different from programming.There is dearth of evidence on how computational thinking augments everyday problem solving. What this paper adds: Computational thinking practices are latent in everyday problem solving.Intentional restructuring of problems is required to uncover how computational thinking applies in solving them. Implications for practices: Decomposition and abstraction are critical in solving everyday problems.Computational thinking should be taught explicitly through everyday problems.Finding balance between the correctness of algorithm and simplification of the problem solving process is important. [ABSTRACT FROM AUTHOR]

Some efficient top-k algorithms, i.e., Fagin's Algorithm, threshold algorithm (TA), and best position algorithm (BPA), can be used to answer k nearest neighbor (kNN) queries. However, extending the existing algorithms without further changes to the algorithms themselves would not be efficient since there are the different characteristics between the kNN queries and top-k queries. For example, the kNN queries are more distance-sensitive rather than the position of data points. Second, it is necessary to add some novel parallel heuristics and pruning policies for the kNN queries. Third, there are still many redundant random accesses among FA, TA, and BPA. In this paper, we address aforementioned these problems and take these algorithms to answer parallel kNN (PkNN) queries in spatial databases. We integrate the advantages of the B + -tree and Open MP programming and propose three efficient parallel kNN query algorithms, namely distance priority-based PkNN, optimized PkNN, and partition-based PkNN. Our performance evaluation shows that our proposed algorithms achieve significant improvement in comparison with existing algorithms, i.e., BPA and BPA2. In addition, our approaches are also capable of returning kNN results incrementally which greatly shorten the query response time and enhance user experience. [ABSTRACT FROM AUTHOR]

This paper is devoted to the study of the analytic properties of Mahler systems at 0. We give an effective characterisation of Mahler systems that are regular singular at 0, that is, systems which are equivalent to constant ones. Similar characterisations already exist for differential and (q-)difference systems but they do not apply in the Mahler case. This work fills in the gap by giving an algorithm which decides whether or not a Mahler system is regular singular at 0. In particular, it gives an effective characterisation of Mahler systems to which an analog of Schlesinger's density theorem applies. [ABSTRACT FROM AUTHOR]

Many datasets including social media data and bibliographic data can be modeled as graphs. Clustering such graphs is able to provide useful insights into the structure of the data. To improve the quality of clustering, node attributes can be taken into account, resulting in attributed graphs. Existing attributed graph clustering methods generally consider attribute similarity and structural similarity separately. In this paper, we represent attributed graphs as star-schema heterogeneous graphs, where attributes are modeled as different types of graph nodes. This enables the use of personalized pagerank (PPR) as a unified distance measure that captures both structural and attribute similarities. We employ DBSCAN for clustering, and we update edge weights iteratively to balance the importance of different attributes. The rapidly growing volume of data nowadays challenges traditional clustering algorithms, and thus, a distributed method is required. Hence, we adopt a popular distributed graph computing system Blogel, based on which, we develop four exact and approximate approaches that enable efficient PPR score computation when edge weights are updated. To improve the effectiveness of the clustering, we propose a simple yet effective edge weight update strategy based on entropy. In addition, we present a game theory based method that enables trading efficiency for result quality. Extensive experiments on real-life datasets offer insights into the effectiveness and efficiency of our proposals. [ABSTRACT FROM AUTHOR]

Facial nerve paralysis is a debilitating condition with multiple etiologies, with aesthetic, functional, psychological and social impact. Given the complex multitude of causes that may generate such condition, a therapeutic algorithm is mandatory when attempting reconstruction. Severity, timing, patient adherence to a rehabilitation program, status of ipsilateral and contralateral facial nerves and particularities of each patient are all criteria which should be accounted when choosing a treatment option. After initial assessment, a variable treatment panel is available based on condition type include medicamentous therapy, rehabilitation program, dynamic and static procedures surgical procedures, having as primary aim functional restoration achieving aesthetic balanced facial features. This paper summarizes current knowledge in facial paralysis reconstruction and presents an algorithmic approach that eases decision making and therapeutic strategy. [ABSTRACT FROM AUTHOR]

The algorithm not only amplifies every detail of human society but also has the same function as the famous nudge technique, i.e. choice architecture, which pushes people toward a certain direction while assuming it’s made by their own will. By this nudge-like function of the algorithm, I want to reevaluate the long-controversial issue of the concept of nudge: is this nudge technique harmless? And if it isn’t, can we still use this nudge technique even with good intention? I’ll start by introducing the concepts of nudge and sludge then talk about their main issues. Third, I’ll use three algorithmic examples to demonstrate the consequences of this nudge technique. Fourth, I will address the nature of the nudge technique and the meaning of intention in nudge. Fifth, I’ll push the discussion further for an important philosophical issue: the white lie. Finally, I’ll summarize my argument and conclude this paper. [ABSTRACT FROM AUTHOR]

Abstract: Accurate identification of cotton top bud is important for cotton topping operation to detect cotton terminal bud accurately in field, a recognition method using Faster R-CNN (Faster Region Convolutional Neural Networks, Faster R-CNN) by integrating dynamic mechanism was proposed to solve the recognition difficulties caused by the small size of cotton terminal bud when it is topped in densely planted fields. The RegNetX-6.4GF model was used as the backbone network to improve its image feature extractor capabilities. Due to number of proposals under a higher IOU(Intersection Over Union, IOU) as well as the matching degree between anchor and the target shape affect the performance of the detector, the method proposed in this paper changed the original anchor generation mechanism by combining FPN (Feature Pyramid Network, FPN) and Guided Anchoring in RPN (Region Proposal Network, RPN), which will cause the distribution of the proposals generated by the RPN of the algorithm under different IOUs dynamically change during the training process. To adapt the dynamic change of proposals distribution, we integrated Dynamic Region Convolutional Neural Networks ( Dynamic R-CNN) in Faster R-CNN, which can dynamically adjust the value of IOU to obtain high quality proposals. And the GROIE (Generic ROI Extractor, GROIE) mechanism was inducted to extract ROI (Region of Interest, ROI) to improve the feature fusion capability. In this paper, 4 819 images of gossypium hirsutum population which contain seven leaf types were taken from the top of cotton plant at distance of 30-50 cm (medium distance) and 50-100 cm (long distance) under uniform light, oblique strong light, direct strong light, and shadows. Those images were processed as MS COCO 2017 format dataset and assigned to the training set, validation set, and test set, which contained 2 815, 704, and 1 300 pictures respectively. The experimental results demonstrated that FPS (Frames Per Second, FPS) of proposed model was up to 10.3 frames/s and the Mean Average Precision (MAP) of bud identification reached to 98.1% which was 3.2 percentage points higher than original Faster R-CNN model. The validation set were used to compare performance of mainstream recognition algorithm and proposed method. Results showed that the improved Faster R-CNN's MAP was 7.3% higher than original Faster R-CNN, which was also higher than RetinaNet, Cascade R-CNN (Cascade Region Convolutional Neural Networks, Cascade R-CNN) and RepPoints by 78.9%, 10.1% and 8.3% when IOU was set to 0.5. The improved Faster R-CNN proposed in this paper meets the accuracy and real-time requirements of cotton topping operation. [ABSTRACT FROM AUTHOR]

Today, the transmission of hypersensitive data through public communication, poses a real problem for an unauthorized recipient which makes information security very important. The basic idea behind the proposed research work is to exploit the robustness of the genetic material in order to improve and outperform the performance of other conventional algorithm. In this paper, Huffman coding method has been adopted to develop a new and efficient symmetric DNA encryption algorithm. Firstly, the algorithm codifies the secondary DNA key which is extracted from the main DNA key according to Huffman coding. Then an XOR is applied between the coded DNA sequence and the plain-image. And in order to strengthen our algorithm, we have performed diffusion with a permutation box. [ABSTRACT FROM AUTHOR]

In this paper, we study the link between finite-dimensional Zinbiel algebras and combinatorial structures or (pseudo)digraphs determining which configurations are associated with those algebras. Some properties of Zinbiel algebras that can be read from their associated combinatorial structures are studied. We also analyze the isomorphism classes for each configuration associated with these algebras providing a new method to classify them and we compare our results with the current classifications of 2- and 3-dimensional Zinbiel algebras. We also obtain the 3-vertices combinatorial structures associated with such algebras. In order to complement the theoretical study, we have designed and performed the implementation of an algorithm which constructs and draws the (pseudo)digraph associated with a given Zinbiel algebra and, conversely, another procedure to test if a given combinatorial structure is associated with some Zinbiel algebra. [ABSTRACT FROM AUTHOR]

Algorithms make highly consequential decisions and, thereby, exercise considerable power. In this study, I investigate how social power through algorithms is exercised in media consumption, particularly through curation algorithms. This conceptual paper then contributes to the understanding of social power through algorithms by suggesting the concept of algorithmic meta-capital. The concept derives from Bourdieu's theory on meta-capital which has also been applied to legacy media. I then argue that this algorithmic meta-capital is an extension of the power traditionally held by the state and legacy media. The study also contributes to the understanding of meta-capital as it proposes how the meta-capital possessed by digital intermediaries functions. It does so by legitimating representations of the world and by creating a necessity for algorithmic visibility across different fields, thereby shaping habitus. This Bourdieusian approach enables researchers to take a balanced view on the power of algorithms on the structure/agency continuum. [ABSTRACT FROM AUTHOR]

In this paper, we define a generalized resolvent operator involving a 풢 ⁢ (⋅ , ⋅) -co-monotone mapping for solving a generalized variational inclusion problem. We show that the resolvent operator under consideration is single-valued as well as Lipschitz continuous. An iterative algorithm is constructed to obtain the approximate solution of our problem. An example is provided to illustrate the theoretical findings. [ABSTRACT FROM AUTHOR]

This paper presents the implementation of two digital noise-cancellation circuits (DNCCs) using a proposed algorithm and a Karnaugh map for a 2 + 1 multistage noise-shaping (MASH) delta-sigma modulator (DSM). The MASH architecture inherits a superior signal-to-noise-and-distortion ratio (SNDR) with the aid of an efficient noise-cancellation technique either in the analogue or digital domain. The key motivation of this study was to design an area-efficient DNCC. The first approach employed a proposed algorithm (Algorithm-based DNCC) to implement the DNCC and to construct a delay block with an inverter and transmission gate. The second approach involved a Karnaugh map (K-map DNCC) and a delay block with a pair of D flip-flops. A maximum simulated signal-to-noise ratio of 135 dB was completed with optimal analogue scaling coefficients for the proposed 2 + 1 MASH DSM with DNCC. The simulated SNDRs of the Algorithm-based DNCC and K-map DNCC were 91.04 dB and 91.16 dB, respectively. Measured results show that the SNDR of the Algorithm-based DNCC, the SNDR of the K-map DNCC, power consumption and core area are approximately 58.7 dB, 62.1 dB, 0.26 μ W and 2275 μ m2, respectively, for the designed DNCCs with an operating frequency of 10.24 MHz and supply voltage of 1.8 V. The transistor counts of the Algorithm-based DNCC are 74 transistors, while they are 106 transistors for the K-map DNCC. The proposed Algorithm-based DNCC saves 32 transistors and approximately reduces its chip area to 69.8% of the K-map DNCC. [ABSTRACT FROM AUTHOR]

To enable organizations to achieve carbon neutrality through agile capabilities, this paper establishes an integrative framework of carbon-zero agility consisting of three dimensions: search scope agility, search locus agility, and search pace agility. However, applying common agile methodologies like Scrum, Kanban, and Lean to cultivate these capabilities inevitably introduces feedback ambiguity, which can paralyze decision-making and increase errors due to inherent human cognitive limitations. To address this, tailored carbon-zero feedback algorithms are proposed to complement human judgment in agile workflows. Specifically, prescriptive analytics, federated learning, and probabilistic programming are injected into Scrum, Kanban, and Lean respectively to restore clarity amidst ambiguity. The framework is grounded in cases from the textile industry to demonstrate applicability in practical settings. By targeting the roots of distortions with human-algorithm collaborations, it provides an actionable roadmap to implement carbon-zero agility. • Establishes carbon-zero agility framework: search scope, locus, and pace agility. • Identifies behavioral challenges, and feedback ambiguity in agile for carbon-zero. • Proposes tailored carbon-zero feedback algorithms to enhance agility. • Connects agile processes with broader organizational sustainability capabilities. [ABSTRACT FROM AUTHOR]

A hole in a graph is a chordless cycle of length at least 4. A theta is a graph formed by three internally vertex-disjoint paths of length at least 2 between the same pair of distinct vertices. A wheel is a graph formed by a hole and a node that has at least 3 neighbors in the hole. In this series of papers we study the class of graphs that do not contain as an induced subgraph a theta nor a wheel. In Part II of the series we prove a decomposition theorem for this class, that uses clique cutsets and 2-joins. In this paper we use this decomposition theorem to solve several problems related to finding induced paths and cycles in our class. [ABSTRACT FROM AUTHOR]

Let graph G(p,q) be a simple graph, if there is a positive integer k(1 ≤ k≤ |E|) and the mapping f: E(G) → {1, 2, . . ., k}, such that for any edge 𝐮 v ∈ E(G), when d(u) = d(v), S(u) = S(v), where S(v) = E𝒖v∈E(G) f(𝒖 v) . d(u) represents the degree of point u, then f is the coloring of Adjacent Vertex Sum Reducible Edge of G. The maximum value k is called the Adjacent Vertex Sum Reducible Edge chromatic number of graph G, denoted as XA𝒖𝒗sr ' (G). Based on the existing graph coloring concepts and reducible concepts, this paper proposes a new concept of adjacent vertex sum reducible edge coloring combined with practical problems and designs a new type of adjacent vertex sum reducible edge coloring algorithm. [ABSTRACT FROM AUTHOR]

In this paper a modified network port scanner for Windows based operating systems implementing a linear algorithm is developed. [ABSTRACT FROM AUTHOR]

Let G = (V , E) be a graph. A double Roman dominating function (DRDF) of G is a function f : V → { 0 , 1 , 2 , 3 } such that (i) each vertex v with f (v) = 0 is adjacent to either a vertex u with f (u) = 3 or two vertices u 1 and u 2 with f (u 1) = f (u 2) = 2 , and (ii) each vertex v with f (v) = 1 is adjacent to a vertex u with f (u) > 1. The double Roman domination number of G is the minimum weight of a DRDF along all DRDFs on G , where the weight of a DRDF f on G is f (V) = ∑ v ∈ V f (v). In this paper, we first propose an algorithm to compute the double Roman domination number of an interval graph G = (V , E) in O (| V | + | E |) time, answering a problem posed in Banerjee et al. (2020) [2]. Next, we show that the decision problem associated with the double Roman domination is NP-complete for split graphs. Finally, we show that the computational complexities of the Roman domination problem and the double Roman domination problem are different. [ABSTRACT FROM AUTHOR]

Aiming at the limitations of the algorithm of interval grey number, an improved algorithm is introduced in this paper. Firstly, the limitations of the algorithm of interval grey number are analyzed, such as irreversibility, virtual amplification, and non-closure. Then, according to the "using minimum information principle" and the algorithm of a real number and its internal requirements. an improved algorithm of interval grey number is given, and some properties of the improved algorithm of interval grey number are discussed. Finally, some examples are given to verify the effectiveness of the new algorithm. The results show that the improved algorithm of interval grey number overcomes the limitations Of tile existing algorithm, and the calculation examples show that the improved algorithm is feasible and effective. The research results further enrich the grey system theory and provide a theoretical basis for studying grey algebra. [ABSTRACT FROM AUTHOR]

Algorithmic decision-making and other types of artificial intelligence (AI) can be used to predict who will commit crime, who will be a good employee, who will default on a loan, etc. However, algorithmic decision-making can also threaten human rights, such as the right to non-discrimination. The paper evaluates current legal protection in Europe against discriminatory algorithmic decisions. The paper shows that non-discrimination law, in particular through the concept of indirect discrimination, prohibits many types of algorithmic discrimination. Data protection law could also help to defend people against discrimination. Proper enforcement of non-discrimination law and data protection law could help to protect people. However, the paper shows that both legal instruments have severe weaknesses when applied to artificial intelligence. The paper suggests how enforcement of current rules can be improved. The paper also explores whether additional rules are needed. The paper argues for sector-specific – rather than general – rules, and outlines an approach to regulate algorithmic decision-making. [ABSTRACT FROM AUTHOR]

The concept of rainbow connection number of a graph was introduced by Chartrand et al. in 2008. Inspired by this concept, other concepts on colored version of connectivity in graphs were introduced, such as the monochromatic connection number by Caro and Yuster in 2011, the proper connection number by Borozan et al. in 2012, and the conflict-free connection number by Czap et al. in 2018, as well as some other variants of connection numbers later on. Chakraborty et al. proved that to compute the rainbow connection number of a graph is NP-hard. For a long time, it has been tried to fix the computational complexity for the monochromatic connection number, the proper connection number and the conflict-free connection number of a graph. However, it has not been solved yet. Only the complexity results for the strong version, i.e., the strong proper connection number and the strong conflict-free connection number, of these connection numbers were determined to be NP-hard. In this paper, we prove that to compute each of the monochromatic connection number, the proper connection number and the conflict free connection number for a graph is NP-hard. This solves a long standing problem in this field, asked in many talks of workshops and papers. [ABSTRACT FROM AUTHOR]

In this paper we consider the problem of maximizing a non-monotone and non-negative DR-submodular function on a bounded integer lattice [ B → ] = { (x 1 , ... , x n) ∈ Z + n : 0 ≤ x k ≤ B k , ∀ 1 ≤ k ≤ n } without any constraint, where B → = (B 1 , ... , B n) ∈ Z + n. We design an algorithm for the problem and measure its performance by its approximation ratio and the number of value oracle queries it needs, where the latter one is the dominating term in the running time of an algorithm. It has been showed that, for the problem considered, any algorithm achieving an approximation ratio greater than 1 2 requires an exponential number of value oracle queries. In the literature there are two algorithms that reach 1 2 approximation guarantee. The first algorithm needs O (n | | B | | ∞) oracle queries. The second one reduces its number of oracle queries to O (n max ⁡ { 1 , log ⁡ | | B → | | ∞ }) but it needs large storage. In this paper we present a randomized approximation algorithm that has an approximation guarantee of 1 2 , calls O (n max ⁡ { 1 , log ⁡ | | B → | | ∞ }) oracle queries and does not need large storage, improving the results of the literature. [ABSTRACT FROM AUTHOR]

In this paper, we focus on the link between evolution algebras and (pseudo)digraphs. We study some theoretical properties about this association and determine the properties of the (pseudo)digraphs associated with each type of evolution algebras. We also analyze the isomorphism classes for each configuration associated with these algebras providing a new method to classify them, and we compare our results with the current classifications of two‐ and three‐dimensional evolution algebras. In order to complement the theoretical study, we have designed and performed the implementation of an algorithm, which constructs and draws the (pseudo)digraph associated with a given evolution algebra and another procedure to study the solvability of a given evolution algebra. [ABSTRACT FROM AUTHOR]