59897458
Algorithms and qos of video streaming over wireless networks
Video streaming over wireless networks has attracted much attention recently. It is well known that video streaming is QoS Stringent applications and wireless link suffers from erroneous and time-variant conditions. Significant research work has been conducted on QoS guarantee of video streaming application in Physical, MAC and Network layers. In this dissertation, the author designed a combination of packet ordering algorithm and transmission scheme for streaming video over a single wireless link and a distributed system for streaming video over multi-hop wireless networks, respectively. 
QoS routing has been widely researched and a number of routing protocols have been proposed to support routing of QoS stringent real-time applications. Recently, scalable video coding has been used for adaptation of video streaming to heterogeneous networks, especially wireless networks. The author proposed the routing criteria and routing algorithms for the routing of base layer (BL) and enhancement layer (EL) of MPEG-4 FGS. 
Research on Mobile Ad Hoc networks (MANETS) has been driven by either large scale military applications or specialized civilian applications which are tailored to very specialized missions and cost is typically not a main issue. Wireless mesh networks (WMN) meet the demand of a limited number of people wanting to form an ad hoc network for sharing information. In wireless mesh networks, Peer-to-Peer (P2P) video streaming service request generally can be satisfied by more than one video server. WMN P2P video streaming service can be modeled by K-server problem. Competitive work function algorithm is running in the distributed manner and is robust to the update message loss. Modified work function algorithm is proposed for P2P video streaming service over congested WMN. And the author conjectured that the modified work function algorithm is still competitive.
27793638
Wiener Indices of Balanced Binary Trees
We study a new family of trees for computation of the Wiener indices. We introduce general tree transformations and derive formulas for computing the Wiener indices when a tree is modified. We present several algorithms to explore the Wiener indices of our family of trees. The experiments support new conjectures about the Wiener indices.
18424476
Proving theorems by pattern recognition I
Certain preliminary results on doing mathematics by machines (“mechanical mathematics”) were reported in an earlier paper [20]. The writer suggested developing inferential analysis as a branch of applied logic and as a sister discipline of numerical analysis. This analogy rests on the basic distinction of pure existence proofs, elegant procedures which in theory always terminate, and efficient procedures which are more complex to describe but can more feasibly be carried out in practice. In contrast with pure logic, the chief emphasis of inferential analysis is on the efficiency of algorithms, which is usually attained by paying a great deal more attention to the detailed structures of the problems and their solutions, to take advantage of possible systematic short cuts. The possibilities of much more elaborate calculations by machines provide an incentive to studying a group of rather minute questions which were formerly regarded as of small theoretical interest. When the range of actual human computation was narrow, there seemed little point in obtaining faster procedures which were still far beyond what was feasible. Furthermore, on account of the versatility of machines, it now appears that as more progress is made, strategies in the search for proofs, or what are often called heuristic methods, will also gradually become part of the subject matter of inferential analysis. An analogous situation in numerical analysis would be, for example, to make the machine choose to apply different tricks such as taking the Fourier transform to obtain a solution of some differential equation.
7283306
A Fair Item-Item Exchange Protocol Satisfying Newly Introduced Requirements
Many protocols are designed to guarantee fairness in electronic exchange that is widely used in e-commerce and e-government systems. In spite of the cryptographic view, we tend to view the fairness problem in a more complete vision. First we present a renewed set of requirement definitions for fair protocols. Second we study the encrypted item validation problem and present a simple and effective solution. With these preliminary discussions, we present our new item-item exchange protocol that is the first one to satisfy those newly introduced requirements
8487669
An SMR based advance resource reservation scheme for combined mobility and QoS Provisioning
One of the major problems of deploying RSVP in the mobile environment is called the advance resource reservation problem. If an RSVP reservation path is reserved in advance in the subnet that a mobile node will visit, the mobile node can continue its QoS session smoothly when it hands over to that subnet. However, if too many network resources are used for advance reservation, new QoS sessions originating from that subnet will experience a higher probability of being blocked needlessly. In this paper, we propose a new advance resource reservation scheme that properly constrains the amount of advance reservations in a subnet and only allows the mobile nodes with large value of session-to-mobility ratio (SMR) to make advance reservation. We evaluate the proposed scheme and the results show that our scheme can effectively reduce both active and passive reservation blocking probabilities and achieves a better utilisation of the network resources, especially when the traffic intensity is high.
6016307
Research and Implementation of Knowledge-Enhanced Information Services
Information isolation has been identified as a big challenge in IT Service Management (ITSM). Existing ITSM practices mostly rely on configuration information and are geared towards individual applications and processes. However, information available in complicated IT infrastructure goes beyond data from the configuration management domain. How to efficiently extract and integrate the hidden knowledge from a wide variety of information sources is a major pain point for ITSM. In this paper, a threading strategy (TS) with KPI mark and knowledge-enhanced information services is proposed to improve ITSM quality. The essential contribution of this work is to organize the highly complex IT service information with KPI mark and to build a knowledge repository for accumulateing and reusing experts' knowledge. In addition, a prototype called BIANCHIN is implemented to explore this knowledge-enhanced information services framework. Finally, a real business application of Cisco VoIP system is used as a case study for evaluating the effectiveness and efficiency of the knowledge-enhanced information services framework.
32406655
A Parallel Algorithm for Learning Bayesian Networks
Computing the expected statistics is the main bottleneck in learning Bayesian networks in large-scale problem domains. This paper presents a parallel learning algorithm, PL-SEM, for learning Bayesian networks, based on an existing structural EM algorithm (SEM). Since the computation of the expected statistics is in the parametric learning part of the SEM algorithm, PLSEM exploits a parallel EM algorithm to compute the expected statistics. The parallel EM algorithm parallelizes the E-step and M-step. At the E-step, PLSEM parallel computes the expected statistics of each sample; and at the M-step, with the conditional independence of Bayesian networks and the expected statistics computed at the E-step, PL-SEM exploits the decomposition property of the likelihood function under the completed data to parallel estimate each local likelihood function. PL-SEM effectively computes the expected statistics, and greatly reduces the time complexity of learning Bayesian networks.