Search results for "SETS"

showing 10 items of 592 documents

Measuring Brand Value: The Case of Romanian Public Traded Companies

2018

Abstract Today most of the world's products benefit from a huge success because of a big brand. If in the past this was the case for the luxury industry where the power of branding it's reaching the consumer in the most impactful way. First by the mystery surrounding the brand, then by keeping the consumer as loyal as possible, the result being huge revenues for this brands, for, eg. LVMH, the largest group by revenue. But things are no longer the same, today the power of branding and huge revenues moved to another industry flourished, tech industry, where companies like Apple, Google, Facebook, Amazon, dominate their sectors benefiting from a strong brand name.

Entrepreneurshipintangible assetsSocial PsychologyHF5001-6182Economics Econometrics and Finance (miscellaneous)CorporationPower (social and political)0502 economics and businessRevenuegoodwillBusinessBrand equityComputingMilieux_MISCELLANEOUS050208 financeevaluationBrand namesRomanian05 social scienceslanguage.human_languageCommercebrand valueGoodwillComputerApplications_GENERALlanguageBusiness Management and Accounting (miscellaneous)050211 marketingBusinesscorporationStudies in Business and Economics
researchProduct

TGF-beta regulates airway responses via T cells.

2003

Abstract Allergic asthma is characterized by airway hyperreactivity, inflammation, and a Th2-type cytokine profile favoring IgE production. Beneficial effects of TGF-β and conflicting results regarding the role of Th1 cytokines have been reported from murine asthma models. In this study, we examined the T cell as a target cell of TGF-β-mediated immune regulation in a mouse model of asthma. We demonstrate that impairment of TGF-β signaling in T cells of transgenic mice expressing a dominant-negative TGF-β type II receptor leads to a decrease in airway reactivity in a non-Ag-dependent model. Increased serum levels of IFN-γ can be detected in these animals. In contrast, after injection of OVA …

Epitopes T-LymphocyteNitric Oxide Synthase Type IIImmunoglobulin EMiceAntibody SpecificityCell MovementT-Lymphocyte SubsetsTransforming Growth Factor betaImmunology and AllergyInterferon gammaLungInterleukin-13biologymedicine.diagnostic_testrespiratory systemImmunohistochemistrymedicine.anatomical_structureInterleukin 13Alum Compoundsmedicine.symptomBronchial HyperreactivityBronchoalveolar Lavage Fluidmedicine.drugGenetically modified mousemedicine.medical_specialtyOvalbuminT cellImmunologyCD2 AntigensInflammationMice Inbred StrainsMice TransgenicProtein Serine-Threonine KinasesInterferon-gammaInternal medicineAdministration InhalationmedicineAnimalsHumansAerosolsInflammationbusiness.industryReceptor Transforming Growth Factor-beta Type IITransforming growth factor betaImmunoglobulin ETh1 Cellsrespiratory tract diseasesEndocrinologyBronchoalveolar lavageImmunologybiology.proteinNitric Oxide SynthasebusinessReceptors Transforming Growth Factor betaJournal of immunology (Baltimore, Md. : 1950)
researchProduct

Commenti agli artt. 543-566

2019

Espropriazione forzata - pignoramento presso terzi - pignoramento immobiliare Commentary of civil procedure code articles ruling a) seizure in the hands of a third person; b) seizure of immoble assets of the debtor

Espropriazione forzata - pignoramento presso terzi - pignoramento immobiliareSettore IUS/15 - Diritto Processuale Civile- seizure in the hands of a third person - seizure of immoble assets of the debtor
researchProduct

Search for relativistic magnetic monopoles with the ANTARES neutrino telescope

2012

Magnetic monopoles are predicted in various unified gauge models and could be produced at intermediate mass scales. Their detection in a neutrino telescope is facilitated by the large amount of light emitted compared to that from muons. This paper reports on a search for upgoing relativistic magnetic monopoles with the ANTARES neutrino telescope using a data set of 116 days of live time taken from December 2007 to December 2008. The one observed event is consistent with the expected atmospheric neutrino and muon background, leading to a 90% C.L. upper limit on the monopole flux between 1.3 ¿ 10¿17 and 8.9 ¿ 10¿17 cm¿2 s¿1 sr¿1 for monopoles with velocity ß ¿ 0.625.

