Journal articles on the topic 'Relaxed problem variants'

To see the other types of publications on this topic, follow the link: Relaxed problem variants.

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Relaxed problem variants.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Du, Yihong. "Critical point theorems with relaxed boundary condition and applications." Bulletin of the Australian Mathematical Society 47, no. 1 (February 1993): 101–18. http://dx.doi.org/10.1017/s0004972700012302.

Full text
Abstract:
This paper is a sequel to a recent paper by the author in this journal. We prove some -variants of the min-max type critical point theorems with relaxed boundary condition and then apply the abstract results to a semilinear elliptic boundary value problem.
APA, Harvard, Vancouver, ISO, and other styles
2

Tran, Tony, Minh Do, Eleanor Rieffel, Jeremy Frank, Zhihui Wang, Bryan O'Gorman, Davide Venturelli, and J. Beck. "A Hybrid Quantum-Classical Approach to Solving Scheduling Problems." Proceedings of the International Symposium on Combinatorial Search 7, no. 1 (September 1, 2021): 98–106. http://dx.doi.org/10.1609/socs.v7i1.18390.

Full text
Abstract:
An effective approach to solving complex problems is to decompose them and integrate dedicated solvers for those subproblems. We introduce a hybrid decomposition that incorporates: (1) a quantum annealer that samples from the configuration space of a relaxed problem to obtain strong candidate solutions, and (2) a classical processor that maintains a global search tree and enforces constraints on the relaxed components of the problem. Our framework is the first to use quantum annealing as part of a complete search. We consider variants of our approach with differing amounts of guidance from the quantum annealer. We empirically test our algorithm and compare the variants on problems from three scheduling domains: graph-coloring-type scheduling, simplified Mars Lander task scheduling, and airport runway scheduling. While we were only able to test on problems of small sizes, due to the limitation of currently available quantum annealing hardware, the empirical results show that results obtained from the quantum annealer can be used for more effective search node pruning and to improve node selection heuristics when compared to a standard classical approach.
APA, Harvard, Vancouver, ISO, and other styles
3

Gajjar, Kshitij, Agastya Vibhuti Jha, Manish Kumar, and Abhiruk Lahiri. "Reconfiguring Shortest Paths in Graphs." Proceedings of the AAAI Conference on Artificial Intelligence 36, no. 9 (June 28, 2022): 9758–66. http://dx.doi.org/10.1609/aaai.v36i9.21211.

Full text
Abstract:
Reconfiguring two shortest paths in a graph means modifying one shortest path to the other by changing one vertex at a time, so that all the intermediate paths are also shortest paths. This problem has several natural applications, namely: (a) revamping road networks, (b) rerouting data packets in a synchronous multiprocessing setting, (c) the shipping container stowage problem, and (d) the train marshalling problem. When modelled as graph problems, (a) is the most general case while (b), (c) and (d) are restrictions to different graph classes. We show that (a) is intractable, even for relaxed variants of the problem. For (b), (c) and (d), we present efficient algorithms to solve the respective problems. We also generalise the problem to when at most k (for some k >= 2) contiguous vertices on a shortest path can be changed at a time.
APA, Harvard, Vancouver, ISO, and other styles
4

Yaffe, Tamir, Shawn Skyler, and Ariel Felner. "Suboptimally Solving the Watchman Route Problem on a Grid with Heuristic Search." Proceedings of the International Symposium on Combinatorial Search 12, no. 1 (July 21, 2021): 106–14. http://dx.doi.org/10.1609/socs.v12i1.18557.

Full text
Abstract:
In the Watchman Route Problem (WRP) we are given a grid map with obstacles and the task is to (offline) find a (shortest) path through the grid such that all cells in the map can be visually seen by at least one cell on the path. WRP was recently formalized and optimally solved with heuristic search. In this paper we show how the previous optimal methods can be relaxed and modified to obtain suboptimal solvers that are much faster than the optimal solvers without sacrificing too much the quality of the solution. In particular, we present three methods that intelligently prune away large subtrees. We then derive bounded suboptimal solvers, suboptimal solvers without bounds and anytime variants of these. All these algorithms are backed up with experimental evidence that show their benefits compared to existing approaches.
APA, Harvard, Vancouver, ISO, and other styles
5

Singamsetty, Purusotham, and Jayanth Kumar Thenepalle. "An efficient genetic algorithm for solving open multiple travelling salesman problem with load balancing constraint." Decision Science Letters 10, no. 4 (2021): 525–34. http://dx.doi.org/10.5267/j.dsl.2021.5.003.

Full text
Abstract:
The multiple travelling salesman problem (MTSP) is one of the widely studied combinatorial optimization problems with various theoretical and practical applications. However, most of the studies intended to deal with classical MTSP, very limited attention has been given to an open multiple travelling salesman problem and its variants. In this paper, an open multiple travelling salesman problem with load balancing constraint (OMTSPLB) is addressed. The OMTSPLB differs from the conventional MTSP, in which all the salesmen start from the central depot and need not come back to it after visiting the given number of cities by accomplishing the load balance constraint, which helps in fairly distributing the task among all salesmen. The problem aims to minimize the overall traversal distance/cost for operating open tours subject to the load balancing constraint. A zero-one integer linear programming (0-1 ILP) model and an efficient metaheuristic genetic algorithm (GA), is established for the OMTSPLB. Since no existing study on OMTSPLB, the proposed GA is tested on the relaxed version of the present model, comparative results are reported. The comparative results show that the proposed GA is competent over the existing algorithms. Furthermore, extensive experiments are carried out on OMTSPLB and the results show that proposed GA can find the global solution effectively.
APA, Harvard, Vancouver, ISO, and other styles
6

Walker, Thayne T., Nathan R. Sturtevant, and Ariel Felner. "Generalized and Sub-Optimal Bipartite Constraints for Conflict-Based Search." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 05 (April 3, 2020): 7277–84. http://dx.doi.org/10.1609/aaai.v34i05.6219.

Full text
Abstract:
The main idea of conflict-based search (CBS), a popular, state-of-the-art algorithm for multi-agent pathfinding is to resolve conflicts between agents by systematically adding constraints to agents. Recently, CBS has been adapted for new domains and variants, including non-unit costs and continuous time settings. These adaptations require new types of constraints. This paper introduces a new automatic constraint generation technique called bipartite reduction (BR). BR converts the constraint generation step of CBS to a surrogate bipartite graph problem. The properties of BR guarantee completeness and optimality for CBS. Also, BR's properties may be relaxed to obtain suboptimal solutions. Empirical results show that BR yields significant speedups in 2k connected grids over the previous state-of-the-art for both optimal and suboptimal search.
APA, Harvard, Vancouver, ISO, and other styles
7

Ivankovic, Franc, Patrik Haslum, Sylvie Thiebaux, Vikas Shivashankar, and Dana Nau. "Optimal Planning with Global Numerical State Constraints." Proceedings of the International Conference on Automated Planning and Scheduling 24 (May 10, 2014): 145–53. http://dx.doi.org/10.1609/icaps.v24i1.13648.

Full text
Abstract:
Automating the operations of infrastructure networks such as energy grids and oil pipelines requires a range of planning and optimisation technologies. However, current planners face significant challenges in responding to this need. Notably, they are unable to model and reason about the global numerical state constraints necessary to capture flows and similar physical phenomena occurring in these networks. A single discrete control action can affect the flow throughout the network in a way that may depend on the entire network topology. Determining whether preconditions, goals and invariant conditions are satisfied requires solving a system of numerical constraints after each action application. This paper extends domain-independent optimal planning to this kind of reasoning. We present extensions of the formalism, relaxed plans, and heuristics, as well as new search variants and experimental results on two problem domains.
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Lingya, and Dean S. Oliver. "Efficient Optimization of Well-Drilling Sequence with Learned Heuristics." SPE Journal 24, no. 05 (August 26, 2019): 2111–34. http://dx.doi.org/10.2118/195640-pa.

