Results 61 to 70 of about 702,525 (326)

Symmetric cubical sets

open access: yesJournal of Pure and Applied Algebra, 2011
We introduce a new cubical model for homotopy types. More precisely, we'll define a category Qs with the following features: Qs is a PROP containing the classical box category as a subcategory, the category Qs-Set of presheaves of sets on Qs models the homotopy category, and combinatorial symmetric monoidal model categories with cofibrant unit all have
openaire   +3 more sources

Cubical sets and their site

open access: yesTheory and Applications of Categories, 2003
Even though cubical sets were there in the early work of Daniel Kan, simplicial sets have dominated since the contributions of Eilenberg and Zilber. Both combinatorial tools have their uses in algebraic topology and the passages between them need to be understood.
Grandis, Marco, Mauri, Luca
openaire   +2 more sources

NC-VIKOR Based MAGDM Strategy under Neutrosophic Cubic Set Environment [PDF]

open access: yesNeutrosophic Sets and Systems, 2018
In this paper, we propose VIKOR strategy in neutrosophic cubic set environment, namely NC-VIKOR. We first define NC-VIKOR strategy in neutrosophic cubic set environment to handle multi-attribute group decision making (MAGDM) problems, which means we ...
Surapati Pramanik   +3 more
doaj   +1 more source

On Birch and Swinnerton-Dyer's cubic surfaces

open access: yes, 2017
In a 1975 paper of Birch and Swinnerton-Dyer, a number of explicit norm form cubic surfaces are shown to fail the Hasse Principle. They make a correspondence between this failure and the Brauer--Manin obstruction, recently discovered by Manin.
AS Elsenhans   +14 more
core   +1 more source

Disjoint Paired-Dominating sets in Cubic Graphs [PDF]

open access: yesGraphs and Combinatorics, 2019
A paired-dominating set of a graph G is a dominating set D with the additional requirement that the induced subgraph G[D] contains a perfect matching. We prove that the vertex set of every claw-free cubic graph can be partitioned into two paired-dominating sets.
Gábor Bacsó   +3 more
openaire   +5 more sources

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

open access: yesFEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill   +4 more
wiley   +1 more source

Cubic Ordered Weighted Distance Operator and Application in Group Decision-Making

open access: yesJournal of Intelligent Systems, 2018
Group decision-making is a very useful technique for ranking the group of alternatives. The ordered weighted distance (OWD) operator is a new tool in group decision-making problems. In this paper, we apply the OWD operator on cubic information.
Shakeel Muhammad   +2 more
doaj   +1 more source

UiO‐66 metal–organic frameworks in biomedicine: From structural tunability to bioimaging, photodiagnostics, and photodynamic cancer therapy

open access: yesFEBS Open Bio, EarlyView.
UiO‐66(Zr) metal–organic frameworks are chemically stable, biocompatible, and highly tunable nanomaterials. Their modular structure enables controlled drug delivery, multimodal bioimaging, and light‐activated photodynamic therapy, supporting integrated diagnostic and therapeutic (theranostic) applications in cancer and biomedical research.
Veronika Huntošová   +2 more
wiley   +1 more source

Air Pollution Model using Neutrosophic Cubic Einstein Averaging Operators [PDF]

open access: yesNeutrosophic Sets and Systems, 2020
The neutrosophic cubic averaging and Einstein averaging aggregation operators are presented and applied to the air pollution model of the city of Peshawar, Pakistan. Neutrosophic cubic set (NCS) is a more generalized version of the neutrosophic set (NS)
Majid Khan   +3 more
doaj   +1 more source

Two results on the size of spectrahedral descriptions [PDF]

open access: yes, 2015
A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities.
Kummer, Mario
core   +3 more sources

Home - About - Disclaimer - Privacy