Filters








1,123 Hits in 5.7 sec

Avoiding Problem Selection Thrashing with Conjunctive Knowledge Tracing

Kenneth R. Koedinger, Philip I. Pavlik Jr., John C. Stamper, Tristan Nixon, Steven Ritter
2011 Educational Data Mining  
We describe a conjunctive knowledge tracing approach, based on techniques from Bayesian networks and psychometrics, and show how it may alleviate thrashing.  ...  We observed problem selection thrashing in analysis of log data from a tutor designed to adaptively fade (or reintroduce) instructional scaffolding based on student performance.  ...  We turn to a demonstration of this thrashing problem in real student use of a tutor. We then describe how use of Conjunctive Knowledge Tracing can alleviate this problem.  ... 
dblp:conf/edm/KoedingerPSNR11 fatcat:6qz2duhaprfpxg4d4tckkwvx2i

The comfort automatic tuning project

Gerhard Weikum, Christof Hasse, Axel Mönkeberg, Peter Zabback
1994 Information Systems  
We discuss the rationale of these two self-tuning methods in great detail, and we present comprehensive performance evaluation experiments for both synthetic and trace-driven workloads.  ...  As examples of these general principles, the paper discusses adaptive approaches to two speci c tuning problems and the developed solutions.  ...  Especially, we would like to thank Stefan Gyr for providing us with the traces and his help in understanding them, and Hans Walther and Albert Stadler for insightful discussions on performance problems  ... 
doi:10.1016/0306-4379(94)90004-3 fatcat:6xcmhwg4offnvldvu2d6nayh7i

Constraint Satisfaction and Fixes: Revisiting Sisyphus VT [chapter]

Trevor Runcie, Peter Gray, Derek Sleeman
2009 Research and Development in Intelligent Systems XXV  
However, a crucial issue with P&R is that "thrashing" can occur.  ...  , yet successfully dealt with the "antagonistic constraints" and the associated "thrashing" problem that had been a key issue in the original Marcus, Stout & McDermott VT paper.  ...  Acknowledgments We acknowledge useful discussions of Research issues with Tomas Nordlander & David Corsar.  ... 
doi:10.1007/978-1-84882-171-2_8 dblp:conf/sgai/RuncieGS08 fatcat:2gk4dfqdwzcnbeefxdaoxcax4e

Fine-Grained Assessment of Motivation over Long Periods of Learning with an Intelligent Tutoring System: Methodology, Advantages, and Preliminary Results [chapter]

Matthew L. Bernacki, Timothy J. Nokes-Malach, Vincent Aleven
2013 Springer International Handbooks of Education  
Cognitive tutors are unique in that they monitor student's performance and learning by model tracing and knowledge tracing.  ...  that motivational data collected in conjunction with a unit can better predict a set of learners' behaviors as they engaged with the tutor.  ... 
doi:10.1007/978-1-4419-5546-3_41 fatcat:nouijo6zr5djddnvh23wy74bci

Reuse of constraint knowledge bases and problem solvers explored in engineering design

Peter M.D. Gray, Trevor Runcie, Derek Sleeman
2014 Artificial intelligence for engineering design, analysis and manufacturing  
Further, our techniques did not use any heuristic "fix"' information, yet we successfully dealt with a "thrashing" problem that had been a key issue in the original vertical transit work.  ...  Reuse has long been a major goal of the knowledge engineering community. We present a case study of the reuse of constraint knowledge acquired for one problem solver, by two further problem solvers.  ...  ACKNOWLEDGMENTS This project has benefited from an association with the Advanced Knowledge Technologies (AKT) Interdisciplinary Research Collaboration that was sponsored by the United Kingdom's Engineering  ... 
doi:10.1017/s0890060414000134 fatcat:npbx3mk43vchjghlajk2owbhea

Dynamic scratchpad memory management for code in portable systems with an MMU

Bernhard Egger, Jaejin Lee, Heonshik Shin
2008 ACM Transactions on Embedded Computing Systems  
We propose to replace the on-chip instruction cache with a scratchpad memory (SPM) and a small minicache.  ...  Serializing the address translation with the actual memory access enables the memory system to access either only the SPM or the minicache.  ...  To avoid aliasing problems, only read-only data pools are separated from their functions. Figure 8 illustrates the principle. Workflow.  ... 
doi:10.1145/1331331.1331335 fatcat:jeozr3rgcfb65ln6rptjs5rbf4

Efficient Proof Engines for Bounded Model Checking of Hybrid Systems

Martin Fränzle, Christian Herde
2005 Electronical Notes in Theoretical Computer Science  
In HySat we adopt the solution proposed by Shtrichman [26] to avoid this problem: The heuristics of the SAT solver selects the decision variables in the natural order induced by the variable dependency  ...  of (the negation of) a temporal formula in order to obtain a propositional SAT problem which is satisfiable iff an error trace of length k exists.  ... 
doi:10.1016/j.entcs.2004.08.061 fatcat:ug3si5shpvduha76l44wem2c6e

