Search

The article presents information on the publication of a book "Applied Statistics, Algorithms," relevant to statistics, by the Royal Statistical Society in cooperation with the Science Research Council's Working Party on Statistical Computing. A policy statement describing the editorial policy appears in "Applied Statistics," Vol. 1. No. 1 (1968). A support paper describing the expected contents of the external specification and making recommendation for the layout of algorithms and for programming strategy will appear in the following issue.

This paper investigates the problem of factor prime factorizations for n-D polynomial matrices and presents a criterion for the existence of factor prime factorizations for an important class of n-D polynomial matrices. As a by-product, we also obtain an algebraic algorithm to check n-D factor primeness in some important cases which partially solves the long-standing open problem of recognizing n-D factor prime matrices. Some problems related to the factorization methods are also studied. Several exam- pies are given to illustrate the results. The results presented in this paper are true over any coefficient field. [ABSTRACT FROM AUTHOR]

The Association for Computing Machinery (ACM) Press is pleased to announce that the Collected Algorithms from ACM (CALGO) is now available on acm.org. as of February 1997. Originally established in 1960 as the Algorithms Department in CACM, and then transfered to Transactions on Mathematical Software in 1975, CALGO is a collection of heavily used algorithms, either in original form or translated into other languages. Planned enhancements include a cumulative SHAR classification index and the full CALGO library in CD-ROM. Contact address for any information regarding CALGO has been provided.

This paper addresses the robust gradient learning (RGL) problem. Gradient learning models aim at learning the gradient vector of some target functions in supervised learning problems, which can be further used to applications, such as variable selection, coordinate covariance estimation, and supervised dimension reduction. However, existing GL models are not robust to outliers or heavy-tailed noise. This paper provides an RGL framework to address this problem in both regression and classification. This is achieved by introducing a robust regression loss function and proposing a robust classification loss. Moreover, our RGL algorithm works in an instance-based kernelized dictionary instead of some fixed reproducing kernel Hilbert space, which may provide more flexibility. To solve the proposed nonconvex model, a simple computational algorithm based on gradient descent is provided and the convergence of the proposed method is also analyzed. We then apply the proposed RGL model to applications, such as nonlinear variable selection and coordinate covariance estimation. The efficiency of our proposed model is verified on both synthetic and real data sets. [ABSTRACT FROM AUTHOR]

The article focuses on technological innovations that are resulting from research into origami. It states that origami has been described mathematically and modeled with computers, allowing engineers to create technologies that can be folded into a compact shape for transport. It mentions that each folded flap in origami uses a circular portion which allows engineers plan creases that will provide a desired shape. It comments that the folding algorithms are used in technological applications.

A recent study conducted at the University of California Riverside has developed an algorithm for searching optimal variance component estimators in linear mixed models. The study focuses on the estimation of variance components, which is crucial in data analysis based on a linear mixed model. The algorithm aims to derive strictly positive unbiased estimators with minimum variance by modifying the method-of-moments estimator using a class of square non-singular regularization matrices. The proposed method allows for the convenient study of the theoretical and numerical properties of the estimator, even in small samples. The research concludes by illustrating the use of the algorithm in two illustrative examples. [Extracted from the article]

This paper presents a new approach to blind source extraction from convolutive mixtures in multi-input multi-output (MIMO) channels. Two ill-conditioned cases are considered: the number of sensors is less than the number of sources and the number of sensors is greater than or equal to the number of sources but the system is noninvertible. Although there exist several works related to ill-conditioned dynamic MIMO channels, especially on blind channel identification, how to obtain a true source Only from observable convolutive mixtures is still an open problem. In this paper, beginning with introducing two blind ex- traction models for blind deconvolution in ill-conditioned MIMO channels, we discuss the extractability issue. Results from our extractability analysis (a necessary and sufficient condition) show that it is possible to extract individual sources from the outputs. Furthermore, all potentially separable sources (at most equal to the number of sensors) can be extracted sequentially based on these extraction models. A cost function based on cross cumulant is discussed along with the Gauss-Newton algorithm. Finally, a simulation example is presented for illustration. [ABSTRACT FROM AUTHOR]

The article presents the discussion on digital rights management (DRM). Topics include other form of rights management impeding their ability for pacifying the children; protecting content licensors' rights while giving purchasers, renters, and subscribers flexible and fair options for watching content; and containing content encryption and license generation.

