Search

There is a trend to deploy neural network on edge devices in recent years. While the mainstream of research often concerns with single edge device processing and edge-cloud two-layer neural network collaborative computing, in this paper, we propose partitioning multi-layer edge network for neural network collaborative computing. With the proposed method, sub-models of neural network are deployed on multi-layer edge devices along the communication path from end users to cloud. Firstly, we propose an optimal path selection method to form a neural network collaborative computing path with lowest communication overhead. Secondly, we establish a time-delay optimization mathematical model to evaluate the effects of different partitioning solutions. To find the optimal partition solution, an ordered elitist genetic algorithm (OEGA) is proposed. The experimental results show that, compared with traditional cloud computing, single-device edge computing and edge-cloud collaborative computing, the proposed multi-layer edge network collaborative computing has a smaller runtime delay with limited bandwidth resources, and because of the pipeline computing characteristics, the proposed method has a better response speed when processing large number of requests. Meanwhile, the OEGA algorithm has better performance than conventional methods, and the optimized partitioning method outperforms other methods like random and evenly partition. [ABSTRACT FROM AUTHOR]

The performance growth in processors has been continuing toward increasing the number of processing cores on the chip and scaling the feature size of transistors. However, in the nanoera, side effects of the scaling, such as induced heterogeneities in the performance, power, and soft error rate of identically designed cores, prevent the potential performance from being fully utilized. In this paper, we harness the mentioned side effects in shared-memory multicore processors with unknown workloads by a dynamic heuristic scheduling algorithm called HDSAP. HDSAP aims to maximize performance, i.e., the average response time, under power and reliability constraints in presence of induced heterogeneities. In this regard, we use a mathematical model to quantify task to core assignments based on performance variation. We also consider the variation in power to change selected cores when the power constraint is missed. To meet the reliability constraint, we use N-modular redundancy while being aware of the variation in the soft error rate of cores to prevent under/over reliability estimation. To evaluate HDSAP, we run SPLASH benchmark suite on Sniper and MACPat simulators. As a result, the response time of HDSAP reduces by 6%, 8%, and 25% in comparison with similar algorithms under the same power and reliability constraints. [ABSTRACT FROM AUTHOR]

Numerous studies on project scheduling only consider a single factor, which fails to reflect the actual environment of project operations. In light of this issue, the article synthesizes multiple perspectives and proposes a multi-skill resource-based multi-modal project scheduling problem (MRCMPSP). This problem is described, modeled, and solved using the resource capability matrix and other constraints to minimize the project duration. To effectively solve MRCMPSP and enrich scheduling algorithms, the paper selects the hybrid quantum algorithm (HQPSO) based on the quantum particle swarm algorithm (QPSO). The HQPSO introduces various improvements such as the JAYA optimization search to improve the algorithm's performance. In order to verify the generality, superiority, and effectiveness of the algorithm, independent operation comparison experiments and practical application experiments of the algorithm are designed based on different case sizes and resource quantities. The experimental results demonstrate that the proposed algorithm has superior convergence performance and solution accuracy and can provide an effective scheduling solution for real cases. Additionally, the article provides targeted management suggestions based on the research findings. Overall, this study contributes a novel mathematical model, solution algorithm, optimization strategies, and managerial insights, advancing the field of project management research. [ABSTRACT FROM AUTHOR]

This paper mainly provides a group decision-making (GDM) method based on linguistic interval-valued intuitionistic fuzzy preference relations (LIVIFPRs), where consistency and consensus analysis is conducted. The multiplicative consistency of LIVIFPRs is first introduced, and a consistency-based model is built to ascertain the missing values of an incomplete LIVIFPR. Considering the smallest distance, an optimization model is established to repair the unacceptably multiplicatively consistent LIVIFPR to have acceptable consistency. Meanwhile, the linguistic interval-valued intuitionistic fuzzy priority weights of LIVIFPR are constructed via the optimal solutions of a programming model. Then, Algorithm I for decision-making with one incomplete LIVIFPR is presented. For the GDM problem, the weights of experts are determined before aggregating the individual LIVIFPRs. Moreover, when the consensus of an individual LIVIFPR is unacceptable, a mathematical model is utilized to reach the consensus requirement. Subsequently, Algorithm II for GDM with incomplete LIVIFPRs is proposed step-by-step. Finally, the new GDM method is used to evaluate four Chinese express companies, and the advantages of this approach are demonstrated by performing a comparison analysis. [ABSTRACT FROM AUTHOR]

This paper proposes the Love Evolution Algorithm (LEA), a novel evolutionary algorithm inspired by the stimulus–value–role theory. The optimization process of the LEA includes three phases: stimulus, value, and role. Both partners evolve through these phases and benefit from them regardless of the outcome of the relationship. This inspiration is abstracted into mathematical models for global optimization. The efficiency of the LEA is validated through numerical experiments with CEC2017 benchmark functions, outperforming seven metaheuristic algorithms as evidenced by the Wilcoxon signed-rank test and the Friedman test. Further tests using the CEC2022 benchmark functions confirm the competitiveness of the LEA compared to seven state-of-the-art metaheuristics. Lastly, the study extends to real-world problems, demonstrating the performance of the LEA across eight diverse engineering problems. Source codes of the LEA are publicly available at https://ww2.mathworks.cn/matlabcentral/fileexchange/159101-love-evolution-algorithm. [ABSTRACT FROM AUTHOR]

