Search

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.ejor.2007.10.019 Byline: Kazuki Matsumoto (a), Hiroyoshi Miwa (b), Toshihide Ibaraki (b) Keywords: Scheduling; Corrugated paper; Complexity; Contiguous set; Integer programming Abstract: Corrugated paper is produced by gluing three types of papers of the same breadth. Given a set of orders, we first assign each order to one of the standard breadths, and then sequence those assigned to each standard breadth so that they are continuously manufactured from the three rolls of the specified standard breadth equipped in the machine called corrugator. Here we are asked to achieve multi-goals of minimizing total length of roll papers, total loss of papers caused by the differences between standard breadths and real breadths of the orders, and the number of machine stops needed during production. We use integer programming to assign orders to standard breadths, and then develop a special purpose algorithm to sequence the orders assigned to each standard breadth. This is a first attempt to handle scheduling problems of the corrugator machine. Author Affiliation: (a) Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Sakyo-ku, Kyoto 606-8501, Japan (b) Department of Informatics, School of Science and Technology, Kwansei Gakuin University, 2-1 Gakuen Sanda, Hyogo 669-1337, Japan Article History: Received 24 March 2007; Accepted 5 October 2007

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]

• 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]

With the rapid development of wireless communication technology, new wireless applications and services are exploding. These new applications and services usually need wider bandwidth and higher speed. The voice of people calling for a fast and convenient network is getting stronger and stronger, and the wireless network must be the main development direction of the network in the future world. In order to make the development of wireless communication technology not limited by limited resources, resource optimization design has always been a research hotspot of scientists. Among them, the optimal resource algorithm can get the theoretical global optimal solution, while the sub-optimal resource allocation algorithm, as a supplement to the former, can be used to reduce costs and improve efficiency when the system structure is too complex. In this paper, a resource optimization method based on sparse clustering algorithm is proposed, and the matching relationship between spectrum resources and the services carried by cognitive terminals is established, so that the effectiveness of collaboration and cognitive systems is verified. [ABSTRACT FROM AUTHOR]

Performance of dynamic clouds depends on the efficiency of its load balancing and resource allocation. This paper is an exploratory study on the predictive approach for dynamic resource distribution of cloud services. Efficient cloud resource management can be achieved by simulating cloud services based on the predictions of incoming workloads, which can be more efficient than static allocation methods. This paper introduces a rule-based workload-balancing algorithm based on the predictions of an end-to-end system called Cicada. A simulation of cloud services can be achieved by a cloud service simulator called CloudSim and it will be used to achieve an algorithm with lower computational demand and a faster workload balancing. The final result will demonstrate the effectiveness of a predictive workload balancing approach that can achieve faster workload balancing with a lower computational power usage. [ABSTRACT FROM AUTHOR]

Highlights • Process model for transformation of formalized sentences into relational database. • Algorithms of functions and procedures for each step of transformation. • Meta model for the structure and content of formalized sentences in the relational database. Abstract Verbalized text contains knowledge necessary and sufficient for transfer of numerous human cognitions. The question is how this knowledge was saved into text. Authors believe that they found an important idea how to assemble knowledge into nodes of knowledge. Similar methods in the field of knowledge networks exist, but none of them does it in the same way as the Node of Knowledge (NOK) method. Basic terms and concepts in a language are represented in words whose meaning is final and cannot be divided in subterms. More complex meaning can be achieved by combining words in sentences. According to authors' opinion, each sentence includes connective medium for words in the sentence (related to semantic reasons), which is inwrought in the Node of Knowledge method. Using the Node of Knowledge method each sentence can be presented as a network of connected words. This network is enriched with links between words so a computer can interpret meaning and knowledge of the sentence in the same way an intelligent person does. A formalized and semantically enriched record of sentences (called Formalized Node of Knowledge – FNOK) is developed. Authors find that in this way, even without statistical text analysis, an algorithm can give correct answer to a question set based on written text. This paper presents the system for transformation of textual knowledge expressed in natural language sentences into a relational database. The system is a part of a larger knowledge-based system based on the Node of Knowledge (NOK) conceptual framework for knowledge-based system development. This paper starts with sentences written in the formalized and enriched form for which a logical transformation into the structure of a relational database is proposed. The system and algorithms for the transformation of formalized sentences into n-tuples of the relational database are distributed and represented in several steps. The research has shown that it is possible to store semantically enriched sentences in relational databases. The solution presented in this paper is important for further development of the system for receiving questions from users and providing answers (i.e. question-answering system), with the ability to use well-developed relational SQL languages. Relational database of texts enables numerous applications in the field of expert and intelligent systems. [ABSTRACT FROM AUTHOR]

