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.
With the advances in geo-positioning technologies and location-based services, it is nowadays quite common for road networks to have textual contents on the vertices. Previous work on identifying an optimal route that covers a sequence of query keywords has been studied in recent years. However, in many practical scenarios, an optimal route might not always be desirable. For example, a personalized...
One of the traditional ways for detecting dynamic communities is to find the communities at each interval through the static community detection algorithms. However, it usually leads to high computation complexity. In this paper, a novel algorithm based on the MapReduce model and the label propagation progress with the strategy of incremental related vertices is proposed, which is called PLPIRV (Parallel...
Energy consumption in data center has already become a widely concerned issue in cloud computing research. There are many studies on data center energy efficiency optimization. But most of them focus on the energy consumption of the servers and cooling equipment. Few of them considered data center network (DCN), which is also a significant energy consuming component. By applying newly emerged Software...
This paper studies the problem of scheduling preemptable queries with relative consistency constraints when the absolute consistency for real-time data objects is preserved. The single query schedule problem is studied first, then the multiple queries scheduling problem. An optimal algorithm and several heuristics for scheduling multiple queries are proposed. Experiments are also conducted to compare...
How to mine outliers of online data streams in a short time is an unsolved problem. We propose a new outlier factor metric whose name is the frequent pattern contradiction outlier factor called FPCOF for short. FPCOF can easily measure the degree to which each data instance in data streams is considered as an outlier. In order to compute FPCOF, we construct an outlier detection tree (or OD-tree in...
Limited network bandwidth and dynamic changes in workload have serious impact on the performances of networked control systems. For a multiple loops networked control system in a dynamic environment, this paper proposes a real-time network scheduling method based on the idea of feedback scheduling. System packet loss rate can be reduced by dynamically adjusting the sampling period of tasks, thus achieving...
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.