• 学术搜索
  • 科研智能体
    • Research Labs
    • AI 阅读
    • AI 文库
    • 深度研究
    • 学者亮点
  • 学术资源
    • AI2000
    • 期刊/会议
    • 学者库
    • 学术API
      MCP&Skill
    • 溯源树
    • 数据集
  • 知识沉淀
    • 学术空间
订阅小程序
旧版功能
aminer vip
开通会员低至0.73元/天
一次搞定AI科研
立即登录
  • English
  • 联系方式
    克

    克莱蒙特学院

    Claremont Colleges
    院校EST. 1925
    1.4万论文总数
    34.9万引用总数

    The Claremont Colleges (known colloquially as the 7Cs) are a consortium of seven high end private institutions of higher education located in Claremont, California, United States. They comprise five undergraduate colleges (the 5Cs)—Pomona College, Scripps College, Claremont McKenna College (CMC), Harvey Mudd College, and Pitzer College—and two graduate schools—Claremont Graduate University (CGU) and Keck Graduate Institute (KGI). All the members except KGI have adjoining campuses, together covering roughly 1 sq mi (2.6 km2).The consortium was founded in 1925 by Pomona College president James A. Blaisdell, who proposed a collegiate university design inspired by Oxford University. He sought to provide the specialization, flexibility, and personal attention commonly found in small colleges, but with the resources of a large university. The consortium has since grown to roughly 8,500 students and 3,270 faculty and staff, and offers more than 2,000 courses every semester. The colleges share a central library, campus safety services, health services, and other resources, managed by The Claremont Colleges Services (TCCS). Among the undergraduate schools, there is significant social interaction and academic cross-registration, but each college maintains a distinct identity.Admission to the Claremont Colleges is considered highly selective. For the Class of 2020 admissions cycle, four of the five most selective liberal art colleges in the U.S. by acceptance rate were among the 5Cs, and the remaining college, Scripps, had the second-lowest acceptance rate among women's colleges. The Fiske Guide to Colleges describes the consortium as "a collection of intellectual resources unmatched in America.S.S.

    论文量&引用量时间轴

    机构学者

    论文(10000)

    年份
    起
    –
    止
    排序
    1Modeling (Optional)
    Gary Smith

    Linear models are often useful approximations to nonlinear relationships as long as we restrict our attention to realistic and relatively modest variations in the variables. One alternative to a linear model is a polynomial function; for example, a quadratic equation. Another is a power function; for example, a Cobb–Douglas function. Power functions assume that the elasticity of the dependent variable with respect to an explanatory variable is constant. If variables are related to each other by a power function, then there is a log-linear relationship between them. Growth models use time as an explanatory variable. Continuously compounded growth models are especially useful because they simplify many computations. Another way to introduce time into a model is with a first-order autoregressive equation in which the value of a variable is affected by its value in the immediately preceding period. Autoregressive models may be cyclical or monotonic, stable or unstable.

    2027Essential Statistics, Regression, and Econometrics(2027)
    引用
    AI阅读
    加入学术空间
    2Hyperbolic Handlebody Complements in 3-Manifolds
    Colin Adams, Francisco Gomez-Paz, Jiachen Kang, Lukas Krause, Gregory Li, Chloe Marple, Ziwei Tan

    Let M_0 be a compact and orientable 3-manifold. After capping off spherical boundaries with balls and removing any torus boundaries, we prove that the resulting manifold M contains handlebodies of arbitrary genus such that the closure of their complement is hyperbolic. We then extend the octahedral decomposition to obtain bounds on volume for some of these handlebody complements.

    2026TOPOLOGY AND ITS APPLICATIONS(2026)引用:2
    引用
    AI阅读
    加入学术空间
    3Components of Evolutionary Psychology Are Falsifiable, but Does That Make It a Good Theory? Commentary on Costello Et Al. (2026).
    David S Moore

    At the center of narrow evolutionary psychology's theory lies the assumption that many human behavioral mechanisms evolved via natural selection. Although some components of this theory are falsifiable, its Lakatosian framework protects its core assumptions from falsifiability, even though most human behaviors probably do not require evolutionary explanations. Crucially, falsifiability is a necessary but insufficient quality of a good scientific theory, and the value of narrow evolutionary psychology can be questioned on other grounds. Narrow evolutionary psychology holds that only natural selection can create complex, functional adaptations, but natural selection is not a creative force; this process merely functions as a sieve that influences phenotype frequencies in descendant populations. Instead, only developmental processes can create the adaptations observed in individuals. Evolutionary explanations for behaviors will always be less useful than developmental explanations, given the context-dependent, emergent, and plastic nature of development. Evolutionary explanations will often be superfluous. (PsycInfo Database Record (c) 2026 APA, all rights reserved).

    2026The American psychologist(2026)引用:2
    引用
    AI阅读
    加入学术空间
    4Numerical Semigroups from Rational Matrices III: Semigroups of Matricial Dimension Two and a Counterexample to the Lonely Element Conjecture
    Arsh Chhabra,Stephan Ramon Garcia

    We characterize additive semigroups in {0,1,2,& mldr;} of matricial dimension 2 and produce a counterexample to the conjecture that a numerical semigroup whose small elements are lonely has matricial dimension at most 2.

    2026COMMUNICATIONS IN ALGEBRA(2026)引用:2
    引用
    AI阅读
    加入学术空间
    5Bridge Indices of Spatial Graphs and Diagram Colorings
    Sarah Blackwell,Puttipong Pongtanapaisan, Hanh Vo

    We extend the Wirtinger number of links, an invariant originally defined by Blair, Kjuchukova, Velazquez, and Villanueva in terms of extending initial colorings of some strands of a diagram to the entire diagram, to spatial graphs. We prove that the Wirtinger number equals the bridge index of spatial graphs, and we implement an algorithm in Python which gives a more efficient way to estimate upper bounds of bridge indices. Combined with lower bounds from diagram colorings by elements from certain algebraic structures and clasping techniques, we obtain exact bridge indices for a large family of almost unknotted spatial graphs. We also show that for every possible negative Euler characteristic, there exist almost unknotted graphs of arbitrarily large bridge index.

    2026DISCRETE MATHEMATICS(2026)引用:2
    引用
    AI阅读
    加入学术空间
    立即登录,查看全部 10000 篇论文

    合作机构(100)

    加州理工学院合作论文 229
    克莱蒙特研究生大学合作论文 211
    加州大学合作论文 197
    加利福尼亚大学圣地亚哥分校合作论文 113
    哈佛大学合作论文 111
    斯坦福大学合作论文 111
    华盛顿大学合作论文 105
    密歇根大学合作论文 96
    德克萨斯大学奥斯汀分校合作论文 92
    康奈尔大学合作论文 89

    机构统计