Li-ion batteries are used widely in electric vehicles and electronic devices. Pseudo 2-Dimensional model(P2D model) is a classical physics-based Li-ion battery model and it is used widely for its high accuracy. In this paper, P2D model is modified for application. To compute the parameters and outputs of the modified P2D model fast and accurately, algorithms for computing the parameters and outputs of the modified P2D model are developed. To assess the effectiveness of the modified P2D model and the algorithms for computing the parameters and outputs of the modified P2D model, experiments and simulations are conducted. The experiments are conducted to obtain the data for conducting the simulations and the simulations are conducted based on the modified P2D model and the algorithms for computing the parameters and outputs of the modified P2D model. According to the simulation results, the modified P2D model and the algorithms for computing the parameters and outputs of the modified P2D model are effective. The modified P2D model and the algorithms for computing the parameters and outputs of the modified P2D model can be used to develop Li-ion battery charging methods. • P2D model is modified for application. • An algorithm for computing the parameters of the modified P2D model is developed. • An algorithm for computing the outputs of the modified P2D model is developed. [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]

The field of machine learning (ML) has witnessed significant advancements in recent years. However, many existing algorithms lack interpretability and struggle with high-dimensional and imbalanced data. This paper proposes SPINEX, a novel similarity-based interpretable neighbor exploration algorithm designed to address these limitations. This algorithm combines ensemble learning and feature interaction analysis to achieve accurate predictions and meaningful insights by quantifying each feature's contribution to predictions and identifying interactions between features, thereby enhancing the interpretability of the algorithm. To evaluate the performance of SPINEX, extensive experiments on 59 synthetic and real datasets were conducted for both regression and classification tasks. The results demonstrate that SPINEX achieves comparative performance and, in some scenarios, may outperform commonly adopted ML algorithms. The same findings demonstrate the effectiveness and competitiveness of SPINEX, making it a promising approach for various real-world applications. • SPINEX: An interpretable neighbor exploration algorithm is presented. • Combines ensemble learning and feature interaction for meaningful insights. • Quantifies feature contributions and interactions to enhance interpretability. • 59 experiments were conducted to validate SPINEX's comparative performance. [ABSTRACT FROM AUTHOR]

When constructing Reinforced Concrete (RC) components, rebar spacing must be inspected in the field before pouring concrete. The traditional inspection of rebar spacing: (1) depends on the experience of the individual inspector; (2) is limited to a pass/fail outcome; and (3) is in general conducted with limited time. This paper presents a recognition algorithm that automatically identifies the rebar position using LiDAR. The result is an automatic Rebar Layout Quality Index (RLQI). Researchers collected LiDAR data from a real rebar mat, compared it with the design drawings, and obtained the RLQI for both top and bottom rebar mats. The authors also quantified the quality of the structural construction with a new flexural relative moment strength index. This methodology has the potential to reduce inspection time and increase the reliability of inspections through an objective assessment of rebar spacing, by creating an as-built record of actual rebar location in the structure. [Display omitted] • New algorithm for automatically measuring rebar spacing prior to concrete pour. • Results compared to tape measurer and existing LiDAR algorithms for rebar spacing. • Field implementation and accuracy validation for one real structure in the field. • Structural quality reported by relative strength index created from LiDAR data. [ABSTRACT FROM AUTHOR]

This paper presents a new algorithmic framework for some basic problems on binary images. Algorithms for binary images such as one of extracting a connected component containing a query pixel and that of connected components labeling play basic roles in image processing. Those algorithms usually use linear work space for efficient implementation. In this paper we propose algorithms for several basic problems on binary images which are efficient in time and space, using space-efficient algorithms for grid graphs. More exactly, some of them run in O ( n log n ) time using O ( 1 ) work space and the others run in O ( n ) or O ( n log n ) time using O ( n ) work space for a binary image of n pixels stored in a read-only array. [ABSTRACT FROM AUTHOR]

In previous papers, the authors introduced and characterized a class of matrices called { K , s + 1 } -potent. Also, they established a method to construct these matrices. The purpose of this paper is to solve the associated inverse problem. Several algorithms are developed in order to find all involutory matrices K satisfying K A s + 1 K = A for a given matrix A ∈ C n × n and a given natural number s . The cases s = 0 and s ≥ 1 are separately studied since they produce different situations. In addition, some examples are presented showing the numerical performance of the methods. [ABSTRACT FROM AUTHOR]

In the area of human digital twins, the designed model should be as close as possible to the reality. The weight variable is one of the interested parameters of these mathematical models, as well as its interaction with other vital signals. The aim of this paper is including the information gathered from weight sensors of a person in its digital twin. To do this it is described an algorithm that filters and forecasts the human weight to use it in indexes such as BMI. It has been applied to a real sample and the results obtained are good. [ABSTRACT FROM AUTHOR]