Accurate prostate segmentation in ultrasound images is crucial for the clinical diagnosis of prostate cancer and for performing image-guided prostate surgery. However, it is challenging to accurately segment the prostate in ultrasound images due to their low signal-to-noise ratio, the low contrast between the prostate and neighboring tissues, and the diffuse or invisible boundaries of the prostate. In this paper, we develop a novel hybrid method for segmentation of the prostate in ultrasound images that generates accurate contours of the prostate from a range of datasets. Our method involves three key steps: (1) application of a principal curve-based method to obtain a data sequence comprising data coordinates and their corresponding projection index; (2) use of the projection index as training input for a fractional-order-based neural network that increases the accuracy of results; and (3) generation of a smooth mathematical map (expressed via the parameters of the neural network) that affords a smooth prostate boundary, which represents the output of the neural network (i.e., optimized vertices) and matches the ground truth contour. Experimental evaluation of our method and several other state-of-the-art segmentation methods on datasets of prostate ultrasound images generated at multiple institutions demonstrated that our method exhibited the best capability. Furthermore, our method is robust as it can be applied to segment prostate ultrasound images obtained at multiple institutions based on various evaluation metrics. [ABSTRACT FROM AUTHOR]

This paper which depended on the foundation of back strip method has established mathematic model to simulate stratum burial history, which considered the computation of stratum skeleton depth based on max depth and the equation-depth point on the procedure to recover stratum by stripping each layer, and put forward the enhanced restoration method taking layers group as studying object. Finally, the method has been applied to build the computer model and program automatic back strip algorithm successfully. Experiments have proved that the method is accurate, applicable, and extensible under the conditions of various complex strata. [ABSTRACT FROM AUTHOR]

In this paper, we present a new structure of the n-dimensional trigonometric cubic B-spline collocation algorithm, which we show in three different formats: one-, two-, and three-dimensional. These constructs are critical for solving mathematical models in different fields. We illustrate the efficiency and accuracy of the proposed method by its application to a few two- and three-dimensional test problems. We use other numerical methods available in the literature to make comparisons. [ABSTRACT FROM AUTHOR]

The paper aims to present an integrated approach to solve the decision-making problem under the probabilistic hesitant fuzzy information (PHFI) features, which is an extension of the hesitant fuzzy set. The considered PHFI not only allows multiple opinions, but also associates occurrence probability to each opinion, which increases the reliability of the information. Motivated by these features of PHFI, an approach is presented to solve the decision problem with partial known information about the attribute and expert weights. In addition, an algorithm for finding some missing values in the preference information is presented and stated their properties. Afterward, the Hamy mean operator has been used to aggregate the different collective information into a single one. Also, we presented a COPRAS method to the PHFI for ranking the given alternatives. The presented algorithm has been demonstrated through a case study of cloud vendor selection and its validity has been revealed by comparing the approach results with the several existing algorithm results. [ABSTRACT FROM AUTHOR]

In this paper, the problem of temperature distribution for convective straight fins with constant and temperature-dependent thermal conductivity is solved by using artificial neural networks trained by the biogeography-based heterogeneous cuckoo search (BHCS) algorithm. We have solved the integer and noninteger order energy balance equation in order to analyse the temperature distribution in convective straight fins. We have compared our results with homotopy perturbation method (HPM), variational iteration method (VIM), and homotopy perturbation Sumudu transform method (HPSTM). The results show that the ANN–BHCS algorithm gives better results than other analytical techniques. We have further checked the efficiency of the ANN–BHCS algorithm by using the performance metrics MAD, TIC, and ENSE. We have calculated the values of MAD, TIC, and ENSE for case 1 of the problem, and histograms of these metrics show the efficiency of our algorithm. [ABSTRACT FROM AUTHOR]

Slicing is an important step for all layer-based additive manufacturing (AM) processes. This paper proposes an improved and robust slicing algorithm with efficient contour construction to reduce the slicing time and be able to slice a complex STereoLithography (STL) model with millions of triangles (resulting from high-accuracy STL files). Also, another important feature of the proposed method is it can identify outer and inner contours automatically. Test results to demonstrate the improvements in execution time and comparisons with results from published papers have been given to illustrate the algorithm efficiency. The robustness of this slicing algorithm is demonstrated by several complex models with large numbers of nested contours on each slice. [ABSTRACT FROM AUTHOR]

High-utility itemset mining (HUIM) is an extension of traditional association-rule mining that can find profitable itemsets for decision-making. It faces, however, a limitation since the utility of an itemset increases along with the size of it. High-average utility itemset mining (HAUIM) provides a fair measure to find the average-utility of an itemset, which is more reasonable to design the sales strategies for making the efficient decision. Traditional algorithms of HAUIM mostly focus on mining high average-utility itemsets (HAUIs) from the static database. When the database size is changed, for example, transaction insertion/deletion, the discovered information is required to be updated, thus the updated database is necessary to be re-scanned for identifying the set of HAUIs in the batch manner. In this paper, we present an updating algorithm called FUP-HAUIMD to maintain the discovered HAUIs with transaction deletion. When some transactions in the database are deleted, the designed FUP-HAUIMD algorithm can easily update the discovered HAUIs without scanning the database all the time. The designed FUP-HAUIMD algorithm divides the itemsets into four cases based on the modified fast updated (MFUP) concept. The average-utility (AU)-list structure is further utilized to keep the necessary ramification for later mining progress. Experiments are then conducted to compare the designed FUP-HAUIMD algorithm with the state-of-the-art baseline algorithm running on the batch mode, and the developed approach shows better performance in terms of runtime, number of examined patterns, and scalability. [ABSTRACT FROM AUTHOR]

