基于频繁链表-存取树的Web用户浏览模式挖掘算法

为了观察网络用户浏览行为以研究用户偏爱的浏览模式集和个人兴趣,本文采用频繁链表结合存取树的增量式结构,使用捕获的网络用户浏览轨迹构建、更新该结构并使用同类合并的思想挖掘该结构以获得用户偏爱浏览模式集。实验通过对比本算法与GSP算法在同一测试集上的更新和挖掘情况,证明本算法在准确度和效率上都大幅领先。同时,该算法也为后续的长期观察研究提供了理论基础。     

基于大数据的网页浏览质差分析方法研究

传统的网络运维往往聚焦网络和设备的运行状态，难以解决用户主观感知问题，迫切需要建立一套端到端互联网应用感知管理体系。围绕网页浏览的质量分析环节，基于大数据技术研究用户感知数据的质量分析框架和方法，设计提出了一套基于大数据技术的质量分析系统框架，用于实现互联网业务质量分析。以某国际网站为例，提出了“二望五切”诊断法用于定界溯因，提高人工分析效率，验证了所提方法的有效性。     

LTE用户网络浏览感知KQI与无线侧KPI关联分析

文章主要针对中国电信LTE用户网页浏览感知KQI和无线侧KPI之间进行相关性分析,得到二者之间的关联,以达到后期通过优化对应KPI能快速提升KQI的目的。     

WebExpress: A client/intercept based system for optimizing Web browsing in a wireless environment

This paper describes an application model and software technology that makes it possible to run World Wide Web applications in wide area wireless networks. Web technology in conjunction with today's mobile devices (e.g., laptops, notebooks, personal digital assistants) and the emerging wireless technologies (e.g., digital cellular, packet radio, CDPD) offer the potential for unprecedented access to data and applications by mobile workers. Yet, the limited bandwidth, high latency, high cost, and poor reliability of today's wireless wide-area networks greatly inhibits (to the point of infeasibility) supporting such applications over wireless networks. This paper presents the Client/Intercept computational model that makes it possible to run such distributed applications efficiently in wide area wireless networks. Furthermore, it presents WebExpress, a client/intercept based system for optimizing Web browsing, that reduces data volume and latency of wireless communications by intercepting the HTTP data stream and performing various optimizations including: file caching, forms differencing, protocol reduction, and the elimination of redundant HTTP header transmission. This paper describes these optimizations and presents some experimental results. This revised version was published online in June 2006 with corrections to the Cover Date.     

On the uniqueness and existence of iterative solutions of certain circuit analysis problems

A few basic facts regarding the analysis of a certain class of circuit problems are discussed. Some bounds on the existence of an iterative solution are presented via contraction mapping. The analysis of a simple differential amplifier is used as an example.     

OpenWebServer: an adaptive Web server using software patterns

The explosive growth of the Web requires servers to be extensible and configurable. This article describes our adaptive Web server, OpenWebServer, which uses the Reflection architectural pattern. The server supports the dynamic adoption of functionality, such as introducing additional protocols, modifying execution policies, and tuning system performance. This is achieved by specifying and coordinating metaobjects that represent various aspects within the Web server. We present a Java version of OpenWebServer, and describe its design using Reflection and other design patterns: Singleton, Bridge, Mediator, Observer, and Decorator. These patterns provide a better-factored design and allow the Web server to evolve continually beyond static and monolithic servers     

WWW上网流量模型的建立及其实证研究

本文介绍了WWW流量模型的建立方法和过程,得到了WWW流量模型的数学表达式,并通过实例对该模型进行了验证.     

Retrieval and browsing of spoken content

Ever-increasing computing power and connectivity bandwidth, together with falling storage costs, are resulting in an overwhelming amount of data of various types being produced, exchanged, and stored. Consequently, information search and retrieval has emerged as a key application area. Text-based search is the most active area, with applications that range from Web and local network search to searching for personal information residing on one's own hard-drive. Speech search has received less attention perhaps because large collections of spoken material have previously not been available. However, with cheaper storage and increased broadband access, there has been a subsequent increase in the availability of online spoken audio content such as news broadcasts, podcasts, and academic lectures. A variety of personal and commercial uses also exist. As data availability increases, the lack of adequate technology for processing spoken documents becomes the limiting factor to large-scale access to spoken content. In this article, we strive to discuss the technical issues involved in the development of information retrieval systems for spoken audio documents, concentrating on the issue of handling the errorful or incomplete output provided by ASR systems. We focus on the usage case where a user enters search terms into a search engine and is returned a collection of spoken document hits.     

On an existence and uniqueness theory for nonlinear differential-algebraic equations

