Separating a polyphonic symbolic score into monophonic voices or streams helps to understand the music and may simplify further pattern matching. One of the best ways to compute this separation, as proposed by Chew and Wu in 2005 [2], is to first identify contigs that are portions of the music score with a constant number of voices, then to progressively connect these contigs. This raises two q...

Bandwidth management and traffic control are critical issues to guarantee the quality of service in cognitive radio networks. This paper exploits a network load refinement approach to achieve the efficient resource utilization and provide the required quality of service. A connection admission control approach is introduced in cognitive radio multimedia sensor networks to provide the data trans...

The emergence of high-speed networks such as those with ATM integrates large numbers of services with a wide range of characteristics. Admission control is a prime instrument for controlling congestion in the network. As part of connection services to an ATM system, the Connection Admission Control (CAC) algorithm decides if another call or connection can be admitted to the Broadband Network. T...

High Definition Television (HDTV) is the new generation broadcasting system, proposing a deeper immersion in action and better visualization comfort. New material is used (flat television screens, fast connection, high media storage, etc.) allowing better user experience than standard definition television (SDTV). Higher hardware prices will only be accepted if noticeable higher quality is reac...

Computer Networking is necessary to human beings. Peoples needed to share ideas, research knowledge, and the way of life to their friends. In the modern time, the role of computer networks became dreamy. Analyzing, accessing, sharing and storing of data and information are very easy with help of distributing computer networking. Social networking sites look after human communication in a better...

An arc-colored digraph D is properly (properly-walk) connected if, for any ordered pair of vertices (u,v), the contains a directed path (a walk) from u to v such that arcs adjacent on (on have distinct colors. The proper connection number pc→(D) (the proper-walk wc→(D)) minimum colours make (properly-walk connected). We prove pc→(Cn(S))≤2 every circulant Cn(S) with S⊆{1,…,n−1},|S|≥2 and 1∈S. Fu...

This paper describes a mechanism, called \persis-tent connection," to preserve stream connections after the communicating peer exits and till it restarts. Such connections have many applications: to survive failures that crash one party, network partitions that cut oo the two parties, and temporary disconnection in a mobile computing environment. They can also facilitate suspension of process e...

The idea of multi-connection congestion control was originally applied to aggregate flows passing from computer cluster to cluster communicating over the public Internet. This paper considers the extension of multi-connection streaming to wired/wireless networks and in doing so reviews theoretical results for multi-connection streaming, including virtual multi-connections within a single physic...

Frequent spotbeam handovers in low earth orbit (LEO) satellite networks require a technique to decrease the handover blocking probabilities. A large variety of schemes have been proposed to achieve this goal in terrestrial mobile cellular networks. Most of them focus on the notion of prioritized channel allocation algorithms. However, these schemes cannot provide the connection-level quality of...