Minimum Number Of Steps Research Articles

О субоптимальном решении задачи быстродействия для линейной дискретной системы в случае несимметричных ограничений на управления

<p>The paper considers a linear discrete system with bounded control. The speed-in-action problem is solved for the system, that is, it is required to construct a control process that transfers the system from the initial state to the origin in a minimum number of steps. If the set of acceptable control values has a superellipse structure, then the problem of calculating optimal control can be reduced to solving a system of algebraic equations. A superellipsoidal approximation method has been developed for sets of arbitrary structure, and the case of asymmetric sets has been considered. Examples are given.</p>

Improved vectors for retron-mediated CRISPR-Cas9 genome editing in Saccharomyces cerevisiae.

In vivo site-directed mutagenesis is a powerful genetic tool for testing the effects of specific alleles in their normal genomic context. While the budding yeast Saccharomyces cerevisiae possesses classical tools for site-directed mutagenesis, more efficient recent CRISPR-based approaches use Cas 'cutting' combined with homologous recombination of a 'repair' template that introduces the desired edit. However, current approaches are limited for fully prototrophic yeast strains, and rely on relatively low efficiency cloning of short gRNAs. We were thus motivated to simplify the process by combining the gRNA and its cognate repair template in cis on a single oligonucleotide. Moreover, we wished to take advantage of a new approach that uses an E. coli retron (EcRT) to amplify repair templates as multi-copy single-stranded (ms)DNA in vivo , which are more efficient templates for homologous recombination. To this end, we have created a set of plasmids that express Cas9-EcRT, allowing for co-transformation with the gRNA-repair template plasmid in a single step. Our suite of plasmids contains different antibiotic (Nat, Hyg, Kan) or auxotrophic ( HIS3, URA3 ) selectable markers, allowing for editing of fully prototrophic wild yeast strains. In addition to classic galactose induction, we generated a β-estradiol-inducible version of each plasmid to facilitate editing in yeast strains that grow poorly on galactose. The plasmid-based system results in >95% editing efficiencies for point mutations and >50% efficiencies for markerless deletions, in a minimum number of steps and time. We provide a detailed step-by-step guide for how to use this system.

Yellow mustard gum: pilot-scale production and characterization.

Yellow mustard gum (YMG), which is extracted from the mucilaginous part of yellow mustard bran, has been considered an emerging natural hydrocolloid gum but lacks commercial development and production. To promote the commercial utilization of YMG, this study developed a pilot-scale YMG production protocol in an economic and environmentally friendly way to produce a clean-label YMG product. This YMG produced at pilot scale (YMW) was characterized in terms of chemical composition, rheological properties, and interaction with a commercial gum, κ-carrageenan, and was compared with purified YMG through ethanol precipitation (YME). The protocol processed up to 100 L of raw material with zero solvent and a minimal number of steps and showed strong quasi-industrial potential. The YMW showed a similar chemical composition as YME. However, the YMW contained a slightly lower amount of carbohydrate and a much larger amount of ash and potassium than the YME. The rheological results concluded that both the YMW and YME solutions exhibited shear-thinning flow behavior and a weak gel, with YME showing higher viscosity and stronger gel structure. Most interestingly, YMW could form unpourable gels when blended with native κ-carrageenan whereas YME barely achieved this despite the equivalent total gum concentration. This study demonstrated the feasibility of YMG production at a large scale with economic and green procedures and discovered its new functionality for commercial utilization. The gelling ability of YMG could provide it with wider applications as a result of a new potential synergistic combination. All this information should accelerate the process of full commercialization of YMG as a clean-label functional ingredient. © 2024 His Majesty the King in Right of Canada. Journal of The Science of Food and Agriculture © 2024 Society of Chemical Industry. Reproduced with the permission of the Minister of Agriculture and Agri-Food Canada.

Evaluation of the optimal number of steps to obtain reliable running spatio-temporal parameters and their variability

BackgroundSpatio-temporal running parameters and their variability help to determine a runner's running style. However, determining whether a change is due to the measurement or to a specific condition such as an injury is a matter of debate, as no recommendation on the number of steps required to obtain reliable assessments exists. Research questionWhat is the optimal number of steps required to measure different spatio-temporal parameters and study their variability at different running speeds? MethodsTwenty-five runners performed three experimental sessions of three bouts of treadmill running at 8, 10 and 12 km/h separated by 24 h. We measured cadence, stride, step, contact and flight time. We calculated the duty factor and the leg stiffness index (Kleg). Mean spatio-temporal parameters and linear (coefficient of variation, standard deviation) and non-linear (Higuchi fractal index, α1 coefficient of detrended fluctuation analysis) analyses were computed for different numbers of steps. Relative reliability was determined using the intraclass coefficient correlation. The minimal number of steps which present a good reliability level was considered as the optimal number of steps for measurement. Absolute reliability was assessed by calculating minimal detectable change. ResultsTo assess the mean values of spatio-temporal running parameters, between 16 and 150 steps were required. We were unable to obtain an optimal number of steps for cadence, stride and step-time variabilities for all speeds. For the linear analyses, we deduced the optimal number of steps for Kleg and the contact time (around 350 steps). Non-linear analyses measurements required between 350 and 540 steps, depending on the parameter. SignificanceResearchers and clinicians should optimize experimental conditions (number of steps and running speed) depending on the parameter or the variability analysis targeted. Future studies must use absolute reliability metrics to report changes in response to a specific condition with no bias due to measurement error.

