机房计费管理系统

机房计费管理系统是针对学校机房或网吧自动计费方面工作而开发的管理软件。系统采用模块化程度设计方法,根据实际的要求,实现机房的自由上机划卡计费管理、后台存储管理、查询管理及用户管理等功能。用户通过相应的模块,对学员库的基本情况进行维护,使机房的收入得到高效管理。机房值班人员只需通过简单的操作即可轻松的管理机房自由上机。从而使得在管理上更具合理性、规范性、科学性、严谨性、透明性,并可减轻工作人员的工作强度,避免重复劳动,提高工作效率。     

视频监控技术在水利信息化中的应用

水利信息化是实现水利现代化的重要手段,视频监控技术在水利信息化建设中发挥着重要的作用。本文首先研究了视频监控中的视频数据采集、编码、传输,以及分析技术,然后阐述了视频监控在水利中的应用。     

基于VQ的说话人识别系统

该文介绍了一种基于矢量量化(VQ)方法的一个说话人识别算法。基于矢量量化的说话人识别,因其运算过程简单等特点,在说话人识别领域有着广泛的应用。用不同语音参数进行实验,实验表明应用矢量量化的方法用在说话人识别中是一种有效方法。     

基于网络型中央控制器的多媒体教室远程管理

网络中控系统通过人性化的人机界面、开放式的可编程控制平台、交互式的控制结构,实现了设备的互连操作和集中控制,它集成了电源管理、视音频切换矩阵、红外遥控、VGA切换矩阵、全数码声音控制、可编程串行通讯、设备IP网络连接等功能,应用到多媒体教学中,不仅有效解决了对设备的管理与信息的切换,也使实现多媒体教室的远程管理成为可能。该文以创捷HT1800中控系统为例,就实现这一技术的原理和方法进行了阐述,便于大家更好地对网络中控系统有一个全面的认识。     

Analysis of image sticking on a real MVA Cell

Abstract— Image‐sticking phenomenon is one of the most important issues affecting LCDs, especially LCD TV. It is known that image sticking is caused by residual DC voltage. An analysis of the cause that induces image sticking on a real LCD cell is very difficult to perform and is rarely reported. In this paper, the impurities that cause boundary image sticking on a real MVA cell was analyzed by examining a cross section of a cell, the bulk LC layer, the vicinity of the LC layer, the LC layer/PI alignment film interface using microanalysis methods such as infrared micro‐spectroscopy (μ‐IR) and micro‐sampling mass spectrometry (μ‐MS). It is clarified that there is quite a bit of aromatic acid at the boundary of the image‐sticking area than in the normal area at the LC/PI alignment film interface on the color‐filter side, not the TFT side, and it is assumed that aromatic carboxylic acid, a negative charged material, is condensed at the LC/PI alignment film interface on the color filter side by an electrically driven DC component inducing an electric‐condenser residual DC voltage.     

A distributed expansible authentication model based on Kerberos

There is a potential server bottleneck problem when the Kerberos model is applied in large-scale networks because the model uses centralized management. To enlarge its application scope, researchers must consider how to build a trust relation among those Kerberos servers located on different isolated domains, but have not provided a way to prevent the potential bottleneck that can occur with Kerberos servers. With the development of across-domain authentication techniques, the local server bottleneck problem has not been alleviated; in fact, it has become more serious.Adopting the rigorous binary tree code algorithm, we present an authentication model based on Kerberos. Compared with similar models, our model has several advantages. First, it overcomes the potential server bottleneck problem and can balance the load automatically. Second, it can process across-domain authentication and enlarge the authentication boundary. Finally, its authentication path is short, with no more than two Kerberos servers being involved when authenticating a user.     

A dynamic bibliometric model for identifying online communities

Predictive modelling of online dynamic user-interaction recordings and community identification from such data becomes more and more important with the widespread use of online communication technologies. Despite of the time-dependent nature of the problem, existing approaches of community identification are based on static or fully observed network connections. Here we present a new, dynamic generative model for the inference of communities from a sequence of temporal events produced through online computer- mediated interactions. The distinctive feature of our approach is that it tries to model the process in a more realistic manner, including an account for possible random temporal delays between the intended connections. The inference of these delays from the data then forms an integral part of our state-clustering methodology, so that the most likely communities are found on the basis of the likely intended connections rather than just the observed ones. We derive a maximum likelihood estimation algorithm for the identification of our model, which turns out to be computationally efficient for the analysis of historical data and it scales linearly with the number of non-zero observed (L + 1)-grams, where L is the Markov memory length. In addition, we also derive an incremental version of the algorithm, which could be used for real-time analysis. Results obtained on both synthetic and real-world data sets demonstrate the approach is flexible and able to reveal novel and insightful structural aspects of online interactions. In particular, the analysis of a full day worth synchronous Internet relay chat participation sequence, reveals the formation of an extremely clear community structure.     

Clustered Chain Path Index for XML Document: Efficiently Processing Branch Queries

Branch query processing is a core operation of XML query processing. In recent years, a number of stack based twig join algorithms have been proposed to process twig queries based on tag stream index. However, in tag stream index, each element is labeled separately without considering the similarity among elements. Besides, algorithms based on tag stream index perform inefficiently on large document. This paper proposes a novel index, named Clustered Chain Path Index, based on a novel labeling scheme. This index provides efficient support for processing branch queries. It also has the same cardinality as 1-index against tree structured XML document. Based on CCPI, efficient algorithms, KMP-Match-Path and Related-Path-Segment-Join, are proposed to process queries efficiently. Analysis and experimental results show that proposed query processing algorithms based on CCPI outperform other algorithms and have good scalability. This paper is partially supported by Natural Science Foundation of Heilongjiang Province, Grant No. zjg03-05 and National Natural Science Foundation of China, Grant No. 60473075 and Key Program of the National Natural Science Foundation of China, Grant No. 60533110.     

Relative importance,specific investment and ownership in interorganizational systems

Implementation and maintenance of interorganizational systems (IOS) require investments by all the participating firms. Compared with intraorganizational systems, however, there are additional uncertainties and risks. This is because the benefits of IOS investment depend not only on a firm’s own decisions, but also on those of its business partners. Without appropriate levels of investment by all the firms participating in an IOS, they cannot reap the full benefits. Drawing upon the literature in institutional economics, we examine IOS ownership as a means to induce value-maximizing noncontractible investments. We model the impact of two factors derived from the theory of incomplete contracts and transaction cost economics: relative importance of investments and specificity of investments. We apply the model to a vendor-managed inventory system (VMI) in a supply chain setting. We show that when the specificity of investments is high, this is a more critical determinant of optimal ownership structure than the relative importance of investments. As technologies used in IOS become increasingly redeployable and reusable, and less specific, the relative importance of investments becomes a dominant factor. We also show that the bargaining mechanism—or the agreed upon approach to splitting the incremental payoffs—that is used affects the relationship between these factors in determining the optimal ownership structure of an IOS.

Quantum programming languages

After giving a bird’s view of some existing quantum programming languages, this paper reports the recent results made by the quantum computation group of the State Key Laboratory for Novel Software Technology and the Department of Computer Science and Technology at Nanjing University, i.e., the quantum programming languages NDQJava, NDQFP and their processing systems.