Search results for "Information science"

showing 10 items of 3627 documents

The ideal duplication

2021

AbstractIn this paper we present and study the ideal duplication, a new construction within the class of the relative ideals of a numerical semigroup S, that, under specific assumptions, produces a relative ideal of the numerical duplication $$S\bowtie ^b E$$ S ⋈ b E . We prove that every relative ideal of the numerical duplication can be uniquely written as the ideal duplication of two relative ideals of S; this allows us to better understand how the basic operations of the class of the relative ideals of $$S\bowtie ^b E$$ S ⋈ b E work. In particular, we characterize the ideals E such that $$S\bowtie ^b E$$ S ⋈ b E is nearly Gorenstein.

Class (set theory)Pure mathematicsAlgebra and Number TheoryIdeal (set theory)Nearly Gorenstein semigroups010102 general mathematics0102 computer and information sciences01 natural sciencesNearly Gorenstein semigroups Numerical duplication Relative ideal Canonical idealSettore MAT/02 - Algebra010201 computation theory & mathematicsNumerical semigroupNumerical duplicationRelative idealCanonical ideal0101 mathematicsAlgebra over a fieldMathematics
researchProduct

Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection

2012

We introduce a span program that decides st-connectivity, and generalize the span program to develop quantum algorithms for several graph problems. First, we give an algorithm for st-connectivity that uses O(n d^{1/2}) quantum queries to the n x n adjacency matrix to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disconnected. We also show that if T is a path, a star with two subdivided legs, or a subdivision of a claw, its presence as a subgraph in the input graph G can be detected with O(n) quantum queries to the adjacency matrix. Under the promise that G either contains T as a subgraph or does not contain T…

Clawst-connectivitybusiness.industryA* search algorithm0102 computer and information sciences01 natural sciencesLogarithmic spacelaw.inventionCombinatorics010201 computation theory & mathematicslaw0103 physical sciencesQuantum algorithmAdjacency matrix010306 general physicsbusinessQuantumMathematicsSubdivision
researchProduct

A Literature Review on Cloud Computing Adoption Issues in Enterprises

2014

Part 3: Creating Value through Applications; International audience; Cloud computing has received increasing interest from enterprises since its inception. With its innovative information technology (IT) services delivery model, cloud computing could add technical and strategic business value to enterprises. However, cloud computing poses highly concerning internal (e.g., Top management and experience) and external issues (e.g., regulations and standards). This paper presents a systematic literature review to explore the current key issues related to cloud computing adoption. This is achieved by reviewing 51 articles published about cloud computing adoption. Using the grounded theory approa…

Cloud computing securityKnowledge managementbusiness.industry[SHS.INFO]Humanities and Social Sciences/Library and information sciencesCorporate governanceenterpriseInformation technologyCloud computingBusiness valueGrounded theorySystematic reviewInformation systemCloud computing[INFO]Computer Science [cs]businessadoption
researchProduct

SMART: Unique splitting-while-merging framework for gene clustering

2014

© 2014 Fa et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Successful clustering algorithms are highly dependent on parameter settings. The clustering performance degrades significantly unless parameters are properly set, and yet, it is difficult to set these parameters a priori. To address this issue, in this paper, we propose a unique splitting-while-merging clustering framework, named "splitting merging awareness tactics" (SMART), which does not require any a priori knowledge of either the number …

Clustering algorithmsMicroarrayslcsh:MedicineGene ExpressionBioinformaticscomputer.software_genreCell SignalingData MiningCluster Analysislcsh:ScienceFinite mixture modelOligonucleotide Array Sequence AnalysisPhysicsMultidisciplinarySMART frameworkConstrained clusteringCompetitive learning modelBioassays and Physiological AnalysisMultigene FamilyCanopy clustering algorithmEngineering and TechnologyData miningInformation TechnologyGenomic Signal ProcessingAlgorithmsResearch ArticleSignal TransductionComputer and Information SciencesFuzzy clusteringCorrelation clusteringResearch and Analysis MethodsClusteringMolecular GeneticsCURE data clustering algorithmGeneticsGene RegulationCluster analysista113Gene Expression Profilinglcsh:RBiology and Life SciencesComputational BiologyCell BiologyDetermining the number of clusters in a data setComputingMethodologies_PATTERNRECOGNITIONSplitting-merging awareness tactics (SMART)Signal ProcessingAffinity propagationlcsh:QGene expressionClustering frameworkcomputer
researchProduct

Co-construct territorial cultures

2015

International audience; Carrying out investigations in the framework of the scientific network INTI (International Network of Territorial Intelligence, http://inti.hypotheses.org/), the main idea is here to value the contribution of multiple approaches in territorial information and communication science that can be experienced there. Inspired by the triad of Pestalozzi, these experiences have applied and adapted the territorial engineering approach "Catalyse" in their territories.From the cooperative structuring of information to concrete initiatives of local change, communication processes make possible iterations between understanding and action, in which the analysis of the effects of s…

Co-construct[SHS.ANTHRO-SE] Humanities and Social Sciences/Social Anthropology and ethnologycommunication[SHS.INFO]Humanities and Social Sciences/Library and information sciences[SHS.ANTHRO-SE]Humanities and Social Sciences/Social Anthropology and ethnology[SHS]Humanities and Social SciencesinformationcultureTerritorial Intelligenceterritorial cultures[ SHS.ANTHRO-SE ] Humanities and Social Sciences/Social Anthropology and ethnology[ SHS ] Humanities and Social Sciences[ SHS.INFO ] Humanities and Social Sciences/Library and information sciencesintelligence territoriale[SHS] Humanities and Social SciencesComputingMilieux_MISCELLANEOUS
researchProduct

Querytogether : Enabling entity-centric exploration in multi-device collaborative search

2018

Collaborative and co-located information access is becoming increasingly common. However, fairly little attention has been devoted to the design of ubiquitous computing approaches for spontaneous exploration of large information spaces enabling co-located collaboration. We investigate whether an entity-based user interface provides a solution to support co-located search on heterogeneous devices. We present the design and implementation of QueryTogether, a multi-device collaborative search tool through which entities such as people, documents, and keywords can be used to compose queries that can be shared to a public screen or specific users with easy touch enabled interaction. We conducted…

Co-located searchUbiquitous computingComputer scienceExploratory searchmedia_common.quotation_subjectInformation access02 engineering and technologyLibrary and Information SciencesManagement Science and Operations ResearchMulti-deviceHuman–computer interaction020204 information systemsMulti device0202 electrical engineering electronic engineering information engineeringMedia TechnologyConversationBaseline (configuration management)media_commonSettore ING-INF/05 - Sistemi Di Elaborazione Delle Informazionita113Settore INF/01 - InformaticaCommon groundFlexibility (personality)020207 software engineering113 Computer and information sciencesComputer Science ApplicationsUser interfaceCollaborative searchInformation Systems
researchProduct

Optical d-level frequency-time-based cluster states

2019

Cluster states, a specific class of multi-partite entangled states, are of particular importance for quantum science, as such systems are equivalent to the realization of one-way (or measurement-based) quantum computers [1]. In this scheme, algorithms are implemented through high-fidelity measurements on the parties of the state [2]. While two-level (i.e. qubit) cluster states have been realized so far, increasing the number of particles to boost the computational resource comes at the price of significantly reduced coherence time and detection rates, as well as increased sensitivity to noise, restricting the realization of discrete cluster states to a record of eight qubits. In contrast, t…

Coherence timeComputer scienceQubitCluster (physics)Quantum information scienceTopologyRealization (systems)QuantumQuantum computerCoherence (physics)
researchProduct

Forests and pattern-avoiding permutations modulo pure descents

2018

Abstract We investigate an equivalence relation on permutations based on the pure descent statistic. Generating functions are given for the number of equivalence classes for the set of all permutations, and the sets of permutations avoiding exactly one pattern of length three. As a byproduct, we exhibit a permutation set in one-to-one correspondence with forests of ordered binary trees, which provides a new combinatorial class enumerated by the single-source directed animals on the square lattice. Furthermore, bivariate generating functions for these sets are given according to various statistics.

Combinatorics010201 computation theory & mathematicsModulo010102 general mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0102 computer and information sciences0101 mathematics[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Extending the star order to Rickart rings

2015

Star partial order was initially introduced for semigroups and rings with (proper) involution. In particular, this order has recently been studied on Rickart *-rings. It is known that the star order in such rings can be characterized by conditions not involving involution explicitly. Owing to these characterizations, the order can be extended to certain special Rickart rings named strong in the paper; this extension is the objective of the paper. The corresponding order structure of strong Rickart rings is studied more thoroughly. In particular, the most significant lattice properties of star-ordered Rickart *-rings are successfully transferred to strong Rickart rings; also several new resu…

CombinatoricsAlgebra and Number TheoryMathematics::Commutative Algebra010201 computation theory & mathematicsMathematics::Rings and AlgebrasOrder structureLattice properties010103 numerical & computational mathematics0102 computer and information sciences0101 mathematics01 natural sciencesMathematicsLinear and Multilinear Algebra
researchProduct

Tighter Relations between Sensitivity and Other Complexity Measures

2014

The sensitivity conjecture of Nisan and Szegedy [12] asks whether the maximum sensitivity of a Boolean function is polynomially related to the other major complexity measures of Boolean functions. Despite major advances in analysis of Boolean functions in the past decade, the problem remains wide open with no positive result toward the conjecture since the work of Kenyon and Kutin from 2004 [11].

CombinatoricsComplexity indexDiscrete mathematicsConjecture010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing0102 computer and information sciences02 engineering and technologySensitivity (control systems)Boolean function01 natural sciencesMathematics
researchProduct