In this paper, a variational Bayesian (VB)-based iterative algorithm for ARX models with random missing outputs is proposed. The distributions of missing outputs can be estimated in the VB-E step, and the distributions of unknown parameters can be estimated in the VB-M step by the estimated missing outputs and the available outputs. Compared with the expectation-maximization-based iterative algorithm, this algorithm computes the latent variable and the parameter distributions at each iteration. Therefore, it is more accurate. The simulation results demonstrate the advantages of the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes an effective multiobjective estimation of distribution algorithm (MoEDA) which solves the bi-criteria stochastic job-shop scheduling problem with the uncertainty of processing time. The MoEDA proposal minimizes the expected average makespan and the expected total tardiness within a reasonable amount of computational time. With the framework of proposed MoEDA, the probability model of the operation sequence is estimated firstly. For sampling the processing time of each operation with the Monte Carlo methods, allocation method is used to decide the operation sequence, and then the expected makespan and total tardiness of each sampling are evaluated. Subsequently, updating mechanism of the probability models is proposed according to the best solutions to obtain. Finally, for comparing with some existing algorithms by numerical experiments on the benchmark problems, we demonstrate the proposed effective estimation of distribution algorithm can obtain an acceptable solution in the aspects of schedule quality and computational efficiency. [ABSTRACT FROM AUTHOR]

Increasing the cutter size to enhance its stiffness is of great significance for improving the machining efficiency and precision of deep and narrow channel parts. In this paper, the concept of cutter size critical sphere (CSCS) is presented, which is a specified sphere and tangent to several geometric constraints of tool accessible regions. With this concept, the complex multi-constraints of the workpiece can be transformed into several simple but precise geometric conditions to optimize the size and tool orientation of a conical cutter. The conical cutter generated by CSCS can reach a critical state with multi-constraints simultaneously. Firstly, the mathematical principle of the conical cutter generated by a cylindrical cutter is deduced based on the motion envelope theory. Secondly, the concept of CSCS is proposed based on the deduced mathematical principle and the calculation method of the CSCS with the general situation is provided. Thirdly, the CSCS with special situations is discussed and the calculation method is proposed. Fourthly, the mathematical model and solving algorithm for the max-size CSCS is given. The solving algorithm is designed based on the 3D Medial Axis Transformation (3D MAT) theory. Finally, the proposed method is verified by three simulation experiments and a comparison experiment. The results show that the proposed method can efficiently and accurately calculate the max size and tool orientation of the conical cutter simultaneously. The optimized conical cutter can be tangent to the multi-constraints of the workpiece but do no interfer with them. [ABSTRACT FROM AUTHOR]

Disasters such as earthquake or tsunami can easily take the lives of thousands of people and millions worth of property in a fleeting moment. A successful emergency evacuation plan is critical in response to disasters. In this paper, we seek to investigate the multi-source, multi-destination evacuation problem. First, we construct a mixed integer linear programming model. Second, based on K shortest paths and user equilibrium, we propose a novel algorithm (hereafter KPUE), whose complexity is polynomial in the numbers of nodes and evacuees. Finally, we demonstrate the effectiveness of algorithm KPUE by a real evacuation network in Shanghai, China. The numerical examples show that the average computation time of the proposed algorithm is 95% less than that of IBM ILOG CPLEX solver and the optimality gap is no more than 5%. [ABSTRACT FROM AUTHOR]

Automated formal verification is often based on the Counterexample-Guided Abstraction Refinement (CEGAR) approach. Many variants of CEGAR have been developed over the years as different problem domains usually require different strategies for efficient verification. This has lead to generic and configurable CEGAR frameworks, which can incorporate various algorithms. In our paper we propose six novel improvements to different aspects of the CEGAR approach, including both abstraction and refinement. We implement our new contributions in the Theta framework allowing us to compare them with state-of-the-art algorithms. We conduct an experiment on a diverse set of models to address research questions related to the effectiveness and efficiency of our new strategies. Results show that our new contributions perform well in general. Moreover, we highlight certain cases where performance could not be increased or where a remarkable improvement is achieved. [ABSTRACT FROM AUTHOR]

Income tax systems with "pass-through" entities transfer a firm's income to shareholders, which are taxed individually. In 2014, a Chilean tax reform introduced this type of entity and changed to an accrual basis that distributes incomes (but not losses) to shareholders. A crucial step for the Chilean taxation authority is to compute the final income of each individual given the complex network of corporations and companies, usually including cycles between them. In this paper, we show the mathematical conceptualization and the solution to the problem, proving that there is only one way to distribute income to taxpayers. Using the theory of absorbing Markov chains, we define a mathematical model for computing the taxable income of each taxpayer, and we propose a decomposition algorithm for this problem. This approach allows us to compute the solution accurately and to efficiently use computational resources. Finally, we present some characteristics of Chilean taxpayers' network and the computational results of the algorithm using this network. [ABSTRACT FROM AUTHOR]

The problem in this paper is motivated by physical problems concerned with the case when a class of continuous and equimeasurable densities of a string is given then how to find minimal frequencies among these given densities, that is, what kind of densities minimize the frequencies. By taking Dirichlet eigenvalues into account, given a certain weight function ω, we will show the minimizer of the mth eigenvalue is the m-degree continuous symmetrical decreasing rearrangement of ω. The main result of this paper can be viewed as complementary to Schwarz’s work (Schwarz in J. Math. Mech. 10:401-422, 1961). [ABSTRACT FROM AUTHOR]

