信息化教学中FlashPaper的运用

随着信息化教学的不断深入，我们会经常遇到这样的一些问题：有关教学的文件在自己的电脑上可以打开且显示正常．到别的电脑上却出现打不开，或者打开了却在有的地方显示为乱码等。我们在实践中发现FlashPaper这个软件能有效解决这个问题。本文首先介绍了FlashPaper这个软件的特点、原理和使用方法。在此基础上探讨pdf文件格式转化等在实际工作中的运用。希望能为相关的教学人员提供一些参考。     

Genre as noise: noise in genre

Given a specific information need, documents of the wrong genre can be considered as noise. From this perspective, genre classification helps to separate relevant documents from noise. Orthographic errors represent a second, finer notion of noise. Since specific genres often include documents with many errors, an interesting question is whether this “micro-noise” can help to classify genre. In this paper we consider both problems. After introducing a comprehensive hierarchy of genres, we present an intuitive method to build specialized and distinctive classifiers that also work for very small training corpora. Special emphasis is given to the selection of intelligent high-level features. We then investigate the correlation between genre and micro noise. Using special error dictionaries, we estimate the typical error rates for each genre. Finally, we test if the error rate of a document represents a useful feature for genre classification.     

Contextual Deontic Logic: Normative Agents, Violations and Independence

In this paper we discuss when and how to use deontic logic in multi-agent systems. Our central question is how to proceed once a norm has been violated or defeated, a key issue of deontic logic applications in multi-agent systems. To bridge the logical analysis of norms in philosophy with applications in agent theory, we propose a practical approach based on violation contexts and independence statements. In particular, we introduce a combination of two traditional deontic logics, which we extend with so-called deontic and factual independence assumptions. We show how different notions of violability and defeasibility can be encoded in the logic by defining different ways in which independence assumptions are derived from the explicit manner of presentation. We also show how our approach can be used to give a new analysis of several notorious paradoxes of deontic logic.     

Supporting students’ participation in authentic proof activities in computer supported collaborative learning (CSCL) environments

In this paper, I review both mathematics education and CSCL literature and discuss how we can better take advantage of CSCL tools for developing mathematical proof skills. I introduce a model of proof in school mathematics that incorporates both empirical and deductive ways of knowing. I argue that two major forces have given rise to this conception of proving: a particular learning perspective promoted in reform documents and a genre of computer tools, namely dynamic geometry software, which affords this perspective of learning within the context of mathematical proof. Tracing the move from absolutism to fallibilism in the philosophy of mathematics, I highlight the vital role of community in the production of mathematical knowledge. This leads me to an examination of a certain CSCL tool whose design is guided by knowledge-building pedagogy. I argue that knowledge building is a suitable pedagogical approach for the proof model presented in this paper. Furthermore, I suggest software modifications that will better support learners’ participation in authentic proof tasks.     

Hacking Spaces: Place as Interface

In this article, we analyze the complex rationales—both transparent to us and, at times, made visible—underneath the instructional spaces in which we work and teach. To do so, we first situate space analysis in the larger, national conversations about instructional spaces and then through the work of computers and writing scholars. We conclude with an analysis of instructional spaces at our institution. These are spaces specific to our locale, but spaces we think are quite common at most institutions of higher education. Perhaps more importantly, we situate this space analysis on issues these spaces pose—issues of restricted movement, impaired ability to collaborate, sensory disruption, limited leadership ability, and functional/material constraints. We attempt to return to the roots of hacking and to situate hacking as a particular tool for negotiating and, at times, disrupting the assumptions built under, within, and across instructional spaces.     

对大学计算机基础中硬件部分教学方法的探讨

大学计算机基础是大中专院校的非计算机专业学生必修的一门公共基础课。这门课程主要讲述计算机的基础知识,基本操作;学生对其中计算机的硬件知识很感兴趣,但由于教学条件的限制,难以在课堂上用实物进行讲解和组装演练,因此我们要广开思路寻找适合当前教学境况的创新教学方法。     

论信息学科平台课程群立体可视化教育资源体系的构建

介绍了项目组围绕信息学科平台课程群立体化教育的教学理念、模式、教材、资源和方法,阐述如何构建信息学科平台课程群的立体可视化优质教育资源体系,培养学生的IT应用开发能力和软件设计能力。     