FLUXMuon backgroundParticle physicsGauge modelMagnetic monopolesAstrophysics::High Energy Astrophysical PhenomenaMagnetic monopoleneutrino telescopes; antares; magnetic monopoleFOS: Physical sciencesCosmic ray01 natural sciencesNuclear physics0103 physical sciencesNeutronFIELD010306 general physicsDETECTORCherenkov radiationZenithHigh Energy Astrophysical Phenomena (astro-ph.HE)NeutronsPhysicsSPECTRUMAtmospheric neutrinosMagnetic monopoleANTARES:Física::Acústica [Àrees temàtiques de la UPC]MuonCharged particles010308 nuclear & particles physicsAstronomy and AstrophysicsMonopols magnèticsUpper limitsNeutrino detectorMass scaleFISICA APLICADA[PHYS.HPHE]Physics [physics]/High Energy Physics - Phenomenology [hep-ph]Física nuclearData setsNeutrino telescopes[PHYS.ASTR]Physics [physics]/Astrophysics [astro-ph]Astrophysics - High Energy Astrophysical PhenomenaEvent (particle physics)TelescopesAstroparticle Physics
researchProduct

Dual Extrapolation for Sparse Generalized Linear Models

2020

International audience; Generalized Linear Models (GLM) form a wide class of regression and classification models, where prediction is a function of a linear combination of the input variables. For statistical inference in high dimension, sparsity inducing regularizations have proven to be useful while offering statistical guarantees. However, solving the resulting optimization problems can be challenging: even for popular iterative algorithms such as coordinate descent, one needs to loop over a large number of variables. To mitigate this, techniques known as screening rules and working sets diminish the size of the optimization problem at hand, either by progressively removing variables, o…

FOS: Computer and information sciencesComputer Science - Machine Learningextrapolation[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]Machine Learning (stat.ML)working setsgeneralized linear models[STAT.ML] Statistics [stat]/Machine Learning [stat.ML]Convex optimizationscreening rulesMachine Learning (cs.LG)[STAT.ML]Statistics [stat]/Machine Learning [stat.ML]Statistics - Machine Learning[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]Lassosparse logistic regression
researchProduct

Human experts vs. machines in taxa recognition

2020

The step of expert taxa recognition currently slows down the response time of many bioassessments. Shifting to quicker and cheaper state-of-the-art machine learning approaches is still met with expert scepticism towards the ability and logic of machines. In our study, we investigate both the differences in accuracy and in the identification logic of taxonomic experts and machines. We propose a systematic approach utilizing deep Convolutional Neural Nets with the transfer learning paradigm and extensively evaluate it over a multi-pose taxonomic dataset with hierarchical labels specifically created for this comparison. We also study the prediction accuracy on different ranks of taxonomic hier…

FOS: Computer and information sciencesComputer Science - Machine Learninghahmontunnistus (tietotekniikka)Computer scienceClassification approachTaxonomic expert02 engineering and technologyneuroverkotcomputer.software_genreConvolutional neural networkQuantitative Biology - Quantitative MethodsField (computer science)Machine Learning (cs.LG)Machine learning approachesStatistics - Machine LearningAutomated approachDeep neural networks0202 electrical engineering electronic engineering information engineeringTaxonomic rankQuantitative Methods (q-bio.QM)Classification (of information)Artificial neural networksystematiikka (biologia)Prediction accuracyIdentification (information)koneoppiminenMulti-image dataBenchmark (computing)020201 artificial intelligence & image processingConvolutional neural networksComputer Vision and Pattern RecognitionClassification errorsMachine Learning (stat.ML)Machine learningState of the artElectrical and Electronic EngineeringTaxonomySupport vector machinesLearning systemsbusiness.industryNode (networking)020206 networking & telecommunicationsComputer circuitsHierarchical classificationConvolutionSupport vector machineFOS: Biological sciencesTaxonomic hierarchySignal ProcessingBiomonitoringBenchmark datasetsArtificial intelligencebusinesscomputertaksonitSoftware
researchProduct

Improving table compression with combinatorial optimization

2002

