Search results for "ta111"

showing 10 items of 251 documents

Wastewater treatment plant design and operation under multiple conflicting objective functions

2013

Wastewater treatment plant design and operation involve multiple objective functions, which are often in conflict with each other. Traditional optimization tools convert all objective functions to a single objective optimization problem (usually minimization of a total cost function by using weights for the objective functions), hiding the interdependencies between different objective functions. We present an interactive approach that is able to handle multiple objective functions simultaneously. As an illustration of our approach, we consider a case study of plant-wide operational optimization where we apply an interactive optimization tool. In this tool, a commercial wastewater treatment …

EngineeringMathematical optimizationEnvironmental Engineeringbusiness.industryTotal costEcological Modelingmedia_common.quotation_subjectta111computer.software_genreMulti-objective optimizationSimulation softwareDynamic simulationSoftwareTest functions for optimizationMinificationbusinessFunction (engineering)computerSoftwaremedia_commonEnvironmental Modelling & Software
researchProduct

Hill's Equation in the Arm Push of Shot Put

2016

Aims: The purpose of this paper was to continue the previous study of arm rotation movement where A.V. Hill’s force-velocity relationship was transformed into a constant maximum power model consisting of three different components of power. Methodology: In the present study a new model of Hill’s equation was applied for accelerated motions. This theoretically derived model of further development of Hill’s force-velocity relationship was tested by fitting it into two arm push measurements of shot put experiments. The results of the further development of Hill’s equation for accelerated motions were compared with the mechanics of the constant power model of the previous study. Results: The an…

Engineeringta222Mechanical engineering02 engineering and technology01 natural sciencesarm push in shot putforce-velocity relationship0103 physical sciences010303 astronomy & astrophysicsta119muscle powerarm movementta114business.industryta111Muscle mechanicsGeneral MedicineMechanics021001 nanoscience & nanotechnologyShot putmuscle mechanicsHill’s equationMuscle power0210 nano-technologybusinessBritish Journal of Applied Science & Technology
researchProduct

Fast MATLAB assembly of FEM matrices in 2D and 3D: Edge elements

2014

We propose an effective and flexible way to assemble finite element stiffness and mass matrices in MATLAB. We apply this for problems discretized by edge finite elements. Typical edge finite elements are Raviart-Thomas elements used in discretizations of H(div) spaces and Nedelec elements in discretizations of H(curl) spaces. We explain vectorization ideas and comment on a freely available MATLAB code which is fast and scalable with respect to time.

FOS: Computer and information sciencesDiscretizationfinite element method97N80 65M60Matlab codeComputational scienceMathematics::Numerical AnalysisMATLAB code vectorizationmedicineFOS: MathematicsMathematics - Numerical AnalysisMATLABMathematicscomputer.programming_languageCurl (mathematics)ta113Nédélec elementApplied Mathematicsta111StiffnessRaviart–Thomas elementMixed finite element methodNumerical Analysis (math.NA)Finite element methodComputational Mathematicsedge elementScalabilityComputer Science - Mathematical Softwaremedicine.symptomcomputerMathematical Software (cs.MS)
researchProduct

Abelian Powers and Repetitions in Sturmian Words

2016