From Intersubjectivity to Group Cognition

The question of how it is possible for people to understand each other has been a controversial theme throughout the recent history of philosophy. It is a foundational issue for the social sciences, in which researchers try to understand the behaviors and statements of other people. It is of particular relevance to CSCW and CSCL, where participants have to understand, work with and learn with each other. Philosophers have posed the issue of how an individual can understand another and how a small group or community can have a joint understanding, shared intentionality or we-awareness. Studies of CSCW not only adopt insights from the philosophy of intersubjectivity to ground their methodology, they also contribute to the analysis of how intersubjectivity is established in concrete settings, including in virtual environments. Similarly, CSCL research can investigate how groups of people learn to construct intersubjective understandings in both traditional and technologically enhanced interactions. While classical phenomenology of intersubjectivity started from the cognitions of a solitary mind, the notion of intersubjectivity has subsequently shifted to a more social view. Recent studies of intersubjectivity suggest a structure of group cognition, which can provide a foundation for collaboration in work and learning that incorporates but transcends individual cognition.     

Using Metaphor to Analyse Qualitative Data: Vulcans and Humans in Software Development

This paper reports on an experience of using metaphor in qualitative research of software engineering in practice. Our project aimed to uncover non-technical factors affecting the adoption and evolution of Software Quality Management Systems (referred to here as ‘the quality process’). Previously we have reported the tensions we uncovered around the quality process in four companies, based on semi-structured interviews. This paper extends this work by applying metaphor to the results. We show how we were able to produce more general statements regarding the tensions and their amelioration, and then introduce results from a fifth company, which we compare against our general statements. We find that these statements are generally supported by results from this fifth company. Finally we present some reflections on our experience of using metaphor in this way.     

Efficient Computation of Address Sequences in Data Parallel Programs Using Closed Forms for Basis Vectors

Arrays are mapped to processors through a two-step process—alignment followed by distribution—in data-parallel languages such as High Performance Fortran. This process of mapping creates disjoint pieces of the array that are locally owned by each processor. An HPF compiler that generates code for array statements must compute the sequence of local memory addresses accessed by each processor and the sequence of sends and receives for a given processor to access nonlocal data. In this paper, we present an approach to the address sequence generation problem using the theory of integer lattices. The set of elements referenced can be generated by integer linear combinations of basis vectors. Unlike other work on this problem, we derive closed form expressions for the basis vectors as a function of the mapping of data. Using these basis vectors and exploiting the fact that there is a repeating pattern in the access sequence, we derive highly optimized code that generates the pattern at runtime. The code generated uses table-lookup of the pattern. Experimental results show that our approach is faster than other solutions to this problem.     

浅谈Flash Paper在教学中的应用

Flash Paper软件能将当前主流的文档转换为SWF或PDF文档,便于在网络上浏览和打印。本文介绍了Flash Paper这个软件的特点、使用方法,并详细说明了如何在教学中运用这个软件辅助制作电子教案、电子课件、网页、电子书籍。     

Synchronizing Diachronic Uncertainty

Diachronic uncertainty, uncertainty about where an agent falls in time, poses interesting conceptual difficulties. Although the agent is uncertain about where she falls in time, this uncertainty can only obtain at a particular moment in time. We resolve this conceptual tension by providing a transformation from models with diachronic uncertainty relations into “equivalent” models with only synchronic uncertainty relations. The former are interpreted as capturing the causal structure of a situation, while the latter are interpreted as capturing its epistemic structure. The models are equivalent in the sense that agents pass through the same information sets in the same order, In this paper, we investigate how such a transformation may be used to define an appropriate notion of equivalence, which we call epistemic equivalence. Although our project is motivated by problems which have arisen in a variety of disciplines, especially philosophy and game theory, our formal development takes place within the general and flexible framework provided by epistemic temporal logic.     

Exploring Interpersonal Relationships in Historical Voting Records

