نتایج جستجو برای: independent
تعداد نتایج: 447635 فیلتر نتایج به سال:
Experiential learning activities (ELAs) that are industry-partnered and real-world problem-based can provide undergraduate students with concrete experiences of using information technologies in the field. Flow theory provides a theoretical basis to guide the design of ELAs, ensuring that the goals are clear, feedback is explicit, and the challenges and skills are balanced. Based on this theory...
We propose a method that aligns biomedical acronyms and their long-form definitions across different languages. We use a freely available search and extraction tool by which abbreviations, together with their fully expanded forms, are massively mined from the Web. In a subsequent step, language-specific variants, synonyms, and translations of the extracted acronym definitions are normalized by ...
We determine the maximal cocliques of size ≥ 4q2 + 5q + 5 in the Kneser graph on point-plane flags in PG(4, q). The maximal size of a coclique in this graph is (q2 + q + 1)(q3 + q2 + q + 1).
and Executive Summary ............................................................................................... 2 Table of
No:
We show that the independent set sequence of a bipartite graph need not be unimodal.
Detecting and isolating multiple plant-wide oscillations via spectral independent component analysis
Disturbances that propagate throughout a plant can have an impact on product quality and running costs. There is thus a motivation for the automated detection of plant-wide disturbances and for the isolation of the sources. A new application of independent component analysis (ICA), multi-resolution spectral ICA, is proposed to detect and isolate the sources of multiple oscillations in a chemica...
The direct product of graphs G = (V (G), E(G)) and H = (V (H), E(H)) is the graph, denoted as G×H, with vertex set V (G×H) = V (G)×V (H), where vertices (x1, y1) and (x2, y2) are adjacent in G × H if x1x2 ∈ E(G) and y1y2 ∈ E(H). Let n be odd and m even. We prove that every maximum independent set in Pn×G, respectively Cm×G, is of the form (A×C)∪(B× D), where C and D are nonadjacent in G, and A∪...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید