Search results for "Random"

showing 10 items of 3931 documents

A Methodology for the Analysis of Memory Response to Radiation through Bitmap Superposition and Slicing

2015

A methodology is proposed for the statistical analysis of memory radiation test data, with the aim of identifying trends in the single-even upset (SEU) distribution. The treated case study is a 65nm SRAM irradiated with neutrons, protons and heavy-ions.

Computer sciencebitmap slicingParallel computingHardware_PERFORMANCEANDRELIABILITYRadiationSlicingUpsetElectronic mailSuperposition principleStatic random-access memoryMemoriesstatic testNuclear Experimentdynamic testta114ta213computer.file_formatSRAMBitmap[SPI.TRON]Engineering Sciences [physics]/ElectronicsMultiple Cell Upset (MCU)MCUSERBitmapradiation testevent accumulationSingle Event Upset (SEU)AlgorithmcomputerSEUTest data
researchProduct

Stress Detection from Speech Using Spectral Slope Measurements

2018

Automatic detection of emotional stress is an active research domain, which has recently drawn increasing attention, mainly in the fields of computer science, linguistics, and medicine. In this study, stress is automatically detected by employing speech-derived features. Related studies utilize features such as overall intensity, MFCCs, Teager Energy Operator, and pitch. The present study proposes a novel set of features based on the spectral tilt of the glottal source and of the speech signal itself. The proposed features rely on the Probability Density Function of the estimated spectral slopes, and consist of the three most probable slopes from the glottal source, as well as the correspon…

Computer sciencebusiness.industry020206 networking & telecommunicationsProbability density functionPattern recognition02 engineering and technologyFundamental frequencySignalRandom forestEnergy operatorSpectral slopeClassifier (linguistics)0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingArtificial intelligencebusinessWord (computer architecture)
researchProduct

Resource sharing optimality in WiFi infrastructure networks

2009

In WiFi networks, mobile nodes compete for accessing a shared channel by means of a random access protocol called Distributed Coordination Function (DCF). Although this protocol is in principle fair, since all the stations have the same probability to transmit on the channel, it has been shown that unfair behaviors may emerge in actual networking scenarios. Assuming that a contending node can dynamically change its strategy, by tuning its contention parameters to non-standard values on the basis of channel observations, we prove that, for infrastructure networks with bidirectional traffic and homogeneous application requirements, selfish access strategies are able to reach equilibrium condi…

Computer sciencebusiness.industryBidirectional trafficSettore ING-INF/03 - TelecomunicazioniDistributed computingNode (networking)ThroughputDistributed coordination functionShared resourceSettore ING-INF/04 - AutomaticaWireless lanTelecommunications linkMobile telephonybusinessGame theory Mechanism Design WiFi Infrastructure NetworksRandom accessCommunication channelComputer network
researchProduct

Proactive Handoff of Secondary User in Cognitive Radio Network Using Machine Learning Techniques

2021

Spectrum management always appears as an essential part of modern communication systems. Handoff is initiated when the signal strength of a current user deteriorates below a certain threshold. In cognitive radio network, the perception of handoff is different due to the presence of two categories of users: certified/primary user and uncertified/secondary user. The reason for the spectrum handoff arises when the primary user (PU) returns to one of its band used by the secondary user. The spectrum handoff is of two types: reactive handoff and proactive handoff. There are certain limitations in reactive handoff, such as it suffers from prolonged handoff latency and interference. In the proacti…

Computer sciencebusiness.industryComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSDecision treeCommunications systemMachine learningcomputer.software_genreSpectrum managementRandom forestSupport vector machineCognitive radioHandoverMultilayer perceptronArtificial intelligencebusinesscomputer
researchProduct

Automatic Image Annotation Using Random Projection in a Conceptual Space Induced from Data

2018

The main drawback of a detailed representation of visual content, whatever is its origin, is that significant features are very high dimensional. To keep the problem tractable while preserving the semantic content, a dimen- sionality reduction of the data is needed. We propose the Random Projection techniques to reduce the dimensionality. Even though this technique is sub-optimal with respect to Singular Value Decomposition its much lower computational cost make it more suitable for this problem and in par- ticular when computational resources are limited such as in mobile terminals. In this paper we present the use of a "conceptual" space, automatically induced from data, to perform automa…

Computer sciencebusiness.industryDimensionality reductionRandom projectionFeature extractionRANDOM MAPPINGPattern recognition02 engineering and technology010501 environmental sciencesConceptual-space01 natural sciencesVisualizationAutomatic image annotationRandom-projectionHistogramSingular value decomposition0202 electrical engineering electronic engineering information engineeringImage-semantic020201 artificial intelligence & image processingArtificial intelligenceIMAGE ANNOTATIONbusinessCONCEPTUAL SPACE0105 earth and related environmental sciencesCurse of dimensionality
researchProduct

M-GRASP: A GRASP With Memory for Latency-Aware Partitioning Methods in DVE Systems

2009

