Search

Your search keyword '"accessibility problem"' showing total 24 results
Start Over Descriptor "accessibility problem"

Refine your results

more »

more »

more »
24 results on '"accessibility problem"'

1. 基于 α-shape 算法和泛洪填充法的汽缸中分面 蒸汽泄漏通道辨识.

Author

李宇航 and 王炜哲

Abstract

Copyright of Journal of Engineering for Thermal Energy & Power / Reneng Dongli Gongcheng is the property of Journal of Engineering for Thermal Energy & Power and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Published
2024
Full Text
View/download PDF

3. Forgetting: the availability, accessibility, and intentional control problem. Part 2

Author

Veronika V. Nourkova and Alyona A. Gofman

Subjects
forgetting, availability problem, accessibility problem, memory trace decay, interference, retrieval inhibition, intentional forgetting, Psychology, BF1-990
Abstract

The paper focuses on the phenomenon of forgetting as a primal and generally productive memory process. The cases that require temporary and permanent forgetting of the data stored in the long-term memory are contrasted. The main methodological obstacle in forgetting research is identified as arising from the logical prohibition to argument from the negative, i.e. “the evidence of absence is not the evidence of absence”. Two mechanisms of forgetting are discussed in the paper: transformation of the memory trace and modulation of trace accessibility. The former mechanism of forgetting consists of memory trace destruction (memory trace decay, retroactive and proactive interference, and «catastrophic» interference) or its transformation that leads to forming a new memory representation. The most promising way to legitimize the trace destruction mechanism is narrowing the further research to episodic memory subsystem. The latter mechanism of forgetting consists of both passive failure in access to appropriate memory content (the tip of the tongue phenomenon, the category size effect, the fan effect) and the process of active retrieval inhibition. This phenomenon represents temporary inhibition of competing semantically similar responses in semantic memory, and motivational inhibition of self-deprecating memories in autobiographical memory. Thus, a variety of experimental paradigms in intentional forgetting research are considered. Contrary to the common claim that forgetting is а universal and homogeneous phenomenon, we propose that forgetting strategies might vary in different memory subsystems, and also depend on activity characteristics during encoding, storage and retrieval.

Published
2016
Full Text
View/download PDF

4. Forgetting: availability, accessibility, and intentional control problem

Author

Veronika V. Nourkova and Alyona A. Gofman

Subjects
forgetting, availability problem, accessibility problem, memory trace decay, interference, retrieval inhibition, intentional forgetting, Psychology, BF1-990
Abstract

The paper focuses on the phenomenon of forgetting as a primal and generally productive memory process. The cases that require a temporary and permanent forgetting of the material stored in the long-term memory are contrasted. The main methodological obstacle in forgetting research is identified as arising from the logical prohibition to argument from the negative, i.e. “the evidence of absence is not the evidence of absence”. Two mechanisms of forgetting are discussed in the paper: transformation of the memory trace and modulation of trace accessibility. The former mechanism of forgetting consists of memory trace destruction (memory trace decay, retroactive and proactive interference, and «catastrophic» interference) or its transformation that leads to forming a new memory representation. We speculate that the most promising way to legitimize the trace destruction mechanism is narrowing the further research to episodic memory subsystem. The latter mechanism of forgetting consists of both passive failure in access to appropriate memory content (the tip of the tongue phenomenon, the category size effect, the fan effect) and the process of active retrieval inhibition. This phenomenon represents temporary inhibition of competing semantically similar responses in semantic memory, and motivational inhibition of self-deprecating memories in autobiographical memory. Then we put into consideration a variety of experimental paradigms in intentional forgetting research. Contrary to the common claim that forgetting is а universal and homogeneous phenomenon, we propose that forgetting strategies might vary in different memory subsystems, and also depend on activity characteristics during encoding, storage and retrieval.

Published
2016
Full Text
View/download PDF

6. Specialized Documents

Author

