Search results for "MULT"

showing 10 items of 17528 documents

E-NAUTILUS: A decision support system for complex multiobjective optimization problems based on the NAUTILUS method

2015

Interactive multiobjective optimization methods cannot necessarily be easily used when (industrial) multiobjective optimization problems are involved. There are at least two important factors to be considered with any interactive method: computationally expensive functions and aspects of human behavior. In this paper, we propose a method based on the existing NAUTILUS method and call it the Enhanced NAUTILUS (E-NAUTILUS) method. This method borrows the motivation of NAUTILUS along with the human aspects related to avoiding trading-off and anchoring bias and extends its applicability for computationally expensive multiobjective optimization problems. In the E-NAUTILUS method, a set of Pareto…

ta113Decision support systemMathematical optimizationInformation Systems and ManagementOptimization problemMultiple criteria optimizationGeneral Computer ScienceComputer sciencePareto principleTrading-offManagement Science and Operations ResearchSpace (commercial competition)Multiple objective programmingMulti-objective optimizationIndustrial and Manufacturing EngineeringSet (abstract data type)Modeling and SimulationPoint (geometry)Computational costInteractive methodsEuropean Journal of Operational Research
researchProduct

Shape Sensitivity Analysis and Gradient-Based Optimization of Large Structures Using MLFMA

2014

A fast method for computing the action of shape-differentiated electric field integral equation (EFIE) system matrix to a vector is derived exploiting the multilevel fast multipole algorithm (MLFMA). The proposed method is used in conjunction with the adjoint-variable method (AVM) to compute the shape gradient of arbitrary objective functions depending on shape of a metallic scatterer. The method is demonstrated numerically by optimizing the shape of a parabolic reflector illuminated with a half-wave dipole.

ta113DipoleParabolic reflectorGradient based algorithmMathematical analysisShape gradientSensitivity (control systems)Electrical and Electronic EngineeringElectric-field integral equationMultipole expansionAction (physics)MathematicsIEEE Transactions on Antennas and Propagation
researchProduct

How and Why to Start and Run a SIGCHI Local Chapter

2015

There is a vast and increasing interest towards local HCI communities around the globe and in particular on geographical areas in which HCI has only recently started to gain increasing interest by local industries as well as academic institutions. A SIGCHI Local Chapter is one of the ways a local HCI community can organize and get visibility and support for their activities. However, many active volunteers in this field might not be aware of this possibility. The main goal of the Chapters' SIG in CHI'15 is to inform interested parties of SIGCHI Local Chapters and to find ways in which SIGCHI could better support local HCI communities with their various needs all over the world.

ta113Human-Computer Interaction (HCI)ComputingMilieux_THECOMPUTINGPROFESSIONMultimediabusiness.industryField (Bourdieu)local communitiesVisibility (geometry)GlobePublic relationsSpecial Interest Groupcomputer.software_genreLocal communityspecial interest groupsInformationSystems_MODELSANDPRINCIPLESmedicine.anatomical_structurePolitical sciencemedicineInformationSystems_MISCELLANEOUSbusinesscomputerProceedings of the 33rd Annual ACM Conference Extended Abstracts on Human Factors in Computing Systems
researchProduct

Interactive Multiple Criteria Decision Making based on preference driven Evolutionary Multiobjective Optimization with controllable accuracy

2012

Abstract We present an approach to interactive Multiple Criteria Decision Making based on preference driven Evolutionary Multiobjective Optimization with controllable accuracy. The approach relies on formulae for lower and upper bounds on coordinates of the outcome of an arbitrary efficient variant corresponding to preference information expressed by the Decision Maker. In contrast to earlier works on that subject, here lower and upper bounds can be calculated and their accuracy controlled entirely within evolutionary computation framework. This is made possible by exploration of not only the region of feasible variants – a standard within evolutionary optimization, but also the region of i…

ta113Mathematical optimizationInformation Systems and ManagementGeneral Computer ScienceComputationta111Contrast (statistics)Interactive evolutionary computationManagement Science and Operations ResearchMulti-objective optimizationOutcome (game theory)Industrial and Manufacturing EngineeringEvolutionary computationModeling and SimulationPreference (economics)Evolutionary programmingMathematicsEuropean Journal of Operational Research
researchProduct

Genetic programming through bi-objective genetic algorithms with a study of a simulated moving bed process involving multiple objectives

2013

A new bi-objective genetic programming (BioGP) technique has been developed for meta-modeling and applied in a chromatographic separation process using a simulated moving bed (SMB) process. The BioGP technique initially minimizes training error through a single objective optimization procedure and then a trade-off between complexity and accuracy is worked out through a genetic algorithm based bi-objective optimization strategy. A benefit of the BioGP approach is that an expert user or a decision maker (DM) can flexibly select the mathematical operations involved to construct a meta-model of desired complexity or accuracy. It is also designed to combat bloat - a perennial problem in genetic …

ta113Mathematical optimizationMeta-optimizationArtificial neural networkComputer scienceta111Evolutionary algorithmGenetic programmingOverfittingMulti-objective optimizationSimulation-based optimizationGenetic algorithmMetaheuristicSoftwareApplied Soft Computing
researchProduct

Iterative Methods for Pricing American Options under the Bates Model