In this paper, a power-area efficient geometry engine (GE) using a low-complexity three-level subdivision algorithm is presented. The proposed subdivision algorithm and architecture is capable of providing low complexity, high power-area efficiency, scalable and near-Phong shading quality. The forward difference, edge function recovery, dual space subdivision, triangle filtering, and triangle setup coefficient sharing schemes are employed to alleviate the redundant computation for the proposed algorithm. According to the low-complexity subdivision algorithm, one reconfigurable datapath is proposed to save the area since the same set of processing elements (PE) is reused for different operations of GE. Compared with the conventional subdivision algorithm, the proposed subdivision algorithm reduces the number of memory/register accesses for subdivision by 40% and 60.32% for level-1 and level-2 subdivision, respectively. In terms of the number of multiplications for transforms, the reduction can be attained by 27.5% and 60.27% for level-1 and level-2 subdivision, respectively. From the implementation results, the proposed GE can achieve the power-area efficiency of 518.8 Kvertices/(s\bulletmW\bulletmm^2) for level-1 subdivision. [ABSTRACT FROM PUBLISHER]

This article discusses a quicker method to multiply two whole numbers, devised by David Harvey of the University of New South Wales in Australia and Joris van der Hoeven at the Ecole Polytechnique in France. The author examines the impact of this method on computing algorithms and in the field of computational complexity theory.

Network utility maximization (NUM) problem formulations provide an important approach to conduct network resource allocation and to view layering as optimization decomposition. In the existing literature, distributed implementations are typically achieved by means of the so-called dual decomposition technique. However, the span of decomposition possibilities includes many other elements that, thus far, have not been fully exploited, such as the use of the primal decomposition technique, the versatile introduction of auxiliary variables, and the potential of multilevel decompositions. This paper presents a systematic framework to exploit alternative decomposition structures as a way to obtain different distributed algorithms, each with a different tradeoff among convergence speed, message passing amount and asymmetry, and distributed computation architecture. Several specific applications are considered to illustrate the proposed framework, including resource-constrained and direct-control rate allocation, and rate allocation among Q0S classes with multipath routing. For each of these applications, the associated generalized NUM formulation is first presented, followed by the development of novel alternative decompositions and numerical experiments on the resulting new distributed algorithms. A systematic enumeration and comparison of alternative vertical decompositions in the future will help complete a mathematical theory of network architectures. [ABSTRACT FROM AUTHOR]

In this paper, a novel optimization technique is proposed to optimize filter coefficients of linear phase finite-impulse response (FIR) filter to share common subexpressions within and among coefficients. Existing approaches of common subexpression elimination optimize digital filters in two stages: first, an FIR filter is designed in a discrete space such as finite wordlength space or signed power-of-two (SPT) space to meet a given specification; in the second stage, an optimization algorithm is applied on the discrete coefficients to find and eliminate the common subexpressions. Such a two-stage optimization technique suffers from the problem that the search space in the second stage is limited by the finite wordlength or SPT coefficients obtained in the first stage optimization. The new proposed algorithm overcomes this problem by optimizing the filter coefficients directly in subexpression space for a given specification. Numerical examples of benchmark filters show that the required number of adders obtained using the proposed algorithm is much less than those obtained using two-stage optimization approaches. [ABSTRACT FROM AUTHOR]

In this paper, a new spilt-radix fast Hartley transform (FHT) algorithm is proposed for computing the discrete Hartley transform (DHT) of an arbitrary length N = q * 2m, where q is an odd integer. The basic idea behind the proposed FHT algorithm is that a mixture of radix-2 and radix-S index maps is used in the decomposition of the DHT. This idea and the use of an efficient in- dexing process lead to a new decomposition different from that of the existing split-radix FHT algorithms, since the existing ones are all based on the use of a mixture of radix-2 and radix-4 index maps. The proposed algorithm reduces substantially the operations such as data transfer, address generation, and twiddle factor evaluation or access to the lookup table, which contribute significantly to the execution time of FHT algorithms. it is shown that the arithmetic complexity (multiplications+additions) of the proposed algorithm is, in almost all cases, the same as that of the existing split-radix FHT algorithm for length- q * 2m DHTs. Since the proposed algorithm is expressed in a simple matrix form, it facilitates an easy implementation of the algorithm, and allows for an extension to the multidimensional case. [ABSTRACT FROM AUTHOR]