Full text
Abstract:
Summary When preparing a field–development plan, the forecast value of the development can be sensitive to the order in which the wells are drilled. Determining the optimal drilling sequence generally requires many simulation runs. In this paper, we formulate the sequential decision problem of a drilling schedule as one of finding a path in a decision tree that is most likely to generate the highest net present value (NPV). A nonparametric online–learning methodology is developed to efficiently compute the sequence of drilling wells that is optimal or near optimal. The main ideas behind the approach are that heuristics from relaxed problems can be used to estimate the maximum value of complete drilling sequences constrained to previous wells, and that multiple online–learning techniques can be used to improve the accuracy of the estimated values. The performance of various heuristic methods is studied in a model for which uncertainty in properties is neglected. The initial heuristic used in this work generates a higher estimated NPV than the actual maximum NPV. Although such a heuristic is guaranteed to find the true optimal drilling order when used in the A* informed-search algorithm method, the cost of the search can be prohibitive unless the initial heuristic is highly accurate. For the variants of heuristic search methods with weighting parameters, the results show that it might not be possible to identify parameters that can be used to find a solution quickly without sacrificing the accuracy of the estimated NPV in this drilling–sequence problem. In contrast, the online learned heuristics derived from observations from previous drilling steps are shown to outperform the other variants of heuristic methods in terms of running time, accuracy of the estimated value, and solution quality. Multilearned heuristic search (MLHS) with space reduction (MLHS–SR) is an efficient and fast method to find a solution with high value. Continuing the search with space restoration is guaranteed to improve the solution quality or find the same solution as the MLHS without any space reduction.
APA, Harvard, Vancouver, ISO, and other styles
9

Mendoza, Victoria May P., Renier Mendoza, Jongmin Lee, and Eunok Jung. "Adjusting non-pharmaceutical interventions based on hospital bed capacity using a multi-operator differential evolution." AIMS Mathematics 7, no. 11 (2022): 19922–53. http://dx.doi.org/10.3934/math.20221091.

Full text
Abstract:
<abstract><p>Without vaccines and medicine, non-pharmaceutical interventions (NPIs) such as social distancing, have been the main strategy in controlling the spread of COVID-19. Strict social distancing policies may lead to heavy economic losses, while relaxed social distancing policies can threaten public health systems. We formulate optimization problems that minimize the stringency of NPIs during the prevaccination and vaccination phases and guarantee that cases requiring hospitalization will not exceed the number of available hospital beds. The approach utilizes an SEIQR model that separates mild from severe cases and includes a parameter $ \mu $ that quantifies NPIs. Payoff constraints ensure that daily cases are decreasing at the end of the prevaccination phase and cases are minimal at the end of the vaccination phase. Using a penalty method, the constrained minimization is transformed into a non-convex, multi-modal unconstrained optimization problem. We solve this problem using the improved multi-operator differential evolution, which fared well when compared with other optimization algorithms. We apply the framework to determine optimal social distancing strategies in the Republic of Korea given different amounts and types of antiviral drugs. The model considers variants, booster shots, and waning of immunity. The optimal $ \mu $ values show that fast administration of vaccines is as important as using highly effective vaccines. The initial number of infections and daily imported cases should be kept minimum especially if the bed capacity is low. In Korea, a gradual easing of NPIs without exceeding the bed capacity is possible if there are at least seven million antiviral drugs and the effectiveness of the drug in reducing severity is at least 86%. Model parameters can be adapted to a specific region or country, or other infectious diseases. The framework can be used as a decision support tool in planning economic policies, especially in countries with limited healthcare resources.</p></abstract>
APA, Harvard, Vancouver, ISO, and other styles
10

Pagel, Kymberleigh A., Rick Kim, Kyle Moad, Ben Busby, Lily Zheng, Collin Tokheim, Michael Ryan, and Rachel Karchin. "Integrated Informatics Analysis of Cancer-Related Variants." JCO Clinical Cancer Informatics, no. 4 (September 2020): 310–17. http://dx.doi.org/10.1200/cci.19.00132.

Full text
Abstract:
PURPOSE The modern researcher is confronted with hundreds of published methods to interpret genetic variants. There are databases of genes and variants, phenotype-genotype relationships, algorithms that score and rank genes, and in silico variant effect prediction tools. Because variant prioritization is a multifactorial problem, a welcome development in the field has been the emergence of decision support frameworks, which make it easier to integrate multiple resources in an interactive environment. Current decision support frameworks are typically limited by closed proprietary architectures, access to a restricted set of tools, lack of customizability, Web dependencies that expose protected data, or limited scalability. METHODS We present the Open Custom Ranked Analysis of Variants Toolkit 1 (OpenCRAVAT) a new open-source, scalable decision support system for variant and gene prioritization. We have designed the resource catalog to be open and modular to maximize community and developer involvement, and as a result, the catalog is being actively developed and growing every month. Resources made available via the store are well suited for analysis of cancer, as well as Mendelian and complex diseases. RESULTS OpenCRAVAT offers both command-line utility and dynamic graphical user interface, allowing users to install with a single command, easily download tools from an extensive resource catalog, create customized pipelines, and explore results in a richly detailed viewing environment. We present several case studies to illustrate the design of custom workflows to prioritize genes and variants. CONCLUSION OpenCRAVAT is distinguished from similar tools by its capabilities to access and integrate an unprecedented amount of diverse data resources and computational prediction methods, which span germline, somatic, common, rare, coding, and noncoding variants.
APA, Harvard, Vancouver, ISO, and other styles
11

Cheon, Jung Hee, Wonhee Cho, Minki Hhan, Jiseung Kim, and Changmin Lee. "Algorithms for CRT-variant of Approximate Greatest Common Divisor Problem." Journal of Mathematical Cryptology 14, no. 1 (October 20, 2020): 397–413. http://dx.doi.org/10.1515/jmc-2019-0031.

Full text
Abstract:
AbstractThe approximate greatest common divisor problem (ACD) and its variants have been used to construct many cryptographic primitives. In particular, the variants of the ACD problem based on Chinese remainder theorem (CRT) are being used in the constructions of a batch fully homomorphic encryption to encrypt multiple messages in one ciphertext. Despite the utility of the CRT-variant scheme, the algorithms that secures its security foundation have not been probed well enough.In this paper, we propose two algorithms and the results of experiments in which the proposed algorithms were used to solve the variant problem. Both algorithms take the same time complexity $\begin{array}{} \displaystyle 2^{\tilde{O}(\frac{\gamma}{(\eta-\rho)^2})} \end{array}$ up to a polynomial factor to solve the variant problem for the bit size of samples γ, secret primes η, and error bound ρ. Our algorithm gives the first parameter condition related to η and γ size. From the results of the experiments, it has been proved that the proposed algorithms work well both in theoretical and experimental terms.
APA, Harvard, Vancouver, ISO, and other styles
12

Holling, Tess, Sheela Nampoothiri, Bedirhan Tarhan, Pauline E. Schneeberger, Kollencheri Puthenveettil Vinayan, Dhanya Yesodharan, Arun Grace Roy, et al. "Novel biallelic variants expand the SLC5A6-related phenotypic spectrum." European Journal of Human Genetics 30, no. 4 (January 11, 2022): 439–49. http://dx.doi.org/10.1038/s41431-021-01033-2.

Full text
Abstract:
AbstractThe sodium (Na+):multivitamin transporter (SMVT), encoded by SLC5A6, belongs to the sodium:solute symporter family and is required for the Na+-dependent uptake of biotin (vitamin B7), pantothenic acid (vitamin B5), the vitamin-like substance α-lipoic acid, and iodide. Compound heterozygous SLC5A6 variants have been reported in individuals with variable multisystemic disorder, including failure to thrive, developmental delay, seizures, cerebral palsy, brain atrophy, gastrointestinal problems, immunodeficiency, and/or osteopenia. We expand the phenotypic spectrum associated with biallelic SLC5A6 variants affecting function by reporting five individuals from three families with motor neuropathies. We identified the homozygous variant c.1285 A > G [p.(Ser429Gly)] in three affected siblings and a simplex patient and the maternally inherited c.280 C > T [p.(Arg94*)] variant and the paternally inherited c.485 A > G [p.(Tyr162Cys)] variant in the simplex patient of the third family. Both missense variants were predicted to affect function by in silico tools. 3D homology modeling of the human SMVT revealed 13 transmembrane helices (TMs) and Tyr162 and Ser429 to be located at the cytoplasmic facing region of TM4 and within TM11, respectively. The SLC5A6 missense variants p.(Tyr162Cys) and p.(Ser429Gly) did not affect plasma membrane localization of the ectopically expressed multivitamin transporter suggesting reduced but not abolished function, such as lower catalytic activity. Targeted therapeutic intervention yielded clinical improvement in four of the five patients. Early molecular diagnosis by exome sequencing is essential for timely replacement therapy in affected individuals.
APA, Harvard, Vancouver, ISO, and other styles
13

Agarwal, Bhavesh. "THE ECONOMIC IMPACT OF COVID-19 RELATED LUNG COMPLICATIONS ON THE INDIAN HEALTHCARE SYSTEM." International Journal of Advanced Research 10, no. 7 (July 31, 2022): 830–37. http://dx.doi.org/10.21474/ijar01/15103.

Full text
Abstract:
COVID-19 has been spreading across the world, causing a major global crisis. Each successive wave of the pandemic is more dangerous than the previous one. The virus is constantly mutating. The Alpha, Beta, Gamma and Delta variants have been flagged as variants of concern. The Delta variant is especially prominent in India which has higher transmissibility. Several drugs and medicines need to be administered to severely ill patients. Adding to the problem, there have been several instances of black-marketing of drugs such as Remdesivir as they are in short supply but in huge demand. Furthermore, India is even facing an oxygen crisis where there is also a supply-demand mismatch. Many have died due to shortages of oxygen. This virus has had a massive impact on the Indian healthcare system. It may be counterintuitive but despite the huge rise in COVID-19 patients, hospitals, like nearly all other sectors, have faced big economic problems due to this virus. This virus has caused major humanitarian and economic problems. The only solutions the world has include hand-washing, wearing masks, social distancing, and vaccinations. People need to be prudent and follow these measures to reduce the impact of this pandemic and return to normalcy as fast as possible.
APA, Harvard, Vancouver, ISO, and other styles
14

Qin, Hu, Xinxin Su, Teng Ren, and Zhixing Luo. "A review on the electric vehicle routing problems: Variants and algorithms." Frontiers of Engineering Management 8, no. 3 (May 19, 2021): 370–89. http://dx.doi.org/10.1007/s42524-021-0157-1.

Full text
Abstract:
AbstractOver the past decade, electric vehicles (EVs) have been considered in a growing number of models and methods for vehicle routing problems (VRPs). This study presents a comprehensive survey of EV routing problems and their many variants. We only consider the problems in which each vehicle may visit multiple vertices and be recharged during the trip. The related literature can be roughly divided into nine classes: Electric traveling salesman problem, green VRP, electric VRP, mixed electric VRP, electric location routing problem, hybrid electric VRP, electric dial-a-ride problem, electric two-echelon VRP, and electric pickup and delivery problem. For each of these nine classes, we focus on reviewing the settings of problem variants and the algorithms used to obtain their solutions.
APA, Harvard, Vancouver, ISO, and other styles
15

Oláhová, Monika, Camilla Ceccatelli Berti, Jack J. Collier, Charlotte L. Alston, Elisabeth Jameson, Simon A. Jones, Noel Edwards, et al. "Molecular genetic investigations identify new clinical phenotypes associated with BCS1L-related mitochondrial disease." Human Molecular Genetics 28, no. 22 (August 22, 2019): 3766–76. http://dx.doi.org/10.1093/hmg/ddz202.

Full text
Abstract:
Abstract BCS1L encodes a homolog of the Saccharomyces cerevisiae bcs1 protein, which has a known role in the assembly of Complex III of the mitochondrial respiratory chain. Phenotypes reported in association with pathogenic BCS1L variants include growth retardation, aminoaciduria, cholestasis, iron overload, lactic acidosis and early death (GRACILE syndrome), and Björnstad syndrome, characterized by abnormal flattening and twisting of hair shafts (pili torti) and hearing problems. Here we describe two patients harbouring biallelic variants in BCS1L; the first with a heterozygous variant c.166C&gt;T, p.(Arg56*) together with a novel heterozygous variant c.205C&gt;T, p.(Arg69Cys) and a second patient with a novel homozygous c.325C&gt;T, p.(Arg109Trp) variant. The two patients presented with different phenotypes; the first patient presented as an adult with aminoaciduria, seizures, bilateral sensorineural deafness and learning difficulties. The second patient was an infant who presented with a classical GRACILE syndrome leading to death at 4 months of age. A decrease in BCS1L protein levels was seen in both patients, and biochemical analysis of Complex III revealed normal respiratory chain enzyme activities in the muscle of both patients. A decrease in Complex III assembly was detected in the adult patient’s muscle, whilst the paediatric patient displayed a combined mitochondrial respiratory chain defect in cultured fibroblasts. Yeast complementation studies indicate that the two missense variants, c.205C&gt;T, p.(Arg69Cys) and c.325C&gt;T, p.(Arg109Trp), impair the respiratory capacity of the cell. Together, these data support the pathogenicity of the novel BCS1L variants identified in our patients.
APA, Harvard, Vancouver, ISO, and other styles
16

Kimonis, Eva R., Paul J. Frick, Elizabeth Cauffman, Asha Goldweber, and Jennifer Skeem. "Primary and secondary variants of juvenile psychopathy differ in emotional processing." Development and Psychopathology 24, no. 3 (July 11, 2012): 1091–103. http://dx.doi.org/10.1017/s0954579412000557.

Full text
Abstract:
AbstractAccumulating research suggests that psychopathy can be disaggregated into low-anxious primary and high-anxious secondary variants, and this research may be important for understanding antisocial youths with callous–unemotional traits. Using model-based cluster analysis, the present study disaggregated 165 serious male adolescent offenders (M age = 16) with high scores on the Youth Psychopathic Traits Inventory into primary and secondary variants based on the presence of anxiety. The results indicated that the secondary, high-anxious variant was more likely to show a history of abuse and scored higher on measures of emotional and attentional problems. On a picture version of the dot-probe task, the low-anxious primary variant was not engaged by emotionally distressing pictures, whereas the high-anxious secondary variant was more attentive to such stimuli (Cohen d = 0.71). Although the two groups differed as hypothesized from one another, neither differed significantly in their emotional processing from a nonpsychopathic control group of offending youth (n = 208). These results are consistent with the possibility that the two variants of psychopathy, both of which were high on callous–unemotional traits, may have different etiological pathways, with the primary being more related to a deficit in the processing of distress cues in others and the secondary being more related to histories of abuse and emotional problems.
APA, Harvard, Vancouver, ISO, and other styles
17

Chen, Yu-Lan, Dian-Fu Chen, Hua-Zhen Ke, Shao-Yun Zhao, Hong-Fu Li, and Zhi-Ying Wu. "Paroxysmal Kinesigenic Dyskinesia Caused by 16p11.2 Microdeletion and Related Clinical Features." Neurology Genetics 8, no. 2 (February 17, 2022): e659. http://dx.doi.org/10.1212/nxg.0000000000000659.

Full text
Abstract:
Background and ObjectivesIsolated paroxysmal kinesigenic dyskinesia (PKD) is mainly caused by PRRT2 variants and TMEM151A variants. Patients with proximal 16p11.2 microdeletion (16p11.2MD) (including PRRT2) often have neurodevelopmental phenotypes, whereas a few patients have PKD. Here, we aimed to identify 16p11.2MD in patients with PKD and describe the related phenotypes.MethodsWhole-exome sequencing and bioinformatics analysis of copy number variant (CNV) were performed in patients with PKD carrying neither PRRT2 nor TMEM151A variant. Quantitative PCR and low-coverage whole-genome sequencing verified the CNV.ResultsWe identified 9 sporadic patients with PKD and 16p11.2MD (∼535 kb), accounting for 9.6% (9/94) of our patients. Together with 9 previously reported patients with PKD and 16p11.2MD, we found that 16p11.2MD was de novo in 11 of 12 tested patients and inherited from a parent in the other patient. And 80% (12/15) of these patients had a mild language delay, 64.3% (9/14) had compromised learning ability, 42.9% (6/14) had a mild motor delay, and 50% (6/12) had abnormal neuroimaging findings. No severe autism disorders were observed.DiscussionMild developmental problems may be overlooked. A detailed inquiry of developmental history and CNV testing are necessary to distinguish patients with 16p11.2MD from isolated PKD.
APA, Harvard, Vancouver, ISO, and other styles
18

Bruchertseifer, Jens, and Henning Fernau. "Synchronizing series-parallel deterministic finite automata with loops and related problems." RAIRO - Theoretical Informatics and Applications 55 (2021): 7. http://dx.doi.org/10.1051/ita/2021005.

Full text
Abstract:
We study the problem DFA-SW of determining if a given deterministic finite automaton A possesses a synchronizing word of length at most k for automata whose (multi-)graphs are TTSPL, i.e., series-parallel, plus allowing some self-loops. While DFA-SW remains NP-complete on TTSPL automata, we also find (further) restrictions with efficient (parameterized) algorithms. We also study the (parameterized) complexity of related problems, for instance, extension variants of the synchronizing word problem, or the problem of finding smallest alphabet-induced synchronizable sub-automata.
APA, Harvard, Vancouver, ISO, and other styles
19

Klobučar, Ana, and Robert Manger. "Solving Robust Weighted Independent Set Problems on Trees and under Interval Uncertainty." Symmetry 13, no. 12 (November 27, 2021): 2259. http://dx.doi.org/10.3390/sym13122259.

