1989年Finding Embedded Figures测验的测量特性研究

论文
需积分: 5 0 下载量 40 浏览量 更新于2024-08-07 收藏 709KB PDF 举报
本文是1989年《心理学在学校》(Psychology in the Schools)第26卷的一篇学术论文，标题为《发现嵌入图形测试的测量特性》(Measurement Characteristics of the Finding Embedded Figures Test)，由Janet G. Melancon（洛约拉大学南方分校）和Bruce Thompson（新奥尔良大学和路易斯安那州立大学医学中心）合作完成。该研究主要关注的是场独立性这一认知能力测量工具——发现嵌入图形测试（Finding Embedded Figures Test, FEFT）的测量特性的探讨。 论文的研究对象是302名受试者，他们被要求完成FEFT的不同形式。作者通过多项指标来评估测试的性能，包括经典的项目难度（classical item difficulty）、项目与总分的相关系数（item-by-total-score correlation coefficients）、FEFT与其他测量工具——群组嵌入图形测试（Group Embedded Figures Test, GEFT）的并发效度关联（FEFT-by-GEFT concurrent validity correlation coefficients），以及重复性和信度系数（test-retest and alpha reliability coefficients）。 研究结果显示，FEFT的两个版本提供了相当可靠且有效的数据。此研究的背景是在二战后初期，Herman A. Witkin及其同事进行了一系列关于视觉刺激中风格变异的开创性研究，这些早期工作着重于探索个体在感知过程中对垂直方向识别能力的差异。作者的这项工作是对这些早期研究的延续，通过FEFT测量方法来更深入地理解个体在处理复杂视觉信息时的场独立性特征。 本文的重要贡献在于，它为教育心理学和认知评估提供了实证依据，帮助教育工作者和研究人员了解如何有效地评估和衡量学生的场独立性，这对于教学设计、心理评估以及针对个体差异的教学策略具有实际应用价值。通过分析FEFT的测量特性和信效度，教育者可以更好地识别和培养学生的空间感知能力和解决问题的能力，从而促进学生的全面发展。

发现嵌入图形测试的测量特性

2021-06-29 上传
Measurement characteristics of the finding embedded figures test Psychology in the Schools Volume 26, January 1989 MEASUREMENT CHARACTERISTICS OF THE FINDING EMBEDDED FIGURES TEST JANET G . ...

Determination of the Instants of Glottal Closure from Speech Wave

2018-10-01 上传
Determination of the instants ofglottal closure (GC) from speech wave using wavelet transform is equivalent to finding a particular local modulus maxima pattern across several scales in the time-scale...

实现用Latex写matrix operation programming test plan. describe each part respectively, and write the cases in tables. 1. Introduction 2.multiply 3. arrayFromTxtFile 4. arrayToTxtFile 5. minor 6. determinant 7. inverse 8. inverseLU 9. inverseCD

2023-04-19 上传
抱歉，我可以回答这个问题。以下是用Latex编写矩阵操作编程测试计划的各个部分和测试... Test Case 3: Test finding the inverse of a matrix with extremely large values using Cramer's rule. I hope this helps!

Once upon a time, Toma found himself in a binary cafe. It is a very popular and unusual place. The cafe offers visitors k different delicious desserts. The desserts are numbered from 0 to k−1 . The cost of the i -th dessert is 2i coins, because it is a binary cafe! Toma is willing to spend no more than n coins on tasting desserts. At the same time, he is not interested in buying any dessert more than once, because one is enough to evaluate the taste. In how many different ways can he buy several desserts (possibly zero) for tasting? Input The first line of the input contains a single integer t (1≤t≤1000 ) — the number of test cases. Then follows t lines, each of which describes one test case. Each test case is given on a single line and consists of two integers n and k (1≤n,k≤109 ) — the number of coins Toma is willing to spend and the number of desserts in the binary cafe. Output Output t integers, the i -th of which should be equal to the answer for the i -th test case — the number of ways to buy desserts for tasting.

2023-06-07 上传
This is a classic problem of finding the number of subsets of a given set with a certain property. In this case, we want to find the number of subsets of the set {0,1,2,...,k-1} such that the sum of ...

Little Gyro has just found an empty integer set A in his right pocket, and an empty integer set B in his left pocket. At the same time, Little Gyro has already thought about two integers n, m in his mind. As Little Gyro is bored, he decides to play with these two sets. Then, Little Gyro is ready to divide the integer series 1,2,3...m−1,m to these two empty sets. With the following rules: If the number is an integer multiple of n, Little Gyro will put it in set A. Otherwise, Little Gyro will put it in set B instead. Now given two integers n, m, after these operations, Little Gyro wants to know the result of sum(B)−sum(A) and ask you for help, please help him to calculate. Input Specification: There are multiple test cases. The first line of the input contains an integer T (1 ≤ T ≤ 10 5 ), indicating the number of test cases. For each test case: Each line contains two integers n, m (1 ≤ n, m ≤ 10 9 ), indicating the length of the sequence. Output Specification: For each test case output an integer indicating the result of sum(B)−sum(A). Sample Input: 3 3 5 2 10 3 16 Sample Output: 9 -5 46 Hint: For the first sample, after these operations, A = <3>, B = <1,2,4,5>, and the answer is 9. For the second sample, after these operations, A = <2,4,6,8,10>, B = <1,3,5,7,9>, and the answer is -5.

