Last improvements on video codecs, jointly with the use of optimized transport protocols, have brought us to provide IPTV in wireless networks. Moreover, cellular phone users are being accustomed to have all Internet ...
详细信息
Last improvements on video codecs, jointly with the use of optimized transport protocols, have brought us to provide IPTV in wireless networks. Moreover, cellular phone users are being accustomed to have all Internet services in the mobile device, through 3G or WiFi technology, with the same quality of experience (QoE) than in any desktop computer or laptop with broadband Internet connection. In this paper we present a network management algorithm and protocol for ubiquitous networks based on the QoE of the end user. First, we explain the developed protocol and algorithm, that uses the information provided by the mobile device and the bandwidth, jitter, delay and packet loss of the end user, in order to decide which is the most appropriate video features and the best coding technique to deliver the video streams. A video controller server decides which video server, from a farm of servers, is the best one for each case. We show the algorithm performance when each coding technique is changed in the server due to transcoding process, and the network performance in terms of jitter, delay and lost packets received by the end user when each coding technique is selected by the video controller server. (C) 2012 Elsevier B.V. All rights reserved.
In this paper, nonlinear time series forecasting system combining algorithm proposed prediction model. For the model of the existing combination forecasting method selection and mixed results so that it can be improve...
详细信息
ISBN:
(纸本)9783038350453
In this paper, nonlinear time series forecasting system combining algorithm proposed prediction model. For the model of the existing combination forecasting method selection and mixed results so that it can be improved terms for a variety of different sequences with adaptive prediction. The results show that for different test data set, the method can effectively use all kinds of prediction Models pool without specific filter to adjust the mixing weight ratio of each of the prediction results so that the adaptive prediction, ensure higher prediction accuracy achieved.
Operators are continuously expanding their Internet Protocol Television (IPTV) service due to both the increase of the users subscribed to the service and the increase of the type of devices used by the customers. Whe...
详细信息
ISBN:
(纸本)9781467364324
Operators are continuously expanding their Internet Protocol Television (IPTV) service due to both the increase of the users subscribed to the service and the increase of the type of devices used by the customers. When a user connects to the IPTV service using multiple devices simultaneously, each connection consumes its corresponding bandwidth. This can create serious problems to the operators such as the lack of enough bandwidth, decrease of the Quality of Service, etc. This paper presents the study carried out using a basic topology on which a video is broadcasted varying several network parameters and the network conditions. The received video quality is assessed by using the Mean Option Score. Taking into account all gathered information, we propose a new protocol and algorithm to improve the Quality of Experience of IPTV service customers.
Currently, one of the main problems facing the video broadcast on the Internet is the limitation of the available bandwidth. The media elements contain a large number of multiplexed data and its encoding is necessary ...
详细信息
ISBN:
(纸本)9781467364324
Currently, one of the main problems facing the video broadcast on the Internet is the limitation of the available bandwidth. The media elements contain a large number of multiplexed data and its encoding is necessary for a smooth issuance through the new Application Programming Interface (API) in HTML5 or through third-party plugins. Internet offers a wide compatibility with many formats and video codecs, but its emission focuses specifically on the three main ones: MPEG-4, Ogg and WEBM. In this paper, we study different encodings of a video depending on the bitrate and the encoding time. This study will allow us to know the characteristics of each one of these three video formats. Then, we use this information to design an algorithm, which will run in a server, in order to send the appropriate video type according to the studied characteristics.
Objective: We propose an automated nutritional assessment algorithm that provides a method for malnutrition risk prediction with high accuracy and reliability. Methods: The database used for this study was a file of 4...
详细信息
Objective: We propose an automated nutritional assessment algorithm that provides a method for malnutrition risk prediction with high accuracy and reliability. Methods: The database used for this study was a file of 432 patients, where each patient was described by 4 laboratory parameters and 11 clinical parameters. A malnutrition risk assessment of low (1), moderate (2), or high (3) was assigned by a dietitian for each patient. An algorithm for data organization and classification using characteristic metrics for each patient was developed. For each patient, the algorithm characterized the patients' unique profile and built a characteristic metric to identify similar patients who were mapped into a classification. For each patient, the algorithm characterized the patients' classification. Results: The algorithm assigned a malnutrition risk level for different training sizes that were taken from the data. Our method resulted in average errors (distance between the automated score and the real score) of 0.386, 0.3507, 0.3454, 0.34, and 0.2907 for the 10%, 30%, 50%, 70%, and 90% training sizes, respectively. Our method outperformed the compared method even when our method used a smaller training set than the compared method. In addition, we showed that the laboratory parameters themselves were sufficient for the automated risk prediction and organized the patients into clusters that corresponded to low-, low-moderate-, moderate-, moderate-high-, and high-risk areas. The organization and visualization methods provided a tool for the exploration and navigation of the data points. Conclusion: The problem of rapidly identifying risk and severity of malnutrition is crucial for minimizing medical and surgical complications. These are not easily performed or adequately expedited. We characterized for each patient a unique profile and mapped similar patients into a classification. We also found that the laboratory parameters were sufficient for the automated risk prediction.
We study a capacitated dynamic lot sizing problem with special cost structure involving fixed setup cost, freight cost, production cost and inventory holding cost. The freight cost is proportional to the number of con...
详细信息
ISBN:
(纸本)9781457707391
We study a capacitated dynamic lot sizing problem with special cost structure involving fixed setup cost, freight cost, production cost and inventory holding cost. The freight cost is proportional to the number of containers used. We investigate the problem in which the maximal production capacity in one period is integral multiple of the capacity of a container and reveal the special structure of the optimal solution. We transfer the lot sizing problem into a shortest path problem and propose a network algorithm to deal with it. The T-period problem is solved in O(T-4) effort by the network algorithm.
Theoretical exploration of network structure significance requires a range of different networks for comparison. Here, we present a new method to construct networks in a spatial setting that uses spectral methods in c...
详细信息
Theoretical exploration of network structure significance requires a range of different networks for comparison. Here, we present a new method to construct networks in a spatial setting that uses spectral methods in combination with a probability distribution function. Nearly all previous algorithms for network construction have assumed randomized distribution of links or a distribution dependent on the degree of the nodes. We relax those assumptions. Our algorithm is capable of creating spectral networks along a gradient from random to highly clustered or diverse networks. Number of nodes and link density are specified from start and the structure is tuned by three parameters (gamma, sigma, kappa). The structure is measured by fragmentation, degree assortativity, clustering and group betweenness of the networks. The parameter gamma regulates the aggregation in the spatial node pattern and sigma and kappa regulates the probability of link forming.
Based on the network algorithm proposed by Mehta and Patel for Fisher's Exact Test on 2 x c contingency tables, the relations between maximum subpath lengths are studied. A recurrence relation between maximum subp...
详细信息
Based on the network algorithm proposed by Mehta and Patel for Fisher's Exact Test on 2 x c contingency tables, the relations between maximum subpath lengths are studied. A recurrence relation between maximum subpath lengths is obtained and an ordering of the maximum path lengths is established. Based on these results, some modifications in the network algorithm for 2 x c tables are proposed. These modifications produce a drastic reduction in computation time which in some cases is higher than 99.5% compared to StatXact-5. Moreover, and with purely practical objectives, a grouping in intervals of subpath lengths of the network algorithm is proposed which enable us to obtain the p-value with a limited number of exact figures which is more than sufficient in practice, while with a drastic reduction in the amount of memory required and additional reductions in computational time. The proposed modifications are valid for any 2 x c contingency table, and are compatible with other improvements already proposed for the network algorithm, and especially with the Hybrid algorithm of Mehta and Patel. (c) 2005 Elsevier B.V. All rights reserved.
We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required size of the advice enables to measure the inform...
详细信息
We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required size of the advice enables to measure the information sensitivity of a network problem. A problem is information sensitive if little advice is enough to solve the problem rapidly (i.e., much faster than in the absence of any advice), whereas it is information insensitive if it requires giving a lot of information to the nodes in order to ensure fast computation of the solution. In this paper, we study the information sensitivity of distributed graph coloring.
We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required size of the advice enables to measure the inform...
详细信息
ISBN:
(纸本)3540734198
We study the problem of the amount of information (advice) about a graph that must be given to its nodes in order to achieve fast distributed computations. The required size of the advice enables to measure the information sensitivity of a network problem. A problem is information sensitive if little advice is enough to solve the problem rapidly (i.e., much faster than in the absence of any advice), whereas it is information insensitive if it requires giving a lot of information to the nodes in order to ensure fast computation of the solution. In this paper, we study the information sensitivity of distributed graph coloring.
暂无评论