Full text
Abstract:
The maximum weighted independent set (MWIS) problem is important since it occurs in various applications, such as facility location, selection of non-overlapping time slots, labeling of digital maps, etc. However, in real-life situations, input parameters within those models are often loosely defined or subject to change. For such reasons, this paper studies robust variants of the MWIS problem. The study is restricted to cases where the involved graph is a tree. Uncertainty of vertex weights is represented by intervals. First, it is observed that the max–min variant of the problem can be solved in linear time. Next, as the most important original contribution, it is proved that the min–max regret variant is NP-hard. Finally, two mutually related approximation algorithms for the min–max regret variant are proposed. The first of them is already known, but adjusted to the considered situation, while the second one is completely new. Both algorithms are analyzed and evaluated experimentally.
APA, Harvard, Vancouver, ISO, and other styles
20

Hall, J. C., D. C. Chang, and E. Dolezelova. "Principles and Problems Revolving Round Rhythm-related Genetic Variants." Cold Spring Harbor Symposia on Quantitative Biology 72, no. 1 (January 2007): 215–32. http://dx.doi.org/10.1101/sqb.2007.72.039.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Balasubramanian, Meena, Alexander J. M. Dingemans, Shadi Albaba, Ruth Richardson, Thabo M. Yates, Helen Cox, Sofia Douzgou, et al. "Comprehensive study of 28 individuals with SIN3A-related disorder underscoring the associated mild cognitive and distinctive facial phenotype." European Journal of Human Genetics 29, no. 4 (January 12, 2021): 625–36. http://dx.doi.org/10.1038/s41431-020-00769-7.

Full text
Abstract:
AbstractWitteveen-Kolk syndrome (OMIM 613406) is a recently defined neurodevelopmental syndrome caused by heterozygous loss-of-function variants in SIN3A. We define the clinical and neurodevelopmental phenotypes related to SIN3A-haploinsufficiency in 28 unreported patients. Patients with SIN3A variants adversely affecting protein function have mild intellectual disability, growth and feeding difficulties. Involvement of a multidisciplinary team including a geneticist, paediatrician and neurologist should be considered in managing these patients. Patients described here were identified through a combination of clinical evaluation and gene matching strategies (GeneMatcher and Decipher). All patients consented to participate in this study. Mean age of this cohort was 8.2 years (17 males, 11 females). Out of 16 patients ≥ 8 years old assessed, eight (50%) had mild intellectual disability (ID), four had moderate ID (22%), and one had severe ID (6%). Four (25%) did not have any cognitive impairment. Other neurological symptoms such as seizures (4/28) and hypotonia (12/28) were common. Behaviour problems were reported in a minority. In patients ≥2 years, three were diagnosed with Autism Spectrum Disorder (ASD) and four with Attention Deficit Hyperactivity Disorder (ADHD). We report 27 novel variants and one previously reported variant. 24 were truncating variants; three were missense variants and one large in-frame gain including exons 10–12.
APA, Harvard, Vancouver, ISO, and other styles
22

Kim, S., and T. D. Frank. "Correlations Between Hysteretic Categorical and Continuous Judgments of Perceptual Stimuli Supporting a Unified Dynamical Systems Approach to Perception." Perception 47, no. 1 (September 24, 2017): 44–66. http://dx.doi.org/10.1177/0301006617731047.

Full text
Abstract:
We report from two variants of a figure-ground experiment that is known in the literature to involve a bistable perceptual domain. The first variant was conducted as a two-alternative forced-choice experiment and in doing so tested participants on a categorical measurement scale. The second variant involved a Likert scale measure that was considered to represent a continuous measurement scale. The two variants were conducted as a single within-subjects experiment. Measures of bistability operationalized in terms of hysteresis size scores showed significant positive correlations across the two response conditions. The experimental findings are consistent with a dualistic interpretation of self-organizing perceptual systems when they are described on a macrolevel by means of so-called amplitude equations. This is explicitly demonstrated for a Lotka–Volterra–Haken amplitude equation model of task-related brain activity. As a by-product, the proposed dynamical systems perspective also sheds new light on the anchoring problem of producing numerical, continuous judgments.
APA, Harvard, Vancouver, ISO, and other styles
23

Ashok Kumar, M., Albert Sunny, Ashish Thakre, Ashisha Kumar, and G. Dinesh Manohar. "Are Guessing, Source Coding and Tasks Partitioning Birds of A Feather?" Entropy 24, no. 11 (November 19, 2022): 1695. http://dx.doi.org/10.3390/e24111695.

Full text
Abstract:
This paper establishes a close relationship among the four information theoretic problems, namely Campbell source coding, Arikan guessing, Huleihel et al. memoryless guessing and Bunte and Lapidoth tasks’ partitioning problems in the IID-lossless case. We first show that the aforementioned problems are mathematically related via a general moment minimization problem whose optimum solution is given in terms of Renyi entropy. We then propose a general framework for the mismatched version of these problems and establish all the asymptotic results using this framework. The unified framework further enables us to study a variant of Bunte–Lapidoth’s tasks partitioning problem which is practically more appealing. In addition, this variant turns out to be a generalization of Arıkan’s guessing problem. Finally, with the help of this general framework, we establish an equivalence among all these problems, in the sense that, knowing an asymptotically optimal solution in one problem helps us find the same in all other problems.
APA, Harvard, Vancouver, ISO, and other styles
24

Erdelić, Tomislav, and Tonči Carić. "A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches." Journal of Advanced Transportation 2019 (May 9, 2019): 1–48. http://dx.doi.org/10.1155/2019/5075671.

Full text
Abstract:
In order to ensure high-quality and on-time delivery in logistic distribution processes, it is necessary to efficiently manage the delivery fleet. Nowadays, due to the new policies and regulations related to greenhouse gas emission in the transport sector, logistic companies are paying higher penalties for each emission gram of CO2/km. With electric vehicle market penetration, many companies are evaluating the integration of electric vehicles in their fleet, as they do not have local greenhouse gas emissions, produce minimal noise, and are independent of the fluctuating oil price. The well-researched vehicle routing problem (VRP) is extended to the electric vehicle routing problem (E-VRP), which takes into account specific characteristics of electric vehicles. In this paper, a literature review on recent developments regarding the E-VRP is presented. The challenges that emerged with the integration of electric vehicles in the delivery processes are described, together with electric vehicle characteristics and recent energy consumption models. Several variants of the E-VRP and related problems are observed. To cope with the new routing challenges in E-VRP, efficient VRP heuristics and metaheuristics had to be adapted. An overview of the state-of-the-art procedures for solving the E-VRP and related problems is presented.
APA, Harvard, Vancouver, ISO, and other styles
25

Watson, Simon J., Matthijs R. A. Welkers, Daniel P. Depledge, Eve Coulter, Judith M. Breuer, Menno D. de Jong, and Paul Kellam. "Viral population analysis and minority-variant detection using short read next-generation sequencing." Philosophical Transactions of the Royal Society B: Biological Sciences 368, no. 1614 (March 19, 2013): 20120205. http://dx.doi.org/10.1098/rstb.2012.0205.

