Experiment with control code obfuscation

Control code obfuscation is intended to prevent malicious reverse engineering of software by masking the program control flow. The idea for further advancing the state of the art was presented in 2000 by WANG C. An obfuscating system for Java based on the ideas of WANG C is implemented and experimented. The experiment results show that obfuscation can be done efficiently with moderate increases in code size, execution times, while making the obfuscated code resilient to a variety of reverse engineering attacks.     

Parsing with Dynamic Rule Selection

Although many linguistic theories and formalisms have been developed and discussed on the problem of parsing algorithm in the past decades,the efficiency and accuracy of parsing are still serious problems in practical machine translation systems.This paper presents a parsing algorithm wit dynamic rule selection and the experimental results.By describing the design and practice of the inproved algorithm ,the paper discusses in detail the designing method for a high speed and efficient parser.     

Constructing M-sided Patches with NURBS

ＣＯＮＳＴＲＵＣＴＩＮＧＮ－ＳＩＤＥＤＰＡＴＣＨＥＳＷＩＴＨＮＵＲＢＳＷａｎｇＬａｚｈｕ；ＺｈｕＸｉｎｘｉｏｎｇＣＯＮＳＴＲＵＣＴＩＮＧＮ－ＳＩＤＥＤＰＡＴＣＨＥＳＷＩＴＨＮＵＲＢＳ￥ＷａｎｇＬａｚｈｕ；ＺｈｕＸｉｎｘｉｏｎｇＡｂｓｔｒａｃｔＴｈｅｐ...     

Cooking with Mocky教学设计

●教材分析本课内容为北师大版先锋英语五年级下册第十一单元Cooking with Mocky。培养学生语言能力的最佳途径是沟通、交际。本课正是在语觉论的理论指导下,以语言交际为中心的英语教学设计思想为指导,借助多媒体网     

BLOK for life with you

先为我们介绍一下您的BLOK吧，这个名字有什么特殊含义吗？     

Do people with social anxiety feel anxious about interacting with a robot?

AI & SOCIETY - To investigate whether people with social anxiety have less actual and “anticipatory” anxiety when interacting with a robot compared to interacting with a person, we...     

Cooperative Hypermedia Editing with CoMEdiA

CoMEdiA is a groupware tool which enables co-authors to cooperatively produce hypermedia documents.CoMEdiA allows co-authors to communicate their ideas,drafts,guidelines,constraints and annotations to other co-authors.In uses a mix of communication patterns,media and document organization to enable co-authors to keep on exchanging information(remotely or face-to-face),improving passages and modifying notes until a final document is achieved.We did not concentrate on th depth but on the breath of the features.Our efforts were on integrating and corrdinating concepts from collaboration,multimedia and hyper organization rather than on making a specialized system in any of them.We began with the text medium and are now including bitmaps and raster images.Later sound and video will also be integrated.In this paper we describe and sustain the available capacites.     

Nonterminating Rewritings with Head Boundedness

We define here the concept of head boundedness,head normal form and head confluence of term rewriting systems that allow infinite derivation.Head confluence iw weaker than confluence,but sufficient to guarantee the correctness of lazy implementations of equational logic programming languages.Then we prove several results.First,if a left-linear system is locally confluent and head-bounded.then it is head-confluent.Second,head-confluent and head-bounded systems have the heau Church-Rosser property.Last,if an orthogonal system is head-terminating,then it is head-bounded.These results can be applied to generalize equational logic programming languages.     

Cooking with Mocky教学设计

●教材分析本课内容为北师大版先锋英语五年级下册第十一单元Cooking with Mocky。培养学生语言能力的最佳途径是沟通、交际。本课正是在语觉论的理论指导下,以"语言交际为中心"的英语教学设计思想为指导,借助多媒体网     

Work with language教学设计

教材分析 本课是教育科学出版社出版的小学<英语>五年级下册Module 5 Food and Drink第四课.要求学生掌握对话中的词汇,懂得区分西方的食物和东方的食物,对人体每天所需的四类有益食物有清晰的概念,本课时的另一重点是复习巩固多音节和个别双音节形容词的比较级和最高级形式.     

分布式应用with or without EJB

本文首先讨论了在实际应用中我们是否真的需要分布式应用。随后介绍了当今 Java 世界的各种远程访问机制和分布式架构,最后用 EJB 举例介绍如何在已有的系统中引入分布式功能。我们真的需要分布式应用吗?“记住分布式计算机的第一法则:不要分布你的对象!”——(Martin Fowler,Patterns of Enterprise ApplicationArchitecture)我们真正需要分布式应用吗?经历过这些年的 J2EE 开发,我们已经意识到大部分 J2EE 应用程序,特别是 Web 应用     

Solving Inheritance Anomaly with OMNets

This paper presents a concurrent object-oriented modeling language based on Petri nets:OMNets,which hepls greatly to avoid the inheritance anomaly problem appeared in concurrent OO languages.OMNets separates th functional part and the synchroniztion part of objects and uses Petri nets to describe the synchronization part.Both parts are reusable through inheritance.     

Display of Fractal with Evolution

Based on the study of the process in which Sierpinski Gasket, a typical fractal, is constructed in 3D space, a new method of visualizing fractal is presented in this article. The image of the fractal is built in screen space, and, by utilizing existing techniques for visualizing traditional geometric objects, the real effectiveness of image can be obtained.     

Reconnectable Network with Limited Resources

The reachability of a strongly connected network may be destroyed after link damage.Since many networks are directed or equivalent directed,connected by directed links with the potential for reversal.Therefore the reachability can be restored by reversing the direction of links.[1] has studied this matter under unlimited resources (transmitter and receiver) condition.In this paper the reconnectability of a network with limited number of receivers and transmitters is discussed.Also a linear time algorithm is given to find a reconnected reversal for limited receivers and transmitters.     

Denote CSP with Temporal Formulas

This is a sequel of [1] to give a temporal semantics to a full version of CSP,including hiding operator and nested parallelis.The semantic definition is of denotational style,and employs set of temporal formulas as denotations.The continuity is proved,when the hiding operatior is restricted to channels only with finite possible meassages.     

Symmetric-key cryptosystem with DNA technology

DNA cryptography is a new field which has emerged with progress in the research of DNA computing. In our study, a symmetric-key cryptosystem was designed by applying a modern DNA biotechnology, microarray, into cryptographic technologies. This is referred to as DNA symmetric-key cryptosystem (DNASC). In DNASC, both encryption and decryption keys are formed by DNA probes, while its ciphertext is embedded in a specially designed DNA chip (microarray). The security of this system is mainly rooted in difficult biology processes and problems, rather than conventional computing technology, thus it is unaffected by changes from the attack of the coming quantum computer. The encryption process is a fabrication of a specially designed DNA chip and the decryption process is the DNA hybridization. In DNASC, billions of DNA probes are hybridized and identified at the same time, thus the decryption process is conducted in a massive, parallel way. The great potential in vast parallelism computation and the extraordinary information density of DNA are displayed in DNASC to some degree.     

Trends in Computing with DNA

As an emerging new research area, DNA computation, or more generally biomolecular computation, extends into other fields such as nanotechnology and material design, and is developing into a new sub-discipline of science and engineering. This paper provides a brief survey of some concepts and developments in this area. In particular several approaches are described for biomolecular solutions of the satisfiability problem (using bit strands, DNA tiles and graph self-assembly). Theoretical models such as the primer splicing systems as well as the recent model of forbidding and enforcing are also described. of DNA nanostructures and nanomechanical devices as wellWe review some experimental results of self-assemblyas the design of an autonomous finite state machine.     

Discretization methods with analytical solutions for a convection–reaction equation with higher-order discretizations

We introduce an improved second-order discretization method for the convection–reaction equation by combining analytical and numerical solutions. The method is derived from Godunov's scheme, see [S.K. Godunov, Difference methods for the numerical calculations of discontinuous solutions of the equations of fluid dynamics, Mat. Sb. 47 (1959), pp. 271–306] and [R.J. LeVeque, Finite Volume Methods for Hyperbolic Problems, Cambridge Texts in Applied Mathematics, Cambridge University Press, 2002.], and uses analytical solutions to solve the one-dimensional convection-reaction equation. We can also generalize the second-order methods for discontinuous solutions, because of the analytical test functions. One-dimensional solutions are used in the higher-dimensional solution of the numerical method.

The method is based on the flux-based characteristic methods and is an attractive alternative to the classical higher-order total variation diminishing methods, see [A. Harten, High resolution schemes for hyperbolic conservation laws, J. Comput. Phys. 49 (1993), pp. 357–393.]. In this article, we will focus on the derivation of analytical solutions embedded into a finite volume method, for general and special solutions of the characteristic methods.

For the analytical solution, we use the Laplace transformation to reduce the equation to an ordinary differential equation. With general initial conditions, e.g. spline functions, the Laplace transformation is accomplished with the help of numerical methods. The proposed discretization method skips the classical error between the convection and reaction equation by using the operator-splitting method.

At the end of the article, we illustrate the higher-order method for different benchmark problems. Finally, the method is shown to produce realistic results.