Search results for "Regular"

showing 10 items of 855 documents

Advanced microscopy analysis of the micro-nanoscale architecture of human menisci

2019

AbstractThe complex inhomogeneous architecture of the human meniscal tissue at the micro and nano scale in the absence of artefacts introduced by sample treatments has not yet been fully revealed. The knowledge of the internal structure organization is essential to understand the mechanical functionality of the meniscus and its relationship with the tissue’s complex structure. In this work, we investigated human meniscal tissue structure using up-to-date non-invasive imaging techniques, based on multiphoton fluorescence and quantitative second harmonic generation microscopy complemented with Environmental Scanning Electron Microscopy measurements. Observations on 50 meniscal samples extract…

Materials sciencemultiphoton imaging SHG meniscus collagen elastin enviromental semScience0206 medical engineeringBiophysicslcsh:MedicineRegular wave02 engineering and technologyMenisci TibialArticleBiophysical Phenomena03 medical and health sciences0302 clinical medicineImaging Three-DimensionalCollagen fibresMicroscopyHumansMeniscuslcsh:ScienceEnvironmental scanning electron microscopeNanoscopic scaleMicroscopyMultidisciplinaryMeniscal tissuebiologylcsh:RQR030229 sport sciencesSecond Harmonic Generation Microscopy020601 biomedical engineeringSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)Elastinbiology.proteinMicroscopy Electron ScanningMedicinelcsh:QCollagenAnatomySettore ICAR/08 - Scienza Delle CostruzioniElastinBiomedical engineeringScientific Reports
researchProduct

CLEASE: a versatile and user-friendly implementation of cluster expansion method

2018

Materials exhibiting a substitutional disorder such as multicomponent alloys and mixed metal oxides/oxyfluorides are of great importance in many scientific and technological sectors. Disordered materials constitute an overwhelmingly large configurational space, which makes it practically impossible to be explored manually using first-principles calculations such as density functional theory due to the high computational costs. Consequently, the use of methods such as cluster expansion (CE) is vital in enhancing our understanding of the disordered materials. CE dramatically reduces the computational cost by mapping the first-principles calculation results on to a Hamiltonian which is much fa…

Materials sciencetilastomenetelmätFOS: Physical sciencesBinary number02 engineering and technology114 Physical sciences01 natural sciencesComputational sciencesymbols.namesake0103 physical sciencesAlloysbattery materialGeneral Materials Sciencemetalliseoksetmateriaalitiede010306 general physicsMonte CarloCondensed Matter - Materials ScienceUser FriendlyMixed metalMaterials Science (cond-mat.mtrl-sci)disordered materials021001 nanoscience & nanotechnologyCondensed Matter Physicscluster expansionComplex materialsMonte Carlo -menetelmätRegularization (physics)symbolsDensity functional theory0210 nano-technologyHamiltonian (quantum mechanics)Cluster expansionJournal of Physics: Condensed Matter
researchProduct

Matheuristics for the irregular bin packing problem with free rotations

2017

[EN] We present a number of variants of a constructive algorithm able to solve a wide variety of variants of the Two-Dimensional Irregular Bin Packing Problem (2DIBPP). The aim of the 2DIBPP is to pack a set of irregular pieces, which may have concavities, into stock sheets (bins) with fixed dimensions in such a way that the utilization is maximized. This problem is inspired by a real application from a ceramic company in Spain. In addition, this problem arises in other industries such as the garment industry or ship building. The constructive procedure presented in this paper allows both free orientation for the pieces, as in the case of the ceramic industry, or a finite set of orientation…

Mathematical optimization021103 operations researchInformation Systems and ManagementGeneral Computer ScienceBin packing problemESTADISTICA E INVESTIGACION OPERATIVA0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchStrip packingTwo-dimensional irregular bin packingConstructiveIndustrial and Manufacturing EngineeringBinCutting and packingSet packingCutting stock problemModeling and Simulation0202 electrical engineering electronic engineering information engineeringInteger Programing020201 artificial intelligence & image processingFree rotationFinite setMathematics
researchProduct

A Proximal Solution for a Class of Extended Minimax Location Problem

2005

We propose a proximal approach for solving a wide class of minimax location problems which in particular contains the round trip location problem. We show that a suitable reformulation of the problem allows to construct a Fenchel duality scheme the primal-dual optimality conditions of which can be solved by a proximal algorithm. This approach permits to solve problems for which distances are measured by mixed norms or gauges and to handle a large variety of convex constraints. Several numerical results are presented.

Mathematical optimizationClass (set theory)Optimality criterionComputer scienceScheme (mathematics)1-center problemRegular polygonMinimax problemConstruct (python library)Variety (universal algebra)Minimax
researchProduct

A challenging family of automata for classical minimization algorithms

2010

In this paper a particular family of deterministic automata that was built to reach the worst case complexity of Hopcroft's state minimization algorithm is considered. This family is also challenging for the two other classical minimization algorithms: it achieves the worst case for Moore's algorithm, as a consequence of a result by Berstel et al., and is of at least quadratic complexity for Brzozowski's solution, which is our main contribution. It therefore constitutes an interesting family, which can be useful to measure the efficiency of implementations of well-known or new minimization algorithms.