Full text
Abstract:
RNA viruses within infected individuals exist as a population of evolutionary-related variants. Owing to evolutionary change affecting the constitution of this population, the frequency and/or occurrence of individual viral variants can show marked or subtle fluctuations. Since the development of massively parallel sequencing platforms, such viral populations can now be investigated to unprecedented resolution. A critical problem with such analyses is the presence of sequencing-related errors that obscure the identification of true biological variants present at low frequency. Here, we report the development and assessment of the Quality Assessment of Short Read (QUASR) Pipeline ( http://sourceforge.net/projects/quasr ) specific for virus genome short read analysis that minimizes sequencing errors from multiple deep-sequencing platforms, and enables post-mapping analysis of the minority variants within the viral population. QUASR significantly reduces the error-related noise in deep-sequencing datasets, resulting in increased mapping accuracy and reduction of erroneous mutations. Using QUASR, we have determined influenza virus genome dynamics in sequential samples from an in vitro evolution of 2009 pandemic H1N1 (A/H1N1/09) influenza from samples sequenced on both the Roche 454 GSFLX and Illumina GAIIx platforms. Importantly, concordance between the 454 and Illumina sequencing allowed unambiguous minority-variant detection and accurate determination of virus population turnover in vitro .
APA, Harvard, Vancouver, ISO, and other styles
26

HIWATARI, H. "A Cramer-Shoup Variant Related to the Quadratic Residuosity Problem." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E89-A, no. 1 (January 1, 2006): 203–5. http://dx.doi.org/10.1093/ietfec/e89-a.1.203.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Parenti, Ilaria, Daphné Lehalle, Caroline Nava, Erin Torti, Elsa Leitão, Richard Person, Takeshi Mizuguchi, et al. "Missense and truncating variants in CHD5 in a dominant neurodevelopmental disorder with intellectual disability, behavioral disturbances, and epilepsy." Human Genetics 140, no. 7 (May 4, 2021): 1109–20. http://dx.doi.org/10.1007/s00439-021-02283-2.

Full text
Abstract:
AbstractLocated in the critical 1p36 microdeletion region, the chromodomain helicase DNA-binding protein 5 (CHD5) gene encodes a subunit of the nucleosome remodeling and deacetylation (NuRD) complex required for neuronal development. Pathogenic variants in six of nine chromodomain (CHD) genes cause autosomal dominant neurodevelopmental disorders, while CHD5-related disorders are still unknown. Thanks to GeneMatcher and international collaborations, we assembled a cohort of 16 unrelated individuals harboring heterozygous CHD5 variants, all identified by exome sequencing. Twelve patients had de novo CHD5 variants, including ten missense and two splice site variants. Three familial cases had nonsense or missense variants segregating with speech delay, learning disabilities, and/or craniosynostosis. One patient carried a frameshift variant of unknown inheritance due to unavailability of the father. The most common clinical features included language deficits (81%), behavioral symptoms (69%), intellectual disability (64%), epilepsy (62%), and motor delay (56%). Epilepsy types were variable, with West syndrome observed in three patients, generalized tonic–clonic seizures in two, and other subtypes observed in one individual each. Our findings suggest that, in line with other CHD-related disorders, heterozygous CHD5 variants are associated with a variable neurodevelopmental syndrome that includes intellectual disability with speech delay, epilepsy, and behavioral problems as main features.
APA, Harvard, Vancouver, ISO, and other styles
28

Diviš, Roman, and Antonín Kavička. "Reflective Nested Simulations Supporting Optimizations within Sequential Railway Traffic Simulators." ACM Transactions on Modeling and Computer Simulation 32, no. 1 (January 31, 2022): 1–34. http://dx.doi.org/10.1145/3467965.

Full text
Abstract:
This article describes and discusses railway-traffic simulators that use reflective nested simulations. Such simulations support optimizations (decision-making) with a focus on the selection of the most suitable solution where selected types of traffic problems are present. This approach allows suspension of the ongoing main simulation at a given moment and, by using supportive nested simulations (working with an appropriate lookahead), assessment of the different acceptable solution variants for the problem encountered—that is, a what-if analysis is carried out. The variant that provides the best predicted operational results (based on a specific criterion) is then selected for continuing the suspended main simulation. The proposed procedures are associated, in particular, with the use of sequential simulators specifically developed for railway traffic simulations. Special attention is paid to parallel computations of replications both of the main simulation and of supportive nested simulations. The concept proposed, applicable to railway traffic modelling, has the following advantages. First, the solution variants for the existing traffic situation are analyzed with respect to the feasibility of direct monitoring and evaluation of the natural traffic indicators or the appropriate (multi-criterial) function. The indicator values compare the results obtained from the variants being tested. Second, the supporting nested simulations, which potentially use additional hierarchic nesting, can also include future occurrences of random effects (such as train delay), thereby enabling us to realistically assess future traffic in stochastic conditions. The guidelines presented (for exploiting nested simulations within application projects with time constraints) are illustrated on a simulation case study focusing on traffic assessment related to the track infrastructure of a passenger railway station. Nested simulations support decisions linked with dynamic assignments of platform tracks to delayed trains. The use of reflective nested simulations is appropriate particularly in situations in which a reasonable number of admissible variants are to be analyzed within decision-making problem solution. This method is applicable especially to the support of medium-term (tactical) and long-term (strategic) planning. Because of rather high computational and time demands, nested simulations are not recommended for solving short-term (operative) planning/control problems.
APA, Harvard, Vancouver, ISO, and other styles
29

Subbotina, T. N., I. E. Maslyukova, A. A. Faleeva, P. A. Nikolaeva, A. S. Khazieva, E. A. Dunaeva, K. O. Mironov, et al. "Using the Minor Variant Finder software to identify and quantify the allelic burden level of somatic mutations in oncohematologic diseases." Oncohematology 15, no. 2 (July 16, 2020): 85–91. http://dx.doi.org/10.17650/1818-8346-2020-15-2-85-91.

Full text
Abstract:
Background. There are problems related to both quantitative assessment of an allele burden level of a mutant gene and interpretation of results in DNA samples with the burden level of the mutant allele less than 15–20 %, when using Sanger sequencing for analyzing somatic mutations. Applied Biosystems (USA) has developed new software Minor Variant Finder, which allows determining mutations with the allele burden level from 5 %.The objective: to determine the allele burden level and identification of minor variants of somatic mutations in the ASXL1, JAK2 genes and BCR-ABL oncogene using Minor Variant Finder software in patients with myeloproliferative neoplasms.Materials and methods. The level of mutant allele burden for 15 patients with myeloproliferative neoplasms was determined by the identified mutations using the Minor Variant Finder software, after analysis of point somatic mutations in the ASXL1, JAK2 genes and BCR-ABL oncogene by Sanger sequencing.Results. The allele burden level in all 5 ASXL1-positive samples and BCR-ABL-positive sample was determined as higher than 20 % using the Minor Variant Finder software. The allele burden level in 2 cases was higher than 20 % and in 7 cases lower than 20 %, when we analyzed 9 JAK2-positive samples.Conclusion. Minor Variant Finder software can be used to estimate the allele burden level and to identify minor variants of somatic mutations in the ASXL, JAK2 and BCR-ABL genes.
APA, Harvard, Vancouver, ISO, and other styles
30

Jiang, Tiefeng. "A variance formula related to a quantum conductance problem." Physics Letters A 373, no. 25 (June 2009): 2117–21. http://dx.doi.org/10.1016/j.physleta.2009.04.035.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Pop, Petrica, and Corina Pop-Sitar. "A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem." Yugoslav Journal of Operations Research 21, no. 2 (2011): 187–98. http://dx.doi.org/10.2298/yjor1102187p.

Full text
Abstract:
Classical combinatorial optimization problems can be generalized in a natural way by considering a related problem relative to a given partition of the nodes of the graph into node sets. In the literature one can find generalized problems such as: generalized minimum spanning tree, generalized traveling salesman problem, generalized Steiner tree problem, generalized vehicle routing problem, etc. These generalized problems typically belong to the class of NP-complete problems; they are harder than the classical ones, and nowadays are intensively studied due to their interesting properties and applications in the real world. Because of the complexity of finding the optimal or near-optimal solution in case of the generalized combinatorial optimization problems, great effort has been made, by many researchers, to develop efficient ways of their transformation into classical corresponding variants. We present in this paper an efficient way of transforming the generalized vehicle routing problem into the vehicle routing problem, and a new integer programming formulation of the problem.
APA, Harvard, Vancouver, ISO, and other styles
32

Prajapati, Raju, Jayantika Pal, and Om Prakash Dubey. "Transportation problem with restriction on arcs and their Solution by mathematical modeling." International Journal of Students' Research in Technology & Management 10, no. 1 (February 7, 2022): 67–75. http://dx.doi.org/10.18510/ijsrtm.2022.1015.

Full text
Abstract:
Purpose of the study: Transportation problem plays an important role in logistics. The present paper introduces the transportation problem along with some of its variants and their mathematical modeling. Methodology: The mathematical modeling is done for restricted path transportation problem. We have dealt with the transportation problems with specified number of blocked arcs or arcs with limited allowance through them. We have applied the same on some test problems chosen arbitrarily. The application is also extended on the transportation problems with some additional source-destination related restrictions. Main Findings: The optimal cost of constrained transportation problems under the study is obtained. Applications of this study: The process could be integrated on a larger scale in logistics. Novelty/Originality of this study: The study is done for special types of transportation problems having specific number of blocked arcs or arcs with limited allowance through them. Some more source-destination related constrained are also dealt in this paper.
APA, Harvard, Vancouver, ISO, and other styles
33

Esheiba, Laila, Amal Elgammal, Iman M. A. Helal, and Mohamed E. El-Sharkawi. "A Hybrid Knowledge-Based Recommender for Product-Service Systems Mass Customization." Information 12, no. 8 (July 26, 2021): 296. http://dx.doi.org/10.3390/info12080296.

Full text
Abstract:
Manufacturers today compete to offer not only products, but products accompanied by services, which are referred to as product-service systems (PSSs). PSS mass customization is defined as the production of products and services to meet the needs of individual customers with near-mass-production efficiency. In the context of the PSS mass customization environment, customers are overwhelmed by a plethora of previously customized PSS variants. As a result, finding a PSS variant that is precisely aligned with the customer’s needs is a cognitive task that customers will be unable to manage effectively. In this paper, we propose a hybrid knowledge-based recommender system that assists customers in selecting previously customized PSS variants from a wide range of available ones. The recommender system (RS) utilizes ontologies for capturing customer requirements, as well as product-service and production-related knowledge. The RS follows a hybrid recommendation approach, in which the problem of selecting previously customized PSS variants is encoded as a constraint satisfaction problem (CSP), to filter out PSS variants that do not satisfy customer needs, and then uses a weighted utility function to rank the remaining PSS variants. Finally, the RS offers a list of ranked PSS variants that can be scrutinized by the customer. In this study, the proposed recommendation approach was applied to a real-life large-scale case study in the domain of laser machines. To ensure the applicability of the proposed RS, a web-based prototype system has been developed, realizing all the modules of the proposed RS.
APA, Harvard, Vancouver, ISO, and other styles
34

Neumann, Alexander, Ilja M. Nolte, Irene Pappa, Tarunveer S. Ahluwalia, Erik Pettersson, Alina Rodriguez, Andrew Whitehouse, et al. "A genome-wide association study of total child psychiatric problems scores." PLOS ONE 17, no. 8 (August 22, 2022): e0273116. http://dx.doi.org/10.1371/journal.pone.0273116.

Full text
Abstract:
Substantial genetic correlations have been reported across psychiatric disorders and numerous cross-disorder genetic variants have been detected. To identify the genetic variants underlying general psychopathology in childhood, we performed a genome-wide association study using a total psychiatric problem score. We analyzed 6,844,199 common SNPs in 38,418 school-aged children from 20 population-based cohorts participating in the EAGLE consortium. The SNP heritability of total psychiatric problems was 5.4% (SE = 0.01) and two loci reached genome-wide significance: rs10767094 and rs202005905. We also observed an association of SBF2, a gene associated with neuroticism in previous GWAS, with total psychiatric problems. The genetic effects underlying the total score were shared with common psychiatric disorders only (attention-deficit/hyperactivity disorder, anxiety, depression, insomnia) (rG > 0.49), but not with autism or the less common adult disorders (schizophrenia, bipolar disorder, or eating disorders) (rG < 0.01). Importantly, the total psychiatric problem score also showed at least a moderate genetic correlation with intelligence, educational attainment, wellbeing, smoking, and body fat (rG > 0.29). The results suggest that many common genetic variants are associated with childhood psychiatric symptoms and related phenotypes in general instead of with specific symptoms. Further research is needed to establish causality and pleiotropic mechanisms between related traits.
APA, Harvard, Vancouver, ISO, and other styles
35

Khoufi, Ines, Anis Laouiti, and Cedric Adjih. "A Survey of Recent Extended Variants of the Traveling Salesman and Vehicle Routing Problems for Unmanned Aerial Vehicles." Drones 3, no. 3 (August 24, 2019): 66. http://dx.doi.org/10.3390/drones3030066.

Full text
Abstract:
The use of Unmanned Aerial Vehicles (UAVs) is rapidly growing in popularity. Initially introduced for military purposes, over the past few years, UAVs and related technologies have successfully transitioned to a whole new range of civilian applications such as delivery, logistics, surveillance, entertainment, and so forth. They have opened new possibilities such as allowing operation in otherwise difficult or hazardous areas, for instance. For all applications, one foremost concern is the selection of the paths and trajectories of UAVs, and at the same time, UAVs control comes with many challenges, as they have limited energy, limited load capacity and are vulnerable to difficult weather conditions. Generally, efficiently operating a drone can be mathematically formalized as a path optimization problem under some constraints. This shares some commonalities with similar problems that have been extensively studied in the context of urban vehicles and it is only natural that the recent literature has extended the latter to fit aerial vehicle constraints. The knowledge of such problems, their formulation, the resolution methods proposed—through the variants induced specifically by UAVs features—are of interest for practitioners for any UAV application. Hence, in this study, we propose a review of existing literature devoted to such UAV path optimization problems, focusing specifically on the sub-class of problems that consider the mobility on a macroscopic scale. These are related to the two existing general classic ones—the Traveling Salesman Problem and the Vehicle Routing Problem. We analyze the recent literature that adapted the problems to the UAV context, provide an extensive classification and taxonomy of their problems and their formulation and also give a synthetic overview of the resolution techniques, performance metrics and obtained numerical results.
APA, Harvard, Vancouver, ISO, and other styles
36

Muñoz-Bello, J. Omar, Adela Carrillo-García, and Marcela Lizano. "Epidemiology and Molecular Biology of HPV Variants in Cervical Cancer: The State of the Art in Mexico." International Journal of Molecular Sciences 23, no. 15 (August 2, 2022): 8566. http://dx.doi.org/10.3390/ijms23158566.

Full text
Abstract:
Cervical cancer (CC) continues to be a major public health problem in Mexico, ranking second among cancers in women. A persistent infection with human papillomaviruses (HPV) is the main risk factor for CC development. In addition, a significant fraction of other cancers including those of the anus, oropharynx, and penis are also related to HPV infection. In CC, HPV-16 is the most prevalent high-risk HPV type, followed by HPV-18, both being responsible for 70% of cases. HPV intratype variant lineages differ in nucleotide sequences by 1–10%, while sublineages differ by 0.5–1%. Several studies have postulated that the nucleotide changes that occur between HPV intratype variants are reflected in functional differences and in pathogenicity. Moreover, it has been demonstrated that HPV-16 and -18 intratype variants differentially affect molecular processes in infected cells, changing their biological behavior that finally impacts in the clinical outcome of patients. Mexico has participated in providing knowledge on the geographical distribution of intratype variants of the most prevalent HPVs in premalignant lesions of the cervix and cervical cancer, as well as in other HPV-related tumors. In addition, functional studies have been carried out to assess the cellular effects of intratype variations in HPV proteins. This review addresses the state of the art on the epidemiology of HPV-16 and HPV-18 intratype variants in the Mexican population, as well as their association with persistence, precancer and cervical cancer, and functional aspects related to their biological behavior.
APA, Harvard, Vancouver, ISO, and other styles
37

Kalashnikov, Dmitriy, Yuriy Borisov, and Elizaveta Kalashnikova. "Natural gas intracyclic attachment for energy generating unit based on gas turbine plant." E3S Web of Conferences 114 (2019): 06004. http://dx.doi.org/10.1051/e3sconf/201911406004.

Full text
Abstract:
In this article, problems of effectiveness increasing in complex power supply are considered. Disadvantages of centralized power engineering and advantages of power engineering capabilities organization in immediate consumer proximity are presented. Consumer needs satisfaction in electricity, heat supply and cold supply are offered to be realized by conversion of district and quarter boiler houses to trigeneration stations, which are based on gas turbine plants units. In this research, solutions of problem related to lack of fuel gas pressure for gas turbine engine power, which is included in gas turbine plant of trigeneration stations, are suggested. As a result, after considering possible variants of fuel gas pressure increasing, it was decided that there is a perspective of using fuel gas intracyclic compression attachment. Its operating principle involves organization of main steam extraction in heat cycle for booster compressor drive, which compresses fuel gas before its transfer to combustor of gas turbine plant. Results of gas compressor and drive steam turbine design are presented. These parts are included in fuel gas intracyclic compression attachment in specific unit of gas turbine plant. Also, general recommendations about new compressor and turbine stages design for any other units of gas turbine plant are pointed. Further, in the article, two variants of thermal circuit, based on gas turbine plant, are suggested. The first one is a circuit with hot water boiler, where exhaust gas recuperation after turbine is carried out for producing steam, related to fuel gas intracyclic compression attachment demands, and heat system water heating for consumer heat supply system. The second variant involves development of typical gas turbine plant unit in power station with exhaust boiler. There fuel gas intracyclic compression attachment is activated by steam work after exhaust boiler. Then, variants of diagram are compared between each other. Also advantages and disadvantages each of them are considered.
APA, Harvard, Vancouver, ISO, and other styles
38

Králiková, Ružena, Ervin Lumnitzer, Laura Džuňová, and Anna Yehorova. "Analysis of the Impact of Working Environment Factors on Employee’s Health and Wellbeing; Workplace Lighting Design Evaluation and Improvement." Sustainability 13, no. 16 (August 6, 2021): 8816. http://dx.doi.org/10.3390/su13168816.

Full text
Abstract:
In modern society, humans spend most of their time in the indoor environment (home, work, school...). This indoor lifestyle constantly poses challenges to our physical and mental health by affecting our hormone levels and circadian rhythm. This article deals with the possible connection between human and working environment factors and the emergence of health problems in connection with work. Using statistical methods, the dependence between the six characteristics (age, length of employment, visual demand of the work task, satisfaction with lighting conditions, and shift work) and occurrence of health-related problems and discomfort (i.e., eye discomfort, headache, eye fatigue, and seasonal affective disorder symptoms) was examined. The paper also deals with the evaluation of lighting conditions in the workshop using the lighting design software DIALux evo 9.2. Using this software, two lighting variants were modeled. The first simulated variant included lighting parameters according to the currently used luminaries and the second variant contained more efficient LED luminaries.
APA, Harvard, Vancouver, ISO, and other styles
39

Mosing, M. A., and N. L. Pedersen. "CAN GENETIC VARIANTS UNDERLYING SUBJECTIVE WELL-BEING PREDICT AGE-RELATED HEALTH PROBLEMS?" Innovation in Aging 1, suppl_1 (June 30, 2017): 982. http://dx.doi.org/10.1093/geroni/igx004.3550.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Valuitseva, Irina I., and Georgy T. Khukhuni. "The Norm of the Language Variant: Tendency to Unification or the fixation of the Difference?" Philological Sciences. Scientific Essays of Higher Education 2, no. 6 (November 2020): 187–93. http://dx.doi.org/10.20339/phs.6-20.187.

Full text
Abstract:
The article investigates a set of issues related to the functioning of a language outside its original territory from the point of view of codification of its specific features. The authors’ approach includes an analysis of the situation being developed in a certain period of time, taking into account diachronic retrospect and perspective. The article analyzes various interpretations of the problem of permissibility of normalization and codification of idioms that are formed as territorial variants of the language, their relation to the original form of the latter and the processes occurring in this form. A significant discrepancy is noted in relation to the concept of the norm of a language variant in certain cultures in different historical epochs, its dependence on the historical situation in which idioms, characterized as language variants, functioned and evolved, and a hypothesis is also suggested about possible ways of their further development. Special attention is paid to the position of Russian in Post-Soviet area and the possible consequences of the codification of its variants. The formation and development of the variants of Russian abroad is an objective process, their peculiarities may be used in literary work as productive stylistic devices. At the same time their fixation as the normative facts may provoke definite violation of the language unity.
APA, Harvard, Vancouver, ISO, and other styles
41

Kim, Woo Sung, Ji Hyun Kim, Jisun Lee, Su Yeon Ka, Hee Do Chae, Inji Jung, Sang Taek Jung, and Jung-Hyun Na. "Functional Expression of the Recombinant Spike Receptor Binding Domain of SARS-CoV-2 Omicron in the Periplasm of Escherichia coli." Bioengineering 9, no. 11 (November 10, 2022): 670. http://dx.doi.org/10.3390/bioengineering9110670.

Full text
Abstract:
A new severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) variant known as Omicron has caused a rapid increase in recent global patients with coronavirus infectious disease 2019 (COVID-19). To overcome the COVID-19 Omicron variant, production of a recombinant spike receptor binding domain (RBD) is vital for developing a subunit vaccine or a neutralizing antibody. Although bacterial expression has many advantages in the production of recombinant proteins, the spike RBD expressed in a bacterial system experiences a folding problem related to disulfide bond formation. In this study, the soluble Omicron RBD was obtained by a disulfide isomerase-assisted periplasmic expression system in Escherichia coli. The Omicron RBD purified from E. coli was very well recognized by anti-SARS-CoV-2 antibodies, sotrovimab (S309), and CR3022, which were previously reported to bind to various SARS-CoV-2 variants. In addition, the kinetic parameters of the purified Omicron RBD upon binding to the human angiotensin-converting enzyme 2 (ACE2) were similar to those of the Omicron RBD produced in the mammalian expression system. These results suggest that an E. coli expression system would be suitable to produce functional and correctly folded spike RBDs of the next emerging SARS-CoV-2 variants quickly and inexpensively.
APA, Harvard, Vancouver, ISO, and other styles
42

