“实例+项目”作为《建筑CAD》标准教学法的探讨

AutoCAD是一种广泛应用的计算机辅助设计软件,广泛应用于多行业,当然也成为了各类院校教学的基本课程。在开设建筑类专业的院校,建筑CAD是学生必修的课程,是学生应掌握的一种基本技能,但作为课程的教师却参差不一,教学水平各异,所以我们应探索出一套行之有效的教学方法供广大教学者参考,形成一套建筑CAD的标准教学法:实例+项目教学法。     

Weak Convex Decomposition by Lines‐of‐sight

We define the convexity rank of a set of points to be the portion of mutually visible pairs of points out of the total number of pairs. Based on this definition of weak convexity, we introduce a spectral method that decomposes a given shape into weakly convex regions. The decomposition is applied without explicitly measuring the convexity rank. The method merely amounts to a spectral clustering of a matrix representing the all‐pairs line of sight. Our method can be directly applied on an oriented point cloud and does not require any topological information, nor explicit concavity or convexity measures. We demonstrate the efficiency of our algorithm on a large number of examples and compare them qualitatively with competitive approaches.     

Constructs and phenomena common to the semantically-rich domains

This article looks at some phenomena that recur during expert problem solving across domains including computer science, physics, chess, and mathematics. Several of the mechanisms which have been hypothesized to underlie performance in one domain are then used to explain the results found in the others. Competing explanations, mechanisms which are not fully specified, and untested empirical issues are also discussed.     

GKS—The First Graphics Standard

For the first time, an international graphics standard is possible. After years of research and redesign, the GKS emerges as the most likely candidate.     

Type Theory and Language Constructs for Objects with States

In current class-based Object-Oriented Programming Languages (OOPLs), object types include only static features. How to add object dynamic behaviors modeled by Harel's statecharts into object types is a challenging task. We propose adding states and state transitions, which are largely unstated in object type theory, into object type definitions and typing rules. We argue that dynamic behaviors of objects should be part of object type definitions. We propose our type theory, the τ-calculus, which refines Abadi and Cardelli's ζ-calculus, in modeling objects with their dynamic behaviors. In our proposed type theory, we also explain that a subtyping relation between object types should imply the inclusion of their dynamic behaviors. By adding states and state transitions into object types, we propose modifying programming language constructs for state tracking.     

Uninorm-Based Logic Neurons as Adaptive and Interpretable Processing Constructs

Fuzzy logic neurons and networks as introduced more than a decade ago, seamlessly combine the transparency of logic and architectural underpinnings of neural networks. They dwell on logic connectives (operators) implemented in terms of t-norms and s-conorms along with some logic predicates of inclusion, dominance, similarity and difference. In this study, while adhering to the principle of fuzzy neural networks, we venture into the use of uninorms in place of triangular norms and co-norms. The paper offers new models of generic processing units, called AND and OR unineurons, discusses the underlying functionality of such neurons along with their numeric characteristics and develops comprehensive architectures of logic networks. Discussed is the use of Particle Swarm Optimization as a vehicle of the learning of the networks. Several illustrative numeric examples are included.     

(Weak) Dual hyper <Emphasis Type="Italic">K</Emphasis>-ideals

In this note by considering the notion of (weak) dual hyper K-ideal, we obtain some related results. After that we determine the relationships between (weak) dual hyper K-ideals and (weak) hyper K-ideals. Finally, we give a characterization of hyper K-algebras of order 3 or 4 based on the (weak) dual hyper K-ideals.     

异种ATM网络互连标准PNNI

详细介绍了异种ＡＴＭ网络互连标准ＰＮＮＩ，ＰＮＮＩ较好地解决了人们普遍关心的多厂家ＡＴＭ产品互连网络交换虚电路的建立问题。     

Weak associativity and restricted rotation

A restricted rotation induced by a weak associative law is introduced. The corresponding equivalence relation is identical to the Glivenko congruence on Tamari lattices, i.e. lattices of binary trees endowed by the well-known rotation operation.     

Weak Updates and Separation Logic

