Search results for "call"

showing 10 items of 2320 documents

‘Back Door Sentencing’ in Italy: Common Reasons and Main Consequences for the Recall of Prisoners

2012

Italian law only provides the general conditions for the institution of recall. It follows that significant discretionary powers are enjoyed by the surveillance judges (and in particular by the Surveillance Tribunal) who evaluate on a case-by-case basis whether the commission of another offence or the infringement of parole conditions demonstrate the offenders' negative attitude to reintegrate into society. However, especially with reference to the commission of serious crimes, the judges' discretionary assessment can result in a restrictive application of the law on recall with the consequence that parolees are returned to prison even when they commit minor violations. The Italian peniten…

RecallPrison overcrowdingmedia_common.quotation_subjectrecallPrisonSocial WelfareCommissionCommitBack door sentencingTribunalItalyLawSettore IUS/16 - Diritto Processuale PenaleprisonersInstitutionPsychologyLawmedia_commonEuropean Journal of Probation
researchProduct

O pytaniach podczas rozmowy maturalnej z języka polskiego

2019

“Now, let us move to our conversation — please name characteristics of a parable”. On questions students are asked during their high school oral leaving exam in PolishIn the article I present the results of a qualitative and quantitative analysis of 149 questions asked by teachers during 30 high school oral leaving exams in Polish. In this I use the classification formulated by Elizabeth Perrott, who, taking into account Benjamin Bloom’s “taxonomy of educational objectives”, has proposed a division of the questions by the type of thinking process launched during answering, distinguishing lower-level questions recall, understanding, application and higher-level questions analysis, synthesis …

RecallQuantitative analysis (finance)media_common.quotation_subjectTaxonomy (general)Mathematics educationConversationPsychologyThinking processesmedia_commonKształcenie Językowe
researchProduct

Some good texts are always better: text revision to foster inferences of readers with high and low prior background knowledge

2005

Abstract This paper presents two experiments testing whether an approach to revise a text that fosters the reader's active processing benefits both high and low-knowledge readers. A history text and two alternative revised versions, one fostering the reader's inferential activity and the other reducing it, were employed. Junior high school students with low and high background knowledge about information related to the text topic participated in experiment 1, whereas undergraduate students with low and high knowledge on both the text topic and related information participated in experiment 2. One-third of the students for each condition in both experiments read either the original passage o…

RecallReading (process)media_common.quotation_subjectDevelopmental and Educational PsychologyMathematics educationPsychologyEducationmedia_commonLearning and Instruction
researchProduct

What animated illustrations conditions can improve technical document comprehension in young students? Format, signaling and control of the presentat…

2005

We study the comprehension of a multimedia technical document about gear functioning by young pupils. The research is focused on the effect of three factors on the construction of a mental model: illustration format (animated versus static) signaling cues (presence versus absence) learner-control of information delivery (three rhythms of presentation: speed, slow and self-controlled). The experimental procedure, conducted with 123 children, follows three phases: pre-test, individual passation of the lesson, comprehension test, delayed post-test. The goal of the pre-test is the evaluation of prior knowledge about gears, but also the control of spatial and verbal working memory aptitude and r…

RecallWorking memorymedia_common.quotation_subjectAnimationEducationTest (assessment)ComprehensionReading comprehensionReading (process)Developmental and Educational PsychologyAptitudePsychologyCognitive psychologymedia_commonEuropean Journal of Psychology of Education
researchProduct

Recall of common and uncommon words from pure and mixed lists

1980

Recall of high- and low-frequency words in the conventional free recall paradigm was compared with recall of the same words when subjects were required to count backward before and after the presentation of each word. The addition of this distractor task was associated with a reduction in the high-frequency advantage otherwise found with pure lists containing only high- or low-frequency words. This finding is attributed to the disruption of organizational processes. In contrast, the low-frequency advantage found with conventional presentation of mixed lists, containing high- and low-frequency words, was not reduced by distraction. These findings indicate that the frequency effects obtained …

Recallbusiness.industryRecall testContrast (statistics)General Medicinecomputer.software_genreWord lists by frequencyOrganizational processesFree recallDistractionArtificial intelligencePsychologybusinesscomputerSocial psychologyNatural language processingWord (group theory)Journal of Verbal Learning and Verbal Behavior
researchProduct

The effects of tasks on integrating information from multiple documents.

2008

