Search results for "REPRESENTATION"

showing 10 items of 1710 documents

The Role of Sourcing in Discourse Comprehension

2017

This chapter provides a theoretical background by discussing different frameworks relevant for understanding the role of sourcing in discourse comprehension. It reviews empirical work on students' sourcing skills and the role of individual and contextual factors in sourcing and discusses the nature and particular challenges of sourcing in digital contexts and review research on sourcing in such contexts. The chapter analyses intervention work aiming to improve students' consideration and evaluation of source features when dealing with multiple documents and also reviews measures used to assess sourcing skills in the research literature. Developmental psychology research on social cognition …

ComprehensionAntecedent (grammar)InsourcingKnowledge managementWork (electrical)business.industrySocial cognitionDiscourse analysisMental representationRelevance (information retrieval)businessPsychology
researchProduct

Procedural semantics, metarepresentation, and some particles in Behdini Kurdish

2012

Contemporary studies in the linguistic semantics of particles have been greatly influenced by two ideas: that these items trigger pragmatic processing procedures rather than provide purely conceptual content, and that the procedures that some of them trigger relate to the recovery of metarepresentations. Recent developments in the theory of procedural semantics have introduced some refinements, notably the claim that these procedures may not all relate primarily to comprehension per se but may also relate to the epistemic assessment of communicated claims. This paper discusses three particles in Behdini Kurdish in the light of these theoretical developments: the speech-act particle ka often…

ComprehensionCognitive scienceCounterfactual thinkingLinguistics and LanguageCounterfactual conditionalRelevance theoryMetarepresentationPragmaticsPsychologySemanticsLanguage and LinguisticsLinguisticsUtteranceLingua
researchProduct

Towards more Valid Assessment of Learning from Animations

2020

Animated explanations have become an ubiquitous feature of modern educational practice. They provide a distinctive, non-verbal means of presenting information that is particularly appropriate for dynamic subject matter. However, the prevailing approaches used to assess learning from educational animations are almost exclusively verbal. There is thus a clear disconnect between the form of representation students encounter during their learning activity and the very different form of representation used to assess the resulting learning outcomes. This fundamental inconsistency undermines the validity of current assessment approaches and signals the need for a fresh look at how learning from an…

ComprehensionRange (mathematics)Human–computer interactionComputer scienceFeature (machine learning)AnimationRepresentation (mathematics)Subject matter
researchProduct

The classical concept of mass: theoretical difficulties and students’ definitions

1993

An analysis of the concepts of mass in classical physics on the basis of their historical, philosophical and semantic connotations is given. A classification of the most current definitions of mass is proposed from its physical representation and topic area. The definitions of mass, and some related issues, given by several groups of secondary school students are analysed. The results seem to confirm a generalized qualitative‐teleological view of scientific concepts in contrast to the more orthodox formal‐quantitative formulation of physics.

ComprehensionSecondary educationInterpretation (philosophy)Physical scienceMathematics educationContrast (statistics)Representation (arts)PsychologyScience educationClassical physicsEducationInternational Journal of Science Education
researchProduct

Maximal subgroups of small index of finite almost simple groups

2022

We prove in this paper that a finite almost simple group $R$ with socle the non-abelian simple group $S$ possesses a conjugacy class of core-free maximal subgroups whose index coincides with the smallest index $\operatorname{l}(S)$ of a maximal group of $S$ or a conjugacy class of core-free maximal subgroups with a fixed index $v_S \leq {\operatorname{l}(S)^2}$, depending only on $S$. We show that the number of subgroups of the outer automorphism group of $S$ is bounded by $\log^3 {\operatorname{l}(S)}$ and $\operatorname{l}(S)^2 < |S|$.

Computational MathematicsMathematics::Group Theory20E28 20E32 20B15Algebra and Number TheoryMathematics::ProbabilityApplied MathematicsFOS: MathematicsGeometry and TopologyGroup Theory (math.GR)Mathematics::Representation TheoryMatemàticaMathematics - Group TheoryAnalysis
researchProduct

On the path representation of networks

1982

A compact data structure for networks is obtained by storing arcs of paths sequentially. This structure allows forward and backward access from a node to its neighbors.

Computational MathematicsTheoretical computer scienceComputer Networks and CommunicationsComputer scienceApplied MathematicsNode (networking)Path (graph theory)Structure (category theory)TopologyData structureRepresentation (mathematics)SoftwareBIT
researchProduct

Low-Rate Reduced Complexity Image Compression using Directionlets

2006

The standard separable two-dimensional (2-D) wavelet transform (WT) has recently achieved a great success in image processing because it provides a sparse representation of smooth images. However, it fails to capture efficiently one-dimensional (1-D) discontinuities, like edges and contours, that are anisotropic and characterized by geometrical regularity along different directions. In our previous work, we proposed a construction of critically sampled perfect reconstruction anisotropic transform with directional vanishing moments (DVM) imposed in the corresponding basis functions, called directionlets. Here, we show that the computational complexity of our transform is comparable to the co…

Computational complexity theorybusiness.industryComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONImage codingWavelet transformPattern recognitionImage processingImage segmentationSparse approximationWavelet transformsWaveletData compressionImage reconstructionArtificial intelligencebusinessImage representationMathematicsImage compressionData compression2006 International Conference on Image Processing
researchProduct

Efficient analysis of cubic junction of rectangular waveguides using admittance-matrix representation

2000

In the paper an efficient and accurate method, based on the multimode-admittance-matrix representation and the theory of cavities, is proposed for the analysis of a six-port ‘cubic’ junction composed of the orthogonal intersection of three rectangular waveguides. Very simple closed-form analytical expressions are explicitly detailed for all matrix elements of this basic key building block. More general waveguide multiport junctions, composed of a central cubic junction with arbitrarily shaped waveguide access ports, are also studied using a segmentation procedure. To validate the theory, numerical results are first discussed for a standard rectangular waveguide six-port cross junction. Fina…

Computer Networks and Communicationsbusiness.industryMathematical analysisPhysics::OpticsWaveguide (optics)Admittance parametersMatrix (mathematics)OpticsIntersectionSimple (abstract algebra)SegmentationElectrical and Electronic EngineeringRepresentation (mathematics)businessBlock (data storage)MathematicsIEE Proceedings - Microwaves, Antennas and Propagation
researchProduct

Complex group algebras of finite groups: Brauer’s Problem 1

2005

Brauer’s Problem 1 asks the following: what are the possible complex group algebras of finite groups? It seems that with the present knowledge of representation theory it is not possible to settle this question. The goal of this paper is to announce a partial solution to this problem. We conjecture that if the complex group algebra of a finite group does not have more than a fixed number m m of isomorphic summands, then its dimension is bounded in terms of m m . We prove that this is true for every finite group if it is true for the symmetric groups.

Computer Science::Machine LearningModular representation theoryPure mathematicsFinite groupBrauer's theorem on induced charactersGroup (mathematics)General MathematicsMathematicsofComputing_GENERALComputer Science::Digital LibrariesRepresentation theoryCombinatoricsStatistics::Machine LearningGroup of Lie typeSymmetric groupComputer Science::Mathematical SoftwareComputer Science::Programming LanguagesBrauer groupMathematicsElectronic Research Announcements of the American Mathematical Society
researchProduct

Categories, Quantum Computing, and Swarm Robotics: A Case Study

2022

The swarms of robots are examples of artificial collective intelligence, with simple individual autonomous behavior and emerging swarm effect to accomplish even complex tasks. Modeling approaches for robotic swarm development is one of the main challenges in this field of research. Here, we present a robot-instantiated theoretical framework and a quantitative worked-out example. Aiming to build up a general model, we first sketch a diagrammatic classification of swarms relating ideal swarms to existing implementations, inspired by category theory. Then, we propose a matrix representation to relate local and global behaviors in a swarm, with diagonal sub-matrices describing individual featur…

Computer Science::RoboticsSwarm roboticsswarm robotics; quantum computing; 4-qubit system; matrix representation; colimitGeneral MathematicsColimitQA1-939Computer Science (miscellaneous)4-qubit systemQuantum computingMatrix representationEngineering (miscellaneous)MathematicsMathematics
researchProduct