Results 41 to 50 of about 3,300 (225)
Calpain Proteases and the Evolving Signaling Network in Insect Embryonic Patterning
Journal of Experimental Zoology Part B: Molecular and Developmental Evolution, EarlyView.Insect embryonic Dorsal‐Ventral (DV) patterning relies on the BMP and Toll pathways to different extents. Calcium‐dependent cystein proteases of the Calpain family also exert an important function to pattern the DV axis. In Drosophila, Calpain A cleaves the Cactus/IkappaB inhibitor and modifies Toll signals in ventral regions of the embryo. In Rhodnius
Alison Julio, Helena Araujo
wiley +1 more source
Journal of Experimental Zoology Part B: Molecular and Developmental Evolution, EarlyView.ABSTRACT Aedes aegypti, a critical vector for tropical diseases, poses significant challenges for studying its embryogenesis due to difficulties in removing its rigid chorion and achieving effective fixation for in situ hybridization. Here, we present novel methodologies for fixation, dechorionation, DAPI staining, and in situ hybridization, enabling ...
Renata Coutinho‐dos‐Santos +8 more
wiley +1 more source
Embracing Creative Nonconformists and Promoting Them May Require Leaders' High Control Appraisals
Journal of Organizational Behavior, EarlyView.ABSTRACT Promoting creative employees is essential to innovation and organizational success. However, leaders do not always embrace the nonconformist nature of creative behaviors. This study examines how leaders' control appraisals—a personal orientation reflecting their belief in their own ability to control situations—influence their receptiveness ...
Xue Peng, Wen Cheng, Man‐Nok Wong
wiley +1 more source
Revista Mexicana de Biodiversidad, 2019 The terrestrial hydrophilid genus Agna Smetana (tribe Megasternini), specialized in rotten cacti, is redescribed and illustrated. Known species are diagnosed and a new one, A. zaragozai sp.
Emmanuel Arriaga-Varela +2 more
doaj +1 more source
On the Aα-Spectral Radii of Cactus Graphs
Mathematics, 2020 Let A ( G ) be the adjacent matrix and D ( G ) the diagonal matrix of the degrees of a graph G, respectively. For 0 ≤ α ≤ 1 , the A α -matrix is the general adjacency and signless Laplacian spectral matrix having the form of
Chunxiang Wang +3 more
doaj +1 more source
Partitioned Cacti: a Bijective Approach to the Cycle Factorization Problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we construct a bijection for partitioned 3-cacti that gives raise to a new formula for enumeration of factorizations of the long cycle into three permutations with given number of cycles.
Gilles Schaeffer, Ekaterina Vassilieva
doaj +1 more source
Plants, 2023 The Cactaceae family makes use of different strategies, both physiological and biochemical, for anatomical adjustments that allow them to grow and reproduce in arid environments.
María E. Soto Acosta +5 more
doaj +1 more source
The Ironic Effects of Financial Constraint‐Induced Suppression on Consumer Behavior
Psychology &Marketing, EarlyView.ABSTRACT Financial constraints are a pervasive concern for consumers, shaping spending patterns and psychological coping mechanisms. While previous research has primarily focused on behavioral adaptations, this study explores a cognitive mechanism: thought suppression.
Jane So, Miao Miao, Yuki Nishida
wiley +1 more source
Cactus Nurseries and Conservation in a Biosphere Reserve in Mexico
Ethnobiology Letters, 2013 Documenting how socio-ecosystem conservation knowledge and practice arise and are modified are issues of ethnobiological interest. In the Barranca de Metztitlán Biosphere Reserve (RBBM), plant nurseries, some of which were created as Environmental ...
María T. Pulido +1 more
doaj +1 more source
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
Networks, EarlyView.ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz +2 more
wiley +1 more source