Munson, Ethan V., da Pimentel, Maria Graça, Karat, John, editor, Vanderdonckt, Jean, editor, Abowd, Gregory, editor, Calvary, Gaëlle, editor, Carroll, John, editor, Cockton, Gilbert, editor, Czerwinski, Mary, editor, Feiner, Steve, editor, Furtado, Elizabeth, editor, Höök, Kristina, editor, Jacob, Robert, editor, Jeffries, Robin, editor, Johnson, Peter, editor, Nakakoji, Kumiyo, editor, Palanque, Philippe, editor, Pastor, Oscar, editor, Paternò, Fabio, editor, Pribeanu, Costin, editor, Salzman, Marilyn, editor, Schmandt, Chris, editor, Stolze, Markus, editor, Szwillus, Gerd, editor, Tscheligi, Manfred, editor, van der Veer, Gerrit, editor, Zhai, Schumin, editor, Harper, Simon, editor, and Yesilada, Yeliz, editor

Published
2008
Full Text
View/download PDF

7. End User Evaluations

Author

Jay, Caroline, Lunn, Darren, Michailidou, Eleni, Karat, John, editor, Vanderdonckt, Jean, editor, Abowd, Gregory, editor, Calvary, Gaëlle, editor, Carroll, John, editor, Cockton, Gilbert, editor, Czerwinski, Mary, editor, Feiner, Steve, editor, Furtado, Elizabeth, editor, Höök, Kristina, editor, Jacob, Robert, editor, Jeffries, Robin, editor, Johnson, Peter, editor, Nakakoji, Kumiyo, editor, Palanque, Philippe, editor, Pastor, Oscar, editor, Paternò, Fabio, editor, Pribeanu, Costin, editor, Salzman, Marilyn, editor, Schmandt, Chris, editor, Stolze, Markus, editor, Szwillus, Gerd, editor, Tscheligi, Manfred, editor, van der Veer, Gerrit, editor, Zhai, Schumin, editor, Harper, Simon, editor, and Yesilada, Yeliz, editor

Published
2008
Full Text
View/download PDF

8. Beyond Conformance: The Role of Accessibility Evaluation Methods

Author

Brajnik, Giorgio, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Hartmann, Sven, editor, Zhou, Xiaofang, editor, and Kirchberg, Markus, editor

Published
2008
Full Text
View/download PDF

9. Non-visual Access to GUIs: Leveraging Abstract User Interfaces

Author

Van Hees, Kris, Engelen, Jan, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Miesenberger, Klaus, editor, Klaus, Joachim, editor, Zagler, Wolfgang L., editor, and Karshmer, Arthur I., editor

Published
2006
Full Text
View/download PDF

10. Chapter 15 W3C-WAI Content Accessibility Auditing

Author

Emiliani, Pier Luigi, Burzagli, Laura, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Stephanidis, Constantine, editor

Published
2005
Full Text
View/download PDF

11. The Use of Current Content Management Systems for Accessibility

Author

Burzagli, Laura, Billi, Marco, Gabbanini, Francesco, Graziani, Paolo, Palchetti, Enrico, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Miesenberger, Klaus, editor, Klaus, Joachim, editor, Zagler, Wolfgang L., editor, and Burger, Dominique, editor

Published
2004
Full Text
View/download PDF

13. Designing and Developing Accessible Java Swing Applications

Author

Oikonomou, Theofanis, Votis, Konstantinos, Tzovaras, Dimitrios, Korn, Peter, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Miesenberger, Klaus, editor, Klaus, Joachim, editor, Zagler, Wolfgang, editor, and Karshmer, Arthur, editor

Published
2010
Full Text
View/download PDF

17. Bottom-up rewriting for words and terms.

Author

Durand, I. and Sénizergues, G.

Subjects
*REVISION (Writing process), *SET theory, *LINEAR systems, *MATHEMATICAL regularization, *MATHEMATICAL analysis, *POLYNOMIAL time algorithms
Abstract

