Search results for " Computer Science"

showing 10 items of 3983 documents

Review of Capone (2010): Perspectives on Language Use and Pragmatics. A Volume in Memory of Sorin Stati

2011

Behavioral NeuroscienceLinguistics and LanguagePsychoanalysisHistory and Philosophy of ScienceGeneral Computer ScienceVolume (computing)PragmaticsPsychologyOn LanguageLanguage and LinguisticsLinguisticsPragmatics and Cognition
researchProduct

An approach for influence estimatation in complex networks : application to the social network Twitter

2019

Influence in complex networks and in particular Twitter has become recently a hot research topic. Detecting most influential users leads to reach a large-scale information diffusion area at low cost, something very useful in marketing or political campaigns. In this thesis, we propose a new approach that considers the several relations between users in order to assess influence in complex networks such as Twitter. We model Twitter as a multiplex heterogeneous network where users, tweets and objects are represented by nodes, and links model the different relations between them (e.g., retweets, mentions, and replies).The multiplex PageRank is applied to data from two datasets in the political…

Belief functions teory[INFO.INFO-CY] Computer Science [cs]/Computers and Society [cs.CY][INFO.INFO-WB] Computer Science [cs]/WebRéseaux multiplexesThéorie des fonctions de croyanceTwitterComplex networksRéseaux sociauxSocial networks
researchProduct

A systematic review of SQL-on-Hadoop by using compact data formats

2016

Article also submitted for publication in Baltic J. Modern Computing (BJMC) on October 5, 2016.

Big DataSQLHDFSGeneral Computer ScienceDatabaseComputer sciencebusiness.industryBig dataAvrocomputer.software_genreParquetWorld Wide WebHadoopSystematic reviewbusinesscomputercomputer.programming_language
researchProduct

Modelling and development of a generic observatory to harvest and analyze big data

2021

Big Data fascinate, both because of the value they hold that can provide a significant advantage in decision-making, and because of the challenges that their exploitation represents. These challenges are present at several levels of analytics workflows. At the level of the creation of software architectures, the volume and the velocity require at least enough performance to handle the ingestion and storage of data. The data variety has also an impact, as several new storage systems have emerged, each one corresponding to a specific need. The polystores are systems that integrate this diversity, to gain flexibility compared to the data warehouses, now too rigid. However, this diversification…

Big DataStream processing[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH]TenseursData modelsCategory TheoryArchitectures logiciellesTensorsThéorie des catégoriesDonnées massivesModèles de donnéesSoftware Architectures
researchProduct

Mining customer requirements from online reviews: A product improvement perspective

2016

We propose a filtering model to predict helpfulness of reviews for product design.We provide a way to use the KANO model based on online reviews.We explore how to obtain insights from Big Data through knowledge-based view. Big data commerce has become an e-commerce trend. Learning how to extract valuable and real time insights from big data to drive smarter and more profitable business decisions is a main task of big data commerce. Using online reviews as an example, manufacturers have come to value how to select helpful online reviews and what can be learned from online reviews for new product development. In this research, we first proposed an automatic filtering model to predict the help…

Big data commerceEngineeringINF/01 - Computer ScienceInformation Systems and ManagementBig data02 engineering and technologyOnline reviewManagement Information SystemsKANO0502 economics and business0202 electrical engineering electronic engineering information engineeringProduct (category theory)Robustness (economics)Product designbusiness.industry05 social sciencesSettore IUS/10 - Diritto AmministrativoData scienceConjoint analysisProduct designConjoint analysiKano modelHelpfulnessNew product development050211 marketing020201 artificial intelligence & image processingbusinessInformation Systems
researchProduct

Memristors in Nonlinear Network : Application to Information (Signal and Image) Processing

2021

Memristor is a two-terminal nonlinear dynamic electronic device. Typically, it is a passive nano-device whose conductivity is controlled by the flux, time-integral of the voltage across its terminals, or by the charge, time-integral of the current flowing through it, and it presents interesting features for versatile applications. This thesis considers memristor use as a neighborhood connection for 2D cellular nonlinear or neural network (CNN), essentially for information (image and signal) processing and electronic prosthesis. We develop a model of the memristor based 2D cellular nonlinear networks CNNs compatible to image applications by incorporating memristor in the adjacent neighborhoo…

BilateralityMemristor and modelsSignal and image processingRéseau 2 dimensions[INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]Bilatéralité2 dimensional networks[INFO.INFO-OH] Computer Science [cs]/Other [cs.OH]Propagation (réseau 1D)Fitzhugh-Nagumo cellsTraitement du signal et de l'imageFitzhugh-Nagumo cellulesPropagation (1D network)Memristor et models
researchProduct

A new compact formulation for the discrete p-dispersion problem

2017

Abstract This paper addresses the discrete p -dispersion problem (PDP) which is about selecting  p facilities from a given set of candidates in such a way that the minimum distance between selected facilities is maximized. We propose a new compact formulation for this problem. In addition, we discuss two simple enhancements of the new formulation: Simple bounds on the optimal distance can be exploited to reduce the size and to increase the tightness of the model at a relatively low cost of additional computation time. Moreover, the new formulation can be further strengthened by adding valid inequalities. We present a computational study carried out over a set of large-scale test instances i…

Binary search algorithmMathematical optimization021103 operations researchInformation Systems and ManagementLine searchGeneral Computer Science0211 other engineering and technologies0102 computer and information sciences02 engineering and technologyManagement Science and Operations ResearchSolver01 natural sciencesIndustrial and Manufacturing EngineeringFacility location problemSet (abstract data type)010201 computation theory & mathematicsModeling and SimulationProgramming paradigmInteger programmingAlgorithmStandard model (cryptography)MathematicsEuropean Journal of Operational Research
researchProduct

Optimal standalone data center renewable power supply using an offline optimization approach

2022

Abstract Because of the increasing energy consumption of data centers and their C O 2 emissions, the ANR DATAZERO2 project aims to design autonomous data centers running solely on local renewable energy coupled with storage devices to overcome the intermittency issue. In order to optimize the use of renewable energy and storage devices, a MILP solver is usually in charge of assigning the power to be supplied to the data center. However, in order to reduce the computation time and make the approach scalable, it would be more appropriate to use a polynomial time algorithm. This paper aims at showing and proving that it is possible to provide an optimal power profile via a deterministic algori…

Binary search algorithmMathematical optimizationGeneral Computer Sciencebusiness.industryDeterministic algorithmComputer scienceEnergy consumptionSolverRenewable energyScalabilityData centerElectrical and Electronic EngineeringbusinessTime complexitySustainable Computing: Informatics and Systems
researchProduct

A distance metric on binary trees using lattice-theoretic measures

1990

A so called height function which is a strictly antitone supervaluation is defined on binary trees. Via lattice-theoretic results and using the height function, we can define a distance metric on binary trees of size n which can be computed in expected time O(n 3/2 )

Binary treeData structureRandom binary treeComputer Science ApplicationsTheoretical Computer ScienceHeight functionCombinatoricsTree structureLattice (order)Signal ProcessingMetric (mathematics)Metric treeComputer Science::DatabasesInformation SystemsMathematicsInformation Processing Letters
researchProduct

Efficient lower and upper bounds of the diagonal-flip distance between triangulations

2006

There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.

Binary treeOpen problem010102 general mathematicsDiagonalApproximation algorithmTriangulation (social science)0102 computer and information sciences01 natural sciencesUpper and lower boundsComputer Science ApplicationsTheoretical Computer ScienceCombinatorics010201 computation theory & mathematicsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYSignal Processing[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0101 mathematicsRotation (mathematics)Time complexityComputingMilieux_MISCELLANEOUSInformation SystemsMathematics
researchProduct