A digital distance on the kisrhombille tiling.

The kisrhombille tiling is the dual tessellation of one of the semi-regular tessellations. It consists of right-angled triangle tiles with 12 different orientations. An adequate coordinate system for the tiles of the grid has been defined that allows a formal description of the grid. In this paper, two tiles are considered to be neighbors if they share at least one point in their boundary. Paths are sequences of tiles such that any two consecutive tiles are neighbors. The digital distance is defined as the minimum number of steps in a path between the tiles, and the distance formula is proven through constructing minimum paths. In fact, the distance between triangles is almost twice the hexagonal distance of their embedding hexagons.

Characterization of $ Q $ graph by the burning number

<abstract><p>The burning number $ b(G) $ of a graph $ G $, introduced by Bonato, is the minimum number of steps to burn the graph, which is a model for the spread of influence in social networks. In 2016, Bonato et al. studied the burning number of paths and cycles, and based on these results, they proposed a conjecture on the upper bound for the burning number. In this paper, we determine the exact value of the burning number of $ Q $ graphs and confirm this conjecture for $ Q $ graph. Following this, we characterize the single tail and double tails $ Q $ graph in term of their burning number, respectively.</p></abstract>

Sample-Efficient Hyperparameter Optimization of an Aim Point Controller for Solar Tower Power Plants by Bayesian Optimization

This work introduces a sample-efficient algorithm to optimize the control parameters of an aim point controller for solar power tower plants. Optimizing the control parameters increases the performance of the aim point controller, and thus the efficiency of the plant. However, optimizing the parameters in simulation will not yield the true optimal parameters at the real plant due to mismatches between simulation and reality. Thus, optimization must be done at the real tower to find a true optimum. As this can be time consuming and costly, the optimizer should require a minimum number of steps. Hence, a sample-efficient optimization strategy is needed. This work introduces a new algorithm based on Bayesian Optimization (BO), which leverages multiple sets of simulation data to accelerate the optimization. The algorithm is tested on a six-dimensional test function representing an arbitrary aim point controller. The proposed algorithm outperformed standard Bayesian Optimization by reaching near optimal parameter configurations of 95% accuracy within 33% less optimization steps. In a second test, the proposed algorithm is used to optimize a simulated Vant-Hull aim point controller with two hyperparameters. Here, the algorithm also needs 33% less optimization iterations than the standard BO.

Impedimetric DNA Sensors for Epirubicin Detection Based on Polythionine Films Electropolymerized from Deep Eutectic Solvent.

An electrochemically active polymer, polythionine (PTN), was synthesized in natural deep eutectic solvent (NADES) via multiple potential scans and characterized using cyclic voltammetry and electrochemical impedance spectroscopy (EIS). NADES consists of citric acid monohydrate, glucose, and water mixed in the molar ratio of 1:1:6. Electrodeposited PTN film was then applied for the electrostatic accumulation of DNA from salmon sperm and used for the sensitive detection of the anticancer drug epirubicin. Its reaction with DNA resulted in regular changes in the EIS parameters that made it possible to determine 1.0-100 µM of epirubicin with the limit of detection (LOD) of 0.3 µM. The DNA sensor developed was successfully applied for the detection of epirubicin in spiked samples of artificial and natural urine and saliva, with recovery ranging from 90 to 109%. The protocol of the DNA sensor assembling utilized only one drop of reactants and was performed with a minimal number of steps. Together with a simple measurement protocol requiring 100 µL of the sample, this offers good opportunities for the further use of the DNA sensor in monitoring the drug level in biological samples, which is necessary in oncology treatment and for the pharmacokinetics studies of new antitumor drugs.

Ring‐Rearrangement Metathesis Approach to Fused [5/5/6/5/5] and [6/5/5/5/5/6] Carbocyclic Derivatives.