• Non-linear Marine Predator Algorithm (NMPA) is introduced in this paper. • NMPA mimics two foraging techniques by marine predators: Levy and Brownian movements. • Fair power allocation in NOMA-VLC-B5G Networks is solved using NMPA algorithm. This paper is an influential attempt to identify and alleviate some of the issues with the recently proposed optimization technique called the Marine Predator Algorithm (MPA). With a visual investigation of its exploratory and exploitative behavior, it is observed that the transition of search from being global to local can be further improved. As an extremely cost-effective method, a set of nonlinear functions is used to change the search patterns of the MPA algorithm. The proposed algorithm, called Nonlinear Marin Predator Algorithm (NMPA), is tested on a set of benchmark functions. A comprehensive comparative study shows the superiority of the proposed method compared to the original MPA and even other recent meta -heuristics. The paper also considers solving a real-world case study around power allocation in non-orthogonal multiple access (NOMA) and visible light communications (VLC) for Beyond 5G (B5G) networks to showcase the applicability of the NMPA algorithm. NMPA algorithm also shows its superiority in solving a wide range of benchmark functions as well as obtaining fair power allocation for multiple users in NOMA-VLC-B5G systems compared with the state-of-the-art algorithms. 1 1 For the source code and the application, you can download the related files via the following links: GitHub and MathWorks: https://github.com/alisafaa12/nmpa https://uk.mathworks.com/matlabcentral/fileexchange/111135-nonlinear-marine-predator-algorithm-nmpa. [ABSTRACT FROM AUTHOR]

This paper proposes three algorithms for multiple-choice hardware-software partitioning with the objectives of minimizing execution time and power consumption, while meeting area constraint. Firstly, a heuristic algorithm is proposed to rapidly generate an approximate solution. In the second algorithm we refined the approximate solution using a customized tabu search algorithm. Finally, a dynamic programming algorithm is proposed to calculate the exact solution. Simulation results show that the approximate solution is very close to the exact solution. This can be further refined by tabu search to achieve a solution with less than 1.5% error for all cases considered in this paper. [ABSTRACT FROM AUTHOR]

Pipeline Analog to Digital Converter (ADC) design processes include several redesign steps to achieve the optimum solution. Hence, designers prefer to use automated algorithms for this purpose. In this paper, an automated algorithm for CAD tool is presented considering the trade-off between yield and power consumption for pipeline ADCs. This automated algorithm benefits from multiple degrees of freedom including the system level down to transistor level parameters, which helps CAD tools to find the optimized solution. It allows designers to choose an optimum scenario considering the trade-off between yield and power consumption. To evaluate the capabilities of this algorithm, a 10-bit pipeline ADC is designed and analyzed. This ADC has 10-bit resolution and 6.3 mW power, 91% yield, 55.3 dB SNDR and 58.8 dB SFDR, which are all in good agreement with the algorithm results. In comparison with similar designs it offers a competitive Figure of Merit (FOM), which proves the capability of this algorithm in finding the optimum solution. • Optimum pipeline ADC design processes include several redesign steps. • An automated algorithm considers the trade-off between yield and power consumption. • Algorithm benefits from a large design space. • Comparing the algorithm with similar designs proves its capability in optimization. [ABSTRACT FROM AUTHOR]

Injective parametrizations are widely used both in theory and in applications. The injectivity of parameteric curves and surfaces means that there are no self-intersections. Toric surface patch is defined by a set of integer lattice points A and corresponding control points and weights, which includes rational tensor product and triangle Bézier patches as special cases. In 2011, Sottile and Zhu presented a geometric method to check the injectivity of 2D toric surface patches. In this paper, we present an improved algorithm of their method. The complexity of the improved algorithm is reduced from O (n 3) to O (n 2) , where n = # (A). Some examples are shown to illustrate the effectiveness of our algorithm. Moreover, the algorithm is also applied to check the injectivity of parameterization in isogeometric analysis. [ABSTRACT FROM AUTHOR]

Many sorting algorithms have been developed to enhance the performance of important applications from different domains such as commercial commuting, operational research and scientific simulation. In this paper, we propose a new in-place sorting algorithm called OneByOne (OBO) sort. When compared to selection sort and bubble sort algorithms, OBO demonstrated faster run time at different array sizes. OBO also showed nearly equal performance when compared to the insertion sort algorithm. [ABSTRACT FROM AUTHOR]

The locating-chromatic number of a graph G (V , E) is the cardinality of a minimum resolving partition of the vertex set V (G) such that all vertices have distinct coordinates with respect to this partition and every two adjacent vertices not contained in the same partition class. Determining the locating-chromatic number of any tree is a difficult task. In this paper, we propose an algorithm to compute the upper bound on the locating-chromatic number of any tree. To do so, we decompose a tree into caterpillars and then compute the upper bound of the locating-chromatic number of this tree in terms of the ones for these caterpillars. [ABSTRACT FROM AUTHOR]

