quwenjian的专栏

PRELIS 是LISREL的一部分。它主要用于在构建结构模型之前，对数据进行前期处理和初 步分析。PRELIS 的主要用途包括： o 将其它格式的数据文件（SAS, SPSS, Excel, Stat 等等）读入并存储为PRELIS 数据文 件。 o 将 PRELIS（*.psf）数据输出为其他软件可读的相应格式。 o 对 PRELIS 数据进行处理。（定义变量类型，处理缺失值，数据筛选，生成子数据集 等）。 o 回归模型分析及初步的因子分析等。 o 计算矩阵（协方差矩阵，多项相关系数以及渐近协方差矩阵等）。 o 可以用图表直观地表现数据的状况。 在这里，我们用不同类型的变量为例介绍如何应用PRELIS 来实现上述功能。本章中的 所有数据都存在LISREL 安装文件夹中的TUTORIAL 子文件夹里。

我在论文中看到了SCI2软件，由于部分学者用的电脑windows7的可能无法使用，我特意麻烦国外的的朋友帮忙下载的32位软件可用于windows7，只用前要装JAVA，这款的java要求1.9版的，本来 想为了让大家方便特把java提供在一块，方便下载，但容量限制上传不了，麻烦自己去找一下JAVA1.9。

这是一份R实现的代码资源，本书可以作为学习预测建模基础知识的指南和参考读物。本书的开篇是关于模型术语和预测建模过程的一个专门章节。后续的每个章节会讲解具体的一类模型（例如神经网络），并把重点放在三个重要问题上：模型如何工作，如何利用R语言训练模型，以及如何利用实际环境下的数据集来衡量和评估模型的性能。

《本体元建模理论与方法及其应用》以从事软件工作的科研、技术人员及计算机软件与理论专业的研究生为目标阅读群体，针对软件工程中面向服务的语义互操作性问题，分11章系统介绍了本体元建模理论与方法、核心技术标准、实际应用和互操作性测评。

《社会网络的动态分析与仿真实验:理论与应用》主要讲述了，随着网络化和数字化的发展，社会网络在社会学、管理学和情报学等领域已经成为研究热点。由于社会网络是动态演化并存在于复杂社会技术系统中，但是传统的社会网络分析方法集中于对某一横截面数据的静态分析，在应对网络的复杂性和动态性的研究上很难胜任。《社会网络的动态分析与仿真实验:理论与应用》结合作者多年的研究成果，介绍了社会网络动态分析和仿真实验的理论与应用，并尝试将“网络实证分析”和“网络建模仿真”两方面研究结合起来，对社会网络的动态性进行研究。全书分理论与应用两部分。理论部分介绍了社会网络动态分析和社会网络仿真与计算实验理论相关的若干问题与实施方法。应用部分介绍了作者在联盟网络的演化、开源社会网络的协同、基于地理信息的引文网络评价、引文网络局部动态性分析上的实证研究成果，以及在网络信息传播、组织网络适应性、信息技术的采纳与扩散、基于元网络的交互系统影响、政府组织群体网络的信息化行为上的仿真研究成果。

一本关于数字图书馆的元数据的书籍，绝对权威，好好享用。

该软件是图情领域的一款十分有效的分析工具，内含详细的案例分析。

智能主体是一种处于一定环境下包装的计算机系统，为了实现设计目的，它能在那种环境下灵活地、自主地活动。智能主体提供了一种新的计算和问题求解风范。在人工智能研究中，主体概念的回归并不单单是因为人们认识到了应该把人工智能各个领域的研究成果集成为一个具有智能行为概念的“主体”，更重要的原因是人们认识到了人类智能的本质是一种社会性的智能。

