Search results for "Intelligence"

showing 10 items of 6959 documents

Improving Pattern Recognition Based Pharmacological Drug Selection Through ROC Analysis

2004

The design of new medical drugs is a very complex process in which combinatorial chemistry techniques are used. The goal consists of discriminating between molecular compounds exhibiting or not certain pharmacological activities. Different machine learning approaches have been recently applied to different drug design problems leading to competitive results in pointing at particular compounds with high probability of exhibiting activity. The present work first deeps into the natural trade-off between accuracy in the much less populated active group and false alarm rate which could lead to too many expensive laboratory tests. Preliminary results show how different classification techniques a…

DrugReceiver operating characteristicCombinatorial Chemistry TechniquesComputer sciencebusiness.industryProcess (engineering)media_common.quotation_subjectMachine learningcomputer.software_genrePattern recognition (psychology)Artificial intelligencebusinesscomputerSelection (genetic algorithm)media_common
researchProduct

Cue combination in a combined feature contrast detection and figure identification task

2006

AbstractTarget figures defined by feature contrast in spatial frequency, orientation or both cues had to be detected in Gabor random fields and their shape had to be identified in a dual task paradigm. Performance improved with increasing feature contrast and was strongly correlated among both tasks. Subjects performed significantly better with combined cues than with single cues. The improvement due to cue summation was stronger than predicted by the assumption of independent feature specific mechanisms, and increased with the performance level achieved with single cues until it was limited by ceiling effects. Further, cue summation was also strongly correlated among tasks: when there was …

Dual-task paradigmAdultMalePsychometricsmedia_common.quotation_subjectContrast SensitivityDiscrimination PsychologicalFigure-ground segregationPsychophysicsComputer GraphicsPsychophysicsContrast (vision)Humansmedia_commonCommunicationFeature contrastbusiness.industryOrientation (computer vision)Figure–groundPattern recognitionCue combinationSensory SystemsOphthalmologyPattern Recognition VisualFeature (computer vision)Pattern recognition (psychology)FemaleArtificial intelligenceSpatial frequencyCuesPsychologybusinessVision Research
researchProduct

Working Memory Alterations Plays an Essential Role in Developing Global Neuropsychological Impairment in Duchenne Muscular Dystrophy

2021

BackgroundNeuropsychological profile of Indian Duchenne muscular dystrophy (DMD) subjects remains unidentified and needs to be evaluated.MethodsA total of 69 DMD and 66 controls were subjected to detailed intelligence and neuropsychological assessment. The factor indexes were derived from various components of Malin’s Intelligence Scale for Indian Children (MISIC) and Rey Auditory Verbal Learning Test (RAVLT).ResultsPoor verbal and visual memory profiles were demonstrated by DMDs, which include RAVLT-immediate recall (IR) (p = 0.042), RAVLT-delayed recall (DR) (p = 0.009), Rey–Osterrieth complex figure test (RCFT)-IR (p = 0.001), and RCFT-DR (p = 0.001). RAVLT-memory efficiency index demons…

Duchenne muscular dystrophymedicine.medical_specialtylcsh:BF1-990neuropsychologyAudiologyworking memory03 medical and health sciences0302 clinical medicineVisual memoryDMDmedicineMemory spanPsychologyNeuropsychological assessmentGeneral PsychologyOriginal Research030304 developmental biology0303 health sciencesRecallmedicine.diagnostic_testWorking memoryNeuropsychologyWechsler Adult Intelligence Scaleintelligencelcsh:PsychologyVerbal memoryPsychology030217 neurology & neurosurgeryFrontiers in Psychology
researchProduct

A novel methodology for accelerating bitstream relocation in partially reconfigurable systems

2012

International audience; Xilinx Virtex FPGAs offer the possibility of Partial Reconfiguration (PR). Arbitrary tasks can be allocated and de-allocated onto FPGA without system interruption. However, mapping a task to any available PR region requires a unique partial bitstream for each partition, hence reducing memory storage requirements. In recent years, an interest on overcoming this problem has lead to the concept of Partial Bitstream Relocation (PBR). The principle is to perform bitstream modification to map it to different regions. However, PBR consumes scarce resources in hardware implementations, and introduces a prohibitive time overhead when done in software. In order to find the bes…

Dynamic Partial ReconfigurationComputer Networks and CommunicationsComputer scienceBitstream Relocation02 engineering and technology01 natural sciencesSoftwareArtificial Intelligence0103 physical sciences0202 electrical engineering electronic engineering information engineering[ INFO.INFO-ES ] Computer Science [cs]/Embedded SystemsBitstreamField-programmable gate arrayFPGA010302 applied physicsVirtexbusiness.industryControl reconfigurationPartition (database)020202 computer hardware & architecture[INFO.INFO-ES] Computer Science [cs]/Embedded SystemsHardware and ArchitectureEmbedded systemReconfigurable Computing[INFO.INFO-ES]Computer Science [cs]/Embedded SystemsbusinessRelocationEmbedded SystemsSoftware
researchProduct

A Branch-and-Cut method for the Capacitated Location-Routing Problem

2011

International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …

Dynamic Source RoutingMathematical optimizationGeneral Computer ScienceComputer scienceEqual-cost multi-path routingRouting tableTesting0211 other engineering and technologiesGeographic routingLogistics02 engineering and technologyManagement Science and Operations ResearchBranch and CutSimulated annealingStochastic processesBranch-and-CutLocation-RoutingVehicle routing problem0202 electrical engineering electronic engineering information engineeringFacility locationDestination-Sequenced Distance Vector routingRoutingMathematicsStatic routing021103 operations researchLocation routingLower BoundLinear modelVehiclesIterative algorithms[INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]Facility location problemVehicle routingCostsLocation-Routing ProblemLink-state routing protocolLagrangian functionsModeling and SimulationMultipath routing020201 artificial intelligence & image processingFittingRouting (electronic design automation)Branch and cutDrawback
researchProduct

Inferring slowly-changing dynamic gene-regulatory networks

2015

Dynamic gene-regulatory networks are complex since the interaction patterns between their components mean that it is impossible to study parts of the network in separation. This holistic character of gene-regulatory networks poses a real challenge to any type of modelling. Graphical models are a class of models that connect the network with a conditional independence relationships between random variables. By interpreting these random variables as gene activities and the conditional independence relationships as functional non-relatedness, graphical models have been used to describe gene-regulatory networks. Whereas the literature has been focused on static networks, most time-course experi…

Dynamic network analysisL1 penalized inferenceComputer scienceT-LymphocytesGene regulatory networkgene regulatory networkMachine learningcomputer.software_genreBiochemistrygene-regulatory networksStructural Biologygraphical modelscomputer simulationT lymphocyteHumansGene Regulatory NetworkshumanGraphical modelMolecular Biologylymphocyte activationClass (computer programming)Models Statisticalalgorithmbusiness.industryResearchApplied Mathematicsstatistical modelStatistical modelComplex networkQuantitative Biology::GenomicsComputer Science ApplicationsComputingMethodologies_PATTERNRECOGNITIONConditional independencemicroarray analysisComputingMethodologies_GENERALArtificial intelligencebusinessmetabolismRandom variablecomputerAlgorithmsBMC Bioinformatics
researchProduct

Realizing Undelayed N-step TD prediction with neural networks

2010

There exist various techniques to extend reinforcement learning algorithms, e.g., eligibility traces and planning. In this paper, an approach is proposed, which combines several extension techniques, such as using eligibility-like traces, using approximators as value functions and exploiting the model of the environment. The obtained method, ‘Undelayed n-step TD prediction’ (TD-P), has produced competitive results when put in conditions of not fully observable environment.

Dynamic programmingArtificial neural networkComputer sciencebusiness.industryValue (computer science)Reinforcement learningObservableExtension (predicate logic)Artificial intelligencebusinessMelecon 2010 - 2010 15th IEEE Mediterranean Electrotechnical Conference
researchProduct

Vector representation of non-standard spellings using dynamic time warping and a denoising autoencoder

2017

The presence of non-standard spellings in Twitter causes challenges for many natural language processing tasks. Traditional approaches mainly regard the problem as a translation, spell checking, or speech recognition problem. This paper proposes a method that represents the stochastic relationship between words and their non-standard versions in real vectors. The method uses dynamic time warping to preprocess the non-standard spellings and autoencoder to derive the vector representation. The derived vectors encode word patterns and the Euclidean distance between the vectors represents a distance in the word space that challenges the prevailing edit distance. After training the autoencoder o…

Dynamic time warpingArtificial neural networkComputer sciencebusiness.industrySpeech recognition020208 electrical & electronic engineeringPattern recognitionContext (language use)02 engineering and technology010501 environmental sciencesTranslation (geometry)01 natural sciencesAutoencoderEuclidean distance0202 electrical engineering electronic engineering information engineeringEdit distanceArtificial intelligenceHidden Markov modelbusinessWord (computer architecture)0105 earth and related environmental sciences2017 IEEE Congress on Evolutionary Computation (CEC)
researchProduct

On the metric properties of dynamic time warping

1987

Recently, some new and promising methods have been proposed to reduce the number of Dynamic Time Warping (DTW) computations in Isolated Word Recognition. For these methods to be properly applicable, the verification of the Triangle Inequality (TI) by the DTW-based Dissimilarity Measure utilized seems to be an important prerequisite.

Dynamic time warpingComputational complexity theoryTriangle inequalityComputer sciencebusiness.industryPattern recognitionMeasure (mathematics)Multidimensional signal processingComputingMethodologies_PATTERNRECOGNITIONSignal ProcessingWord recognitionMetric (mathematics)Artificial intelligenceMultidimensional systemsbusinessIEEE Transactions on Acoustics, Speech, and Signal Processing
researchProduct

An Intelligent Sensor for Fingerprint Recognition

2005

In this paper an intelligent sensor for fingerprint recognition is proposed. The sensor has the objective to overcome some limits of the fingerprint recognition software systems, as elaboration time and security issues related to fingerprint transmission between sensor and processing unit. Intelligent sensor has been prototyped using the Hamster Secugen sensor for image acquisition and the Celoxica RC1000 board, employing a Xilinx VirtexE2000 FPGA, for image processing and analysis. Resources used, elaboration time as well the recognition rates in both verification and identification modes are reported in the paper. To the best of our knowledge, this is the first implementation for a full h…

Dynamic time warpingIntelligent sensorBiometricsbusiness.industryFingerprintComputer scienceComputer visionImage processingArtificial intelligenceImage sensorFingerprint recognitionbusinessComputer hardware
researchProduct