In this paper, we present an efficient algorithm to compute singular points and singularity-induced bifurcation points of differential-algebraic equations for a multimachine power-system model Power systems are often modeled as a set of differential-algebraic equations (DAE) whose algebraic part brings singularity issues into dynamic stability assessment of power systems. Roughly speaking, the singular points are points that satisfy the algebraic equations, but at which the vector field is not defined. In terms of power-system dynamics, around singular points, the generator angles (the natural states variables) are not defined as a graph of the load bus variables (the algebraic variables). Thus, the causal requirement of the DAE model breaks down and it cannot predict system behavior. Singular points constitute important organizing elements of power-system DAE models. This paper proposes an iterative method to compute singular points at any given parameter value. With a lemma presented in this paper, we are also able to locate singularity induced bifurcation points upon identifying the singular points. The proposed method is implemented into voltage stability toolbox and simulations results are presented for a 5-bus and IEEE 118-bus systems. [ABSTRACT FROM AUTHOR]

Keywords: Beijing; People's Republic of China; Asia; Mathematics; Algorithms; Bone Research; Health and Medicine EN Beijing People's Republic of China Asia Mathematics Algorithms Bone Research Health and Medicine 2296 2296 1 08/07/23 20230811 NES 230811 2023 AUG 11 (NewsRx) -- By a News Reporter-Staff News Editor at Health & Medicine Week -- Researchers detail new data in Mathematics. Beijing, People's Republic of China, Asia, Mathematics, Algorithms, Bone Research, Health and Medicine. [Extracted from the article]

Purpose Ordinary differential equations (ODEs) are widely used in the engineering curriculum. They model a spectrum of interesting physical problems that arise in engineering disciplines. Studies of different types of ODEs are determined by engineering applications. Various techniques are used to solve practical differential equations problems. This paper aims to present a computational tool or a computer-assisted technique aimed at tackling ODEs. This method is usually not taught and/or not accessible to undergraduate students. The aim of this strategy is to help the readers to develop an effective and relatively novel problem-solving skill. Because of the drudgery of hand computations involved, the method requires the need to use computers packages. In this work, the successive differentiation method (SDM) for solving linear and nonlinear and homogeneous or non-homogeneous ODEs is presented. The algorithm uses the successive differentiation of any given ODE to determine the values of the function’s derivatives at a single point, mostly x = 0. The obtained values are used to construct the Taylor series of the solution of the examined ODE. The algorithm does not require any new assumption, hence handles the problem in a direct manner. The power of the method is emphasized by testing a variety of models with distinct orders, with constant and variable coefficients. Most of the symbolic and numerical computations can be carried out using computer algebra systems.Design/methodology/approach This study presents a computational tool or a computer-assisted technique aimed at tackling ODEs. This method is usually not taught and/or not accessible to undergraduate students. The aim of this strategy is to help the readers to develop an effective and relatively novel problem-solving skill. Because of the drudgery of hand computations involved, the method requires the need to use computers packages.Findings This method is applied to a variety of well-known equations, such as the Bernoulli equation, the Riccati equation, the Abel equation and the second-order Euler equation, some with constant and variable coefficients. SDM handles linear and nonlinear and homogeneous or nonhomogeneous ODEs in a direct manner without any need to restrictive conditions. The method works effectively to the Volterra integral equations, as will be discussed in a coming work.Originality/value The method can be extended to a wide range of engineering problems that are modeled by differential equations. The method is simple and novel and highly accurate. [ABSTRACT FROM AUTHOR]

The article reports on finding all subgraphs of an undirected graph [H]. A maximal complete subgraph is also called clique which refers to a complete subgraph that is not included in any other complete subgraph. According to the authors, a research paper was released wherein descriptions of techniques to find maximal complete subgraphs are provided. The authors discussed two algorithms using a branch-and-bound technique so that there will be no clique. The first algorithm produces cliques in lexicographic order while the second is derived from the first algorithm.

Chongqing, People's Republic of China, Asia, Mathematics, Algorithms, Brain, Central Nervous System, Cerebrum, Health and Medicine, Telencephalon Keywords: Chongqing; People's Republic of China; Asia; Mathematics; Algorithms; Brain; Central Nervous System; Cerebrum; Health and Medicine; Telencephalon EN Chongqing People's Republic of China Asia Mathematics Algorithms Brain Central Nervous System Cerebrum Health and Medicine Telencephalon 1137 1137 1 04/10/23 20230414 NES 230414 2023 APR 14 (NewsRx) -- By a News Reporter-Staff News Editor at Health & Medicine Week -- Investigators publish new report on Mathematics. [Extracted from the article]

