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.
Traditional hierarchical clustering (HC) methods are not scalable with the size of databases. To address this issue, a series of summarization techniques, i.e. data bubbles (DB) and its improved versions, have been proposed to compress very large databases into representative seed points suitable for subsequent hierarchy construction. However, DB and its variants have two common drawbacks: 1) their...
Hashing learning has attracted increasing attention these years with the explosive increase of data. The hashing learning can be divided into two steps. Firstly, obtain the low dimensional representation of the original data. Secondly, quantize the real number vector of the low dimensional representation of each data point and map them to binary codes. Most of the existing methods measure the original...
Preventing viruses from spreading in networks is a hot topic. Existing works designed immune strategies for static networks, which become invalid for temporal networks due to their dynamic characteristics and community structure. In this paper, taking into consideration of the evolutionary communities, we propose an evolutionary virus immune strategy for temporal networks. First, we define a new metric,...
This paper investigates a cooperative transmission scheme for a multi-source single-destination system through signal-superposition-based braid coding. The source nodes take turns to transmit, and each time, a source “overlays” its new data together with (some or all of) what it overhears from its partner(s) using signal superposition, in a way similar to French-braiding the hair. We demonstrate how...
In this paper we study the problem of how to detect and extract a particular type of propagation structure that arises in phishing activities. One of the most interesting phenomena induced by phishing is fast-flux, whereby a single malicious domain is mapped to a constantly changing IP address in order to evade capture and shut-down. This leads to malicious activities observed to be propagating through...
There is a need for robust and effective trust management. Different security problems result in different requirements to the design of trust management, and the existing attacks in trust management for security are yet to be solved. In this paper, we first propose a framework to classify desired properties of trust management for each type of security problems. We then investigate typical representative...
Human have five senses which are visual, auditory, smell, touch and taste. The sense of touch is occurring when the skin contact with any object and human can percept the shape, temperature, vibration of the object. As well known, the spatial density of receptors located in the human skin differed of different parts such as index finger. Therefore, the sensitivity of each finger were differed from...
Data center networks (DCNs) are inherently failure-prone owing to the existence of many links, switches and servers. Many times the failures of the components may be correlated resulting a set of connected components failing together. This correlated failure behaviour could be captured through the use of fault regions [1]. This paper explores the effect of such failures in DCNs, using four topologies,...
We present an evaluation of the fault-tolerance characteristics of several important data center network topologies, including Fat-tree, DCell, HyperBCube and BCube using several metrics, including average path length, aggregated bottleneck throughput and connection failure ratio. These enable us to present an objective comparison of the network topologies under faulty conditions.
Model checking provides a way to automatically verify hardware and software systems, whereas the goal of planning is to produce a sequence of actions that leads from the initial state to the desired goal state. Recently research indicates that there is a strong connection between model checking and planning problem solving. In this paper, we investigate the feasibility of using a newly developed model...
This paper analyzes the problems in the wireless network caused by using minimum hop count as its routing metric, and discusses ETX metric which invented by De Couto to solve these problems and the shortage of it in mobile environment, then modifies it by relatively counting as to make it suitable for such environment. This paper uses the new ETX as a metric for the OLSR routing protocol, and proves...
This work presents a semantic level no-reference image sharpness/blurriness metric under the guidance of top-down & bottom-up saliency map, which is learned based on eye-tracking data by SVM. Unlike existing metrics focused on measuring the blurriness in vision level, our metric more concerns about the image content and human's intention. We integrate visual features, center priority, and semantic...
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.