Based on the backstepping method, this paper proposes a robust control algorithm for nonlinear plants under parametric uncertainty and external bounded disturbances. The algorithm ensures tracking of the plant output to a smooth reference signal with a required accuracy in the steady-state mode. In comparison with the existing analogs, control system implementation requires only one filter of dimension coinciding with the plant relative degree and observers used for calculation of the stabilizing and basic control laws. This feature considerably simplifies the control scheme and calculation of its parameters. And finally, simulation results illustrating the performance of this scheme are given. [ABSTRACT FROM AUTHOR]

In this paper, we establish an iterative algorithm and estimation of solutions for a fractional turbulent flow model in a porous medium under a suitable growth condition. Our main tool is the monotone iterative technique. [ABSTRACT FROM AUTHOR]

In this paper, we propose a procedure for detecting multiple change-points in a mean-shift model, where the number of change-points is allowed to increase with the sample size. A theoretic justification for our new method is also given. We first convert the change-point problem into a variable selection problem by partitioning the data sequence into several segments. Then, we apply a modified variance inflation factor regression algorithm to each segment in sequential order. When a segment that is suspected of containing a change-point is found, we use a weighted cumulative sum to test if there is indeed a change-point in this segment. The proposed procedure is implemented in an algorithm which, compared to two popular methods via simulation studies, demonstrates satisfactory performance in terms of accuracy, stability and computation time. Finally, we apply our new algorithm to analyze two real data examples. [ABSTRACT FROM AUTHOR]

In order to generate efficient tool path with given precision requirements, scallop height should be kept under a given limit, while the tool path should be as short as possible to reduce machining time. Traditional methods generate CC curves one by one, which makes the final tool path far from being globally optimal. This paper presents an optimal tool path generation model for a ball-end tool which strives to globally optimize a tool path with various objectives and constraints. Two scalar functions are constructed over the part surface to represent the path intervals and the feedrate (with directions). Using the finite element method (FEM), the tool path length minimization model and the machining time minimization model are solved numerically. The proposed method is also suitable for tool path generation on mesh surfaces. Simulation results show that the generated tool path can be direction parallel or contour parallel with different boundary conditions. Compared to most of the conventional tool path generation methods, the proposed method is able to generate more effective tool paths due to the global optimization strategy. [ABSTRACT FROM AUTHOR]

Using a proper distribution function for speech signal or for its representations is of crucial importance in statistical-based speech processing algorithms. Although the most commonly used probability density function (pdf) for speech signals is Gaussian, recent studies have shown the superiority of super-Gaussian pdfs. A large research effort has focused on the investigation of a univariate case of speech signal distribution; however, in this paper, we study the multivariate distributions of speech signal and its representations using the conventional distribution functions, e.g., multivariate Gaussian and multivariate Laplace, and the copula-based multivariate distributions as candidates. The copula-based technique is a powerful method in modeling non-Gaussian multivariate distributions with non-linear inter-dimensional dependency. The level of similarity between the candidate pdfs and the real speech pdf in different domains is evaluated using the energy goodness-of-fit test. In our evaluations, the best-fitted distributions for speech signal vectors with different lengths in various domains are determined. A similar experiment is performed for different classes of English phonemes (fricatives, nasals, stops, vowels, and semivowel/glides). The evaluation results demonstrate that the multivariate distribution of speech signals in different domains is mostly super-Gaussian, except for Mel-frequency cepstral coefficient. Also, the results confirm that the distribution of the different phoneme classes is better statistically modeled by a mixture of Gaussian and Laplace pdfs. The copula-based distributions provide better statistical modeling of vectors representing discrete Fourier transform (DFT) amplitude of speech vectors with a length shorter than 500 ms. [ABSTRACT FROM AUTHOR]

The resource-assisted processing operation involves the coupling of multi-dimensional sub-problem, which poses a challenge in scheduling system. In this study, a dimension-aware gain-sharing knowledge algorithm (DGSK) is presented to address the distributed hybrid flowshop scheduling problem with resource-dependent processing times (DHFSP-RDPT), where the makespan is to be minimized. Firstly, by analyzing the mathematical model of the DHFSP-RDPT, four problem-specific lemmas and two novel resource reallocation rules are proposed. The DGSK begin with a high-performance initial population, which is generated by three knowledge-driven heuristics in hybrid way. Next, a discrete evolution-based search mechanism assists the DGSK to extend the search in solution space. Furthermore, a dimension-aware two-stage local search combined with meta-Lamarckian learning method is embedded to enhance the local search ability for the multidimensional problems. Finally, the proposed algorithm is measured on a series of instances based on real production data. The results demonstrate that the DGSK improves the performance by in solving DHFSP-RDPT compared to the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Scientific workflows are used to process large amounts of data and perform complex analyses; thus, they require powerful computing resources to produce the desired results in an acceptable time and at reasonable costs. For this purpose, distributed resources such as cloud computing, with access to virtualized, infinite, and elastic resources are used to execute the workflows. For mapping tasks to computational resources, the problem must be modeled as a scheduling problem. The algorithm presented in this research is a hybrid algorithm based on a mathematical model called MHPSLP that performs the scheduling problem by breaking the problem into smaller subsets including scheduling bags of tasks, providing resources using an mixed integer linear mathematical (MILP) model. The benefit of this method against compared scheduling algorithms is reduction of executed task's cost in a deadline constraint. [ABSTRACT FROM AUTHOR]

This paper considers a placement problem for logistic objects with logistic zones segmentation in the continuous setting (an object can be placed at any point of a given area). The authors reduce this framework to a calculus of variations problem and suggest a numerical algorithm of solution based on the optical-geometrical approach. And finally, this algorithm is employed to solve the problems of municipal infrastructure optimization. [ABSTRACT FROM AUTHOR]

Statistical model checking of unbounded time properties is challenging, because it requires an algorithm to estimate the measure of paths satisfying an unbounded until property from samples of finite length paths. In this paper, we survey all proposed algorithms for this problem, and critically evaluate them. [ABSTRACT FROM AUTHOR]

In this paper, we consider two problems about the preemptive scheduling of a set of jobs with release times on a single machine. In the first problem, each job has a deadline. The objective is to find a feasible schedule which minimizes the total completion time of the jobs. In the second problem (called two-agent scheduling problem), the set of jobs is partitioned into two subsets $$\mathcal{J}^{(1)}$$ and $$\mathcal{J}^{(2)}$$ . Each job in $$\mathcal{J}^{(2)}$$ has a deadline. The objective is to find a feasible schedule which minimizes the total completion time of the jobs in $$\mathcal{J}^{(1)}$$ . For the first problem, Du and Leung (Journal of Algorithms 14:45-68, ) showed that the problem is NP-hard. We show in this paper that there is a flaw in their NP-hardness proof. For the second problem, Leung et al. (Operations Research 58:458-469, ) showed that the problem can be solved in polynomial time. Yuan et al. (Private Communication) showed that their polynomial-time algorithm is invalid so the complexity of the second problem is still open. In this paper, by a modification of Du and Leung's NP-hardness proof, we show that the first problem is NP-hard even when the jobs have only two distinct deadlines. Using the same reduction, we also show that the second problem is NP-hard even when the jobs in $$\mathcal{J}^{(2)}$$ has a common deadline $$D>0$$ and a common release time 0. [ABSTRACT FROM AUTHOR]

This paper addresses a scheduling problem with continuous resources and energy constraints. Given a set of non-preemptive activities, each activity requires a continuously divisible resource whose instantaneous usage is limited in maximum and minimum, its processing satisfying a time window and a total energy (time $$\times $$ resource-usage) requirement. The goal consists of getting a schedule satisfying all the constraints. The problem, which we refer to as the Energy-Constrained Scheduling Problem with Continuous Resources (CECSP), is a generalization of the well-known cumulative scheduling problem for which the 'energetic reasoning' or 'left-shift/right-shift' necessary feasibility condition yielded a popular polynomially computable satisfiability test. The paper presents a generalization of the energetic reasoning for the CECSP, defining precisely the activity minimum consumptions and exhibiting a polynomial number of relevant time intervals on which it is sufficient to apply the satisfiability tests. A strongly polynomial energetic reasoning satisfiability test can be derived for the considered generalization, which also yields a short proof for the complexity of the original algorithm. Some limits of the approach, as well as an approximation framework for more general resource consumption functions, are also addressed. [ABSTRACT FROM AUTHOR]

In many fault detection problems, we want to identify all defective items from a sample set of items using the minimum number of tests. Group testing is for the scenario where each test is performed on a subset of items, and tells whether the subset contains at least one defective item or not. In practice, the number of defective items in the sample set is usually unknown. In this paper, we investigate new algorithms for the group testing problem with unknown number of defective items. We consider the scenario where the performance of a group testing algorithm is measured by two criteria: the primary criterion is the number of tests performed, which measures the total cost spent; and the secondary criterion is the number of stages the algorithm works in, which is referred to as the sequentiality of the algorithm in this paper and measures the minimum amount of time required by using the algorithm to identify all the defective items. We present a new algorithm Recursive Binary Splitting (RBS) for the above group testing problem with unknown number of defective items, and prove an upper bound on the number of tests required by RBS. The computational results show that RBS exhibits very good practical performance, measured in terms of both the above two criteria. [ABSTRACT FROM AUTHOR]

This paper describes the package sppmix for the statistical environment R. The sppmix package implements classes and methods for modeling spatial point patterns using inhomogeneous Poisson point processes, where the intensity surface is assumed to be a multiple of a finite additive mixture of normal components and the number of components is a finite, fixed or random integer. Extensions to the marked inhomogeneous Poisson point processes case are also presented. We provide an extensive suite of R functions that can be used to simulate, visualize and model point patterns, estimate the parameters of the models, assess convergence of the algorithms and perform model selection and checking in the proposed modeling context. In addition, several approaches have been implemented in order to handle the standard label switching issue which arises in any modeling approach involving mixture models. We adapt a hierarchical Bayesian framework in order to model the intensity surfaces and have implemented two major algorithms in order to estimate the parameters of the mixture models involved: the data augmentation and the birth-death Markov chain Monte Carlo (DAMCMC and BDMCMC). We used C++ (via the Rcpp package) in order to implement the most computationally intensive algorithms. [ABSTRACT FROM AUTHOR]

The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions. The algorithm works by applying successively so-called “resolvent” mappings associated to the original object that one aims to optimize. In this paper we abstract from the corresponding resolvents employed in these problems the natural notion of jointly firmly nonexpansive families of mappings. This leads to a streamlined method of proving weak convergence of this class of algorithms in the context of complete CAT(0) spaces (and hence also in Hilbert spaces). In addition, we consider the notion of uniform firm nonexpansivity in order to similarly provide a unified presentation of a case where the algorithm converges strongly. Methods which stem from proof mining, an applied subfield of logic, yield in this situation computable and low-complexity rates of convergence. [ABSTRACT FROM AUTHOR]