Separation logic provides a simple but powerful technique for reasoning about low-level imperative programs that use shared data structures. Unfortunately, separation logic supports only “strong updates,” in which mutation to a heap location is safe only if a unique reference is owned. This limits the applicability of separation logic when reasoning about the interaction between many high-level languages (e.g., ML, Java, C#) and low-level ones since the high-level languages do not support strong updates. Instead, they adopt the discipline of “weak updates,” in which there is a global “heap type” to enforce the invariant of type-preserving heap updates. We present SL ^w , a logic that extends separation logic with reference types and elegantly reasons about the interaction between strong and weak updates. We describe a semantic framework for reference types, which is used to prove the soundness of SL ^w . Finally, we show how to extend SL ^w with concurrency.     

Systems of Linear Equations with Fuzzy Set Data: Weak Solvability and Weak Admissibility

The notion of a fuzzy linear system of equations as a set of five special interval systems of equations is introduced. The notions of weak and strong solvability (admissibility) of a fuzzy linear system of equations in five grades (crisp, quasi-crisp, semi-crisp, quasi-fuzzy, and fuzzy) are introduced. The criteria of weak solvability and admissibility of fuzzy linear systems of equations in the five grades are substantiated. Other properties of fuzzy systems and their weak solutions in all the five grades are proved.     

Non-Linear Rewrite Closure and Weak Normalization

A rewrite closure is an extension of a term rewrite system with new rules, usually deduced by transitivity. Rewrite closures have the nice property that all rewrite derivations can be transformed into derivations of a simple form. This property has been useful for proving decidability results in term rewriting. Unfortunately, when the term rewrite system is not linear, the construction of a rewrite closure is quite challenging. In this paper, we construct a rewrite closure for term rewrite systems that satisfy two properties: the right-hand side term in each rewrite rule contains no repeated variable (right-linear) and contains no variable occurring at depth greater than one (right-shallow). The left-hand side term is unrestricted, and in particular, it may be non-linear. As a consequence of the rewrite closure construction, we are able to prove decidability of the weak normalization problem for right-linear right-shallow term rewrite systems. Proving this result also requires tree automata theory. We use the fact that right-shallow right-linear term rewrite systems are regularity preserving. Moreover, their set of normal forms can be represented with a tree automaton with disequality constraints, and emptiness of this kind of automata, as well as its generalization to reduction automata, is decidable. A preliminary version of this work was presented at LICS 2009 (Creus 2009).     

Structured Fortran—An Evolution of Standard Fortran

Fortran is 21 years old; many would say that it has not reached adulthood but senility. Yet it remains the language of use in the overwhelming majority of scientific applications of computers and no end to this situation is in sight. Moreover, its evolution through the standards process is very slow, too slow to give any hope that Fortran will ever in this way become a language in which structured programs can be easily and effectively written.     

Weak and strong fairness in CCS

We examine the issue of weak and strong fairness in the framework of Milner's CCS. Our approach is operational. We address the problem of giving sets of finite rules for generating all and only the admissible execution sequences when fairness is assumed. We achieve our aims by defining two calculi, one for weak and the other for strong fairness. Both calculi are extensions of standard CCS. In neither case do we appeal to random assignment or to transformations. A distinguishing feature of the weak fair calculus, unlike standard approaches which appeal to random assignment, is that it does not involve predictive choice.     

软件标准化建设与提高企业竞争力的关系分析

本文通过论述标准化实施的基本情况、软件企业标准化的执行与软件企业创新型的关系等三个方面具体分析了软件标准化建设与提高企业竞争力的关系.     

Controlling and Restoring the Integrity of Multi-Dimensional Data Arrays through Cryptocode Constructs

Programming and Computer Software - A method for controlling and restoring data integrity in multidimensional storage systems is developed. The proposed constructs for controlling and restoring the...     

Weak pseudo-Wajsberg and weak pseudo-MV algebras

 We introduce and study a generalization of pseudo-Wajsberg and pseudo-MV algebras. The weakening of the axioms leads to the existence of two lattice structures, and of two multiplicative monoid structures. Some categorical equivalences are established.     

Application of Recursive Constructs for Numerical Integration and Determination of Invariant Errors

A general concept of a recursive construct is introduced to determine invariant errors in numerical integration of functions, which, in turn, may be useful in applying invariant constructs to more effective numerical integration from the viewpoint of computation time and accuracy.