For the whole class of linear term rewriting systems, we define bottom-up rewriting which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting effectively inverse-preserves recognizability. The Bottom-Up class ( BU ) is, by definition, the set of linear systems for which every derivation can be replaced by a bottom-up derivation. Since membership to BU turns out to be undecidable, we are led to define more restricted classes: the classes SBU ( k ) , k ∈ N , of Strongly Bottom-Up ( k ) systems for which we show that membership is decidable. We define the class of Strongly Bottom-Up systems by SBU = ⋃ k ∈ N SBU ( k ) . We give a polynomial-time sufficient condition for a system to be in SBU . The class SBU contains (strictly) several classes of systems which were already known to inverse preserve recognizability: the inverse left-basic semi-Thue systems (viewed as unary term rewriting systems), the linear growing term rewriting systems, the inverse Linear-Finite-Path-Ordering systems. [ABSTRACT FROM AUTHOR]

Published
2015
Full Text
View/download PDF

18. IWWUA 2008 Workshop PC Chairs’ Message

Author

Abrahão, Silvia, Cachero, Cristina, Matera, Maristella, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Hartmann, Sven, editor, Zhou, Xiaofang, editor, and Kirchberg, Markus, editor

Published
2008
Full Text
View/download PDF

19. Workshop PC Chairs’ Message

Author

Abrahão, Silvia, Cachero, Cristina, Matera, Maristella, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Weske, Mathias, editor, Hacid, Mohand-Saïd, editor, and Godart, Claude, editor

Published
2007
Full Text
View/download PDF

20. On complexity of grammars related to the safety problem

Author

Jurdziński, Tomasz

Subjects
*COMPUTER science, *COMPUTER logic, *SYSTEMS development, *INFORMATION science, *INFORMATION technology
Abstract

Abstract: Leftist grammars were introduced by Motwani et al., who established the relationship between the complexity of the accessibility problem (or safety problem) for certain general protection systems and the membership problem for these grammars. The membership problem for leftist grammars is decidable. This implies the decidability of the accessibility problem. It is shown that the membership problem for leftist grammars is PSPACE-hard. Therefore, the accessibility problem in the appropriate protection systems is PSPACE-hard as well. Furthermore, the PSPACE-hardness result is adapted to a very restricted class of leftist grammars, if the grammar is a part of the input. [Copyright &y& Elsevier]

Published
2007
Full Text
View/download PDF

21. Forgetting: availability, accessibility, and intentional control problem

Author

V V V V Nourkova and A A Gofman

Subjects
forgetting, Forgetting, lcsh:Psychology, memory trace decay, intentional forgetting, lcsh:BF1-990, interference, accessibility problem, Psychology, Control (linguistics), retrieval inhibition, Cognitive psychology, availability problem
Abstract

The paper focuses on the phenomenon of forgetting as a primal and generally productive memory process. The cases that require a temporary and permanent forgetting of the material stored in the long-term memory are contrasted. The main methodological obstacle in forgetting research is identified as arising from the logical prohibition to argument from the negative, i.e. “the evidence of absence is not the evidence of absence”. Two mechanisms of forgetting are discussed in the paper: transformation of the memory trace and modulation of trace accessibility. The former mechanism of forgetting consists of memory trace destruction (memory trace decay, retroactive and proactive interference, and «catastrophic» interference) or its transformation that leads to forming a new memory representation. We speculate that the most promising way to legitimize the trace destruction mechanism is narrowing the further research to episodic memory subsystem. The latter mechanism of forgetting consists of both passive failure in access to appropriate memory content (the tip of the tongue phenomenon, the category size effect, the fan effect) and the process of active retrieval inhibition. This phenomenon represents temporary inhibition of competing semantically similar responses in semantic memory, and motivational inhibition of self-deprecating memories in autobiographical memory. Then we put into consideration a variety of experimental paradigms in intentional forgetting research. Contrary to the common claim that forgetting is а universal and homogeneous phenomenon, we propose that forgetting strategies might vary in different memory subsystems, and also depend on activity characteristics during encoding, storage and retrieval.

Published
2016

22. Forgetting: the availability, accessibility, and intentional control problem. Part 2

Author

V.V. Nourkova and A.A. Gofman

Subjects
forgetting, Forgetting, lcsh:BF1-990, Control (management), interference, accessibility problem, Computer security, computer.software_genre, retrieval inhibition, availability problem, lcsh:Psychology, memory trace decay, intentional forgetting, Psychology, computer, Cognitive psychology
Abstract

