An official website of the United States government
This content will become publicly available on December 1, 2025
Flexibility justice: Exploring the relationship between electrical vehicle charging behaviors, demand flexibility and psychological factors
- Award ID(s):
- 2323732
- PAR ID:
- 10550540
- Publisher / Repository:
- Elsevier
- Date Published:
- Journal Name:
- Energy Research & Social Science
- Volume:
- 118
- Issue:
- C
- ISSN:
- 2214-6296
- Page Range / eLocation ID:
- 103753
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
Abstract Recently, Dvořák, Norin, and Postle introduced flexibility as an extension of list coloring on graphs (J Graph Theory 92(3):191–206, 2019, https://doi.org/10.1002/jgt.22447 ). In this new setting, each vertex v in some subset of V ( G ) has a request for a certain color r ( v ) in its list of colors L ( v ). The goal is to find an L coloring satisfying many, but not necessarily all, of the requests. The main studied question is whether there exists a universal constant $$\varepsilon >0$$ ε > 0 such that any graph G in some graph class $$\mathscr {C}$$ C satisfies at least $$\varepsilon$$ ε proportion of the requests. More formally, for $$k > 0$$ k > 0 the goal is to prove that for any graph $$G \in \mathscr {C}$$ G ∈ C on vertex set V , with any list assignment L of size k for each vertex, and for every $$R \subseteq V$$ R ⊆ V and a request vector $$(r(v): v\in R, ~r(v) \in L(v))$$ ( r ( v ) : v ∈ R , r ( v ) ∈ L ( v ) ) , there exists an L -coloring of G satisfying at least $$\varepsilon |R|$$ ε | R | requests. If this is true, then $$\mathscr {C}$$ C is called $$\varepsilon$$ ε - flexible for lists of size k . Choi, Clemen, Ferrara, Horn, Ma, and Masařík (Discrete Appl Math 306:20–132, 2022, https://doi.org/10.1016/j.dam.2021.09.021 ) introduced the notion of weak flexibility , where $$R = V$$ R = V . We further develop this direction by introducing a tool to handle weak flexibility. We demonstrate this new tool by showing that for every positive integer b there exists $$\varepsilon (b)>0$$ ε ( b ) > 0 so that the class of planar graphs without $$K_4, C_5 , C_6 , C_7, B_b$$ K 4 , C 5 , C 6 , C 7 , B b is weakly $$\varepsilon (b)$$ ε ( b ) -flexible for lists of size 4 (here $$K_n$$ K n , $$C_n$$ C n and $$B_n$$ B n are the complete graph, a cycle, and a book on n vertices, respectively). We also show that the class of planar graphs without $$K_4, C_5 , C_6 , C_7, B_5$$ K 4 , C 5 , C 6 , C 7 , B 5 is $$\varepsilon$$ ε -flexible for lists of size 4. The results are tight as these graph classes are not even 3-colorable.more » « less
-
The high efficiency of domain-specific hardware accelerators for machine learning (ML) has come fromspecialization, with the trade-off of less configurability/ flexibility. There is growing interest in developingflexible ML accelerators to make them future-proof to the rapid evolution of Deep Neural Networks (DNNs). However, the notion of accelerator flexibility has always been used in an informal manner, restricting computer architects from conducting systematic apples-to-apples design-space exploration (DSE) across trillions of choices. In this work, we formally define accelerator flexibility and show how it can be integrated for DSE. % flows. Specifically, we capture DNN accelerator flexibility across four axes: %the map-space of DNN accelerator along four flexibility axes: tiling, ordering, parallelization, and array shape. We categorize existing accelerators into 16 classes based on their axes of flexibility support, and define a precise quantification of the degree of flexibility of an accelerator across each axis. We leverage these to develop a novel flexibility-aware DSE framework. %It respects the difference of accelerator flexibility classes and degree of flexibility support in different accelerators, creating unique map-spaces. %and forms a unique map space for exploration. % We demonstrate how this can be used to perform first-of-their-kind evaluations, including an isolation study to identify the individual impact of the flexibility axes. We demonstrate that adding flexibility features to a hypothetical DNN accelerator designed in 2014 improves runtime on future (i.e., present-day) DNNs by 11.8x geomean.more » « less
-
Cognitive flexibility is a core component of executive function, a suite of cognitive capacities that enables individuals to update their behavior in dynamic environments. Human executive functions are proposed to be enhanced compared to other species, but this inference is based primarily on neuroanatomical studies. To address this, we examined the nature and origins of cognitive flexibility in chimpanzees, our closest living relatives. Across three studies, we examined different components of cognitive flexibility using reversal learning tasks where individuals first learned one contingency and then had to shift responses when contingencies flipped. In Study 1, we tested n = 82 chimpanzees ranging from juvenility to adulthood on a spatial reversal task, to characterize the development of basic shifting skills. In Study 2, we tested how n = 24 chimpanzees use spatial versus arbitrary perceptual information to shift, a proposed difference between human and nonhuman cognition. In Study 3, we tested n = 40 chimpanzees on a probabilistic reversal task. We found an extended developmental trajectory for basic shifting and shifting in response to probabilistic feedback—chimpanzees did not reach mature performance until late in ontogeny. Additionally, females were faster to shift than males were. We also found that chimpanzees were much more successful when using spatial versus perceptual cues, and highly perseverative when faced with probabilistic versus consistent outcomes. These results identify both core features of chimpanzee cognitive flexibility that are shared with humans, as well as constraints on chimpanzee cognitive flexibility that may represent evolutionary changes in human cognitive development.more » « less