Neely has discussed computational error generated by some algorithms used to compute various statistics. In the present paper methods are described which are error-free, simple in concept, and usually less costly in machine time than those mentioned by Neely. [ABSTRACT FROM AUTHOR]

A recent report from Universiti Malaya discusses research on cancer treatment using optimal control supported by swarm intelligence. The study aims to develop hybrid techniques that combine optimal control theory with evolutionary algorithms and multi-objective swarm algorithms to reduce cancerous cells while minimizing the use of chemotherapy medications and toxicity. Two hybrid techniques were proposed and evaluated, with MOEA/D emerging as the most effective algorithm in reducing tumor size and cancer drug concentration. The study highlights the importance of integrating optimal control theory and evolutionary algorithms for optimizing cancer chemotherapy treatment. [Extracted from the article]

Purpose – The purpose of this paper is to present a weighted algorithm based on the homotopy perturbation method for solving the heat transfer equation in the cast-mould heterogeneous domain. Design/methodology/approach – A weighted algorithm based on the homotopy perturbation method is used to minimize the volume of computations. The authors show that this technique yields the analytical solution of the desired problem in the form of a rapidly convergent series with easily computable components. Findings – The authors illustrate that the proposed method produces satisfactory results with respect to Adomian decomposition method and standard homotopy perturbation method. The reliability of the method and the reduction in the size of computational domain give this method a wider applicability. Originality/value – This research presents, for the first time, a new modification of the proposed technique, for aforementioned problems and some interesting results are obtained. [ABSTRACT FROM AUTHOR]

Cascaded Diophantine Frequency Synthesis' (CDFS) is an approach to high-resolution frequency synthesis based on the mathematical properties of integer numbers and Diophantine equations. CDFS can be implemented using two or more phase- locked loops (PLLs) and frequency mixing stages in a cascade topology. CDFS achieves frequency resolution arbitrarily finer than that of the constituent PLLs while maintaining their loop bandwidths and frequency hopping agility. CDFS results in inter- mediate signals with minimal frequency ranges in all frequency mixing stages, allowing for improved spectral purity and lower design complexity compared to the parallel form of its predecessor, Diophantine Frequency Synthesis (DFS). CDFS architectures are modularly structured and expandable. The paper introduces CDFS focusing on the mathematical and algorithmic aspects. [ABSTRACT FROM AUTHOR]

This paper introduces a tightly coupled topographic sensor-processor and digital signal processor (DSP) architecture for real-time visual multitarget tracking (MTT) applications. We define real-time visual MTT as the task of tracking targets contained in an input image flow at a sampling-rate that is higher than the speed of the fastest maneuvers that the targets make. We utilize a sensor-processor based on the cellular neural network universal machine architecture that permits the offloading of the main image processing tasks from the DSP and introduces opportunities for sensor adaptation based on the tracking performance feedback from the DSP. To achieve robustness, the image processing algorithms running on the sensor borrow ideas from biological systems: the input is processed in different parallel channels (spatial, spatio-temporal and temporal) and the interaction of these channels generates the measurements for the digital tracking algorithms. These algorithms (running on the DSP) are responsible for distance calculation, state estimation, data association and track maintenance. The performance of the proposed system is studied using actual hardware for different video flows containing rapidly moving maneuvering targets. [ABSTRACT FROM AUTHOR]

This paper presents a new technique for the passivity enforcement of linear time-invariant multiport systems in state- space form. This technique is based on a study of the spectral properties of related Hamiltonian matrices. The formulation is applicable in case the system input-output transfer function is in admittance, impedance, hybrid, or scattering form. A standard test for passivity is first performed by checking the existence of imaginary eigenvalues of the associated Hamiltonian matrix. In the presence of imaginary eigenvalues the system is not passive. In such a case, a new result based on first-order perturbation theory is presented for the precise characterization of the frequency bands where passivity violations occur. This characterization is then used for the design of an iterative perturbation scheme of the state matrices, aimed at the displacement of the imaginary eigenvalues of the Hamiltonian matrix. The result is an effective algorithm leading to the compensation of the passivity violations. This procedure is very efficient when the passivity violations are small, so that first-order perturbation is applicable. Several examples illustrate and validate the procedure. [ABSTRACT FROM AUTHOR]