The paper focuses on the phenomenon of forgetting as a primal and generally productive memory process. The cases that require temporary and permanent forgetting of the data stored in the long-term memory are contrasted. The main methodological obstacle in forgetting research is identified as arising from the logical prohibition to argument from the negative, i.e. “the evidence of absence is not the evidence of absence”. Two mechanisms of forgetting are discussed in the paper: transformation of the memory trace and modulation of trace accessibility. The former mechanism of forgetting consists of memory trace destruction (memory trace decay, retroactive and proactive interference, and «catastrophic» interference) or its transformation that leads to forming a new memory representation. The most promising way to legitimize the trace destruction mechanism is narrowing the further research to episodic memory subsystem. The latter mechanism of forgetting consists of both passive failure in access to appropriate memory content (the tip of the tongue phenomenon, the category size effect, the fan effect) and the process of active retrieval inhibition. This phenomenon represents temporary inhibition of competing semantically similar responses in semantic memory, and motivational inhibition of self-deprecating memories in autobiographical memory. Thus, a variety of experimental paradigms in intentional forgetting research are considered. Contrary to the common claim that forgetting is а universal and homogeneous phenomenon, we propose that forgetting strategies might vary in different memory subsystems, and also depend on activity characteristics during encoding, storage and retrieval.

Published
2016

23. On complexity of grammars related to the safety problem

Author

Tomasz Jurdziski

Subjects
Discrete mathematics, Theoretical computer science, General Computer Science, Context-sensitive grammar, Accessibility problem, Context-free grammar, Leftist grammars, Decidability, Theoretical Computer Science, Tree-adjoining grammar, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Rule-based machine translation, Formal language, Automata and formal languages, L-attributed grammar, Phrase structure grammar, Mathematics, Protection system, Computer Science(all)
Abstract

Leftist grammars were introduced by Motwani et al., who established the relationship between the complexity of the accessibility problem (or safety problem) for certain general protection systems and the membership problem for these grammars. The membership problem for leftist grammars is decidable. This implies the decidability of the accessibility problem. It is shown that the membership problem for leftist grammars is PSPACE-hard. Therefore, the accessibility problem in the appropriate protection systems is PSPACE-hard as well. Furthermore, the PSPACE-hardness result is adapted to a very restricted class of leftist grammars, if the grammar is a part of the input.

Published
2007
Full Text
View/download PDF

24. Bottom-up rewriting for words and terms

Author

Géraud Sénizergues, Irène Durand, Méthodes Formelles, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Durand, Irène, Sénizergues, Géraud, and Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)

Subjects
FOS: Computer and information sciences, Class (set theory), Unary operation, Formal Languages and Automata Theory (cs.FL), Computer Science - Formal Languages and Automata Theory, Accessibility problem, Semi-Thue systems, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Physics::Fluid Dynamics, 68Q42, 03D03, 03D40, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Term rewriting systems, Mathematics, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Discrete mathematics, Algebra and Number Theory, Linear system, Term (logic), Undecidable problem, Decidability, Computational Mathematics, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], Confluence, MSC 68Q42 03D03 03D40, 2000 MSC: 68Q42, 03D03, 03D40, Rewriting, Regularity preservation
Abstract

For the whole class of linear term rewriting systems, we define \emph{bottom-up rewriting} which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting effectively inverse-preserves recognizability and analyze the complexity of the underlying construction. The Bottom-Up class (BU) is, by definition, the set of linear systems for which every derivation can be replaced by a bottom-up derivation. Membership to BU turns out to be undecidable, we are thus lead to define more restricted classes: the classes SBU(k), k in N of Strongly Bottom-Up(k) systems for which we show that membership is decidable. We define the class of Strongly Bottom-Up systems by SBU = U_{k in \} SBU(k). We give a polynomial sufficient condition for a system to be in $\SBU$. The class SBU contains (strictly) several classes of systems which were already known to inverse preserve recognizability: the inverse left-basic semi-Thue systems (viewed as unary term rewriting systems), the linear growing term rewriting systems, the inverse Linear-Finite-Path-Ordering systems., 86 pages; long version to be cut into pieces for publication

Published
2014

Catalog

Books, media, physical & digital resources
See catalog results