Possible world semantics underlies many of the applications of modal logic in computer science and philosophy. The standard theory arises from interpreting the semantic denitions in the ordinary meta-theory of informal classical mathematics. If, however, the same semantic denitions are interpreted in an intuitionistic metatheory then the induced modal logics no longer satisfy certain intuitionistically invalid principles. This thesis investigates the intuitionistic modal logics that arise in this way. Natural deduction systems for various intuitionistic modal logics are presented. From one point of view, these systems are self-justifying in that a possible world interpretation of the modalities can be read o directly from the inference rules. A technical justication is given by the faithfulness of translations into intuitionistic rst-order logic. It is also established that, in many cases, the natural deduction systems induce well-known intuitionisticmodal logics, previously given by Hilbertstyle axiomatizations. The main benet of the natural deduction systems over axiomatizations is their susceptibility to proof-theoretic techniques. Strong normalization (and con uence) results are proved for all of the systems. Normalization is then used to establish the completeness of cut-free sequent calculi for all of the systems, and decidability for some of the systems. Lastly, techniques developed throughout the thesis are used to establish that those intuitionistic modal logics proved decidable also satisfy the nite model property. For the logics considered, decidability and the nite model property presented open problems

A topos is a categorical model of constructive set theory. In particular, the eective topos is the categorical 'universe' of recursive mathematics. Among its objects are the modest sets, which form a set-theoretic model for polymorphism. More precisely, there is a bration of modest sets which satises suitable categorical completeness properties, that make it a model for various polymorphic type theories. These lecture notes provide a reasonably thorough introduction to this body of material, aimed at theoretical computer scientists rather than topos theorists. Chapter 2 is an outline of the theory of brations, and sketches how they can be used to model various typed -calculi. Chapter 3 is an exposition of some basic topos theory, and explains why a topos can be regarded as a model of set theory. Chapter 4 discusses the classical PER model for polymorphism, and shows how it 'lives inside' a particular topos|the eective topos|as the category of modest sets. An appendix contains a full presentation of the internal language of a topos, and a map of the eective topos. Chapters 2 and 3 provide a sampler of categorical type theory and categorical logic, and should be of more general interest than Chapter 4. They can be read more or less independently of each other; a connection is made at the end of Chapter 3. The main prerequisite for reading these notes is some basic category theory: limits and colimits, functors and natural transformations, adjoints, cartesian closed categories. No knowledge of indexed categories or categorical logic is needed. Some familiarity with 'ordinary' logic and typed -calculus is assumed.

Contents 1 Introduction 3 2 Orthomodular quantum logic and orthologic 11 3 The implication problem 22 4 Metalogical properties and anomalies 28 5 A modal interpretation of OL and OQL 32 6 An axiomatization of OL and OQL 35 7 The intractability of orthomodularity 40 8 Hilbert quantum logic and the orthomodular law 45 9 First-order quantum logic 50 10 Quantum set theories and theories of quasisets 56 11 The unsharp approaches 59 12 Effect structures 61 13 Paraconsistent quantum logic 70 14 The Brouwer-Zadeh logics 74 15 Partial quantum logics 86 16 Lukasiewicz quantum logic 92 17 Conclusion 96

这是一本sas9.1的编程手册是编译好的CHM文件可以直接使用，内容包含各种程度的编程方法

In this book, two of Microsoft's leading consultants illustrate how to use SQL Server 2005 Business Intelligence (BI) technologies to solve real-world problems in markets ranging from retail and finance to healthcare. Drawing on extensive personal experience with Microsoft's strategic customers, John C. Hancock and Roger Toren offer unprecedented insight into BI systems design and step-by-step best practices for implementation, deployment, and management.

A Course in Universal Algebra是一本很好的泛代数教材，PDF格式

一本ACTIONSCRIPT命令手册，介绍详细，PDF文件格式

Compositionality, i.e. that properties of composite systems are deduced in terms of those of their immediate constituents, is crucial to the tractability and practical usefulness of program logics. A general technique for obtaining this for parallel composition appeals to a relativisation of properties with respect to properties of parallel environments. This induces a notion of consequence on properties which will in general be a relevant one. Based on this observation we suggest using modal or temporal extensions of relevance logics to build compositional logics for processes.

Topology has proved to be an essential tool for certain aspects of theoretical computer science. Conversely, the problems that arise in the computational setting have provided new and interesting stimuli for topology. These prob- lems also have increased the interaction between topology and related areas of mathematics such as order theory and topological algebra. In this paper, we outline some of these interactions between topology and theoretical computer science, focusing on those aspects that have been most useful to one particular area of theoretical computation { denotational semantics

这是一本matlab全部命令的大部头的书,