Search results for "Information Science"

showing 10 items of 3627 documents

Energy Efficient Resource Allocation and User Scheduling for Collaborative Mobile Clouds with Hybrid Receivers

2014

In this paper, we study the resource allocation and user scheduling algorithm for minimizing the energy cost of data transmission in the context of OFDMA collaborative mobile cloud (CMC) with simultaneous wireless information and power transfer (SWIPT) receivers. The CMC, which consists of several collaborating MTs offers one potential solution for downlink content distribution and for the energy consumption reduction at the terminal side. Meanwhile, as RF signal can carry both information and energy simultaneously, the induced SWIPT has gained much attention for energy efficiency design of mobile nodes. Previous work on the design of CMC system mainly focused on the cloud formulation or en…

Computer Science - Networking and Internet ArchitectureNetworking and Internet Architecture (cs.NI)FOS: Computer and information sciencescollaborative mobile cloudscontent distributiongreen communicationsuser schedulingsubchannel allocationresursointipower allocationuser cooperation
researchProduct

MultivariateApart: Generalized partial fractions

2021

We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied to terms of a sum separately. The package is designed to work in Mathematica, but also provides interfaces to the Form and Singular computer algebra systems.

Computer Science - Symbolic ComputationHigh Energy Physics - TheoryFOS: Computer and information sciencesPolynomialComputer scienceFOS: Physical sciencesGeneral Physics and AstronomyRational functionSymbolic Computation (cs.SC)Partial fraction decomposition01 natural sciencesGröbner basisHigh Energy Physics - Phenomenology (hep-ph)ComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION0103 physical sciences010306 general physicsSpurious relationshipcomputer.programming_language010308 nuclear & particles physicsFunction (mathematics)Symbolic computationAlgebraHigh Energy Physics - PhenomenologyHigh Energy Physics - Theory (hep-th)Hardware and ArchitectureComputer Science::Mathematical SoftwareWolfram LanguagecomputerComputer Physics Communications
researchProduct

Introduction to the GiNaC Framework for Symbolic Computation within the C++ Programming Language

2002

AbstractThe traditional split into a low level language and a high level language in the design of computer algebra systems may become obsolete with the advent of more versatile computer languages. We describe GiNaC, a special-purpose system that deliberately denies the need for such a distinction. It is entirely written in C++and the user can interact with it directly in that language. It was designed to provide efficient handling of multivariate polynomials, algebras and special functions that are needed for loop calculations in theoretical quantum field theory. It also bears some potential to become a more general purpose symbolic package.

Computer Science - Symbolic ComputationI.1.3FOS: Computer and information sciencesFor loopTheoretical computer scienceAlgebra and Number TheoryFOS: Physical sciencesI.1.1; I.1.3Symbolic Computation (cs.SC)Computational Physics (physics.comp-ph)Symbolic computationI.1.1High Energy Physics - PhenomenologyComputational MathematicsHigh Energy Physics - Phenomenology (hep-ph)General purposeHigh-level programming languageSpecial functionsFourth-generation programming languagePhysics - Computational PhysicsC programming languageLow-level programming languageMathematicsJournal of Symbolic Computation
researchProduct

Worst Case Analysis of Non-local Games

2013

Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an input x i to the i th player who then responds by sending an answer a i to the referee. The players win if the answers a i satisfy a condition that may depend on the inputs x i .

Computer Science::Computer Science and Game TheoryComputingMilieux_PERSONALCOMPUTINGTheoryofComputation_GENERAL0102 computer and information sciencesNon local01 natural sciences010201 computation theory & mathematicsQuantum stateSimple (abstract algebra)0103 physical sciencesQuantum worldQuantum information010306 general physicsMathematical economicsCase analysisMathematics
researchProduct

Modular Strategies for Recursive Game Graphs

2006