We study the problem of compressing massive tables within the partition-training paradigm introduced by Buchsbaum et al. [SODA'00], in which a table is partitioned by an off-line training procedure into disjoint intervals of columns, each of which is compressed separately by a standard, on-line compressor like gzip. We provide a new theory that unifies previous experimental observations on partitioning and heuristic observations on column permutation, all of which are used to improve compression rates. Based on the theory, we devise the first on-line training algorithms for table compression, which can be applied to individual files, not just continuously operating sources; and also a new, …

FOS: Computer and information sciencesComputer scienceHeuristic (computer science)E.4G.2.1Data_CODINGANDINFORMATIONTHEORYDisjoint setsTravelling salesman problemPermutationArtificial IntelligenceCompression (functional analysis)Computer Science - Data Structures and AlgorithmsH.1.8H.2.7Data Structures and Algorithms (cs.DS)E.4; F.1.3; F.2.2; G.2.1; H.1.1; H.1.8; H.2.7H.1.1Dynamic programmingHardware and ArchitectureControl and Systems EngineeringCombinatorial optimizationTable (database)F.1.3F.2.2AlgorithmSoftwareInformation SystemsJournal of the ACM
researchProduct

Enumeration and Structure of Trapezoidal Words

2013

Trapezoidal words are words having at most $n+1$ distinct factors of length $n$ for every $n\ge 0$. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their enumeration. We then separate trapezoidal words into two disjoint classes: open and closed. A trapezoidal word is closed if it has a factor that occurs only as a prefix and as a suffix; otherwise it is open. We investigate open and closed trapezoidal words, in relation with their special factors. We prove that Sturmian palindromes are closed trapezoidal words and that a closed trapezoidal word is a Sturmian palindrome if and only if its longest repeated …

FOS: Computer and information sciencesFibonacci numberSpecial factorGeneral Computer ScienceFormal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata TheoryEnumerative formulaDisjoint sets68R15Theoretical Computer ScienceFOS: MathematicsPalindromeMathematics - CombinatoricsClosed wordsFibonacci wordMathematicsDiscrete mathematicsClosed wordSequenceta111Sturmian wordPrefixCombinatorics on wordsRich wordtrapezoidal wordF.4.3Combinatorics (math.CO)SuffixWord (group theory)Computer Science(all)
researchProduct

A Classification of Trapezoidal Words

2011

Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A trapezoidal word is closed if its longest repeated prefix has exactly two occurrences in the word, the second one being a suffix of the word. Otherwise it is open. We show that open trapezoidal words are all primitive and that closed trapezoidal words are all Sturmian. We then show that trapezoidal palindromes are closed (and therefore Sturmian). This allows us to characterize the special factors of Sturmian palindromes. We end with several open problems.

FOS: Computer and information sciencesFormal Languages and Automata Theory (cs.FL)lcsh:Mathematicstrapezoidal words Sturmian words special factors palindromesPalindromeComputer Science - Formal Languages and Automata TheoryDisjoint setslcsh:QA1-939lcsh:QA75.5-76.95PrefixCombinatoricsF.4.3FOS: MathematicsMathematics - CombinatoricsCombinatorics (math.CO)lcsh:Electronic computers. Computer scienceSuffixWord (group theory)Mathematics
researchProduct

The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

2020

AbstractIn model checking, partial-order reduction (POR) is an effective technique to reduce the size of the state space. Stubborn sets are an established variant of POR and have seen many applications over the past 31 years. One of the early works on stubborn sets shows that a combination of several conditions on the reduction is sufficient to preserve stutter-trace equivalence, making stubborn sets suitable for model checking of linear-time properties. In this paper, we identify a flaw in the reasoning and show with a counter-example that stutter-trace equivalence is not necessarily preserved. We propose a solution together with an updated correctness proof. Furthermore, we analyse in whi…

FOS: Computer and information sciencesModel checkingComputer Science - Logic in Computer ScienceTheoretical computer sciencepartial-order reductionComputer scienceautomaattien teoria020207 software engineering02 engineering and technologymodel checkingArticleLogic in Computer Science (cs.LO)Partial order reductionstubborn sets0202 electrical engineering electronic engineering information engineeringState space020201 artificial intelligence & image processingEquivalence (formal languages)Equivalence (measure theory)tietojenkäsittely
researchProduct