Do the Kallikaks look "menacing" or "retarded?"

To extend R. E. Fancher's (see record 1987-31600-001) review of claims that photographs of the Kallikak family in H. H. Goddard's (1912) study had been retouched to make them look more menacing and retarded, 29 Ss (aged 18–69 yrs) were surveyed for their impressions of the photographs. Overall, Ss were strongly inclined to view the photographed individuals as "kind" and "very bright." (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

More on Goddard and the Kallikak family photographs.

Discusses retouching of the Kallikak family photographs in H. H. Goddard's (1912) study of mental retardation and heredity, with reference to analyses by R. E. Fancher (see record 1987-31600-001) and S. J. Gould (1981), and concurs with Fancher that the retouching was probably not done for deceitful purposes. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Incremental join view maintenance on distributed log-structured storage

Modern database systems desperate for the ability to support highly scalable transactions and efficient queries simultaneously for real-time applications. One solution is to utilize query optimization techniques on the on-line transaction processing (OLTP) systems. The materialized view is considered as a panacea to decrease query latency. However, it also involves the significant cost of maintenance which trades away transaction performance. In this paper, we examine the design space and conclude several design features for the implementation of a view on a distributed log-structured merge-tree (LSMtree), which is a well-known structure for improving data write performance. As a result, we develop two incremental view maintenance (IVM) approaches on LSM-tree. One avoids join computation in view maintenance transactions. Another with two optimizations is proposed to decouple the view maintenance with the transaction process. Under the asynchronous update, we also provide consistency queries for views. Experiments on TPC-H benchmark show our methods achieve better performance than straightforward methods on different workloads.     

张謇职业教育环境观之比较

在兴办实业教育的过程中,张謇投资基础设施,建设实习实训环境;融合中西文化,塑造学习文化环境;规划城市建设,改善校园外部环境.与杜威、黄炎培相比,张謇的职业教育环境观与他们的观点存在着相似之处,但作为实践者和拓荒者,张謇从朴素的救国救民思想出发,率先进行了实业教育的物质环境、文化环境和外部环境的建设,反映了他对环境在人才培养中作用的重视,也体现了他环境育人的价值追求.     

Independence of Containing Patterns Property and Its Application in Tree Pattern Query Rewriting Using Views

We show that several classes of tree patterns observe the independence of containing patterns property, that is, if a pattern is contained in the union of several patterns, then it is contained in one of them. We apply this property to two related problems on tree pattern rewriting using views. First, given view V and query Q, is it possible for Q to have an equivalent rewriting using V which is the union of two or more tree patterns, but not an equivalent rewriting which is a single pattern? This problem is of both theoretical and practical importance because, if the answer is no, then, to find an equivalent rewriting of a tree pattern using a view, we should use more efficient methods, such as the polynomial time algorithm of Xu and Özsoyoglu (2005), rather than try to find the union of all contained rewritings (which takes exponential time in the worst case) and test its equivalence to Q. Second, given a set S of views, we want to know under what conditions a subset S′ of S is redundant in the sense that for any query Q, the contained rewritings of Q using the views in S′ are contained in those using the views in S???S′. Solving this problem can help us to, for example, choose the minimum number of views to be cached, or better design the virtual schema in a mediated data integration system, or avoid repeated calculation in query optimization. For the first problem, we identify several classes of tree patterns for which the equivalent rewriting can be expressed as a single tree pattern. For the second problem, we present necessary and sufficient conditions for S′ to be redundant with respect to some classes of tree patterns. For both problems we consider extension to cases where there are rewritings using the intersection of multiple views and/or where a schema graph is present.     

基于多视角的多类型错误全面检测方法

随着信息化社会的发展,数据的规模越发庞大,数据的种类也越发丰富.时至今日,数据已经成为国家和企业的重要战略资源,是科学化管理的重要保障.然而,随着社会生活产生的数据日益丰富,大量的脏数据也随之而来,数据质量问题油然而生.如何准确而全面地检测出数据集中所包含的错误数据,一直是数据科学中的痛点问题.尽管已有许多传统方法被广泛用于各行各业,如基于约束与统计的检测方法,但这些方法通常需要丰富的先验知识与昂贵的人力和时间成本.受限于此,这些方法往往难以准确而全面地检测数据.近年来,许多新型错误检测方法利用深度学习技术,通过时序推断、文本解析等方式取得了更好检测效果,但它们通常只适用于特定的领域或特定的错误类型,面对现实生活中的复杂情况,泛用性不足.基于上述情况,结合传统方法与深度学习技术的优点,提出了一个基于多视角的多类型错误全面检测模型CEDM.首先,从模式的角度,结合现有约束条件,在属性、单元和元组层面进行多维度的统计分析,构建出基础检测规则;然后,通过词嵌入捕获数据语义,从语义的角度分析属性相关性、单元关联性与元组相似性,进而基于语义关系,从多个维度上更新、扩展基础规则;最终,联合多个视角...     

Reconstruction of intersecting curved solids from 2D orthographic views

This paper presents a new approach to reconstruct curved solids composed of elementary volumes intersecting with one another from three-view engineering drawings. Intersection curves arising from two intersecting curved surfaces are mostly higher order spatial curves, which cannot be described exactly by 2D orthographic projections and normally represented as smooth curves passing through several key points or even simplified as arcs or lines. Approximated sketches of higher order intersection curves in 2D views result in the invalidation of existing methods that need the exact projection information as input. Based on some heuristic hints, our method is able to recover the complete and correct half-profiles of the intersecting elementary volumes using the least traces left by them, which ensure the correctness of solution solids constructed finally. Several examples are provided to show the validation of the described method.     

Using enhanced text to facilitate recognition of drug names: evidence from two experimental studies

Two studies examined the effects of enhanced text on immediate recognition of drug names. Study 1 sampled 102 college students using a between-subjects design, while Study 2 sampled 11 practicing pharmacists and technicians using a within-subjects Latin square design. Both studies utilized a computer-based sequential recognition task where a prime word was shown with various text enhancements, followed by a mask and then a target word. Participants decided whether the target word was the same as the prime word. Stimuli were organized so that 120 trials were matches and 120 trials were mismatches, randomly sequenced for each participant. Results showed an effect of orthographic similarity, where high-similarity name mismatches were missed more often. This effect was independent of the type of text enhancement used and response bias. Case-based enhancements also increased errors of commission (false alarms) significantly. Discussion includes the practical relevance of the data and future directions for research.     

Data mining-based materialized view and index selection in data warehouses

Materialized views and indexes are physical structures for accelerating data access that are casually used in data warehouses. However, these data structures generate some maintenance overhead. They also share the same storage space. Most existing studies about materialized view and index selection consider these structures separately. In this paper, we adopt the opposite stance and couple materialized view and index selection to take view–index interactions into account and achieve efficient storage space sharing. Candidate materialized views and indexes are selected through a data mining process. We also exploit cost models that evaluate the respective benefit of indexing and view materialization, and help select a relevant configuration of indexes and materialized views among the candidates. Experimental results show that our strategy performs better than an independent selection of materialized views and indexes.