In this paper, we introduce and analyze a general iterative algorithm for finding a common solution of a finite family of mixed equilibrium problems, a general system of generalized equilibria and a fixed point problem of nonexpansive mappings in a real Hilbert space. Under some appropriate conditions, we derive the strong convergence of the sequence generated by the proposed algorithm to a common solution, which also solves some optimization problem. The result presented in this paper improves and extends some corresponding ones in the earlier and recent literature. [ABSTRACT FROM AUTHOR]

Many engineering problems can be categorized into constrained optimization problems (COPs). The engineering design optimization problem is very important in engineering industries. Because of the complexities of mathematical models, it is difficult to find a perfect method to solve all the COPs very well. ε constrained differential evolution (εDE) algorithm is an effective method in dealing with the COPs. However, εDE still cannot obtain more precise solutions. The interaction between feasible and infeasible individuals can be enhanced, and the feasible individuals can lead the population finding optimum around it. Hence, in this paper we propose a new algorithm based on ε feasible individuals driven local search called as ε constrained differential evolution algorithm with a novel local search operator (εDE-LS). The effectiveness of the proposed εDE-LS algorithm is tested. Furthermore, four real-world engineering design problems and a case study have been studied. Experimental results show that the proposed algorithm is a very effective method for the presented engineering design optimization problems. [ABSTRACT FROM AUTHOR]

Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems. In this paper, we consider a generalization of automata-theoretic infinite-state verification from strings to labelled series–parallel graphs. We define a model of non-deterministic, 2-way, concurrent automata working on series–parallel graphs and communicating through shared registers on the nodes of the graph. We consider the following verification problem: given a family of series–parallel graphs described by a context-free graph transformation system (GTS), and a concurrent automaton over series–parallel graphs, is some graph generated by the GTS accepted by the automaton? The general problem is undecidable already for (one-way) multi-head automata over strings. We show that a bounded version, where the automata make a fixed number of reversals along the graph and use a fixed number of shared registers is decidable, even though there is no bound on the sizes of series–parallel graphs generated by the GTS. Our decidability result is based on establishing that the number of context switches can be bounded and on an encoding of the computation of bounded concurrent automata that allows us to reduce the reachability problem to the emptiness problem for pushdown automata. [ABSTRACT FROM AUTHOR]

This paper addresses the question of the observability of neutral Higgs bosons through the leptonic decay in a two Higgs doublet model (2HDM). Both scalar and pseudo-scalar Higgs bosons ( H, A) are considered. The model is set to type IV to enhance the leptonic decay. In such a scenario, a signal production process like $$e^+e^- \rightarrow A^0H^0 \rightarrow \tau \tau \mu \mu $$ or $$\mu \mu \tau \tau $$ would provide a clear signal on top of the background in a di-muon invariant mass distribution far from the Z boson pole mass. The analysis is based on a $$\tau $$ -id algorithm which preselects events if they have two $$\tau $$ jets by requiring a hadronic $$\tau $$ decay. Several benchmark points are defined for the search, requiring a linear collider operating at $$\sqrt{s} = 0.5$$ and 1 TeV. It is shown that the signal can be observed on top of the background in all benchmark points at an integrated luminosity of 1000 $$\mathrm{fb}^{-1}$$ . [ABSTRACT FROM AUTHOR]

Smale's 17th problem asks for an algorithm which finds an approximate zero of polynomial systems in average polynomial time (see Smale in Mathematical problems for the next century, American Mathematical Society, Providence, 2000). The main progress on Smale's problem is Beltrán and Pardo (Found Comput Math 11(1):95-129, 2011) and Bürgisser and Cucker (Ann Math 174(3):1785-1836, 2011). In this paper, we will improve on both approaches and prove an interesting intermediate result on the average value of the condition number. Our main results are Theorem 1 on the complexity of a randomized algorithm which improves the result of Beltrán and Pardo (2011), Theorem 2 on the average of the condition number of polynomial systems which improves the estimate found in Bürgisser and Cucker (2011), and Theorem 3 on the complexity of finding a single zero of polynomial systems. This last theorem is similar to the main result of Bürgisser and Cucker (2011) but relies only on homotopy methods, thus removing the need for the elimination theory methods used in Bürgisser and Cucker (2011). We build on methods developed in Armentano et al. (2014). [ABSTRACT FROM AUTHOR]

Multibody systems are dynamical systems characterized by intrinsic symmetries and invariants. Geometric mechanics deals with the mathematical modeling of such systems and has proven to be a valuable tool providing insights into the dynamics of mechanical systems, from a theoretical as well as from a computational point of view. Modeling multibody systems, comprising rigid and flexible members, as dynamical systems on manifolds, and Lie groups in particular, leads to frame-invariant and computationally advantageous formulations. In the last decade, such formulations and corresponding algorithms are becoming increasingly used in various areas of computational dynamics providing the conceptual and computational framework for multibody, coupled, and multiphysics systems, and their nonlinear control. The geometric setting, furthermore, gives rise to geometric numerical integration schemes that are designed to preserve the intrinsic structure and invariants of dynamical systems. These naturally avoid the long-standing problem of parameterization singularities and also deliver the necessary accuracy as well as a long-term stability of numerical solutions. The current intensive research in these areas documents the relevance and potential for geometric methods in general and in particular for multibody system dynamics. This paper provides an exhaustive summary of the development in the last decade, and a panoramic overview of the current state of knowledge in the field. [ABSTRACT FROM AUTHOR]

Infinite horizon optimization (IHO) problems present a number of challenges for their solution, most notably, the inclusion of an infinite data set. This hurdle is often circumvented by approximating its solution by solving increasingly longer finite horizon truncations of the original infinite horizon problem. In this paper, we adopt a novel transformation that reduces the infinite dimensional IHO problem into an equivalent one dimensional optimization problem, i.e., minimizing a Hölder continuous objective function with known parameters over a closed and bounded interval of the real line. We exploit the characteristics of the transformed problem in one dimension and introduce an algorithm with a graphical implementation for solving the underlying infinite dimensional optimization problem. [ABSTRACT FROM AUTHOR]

Cardiac digital twins provide a physics and physiology informed framework to deliver personalized medicine. However, high-fidelity multi-scale cardiac models remain a barrier to adoption due to their extensive computational costs. Artificial Intelligence-based methods can make the creation of fast and accurate whole-heart digital twins feasible. We use Latent Neural Ordinary Differential Equations (LNODEs) to learn the pressure-volume dynamics of a heart failure patient. Our surrogate model is trained from 400 simulations while accounting for 43 parameters describing cell-to-organ cardiac electromechanics and cardiovascular hemodynamics. LNODEs provide a compact representation of the 3D-0D model in a latent space by means of an Artificial Neural Network that retains only 3 hidden layers with 13 neurons per layer and allows for numerical simulations of cardiac function on a single processor. We employ LNODEs to perform global sensitivity analysis and parameter estimation with uncertainty quantification in 3 hours of computations, still on a single processor. [ABSTRACT FROM AUTHOR]

Introduction: The efficiency of The International Classification of Headache Disorders (ICHD-3) in reflecting patients' disability has recently been questioned. This prompts consideration that clinical features beyond pain may more accurately indicate the extent of underlying brain impairment than the mere frequency of headache days. Important cognitive dysfunctions and psychological impairment have been reported in burdensome cases of migraine, and the presence of these alterations has been associated with biological changes in the nervous system. This study aimed to compare migraine-related disability within a specific patient group, classified using ICHD-3 criteria or classified based on findings from a neuropsychological evaluation using machine learning. Additionally, a complementary voxel-based morphometry (VBM) comparison was conducted to explore potential neuroanatomical differences between the resulting groups. Patients and methods: The study included episodic and chronic migraine patients seeking consultation at a specialized headache department. A neuropsychological evaluation protocol, encompassing validated standardized tests for cognition, anxiety, depression, perceived stress, and headache-related impact (HIT-6) and disability (MIDAS), was administered. Results from this evaluation were input into an automated K-means clustering algorithm, with a predefined K=2 for comparative purposes. A supplementary Voxel-based Morphometry (VBM) evaluation was conducted to investigate neuroanatomical contrasts between the two distinct grouping configurations. Results: The study involved 111 participants, with 49 having chronic migraine and 62 having episodic migraine. Seventy-four patients were assigned to cluster one, and 37 patients were assigned to cluster two. Cluster two exhibited significantly higher levels of depression, anxiety, and perceived stress, and performed worse in alternating and focalized attention tests. Differences in HIT-6 and MIDAS scores between episodic and chronic migraine patients did not reach statistical significance (HIT-6: 64.39 (±7,31) vs 62.92 (±11,61); p= 0. 42 / MIDAS: 73.63 (±68,61) vs 84.33 (±63,62); p=0.40). In contrast, patients in cluster two exhibited significantly higher HIT-6 (62.32 (±10,11) vs 66.57 (±7,21); p=0.03) and MIDAS (68.69 (±62,58) vs 97.68 (±70,31); p=0.03) scores than patients in cluster one. Furthermore, significant differences in grey matter volume between the two clusters were noted, particularly involving the precuneus, while differences between chronic and episodic migraine patients did not withstand correction for multiple comparisons. Conclusions: The classification of migraine patients based on neuropsychological characteristics demonstrates a more effective separation of groups in terms of disability compared to categorizing them based on the chronic or episodic diagnosis of ICHD-3. These findings could reveal biological changes that might explain differences in treatment responses among apparently similar patients. [ABSTRACT FROM AUTHOR]

Parkinson's disease (PD) and essential tremor (ET) are prevalent movement disorders that mainly affect elderly people, presenting diagnostic challenges due to shared clinical features. While both disorders exhibit distinct speech patterns—hypokinetic dysarthria in PD and hyperkinetic dysarthria in ET—the efficacy of speech assessment for differentiation remains unexplored. Developing technology for automatic discrimination could enable early diagnosis and continuous monitoring. However, the lack of data for investigating speech behavior in these patients has inhibited the development of a framework for diagnostic support. In addition, phonetic variability across languages poses practical challenges in establishing a universal speech assessment system. Therefore, it is necessary to develop models robust to the phonetic variability present in different languages worldwide. We propose a method based on Gaussian mixture models to assess domain adaptation from models trained in German and Spanish to classify PD and ET patients in Czech. We modeled three different speech dimensions: articulation, phonation, and prosody and evaluated the models' performance in both bi-class and tri-class classification scenarios (with the addition of healthy controls). Our results show that a fusion of the three speech dimensions achieved optimal results in binary classification, with accuracies up to 81.4 and 86.2% for monologue and /pa-ta-ka/ tasks, respectively. In tri-class scenarios, incorporating healthy speech signals resulted in accuracies of 63.3 and 71.6% for monologue and /pa-ta-ka/ tasks, respectively. Our findings suggest that automated speech analysis, combined with machine learning is robust, accurate, and can be adapted to different languages to distinguish between PD and ET patients. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new class of algorithms for solving the mixed-integer bilevel min-max optimization problem. This problem involves two players, a leader and a follower, who play a Stackelberg game. In particular, the leader seeks to minimize over a set of discrete variables the maximum objective that the follower can achieve. The complicating features of our problem are that a subset of the follower's decisions are restricted to be integer-valued, and that the follower's decisions are constrained by the leader's decisions. We first describe several bilevel min-max programs that can be used to obtain lower and upper bounds on the optimal objective value of the problem. We then present algorithms for this problem that finitely terminate with an optimal solution when the leader variables are restricted to take binary values. Finally, we report the results of a computational study aimed at evaluating the quality of our algorithms on two families of randomly generated problems. [ABSTRACT FROM AUTHOR]

