Search results for "LAB"

showing 10 items of 7932 documents

Software startup education: gamifying growth hacking

2021

Startups seek to create highly scalable business models. For startups, growth is thus vital. Growth hacking is a marketing strategy advocated by various startup practitioner experts. It focuses on using low cost practices while utilizing existing platforms in creative ways to gain more users for the service. Though topics related to growth hacking such as marketing on a general level have been extensively studied in the past, growth hacking as a practitioner-born topic has not seen much interest among the academia. To both spark interest in growth hacking, and to facilitate teaching growth hacking in the academia, we present two board games intended to serve as an engaging introduction to g…

FOS: Computer and information sciencesService (systems architecture)Knowledge managementgamifyingComputingMilieux_LEGALASPECTSOFCOMPUTINGBusiness modelstartup-yrityksetComputer Science - Computers and SocietypelillistäminenSoftwareohjelmistoalaComputers and Society (cs.CY)digitaalinen markkinointiHackercomputer.programming_languagemarkkinoinnin suunnittelueducationyrityksen perustaminenbusiness.industrysoftwarestartup gamificationComputingMilieux_PERSONALCOMPUTINGstartup educationstartupMarketing strategysoftware startupSPARK (programming language)koulutusGeneral levelmarkkinointikasvuyrityksetliiketoimintaScalabilitygrowth hackingbusinesscomputerhacking
researchProduct

Minimal forbidden factors of circular words

