Search results for "Algorithm"

showing 10 items of 4887 documents

Asymmetric colour matching: memory matching versus simultaneous matching

2001

We have compared corresponding pairs obtained by simultaneous matching (haploscopic matching) and by memory matching (after 10 min) using 34 reference tests selected from the Munsell Atlas (glossy), belonging to the four main hues 5Y, 5G, 5PB, and 5RP. These colours lie very close to the F1 and F2 axes in the SVF space, where we have analyzed our results. Illuminants D65 and A were used as reference and matching illuminants, respectively. Our results show for both kinds of matching a tendency to select more colourful colours than the original ones, with significant differences between matching and test colours, whereas hue does not seem to follow a definite pattern. This behavior is similar…

LightnessSVF spaceMatching (statistics)business.industryGeneral Chemical EngineeringColour matchingHuman Factors and ErgonomicsPattern recognitionStandard illuminantGeneral ChemistryColour memoryCorresponding pairsArtificial intelligenceBest matchingbusinessAlgorithmMemory matchingSimultaneous matchingHueMathematicsÓptica
researchProduct

Learning vector quantization with alternative distance criteria

2003

An adaptive algorithm for training of a nearest neighbour (NN) classifier is developed in this paper. This learning rule has some similarity to the well-known LVQ method, but uses the nearest centroid neighbourhood concept to estimate optimal locations of the codebook vectors. The aim of this approach is to improve the performance of the standard LVQ algorithms when using a very small codebook. The behaviour of the learning technique proposed here is experimentally compared to those of the plain k-NN decision rule and the LVQ algorithms.

Linde–Buzo–Gray algorithmLearning vector quantizationArtificial neural networkAdaptive algorithmbusiness.industryCodebookVector quantizationPattern recognitionDecision ruleMachine learningcomputer.software_genreComputingMethodologies_PATTERNRECOGNITIONLearning ruleArtificial intelligencebusinesscomputerMathematicsProceedings 10th International Conference on Image Analysis and Processing
researchProduct

Steiner systems and configurations of points

2020

AbstractThe aim of this paper is to make a connection between design theory and algebraic geometry/commutative algebra. In particular, given any Steiner SystemS(t, n, v) we associate two ideals, in a suitable polynomial ring, defining a Steiner configuration of points and its Complement. We focus on the latter, studying its homological invariants, such as Hilbert Function and Betti numbers. We also study symbolic and regular powers associated to the ideal defining a Complement of a Steiner configuration of points, finding its Waldschmidt constant, regularity, bounds on its resurgence and asymptotic resurgence. We also compute the parameters of linear codes associated to any Steiner configur…

Linear codes; Monomial ideals; Stanley Reisner rings; Steiner systems; Symbolic powersSteiner systemsBetti numberPolynomial ring0102 computer and information sciencesAlgebraic geometrySymbolic powers01 natural sciencessymbols.namesakeMathematics - Algebraic GeometryLinear codesTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYMonomial idealsComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONFOS: MathematicsMathematics - CombinatoricsIdeal (ring theory)0101 mathematicsCommutative algebraAlgebraic Geometry (math.AG)Complement (set theory)MathematicsDiscrete mathematicsHilbert series and Hilbert polynomialApplied Mathematics010102 general mathematicsStanley Reisner ringsLinear codes Monomial ideals Stanley Reisner rings Steiner systems Symbolic powersComputer Science Applications51E10 13F55 13F20 14G50 94B27Settore MAT/02 - AlgebraSteiner systemSteiner systems Monomial ideals Symbolic powers Stanley Reisner rings Linear codes010201 computation theory & mathematicssymbolsCombinatorics (math.CO)Settore MAT/03 - GeometriaMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

Trunk Packing Revisited

2007

For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper two discretized approaches for the US standard SAE J1100 [10] are presented, which make use of different box sizes. An exact branch-and-bound algorithm for weighted independent sets on graphs is given, using the special structure of the SAE standard. Another branch-and-bound packing algorithm using linear programs is presented. With these algorithms axis-oriented packings of different box sizes in an arbitrary trunk geometry can be computed efficiently.

Linear programming relaxationCombinatoricsDiscrete mathematicsPacking problemsDiscretizationLinear programmingBranch and priceStructure (category theory)Approximation algorithmBranch and cutMathematics
researchProduct

Fault detection for discrete-time Markov jump linear systems with partially known transition probabilities

2010

In this article, the fault detection (FD) problem for a class of discrete-time Markov jump linear system (MJLS) with partially known transition probabilities is investigated. The proposed systems are more general, which relax the traditional assumption in Markov jump systems that all the transition probabilities must be completely known. A residual generator is constructed and the corresponding FD is formulated as an H ∞ filtering problem by which the error between residual and fault are minimised in the H ∞ sense. The linear matrix inequality-based sufficient conditions for the existence of FD filter are derived. A numerical example on a multiplier–accelerator model economic system is give…

Linear systemLinear matrix inequalityMarkov processResidualFault detection and isolationComputer Science Applicationssymbols.namesakeDiscrete time and continuous timeControl and Systems EngineeringsymbolsFiltering problemApplied mathematicsJump processAlgorithmMathematicsInternational Journal of Control
researchProduct

How to validate similarity in linear transform models of event-related potentials between experimental conditions?

2014

Abstract Background It is well-known that data of event-related potentials (ERPs) conform to the linear transform model (LTM). For group-level ERP data processing using principal/independent component analysis (PCA/ICA), ERP data of different experimental conditions and different participants are often concatenated. It is theoretically assumed that different experimental conditions and different participants possess the same LTM. However, how to validate the assumption has been seldom reported in terms of signal processing methods. New method When ICA decomposition is globally optimized for ERP data of one stimulus, we gain the ratio between two coefficients mapping a source in brain to two…