In order to solve the problem that previous relation researches in operational task-resource matching are hard to flexible computing for generating a new matching scheme from the existing scheme under the condition of operational tasks or resources adjusted in uncertainty cases, role-based approaches to operational task-resource flexible matching model and algorithm are proposed in the paper for flexible matching operational tasks with resources. Firstly, through introducing the concept of roles, the role-based calculation framework of operational task-resource flexible matching is constructed. Secondly, two aspect indexes about resource utilization ratio (RUR) and time utilization ratio (TUR) are given to reflect operational task-resource matching quality (TRMQ), which can be regarded as the objective function for modeling role-based operational task-resource flexible matching mathematical formulation. On the basis of this, the role-based artificial bee colony (RABC) algorithm, including five specific calculating operators, is put forward for solving the flexible matching problem with double encoding on operational tasks and resources by roles. Finally, via comparing with the previous methods in application cases, it can be validated that role-based model and proposed algorithm are more effective, which can be used to obtain a new incremental scheme from the existing matching scheme for adopting the operational tasks or resources adjustment. Moreover, there are flexible computation advantages of the approaches proposed in this paper to solve the problem about operational task-resource matching in large-scale. [ABSTRACT FROM AUTHOR]

This paper describes an alternate method for summing a set of floating-point numbers. Comparison of the error bound for this method with that of the standard summation method shows that it is considerably less sensitive to propagation of round-off error. [ABSTRACT FROM AUTHOR]

Keywords: Algorithms; Bone Research; Health and Medicine; Mathematics EN Algorithms Bone Research Health and Medicine Mathematics 6668 6668 1 08/14/23 20230818 NES 230818 2023 AUG 18 (NewsRx) -- By a News Reporter-Staff News Editor at Health & Medicine Week -- Investigators publish new report on mathematics. Algorithms, Bone Research, Health and Medicine, Mathematics. [Extracted from the article]

This paper presents a large-scale computationally intensive model for understanding the dynamic strategic evolution of electricity-generating asset portfolios in response to various market interventions, and the consequent longer-term effects of [...]

Abstract The study of properties of gradual evaluation methods in argumentation has received increasing attention in recent years, with studies devoted to various classes of frameworks/ methods leading to conceptually similar but formally distinct properties in different contexts. In this paper we provide a novel systematic analysis for this research landscape by making three main contributions. First, we identify groups of conceptually related properties in the literature, which can be regarded as based on common patterns and, using these patterns, we evidence that many further novel properties can be considered. Then, we provide a simplifying and unifying perspective for these groups of properties by showing that they are all implied by novel parametric principles of (either strict or non-strict) balance and monotonicity. Finally, we show that (instances of) these principles (and thus the group, literature and novel properties that they imply) are satisfied by several quantitative argumentation formalisms in the literature, thus confirming the principles' general validity and utility to support a compact, yet comprehensive, analysis of properties of gradual argumentation. [ABSTRACT FROM AUTHOR]

This paper studies the rendezvous strategy for a group of unicycle systems with connectivity preservation and collision avoidance. Based on the method of potential functions, a novel distributed control algorithm is proposed for all unicycles. By tuning the design parameters, the unicycles finally aggregate so that the average of the distances is bounded by a pre-specified positive number. It is proved that the connectivity of a minimum spanning tree in the initial topology is guaranteed. The result is then extended to multiple unicycles with heterogenous input disturbances. Potential function is further modified to handle the disturbances. Illustrative example is presented to show the improvements and effectiveness of the proposed controller. [ABSTRACT FROM AUTHOR]

In this paper, we propose a fast algorithm for sign- extraction of a number given in the Residue Number System (2n - 1, 2n, 2n + 1). The algorithm can be implemented using three n-bit wide additions, two of which can be done in parallel. It can be used in a wide variety of problems, i.e., in algorithms for dividing numbers in the RNS, or in evaluating the sign of determinant in computational geometry, etc. [ABSTRACT FROM AUTHOR]

