The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In Bike-Sharing System (BSS), great efforts have been devoted to performing resources prediction, redistribution and trip planning to alleviate the unbalance of resources and inconvenience of bike utilization caused by the explosion of users. However, there is few work in trip planning noticing that the complete trip composes of three segments: from user's start point to a start station, from the...
Because of the powerful mobile technology, many crowdsourcing applications emerge to implement location-dependent tasks. One common powerful function of crowdsourcing is to decompose huge or complex tasks into small sub-ones, which require users with different skills to implement. These tasks are composite and implemented completely only after all of their sub-tasks are finished. Meanwhile, users...
A cloud-based encoding pipeline which generates streams for video-on-demand distribution typically processes a wide diversity of content that exhibit varying signal characteristics. To produce the best quality video streams, the system needs to adapt the encoding to each piece of content, in an automated and scalable way. In this paper, we describe two algorithm optimizations for a distributed cloud-based...
Motivated by the concept of spatial modulation (SM), a differential scheme has been recently proposed. This scheme, termed as differential (D-)SM, dispenses with channel estimation while maintains a similar bit error rate (BER) performance to SM. The conventional optimal DSM detector based on a maximum likelihood (ML) criterion, however, gives rise to prohibitive computational complexity when either...
With rapid growth in smart phones and mobile data, effectively managing cellular data networks is important in meeting user performance expectations. However, the scale, complexity and dynamics of a large 3G cellular network make it a challenging task to understand the diverse factors that affect its performance. In this paper we study the RNC (Radio Network Controller)-level performance in one of...
With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies and offers added flexibility...
For a dynamic fault tree (DFT) that models dynamic system, the occurrence of top event depends on not only the combination of basic events, but also on the occurrence order of basic events. Cut sequence is a set of basic events that fail in a particular order that can induce top event. Cut sequence set (CSS) model uses cut sequences to analyze the dynamic behaviors of dynamic systems, and if includes...
The starting and ending (S & E) frames of each text that embeds in a scene or is graphically added to video, provide not only important clues for highlight events detection in semantic-based video analysis, indexing and retrieval but also hint for decoding the videos structure and classification. In this paper, a fast text tracking method of determining S & E frames is proposed, which consists...
Aiming at the complexity and unknown of the modern robot-team parking mission environment, we proposed the maximal obsidional uniform distribution principle, the first nearest parking-point was enclosed by another parking-point according to uniform distribution. Based on it, we used the ldquoHungary Methodrdquo to realize the shortest total path length parking strategy. It was to form a benefit matrix...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.