Linear transformAdultMaleComputer scienceSpeech recognitionStimulus (physiology)Neuropsychological TestsEvent-related potentialHumansOddball paradigmEvoked Potentialsta515ta113Data processingSignal processingFacial expressionPrincipal Component AnalysisGeneral NeuroscienceBrainReproducibility of ResultsElectroencephalographySignal Processing Computer-AssistedMiddle AgedIndependent component analysisFacial ExpressionPattern Recognition VisualLinear ModelsFemaleAlgorithmsPhotic StimulationJournal of neuroscience methods
researchProduct

Algorithms and Organizing

2022

Abstract Algorithms are a ubiquitous part of organizations as they enable, guide, and restrict organizing at the level of everyday interactions. This essay focuses on algorithms and organizing by reviewing the literature on algorithms in organizations, examining the viewpoint of relationality and relational agency on algorithms and organizing, exploring the properties of algorithms, and concluding what these mean from an organizational communication viewpoint. Algorithms need data to be collected. The data are always biased, and algorithms exclude everything that is not in their code. They define what is seen as important. Their operating principles are opaque, and they are political due to…

Linguistics and LanguageCommunicationtoimijuussociomaterialismtekoälyalgorithmsartificial intelligenceyhteisöviestintäorganizingrelational agencyorganisointiAnthropologyagencyalgoritmitorganizational communicationDevelopmental and Educational Psychologycommunicative constitution of organizationtyön organisointimaterialitymateriaalisuusHuman Communication Research
researchProduct

Visualization of Jacques Lacan’s Registers of the Psychoanalytic Field, and Discovery of Metaphor and of Metonymy. Analytical Case Study of Edgar All…

2017

International audience; We start with a description of Lacan’s work that we then take into our analytics methodology. In a first investigation, a Lacan-motivated template of the Poe story is fitted to the data. A segmentation of the storyline is used in order to map out the diachrony. Based on this, it will be shown how synchronous aspects, potentially related to Lacanian registers, can be sought. This demonstrates the effectiveness of an approach based on a model template of the storyline narrative. In a second and more comprehensive investigation, we develop an approach for revealing, that is, uncovering, Lacanian register relationships. Objectives of this work include the wide and genera…

Linguistics and LanguageMetaphorComputer scienceGeometric Data Analysismedia_common.quotation_subjectlcsh:BF1-990[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]BF[SHS.PSY]Humanities and Social Sciences/Psychology[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]PScomputer.software_genre[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG][INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL][SHS.PSY] Humanities and Social Sciences/Psychology03 medical and health sciences0302 clinical medicineData visualization[SHS.STAT] Humanities and Social Sciences/Methods and statisticsNarrativePsychoanalytic theorymedia_commonGeometric data analysisPsychoanalysis and languageMetonymy[SHS.STAT]Humanities and Social Sciences/Methods and statisticslcsh:P101-410business.industryField (Bourdieu)Lacanian psychoanalysisCorrespondence Analysislcsh:Language. Linguistic theory. Comparative grammarLinguistics030227 psychiatryP1Psychiatry and Mental healthClinical PsychologyTopology Computationlcsh:Psychology[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]Analytics[INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL]Artificial intelligencebusinesscomputer030217 neurology & neurosurgeryNatural language processing
researchProduct

Evidence against linkage of schizophrenia to chromosome 5q11-q13 markers in systematically ascertained families.

1992

Ten pedigrees systematically ascertained in Germany were tested for linkage to chromosome 5q11-q13. In order to replicate the previous report by Sherrington et al (1988), families with a bipolar family member were omitted from the lod score calculations, all diagnoses were based upon Research Diagnostic Criteria, and four different models of the affection status were calculated, including the model for which Sherrington et al calculated the highest lod scores. None of the families investigated showed a positive lod score. Using multipoint linkage analyses, we were able to exclude the region for which a positive linkage has been reported.

Linkage (software)GeneticsGenetic Markerscongenital hereditary and neonatal diseases and abnormalitiesGenetic LinkageResearch Diagnostic CriteriaPedigree chartmedicine.diseaseFamily memberChromosome (genetic algorithm)Psychotic DisordersSchizophreniamedicineSchizophreniaChromosomes Human Pair 5HumansFamilyLymphocytesLod ScorePsychologyBiological PsychiatryLod scoresLod scoreBiological psychiatry
researchProduct

Deterministic Linkage as a Preceding Filter for Other Record Linkage Methods

2015

Deterministic record linkage (RL) is frequently regarded as a rival to more sophisticated strategies like probabilistic RL. We investigate the effect of combining deterministic linkage with other linkage techniques. For this task, we use a simple deterministic linkage strategy as a preceding filter: a data pair is classified as ‘match' if all values of attributes considered agree exactly, otherwise as ‘nonmatch'. This strategy is separately combined with two probabilistic RL methods based on the Fellegi–Sunter model and with two classification tree methods (CART and Bagging). An empirical comparison was conducted on two real data sets. We used four different partitions into training data a…

Linkage (software)education.field_of_studyComputer scienceDecision tree learningPopulationProbabilistic logiccomputer.software_genreFilter (higher-order function)Expectation–maximization algorithmComputer Science (miscellaneous)Data miningeducationcomputerAlgorithmRecord linkageTest dataInternational Journal of Information Technology & Decision Making
researchProduct