Search results for "code"

showing 10 items of 1180 documents

Denoising Autoencoders for Fast Combinatorial Black Box Optimization

2015

Estimation of Distribution Algorithms (EDAs) require flexible probability models that can be efficiently learned and sampled. Autoencoders (AE) are generative stochastic networks with these desired properties. We integrate a special type of AE, the Denoising Autoencoder (DAE), into an EDA and evaluate the performance of DAE-EDA on several combinatorial optimization problems with a single objective. We asses the number of fitness evaluations as well as the required CPU times. We compare the results to the performance to the Bayesian Optimization Algorithm (BOA) and RBM-EDA, another EDA which is based on a generative neural network which has proven competitive with BOA. For the considered pro…

FOS: Computer and information sciencesArtificial neural networkI.2.6business.industryFitness approximationComputer scienceNoise reductionI.2.8MathematicsofComputing_NUMERICALANALYSISComputer Science - Neural and Evolutionary ComputingMachine learningcomputer.software_genreAutoencoderOrders of magnitude (bit rate)Estimation of distribution algorithmBlack boxComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONNeural and Evolutionary Computing (cs.NE)Artificial intelligencebusinessI.2.6; I.2.8computerProceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation
researchProduct

Pattern Recognition Scheme for Large-Scale Cloud Detection over Landmarks

2020

Landmark recognition and matching is a critical step in many Image Navigation and Registration (INR) models for geostationary satellite services, as well as to maintain the geometric quality assessment (GQA) in the instrument data processing chain of Earth observation satellites. Matching the landmark accurately is of paramount relevance, and the process can be strongly impacted by the cloud contamination of a given landmark. This paper introduces a complete pattern recognition methodology able to detect the presence of clouds over landmarks using Meteosat Second Generation (MSG) data. The methodology is based on the ensemble combination of dedicated support vector machines (SVMs) dependent…

FOS: Computer and information sciencesAtmospheric ScienceMatching (statistics)Computer Science - Machine LearningSource code010504 meteorology & atmospheric sciencesComputer scienceComputer Vision and Pattern Recognition (cs.CV)media_common.quotation_subjectMultispectral image0211 other engineering and technologiesComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONComputer Science - Computer Vision and Pattern RecognitionCloud computing02 engineering and technology01 natural sciencesMachine Learning (cs.LG)Computers in Earth Sciences021101 geological & geomatics engineering0105 earth and related environmental sciencesmedia_commonLandmarkbusiness.industryPattern recognitionSupport vector machinePattern recognition (psychology)Geostationary orbitArtificial intelligencebusiness
researchProduct

The Personal Software Process, Experiences from Denmark

2003

Software process improvement (SPI) research and practice is transforming from the traditional large-scale assessment based improvement initiatives into smaller sized, tailored initiatives where the emphasis is set on the development personnel and their personal abilities. The personal software process (PSPSM) is a method for improving the personal capabilities of a single software engineer. This paper contributes to the body of knowledge within this area by reporting experiences from Denmark. The results indicate an improvement in the effort estimation skills and a significant increase in the resulting product quality in terms of reduced total defect density. The data shows that with relati…

FOS: Computer and information sciencesCode reviewProcess managementbusiness.industryComputer sciencemedia_common.quotation_subjectcomputer.software_genreBody of knowledgeSoftware development processSoftware Engineering (cs.SE)Computer Science - Software EngineeringSoftwarePersonal software processQuality (business)Product (category theory)Set (psychology)businesscomputermedia_common
researchProduct

Active emulation of computer codes with Gaussian processes – Application to remote sensing

2020

Many fields of science and engineering rely on running simulations with complex and computationally expensive models to understand the involved processes in the system of interest. Nevertheless, the high cost involved hamper reliable and exhaustive simulations. Very often such codes incorporate heuristics that ironically make them less tractable and transparent. This paper introduces an active learning methodology for adaptively constructing surrogate models, i.e. emulators, of such costly computer codes in a multi-output setting. The proposed technique is sequential and adaptive, and is based on the optimization of a suitable acquisition function. It aims to achieve accurate approximations…

FOS: Computer and information sciencesComputer Science - Machine LearningActive learningActive learning (machine learning)Computer sciencemedia_common.quotation_subjectMachine Learning (stat.ML)Radiative transfer model02 engineering and technology01 natural sciencesMachine Learning (cs.LG)symbols.namesakeArtificial IntelligenceStatistics - Machine Learning0103 physical sciences0202 electrical engineering electronic engineering information engineeringCode (cryptography)Emulation010306 general physicsFunction (engineering)Gaussian processGaussian process emulatorGaussian processRemote sensingmedia_commonEmulationbusiness.industrySampling (statistics)Remote sensingSignal ProcessingGlobal Positioning Systemsymbols020201 artificial intelligence & image processingComputer codeComputer Vision and Pattern RecognitionbusinessHeuristicsSoftwareDesign of experimentsPattern Recognition
researchProduct

Deep Non-Line-of-Sight Reconstruction

2020

The recent years have seen a surge of interest in methods for imaging beyond the direct line of sight. The most prominent techniques rely on time-resolved optical impulse responses, obtained by illuminating a diffuse wall with an ultrashort light pulse and observing multi-bounce indirect reflections with an ultrafast time-resolved imager. Reconstruction of geometry from such data, however, is a complex non-linear inverse problem that comes with substantial computational demands. In this paper, we employ convolutional feed-forward networks for solving the reconstruction problem efficiently while maintaining good reconstruction quality. Specifically, we devise a tailored autoencoder architect…

FOS: Computer and information sciencesComputer Science - Machine Learningbusiness.industryComputer scienceComputer Vision and Pattern Recognition (cs.CV)Image and Video Processing (eess.IV)Computer Science - Computer Vision and Pattern RecognitionNonlinear optics020207 software engineering02 engineering and technologyIterative reconstructionInverse problemElectrical Engineering and Systems Science - Image and Video ProcessingAutoencoderRendering (computer graphics)Machine Learning (cs.LG)Non-line-of-sight propagation0202 electrical engineering electronic engineering information engineeringFOS: Electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingComputer visionArtificial intelligencebusiness
researchProduct

Semantics of UML 2.0 Activity Diagram for Business Modeling by Means of Virtual Machine

2005

The paper proposes a more formalized definition of UML 2.0 Activity Diagram semantics. A subset of activity diagram constructs relevant for business process modeling is considered. The semantics definition is based on the original token flow methodology, but a more constructive approach is used. The Activity Diagram Virtual machine is defined by means of a metamodel, with operations defined by a mix of pseudocode and OCL pre- and postconditions. A formal procedure is described which builds the virtual machine for any activity diagram. The relatively complicated original token movement rules in control nodes and edges are combined into paths from an action to action. A new approach is the us…

FOS: Computer and information sciencesComputer Science - Programming LanguagesSemantics (computer science)Computer scienceProgramming languageActivity diagramBusiness process modelingSecurity tokencomputer.software_genreMetamodelingComputational Engineering Finance and Science (cs.CE)Unified Modeling LanguageVirtual machineComputer Science - Computational Engineering Finance and SciencePseudocodecomputercomputer.programming_languageProgramming Languages (cs.PL)
researchProduct

Nash codes for noisy channels

2012

This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed decision maker, the receiver, who communicate over a noisy channel. The sender's strategy, called a code, maps states of nature to signals. The receiver's best response is to decode the received channel output as the state with highest expected receiver payoff. Given this decoding, an equilibrium or "Nash code" results if the sender encodes every state as prescribed. We show two theorems that give sufficient conditions for Nash codes. First, a receiver-optimal code defines a Nash code. A second, more surprising observati…

FOS: Computer and information sciencesComputer Science::Computer Science and Game TheoryTheoretical computer scienceComputer scienceInformation Theory (cs.IT)Computer Science - Information TheoryStochastic gamejel:C72jel:D82Stability (learning theory)Data_CODINGANDINFORMATIONTHEORYManagement Science and Operations Researchsender-receiver game communication noisy channel91A28Computer Science ApplicationsComputer Science - Computer Science and Game TheoryBest responseCode (cryptography)Coordination gameQA MathematicsDecoding methodsCommunication channelComputer Science and Game Theory (cs.GT)Computer Science::Information Theory
researchProduct

Quantum autoencoders via quantum adders with genetic algorithms

2017

The quantum autoencoder is a recent paradigm in the field of quantum machine learning, which may enable an enhanced use of resources in quantum technologies. To this end, quantum neural networks with less nodes in the inner than in the outer layers were considered. Here, we propose a useful connection between quantum autoencoders and quantum adders, which approximately add two unknown quantum states supported in different quantum systems. Specifically, this link allows us to employ optimized approximate quantum adders, obtained with genetic algorithms, for the implementation of quantum autoencoders for a variety of initial states. Furthermore, we can also directly optimize the quantum autoe…

FOS: Computer and information sciencesComputer Science::Machine Learning0301 basic medicineComputer Science - Machine LearningAdderPhysics and Astronomy (miscellaneous)Quantum machine learningField (physics)Computer scienceMaterials Science (miscellaneous)Computer Science::Neural and Evolutionary ComputationFOS: Physical sciencesData_CODINGANDINFORMATIONTHEORYTopology01 natural sciencesMachine Learning (cs.LG)Statistics::Machine Learning03 medical and health sciencesQuantum state0103 physical sciencesNeural and Evolutionary Computing (cs.NE)Electrical and Electronic Engineering010306 general physicsQuantumQuantum PhysicsArtificial neural networkComputer Science - Neural and Evolutionary ComputingTheoryofComputation_GENERALAutoencoderAtomic and Molecular Physics and OpticsQuantum technology030104 developmental biologyComputerSystemsOrganization_MISCELLANEOUSQuantum Physics (quant-ph)
researchProduct

Monoids and Maximal Codes

2011

In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not UD. In this paper we give an answer to this question. To do this we introduce a partial order in the set of submonoids of a monoid showing the existence, in this poset, of maximal elements that we call full monoids. Then a set of generators of a full monoid is, by definition, a maximal code. We show how this definition extends, in a natural way, the existing definition concerning UD codes and we find a characteristic property of a monoid generated by a maxi…

FOS: Computer and information sciencesDiscrete mathematicsMonoidCode (set theory)Formal Languages and Automata Theory (cs.FL)lcsh:MathematicsComputer Science - Formal Languages and Automata TheoryAstrophysics::Cosmology and Extragalactic Astrophysicslcsh:QA1-939lcsh:QA75.5-76.95Set (abstract data type)chemistry.chemical_compoundchemistryFOS: MathematicsMathematics - CombinatoricsOrder (group theory)High Energy Physics::ExperimentCombinatorics (math.CO)lcsh:Electronic computers. Computer scienceCharacteristic propertyPartially ordered setMaximal elementMathematicsElectronic Proceedings in Theoretical Computer Science
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