2013

We consider the numerical pricing of American options under the Bates model which adds log-normally distributed jumps for the asset value to the Heston stochastic volatility model. A linear complementarity problem (LCP) is formulated where partial derivatives are discretized using finite differences and the integral resulting from the jumps is evaluated using simple quadrature. A rapidly converging fixed point iteration is described for the LCP, where each iterate requires the solution of an LCP. These are easily solved using a projected algebraic multigrid (PAMG) method. The numerical experiments demonstrate the efficiency of the proposed approach. Furthermore, they show that the PAMG meth…

ta113Mathematical optimizationStochastic volatilityDiscretizationIterative methodComputer scienceFinite difference methodLinear complementarity problemIterative methodQuadrature (mathematics)Multigrid methodFixed-point iterationBates modelLinear complementarity problemGeneral Earth and Planetary SciencesPartial derivativeAmerican optionGeneral Environmental ScienceProcedia Computer Science
researchProduct

Synchronous R-NSGA-II: An Extended Preference-Based Evolutionary Algorithm for Multi-Objective Optimization

2015

Classical evolutionary multi-objective optimization algorithms aim at finding an approx- imation of the entire set of Pareto optimal solutions. By considering the preferences of a decision maker within evolutionary multi-objective optimization algorithms, it is possible to focus the search only on those parts of the Pareto front that satisfy his/her preferences. In this paper, an extended preference-based evolutionary algorithm has been proposed for solving multi-objective optimiza- tion problems. Here, concepts from an interactive synchronous NIMBUS method are borrowed and combined with the R-NSGA-II algorithm. The proposed synchronous R-NSGA-II algorithm uses preference information provid…

ta113Mathematical optimizationinteractive multi-objective optimizationApplied MathematicsEvolutionary algorithmApproxDecision makerMulti-objective optimizationscalarizing functionSet (abstract data type)Pareto optimalevolutionary multi-objective optimizationpreference-based evolutionary algorithmsFocus (optics)Preference (economics)Information SystemsMathematicsInformatica
researchProduct

A New Augmented Lagrangian Approach for $L^1$-mean Curvature Image Denoising

2015

Variational methods are commonly used to solve noise removal problems. In this paper, we present an augmented Lagrangian-based approach that uses a discrete form of the L1-norm of the mean curvature of the graph of the image as a regularizer, discretization being achieved via a finite element method. When a particular alternating direction method of multipliers is applied to the solution of the resulting saddle-point problem, this solution reduces to an iterative sequential solution of four subproblems. These subproblems are solved using Newton’s method, the conjugate gradient method, and a partial solution variant of the cyclic reduction method. The approach considered here differs from ex…

ta113Mean curvatureDiscretizationimage denoisingAugmented Lagrangian methodApplied MathematicsGeneral Mathematicsmean curvaturekuvankäsittelyTopologyFinite element methodimage processingsymbols.namesakeLagrangian relaxationLagrange multiplierConjugate gradient methodsymbolsApplied mathematicsaugmented Lagrangian methodalternating direction methods of multipliersvariational modelMathematicsCyclic reductionSIAM Journal on Imaging Sciences
researchProduct

Design time, run time, and artificial intelligence techniques for mobility of user interface

2011

Abstract Advancement in technology provides opportunities to user as well as challenges for application development organization. User interfaces which were design for specific device tend to be developed for various devices. Users are busy people, when they move among different context would like to move application with them. The current trend of users demanding mobile graphic user interface to support their daily life and work has led to a new generation of techniques. Design time technique provides better usability as compare to run time technique. On the other hand artificial intelligence technique like agent provides better flexibility and usability as compare to others. In this paper…

ta113Mobile agentMultimediaDesign time techniquebusiness.industryComputer scienceNatural user interfaceUsabilityGraphical user interface testingcomputer.software_genreUser interface designRun time techniqueUser experience designInterface metaphorHuman–computer interactionHeuristic evaluationGeneral Earth and Planetary Sciences10-foot user interfaceArtificial intelligenceUser interfacebusinesscomputerGeneral Environmental ScienceGraphical user interfaceProcedia Computer Science
researchProduct

Exploiting ongoing EEG with multilinear partial least squares during free-listening to music

2016

During real-world experiences, determining the stimulus-relevant brain activity is excitingly attractive and is very challenging, particularly in electroencephalography. Here, spectrograms of ongoing electroencephalogram (EEG) of one participant constructed a third-order tensor with three factors of time, frequency and space; and the stimulus data consisting of acoustical features derived from the naturalistic and continuous music formulated a matrix with two factors of time and the number of features. Thus, the multilinear partial least squares (PLS) conforming to the canonical polyadic (CP) model was performed on the tensor and the matrix for decomposing the ongoing EEG. Consequently, we …

ta113Multilinear mapmedicine.diagnostic_testBrain activity and meditationSpeech recognition02 engineering and technologyElectroencephalographyta3112Matrix decomposition03 medical and health sciences0302 clinical medicinetensor decompositionFrequency domainPartial least squares regression0202 electrical engineering electronic engineering information engineeringmedicineSpectrogramOngoing EEG020201 artificial intelligence & image processingmusicTime domain030217 neurology & neurosurgerymultilinear partial least squaresMathematics
researchProduct