A necessary condition for providing quality of service to distributed virtual environments (DVEs) is to provide a system response below a maximum threshold to the client computers. In this sense, latency-aware partitioning methods try to provide response times below the threshold to the maximum number of client computers as possible. These partitioning methods should find an assignment of clients to servers that optimizes system throughput, system latency, and partitioning efficiency. In this paper, we present a new algorithm based on greedy randomized adaptive search procedure with memory for finding the best solutions as possible to this problem. We take into account several different alt…

Computer sciencebusiness.industryDistributed computingGRASPComputer Science ApplicationsHuman-Computer InteractionControl and Systems EngineeringServerLocal search (optimization)Electrical and Electronic EngineeringGreedy algorithmbusinessMetaheuristicSoftwareGreedy randomized adaptive search procedureIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
researchProduct

CrowdVAS-Net: A Deep-CNN Based Framework to Detect Abnormal Crowd-Motion Behavior in Videos for Predicting Crowd Disaster

2019

With the increased occurrences of crowd disasters like human stampedes, crowd management and their safety during mass gathering events like concerts, congregation or political rally, etc., are vital tasks for the security personnel. In this paper, we propose a framework named as CrowdVAS-Net for crowd-motion analysis that considers velocity, acceleration and saliency features in the video frames of a moving crowd. CrowdVAS-Net relies on a deep convolutional neural network (DCNN) for extracting motion and appearance feature representations from the video frames that help us in classifying the crowd-motion behavior as abnormal or normal from a short video clip. These feature representations a…

Computer sciencebusiness.industryFeature extraction020207 software engineering02 engineering and technologyVideo processingMachine learningcomputer.software_genreConvolutional neural networkMotion (physics)Random forestFeature (computer vision)Mass gathering0202 electrical engineering electronic engineering information engineeringTask analysis020201 artificial intelligence & image processingArtificial intelligencebusinesscomputer2019 IEEE International Conference on Systems, Man and Cybernetics (SMC)
researchProduct

A Windowing strategy for Distributed Data Mining optimized through GPUs

2017

Abstract This paper introduces an optimized Windowing based strategy for inducing decision trees in Distributed Data Mining scenarios. Windowing consists in selecting a sample of the available training examples (the window) to induce a decision tree with an usual algorithm, e.g., J48; finding instances not covered by this tree (counter examples) in the remaining training examples, adding them to the window to induce a new tree; and repeating until a termination criterion is met. In this way, the number of training examples required to induce the tree is reduced considerably, while maintaining the expected accuracy levels; which is paid in terms of time performance. Our proposed enhancements…

Computer sciencebusiness.industryMulti-agent systemDecision treeProcess (computing)Window (computing)02 engineering and technologyMachine learningcomputer.software_genreRandom forestTree (data structure)C4.5 algorithmArtificial Intelligence020204 information systemsSignal Processing0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionArtificial intelligenceData miningbusinesscomputerSoftwarePattern Recognition Letters
researchProduct

Acoustic Detection of Moving Vehicles

2018

This chapter outlines a robust algorithm to detect the arrival of a vehicle of arbitrary type when other noises are present. It is done via analysis of its acoustic signature against an existing database of recorded and processed acoustic signals. To achieve it with minimum number of false alarms, a construction of a training database of acoustic signatures of signals emitted by vehicles using the distribution of the energies among blocks of wavelet packet coefficients (waveband spectra, see Sect. 4.6) is combined with a procedure of random search for a near-optimal footprint (RSNOFP). The number of false alarms in the detection is minimized even under severe conditions such as: signals emi…

Computer sciencebusiness.industryNetwork packetTraining (meteorology)020207 software engineeringPattern recognition02 engineering and technologySet (abstract data type)FootprintRandom searchWavelet0202 electrical engineering electronic engineering information engineeringProcess controlAcoustic signature020201 artificial intelligence & image processingArtificial intelligencebusiness
researchProduct

Accuracy and the role of experience in dynamic computer guided dental implant surgery: an in-vitro study

2019

Background To compare the accuracy of implant placement using the conventional freehand method and a dynamic navigation system; to assess the role of the surgeon’s experience in implant placement using these two methods. Material and Methods A randomized in-vitrostudy was conducted. Six resin mandible models and 36 implants were used. Two researchers with differing clinical experience (novice and experienced) placed implants using either the Navident dynamic navigation system (navigation group) or the conventional freehand method (freehand group). Accuracy was measured by overlaying the real position in the postoperative CBCT on the virtual presurgical placement of the implant in a CBCT ima…

Computer sciencemedicine.medical_treatmentCbct imageCirurgia dentalOverlayIn Vitro TechniquesDental implant surgeryRandom Allocation03 medical and health sciences0302 clinical medicineNature study0502 economics and businessmedicineHumansIn vitro studyGeneral DentistryOrthodonticsComputer-assisted surgeryImplants dentalsResearch05 social sciencesDental implantsNavigation system030206 dentistry:CIENCIAS MÉDICAS [UNESCO]Implant placementDental ImplantationSurgery Computer-AssistedOtorhinolaryngologyDental surgeryUNESCO::CIENCIAS MÉDICAS050211 marketingSurgeryClinical CompetenceImplantOral SurgeryEstudi de la natura
researchProduct