继往开来的FLEX^TM高速寻呼编码规程

纵观世界无线寻呼现状,现已建立起来的无线寻呼台采用的编码格式多数为POSCAG码,速率一般为1200bps.随着经济的发展,人们对通信的需求迅速增长,各寻呼台在进行系统扩容时都受到无线寻呼信道容量的限制,因为无线频率资源十分有限,不可能无限制地增加无线寻呼信道数来增加系统的用户容量.另外,实验证明:提高数据的传输速率也行不通.当把POSCAG的传输速率从1200bps提高到2400bps时,传输误码率等技术指标达不到有关技术要求,因此扩大     

高效无线寻呼编码器的研制

介绍了无线寻呼系统的ＰＯＣＳＡＧ编码和应用ＭＣＳ ５１单片机研制高效无线寻呼编码器的硬件框图和软件设计,比较了高效无线寻呼编码器与普通无线寻呼编码器的区别,并给出实际应用效果。     

基于WAP的无线寻呼软件

随着Ｉｎｔｅｒｎｅｔ的不断发展和壮大,许多应用程序都正在移植到Ｉｎｔｅｒｎｅｔ上,ＷＡＰ规范定义了一个开放的标准结构和一套用来实现无线Ｉｎｔｅｒｎｅｔ接入的协议,本文详细探讨了基于Ｉｎｔｅｒｅｎｔ的无线寻呼软件的实现方案,采用了ＷＡＰ应用模型,可对ＷＡＰ与ＷＥＢ服务器之间的数据过滤,实现了网络数据库操作及网上寻呼的软件开发过程。     

高速寻呼技术

本文从编码格式，寻呼编码特性以及寻呼系统结构三方面对当今比较先进的高速编码方案ＦＬＥＸ码、     

用BP机实现无线寻呼漫游报警

本文介绍的报警方式必须得到当地无线电管制委员会的批准方可。本文所介绍的BP机寻呼报警器,以现在流行的各种类型的中文寻呼机、数字机作为报警信号接收器,通过另设的编码电路及发射电路,把报警信号直接发送给用户的BP机,构成一个无线报警台,报警时可以完全脱离电话寻呼台。这种报警器的使用方法与普通的报警电铃、报警蜂鸣器一样,只要接通电源,在远处的BP机就会响,同时显示“999999999”。因此用它可直接替代任何报警设备的电铃、蜂鸣器等终端报警器,从而升级为BP机无线双向漫游报警器。同时它是通过无线直接发射BP机POCSAG码的,可实现报警点与监视点的双向漫游,因此尤为适合汽车、摩托车等移动物体的被盗报警。     

中文／数字无线寻呼系统

本文阐述了在ＮＯＶＥＬＬ网络环境下开发的中文／数字无线寻呼系统的硬件配置、软件的功能设计和系统的工作原理．     

Web应用程序分页策略的研究

研究了在Web应用程序中被广泛使用的分页技术,介绍了3种常用的分页模型,利用计算页面被访问的概率密度的方法对这3种分页模型进行了分析。在此基础上讨论了动态建它合适的分页策略的方法。将该方法应用于实际系统的分页框架中,取得了良好效果。该框架可以灵活地定制不同的分页策略。     

Displaytag分页常见问题解决方案

Displaytag是一个常用的提供高水平Web页面表格显示的开源软件,适合MVC模式。其功能丰富、实现简单。本文针对Displaytag大数据量分页和带中文查询条件的分页中出现的问题给出解决方案。     

利用ASP实现数据库内容分页显示

利用ASP内置组件AD0的两个对象Connection和Recordset及该两个对象的属性和方法实现数据库内容在Web网页上的分页显示。     

Paging with Request Sets

A generalized paging problem is considered. Each request is expressed as a set of u pages. In order to satisfy the request, at least one of these pages must be in the cache. Therefore, on a page fault, the algorithm must load into the cache at least one page out of the u pages given in the request. The problem arises in systems in which requests can be serviced by various utilities (e.g., a request for a data that lies in various web-pages) and a single utility can service many requests (e.g., a web-page containing various data). The server has the freedom to select the utility that will service the next request and hopefully additional requests in the future. The case u=1 is simply the classical paging problem, which is known to be polynomially solvable. We show that for any u>1 the offline problem is NP-hard and hard to approximate if the cache size k is part of the input, but solvable in polynomial time for constant values of k. We consider mainly online algorithms, and design competitive algorithms for arbitrary values of k, u. We study in more detail the cases where u and k are small. We also give an algorithm which uses resource augmentation and which is asymptotically optimal for u=2. A preliminary version of this paper appeared in Proc. Scandinavian Workshop on Algorithm Theory (SWAT 2006), pp. 124–135, 2006. Research of R. van Stee supported by Alexander von Humboldt Foundation.     

Competitive Analysis of the LRFU Paging Algorithm

   Abstract. We present a competitive analysis of the LRFU paging algorithm, a hybrid of the LRU (Least Recently Used) and LFU (Least Frequently Used) paging algorithms. We show that the competitive ratio of LRFU is k +

On-Line Multi-Threaded Paging

Abstract. In this paper we introduce a generalization of Paging to the case where there are many threads of requests. This models situations in which the requests come from more than one independent source. Hence, apart from deciding how to serve a request, at each stage it is necessary to decide which request to serve among several possibilities. Four different on-line problems arise depending on whether we consider fairness restrictions or not, with finite or infinite input sequences. We study all of them, proving lower and upper bounds for the competitiveness of on-line algorithms. The main competitiveness results presented in this paper state that when no fairness restrictions are imposed it is possible to obtain competitive algorithms for finite and infinite inputs. On the other hand, for the fair case in general there exist no competitive algorithms. In addition, we consider three definitions of competitiveness for infinite inputs. One of them forces algorithms to behave efficiently at every finite stage, while the other two aim at comparing the algorithms' steady-state performances. A priori, the three definitions seem different. We study them and find, however, that they are essentially equivalent. This suggests that the competitiveness results that we obtain reflect the intrinsic difficulty of the problem and are not a consequence of a too strict definition of competitiveness.     

采用ASP技术的网上无线寻呼软件

随着 Ｉｎｔｅｒｎｅｔ的不断发展和壮大,许多应用程序都正在移植到 Ｗｏｒｌｄ Ｗｉｄｅ Ｗｅｂ上。文章详细探讨了基于 Ｉｎ－ｔｅｒｎｅｔ的无线寻呼系统的实现方案。并以ＡＳＰ作为主要支持技术,实现了利用ＡＳＰ进行数据库操作及开发网上寻呼的软件开发过程。     

Word文档按指定页数分页保存方法

将Word文档分页保存的方式多种多样,人工操作劳动强度大。利用VBA语言,建立通用的分页过程“Subfenye0”,通过亲切的人机对话界面读取指定的要求。按指定的要求调用“Subfenye0”,可以将Word文档按指定页数自动分页保存,减轻工作强度。     

利用SQL Server存储过程实现数据分页

随着信息化建设的快速发展,利用C#.NET技术开发Winform程序越来越广泛,大容量的数据库记录的访问和显示一直为开发人员所关注.针对这一问题,讨论了利用SQL server数据库的存储过程来实现分页的方法.