Most recent research in graph theory considered the studying of edge regular graph class ER (n,d,λ) for some n > d >λ, such that all the n vertices have d adjacent neighbors, and each pair of adjacent vertices have λ common neighbors, none of these research gave an algorithm to generate this class with considering the λ, in this paper, a novel algorithm to generate random edge-regular graphs for λ > 0. The algorithm produces an edge-regular graph for different values of d and n Moreover, it is easy to implement and quite fast in practice. The Matlab programming language used to obtain the experimental result. The analysis of this method showed that the running time of this method proven to be O( d 3). [ABSTRACT FROM AUTHOR]

Abstract: Labelle and Lamathe introduced in 2009 a generalization of the standard combinatorial differential species operator D, by giving a combinatorial interpretation to , where and are two-sort and one-sort species respectively. One can show that such operators can be decomposed as sums of products of simpler operators called atomic combinatorial differential operators. In their paper, Labelle and Lamathe presented a list of the first atomic differential operators. In this paper, we describe an algorithm that allows to generate (and enumerate) all of them, subject to available computer resources. We also give a detailed analysis of how to compute the molecular components of . [Copyright &y& Elsevier]

Abstract: This paper investigates the solution algorithms for the multi-criteria multi-modal shortest path problem (M-SPP), which belongs to the set of problems known as NP-hard, in urban transit network (UTN). The related M-SPP is one of the important and practical problems in several fields such as urban transportation system and freight transportation. The UTN is composed of multiple modes (e.g., automobile, bus, subway, light rail, pedestrian and so on). To get their destination, the passengers can alternate between different modes. As a special demand, the time-window is usually associated with the M-SPP. Because of the service time-limit of modes, the available modes at a stop are varied with the time. So the optimal M-SPP with arriving time-window cannot be simply obtained by finding the optimal M-SPP firstly and then reversely deducing the leaving time-window of the origin according to the arriving time-window of destination. In this paper, the M-SPP with arriving time-window is firstly proposed. To solve the multi-criteria M-SPPs (MM-SPP) with transfer delaying, an improved exact label correcting algorithm (LCA) is designed and, to solve the proposed MM-SPPs with both of transfer delaying and arriving time-window, an exact reverse LCA is designed. Finally, some computing examples are given to test the effectiveness of the designed algorithms. [Copyright &y& Elsevier]

Abstract: This paper studies a variation of domination in graphs called rainbow domination. For a positive integer , a -rainbow dominating function of a graph is a function such that for any vertex with . The -rainbow domination number of is the minimum value of , where runs over all -rainbow dominating functions of . A related concept is as follows. A weak -dominating function of is a function such that for any vertex with . The weak -domination number of is the minimum value of , where runs over all weak -dominating functions of . In this paper, we prove that for any strongly chordal graph . Our approach is a more general setting called the -function, which leads to interesting results on other variations of domination. We also give a linear-time algorithm for finding the weak -domination numbers of block graphs. [Copyright &y& Elsevier]

Abstract: The requirements of device under the multi-mission of monitoring, protecting, controlling and communicating is discussed in this paper to bring forward a design of dual CPU structure with ARM & DSP for microprocessor protection. Via the comparative analysis of several common algorithms, the algorithm of FFT, which can make the controlling of calculation accuracy easier and has a filter feature inherently, is selected to analyze the sampling data of protector and calculates relative electrical parameters. Relevant program is written for distance protection in 110kV transmissions, then debugging on software and hardware is made. The results show that the design of DSP & ARM based-microprocessor protection presented in this paper is feasible; such a device has simple and reliable circuit structure and is expandable in both software and hardware. [Copyright &y& Elsevier]

• A new CDC algorithm. • 6 indicators to evaluate the results. • 26 experiments had been conducted. A variety of algorithms have recently emerged in the field of cluster analysis. Consequently, based on the distribution nature of the data, an appropriate algorithm can be chosen for the purpose of clustering. It is difficult for a user to decide a priori which algorithm would be the most appropriate for a given dataset. Algorithms based on graphs provide good results for this task. However, these algorithms are vulnerable to outliers with limited information about edges contained in the tree to split a dataset. Thus, in several fields, the need for better clustering algorithms increases and for this reason utilizing robust and dynamic algorithms to improve and simplify the whole process of data clustering has become an urgent need. In this paper, we propose a novel distance-based clustering algorithm called the critical distance clustering algorithm. This algorithm depends on the Euclidean distance between data points and some basic mathematical statistics operations. The algorithm is simple, robust, and flexible; it works with quantitative data that are real-valued, not qualitative, and categorical with different dimensions. In this work, 26 experiments are conducted using different types of real and synthetic datasets taken from different fields. The results prove that the new algorithm outperforms some popular clustering algorithms such as MST-based clustering, K-means, and Dbscan. Moreover, the algorithm can precisely produce more reasonable clusters even when the dataset contains outliers and without specifying any parameters in advance. It also provides a number of indicators to evaluate the established clusters and prove the validity of the clustering. [ABSTRACT FROM AUTHOR]

