基于SmartFoxServer 2X平台的移动应用程序开发

随着移动设备的发展,移动应用程序也变得丰富多彩。本文主要介绍如何在SmartFoxServer平台上开发移动互联网应用,并且实现实时与SmartFoxServer 2X服务器进行交互,更新和持久化玩家相关信息。简要介绍SmartFoxServer的Java扩展以及Android应用程序的构成,通过一个网络游戏系统的开发过程,详细说明其开发原理和开发流程。最后结合游戏应用程序的开发实现,进一步说明Android在SmartFoxServer 2X平台上的应用前景和巨大应用潜力。     

PRAND: GPU accelerated parallel random number generation library: Using most reliable algorithms and applying parallelism of modern GPUs and CPUs

The library PRAND for pseudorandom number generation for modern CPUs and GPUs is presented. It contains both single-threaded and multi-threaded realizations of a number of modern and most reliable generators recently proposed and studied in Barash (2011), Matsumoto and Tishimura (1998), L’Ecuyer (1999,1999), Barash and Shchur (2006) and the efficient SIMD realizations proposed in Barash and Shchur (2011). One of the useful features for using PRAND in parallel simulations is the ability to initialize up to 10¹⁹${10}^{19}$ independent streams. Using massive parallelism of modern GPUs and SIMD parallelism of modern CPUs substantially improves performance of the generators.     

Performance Evaluation of a Multi-Zone Application in Different OpenMP Approaches

We describe a performance study of a multi-zone application benchmark implemented in several OpenMP approaches that exploit multi-level parallelism and deal with unbalanced workload. The multi-zone application was derived from the well-known NAS Parallel Benchmarks (NPB) suite that involves flow solvers on collections of loosely coupled discretization meshes. Parallel versions of this application have been developed using the Subteam concept and Workqueuing model as extensions to the current OpenMP. We examine the performance impact of these extensions to OpenMP and compare with hybrid and nested OpenMP approaches on several large parallel systems.     

Some notes on Zadeh’s extensions

This paper shows that the Zadeh’s extensions of sendograph-metric-continuous fuzzy-valued functions are sendograph-metric-continuous fuzzy functions.     

Extending applications using an advanced approach to DLL injection and API hooking

When programmers need to modify third‐party applications, they frequently do not have access to their source code. In such cases, DLL injection and API hooking are techniques that can be used to modify applications without intervening into their source code. The commonly used varieties of injection and hooking approaches have many practical limitations: they are inconvenient for a programmer to implement, do not work reliably in conjunction with all applications and with certain low‐level machine instructions. In this paper we present two novel approaches to DLL injection and API hooking, which we call Debugger‐aided DLL injection and Single Instruction Hooking. Our approaches overcome the limitations of the state‐of‐the art approaches. Despite incurring greater execution times, our approach allows extending of the applications in situations where the comparable approaches fail. As such, it has a notable practical value for beneficial practical applications of injection and hooking approaches, which are present in malware detection programs and computer security tools. Copyright © 2010 John Wiley & Sons, Ltd.     

A Jump Inversion Theorem for the Degree Spectra

In the present article, we continue the study of the propertiesof the spectra of structures as sets of degrees initiated in[11]. Here, we consider the relationships between the spectraand the jump spectra. Our first result is that every jump spectrumis also a spectrum. The main result sounds like a Jump inversiontheorem. Namely, we show that if a spectrum is contained inthe set of the jumps of the degrees in some spectrum then thereexists a spectrum such that and is equal to the set of thejumps of the degrees in .     

ASP.NET MVC模型绑定应用研究

分析了ASP.NET MVC框架中模型绑定的本质及过程,说明了何时需要自定义扩展,并给出了模型绑定框架中的自定义扩展的实现方法。     

Vectorial languages and linear temporal logic

Determining for a given deterministic complete automaton the sequence of visited states while reading a given word is the core of important problems with automata-based solutions, such as approximate string matching. The main difficulty is to do this computation efficiently. Considering words as vectors and working on them using vectorial operations allows to solve the problem faster than using local operations.

In this paper, we show first that the set of vectorial operations needed by an algorithm representing a given automaton depends on the language accepted by the automaton. We give precise characterizations for star-free, solvable and regular languages using vectorial algorithms. We also study classes of languages associated with restricted sets of vectorial operations and relate them with languages defined by fragments of linear temporal logic.

Finally, we consider the converse problem of constructing an automaton from a given vectorial algorithm. As a byproduct, we show that the satisfiability problem for some extensions of LTL characterizing solvable and regular languages is PSPACE-complete.     

一类正则半群的F-壳

本文在给出纯正断面的特征刻划之后,证明了含拟理想纯正断面的正则半群,作为应用,给出了含拟理想逆断正则半群的一类类似的新结果。     

SGX在可信计算中的应用分析

可信计算技术SGX通过隔离出一块可信执行环境,来保护关键代码及数据的机密性与完整性,可以帮助防范各类攻击.首先,介绍了SGX的研究背景和工作原理,分析了SGX在可信计算领域的研究现状.然后,整理了SGX当前的应用难点和解决办法,并与其他可信计算技术进行了对比.最后,探讨了SGX技术在可信计算领域的发展方向.