Yudina, Lyubov, Ekaterina Sukhova, Maxim Mudrilov, Vladimir Nerush, Anna Pecherina, Alexandr A. Smirnov, Alexey S. Dorokhov, Narek O. Chilingaryan, Vladimir Vodeneev, and Vladimir Sukhov. "Ratio of Intensities of Blue and Red Light at Cultivation Influences Photosynthetic Light Reactions, Respiration, Growth, and Reflectance Indices in Lettuce." Biology 11, no. 1 (January 1, 2022): 60. http://dx.doi.org/10.3390/biology11010060.

Full text
Abstract:
LED illumination can have a narrow spectral band; its intensity and time regime are regulated within a wide range. These characteristics are the potential basis for the use of a combination of LEDs for plant cultivation because light is the energy source that is used by plants as well as the regulator of photosynthesis, and the regulator of other physiological processes (e.g., plant development), and can cause plant damage under certain stress conditions. As a result, analyzing the influence of light spectra on physiological and growth characteristics during cultivation of different plant species is an important problem. In the present work, we investigated the influence of two variants of LED illumination (red light at an increased intensity, the “red” variant, and blue light at an increased intensity, the “blue” variant) on the parameters of photosynthetic dark and light reactions, respiration rate, leaf reflectance indices, and biomass, among other factors in lettuce (Lactuca sativa L.). The same light intensity (about 180 µmol m−2s−1) was used in both variants. It was shown that the blue illumination variant increased the dark respiration rate (35–130%) and cyclic electron flow around photosystem I (18–26% at the maximal intensity of the actinic light) in comparison to the red variant; the effects were dependent on the duration of cultivation. In contrast, the blue variant decreased the rate of the photosynthetic linear electron flow (13–26%) and various plant growth parameters, such as final biomass (about 40%). Some reflectance indices (e.g., the Zarco-Tejada and Miller Index, an index that is related to the core sizes and light-harvesting complex of photosystem I), were also strongly dependent on the illumination variant. Thus, our results show that the red illumination variant contributes a great deal to lettuce growth; in contrast, the blue variant contributes to stress changes, including the activation of cyclic electron flow around photosystem I.
APA, Harvard, Vancouver, ISO, and other styles
43

