Results 51 to 60 of about 11,475 (265)

Security-Aware Task Scheduling Using Untrusted Components in High-Level Synthesis

open access: yesIEEE Access, 2018
The high penetration of third-party intellectual property is accompanied with severe security issues, and thus, security constraints during task scheduling have recently been proposed for protecting multiprocessor system-on-chip systems.
Nan Wang   +4 more
doaj   +1 more source

MicroCT reinvestigation of the only articulated fossil anostomid fish reveals synonymy of Arhinolemur Ameghino, 1898 and Megaleporinus Ramirez et al., 2017

open access: yesThe Anatomical Record, EarlyView.
Abstract Arhinolemur scalabrinii† Ameghino, 1898 was originally described as a strepsirrhine primate (Mammalia) but has been recognized as an anostomid fish since 2012. It remains the only extinct anostomid species known from complete cranial material.
Karen M. Panzeri   +8 more
wiley   +1 more source

Computing maximum cliques in $B_2$-EPG graphs

open access: yes, 2017
EPG graphs, introduced by Golumbic et al. in 2009, are edge-intersection graphs of paths on an orthogonal grid. The class $B_k$-EPG is the subclass of EPG graphs where the path on the grid associated to each vertex has at most $k$ bends.
D Epstein, M Bougeret, M Pergel
core   +1 more source

Skin Shade Discrimination Is Associated With Disordered Weight Control Behaviors in Hong Kong, Malaysia, Singapore, and Thailand

open access: yesInternational Journal of Eating Disorders, EarlyView.
ABSTRACT Objective Emerging evidence indicates that experiencing discrimination is associated with disordered eating. This study aimed to test the association between experiences of colorism (skin shade discrimination penalizing those with darker skin) and the prevalence of disordered weight control behaviors (DWCBs) in four Asian countries/regions ...
Nadia Craddock   +5 more
wiley   +1 more source

Perfect graphs of arbitrarily large clique-chromatic number

open access: yes, 2015
We prove that there exist perfect graphs of arbitrarily large clique-chromatic number. These graphs can be obtained from cobipartite graphs by repeatedly gluing along cliques. This negatively answers a question raised by Duffus, Sands, Sauer, and Woodrow
Charbit, Pierre   +3 more
core   +3 more sources

Allyship Motives and Their Differential Associations With Identity and Collective Action

open access: yesEuropean Journal of Social Psychology, EarlyView.
ABSTRACT Across three studies (N = 785) in the context of anti‐racist collective action in the United States and Germany, we empirically validate a theoretical framework of four motives for advantaged group allyship: outgroup‐focused, ingroup‐focused, personal and morality. We investigate the types of identification these motives stem from and how they
Lea Hartwich, Julia C. Becker
wiley   +1 more source

On the choosability of claw-free perfect graphs

open access: yes, 2015
It has been conjectured that for every claw-free graph $G$ the choice number of $G$ is equal to its chromatic number. We focus on the special case of this conjecture where $G$ is perfect.
Gravier, Sylvain   +2 more
core   +3 more sources

Growing Pre‐Service Teachers' Well‐Being Capacity: Comparing the Perspectives of Teacher Education Programme Administrators and Teacher Candidates Across Canada

open access: yesFuture in Educational Research, EarlyView.
ABSTRACT Recognising the importance of addressing teacher development in the early career stages, our study examined programmatic considerations within teacher education programmes in Canada to determine the extent to which teacher preparation included support for and promotion of teacher well‐being as part of their pre‐service teaching development ...
Benjamin Kutsyuruba   +6 more
wiley   +1 more source

Oriented coloring on recursively defined digraphs

open access: yes, 2019
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph G=(V,A)
Gurski, Frank   +2 more
core   +1 more source

Home - About - Disclaimer - Privacy