AbstractMany problems in formal verification and program analysis can be formalized as computing winning strategies for two-player games on graphs. In this paper, we focus on solving games in recursive game graphs which can model the control flow in sequential programs with recursive procedure calls. While such games can be viewed as the pushdown games studied in the literature, the natural notion of winning in our framework requires the strategies to be modular with only local memory; that is, resolution of choices within a module does not depend on the context in which the module is invoked, but only on the history within the current invocation of the module. While reachability in (global…

Computer Science::Computer Science and Game TheoryTheoretical computer scienceGeneral Computer ScienceCombinatorial game theoryContext (language use)02 engineering and technology0102 computer and information sciences01 natural sciencesTheoretical Computer ScienceProgram analysisReachability0202 electrical engineering electronic engineering information engineering0101 mathematicsMathematicsbusiness.industry010102 general mathematics020207 software engineeringPushdown systemsResolution (logic)Modular designCall graphUndecidable problemModel-checkingGames in verification010201 computation theory & mathematicsbusinessComputer Science(all)
researchProduct

Learning by the Process of Elimination

2002

AbstractElimination of potential hypotheses is a fundamental component of many learning processes. In order to understand the nature of elimination, herein we study the following model of learning recursive functions from examples. On any target function, the learning machine has to eliminate all, save one, possible hypotheses such that the missing one correctly describes the target function. It turns out that this type of learning by the process of elimination (elm-learning, for short) can be stronger, weaker or of the same power as usual Gold style learning.While for usual learning any r.e. class of recursive functions can be learned in all of its numberings, this is no longer true for el…

Computer Science::Machine LearningProcess of eliminationGeneralization0102 computer and information sciences02 engineering and technology01 natural sciencesNumberingComputer Science ApplicationsTheoretical Computer ScienceDecidabilityAlgebraComputational Theory and Mathematics010201 computation theory & mathematicsPhysics::Plasma Physics0202 electrical engineering electronic engineering information engineeringRecursive functions020201 artificial intelligence & image processingEquivalence (formal languages)Information SystemsMathematicsInformation and Computation
researchProduct

Quantitative Analysis of Dynamic Association in Live Biological Fluorescent Samples

2014

Determining vesicle localization and association in live microscopy may be challenging due to non-simultaneous imaging of rapidly moving objects with two excitation channels. Besides errors due to movement of objects, imaging may also introduce shifting between the image channels, and traditional colocalization methods cannot handle such situations. Our approach to quantifying the association between tagged proteins is to use an object-based method where the exact match of object locations is not assumed. Point-pattern matching provides a measure of correspondence between two point-sets under various changes between the sets. Thus, it can be used for robust quantitative analysis of vesicle …

Computer and Information SciencesFluorescence-lifetime imaging microscopyMatching (graph theory)Cell SurvivalImage ProcessingAssociation (object-oriented programming)SciencerakkulatBioinformaticsTime-Lapse ImagingFluorescenceImage (mathematics)cellular structuresfluorescence imagingCell Line TumorMolecular Cell BiologyalgoritmitHumansComputer SimulationkuvantamismenetelmätPhysicsta113MicroscopyvesiclesMultidisciplinarySoftware Toolsbusiness.industryCytoplasmic VesiclesQRta1182Biology and Life SciencesSoftware EngineeringColocalizationExperimental dataPattern recognitionCell BiologyObject (computer science)imaging techniquesMolecular ImagingfluoresenssimikroskopiaSignal ProcessingEngineering and TechnologyMedicineArtificial intelligenceCellular Structures and OrganellesbusinessVesicle localizationResearch ArticlePLoS ONE
researchProduct

Kernel manifold alignment for domain adaptation

2016

The wealth of sensory data coming from different modalities has opened numerous opportu- nities for data analysis. The data are of increasing volume, complexity and dimensionality, thus calling for new methodological innovations towards multimodal data processing. How- ever, multimodal architectures must rely on models able to adapt to changes in the data dis- tribution. Differences in the density functions can be due to changes in acquisition conditions (pose, illumination), sensors characteristics (number of channels, resolution) or different views (e.g. street level vs. aerial views of a same building). We call these different acquisition modes domains, and refer to the adaptation proble…

Computer and Information SciencesKernel FunctionsInformation Storage and RetrievalSocial Scienceslcsh:Medicine1100 General Agricultural and Biological SciencesResearch and Analysis MethodsInfographicsTopologyPattern Recognition AutomatedKernel MethodsCognitionLearning and MemoryMemory1300 General Biochemistry Genetics and Molecular BiologyImage Interpretation Computer-AssistedData MiningHumansPsychologyLife Science910 Geography & travelOperator TheoryManifoldslcsh:ScienceObject Recognition1000 MultidisciplinaryApplied MathematicsSimulation and ModelingData Visualizationlcsh:RCognitive PsychologyBiology and Life SciencesEigenvaluesFacial ExpressionAlgebra10122 Institute of GeographyLinear AlgebraData Interpretation StatisticalPhysical SciencesCognitive SciencePerceptionlcsh:QEigenvectorsGraphsAlgorithmsMathematicsResearch ArticleNeuroscience
researchProduct

Social Network Analysis and Qualitative Interviews for Assessing Geographic Characteristics of Tourism Business Networks.

2015

This study integrates quantitative social network analysis (SNA) and qualitative interviews for understanding tourism business links in isolated communities through analysing spatial characteristics. Two case studies are used, the Surselva-Gotthard region in the Swiss Alps and Longyearbyen in the Arctic archipelago of Svalbard, to test the spatial characteristics of physical proximity, isolation, and smallness for understanding tourism business links. In the larger Surselva-Gotthard region, we found a strong relationship between geographic separation of the three communities on compartmentalization of the collaboration network. A small set of businesses played a central role in steering col…

Computer and Information SciencesNorwegian PeoplePopulation DynamicsSocial Scienceslcsh:MedicineResearch and Analysis MethodsSocial NetworkingAnalytical ChemistryInterviews as TopicSvalbardGeographical LocationsSociologyChemical AnalysisSurveys and QuestionnairesHumansEthnicitiesCooperative Behaviorlcsh:SciencePopulation BiologyGeographylcsh:RCommerceSocial SupportBiology and Life SciencesPaleontologyQualitative StudiesGeographic DistributionNavigationEuropeChemistrySocial NetworksResearch DesignPaleogeographyPhysical SciencesPeople and PlacesEarth SciencesEngineering and TechnologyPopulation GroupingsSteeringlcsh:QQualitative AnalysisSwitzerlandNetwork AnalysisResearch ArticlePLoS ONE
researchProduct

The community structure of the global corporate network.

2013

We investigate the community structure of the global ownership network of transnational corporations. We find a pronounced organization in communities that cannot be explained by randomness. Despite the global character of this network, communities reflect first of all the geographical location of firms, while the industrial sector plays only a marginal role. We also analyze the network in which the nodes are the communities and the links are obtained by aggregating the links among firms belonging to pairs of communities. We analyze the network centrality of the top 50 communities and we provide the first quantitative assessment of the financial sector role in connecting the global economy.

Computer and Information SciencesPhysics - Physics and SocietyEconomicsEconomic ModelsPopulation DynamicsSocial SciencesSpatial Economic Analysislcsh:MedicineFOS: Physical sciencesGenetics and Molecular Biology1100 General Agricultural and Biological SciencesPhysics and Society (physics.soc-ph)Economic GeographySystems ScienceFOS: Economics and businessDevelopment Economics1300 General Biochemistry Genetics and Molecular BiologyHumansIndustrylcsh:ScienceStructure of Markets1000 MultidisciplinaryGeographyApplied MathematicsPhysicslcsh:RInternational AgenciesIndustrial OrganizationComplex SystemsGeneral MedicineOrganizational Culture10003 Department of Banking and FinanceEconomic Analysis330 EconomicsMathematical EconomicsGeneral BiochemistryPhysical SciencesEarth SciencesInterdisciplinary Physicslcsh:QEconomic DevelopmentGeneral Agricultural and Biological SciencesQuantitative Finance - General FinanceGeneral Finance (q-fin.GN)MathematicsResearch ArticlePloS one
researchProduct