Purpose - The paper seeks to provide an adaptive fuzzy logic controller for permanent magnet synchronous motor (PMSM) under direct torque control (DTC) algorithm to minimize the torque ripple. Design/methodology/approach - The design methodology is based on vector control analysis. MATLAB simulations supported with experimental study under C++ are used to execute the proposed work. Findings - The results show that considerable torque ripple reduction as well as considerable current ripple reduction can be achieved by utilizing adaptive fuzzy switching algorithm to fire the inverter supplying the PMSM. Research limitations/implications - This research is limited to PMSM, however the research can be extended to include other AC motors as well. In addition, the following points can be studied, the effects of harmonics in control signals on the torque ripple. Digital and active filters as solution to these harmonics can be also addressed. The actual mathematical relation between the torque ripple and flux ripple can be studied to set the flux and torque bands width in reasonable value. Practical implications - Based on existence DTC control system, it is only required to change the software-switching algorithm, to provide smooth torque, given that the switching frequency of the inverter module is more than or equal to 15?kHz and the system is supplied with timers. In addition, a relatively higher DC voltage may be required to achieve higher speed compared with the traditional DTC. Originality/value - In this paper, the stator flux position, and errors due to deviations from reference values of the torque and stator flux are used to select two active vectors while at the same time the absolute value of the torque error and the stator flux position are fuzzified to adapt the switching of the inverter in order to control the applied average voltage level in such a way as to minimize the torque ripple, so instead of fixed time table structure, a fuzzy logic is used to calculate the switching time for the selected vectors and no PI controller is used as the case in the traditional-space vector modulation. This work is directed to motor drive system designers who seek highly smooth torque performance with fast response. [ABSTRACT FROM AUTHOR]

Investigates the efficacy of algorithm for the assignment of instruction addresses and formats. Conditions for the presentation of algorithm; Suitability of the algorithm for arbitrary program structure; Existence of optimality criterion implying preferential choices subjects to the addressing constraints.

Gambling has provided centuries of inspiration to probabilists and statisticians. The process continues. There also exist fundamental links between betting and a newer subject, Information Theory, which began with Claude Shannon and his ground-breaking 1948 paper A Mathematical Theory of Communication. It is a result which arises very naturally. A successful gambler and a successful data compression algorithm must both accurately estimate probability distributions. There are practical results as well as theoretical: Shannon and colleagues, including the legendary gambler and mathematician Edward Thorp, actually attempted to apply results from information theory in Las Vegas casinos and stock market transactions. Oliver Johnson examines the connections. [ABSTRACT FROM AUTHOR]

Our news reporters obtained a quote from the research from University of Vigo: "As a consequence, it is necessary to shorten the time spent in locating and reconstructing the atheroma plaque that can be developed in an artery. Keywords: Algorithms; Angiology; Health and Medicine; Intravascular; Mathematics EN Algorithms Angiology Health and Medicine Intravascular Mathematics 6249 6249 1 03/23/23 20230303 NES 230303 2023 MAR 3 (NewsRx) -- By a News Reporter-Staff News Editor at Health & Medicine Week -- Investigators discuss new findings in mathematics. [Extracted from the article]

In this paper, we focus on optimal H 2 model reduction methods for bilinear systems. The optimal H 2 model reduction problem can be viewed as a minimization problem on Grassmann manifold. By utilizing the geometry of Grassmann manifold, a gradient descent model reduction algorithm and a conjugate gradient model reduction algorithm based on Grassmann manifold are given. These two algorithms can simulate well the behavior of the original system and the order-reduced systems generated by our algorithms can satisfy the minimal stability requirement. Numerical examples are given to illustrate the effectiveness of our methods. [ABSTRACT FROM AUTHOR]

Researchers at Fuzhou University in the People's Republic of China have developed an improved optimal foraging algorithm (OFA) for global optimization. The OFA is a swarm-based algorithm inspired by animal behavioral ecology theory. The researchers introduced a new algorithm called QOS-OFA, which incorporates quasi-opposition-based learning, an efficient cosine-based scale factor, and a search strategy with social behavior. The QOS-OFA was compared to seven other meta-heuristic algorithms and performed better on most test problems. This research has been peer-reviewed and published in the journal Computing. [Extracted from the article]

A recent study conducted by researchers at Tianjin University in China has developed a blind watermarking scheme for copyright protection of medical and non-medical images. The scheme utilizes the QZ algorithm to embed the watermark into the host image, rather than using an addition-based process. The researchers found that their scheme was robust against various image-processing attacks and forgery attacks, while maintaining good invisibility. The study concluded that the proposed scheme outperformed existing addition-based schemes in terms of robustness. This research has been peer-reviewed and published in Expert Systems with Applications. [Extracted from the article]