Abstract An edge metric generator of a connected graph G is a vertex subset S for which every two distinct edges of G have distinct distance to some vertex of S , where the distance between a vertex v and an edge e is defined as the minimum of distances between v and the two endpoints of e in G. The smallest cardinality of an edge metric generator of G is the edge metric dimension, denoted by dim e (G). It follows that 1 ≤ dim e (G) ≤ n − 1 for any n -vertex graph G. A graph whose edge metric dimension achieves the upper bound is topful. In this paper, the structure of topful graphs is characterized, and many necessary and sufficient conditions for a graph to be topful are obtained. Using these results we design an O (n 3) time algorithm which determines whether a graph of order n is topful or not. Moreover, we describe and address an interesting class of topful graphs whose super graphs obtained by adding one edge are not topful. [ABSTRACT FROM AUTHOR]

Abstract: This paper introduces a new optimization algorithm - Election Campaign Optimization algorithm, which searches solution space by simulating the motivation of candidates in election campaign to the highest support. This algorithm is realized by Matlab language, and be encapsulated to the algorithm toolbox. The computational results of function in the toolbox show that ECO algorithm can search out the optimal solutions of optimization problems. In this paper, only 3 optimization functions and a PID controller parameters tuning problem are selected as example to exposit Election Campaign Optimization algorithm. [ABSTRACT FROM AUTHOR]

Abstract: Hardware/software (HW/SW) partitioning is one of the crucial steps of co-design systems. It determines which components of the systems are implemented in hardware and which ones are in software. In this paper the computing model is extended to cater for the path-based HW/SW partitioning with the fine granularity in which communication penalties between system components must be considered. On the new computing model an efficient heuristic algorithm is developed, in which both speedup in hardware and communication penalty are taken into account. In addition, an efficient tabu search algorithm is also customized in this paper to refine the approximate solutions produced by the heuristic algorithm. Simulation results show that the heuristic algorithm runs fast and is able to produce high-quality approximate solutions. Moreover, the tabu search algorithm can further refine them to nearly optimal solutions within an acceptable runtime. The difference between the approximate solutions and the optimal ones is bounded by 0.5%, and it hardly increases with the increase of the problem size. [Copyright &y& Elsevier]

Abstract: In this paper we consider a class of semi-infinite transportation problems. We develop an algorithm for this class of semi-infinite transportation problems. The algorithm is a primal dual method which is a generalization of the classical algorithm for finite transportation problems. The most important aspect of our paper is that we can prove the convergence result for the algorithm. Finally, we implement some examples to illustrate our algorithm. [Copyright &y& Elsevier]

Abstract: This paper introduces the non-idling machine constraint where no intermediate idle time between the operations processed by a machine is allowed. In its first part, the paper considers the non-idling single-machine scheduling problem. Complexity aspects are first discussed. The “Earliest Non-Idling” property is then introduced as a sufficient condition so that an algorithm solving the original problem also solves its non-idling variant. Moreover it is shown that preemptive problems do have that property. The critical times of an instance are then introduced and it is shown that when their number is polynomial, as for equal-length jobs, a polynomial algorithm solving the original problem has a polynomial variant solving its non-idling version. [Copyright &y& Elsevier]

Abstract: In this paper, we consider completely generalized nonlinear quasi-variational-like inclusions in Banach spaces and propose an Ishikawa type iterative algorithm for computing their approximate solutions by applying the new notion of -proximal mapping given in [R. Ahmad, A.H. Siddiqi, Z. Khan, Proximal point algorithm for generalized multi-valued nonlinear quasi-variational-like inclusions in Banach spaces, Appl. Math. Comput. 163 (2005) 295–308]. We prove that the approximate solutions obtained by the proposed algorithm converge to the exact solution of our quasi-variational-like inclusions. The results presented in this paper extend and improve the corresponding results of [R. Ahmad, A.H. Siddiqi, Z. Khan, Proximal point algorithm for generalized multi-valued nonlinear quasi-variational-like inclusions in Banach spaces, Appl. Math. Comput. 163 (2005) 295–308; X.P. Ding, F.Q. Xia, A new class of completely generalized quasi-variational inclusions in Banach spaces, J. Comput. Appl. Math. 147 (2002) 369–383; N.J. Huang, Generalized nonlinear variational inclusions with non-compact valued mappings, Appl. Math. Lett. 9(3) (1996) 25–29; A. Hassouni, A. Moudafi, A perturbed algorithm for variational inclusions, J. Math. Anal. Appl. 185(3) (1994) 706–712]. Some special cases are also discussed. [Copyright &y& Elsevier]

Abstract: The path-partition problem is to find a minimum number of vertex-disjoint paths that cover all vertices of a given graph. This paper studies the path-partition problem from an algorithmic point of view. As the Hamiltonian path problem is NP-complete for many classes of graphs, so is the path-partition problem. The main result of this paper is to present a linear-time algorithm for the path-partition problem in graphs whose blocks are complete graphs, cycles or complete bipartite graphs. [Copyright &y& Elsevier]

Complexly shaped curved surfaces in 3D are commonly encountered in modern materials science and engineering, primarily in the aeronautical, automotive, chemical and other industries. Very often such surfaces are multiply connected and defined by means of their triangulations; the quality of the latter is usually sufficient for rendering, but not for finite element analysis. In order to generate high quality quadrilateral meshes, the surfaces in particular have to be transformed into sets of simple-shaped domains, without internal openings. This paper describes a powerful method and an algorithm allowing transformation of multiply connected curved surfaces of arbitrary geometrical complexity into sets of simple domains. The developed method was implemented as a separate application and turned out to be a powerful practical tool for preprocessing of complex surfaces for consequent mesh generation, including 100% quadrilateral. The paper represents continuation of the authors research activities in that area, earlier completed for 2D cases and published in [Comput. Mater. Sci. 24 (2002) 481]. [Copyright &y& Elsevier]

Isometric subgraphs of hypercubes, or partial cubes as they are also called, are a rich class of graphs that include median graphs, subdivision graphs of complete graphs, and classes of graphs arising in mathematical chemistry and biology. In general, one can recognize whether a graph on n vertices and m edges is a partial cube in O(mn) steps, faster recognition algorithms are only known for median graphs. This paper exhibits classes of partial cubes that are not median graphs but can be recognized in O(m log n) steps. On the way relevant decomposition theorems for partial cubes are derived, one of them correcting an error in a previous paper (Eur. J. Combin. 19 (1998) 677). [Copyright &y& Elsevier]

There has been considerable research in join operation in relational databases. In this paper, we introduce the concept of web join for combining hyperlinked Web data. Web join is one of the web algebraic operator in our web warehousing system called Whoweda (WareHouse Of WEb DAta). Similar to its relational counterpart, it can be used to gather useful, composite information from two web tables. The significance of web join perhaps can be best realized when we wish to combine data from a Web site where some of the information in the Web site is no longer available due to changes to the site. A web join operation can be constraint-free or constraint-driven depending on the absence or presence of join conditions. In this paper, we focus our discussion on constraint-driven web join operation, i.e., web join operation in the presence of user-specified join conditions. Specifically, we discuss the syntax, semantics and algorithm of web join operator. [Copyright &y& Elsevier]

This paper presents a new algorithm for solving the general state function based flash problem. The algorithm uses the canonical variables to the state function to solve the equation of state. Doing so moves some of the complexity of the flash problem to the equation of state solver, effectively simplifying the phase-split problem. A two-phase example is described and examined over a wide range of temperature and pressure conditions. A multiphase (up to four-phase) mixture is used as a demonstration of the method for solving multiphase flash problems. It is demonstrated that the solution algorithm takes a similar CPU-time to that used for solving conventional flash problems. The proposed algorithm will help to robustly solve general, difficult flash problems commonly encountered in modern process and reservoir simulations. [ABSTRACT FROM AUTHOR]

Wind resource is one of the most promising renewable energy, which has become a suitable replacement for fossil fuels. Optimizing the transferring wind energy from a wind turbine is essential to obtain the maximum power output as other variables are uncontrollable. This paper presents four different optimization algorithms, namely ant lion optimization (ALO), whale optimization algorithm (WOA), particle swarm optimization (PSO), and crow search optimization (CSO), considering a hybrid decision-making model to compare the performances of wind energy optimization. In the first phase, the evolutionary algorithms are defined based on several factors to meet the need for wind energy based on volumetric and time reliability, reversibility, and vulnerability as well as evaluate optimized energy to the subscriber from the Gansu region. In the second phase, the ordinal priority approach (OPA) is coupled with VIseKriterijumska Optimizacija I Kompromisno Resenje (VIKOR) method to rank the evolutionary algorithms. Then, the results are compared with the absolute optimal response based on the nonlinear programming method obtained from GAMS software. The results demonstrate that an ALO outperforms other algorithms. The average accuracy of ALO is 92%. CSO is the least accurate with 55% of the absolute optimal response. ALO is found to be faster, more efficient, and achieved economy and reliability as compared to other optimization algorithms for solving the problem under consideration. It is shown that the applied models are robust, effective, and able to save costs. [ABSTRACT FROM AUTHOR]

