نتایج جستجو برای: explaining
تعداد نتایج: 41548 فیلتر نتایج به سال:
Students often have a difficult time understanding what convolution is. Students can often evaluate the convolution integral (continuous time case), convolution sum (discrete-time case), or perform graphical convolution but may not have a good grasp of what is happening. In other words, students can solve the formula but often do not understand the result or why they get that result. Most engin...
We discuss here constraint programming (CP) by using a proof-theoretic perspective. To this end we identify three levels of abstraction. Each level sheds light on the essence of CP. In particular, the highest level allows us to bring CP closer to the computation as deduction paradigm. At the middle level we can explain various constraint propagation algorithms. Finally, at the lowest level we c...
In this paper, we argue that networks should be able to explain to their operators why they are in a certain state, even if – and particularly if – they have been compromised by an attacker. Such a capability would be useful in forensic investigations, where an operator observes an unexpected state and must decide whether it is benign or an indication that the system has been compromised. Using...
The question is how to explain expressions of emotion. It is argued that not all expressions of emotion are open to the same sort of explanation. Those expressions which are actions can be explained, like other sorts of action, by reference to a belief and a desire; however, no genuine expression of emotion is done as a means to some further end. Certain expressions of emotion which are actions...
Interoperability among systems using different term vocabularies requires some mapping between terms in the vocabularies. Matching applications generate such mappings. When the matching process utilizes term meaning (instead of simply relying on syntax), we refer to the process as semantic matching. If users are to use the results of matching applications, they need information about the mappin...
been a commitment to the notion that the subtypes or dimensions of developmental speech sound disorders are organized on the basis of their etiology, and that the surface features of these disorders will reflect this multiple causal organization. Certain key points of this perspective are particularly prominent. First, etiology is key to the study of developmental communication disorders. This ...
Lazy clause generation is a powerful approach to reducing search in constraint programming. For use in a lazy clause generation solver, global constraints must be extended to explain themselves. In this paper we present two new generic flow-based propagators (for hard and soft flow-based constraints) with several novel features, and most importantly, the addition of explanation capability. We d...
Interactive recommender applications are an important technology for online retailers who want to increase their sales by providing potential buyers with suitable recommendations. Critique-based navigation, where a user applies a directional critique to a specific feature of a presented recommendation, is often used to guide users through such complex product spaces. Dynamic critiquing is a nov...
Motivated by NASA’s need for high-assurance software, NASA Ames' Amphion project has developed a generic program generation system based on deductive synthesis. Amphion has a number of advantages, such as the ability to develop a new synthesis system simply by writing a declarative domain theory. However, as a practical matter, the validation of the domain theory for such a system is problemati...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید