Proposals for producing novel periodic structures on silicon by ion bombardment sputtering

It is proposed, and confirmed analytically, that if multiple ion fluxes are incident simultaneously, at different oblique polar angles but at the same Azimuthal angle, on to a target, then the individual ripple patterns generated by sputtering are superimposed to produce novel surface structures. It is also shown that multiple focused ion fluxes incident on to rotating targets can produce circular novel patterns.     

提高作战模拟软件资源可重用性的思考

软件重用是缩短开发周期、提高产品质量、减少经费和降低风险的有效途径.在分析制约我军作战模拟软件资源重用瓶颈的基础上,结合当前建模与仿真、软件工程等领域的前沿技术,提出了基于可组构性仿真、面向实体、模式、Web服务等技术的解决方案,较好地解决了如何提高作战模拟软件资源重用性的问题.     

Real realization: Dennett’s real patterns versus Putnam’s ubiquitous automata

Both Putnam and Searle have argued that that every abstract automaton is realized by every physical system, a claim that leads to a reductio argument against Cognitivism or Strong AI: if it is possible for a computer to be conscious by virtue of realizing some abstract automaton, then by Putnam’s theorem every physical system also realizes that automaton, and so every physical system is conscious—a conclusion few supporters of Strong AI would be willing to accept. Dennett has suggested a criterion of reverse engineering for identifying “real patterns,” and I argue that this approach is also very effective at identifying “real realizations.” I focus on examples of real-world implementations of complex automata because previous attempts at answering Putnam’s challenge have been overly restrictive, ruling out some realizations that are in fact paradigmatic examples of practical automaton realization. I also argue that some previous approaches have at the same time been overly lenient in accepting counter-intuitive realizations of trivial automata. I argue that the reverse engineering approach avoids both of these flaws. Moreover, Dennett’s approach allows us to recognize that some realizations are better than others, and the line between real realizations and non-realizations is not sharp.     

Automated user interface engineering with a pattern reflecting programming language

The development of the user interface concerns all aspects of a software system that are targeted to the interactive delivery of its functionality and data. Today, user interface development accounts for a large proportion of the overall software implementation, while the programming process involves various recurring software patterns. Based on the identification of key commonly occurring user interface programming patterns, we have designed and implemented a user interface programming language with built-in constructs to directly support those software patterns, offering declarative programming features such as: precondition-based actions, unidirectional constraints and data-content monitors. Initially, we introduce the deployment syntax and semantics of the novel programming elements, relying upon subject interaction scenarios. Then we reveal the most demanding implementation aspects of the code generator and the respective run-time library.     

Mining sequential patterns from data streams: a centroid approach

In recent years, emerging applications introduced new constraints for data mining methods. These constraints are typical of a new kind of data: the data streams. In data stream processing, memory usage is restricted, new elements are generated continuously and have to be considered in a linear time, no blocking operator can be performed and the data can be examined only once. At this time, only a few methods has been proposed for mining sequential patterns in data streams. We argue that the main reason is the combinatory phenomenon related to sequential pattern mining. In this paper, we propose an algorithm based on sequences alignment for mining approximate sequential patterns in Web usage data streams. To meet the constraint of one scan, a greedy clustering algorithm associated to an alignment method is proposed. We will show that our proposal is able to extract relevant sequences with very low thresholds.     

基于设计模式的简化业务组件方法的研究与应用

目前B/S结构的动态交互式应用软件设计多数采用两种方式:一种是在客户端页面嵌入大量脚本代码和Jav-aBean对象,另一种是在服务器端部署若干重量级EJB组件。综合这两种方式的优势,该文提出了一种基于设计模式的简化业务组件设计方法,并给出了一个应用设计的实例。该方法既大幅度减少了在客户端页面嵌入的脚本代码和Bean对象,也可不在服务器端部署EJB重量级组件,而是运用一种方式去重构J2EE工作者服务模式和行为型的会话策略模式,从而使得类模块具有较强的扩展性,客户端页面设计具有良好的透明性。     

基于FS-tree的频繁模式挖掘算法

关联规则挖掘是数据挖掘中的一个重要研究方向,用于发现项集之间的关联性。FP-growth算法通过构造FP-tree产生频繁集,由于其不生成候选集从而大大降低了搜索开销,其缺点是占用大量的内存空间。基于FP-growth的算法思想,提出基于FS-tree（频繁1-项子树）的频繁模式挖掘算法,通过将FP-tree拆分为多棵FS-tree,使算法的空间复杂度明显减小。实验表明,该算法是有效的。     

多策略汉语句子时间分析与英译

提出了汉语时间信息的新分类和时间模式的概念,基于时间模式对汉语句子的时间信息进行形式化,构建汉语句子的词汇信息和语法信息时间模式库;提出多策略汉语句子时间分析和英译方法,将汉语单句时间分析算法、汉语关联词语标记句时间分析算法、类虚拟语气句时间分析算法和篇章信息识别规则相结合。实验表明该方法能有效解决汉英机器翻译中汉语句子时间分析和英译问题。     

值对象模式在劳动保障系统中的应用研究

基于J2EE的应用程序开发总伴随着大量数据存取、转换等问题,值对象用于封装数据以解决该类问题。综述模式概念后,分析和研究值对象在劳动保障领域的应用,这其中包括不同类别值对象的应用以及值对象自动生成工具的设计,最后对值对象的应用现状进行概括。     

Visitor设计模式研究

在面向对象设计理论指导下,通过分析Visitor设计模式及其已有改进模式的组成及其优缺点,提出了基于反射机制的改进方案Reflect Visitor模式,对于文中每一种模式,都给出了UML类图和Java实现的代码片断。