STM32F207和DM9161A的以太网实现方案

电力抄表系统常通过网络采集和传输电网中的谐波等信息。本文提出了一种适合电力系统的网络设计方案。在STM32F207和DM9161A为核心的硬件平台上,完成了LwIP协议栈的移植,实现了远程终端和上位机通信。使电力系统更具实时性与交互性,并保证了通信的可靠性。     

OMAPL138和FPGA的合并单元设计方案

提出了一种基于ARM9+DSP双核处理器OMAPL-138和FPGA的合并单元设计方案。给出了该方案的原理框图,以及具体的程序流程图,并在CCS开发环境下完成了软件编程,实现了合并单元按照IEC61850标准规定的格式进行数字量以太网传输。实验结果证明了该设计方案的可行性与正确性,为合并单元的设计提供了一种新的思路。     

TMS320DM6467的视频转码监控系统设计

提出基于嵌入式Web服务器Boa和CGI技术的网络通信思想,以VPC6467视频转码系统为硬件平台,基于嵌入式Linux操作系统的编译开发环境,设计了视频转码设备的监控系统.详述了虚拟共享内存的进程通信机制、HTML页面与服务器通信的CGI技术、Linux系统交叉编译环境的搭建,以及监控系统各个模块的设计思想.     

基于Nios Ⅱ的CCD采集系统的设计

设计了一种在NiosⅡ处理器上的CCD数据采集系统。电荷耦合器件（Charge—Coupled Device,CCD）采集到的信号经过前端的差分运放处理后再进行A／D转换,转换后的数据存储于外部SDRAM中,被读取后显示在LCD上。本文重点介绍了各器件的电路设计和驱动程序的编写。实践表明,该设计成本低,实时性较高。     

我国公安机关网络舆论引导浅析

本文通过分析网络舆论的形成和特点,我国公安机关网络舆论引导工作存在的不足,提出了加强公安机关网络舆论引导的途径。     

On the backstepping design procedure for multiple input nonlinear systems

In a recent paper, we developed a structural decomposition for multiple input multiple output nonlinear systems that are affine in control but otherwise general. In this paper, we exploit the structural properties of such a decomposition in the application of the backstepping design technique on multiple input nonlinear systems. In particular, this decomposition simplifies the conventional backstepping design and motivates new backstepping design procedures that are able to stabilize systems on which the conventional backstepping procedure is not applicable. Copyright © 2011 John Wiley & Sons, Ltd.     

Roll‐to‐roll UV embossing process applied for light bar‐based sub‐wavelength gratings for backlight

This study proposes a roll‐to‐roll process‐based sub‐wavelength grating, which is attached on a light bar to turn the side‐lit red/green/blue (620, 520, and 450 nm) incident rays into a uniformly and normally output white light with high illuminance from the light bar's surface. On the basis of the rigorous coupling wave analysis, the relationship between the first‐order transmission/reflection efficiency and the pitch of the gratings with different shapes was analyzed. The optimal design can effectively reduce the coupling length and enhance the white color balance for display applications.     

Fast full‐color reflective display via photoluminescent enhancement

Reflective displays are advantageous in applications requiring low power or daylight readability. However, there are no low‐cost reflective technologies capable of displaying bright colors. By employing photoluminescence to more efficiently use ambient light, we created a prototype display that provides bright, full color in a simple, low‐cost architecture. This prototype includes a novel electrokinetic shutter, a layer that incorporates patterned luminescent red, green, and blue sub‐pixel elements, and a novel optical out‐coupling scheme. The luminescent elements convert otherwise‐wasted portions of the incident spectrum to light in the desired color band, resulting in improved color saturation and lightness. This prototype provides a color gamut that is superior to competing reflective display technologies that utilize color filters in single‐layer side‐by‐side sub‐pixel architectures. The current prototype is capable of switching in <0.5 s; future displays based on an alternative electro‐optic shutter technology should achieve video rate operation. A transflective version of this technology has also been prototyped. The transflective version utilizes its backlight with a power efficiency that is at least three times that of a conventional liquid crystal display. These photoluminescence‐based technologies enable a host of applications ranging from low‐power mobile products and retail pricing signage to daylight readable signage for outdoor advertising segments.     

Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks

In this paper, we study the problem of continuous monitoring of reverse k nearest neighbors queries in Euclidean space as well as in spatial networks. Existing techniques are sensitive toward objects and queries movement. For example, the results of a query are to be recomputed whenever the query changes its location. We present a framework for continuous reverse k nearest neighbor (RkNN) queries by assigning each object and query with a safe region such that the expensive recomputation is not required as long as the query and objects remain in their respective safe regions. This significantly improves the computation cost. As a byproduct, our framework also reduces the communication cost in client–server architectures because an object does not report its location to the server unless it leaves its safe region or the server sends a location update request. We also conduct a rigid cost analysis for our Euclidean space RkNN algorithm. We show that our techniques can also be applied to answer bichromatic RkNN queries in Euclidean space as well as in spatial networks. Furthermore, we show that our techniques can be extended for the spatial networks that are represented by directed graphs. The extensive experiments demonstrate that our techniques outperform the existing techniques by an order of magnitude in terms of computation cost and communication cost.     

gbase: an efficient analysis platform for large graphs

Graphs appear in numerous applications including cyber security, the Internet, social networks, protein networks, recommendation systems, citation networks, and many more. Graphs with millions or even billions of nodes and edges are common-place. How to store such large graphs efficiently? What are the core operations/queries on those graph? How to answer the graph queries quickly? We propose Gbase, an efficient analysis platform for large graphs. The key novelties lie in (1) our storage and compression scheme for a parallel, distributed settings and (2) the carefully chosen graph operations and their efficient implementations. We designed and implemented an instance of Gbase using Mapreduce/Hadoop. Gbase provides a parallel indexing mechanism for graph operations that both saves storage space, as well as accelerates query responses. We run numerous experiments on real and synthetic graphs, spanning billions of nodes and edges, and we show that our proposed Gbase is indeed fast, scalable, and nimble, with significant savings in space and time.