Richomme, Saari and Zamboni (J. Lond. Math. Soc. 83: 79-95, 2011) proved that at every position of a Sturmian word starts an abelian power of exponent $k$ for every $k > 0$. We improve on this result by studying the maximum exponents of abelian powers and abelian repetitions (an abelian repetition is an analogue of a fractional power) in Sturmian words. We give a formula for computing the maximum exponent of an abelian power of abelian period $m$ starting at a given position in any Sturmian word of rotation angle $\alpha$. vAs an analogue of the critical exponent, we introduce the abelian critical exponent $A(s_\alpha)$ of a Sturmian word $s_\alpha$ of angle $\alpha$ as the quantity $A(s_\a…

FOS: Computer and information sciencesFibonacci numberGeneral Computer ScienceDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Computer Science - Formal Languages and Automata Theory0102 computer and information sciences01 natural sciencesTheoretical Computer ScienceCombinatoricsFOS: MathematicsMathematics - Combinatorics[INFO]Computer Science [cs]Number Theory (math.NT)0101 mathematicsAbelian groupContinued fractionFibonacci wordComputingMilieux_MISCELLANEOUSQuotientMathematicsMathematics - Number Theoryta111010102 general mathematicsComputer Science (all)Sturmian wordSturmian wordAbelian period; Abelian power; Critical exponent; Lagrange constant; Sturmian word; Theoretical Computer Science; Computer Science (all)Abelian periodLagrange constantCritical exponentAbelian power010201 computation theory & mathematicsBounded functionExponentCombinatorics (math.CO)Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

Enumeration and Structure of Trapezoidal Words

2013

Trapezoidal words are words having at most $n+1$ distinct factors of length $n$ for every $n\ge 0$. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their enumeration. We then separate trapezoidal words into two disjoint classes: open and closed. A trapezoidal word is closed if it has a factor that occurs only as a prefix and as a suffix; otherwise it is open. We investigate open and closed trapezoidal words, in relation with their special factors. We prove that Sturmian palindromes are closed trapezoidal words and that a closed trapezoidal word is a Sturmian palindrome if and only if its longest repeated …

FOS: Computer and information sciencesFibonacci numberSpecial factorGeneral Computer ScienceFormal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata TheoryEnumerative formulaDisjoint sets68R15Theoretical Computer ScienceFOS: MathematicsPalindromeMathematics - CombinatoricsClosed wordsFibonacci wordMathematicsDiscrete mathematicsClosed wordSequenceta111Sturmian wordPrefixCombinatorics on wordsRich wordtrapezoidal wordF.4.3Combinatorics (math.CO)SuffixWord (group theory)Computer Science(all)
researchProduct

Unbiased Estimators and Multilevel Monte Carlo

2018

Multilevel Monte Carlo (MLMC) and unbiased estimators recently proposed by McLeish (Monte Carlo Methods Appl., 2011) and Rhee and Glynn (Oper. Res., 2015) are closely related. This connection is elaborated by presenting a new general class of unbiased estimators, which admits previous debiasing schemes as special cases. New lower variance estimators are proposed, which are stratified versions of earlier unbiased schemes. Under general conditions, essentially when MLMC admits the canonical square root Monte Carlo error rate, the proposed new schemes are shown to be asymptotically as efficient as MLMC, both in terms of variance and cost. The experiments demonstrate that the variance reduction…

FOS: Computer and information sciencesMonte Carlo methodWord error rate010103 numerical & computational mathematicsstochastic differential equationManagement Science and Operations ResearchStatistics - Computation01 natural sciences010104 statistics & probabilityStochastic differential equationstratificationSquare rootFOS: MathematicsApplied mathematics0101 mathematicsComputation (stat.CO)stokastiset prosessitMathematicsProbability (math.PR)ta111EstimatorVariance (accounting)unbiased estimatorsComputer Science ApplicationsMonte Carlo -menetelmät65C05 (Primary) 65C30 (Secondary)efficiencykerrostuneisuusVariance reductionunbiasemultilevel Monte CarlodifferentiaaliyhtälötMathematics - ProbabilityOperations Research
researchProduct

Reliability analysis of processes with moving cracked material

2015

Abstract The reliability of processes with moving elastic and isotropic material containing initial cracks is considered in terms of fracture. The material is modelled as a moving plate which is simply supported from two of its sides and subjected to homogeneous tension acting in the travelling direction. For tension, two models are studied: (i) tension is constant with respect to time, and (ii) tension varies temporally according to an Ornstein–Uhlenbeck process. Cracks of random length are assumed to occur in the material according to a stochastic counting process. For a general counting process, a representation of the nonfracture probability of the system is obtained that exploits condi…

FOS: Computer and information sciencesStochastic modellingBoundary (topology)02 engineering and technologyComputational Engineering Finance and Science (cs.CE)0203 mechanical engineeringfirst passage timeComputer Science - Computational Engineering Finance and Sciencestochastic modelMathematics040101 forestryta214Counting processTension (physics)Applied Mathematicsta111Mathematical analysisIsotropyOrnstein–Uhlenbeck process04 agricultural and veterinary sciencesmoving material020303 mechanical engineering & transportsfractureModeling and Simulation0401 agriculture forestry and fisheriesOrnstein-Uhlenbeck processFirst-hitting-time modelConstant (mathematics)Applied Mathematical Modelling
researchProduct

Surrogate outcomes and transportability

2019

Identification of causal effects is one of the most fundamental tasks of causal inference. We consider an identifiability problem where some experimental and observational data are available but neither data alone is sufficient for the identification of the causal effect of interest. Instead of the outcome of interest, surrogate outcomes are measured in the experiments. This problem is a generalization of identifiability using surrogate experiments and we label it as surrogate outcome identifiability. We show that the concept of transportability provides a sufficient criteria for determining surrogate outcome identifiability for a large class of queries.

FOS: Computer and information scienceskokeilucausalityGeneralizationComputer scienceComputer Science - Artificial Intelligence02 engineering and technologyMachine learningcomputer.software_genreOutcome (game theory)Theoretical Computer ScienceMethodology (stat.ME)do-calculusArtificial Intelligence020204 information systemsalgoritmit0202 electrical engineering electronic engineering information engineeringStatistics - Methodologyta113päättelyta112experimentbusiness.industrySurrogate endpointverkkoteoriaApplied MathematicsCausal effectta111graphidentifiabilityIdentification (information)Artificial Intelligence (cs.AI)Causal inferencekausaliteettiIdentifiability020201 artificial intelligence & image processingObservational studyArtificial intelligencebusinessmediatorcomputerSoftware
researchProduct

Coherent Quantum Tomography

2016

We discuss a quantum mechanical indirect measurement method to recover a position dependent Hamilton matrix from time evolution of coherent quantum mechanical states through an object. A mathematical formulation of this inverse problem leads to weighted X-ray transforms where the weight is a matrix. We show that such X-ray transforms are injective with very rough weights. Consequently, we can solve our quantum mechanical inverse problem in several settings, but many physically relevant problems we pose also remain open. We discuss the physical background of the proposed imaging method in detail. We give a rigorous mathematical treatment of a neutrino tomography method that has been previous…

FOS: Physical sciences01 natural sciencesMatrix (mathematics)neutrino physics0103 physical sciencesClassical Analysis and ODEs (math.CA)FOS: MathematicsStatistical physics0101 mathematics010306 general physicsQuantumMathematical PhysicsMathematicsQuantum Physicsinverse problemsgeophysicsApplied Mathematicsta111quantum mechanics010102 general mathematicsMathematical analysisTime evolutionweighted ray transformsMathematical Physics (math-ph)81Q99 81V99 86A22 44A12Inverse problemQuantum tomographyInjective functionComputational MathematicsMathematics - Classical Analysis and ODEsTomographyNeutrinoQuantum Physics (quant-ph)AnalysisSIAM Journal on Mathematical Analysis
researchProduct

On differences and similarities in the analysis of Lorenz, Chen, and Lu systems

2015

Currently it is being actively discussed the question of the equivalence of various Lorenz-like systems and the possibility of universal consideration of their behavior (Algaba et al., 2013a,b, 2014b,c; Chen, 2013; Chen and Yang, 2013; Leonov, 2013a), in view of the possibility of reduction of such systems to the same form with the help of various transformations. In the present paper the differences and similarities in the analysis of the Lorenz, the Chen and the Lu systems are discussed. It is shown that the Chen and the Lu systems stimulate the development of new methods for the analysis of chaotic systems. Open problems are discussed.

FOS: Physical sciencesLyapunov exponentLorenz-like systemsLu systemChaotic analog of 16th Hilbert problemReduction (complexity)symbols.namesakeChenDevelopment (topology)Lorenz systemChaotic systemsCalculusApplied mathematicsEquivalence (measure theory)MathematicsbiologyApplied Mathematicsta111Lorenz systembiology.organism_classificationNonlinear Sciences - Chaotic DynamicsComputational MathematicsChen systemsymbolsChaotic Dynamics (nlin.CD)Lyapunov exponentApplied Mathematics and Computation
researchProduct