This paper discusses a mathematical concept of language that models both artificial and natural languages and thus provides a framework for a unified language processing methodology. This concept of a language is regarded as a communication tool that allows language users to develop knowledges, while interacting with their universe of discourse, and to communicate with each other, while exchanging knowledges. Criteria for consistent usage of a language are established using a Galois connection between language syntax and language semantics. Solutions to ambiguity, paraphrase, attitude, and other problems concerning the relationship between syntax and semantics are addressed. A general schema for language specification is introduced and algorithms that perform language generation and language analysis are discussed as universal tools defined by the specification schema. Language transformations performed by various kinds of translators are examined and correctness criteria of these translators are defined using the language Galois connection.The paper is structured as follows: Section 1 introduces the framework and justifies the necessity of a unified methodology for language processing. Section 2 presents the mathematical concept of a language. Section 3 illustrates the mathematical concept of a language with three kinds of language structures: natural language, logical language, and programming language. Section 4 discusses the algebraic mechanism of language specification that unifies the methodology for language processing tool development. Section 5 formalizes the criterion for the consistency of the language usage, defines the architecture of a unified language processing system, and shows how the consistency criteria for language usage can be employed as correctness criteria for the algorithms performing various language transformations. [Copyright &y& Elsevier]

Harris Hawks Optimizer (HHO) is one of the many recent algorithms in the field of metaheuristics. The HHO algorithm mimics the cooperative behavior of Harris Hawks and their foraging behavior in nature called surprise pounce. HHO benefits from a small number of controlling parameters setting, simplicity of implementation, and a high level of exploration and exploitation. To alleviate the drawbacks of this algorithm, a modified version called Nonlinear based Chaotic Harris Hawks Optimization (NCHHO) is proposed in this paper. NCHHO uses chaotic and nonlinear control parameters to improve HHO's optimization performance. The main goal of using the chaotic maps in the proposed method is to improve the exploratory behavior of HHO. In addition, this paper introduces a nonlinear control parameter to adjust HHO's exploratory and exploitative behaviors. The proposed NCHHO algorithm shows an improved performance using a variety of chaotic maps that were implemented to identify the most effective one, and tested on several well-known benchmark functions. The paper also considers solving an Internet of Vehicles (IoV) optimization problem that showcases the applicability of NCHHO in solving large-scale, real-world problems. The results demonstrate that the NCHHO algorithm is very competitive, and often superior, compared to the other algorithms. In particular, NCHHO provides 92% better results in average to solve the uni-modal and multi-modal functions with problem dimension sizes of D = 30 and 50, whereas, with respect to the higher dimension problem, our proposed algorithm shows 100% consistent improvement with D = 100 and 1000 compared to other algorithms. In solving the IoV problem, the success rate was 62.5%, which is substantially better in comparison with the state-of-the-art algorithms. To this end, the proposed NCHHO algorithm in this paper demonstrates a promising method to be widely used by different applications, which brings benefits to industries and businesses in solving their optimization problems experienced daily , such as resource allocation, information retrieval, finding the optimal path for sending data over networks, path planning, and so many other applications. • Proposing an improved Harris Hawk Optimizer. • Chaotic map and nonlinear control parameters are used. • Several benchmark functions in a comprehensive comparative study. • Solving a case study in autonomous vehicles using the proposed algorithm. [ABSTRACT FROM AUTHOR]

Given a graph G = ( V , E ) of order n and maximum degree Δ , the NP -complete S - labeling problem consists in finding a labeling of G , i.e. a bijective mapping ϕ : V → { 1 , 2 … n } , such that SL ϕ ( G ) = ∑ u v ∈ E min { ϕ ( u ) , ϕ ( v ) } is minimized. In this paper, we study the S - labeling problem, with a particular focus on algorithmic issues. We first give intrinsic properties of optimal labelings, which will prove useful for our algorithmic study. We then provide lower bounds on SL ϕ ( G ) , together with a generic greedy algorithm, which collectively allow us to approximate the problem in several classes of graphs—in particular, we obtain constant approximation ratios for regular graphs and bounded degree graphs. We also show that deciding whether there exists a labeling ϕ of G such that SL ϕ ( G ) ≤ | E | + k is solvable in O ∗ ( 2 2 k ( 2 k ) ! ) time, thus fixed-parameterized tractable in k . We finally show that the S - Labeling problem is polynomial-time solvable for two classes of graphs, namely split graphs and (sets of) caterpillars. [ABSTRACT FROM AUTHOR]