AbstractHere, we have developed a simple synthetic approach towards synthesis of [5/6/5] and [5/5/5] fused carbocyclic frameworks from bis‐adducts of norbornadiene and cyclohexadiene derivatives with 1,2,3,4‐tetrachloro‐5,5‐dimethoxycyclopentadiene by employing atom‐economic ring‐rearrangement metathesis as a key step and these ring systems are core units in natural products. Here, we have designed highly congested polycyclic frameworks and introduced molecular complexity in a minimum number of steps. These targets contain up to seven stereo centres. Hence, this strategy can be used to design many different drug‐like molecules valuable in medicinal chemistry.

Burning number of Jahangir graphs

In this study, graph burning, a deterministic discrete time graph process that can be interpreted as a model for spreading influence in social networks, is considered. The minimum number of steps in a graph-burning process is called the burning number of that graph. Intrinsically, the burning number of the Jahangir graph was examined, and then the path forests whose vertices are already burned were studied. As a result, the burning numbers of cycles with a single chord and theta graphs were obtained.

Суперэллипсоидальные аппроксимации в задаче быстродействия для двумерной линейной дискретной системы с ограниченным управлением

<p>The paper considers a two-dimensional linear discrete system with bounded control. For the system, the problem of speed is solved, that is, the construction of a control process that transfers the system from the initial state to the origin in the minimum number of steps. If the set of acceptable control values has a superellipse structure, then the problem of calculating optimal control can be reduced to solving a system of algebraic equations. A superellipsoidal approximation method has been developed for sets of arbitrary structure. Examples are considered in the paper.</p>

Selection of activators in finding the burning number

Graph burning is a model for spread of information in a network. In recent times social networks play a major role in the thought process of people and influences the social movements, election and politics. The burning number is an ideal model to calculate the speed at which information is passed throughout the network. The burning number is a number which burns a graph in minimum number of steps. In this paper, a hybrid algorithm is proposed to compute the burning number of network graph based on selection of activators. The algorithm uses spanning tree, weighted centrality and uses a vertex set that are edge connected with previously burnt set. The network graph used were ca-sandiauths, ca-netscience, dolphin and mahindas. A significant improvement was found in the process of finding minimum burning number of the graph.

Strong bounds and exact solutions to the minimum broadcast time problem

AbstractGiven a graph and a subset of its nodes, referred to as source nodes, the minimum broadcast time problem asks for the minimum number of steps in which a signal can be transmitted from the sources to all other nodes in the graph. In each step, the sources and the nodes that already have received the signal can forward it to at most one of their neighbour nodes. The problem has previously been proved to be NP‐hard. In the current work, we develop a compact integer programming model for the problem. We also devise procedures for computing lower bounds on the minimum number of steps required, along with methods for constructing near‐optimal solutions. Computational experiments demonstrate that in a wide range of instances, in particular instances with sufficiently dense graphs, the lower and upper bounds under study collapse. In instances where this is not the case, the integer programming model proves strong capabilities in closing the remaining gap and proves to be considerably more efficient than previously studied models.

Controlling fracture propagation using deep reinforcement learning

Mechanical discontinuity embedded in a material plays an essential role in determining the bulk mechanical, physical, and chemical properties. The ability to control mechanical discontinuity is relevant for industries dependent on natural, synthetic and composite materials, e.g. construction, aerospace, oil and gas, ceramics, metal, and geothermal industries, to name a few. The paper is a proof-of-concept development of a reinforcement learning framework to control the propagation of mechanical discontinuity. The reinforcement learning framework is coupled with an OpenAI-Gym-based environment that uses the mechanistic equation governing the propagation of mechanical discontinuity. Learning agent does not explicitly know about the underlying physics of propagation of discontinuity; nonetheless, the learning agent can infer the control strategy by continuously interacting the environment. The design of Markov decision process, which includes state, action and reward, is crucial for robust control. The deep deterministic policy gradient (DDPG) algorithm is implemented for learning continuous actions. It is also observed that the training efficiency is strongly determined by the formulation of reward function. The reward function that forces the learning agent to stay on the shortest linear path between crack tip and goal point performs much better than the reward function that aims to reach closest to the goal point in minimum number of steps. After close to 500 training episodes, the reinforcement learning framework successfully controlled the propagation of discontinuity in a material despite the complexity of the propagation pathway determined by multiple goal points.

Weight gain during the menopause transition: Evidence for a mechanism dependent on protein leverage.

Weight gain during the menopause transition: Evidence for a mechanism dependent on protein leverage.

Formalising the Pathways to Life Using Assembly Spaces.

Assembly theory (referred to in prior works as pathway assembly) has been developed to explore the extrinsic information required to distinguish a given object from a random ensemble. In prior work, we explored the key concepts relating to deconstructing an object into its irreducible parts and then evaluating the minimum number of steps required to rebuild it, allowing for the reuse of constructed sub-objects. We have also explored the application of this approach to molecules, as molecular assembly, and how molecular assembly can be inferred experimentally and used for life detection. In this article, we formalise the core assembly concepts mathematically in terms of assembly spaces and related concepts and determine bounds on the assembly index. We explore examples of constructing assembly spaces for mathematical and physical objects and propose that objects with a high assembly index can be uniquely identified as those that must have been produced using directed biological or technological processes rather than purely random processes, thereby defining a new scale of aliveness. We think this approach is needed to help identify the new physical and chemical laws needed to understand what life is, by quantifying what life does.

Innovation links, information diffusion, and return predictability: Evidence from China

Based on the activities of patent citation in China, a novel type of cross-firm innovation links is generated to investigate the gradual diffusion of information along the innovation chain via tests of cross-sectional return predictability. Various signals are created to represent the value of the information contained in the innovation links; these signals are demonstrated to have robust cross-predictability for stock returns in both the cross-sectional regression model and portfolio strategies. The effect of predictability is found to be stronger for stocks with high institutional ownership and analyst coverage. Considering the minimum number of steps required to establish the cross-firm linkage, innovation links are further partitioned to represent different proximity of the linked firms. It is then found that information diffuses faster across closely-linked firms than across distantly-linked firms. Sophisticated investors are found to be able to properly process the relevant information and benefit from innovation links.

Minimal‐time complex consensus for multi‐agent systems with time delay

This paper studies the minimum time consensus problem for discrete-time multi-agent systems with complex Laplacian delay networks such that each agent can find its complex consensus value in a minimum number of steps using its local observations. The stability analysis is first provided and the convergence condition is derived for complex weighted networks with time delays. Specifically, the delayed multi-agent system is modeled by employing the augmented graph representation. Via adding virtual agents in the augmented systems, the complex consensus is obtained in the networks with bounded time delay if the communication topology digraph of the system has a spanning tree. A decentralized algorithm is proposed for the minimal-time computation of complex consensus based on the information from the robot itself without relying on the external environment. The algorithm hinges on the minimal polynomial of the matrix concerning the augmented graph. Furthermore, the rearrangement of the virtual agents in the augmented system provides an upper bound for the number of agents required to compute the consensus value. Simulation examples demonstrate the effectiveness of our results. The advantage of this approach is that it can be easily deployed on a group of agents to rapidly achieve a complex consensus setting within any delayed networks.

Quality by design assisted optimization of temozolomide loaded PEGylated lyotropic liquid crystals: Investigating various formulation and process variables along with in-vitro characterization

Temozolomide (TMZ) is approved for the treatment of glioblastoma. The objective of the present study was to develop and characterize TMZ loaded lyotropic liquid crystals (LLCs) for intravenous delivery. Various formulation and process variables were studied in detail, following the quality by design principles. A three-level Box Behnken design was used for optimization. The effect of lipid concentration, surfactant concentration, and co-surfactant concentration on response variables like size, size distribution, zeta potential, entrapment efficiency, and drug loading was investigated using the statistical data obtained by Design Expert® software. The results demonstrated that LLCs were obtained in the size range of 53.15–186.50 nm with PDI less than 0.25. The optimized formulation showed particle size of 97.70 ± 0.481 nm and entrapment efficiency of 36.46 ± 1.48%. TMZ loaded LLCs were found to follow Korsmeyer's Peppas model and showed sustained release up to 72 h. The LLCs were further PEGylated to prevent hemolysis and achieve long plasma circulation. PEGylated LLCs showed less than 5% hemolysis. TMZ loaded LLCs demonstrated higher cytotoxicity towards glioma cell lines as compared to native TMZ. The results revealed that the prepared LLCs could be a potential delivery system to enhance the efficacy of TMZ. Additionally, the preparation method involved a minimum number of steps ensuring reproducibility and scalability.

Justification of the rotary working bodies of the cultivator for processing between the rows of plantations of lavender oilseed on the basis of agricultural biomechanics

The article presents the methods and results of modeling in agricultural biomechanics, which made it possible to substantiate models of cultivator working bodies adapted to the soil environment based on rotary discs with teeth. The biological prototype of this design is the burrowing limb of a rhinoceros beetle. It is proposed to solve the problems of improving the shape of rotary discs with teeth on the basis of the use of a mechanical-bionic approach, which allows to analytically describe the dependencies for determining the minimum number of steps of cutting notches between the teeth and the number of teeth on the disc, as well as the rational value of their length. The use of a new type of working bodies - a toothed flat disc, designed in a bionic manner, will increase the efficiency of weed control during inter-row tillage, and also reduce traction resistance.