An existence and uniqueness theory is developed for general nonlinear and nonautonomous differential-algebraic equations (DAEs) by exploiting their underlying differential-geometric structure. A DAE is called regular if there is a unique nonautonomous vector field such that the solutions of the DAE and the solutions of the vector field are in one-to-one correspondence. Sufficient conditions for regularity of a DAE are derived in terms of constrained manifolds. Based on this differential-geometric characterization, existence and uniqueness results are stated for regular DAEs. Furthermore, our notions are compared with techniques frequently used in the literature such as index and solvability. The results are illustrated in detail by means of a simple circuit example.     

On uniqueness Theorems for Tsallis entropy and Tsallis relative entropy

The uniqueness theorem for Tsallis entropy was presented in H. Suyari, IEEE Trans. Inf. Theory, vol. 50, pp. 1783-1787, Aug. 2004 by introducing the generalized Shannon-Khinchin axiom. In the present correspondence, this result is generalized and simplified as follows: Generalization : The uniqueness theorem for Tsallis relative entropy is shown by means of the generalized Hobson's axiom. Simplification: The uniqueness theorem for Tsallis entropy is shown by means of the generalized Faddeev's axiom     

On the existence and uniqueness of solutions for implicit linear systems on finite interval

In the present paper we study the problem of the existence and uniqueness of solutions of implicit systems considered on a finite interval of time. We consider two kinds of existence problems: input-acceptance and input-acceptance when the boundary conditions of a corresponding trajectory are set to zero, and two kinds of uniqueness problems: output uniqueness and output uniqueness when the boundary conditions of the corresponding trajectory are unknown. Geometric conditions for all of these notions are given, and the duality of these notions is studied.This research was supported by NSF Grant ECS-8805932.     

基于Struts的Web系统中设计模式的应用

Struts框架方便了中小型Web程序的开发。在Struts框架下应用Business Proxy,DAO等模式,实现了Web系统中表现层、逻辑层、数据持久层之间的松耦合,不仅使业务逻辑更加清晰,还使系统具有结构合理,易于开发、复用和维护的特点。结合项目实例对Struts的原理进行了分析,重点介绍了工厂方法,Business Proxy,DAO等模式的特点及基本构造,并对这些模式在实际应用中遇到的问题提出了具体的解决办法。     

On management technologies and the potential of Web services

From the early days of management research and standardization in the late 1980's, there has always been a quest for a management technology that would be general enough to be used for network, system, service, and distributed application management; efficient in terms of information retrieval time, computational resources required, and management traffic incurred; and easy to use in order to reduce development time and operational costs. From protocol-based approaches such as OSI management and SNMP, attention shifted to distributed object and Web-based approaches. Recently, XML-based approaches and, in particular, Web services have been emerging as a promising Internet-based technology that might also be used for management. In this article we survey first the key aspects of protocol and distributed object approaches to management. We subsequently examine Web services as a distributed object approach to management, and consider its suitability, usability, and performance in comparison to SNMP and CORBA.     

On optimum time-hopping patterns

Time-hopping patterns can be constructed from simple difference sets. By studying such constructions, it has been proven that whenever n-2, n-1, or n+1 is a prime power, then time-hopping patterns that have n terms can be constructed and are of length less than n². By computation it is shown that such patterns can have length less than n²-n^1.44 for all n⩽150. It is also shown that time-hopping patterns for n terms can have length less than n²+O(n^1.55) for all n     

视频故事结构的描述与浏览

提出了对视频故事结构的描述与浏览方法。通过改进的视频分段算法寻找视频镜头边界,实现对连续视频流的有意义切分。提出了基于内容相关性与相似性的优化匹配算法,实现了从一维视频流到二维视频故事结构的描述。通过把视频故事结构表达为故事板和时序结构图,实现了对视频内容的概要性浏览。     

论高校基于web的网络教学平台建设

随着现代信息技术的发展,使得基于Web技术的网络教学成为现代教育技术改革与发展的方向。本文分析了网络教学平台的技术特点,主要针对基于Web技术的网络多媒体教学平台的设计思路以及主要技术的实现方法进行了一些探讨。     

On the radiation patterns of parasitic loop counterpoise antennas

The radiation properties of parasitic loop counterpoise antennas are investigated in detail. It is found that the parasitic loop concept can be used advantageously to reduce considerably the undesirable effects produced in loop counterpoise antenna patterns due to the counterpoise edge diffraction effects. Results of extensive numerical and experimental investigation of various aspects of the parasitic loop counterpoise antenna patterns are reported. The method of design of such antennas is also discussed. Three such new antennas are proposed which appear to be capable of bringing out superior performance from the present-day VOR system.     

On the recognition of time-varying patterns using learning procedures

Some recognizers for stochastic time-varying patterns with additive noise are studied. As in binary communication channels with fading, it is supposed that the fluctuation of a pattern (or signal) may be approximated by a stationary Gaussian autoregressive process with known parameters. Each measurement belongs to either of two classes: the pattern plus noise or noise alone. Under these assumptions, optimum dichotomizers with supervized learning are discussed. To the nonsupervised problems, the decision-directed approach and the modified-decision-directed approach are applied. Also some experimental results are presented.