Inspiration and Insinuation Influences on Human Thinking and Behavior: A Psychoanalytical, Psychodynamic, and Cognitive Phenomenon

Jamal Ahmad Badi, Lukman Ayinde Olorogun
2015 Asian Social Science  
It only focused on those that have psychological and psychopathological problems in exclusion of reasonable human beings, thus, contained numerous errors that even contradicted their scientific findings  ...  Thrash and Andrew J.  ...  Exemption to this general expression is those with pathological problems such as mental diseases or other neurological problems.  ... 
doi:10.5539/ass.v11n27p71 fatcat:53l534kdjzcxln4ugqpuplyh2e

Using the Spring Physical Model to Extend a Cooperative Caching Protocol for Many-Core Processors

Safae Dahmani, Loic Cudennec, Stephane Louise, Guy Gogniat
2014 2014 IEEE 8th International Symposium on Embedded Multicore/Manycore SoCs  
[26] is a new technique that can predict the reuse behavior of missed cache blocks in order to avoid both pollution and thrashing.  ...  This could be used in conjunction with the massspring model to achieve a better sliding scheme. III.  ... 
doi:10.1109/mcsoc.2014.49 dblp:conf/mcsoc/DahmaniCLG14 fatcat:ful26daj45betbzskknvczje5y

HySAT: An efficient proof engine for bounded model checking of hybrid systems

Martin Fränzle, Christian Herde
2006 Formal methods in system design  
hospitality and for many fruitful discussions during research visits to Freiburg, as well as to Fritz Eisenbrand and Markus Behle for their help in finding an efficient solution to the IIS extraction problem  ...  In HySAT we adopt the solution proposed by Strichman [34] to avoid this problem: The heuristics of the SAT solver selects the decision variables in the natural order induced by the variable dependency  ...  We are experimenting with randomized approaches to on-the-fly strategy switch to overcome the problem of selecting an appropriate strategy a priori.  ... 
doi:10.1007/s10703-006-0031-0 fatcat:6w2kkkwi4neyjcbpqq376bzasa

STREX

Islam Atta, Pinar Tözün, Xin Tong, Anastasia Ailamaki, Andreas Moshovos
2013 SIGARCH Computer Architecture News  
transaction processing (OLTP) workload performance suffers from instruction stalls; the instruction footprint of a typical transaction exceeds by far the capacity of an L1 cache, leading to ongoing cache thrashing  ...  In this work, thread contexts are saved in the second level cache to avoid thrashing the L1-D.  ...  PIF could reduce execution time for the lead transaction, thus improving performance when used in conjunction with STREX.  ... 
doi:10.1145/2508148.2485946 fatcat:rtu6iyqws5fdvkh7ufmxvygfce

STREX

Islam Atta, Pinar Tözün, Xin Tong, Anastasia Ailamaki, Andreas Moshovos
2013 Proceedings of the 40th Annual International Symposium on Computer Architecture - ISCA '13  
transaction processing (OLTP) workload performance suffers from instruction stalls; the instruction footprint of a typical transaction exceeds by far the capacity of an L1 cache, leading to ongoing cache thrashing  ...  In this work, thread contexts are saved in the second level cache to avoid thrashing the L1-D.  ...  PIF could reduce execution time for the lead transaction, thus improving performance when used in conjunction with STREX.  ... 
doi:10.1145/2485922.2485946 dblp:conf/isca/AttaTTAM13 fatcat:l5dkvyq54jhhdf5h3ddl44xshu

Replacement strategies for XQuery caching systems

Li Chen, Song Wang, Elke A. Rundensteiner
2004 Data & Knowledge Engineering  
This problem was first studied by Chandra and Merlin [7] for conjunctive queries, whose expressive power is equivalent to that of the Select-Project-Join (SPJ) queries in relational algebra.  ...  In both query traces, we control the query selectivity to range from 15% to 70%.  ... 
doi:10.1016/j.datak.2003.10.002 fatcat:dxkjki2xdrgnrfej62ofhzgdgm

The development and operation of edinburgh parallel computing centre's summer scholarship programme

G. V. Wilson, N. B. MacDonald, C. Thornborrow, C. M. Brough
1994 Supercomputing, Proceedings  
Recognising and Avoiding Thrashing in Some individuals may act selfishly whereas others may be altruistic.  ...  Eliminating this bottleneck is a major unsolved problem with the Programme.  ... 
doi:10.1145/602770.602798 fatcat:k6z3pmbxfnfe7frizfruiearoq

The development and operation of edinburgh parallel computing centre's summer scholarship programme

G. V. Wilson, N. B. MacDonald, C. Thornborrow, C. M. Brough
1994 Supercomputing, Proceedings  
Recognising and Avoiding Thrashing in Some individuals may act selfishly whereas others may be altruistic.  ...  Eliminating this bottleneck is a major unsolved problem with the Programme.  ... 
doi:10.1145/602795.602798 fatcat:ebjjwjfbyfas5aa5rxwgd3mhye
« Previous Showing results 1 — 15 out of 1,123 results