The breeding method has been widely used to generate ensemble perturbations in ensemble forecasting due to its simple concept and low computational cost. This method produces the fastest growing perturbation modes to catch the growing components in analysis errors. However, the bred vectors (BVs) are evolved on the same dynamical flow, which may increase the dependence of perturbations. In contrast, the nonlinear local Lyapunov vector (NLLV) scheme generates flow-dependent perturbations as in the breeding method, but regularly conducts the Gram-Schmidt reorthonormalization processes on the perturbations. The resulting NLLVs span the fast-growing perturbation subspace efficiently, and thus may grasp more components in analysis errors than the BVs. In this paper, the NLLVs are employed to generate initial ensemble perturbations in a barotropic quasi-geostrophic model. The performances of the ensemble forecasts of the NLLV method are systematically compared to those of the random perturbation (RP) technique, and the BV method, as well as its improved version-the ensemble transform Kalman filter (ETKF) method. The results demonstrate that the RP technique has the worst performance in ensemble forecasts, which indicates the importance of a flow-dependent initialization scheme. The ensemble perturbation subspaces of the NLLV and ETKF methods are preliminarily shown to catch similar components of analysis errors, which exceed that of the BVs. However, the NLLV scheme demonstrates slightly higher ensemble forecast skill than the ETKF scheme. In addition, the NLLV scheme involves a significantly simpler algorithm and less computation time than the ETKF method, and both demonstrate better ensemble forecast skill than the BV scheme. [ABSTRACT FROM AUTHOR]

This paper aims to develop a local path planning algorithm for a bio-inspired, reconfigurable crawling robot. A detailed description of the robotic platform is first provided, and the suitability for deployment of each of the current state-of-the-art local path planners is analyzed after an extensive literature review. The Enhanced Vector Polar Histogram algorithm is described and reformulated to better fit the requirements of the platform. The algorithm is deployed on the robotic platform in crawling configuration and favorably compared with other state-of-the-art local path planning algorithms. [ABSTRACT FROM AUTHOR]

Mining top-rank- k frequent patterns is a popular data mining task, which consists of discovering the patterns in a transaction database that belong to the k first ranks in terms of support. Although, several algorithms have been proposed for this task, it remains computationally expensive. To address this issue, this paper proposes a novel algorithm named BTK. It relies on a novel tree structure named TB-tree to store crucial information about frequent patterns. Moreover, BTK employs a new B-list structure to store information about patterns, and relies on subsume indexes to reduce the search space and speed up the discovery of top-rank- k frequent patterns. BTK also uses an early pruning strategy and an effective threshold raising mechanism. Additionally, BTK introduces two efficient procedures for respectively generating subsume indexes and intersecting B-lists. Extensive experiments were conducted on several datasets to evaluate the efficiency of the proposed algorithm. Results show that BTK is highly efficient and competitive. [ABSTRACT FROM AUTHOR]

This paper studies a three-level control system. Impulsion serves as hierarchical control at the two levels of the system. We analyze the behavior of the system in the case of informational rules defined by the Germeier games Γ and Γ. Equilibrium design algorithms are proposed. The solution of the three-level differential model is reduced to the exploration of an equivalent multistep-differential model. [ABSTRACT FROM AUTHOR]

In this paper, we first propose a weak convergence algorithm, called the linesearch algorithm, for solving a split equilibrium problem and nonexpansive mapping (SEPNM) in real Hilbert spaces, in which the first bifunction is pseudomonotone with respect to its solution set, the second bifunction is monotone, and fixed point mappings are nonexpansive. In this algorithm, we combine the extragradient method incorporated with the Armijo linesearch rule for solving equilibrium problems and the Mann method for finding a fixed point of an nonexpansive mapping. We then combine the proposed algorithm with hybrid cutting technique to get a strong convergence algorithm for SEPNM. Special cases of these algorithms are also given. [ABSTRACT FROM AUTHOR]

Minimum quantity lubrication (MQL) has been proposed as a promising alternative to conventional flood cooling to substantially reduce the lubrication usage while maintaining high surface quality. Residual stress induced by grinding process directly affects the surface quality of the final product. An analytical relationship between residual stresses and process conditions such as process parameters, material properties, and lubrication conditions could support process planning and optimization of MQL grinding. This paper has presented a physics-based model to predict residual stresses in grinding with consideration of the lubrication and cooling effects of MQL. Grinding force and temperature distribution in the workpiece are used to calculate the loading stresses imparted by MQL grinding. The loading stresses are then coupled into a rolling/sliding contact algorithm to solve for residual stresses. Experimental measurements of residual stress profile under and flood cooling conditions have been pursued to calibrate and validate the predicted results. [ABSTRACT FROM AUTHOR]