نتایج جستجو برای: minimisation of switching net

تعداد نتایج: 21179905  

Journal: :J. Comput. Physics 2009
Marco Caliari Alexander Ostermann Stefan Rainer Mechthild Thalhammer

In this paper, we present a minimisation method for computing the ground state of systems of coupled Gross–Pitaevskii equations. Our approach relies on a spectral decomposition of the solution into Hermite basis functions. Inserting the spectral representation into the energy functional yields a constrained nonlinear minimisation problem for the coefficients. For its numerical solution, we empl...

2014
Muireann Á. Lynch

We examine the payoffs to electrical interconnection between isolated systems considering minimisation of both costs and variability. We demonstrate that optimal interconnection portfolios cannot be derived analytically and must be simulated numerically. We present a mixed-integer linear programme which maximises payoff to interconnection and simulates the operation of stylised electricity syst...

This paper presents a novel RF MEMS (Micro Electromechanical System) fixed-fixed switch for very fast switching. Using the obtained equations, the switching time depends on the stiffness and effective mass of the switch beam so that the switching time will be decreased by higher stiffness (spring constant) and lower effective mass. In new design, the suspension bridge is a three-layer beam so t...

Journal: :Bioresource technology 2014
Galilee U Semblante Faisal I Hai Huu H Ngo Wenshan Guo Sheng-Jie You William E Price Long D Nghiem

Alternate cycling of sludge in aerobic, anoxic, and anaerobic regimes is a promising strategy that can reduce the sludge yield of conventional activated sludge (CAS) by up to 50% with potentially lower capital and operating cost than physical- and/or chemical-based sludge minimisation techniques. The mechanisms responsible for reducing sludge yield include alterations to cellular metabolism and...

Journal: :Journal of Systems and Software 2010
Shin Yoo Mark Harman

Test suite minimisation techniques seek to reduce the effort required for regression testing by selecting a subset of test suites. In previous work, the problem has been considered as a single-objective optimisation problem. However, real world regression testing can be a complex process in which multiple testing criteria and constraints are involved. This paper presents the concept of Pareto e...

1998
H. Hermanns M. Siegle

Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, various proposals for compositional aggregation have been made. They rely on minimisation with respect to a congruence relation. This paper addre...

1999
Holger Hermanns Markus Siegle

Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, various proposals for compositional aggregation have been made. They rely on minimisation with respect to a congruence relation. This paper addre...

2010
Shin Yoo Mark Harman

Regression testing is a testing activity that is performed to provide confidence that changes do not harm the existing behaviour of the software. Test suites tend to grow in size as software evolve, often making it too costly to execute entire test suites. A number of different approaches have been studied to maximise the value of the accrued test suite: minimisation, selection and prioritisati...

2009
Shin Yoo Mark Harman

Regression testing is a testing activity that is performed to provide confidence that changes do not harm the existing behaviour of the software. Test suites tend to grow in size as software evolve, often making it too costly to execute entire test suites. A number of different approaches have been studied to maximise the value of the accrued test suite: minimisation, selection and prioritisati...

Journal: :CoRR 2010
Sven Schewe

In this report we study the problem of minimising deterministic automata over finite and infinite words. Deterministic finite automata are the simplest devices to recognise regular languages, and deterministic Büchi, Co-Büchi, and parity automata play a similar role in the recognition of ω-regular languages. While it is well known that the minimisation of deterministic finite and weak automata ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید