政府网站运行的安全性问题研究

本文以政府部门计算机网络和网站在运行中碰到的安全问题,阐述了如何建设相对安全的网控中心,并对因特网上发布信息的网站所受到的各种攻击作出了说明,以及如何采用各种技术方法和措施填补漏洞、防范攻击,保障网站安全。     

Visual comparability of 3D regular sampling and reconstruction

The Body-Centered Cubic (BCC) and Face-Centered Cubic (FCC) lattices have been analytically shown to be more efficient sampling lattices than the traditional Cartesian Cubic (CC) lattice, but there has been no estimate of their visual comparability. Two perceptual studies (each with N = 12 participants) compared the visual quality of images rendered from BCC and FCC lattices to images rendered from the CC lattice. Images were generated from two signals: the commonly used Marschner-Lobb synthetic function and a computed tomography scan of a fish tail. Observers found that BCC and FCC could produce images of comparable visual quality to CC, using 30-35 percent fewer samples. For the images used in our studies, the L(2) error metric shows high correlation with the judgement of human observers. Using the L(2) metric as a proxy, the results of the experiments appear to extend across a wide range of images and parameter choices.     

Side-effect localization for lazy, purely functional languages via aspects

Many side-effecting programming activities, such as profiling and tracing, can be formulated as crosscutting concerns and be framed as side-effecting aspects in the aspect-oriented programming paradigm. The benefit gained from this separation of concerns is particularly evident in purely functional programming, as adding such aspects using techniques such as monadification will generally lead to crosscutting changes. This paper presents an approach to provide side-effecting aspects for lazy purely functional languages in a user transparent fashion. We propose a simple yet direct state manipulation construct for developing side-effecting aspects and devise a systematic monadification scheme to translate the woven code to monadic style purely functional code. Furthermore, we present a static and dynamic semantics of the aspect programs and reason about the correctness of our monadification scheme with respect to them.     

ADAPTIVE RANKS CLONE AND k‐NEAREST NEIGHBOR LIST–BASED IMMUNE MULTI‐OBJECTIVE OPTIMIZATION

Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The AIS‐based algorithms typically exploit the immune system's characteristics of learning and adaptability to solve some complicated problems. Although, several AIS‐based algorithms have proposed to solve multi‐objective optimization problems (MOPs), little focus have been placed on the issues that adaptively use the online discovered solutions. Here, we proposed an adaptive selection scheme and an adaptive ranks clone scheme by the online discovered solutions in different ranks. Accordingly, the dynamic information of the online antibody population is efficiently exploited, which is beneficial to the search process. Furthermore, it has been widely approved that one‐off deletion could not obtain excellent diversity in the final population; therefore, a k‐nearest neighbor list (where k is the number of objectives) is established and maintained to eliminate the solutions in the archive population. The k‐nearest neighbors of each antibody are founded and stored in a list memory. Once an antibody with minimal product of k‐nearest neighbors is deleted, the neighborhood relations of the remaining antibodies in the list memory are updated. Finally, the proposed algorithm is tested on 10 well‐known and frequently used multi‐objective problems and two many‐objective problems with 4, 6, and 8 objectives. Compared with five other state‐of‐the‐art multi‐objective algorithms, namely NSGA‐II, SPEA2, IBEA, HYPE, and NNIA, our method achieves comparable results in terms of convergence, diversity metrics, and computational time.     

A novel digital filter structure with minimum roundoff noise

In this paper, a novel structure is derived for efficient implementation of digital filters as well as minimizing the finite word length (FWL) errors. Such a structure is actually an improved version of that reported previously. The performance of this new structure and the famous normalized lattice structure are analyzed by deriving the corresponding expression for the roundoff noise gain. Design examples are presented to illustrate the behavior of the proposed structure and to compare it with some existing ones. It is shown that the proposed structure outperforms the others in terms of minimizing roundoff noise as well as implementation efficiency.     

A comparative study of two techniques for improving power‐handling capability of CMOS T/R switches

This article proposes an asymmetric topology for transmit/receive (T/R) switches and more importantly presents a comparative study of both LC‐tuned and resistive body‐floating techniques for improving the power‐handling capability of the T/R switches in the same 0.18‐μm triple‐well CMOS. It is shown from simulations and measurements that the switches adopting either technique achieve comparable performances. For instance, the switch employing the LC‐tuned body‐floating technique exhibits insertion loss of 1.5 dB, isolation of 23.5 dB, and power‐handling capability of 22.5 dBm at 5.2 GHz, whereas the switch using the resistive body‐floating technique exhibits insertion loss of 1.3 dB, isolation of 24 dB, and power‐handling capability of 22.2 dBm, respectively. Therefore, one can conclude that the asymmetric topology with the resistive body‐floating technique is more suitable for designing T/R switches for wireless local area network applications as it consumes smaller silicon area. © 2010 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2010.     

A hybrid trust‐enhanced collaborative filtering recommendation approach for personalized government‐to‐business e‐services

The information overload on the World Wide Web results in the underuse of some existing e‐government services within the business domain. Small‐to‐medium businesses (SMBs), in particular, are seeking “one‐to‐one'' e‐services from government in current highly competitive markets, and there is an imperative need to develop Web personalization techniques to provide business users with information and services specific to their needs, rather than an undifferentiated mass of information. This paper focuses on how e‐governments can support businesses on the problem of selecting a trustworthy business partner to perform reliable business transactions. In the business partner selection process, trust or reputation information is crucial and has significant influence on a business user's decision regarding whether or not to do business with other business entities. For this purpose, an intelligent trust‐enhanced recommendation approach to provide personalized government‐to‐business (G2B) e‐services, and in particular, business partner recommendation e‐services for SMBs is proposed. Accordingly, in this paper, we develop (1) an implicit trust filtering recommendation approach and (2) an enhanced user‐based collaborative filtering (CF) recommendation approach. To further exploit the advantages of the two proposed approaches, we develop (3) a hybrid trust‐enhanced CF recommendation approach (TeCF) that integrates both the proposed implicit trust filtering and the enhanced user‐based CF recommendation approaches. Empirical results demonstrate the effectiveness of the proposed approaches, especially the hybrid TeCF recommendation approach in terms of improving accuracy, as well as in dealing with very sparse data sets and cold‐start users. © 2011 Wiley Periodicals, Inc.     

Damage assessment and repair in attack resilient distributed database systems

Preventive measures sometimes fail to defect malicious attacks. With attacks on data-intensive applications becoming an ever more serious threat, intrusion tolerant database systems are a significant concern. The main objective of such systems is to detect attacks, and to assess and repair the damage in a timely manner. This paper focuses on efficient damage assessment and repair in distributed database systems. The complexity caused by data partition, distributed transaction processing, and failures makes intrusion recovery much more challenging than in centralized database systems. This paper identifies the key challenges and presents an efficient algorithm for distributed damage assessment and repair.     

端到端冗余流量消除技术的指纹选择算法研究

为了兼顾服务器端的内存消耗和有效性,在分析了现有端到端冗余流量消除技术中的指纹选择算法后,提出了贪婪指纹选择算法。该算法认为两个数据包中相同片段的邻接片段很有可能也是相同的,基于这一原理,邻接片段的指纹也将被选为代表指纹,有效地避免了在服务器端缓存整个数据包,大大减少了服务器端的内存消耗。仿真实验结果表明,该算法与现有的指纹选择算法相比,能够大大减少服务器端和用户终端的内存消耗,同时冗余消除率在10%-50%之间,与现有算法相近,证明了该算法的有效性。