Historical records from democratic processes and negotiation of constitutional texts are a complex type of data to navigate due to the many different elements that are constantly interacting with one another: people, timelines, different proposed documents, changes to such documents, and voting to approve or reject those changes. In particular, voting records can offer various insights about relationships between people of note in that historical context, such as alliances that can form and dissolve over time and people with unusual behavior. In this paper, we present a toolset developed to aid users in exploring relationships in voting records from a particular domain of constitutional conventions. The toolset consists of two elements: a dataset visualizer, which shows the entire timeline of a convention and allows users to investigate relationships at different moments in time via dimensionality reduction, and a person visualizer, which shows details of a given person's activity in that convention to aid in understanding the behavior observed in the dataset visualizer. We discuss our design choices and how each tool in those elements works towards our goals, and how they were perceived in an evaluation conducted with domain experts.     

Passage retrieval in legal texts

Legal texts usually comprise many kinds of texts, such as contracts, patents and treaties. These texts usually include a huge quantity of unstructured information written in natural language. Thanks to automatic analysis and Information Retrieval (IR) techniques, it is possible to filter out information that is not relevant and, therefore, to reduce the amount of documents that users need to browse to find the information they are looking for. In this paper we adapted the JIRS passage retrieval system to work with three kinds of legal texts: treaties, patents and contracts, studying the issues related with the processing of this kind of information. In particular, we studied how a passage retrieval system might be linked up to automated analysis based on logic and algebraic programming for the detection of conflicts in contracts. In our set-up, a contract is translated into formal clauses, which are analysed by means of a model checking tool; then, the passage retrieval system is used to extract conflicting sentences from the original contract text.     

A Unified Framework for Instruction Scheduling and Mapping for Function Units with Structural Hazards

Software pipelining methods based on an ILP (integer linear programming) framework have been successfully applied to derive rate-optimal schedules under resource constraints. However, like many other previous works on software pipelining, ILP-based work has focused on resource constraints of simple function units, e.g., “clean pipelines”—pipelines without structural hazards. The problem for architectures beyond such clean pipelines remains open. One challenge is how to represent such resource constraints for unclean pipelines, i.e., pipelined function units, but having structural hazards.In this paper, we propose a method to constructrate-optimalsoftware pipelined schedules for pipelined architectures with structural hazards. A distinct feature of this work is that it provides a unified ILP framework for two challenging and interrelated aspects of software pipelining—the scheduling of instructions at particular times and the mapping of those instructions to specific function units. Solving both of these aspects is essential to finding schedules which will work both on VLIW machines which map instructions to fixed function units and on dynamic out-of-order superscalars. We propose two ILP formulations to solve the integrated scheduling and mapping problem. Both adopt principles of graph coloring in an ILP framework, and one usesforbidden latenciesin an elegant extension of classical hardware pipeline control theory.We have run experiments on four variations of our proposed formulations. As input we used a set of 415 “unique” loops taken from several benchmark suites, and we targeted an architecture whose function units contain many structural hazards. All four of our variations did well, with the best finding a rate-optimal schedule for 65% of the loops. This compares favorably with a leading heuristic, Huff'sSlack Scheduling—the ILP approaches found a schedule with smaller initiation interval for over 50% of the loops, with a mean improvement of almost 30%. Finally, we have found that reusing pipeline stages—and thus adding hazards—results in only a 10% drop in performance, while permitting significant savings in area.     

2LP: A double-lazy XML parser

XML is acknowledged as the most effective format for data encoding and exchange over domains ranging from the World Wide Web to desktop applications. However, large-scale adoption into actual system implementations is being slowed down due to the inefficiency of its document-parsing methods. The recent development of lazy parsing techniques is a major step towards improving this situation, but lazy parsers still have a key drawback—they must load the entire XML document in order to extract the overall document structure before document parsing can be performed. We have developed a framework for efficient parsing based on the idea of placing internal physical pointers within the XML document that allow the navigation process to skip large portions of the document during parsing. We show how to generate such internal pointers in a way that optimizes parsing using constructs supported by the current W3C XML standard. A double-lazy parser (2LP) exploits these internal pointers to efficiently parse the document. The usage of supported W3C constructs to create internal pointers allows 2LP to be backward compatible—i.e., the pointer-augmented documents can be parsed by current XML parsers. We also implemented a mechanism to efficiently parse large documents with limited main memory, thereby overcoming a major limitation in current solutions. We study our pointer generation and parsing algorithms both theoretically and experimentally, and show that they perform considerably better than existing approaches.