2177063
A New Lightweight and Scalable Encryption Algorithm for Streaming Video over Wireless Networks
A process for improving the stability of a cadmium chalcogenide/copper chalcogenide photovoltaic cell is disclosed. The improvement comprises positioning a layer of a polymer composition containing electrically conductive particles between the copper chalcogenide layer and the metal electrode such that the metal electrode does not make physical contact with the copper chalcogenide layer.
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.
6306890
APPLE: A Novel P2P Based e-Learning Environment
With the rapid development of information technology, dramatic changes have been taken place in the fundamental ways that people acquire and disseminate knowledge. Various e-Learning systems have been designed to help people take full advantage of the benefit brought by the technology. The newly emerged Peer to Peer (P2P) and grid computing will serve as the key driven forces to bring revolutionary impact on the future society. This paper evaluates the potential contribution of the P2P and grid technology into the e-Learning system and introduces a novel P2P based e-Learning environment, called APPLE. With the help of Gnutella-like P2P network, APPLE provides live broadcasting services to share services of education resources. We build a virtual classroom service based on WSRF.NET, which exposes the service as a grid service that could be accessed by all the users among the grid.
10224186
Bandwidth Selection and Reconstruction Quality in Point-Based Surfaces
We investigate the influence of bandwidth selection in the reconstruction quality of point-based surfaces. While the problem has received relatively little attention in the literature, we show that appropriate selection plays a significant role in the quality of reconstructed surfaces. We show how to compute optimal bandwidths for one class of moving least-squares surfaces by formulating the polynomial fitting step as a kernel regression problem for both noiseless and noisy data. In the context of Levin's projection, we also discuss the implications of the two-step projection for bandwidth selection. We show experimental comparisons of our method, which outperforms heuristically chosen functions and weights previously proposed. We also show the influence of bandwidth on the reconstruction quality of different formulations of point-based surfaces. We provide, to the best of our knowledge, the first quantitative comparisons between different MLS surface formulations and their optimal bandwidths. Using these experiments, we investigate the choice of effective bandwidths for these alternative formulations. We conclude with a discussion of how to effectively compare the different MLS formulations in the literature.
10702245
A wireless LAN-based indoor positioning technology
Context-aware computing is an emerging computing paradigm that can provide new or improved services by exploiting user context information. In this paper, we present a wireless-local-area-network-based (WLAN-based) indoor positioning technology. The wireless device deploys a position-determination model to gather location information from collected WLAN signals. A model-based signal distribution training scheme is proposed to trade off the accuracy of signal distribution and training workload. A tracking-assistant positioning algorithm is presented to employ knowledge of the area topology to assist the procedure of position determination. We have set up a positioning system at the IBM China Research Laboratory. Our experimental results indicate an accuracy of 2 m with a 90% probability for static devices and, for moving (walking) devices, an accuracy of 5 m with a 90% probability. Moreover, the complexity of the training procedure is greatly reduced compared with other positioning algorithms.
42170888
LVQ Based Distributed Video Coding with LDPC in Pixel Domain
Presently, distributed source coding (DSC) and distributed video coding (DVC) are given high attention in sensor network and other multimedia transmission. That is due to their contribution to easy encoding and robust multimedia communication. In this paper, we propose a new DVC framework where two LVQ (lattice vector quantization) and a rate-variable LDPC (low-density parity-check) are exploited. In both LVQ and LDPC, we use the interpolated from decoded frames as side information to help coding. Because of LVQ's exploitation to dependence of source and the better error-correcting capacity of LDPC, our system achieves more than 1 dB improvement in PSNR than the referenced. Meanwhile, the property of low-complexity encoding is still preserved.
10510054
Words in the History of a Turing Machine with a Fixed Input
The usual decision (halting or printing) problems for Turing machines (T.M.) are relative to an infinite class of them or an infinite class of inputs or1 a single T.M. We consider now a new type of problem (the consequence problem) con-neeted with a single input on a single T.M. It is known that in a definite sense everything which an erasing T.3{. can do can also be done by a nonerasing T.M., e.g., the halting problem is undeeidable in both bases. It turns out that for the consequence problem erasing does make an essential difference: decidable without erasing, but undecidable Mth erasing. From the undeeidability of the consequence problem for a T.M., it also follows that the same problem is undeeidable for certain simple monogenie normal systems. Consider a fixed finite alphabet A including a symbol b for the blank squares on a tape. For definiteness, we may assume that A = {b, ,, a}. Assume some familiar formulation of Turing machines. Definition. The word at any moment t in the history of a T.M. is the string consisting of the contents of the squares in the minimum block on the tape at t that includes all the marked squares and the square scanned at the initial moment (the origin). THEOREM 1. For arty fixed (finite) word at the initial moment, we can find a T.M. such that the set of words in its subsequent history is not ~cursive. Ullian shows [1] that there exists some nonrecursive but recursively enumerable set S such that there is a general recursive function f such that S = {f(0), f(f(O)), f(f(f(O))),-.. }. We can now give a T.M. which first erases the finitely many marks on the initial tape and returns to the origin, then it puts down the representation of 0 on tape, calculates the value of f(0), erasing everything else except the representation of f(0), calculates f2(0). In particular, we can do it in such a way that the symbol a is used, after the initial tape content is erased, only to mark f(0), f2(0), etc; it is erased before we evaluate f(f (0)) from f(0). Moreover, the string of a followed by the representation of f(0) always begins at the origin. Clearly the set of words in the history of this T.M. cannot be recursive because otherwise the set S would be recursive, whether a 'gd(0) ' belongs to the …