The authors examine 2 issues: (a) how students integrate information from multiple scientific documents to describe and explain a physical phenomenon that represents a subset of the information in the documents; and (b) the role of 2 sorts of tasks to achieve this type of integration, either writing an essay on a question requiring integration across texts or answering shorter intratext questions that require students to integrate information within a single text, while superficial and deep comprehension measurements are obtained. Undergraduate students answered 1 of the 2 types of questions, and their reading times were recorded. Half of the sample thought aloud. Results showed that the in…

Recallbusiness.industrymedia_common.quotation_subjectDeep learningCognitionEducationComprehensionReading (process)Developmental and Educational PsychologyArtificial intelligenceThink aloud protocolPsychologybusinessIntrapersonal communicationmedia_commonInformation integrationCognitive psychologyJournal of Educational Psychology
researchProduct

Subjective Experience of Episodic Memory and Metacognition: A Neurodevelopmental Approach

2013

Episodic retrieval is characterized by the subjective experience of remembering. This experience enables the co-ordination of memory retrieval processes and can be acted on metacognitively. In successful retrieval, the feeling of remembering may be accompanied by recall of important contextual information. On the other hand, when people fail (or struggle) to retrieve information, other feelings, thoughts and information may come to mind. In this review, we examine the subjective and metacognitive basis of episodic memory function from a neurodevelopmental perspective, looking at recollection paradigms (such as source memory, and the report of recollective experience) and metacognitive parad…

Reconstructive memoryRecallAutobiographical memoryrecollectionneurodevelopmental disordersCognitive NeuroscienceBrain DevelopmentmetamemoryReview Articleepisodic memorylcsh:RC321-571Behavioral NeuroscienceNeuropsychology and Physiological PsychologyRetrospective memoryProspective memoryExplicit memorySemantic memoryPsychologyEpisodic memorylcsh:Neurosciences. Biological psychiatry. NeuropsychiatryCognitive psychologyNeuroscienceFrontiers in Behavioral Neuroscience
researchProduct

Graph recursive least squares filter for topology inference in causal data processes

2017

In this paper, we introduce the concept of recursive least squares graph filters for online topology inference in data networks that are modelled as Causal Graph Processes (CGP). A Causal Graph Process (CGP) is an auto regressive process in the time series associated to different variables, and whose coefficients are the so-called graph filters, which are matrix polynomials with different orders of the graph adjacency matrix. Given the time series of data at different variables, the goal is to estimate these graph filters, hence the associated underlying adjacency matrix. Previously proposed algorithms have focused on a batch approach, assuming implicitly stationarity of the CGP. We propose…

Recursive least squares filterSignal processingMean squared errorComputer science020206 networking & telecommunications02 engineering and technologyCall graphNetwork topology0202 electrical engineering electronic engineering information engineeringGraph (abstract data type)020201 artificial intelligence & image processingAdjacency matrixTime seriesAlgorithm2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)
researchProduct

On Associative Rings with Locally Nilpotent Adjoint Semigroup

2003

Abstract The set of all elements of an associative ring R, not necessarily with a unit element, forms a semigroup R ad under the circle operation r ∘ s = r + s + rs for all r, s in R. This semigroup is locally nilpotent if every finitely generated subsemigroup of R ad is nilpotent (in sense of A. I. Mal'cev or B. H. Neumann and T. Taylor). The ring R is locally Lie-nilpotent if every finitely generated subring of R is Lie-nilpotent. It is proved that R ad is a locally nilpotent semigroup if and only if R is a locally Lie-nilpotent ring.

Reduced ringDiscrete mathematicsPure mathematicsAlgebra and Number TheoryMathematics::Rings and AlgebrasLocally nilpotentUnipotentSubringMathematics::Group TheoryNilpotentBicyclic semigroupNilpotent groupMathematics::Representation TheoryUnit (ring theory)MathematicsCommunications in Algebra
researchProduct

Radical Rings with Soluble Adjoint Groups

2002

Abstract An associative ring R , not necessarily with an identity, is called radical if it coincides with its Jacobson radical, which means that the set of all elements of R forms a group denoted by R ∘ under the circle operation r  ∘  s  =  r  +  s  +  rs on R . It is proved that every radical ring R whose adjoint group R ∘ is soluble must be Lie-soluble. Moreover, if the commutator factor group of R ∘ has finite torsion-free rank, then R is locally nilpotent.

Reduced ringDiscrete mathematicsRing (mathematics)Lie-soluble ringAlgebra and Number TheoryGroup (mathematics)Locally nilpotentadjoint groupJacobson radicalCombinatoricsIdentity (mathematics)radical ringsoluble groupUnit (ring theory)Group ringMathematicsJournal of Algebra
researchProduct