2023-06-01 上传
We can calculate this by first finding the number of integer multiples of n within the range of 1 to m (which is floor(m/n)), and then multiplying it by n. The sum of integers in set B is the sum ...

friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. He thinks that the most difficult part of the problem is determining the smallest number of knight moves between two given squares and that, once you have accomplished this, finding the tour would be easy. Of course you know that it is vice versa. So you offer him to write a program that solves the "difficult" part. Your job is to write a program that takes two squares a and b as input and then determines the number of knight moves on a shortest route from a to b. Input Specification The input file will contain one or more test cases. Each test case consists of one line containing two squares separated by one space. A square is a string consisting of a letter (a-h) representing the column and a digit (1-8) representing the row on the chessboard. Output Specification For each test case, print one line saying "To get from xx to yy takes n knight moves.".

2023-06-02 上传
Sure, I can write a program that solves the "difficult" part of the TKP. Here's an implementation in Python: ```python # Define a function to convert a square string to a tuple of coordinates def ...

以下是一篇即将投稿Minerals期刊（MDPI出版社）的论文初稿的部分内容，请按照该期刊对论文格式的要求，将以下内容进行压缩凝练（注意：可对内容进行删减，对错误进行修正，对语句顺序进行调整，符合美式英语标准，符合英语母语者语言习惯，句子简明易懂，术语使用准确，保留文章结构、不偏离论文主要内容）： Rocks and ore components directly enter the soil and water system sediments through physical weathering and chemical weathering, and the geochemical anomalies originally present in the rocks further spread with the entry into the soil or directly into the water system, forming soil anomalies and water system sediment anoma-lies.Geochemical anomaly detection is essentially the detection of signal anomalies in geochemical data, which refers to finding out the anomalous distribution of chemical elements themselves and the anomalous distribution of multiple elements in combination through feature extraction and analysis processing of geochemical data in the study area, and reflecting the mineral distribution through the distribution of geochemical ele-ments.Through the method of geochemical anomaly finding, the detected anomalies may contain information indicating specific minerals, which facilitates the rapid tracing of prospective areas and favorable areas for mineralization, identifies possible mineralizing elements and distribution characteristics in the work area, provides basic information for the strategic deployment of mineralization search, and provides good indications for later mineralization search.

2023-02-28 上传
These anomalies can reveal specific minerals and their distribution characteristics, aiding in the identification of prospective mineralization areas and elements. Geochemical anomaly detection ...

Implement the function for finding girth of undirected graphs: Given the adjacency lists of an undirected, return the girth if there is any cycle in the graph. Otherwise, return 'inf'. For example: Test Result adj_list = [[1,2],[0,4,5],[0,3],[2,5,6],[1,6],[1,3,6],[3,4,5]] print(find_girth(adj_list))

2023-06-02 上传
To test the function with the example you provided, you can do: ```python adj_list = [[1,2],[0,4,5],[0,3],[2,5,6],[1,6],[1,3,6],[3,4,5]] print(find_girth(adj_list)) # Output: 4 ``` In this case, the...

We have learned how to find the strong components for a directed graph in the class. Now, you are asked to implement the algorithm we discussed in the class. Given the adjacency lists of a di-graph, your function should print the affiliation of each node to the root of traversal tree it belongs to. For example, given the adjacency lists of the example below as [[3],[0],[0,3,4],[1],[2]]. We get two traversal trees after the second run of DFS: T1 = {(0,3), (3,1)}, T2 = {(2,4)}. Then, the nodes 0,1,3 all belong the tree rooted at node 0, and nodes 2, 4 belong to the tree rooted at node 2. You need to print an array [0, 0, 2, 0, 2]. You can use any python built-in package to complete this exercise. For example: Test Result find_scc([[3],[0],[0,3,4],[1],[2]]) [0, 0, 2, 0, 2]

2023-06-03 上传
To solve the problem, we can simply call the `find_scc` function on the input adjacency list, and then find the root of the traversal tree for each node by finding the SCC root of its SCC. Here's an ...

Please use the method in DSelection to find the median of medians recursively on the following array A in groups of 5.

2023-04-02 上传
The median of medians is found by recursively dividing the array into groups of 5 and finding the median of each group. This process is repeated until a single median element is found. This median ...
weixin_38592848
  • 粉丝: 3
  • 资源: 910
上传资源 快速赚钱

最新资源