2017

Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al. [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language $M$, computes a DFA recognizing the language whose set of minimal forbidden factors is $M$. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word.…

FOS: Computer and information sciencesSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniGeneral Computer ScienceDiscrete Mathematics (cs.DM)Finite automatonSettore INF/01 - InformaticaFormal Languages and Automata Theory (cs.FL)Factor automatonComputer Science - Formal Languages and Automata TheoryComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Circular wordFibonacci wordMinimal forbidden factorTheoretical Computer ScienceComputer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
researchProduct

Constructing Antidictionaries in Output-Sensitive Space

2021

A word $x$ that is absent from a word $y$ is called minimal if all its proper factors occur in $y$. Given a collection of $k$ words $y_1,y_2,\ldots,y_k$ over an alphabet $\Sigma$, we are asked to compute the set $\mathrm{M}^{\ell}_{y_{1}\#\ldots\#y_{k}}$ of minimal absent words of length at most $\ell$ of word $y=y_1\#y_2\#\ldots\#y_k$, $\#\notin\Sigma$. In data compression, this corresponds to computing the antidictionary of $k$ documents. In bioinformatics, it corresponds to computing words that are absent from a genome of $k$ chromosomes. This computation generally requires $\Omega(n)$ space for $n=|y|$ using any of the plenty available $\mathcal{O}(n)$-time algorithms. This is because a…

FOS: Computer and information sciencesSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniOutput sensitive algorithmsString algorithmsPhysicsAntidictionarieSettore INF/01 - InformaticaOutput sensitive algorithm0102 computer and information sciencesAbsent wordsSpace (mathematics)01 natural sciencesAntidictionariesCombinatorics010201 computation theory & mathematicsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYData compressionComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)Computer Science::Symbolic Computation[INFO]Computer Science [cs]Absent wordAlphabetWord (group theory)2019 Data Compression Conference (DCC)
researchProduct

String attractors and combinatorics on words

2019

The notion of \emph{string attractor} has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word $w=w[1]w[2]\cdots w[n]$ is a subset $\Gamma$ of the positions $\{1,\ldots,n\}$, such that all distinct factors of $w$ have an occurrence crossing at least one of the elements of $\Gamma$. While finding the smallest string attractor for a word is a NP-complete problem, it has been proved in [Kempa and Prezza, 2018] that dictionary compressors can be interpreted as algorithms approximating the smallest string attractor for a given word. In this paper we explore the noti…

FOS: Computer and information sciencesSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniSettore INF/01 - InformaticaFormal Languages and Automata Theory (cs.FL)De Brujin wordComputer Science - Formal Languages and Automata TheoryBurrows-Wheeler transformString attractorComputer Science - Data Structures and AlgorithmsThue-Morse wordLempel-Ziv encodingBurrows-Wheeler transform; De Brujin word; Lempel-Ziv encoding; Run-length encoding; String attractor; Thue-Morse wordData Structures and Algorithms (cs.DS)Run-length encoding
researchProduct

Quasi conjunction, quasi disjunction, t-norms and t-conorms: Probabilistic aspects

2013

We make a probabilistic analysis related to some inference rules which play an important role in nonmonotonic reasoning. In a coherence-based setting, we study the extensions of a probability assessment defined on $n$ conditional events to their quasi conjunction, and by exploiting duality, to their quasi disjunction. The lower and upper bounds coincide with some well known t-norms and t-conorms: minimum, product, Lukasiewicz, and Hamacher t-norms and their dual t-conorms. On this basis we obtain Quasi And and Quasi Or rules. These are rules for which any finite family of conditional events p-entails the associated quasi conjunction and quasi disjunction. We examine some cases of logical de…

FOS: Computer and information sciencesSettore MAT/06 - Probabilita' E Statistica MatematicaInformation Systems and ManagementComputer Science - Artificial Intelligencet-Norms/conormDuality (mathematics)goodman-nguyen inclusion relation; lower/upper probability bounds; t-norms/conorms; generalized loop rule; coherence; quasi conjunction/disjunctionComputer Science::Artificial IntelligenceTheoretical Computer ScienceArtificial IntelligenceFOS: MathematicsProbabilistic analysis of algorithmsNon-monotonic logicRule of inferenceLower/upper probability boundGoodman–Nguyen inclusion relationMathematicsEvent (probability theory)Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniDiscrete mathematicsInterpretation (logic)Probability (math.PR)Probabilistic logicCoherence (philosophical gambling strategy)Generalized Loop ruleComputer Science ApplicationsAlgebraArtificial Intelligence (cs.AI)Control and Systems EngineeringQuasi conjunction/disjunctionCoherenceMathematics - ProbabilitySoftwareInformation Sciences
researchProduct

A quantum vocal theory of sound

2020

Concepts and formalism from acoustics are often used to exemplify quantum mechanics. Conversely, quantum mechanics could be used to achieve a new perspective on acoustics, as shown by Gabor studies. Here, we focus in particular on the study of human voice, considered as a probe to investigate the world of sounds. We present a theoretical framework that is based on observables of vocal production, and on some measurement apparati that can be used both for analysis and synthesis. In analogy to the description of spin states of a particle, the quantum-mechanical formalism is used to describe the relations between the fundamental states associated with phonetic labels such as phonation, turbule…

FOS: Computer and information sciencesSound (cs.SD)Computer scienceAudio processingAnalogyAudio processing; Quantum-inspired algorithms; Sound representation01 natural sciencesComputer Science - Sound050105 experimental psychologyTheoretical Computer Sciencesymbols.namesakeAudio and Speech Processing (eess.AS)0103 physical sciencesFOS: Electrical engineering electronic engineering information engineering0501 psychology and cognitive sciencesPhonationElectrical and Electronic Engineering010306 general physicsQuantumHuman voiceQuantum computerSound representationSettore INF/01 - Informatica05 social sciencesStatistical and Nonlinear PhysicsObservableSettore MAT/04 - Matematiche ComplementariElectronic Optical and Magnetic MaterialsVibrationClassical mechanicsFourier transformComputer Science::SoundModeling and SimulationSignal ProcessingsymbolsQuantum-inspired algorithms Audio processing Sound representationQuantum-inspired algorithmsSettore ING-INF/05 - Sistemi di Elaborazione delle InformazioniElectrical Engineering and Systems Science - Audio and Speech Processing
researchProduct

Local inhomogeneous weighted summary statistics for marked point processes

2023

We introduce a family of local inhomogeneous mark-weighted summary statistics, of order two and higher, for general marked point processes. Depending on how the involved weight function is specified, these summary statistics capture different kinds of local dependence structures. We first derive some basic properties and show how these new statistical tools can be used to construct most existing summary statistics for (marked) point processes. We then propose a local test of random labelling. This procedure allows us to identify points, and consequently regions, where the random labelling assumption does not hold, e.g.~when the (functional) marks are spatially dependent. Through a simulatio…

FOS: Computer and information sciencesStatistics and ProbabilityEarthquakefunctional marked point proceStatistics - Computationmark correlation functionMethodology (stat.ME)Discrete Mathematics and Combinatoricsrandom labellingStatistics Probability and UncertaintySettore SECS-S/01 - Statisticamarked K-functionComputation (stat.CO)Statistics - Methodologylocal envelope test
researchProduct

Quantum GestART: Identifying and Applying Correlations between Mathematics, Art, and Perceptual Organization

2020

Mathematics can help analyze the arts and inspire new artwork. Mathematics can also help make transformations from one artistic medium to another, considering exceptions and choices, as well as artists' individual and unique contributions. We propose a method based on diagrammatic thinking and quantum formalism. We exploit decompositions of complex forms into a set of simple shapes, discretization of complex images, and Dirac notation, imagining a world of "prototypes" that can be connected to obtain a fine or coarse-graining approximation of a given visual image. Visual prototypes are exchanged with auditory ones, and the information (position, size) characterizing visual prototypes is con…

FOS: Computer and information sciencesdiagrams; Dirac notation; Gestalt; Gestural similarity; sonificationmedia_common.quotation_subjectHistory and Overview (math.HO)ComputerApplications_COMPUTERSINOTHERSYSTEMSThe artsGestaltBra–ket notationPerceptionGestural similarityFOS: MathematicssonificationQuantummedia_commonCognitive scienceSettore INF/01 - InformaticaMathematics - History and OverviewApplied MathematicsSettore MAT/04 - Matematiche ComplementariMultimedia (cs.MM)Gestural similarity Gestalt diagrams Dirac notation sonificationComputational MathematicsdiagramsSonificationModeling and SimulationGestalt psychologyDirac notationInformationSystems_MISCELLANEOUSSettore ING-INF/05 - Sistemi di Elaborazione delle InformazioniComputer Science - MultimediaMusic
researchProduct

Why Does Cultural Diversity Foster Technology-enabled Intergenerational Collaboration?

2019

Globalization and information technology enable people to join the movement of global citizenship and work without borders. However, different type of barriers existed that could affect collaboration in todays work environment, in which different generations are involved. Although researchers have identified several technical barriers to intergenerational collaboration (iGOAL), the influence of cultural diversity on iGOAL has rarely been studied. Therefore, using a quantitative study approach, this paper investigates the impact of differences in cultural background on perceived technical and operational barriers to iGOAL. Our study reveals six barriers to IGC that are perceived differently …

FOS: Computer and information scienceshaasteet (ongelmat)problemsComputer sciencebarriersComputer Science - Human-Computer Interactionchallengessukupolvet02 engineering and technologyAffect (psychology)Human-Computer Interaction (cs.HC)Cultural backgroundGlobalizationComputer Science - Computers and SocietyCultural diversityComputers and Society (cs.CY)0202 electrical engineering electronic engineering information engineeringH.1.2cross-cultural teamworkGeneral Environmental Sciencekulttuurienvälisyysbusiness.industryInformation technology020206 networking & telecommunicationsPublic relationstiimityöWork (electrical)cross-generational collaborationGeneral Earth and Planetary Sciences020201 artificial intelligence & image processingGlobal citizenshipbusiness
researchProduct

Low-Power Audio Keyword Spotting using Tsetlin Machines

2021

The emergence of Artificial Intelligence (AI) driven Keyword Spotting (KWS) technologies has revolutionized human to machine interaction. Yet, the challenge of end-to-end energy efficiency, memory footprint and system complexity of current Neural Network (NN) powered AI-KWS pipelines has remained ever present. This paper evaluates KWS utilizing a learning automata powered machine learning algorithm called the Tsetlin Machine (TM). Through significant reduction in parameter requirements and choosing logic over arithmetic based processing, the TM offers new opportunities for low-power KWS while maintaining high learning efficacy. In this paper we explore a TM based keyword spotting (KWS) pipe…

FOS: Computer and information sciencesspeech commandSound (cs.SD)Computer scienceSpeech recognition02 engineering and technologykeyword spottingMachine learningcomputer.software_genreComputer Science - SoundReduction (complexity)Audio and Speech Processing (eess.AS)020204 information systemsFOS: Electrical engineering electronic engineering information engineering0202 electrical engineering electronic engineering information engineeringElectrical and Electronic EngineeringArtificial neural networkLearning automatabusiness.industrylearning automatalcsh:Applications of electric power020206 networking & telecommunicationslcsh:TK4001-4102Pipeline (software)Power (physics)machine learningTsetlin MachineMFCCKeyword spottingelectrical_electronic_engineeringScalabilityMemory footprintpervasive AI020201 artificial intelligence & image processingMel-frequency cepstrumArtificial intelligencebusinesscomputerartificial neural networkEfficient energy useElectrical Engineering and Systems Science - Audio and Speech Processing
researchProduct