Supply chain management is a multidisciplinary engineering problem. In this paper, a polymorphic uncertain equilibrium model (PUEM) is constructed to capture the joint maximization of the profits for the manufacturers and retailers in a supply chain network. To ensure applicability of the model in practice, the demand of the consumers is regarded as a continuous random variable, the holding cost of the retailer and the transaction cost between the manufacturer and retailer are described by fuzzy sets. For the PUEM, a deterministic equivalent formulation (DEF) is first derived by compromise programming approach such that the existing powerful algorithms in the standard smooth optimization are employed to find an approximate equilibrium point for the uncertain problem. Actually, the DEF turns out to be a nonlinear complementarity problem (NCP), a special variational inequality. Thus, a modified partially Jacobian smoothing algorithm is developed to solve the corresponding NCP, where the gradient information of the model is used to efficiently generate search direction. Sensitivity analysis offers a number of useful managerial implications based on practical applications of the model. [ABSTRACT FROM AUTHOR]

In this paper, an extended nonmonotone line search is proposed to improve the efficiency of the existing line searches. This line search is first proved to be an extension of the classical line search rules. On the one hand, under mild assumptions, global convergence and R-linear convergence are established for the new line search rule. On the other hand, by numerical experiments, it is shown that the line search can integrate the advantages of the existing methods in searching for a suitable step-size. Combined with the spectral step-size, a class of spectral gradient algorithms are developed and employed to solve a large number of benchmark test problems from CUTEst. Numerical results show that the new line search is promising in solving large-scale optimization problems, and outperforms the other similar ones as it is combined with a spectral gradient method. [ABSTRACT FROM AUTHOR]

This paper proposed a new algorithm inspired by the life of Killer Whale. A group of Killer Whale called Matriline that consist of a leader and members. The leader’s duty searches prey position and the optimum direction to chase the prey, meanwhile chase the prey is performed by the members. Optimum direction means minimum direction and maximum velocity. Global optimum is obtained by comparing the results of member’s actions. In this algorithm, if value of objective function of members more than leader, hence the leader must find out another new potential prey. In order to obtain the performance of proposed algorithm, it is necessary to test the new algorithm together with other algorithm using known mathematical function that available in Comparing Continuous Optimizers (COCO) especially Black Box Optimization Benchmarking (BBOB). Optimization results show that the performances of purposed algorithm has outperformed than others algorithms such as Genetic Algorithm (GA), Imperialist Competitive Algorithm (ICA) and Simulated Annealing (SA). [ABSTRACT FROM AUTHOR]

To solve, manage and analyze biological problems using computer technology is called bioinformatics. With the emergent evolution in computing era, the volume of biological data has increased significantly. These large amounts of data have increased the need to analyze it in reasonable space and time. DNA sequences contain basic information of species, and pattern matching between different species is an important and challenging issue to cope with. There exist generalized string matching and some specialized DNA pattern matching algorithms in the literature. There is still need to develop fast and space efficient pattern matching algorithms that consider new hardware development. In this paper, we present a novel DNA sequences pattern matching algorithm called EPMA. The proposed algorithm utilizes fixed length 2-bits binary encoding, segmentation and multi-threading. The idea is to find the pattern with multiple searcher agents concurrently. The proposed algorithm is validated with comparative experimental results. The results show that the new algorithm is a good candidate for DNA sequence pattern matching applications. The algorithm effectively utilizes modern hardware and will help researchers in the sequence alignment, short read error correction, phylogenetic inference etc. Furthermore, the proposed method can be extended to generalized string matching and their applications. [ABSTRACT FROM AUTHOR]

This paper briefly surveys the recent progress on visual perception algorithms and their corresponding hardware implementations for the emerging application of autonomous driving. In particular, vehicle and pedestrian detection, lane detection and drivable surface detection are presented as three important applications for visual perception. On the other hand, CPU, GPU, FPGA and ASIC are discussed as the major components to form an efficient hardware platform for real-time operation. Finally, several technical challenges are presented to motivate future research and development in the field. [ABSTRACT FROM AUTHOR]

In order to run a dataflow with as low cost as possible, it is often faced with deciding which data-sets in a data-set sequence should be stored, with the rest regenerated. The Intermediate Data-set Storage problem arises from this situation. The current best algorithm for this problem takes O ( n 4 ) time. In this paper, we present two improved algorithms for this problem, the first of which can achieve a time complexity O ( n 2 ) , the second of which O ( r n ) , where n is the number of data-sets in a dataflow, r is a numerical number which indicates how large it is for the maximum storage cost to be divided by the minimum computation cost in the dataflow. [ABSTRACT FROM AUTHOR]