Leonardi, Emanuela, Mariagrazia Bellini, Maria C. Aspromonte, Roberta Polli, Anna Mercante, Claudia Ciaccio, Elisa Granocchio, et al. "A Novel WAC Loss of Function Mutation in an Individual Presenting with Encephalopathy Related to Status Epilepticus during Sleep (ESES)." Genes 11, no. 3 (March 24, 2020): 344. http://dx.doi.org/10.3390/genes11030344.

Full text
Abstract:
WAC (WW Domain Containing Adaptor With Coiled-Coil) mutations have been reported in only 20 individuals presenting a neurodevelopmental disorder characterized by intellectual disability, neonatal hypotonia, behavioral problems, and mildly dysmorphic features. Using targeted deep sequencing, we screened a cohort of 630 individuals with variable degrees of intellectual disability and identified five WAC rare variants: two variants were inherited from healthy parents; two previously reported de novo mutations, c.1661_1664del (p.Ser554*) and c.374C>A (p.Ser125*); and a novel c.381+2T>C variant causing the skipping of exon 4 of the gene, inherited from a reportedly asymptomatic father with somatic mosaicism. A phenotypic evaluation of this individual evidenced areas of cognitive and behavioral deficits. The patient carrying the novel splicing mutation had a clinical history of encephalopathy related to status epilepticus during slow sleep (ESES), recently reported in another WAC individual. This first report of a WAC somatic mosaic remarks the contribution of mosaicism in the etiology of neurodevelopmental and neuropsychiatric disorders. We summarized the clinical data of reported individuals with WAC pathogenic mutations, which together with our findings, allowed for the expansion of the phenotypic spectrum of WAC-related disorders.
APA, Harvard, Vancouver, ISO, and other styles
44

Alsamri, Mohammed T., Amnah Alabdouli, Durdana Iram, Alia M. Alkalbani, Ayesha S. Almarzooqi, Abdul-Kader Souid, and Ranjit Vijayan. "A Study on the Genetics of Primary Ciliary Dyskinesia." Journal of Clinical Medicine 10, no. 21 (October 30, 2021): 5102. http://dx.doi.org/10.3390/jcm10215102.