A recent report from Brunel University London explores the biases present in Human Resource (HR) algorithms and their impact on HR systems and decisions. The study highlights how biases can become entrenched in HR algorithms, which are often designed without consultation with HR specialists and assumed to operate with scientific objectivity. The researchers propose a methodology for algorithmic hygiene to address bias in HR algorithms. This research has been peer-reviewed and is published in the Human Resource Management Journal. [Extracted from the article]

A recent report from Tel Aviv University discusses the use of algorithmic filtering on social media platforms (SMPs) and its potential impact on user decision-making. The researchers highlight the negative effects of algorithmic filtering, such as biasing individual decisions and shaping societal beliefs. They propose a mathematical framework for online social media auditing to regulate algorithmic filtering and ensure its effects do not deflect users' beliefs over time. This framework can be used by external regulators or SMPs for self-auditing. The research was supported by the Israel Science Foundation and has been peer-reviewed. [Extracted from the article]

A study conducted by researchers at Guangxi University for Nationalities in Nanning, China, has developed a new algorithm called the elite opposition-based bare bones mayfly algorithm (EOBBMA) to optimize wireless sensor networks (WSNs) coverage. WSNs are composed of sensor nodes that monitor environmental conditions and collect data. The EOBBMA algorithm aims to maximize coverage area, minimize redundant area, and minimize moving distance. Experimental results showed that the coverage rate of the sensor deployment scheme obtained by EOBBMA was over 85%, with the highest coverage reaching 99.6%. The research concluded that EOBBMA outperformed other algorithms in terms of WSNs coverage problem. [Extracted from the article]

Researchers at Chiang Mai University in Thailand have developed a new mathematical algorithm for image deblurring and predicting diabetes mellitus. The algorithm uses two inertial terms to accelerate convergence speed and includes a linesearch rule for split variational inclusion in real Hilbert spaces. The research has been peer-reviewed and published in the Carpathian Journal of Mathematics. This study was funded by Chiang Mai University, CMU Proactive Researcher, Thailand Science Research and Innovation Fund, and the University of Phayao. [Extracted from the article]

A recent study conducted by researchers at Hebei University of Technology in Tianjin, China, addresses the problem of home health care routing and scheduling in a pandemic environment. The study focuses on assigning caregivers to patients and optimizing caregiver routes while minimizing travel costs, workload differences, and negative patient preferences. The researchers propose a customized algorithm called AMOALNS, which combines archived multi-objective simulated annealing with adaptive large neighborhood search. The algorithm generates new solutions iteratively and employs a multi-objective optimization framework. The study concludes that minimizing travel costs is the most challenging objective, while optimizing workload balancing is worthwhile. Sensitivity analyses show that time windows classifications and instance sizes significantly impact the compromising solutions. [Extracted from the article]

A recent study by researchers at the University of Pennsylvania School of Medicine has examined the role of health care algorithms in perpetuating racial and ethnic disparities. The study found that removing race from a kidney function algorithm had unintended consequences, such as reducing chemotherapy access and eligibility for clinical trials for Black patients. The researchers emphasized the importance of intentionality in algorithm development and suggested strategies to mitigate disparities, including using non-race variables and refining algorithms to minimize disparities across groups. The study highlights the need for transparency and a race-aware approach in algorithm development to promote health care equity. [Extracted from the article]

Researchers from Gannan Normal University in Jiangxi, China have published a new report on the use of supercritical carbon dioxide in biotechnology. The researchers developed a multi-scale computational model called CADPPD-EA, which simulates the dissolution behavior of supercritical carbon dioxide in polymer fluids. The model showed good computational effects and outperformed similar models in terms of accuracy, efficiency, and correlation. The researchers believe that the CADPPD-EA model can be applied in various fields such as chemical engineering, material energy, biomedicine, and computer science. [Extracted from the article]

A report from Xuzhou University of Technology in China discusses the use of mathematical models to predict the impact of regional return to work after an epidemic. The researchers propose a multistage mixed integer programming model for humanitarian logistics and transport resources, specifically focusing on the distribution and delivery of medicine resources in a cost-effective and efficient manner. The proposed model is solved using a Benders decomposition algorithm, and two case studies are used to validate the model and algorithm. The research concludes that the model and algorithm are effective in solving the dynamic medicine demand information in humanitarian relief situations. [Extracted from the article]