Mathematical optimizationComputer science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciences02 engineering and technology01 natural sciencesMeasure (mathematics)Classical Minimization AlgorithmAutomatonRegular languageDFA minimization010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringWorst-case complexity020201 artificial intelligence & image processingMinificationState (computer science)AlgorithmComputer Science::Formal Languages and Automata TheoryComputingMilieux_MISCELLANEOUS
researchProduct

Metric regularity and second-order necessary optimality conditions for minimization problems under inclusion constraints

1994

In this paper, we establish some general metric regularity results for multivalued functions on Banach spaces. Then, we apply them to derive second-order necessary optimality conditions for the problem of minimizing a functionf on the solution set of an inclusion 0?F(x) withx?C, whenF has a closed convex second-order derivative.

Mathematical optimizationControl and OptimizationMultivalued functionApplied MathematicsTheory of computationSolution setRegular polygonBanach spaceMinificationManagement Science and Operations ResearchDirectional derivativeMathematicsJournal of Optimization Theory and Applications
researchProduct

Passivity-based output feedback control of Markovian jump systems with discrete and distributed time-varying delays

2013

In this article, we present a new method in designing mode-dependent passivity-based output feedback controllers for Markovian jump systems with time-varying delays. Both discrete and distributed delays are considered in the model. A Lyapunov–Krasovskii function is constructed to establish new required sufficient conditions for ensuring exponentially mean-square stability and the passivity criteria, simultaneously. The method produces linear matrix inequality formulation that allows obtaining controller gains based on a convex optimisation method. Finally, a numerical example is given to illustrate the effectiveness of our approach.

Mathematical optimizationExponential growthControl and Systems EngineeringControl theoryPassivityControl (management)Linear matrix inequalityRegular polygonFunction (mathematics)Stability (probability)Computer Science ApplicationsTheoretical Computer ScienceMathematicsInternational Journal of Systems Science
researchProduct

Optimality conditions for nondifferentiable convex semi-infinite programming

1983

This paper gives characterizations of optimal solutions to the nondifferentiable convex semi-infinite programming problem, which involve the notion of Lagrangian saddlepoint. With the aim of giving the necessary conditions for optimality, local and global constraint qualifications are established. These constraint qualifications are based on the property of Farkas-Minkowski, which plays an important role in relation to certain systems obtained by linearizing the feasible set. It is proved that Slater's qualification implies those qualifications.

Mathematical optimizationGeneral MathematicsFeasible regionMathematics::Optimization and ControlRegular polygonConstraint satisfactionSemi-infinite programmingConstraint (information theory)Convex optimizationConstraint logic programmingComputer Science::Programming LanguagesConvex functionSoftwareMathematicsMathematical Programming
researchProduct

COMPUTATION OF LOCAL VOLATILITIES FROM REGULARIZED DUPIRE EQUATIONS

2005

We propose a new method to calibrate the local volatility function of an asset from observed option prices of the underlying. Our method is initialized with a preprocessing step in which the given data are smoothened using cubic splines before they are differentiated numerically. In a second step the Dupire equation is rewritten as a linear equation for a rational expression of the local volatility. This equation is solved with Tikhonov regularization, using some discrete gradient approximation as penalty term. We show that this procedure yields local volatilities which appear to be qualitatively correct.

Mathematical optimizationMathematicsofComputing_NUMERICALANALYSISBlack–Scholes modelFunction (mathematics)Inverse problemBlack–Scholes model Dupire equation local volatility inverse problem regularization numerical differentiationRegularization (mathematics)Tikhonov regularizationLocal volatilityComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONNumerical differentiationApplied mathematicsGeneral Economics Econometrics and FinanceFinanceLinear equationMathematicsInternational Journal of Theoretical and Applied Finance
researchProduct

model reduction for continuous-time Markovian jump systems with incomplete statistics of mode information

2013

This paper investigates the problem of model reduction for a class of continuous-time Markovian jump linear systems with incomplete statistics of mode information, which simultaneously considers the exactly known, partially unknown and uncertain transition rates. By fully utilising the properties of transition rate matrices, together with the convexification of uncertain domains, a new sufficient condition for performance analysis is first derived, and then two approaches, namely, the convex linearisation approach and the iterative approach, are developed to solve the model reduction problem. It is shown that the desired reduced-order models can be obtained by solving a set of strict linear…

Mathematical optimizationModel reductionbusiness.industryMarkovian jump systemsRegular polygonLinear matrix inequalityComputer Science Applications1707 Computer Vision and Pattern RecognitionLinear matrixLinear matrix inequalityTransition rate matrixIncomplete statistics of mode informationComputer Science ApplicationsTheoretical Computer ScienceMarkovian jump linear systemsMarkovian jumpSoftwareControl and Systems EngineeringStatisticsIncomplete statistics of mode information; Linear matrix inequality; Markovian jump systems; Model reduction; Control and Systems Engineering; Theoretical Computer Science; Computer Science Applications1707 Computer Vision and Pattern RecognitionDesign methodsbusinessMathematicsInternational Journal of Systems Science
researchProduct