Full text
Abstract:
Primary ciliary dyskinesia (PCD) is a poorly understood disorder. It is primarily autosomal recessive and is prevalent in tribal communities of the United Arab Emirates due to consanguineous marriages. This retrospective study aimed to assess the pathogenicity of the genetic variants of PCD in indigenous patients with significant clinical respiratory problems. Pathogenicity scores of variants obtained from the chart review were consolidated using the Ensembl Variant Effect Predictor. The multidimensional dataset of scores was clustered into three groups based on their pathogenicity. Sequence alignment and the Jensen–Shannon Divergence (JSD) were generated to evaluate the amino acid conservation at the site of the variation. One-hundred and twelve variants of 28 genes linked to PCD were identified in 66 patients. Twenty-two variants were double heterozygous, two triple heterozygous, and seven homozygous. Of the thirteen novel variants, two, c.11839 + 1G > A in dynein, axonemal, heavy chain 11 (DNAH11) and p.Lys92Trpfs in dynein, axonemal, intermediate chain 1 (DNAI1) were associated with dextrocardia with situs inversus, and one, p.Gly21Val in coiled-coil domain-containing protein 40 (CCDC40), with absent inner dynein arms. Homozygous C1orf127:p.Arg113Ter (rs558323413) was also associated with laterality defects in two related patients. The majority of variants were missense involving conserved residues with a median JSD score of 0.747. Homology models of two deleterious variants in the stalk of DNAH11, p.Gly3102Asp and p.Leu3127Arg, revealed structural importance of the conserved glycine and leucine. These results define potentially damaging PCD variants in the region. Future studies, however, are needed to fully comprehend the genetic underpinnings of PCD.
APA, Harvard, Vancouver, ISO, and other styles
45

Babă, Alexandru, Monica Iordache, Eduard Niţu, Aurel Costea, Doina Iacomi, and Sergiu Tonoiu. "The Automatic Configuration Method of Modular Structures Composing Multi-Axis Heads." Applied Mechanics and Materials 371 (August 2013): 426–30. http://dx.doi.org/10.4028/www.scientific.net/amm.371.426.

Full text
Abstract:
The important characteristic of modern technological engineering is the systemic approach through unification and typification of problems related to production processes and equipment. The multi-criterial analysis of solutions and connections is difficult under the conditions in which the accelerated generalization of technological innovation determines sometimes an exaggerated diversification of constructive variants. Our researches, presented in this paper, provide original solutions for the development and organisation of modular structures in a computerized data base, the elaboration and use of a new method to automatically configure and reconfigure them using a computer programme. In this way we obtained the optimal variant to construct and operate completely modularized adjustable multi-spindle ends.
APA, Harvard, Vancouver, ISO, and other styles
46

Lecoutre, Marie-Paule, Evelyne Clément, and Bruno Lecoutre. "Failure to Construct and Transfer Correct Representations across Probability Problems." Psychological Reports 94, no. 1 (February 2004): 151–62. http://dx.doi.org/10.2466/pr0.94.1.151-162.

Full text
Abstract:
Previous studies carried out on “purely random” situations (with dice or poker chips) show the difficulties encountered by people in such situations, however simple they may be. In fact, in this type of situation, prior knowledge guides spontaneous representations, and the “errors” observed could be explained by the activation of “implicit models” which form the basis of erroneous representations. 42 statistically naïve undergraduates were given several variants of a probability problem on which errors are common. In a learning phase, subjects were given four problems involving geometric figures which were pairwise related by complementarity and equivalence relations. In a subsequent transfer phase, they were given a fifth problem involving poker chips, which was structurally isomorphic to the fourth geometric-figures problem. The findings show that people do not realize the relations between problems, and that transfer occurred only for the subset of subjects who performed correctly on the training problems of the learning phase. These results appear to have some significant implications in teaching mathematical concepts.
APA, Harvard, Vancouver, ISO, and other styles
47

HOLZER, MARKUS, and SEBASTIAN JAKOBI. "FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS." International Journal of Foundations of Computer Science 24, no. 07 (November 2013): 1083–97. http://dx.doi.org/10.1142/s0129054113400327.

Full text
Abstract:
We introduce E-equivalence, which is a straightforward generalization of almost-equivalence. While almost-equivalence asks for ordinary equivalence up to a finite number of exceptions, in E-equivalence these exceptions or errors must belong to a (regular) set E. The computational complexity of deterministic finite automata (DFAs) minimization problems and their variants w.r.t. almost- and E-equivalence are studied. We show that there is a significant difference in the complexity of problems related to almost-equivalence, and those related to E-equivalence. Moreover, since hyper-minimal and E-minimal automata are not necessarily unique (up to isomorphism as for minimal DFAs), we consider the problem of counting the number of these minimal automata.
APA, Harvard, Vancouver, ISO, and other styles
48

Stavitsky, Vladimir Vyacheslavovish. "Findings on the local version of Elshanskaya culture." Samara Journal of Science 5, no. 4 (December 15, 2016): 74–77. http://dx.doi.org/10.17816/snv20164201.

Full text
Abstract:
The article deals with the problem of the local variants allocation of Elhanskaya culture. The question of the local variants allocation was first raised and substantiated in the dissertation of K.M. Andreev. Based on the analysis of ceramic traditions, he distinguished two variants of the Elshanskaya culture: the east and the west. To the east variant he attributed the settlements of Samara-Volga, the Middle Posur and the basin of the Sviyaga, to the west - the settlements of the Upper Primokshanye and Prihoperya. The uniting of elshansky monuments of Samara-Volga and Central Posur seems inappropriate. Pottery from these settlements has a number of significant differences in the ornamentation of the vessels and the technology of preparation of clay dough. By its appearance ceramics of Prisursky settlements are closer to the Antiquities of Primokshanye. Primokshansky settlements materials should be seen as a part of one-time pulse at the end of the VII Millennium BC. The further development of the local population traditions, apparently, was no longer associated with the classical antiquities of the Elshanskaya culture. The late materials of the Alatyrsky Posur settlements, related to the mid-VI millennium BC, apparently, should be considered in the context of the cultural tradition of the Lugovoye III - the Krasny gorodok settlements.
APA, Harvard, Vancouver, ISO, and other styles
49

Febrian, Andreas, and Oenardi Lawanto. "Do Computer Science Students Understand Their Programming Task?—A Case Study of Solving the Josephus Variant Problem." International Education Studies 11, no. 12 (November 27, 2018): 26. http://dx.doi.org/10.5539/ies.v11n12p26.

Full text
Abstract:
The ability of students to problem solve begins with interpreting the problem. When they interpret the problem inaccurately, they will likely use ineffective strategies or fail to solve the problem. Studies reported students are often incapable of identifying and articulating the problem goal, requirements/constraints, and expected output. In other words, students lack self-regulation skills, especially related to task understanding. In this study, two male and two female senior computer science students from Utah State University, USA, were recruited as research participants to learn more about their task understanding skills while engage in programming tasks. The participants were asked to answer five programming problems while thinking aloud, and their responses were video- and audio-recorded. This report focuses on one of the problems, which was a variant of the Josephus problem. Three research questions were used to guide the analysis: (a) what were the participants&rsquo; initial task understanding; (b) how did it change during the problem-solving endeavor; and (c) why did it change. All participants identified the problem goal inaccurately and as a result, selected ineffective problem-solving strategies. The analysis suggested their inaccurate task interpretations were caused by their confidence bias (i.e., a systematic cognitive error), in which they drew knowledge and strategies from irrelevant experience. Out of four participants, only one was able to defeat the confidence bias and acquired an accurate task understanding; the influencing factors and possible interventions to overcome confidence bias are discussed.
APA, Harvard, Vancouver, ISO, and other styles
50

Tan, Shi-Yi, and Wei-Chang Yeh. "The Vehicle Routing Problem: State-of-the-Art Classification and Review." Applied Sciences 11, no. 21 (November 2, 2021): 10295. http://dx.doi.org/10.3390/app112110295.

Full text
Abstract:
Transportation planning has been established as a key topic in the literature and social production practices. An increasing number of researchers are studying vehicle routing problems (VRPs) and their variants considering real-life applications and scenarios. Furthermore, with the rapid growth in the processing speed and memory capacity of computers, various algorithms can be used to solve increasingly complex instances of VRPs. In this study, we analyzed recent literature published between 2019 and August of 2021 using a taxonomic framework. We reviewed recent research according to models and solutions, and divided models into three categories of customer-related, vehicle-related, and depot-related models. We classified solution algorithms into exact, heuristic, and meta-heuristic algorithms. The main contribution of our study is a classification table that is available online as Appendix A. This classification table should enable future researchers to find relevant literature easily and provide readers with recent trends and solution methodologies in the field of VRPs and some well-known variants.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography