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.
Detection of interesting (e.g., coherent or anomalous) clusters has been studied extensively on plain or univariate networks, with various applications. Recently, algorithms have been extended to networks with multiple attributes for each node in the real-world. In a multi-attributed network, often, a cluster of nodes is only interesting for a subset (subspace) of attributes, andthis type of clusters...
Structured sparse optimization is an important and challenging problem for analyzing high-dimensional data in a variety of applications such as bioinformatics, medical imaging, social networks, and astronomy. Although a number of structured sparsity models have been explored, such as trees, groups, clusters, and paths, connected subgraphs have been rarely explored in the current literature. One of...
The compute-and-forward scheme for wireless relay networks can achieve higher transmission rates than other existing relaying schemes, such as decode-and-forward. The compute-and-forward (CF) design involves finding an integer-valued coefficient vector at each relay so that the set of coefficient vectors form a full rank matrix allowing the destination to perform decoding. The CF design problem is...
In the scenario of random linear network coding, the channel input and output are matrices over a finite field related by a multiplicative channel matrix. Such channels are called the multiplicative finite-field matrix channels (MFFMC). To communicate over such channels, subspace coding is a promising non-coherent network coding approach which does not require the estimation of the channel matrix...
Search engine marketing provided by search engines enable companies to promote their products to internet users based on their queries is now a major online advertising channel. In most search-based advertising services, advertisers could have dozens of keywords for the same product or service, and in most instances, the reward of each keyword is unknown. Identifying the most profitable keywords becomes...
We consider the compute-and-forward protocol design problem with the objective being maximizing the computation rate at a single relay, and propose an efficient method that finds the optimal solution based on sphere decoding. The problem can be transformed into a shortest vector problem (SVP), which can be solved in two steps. First, by fully exploiting the specific structure of the associated Gram...
Recently, sponsored search has been rapidly growing which increase tremendous interests in improving performance in search engine marketplace. The complexity of market dynamics makes it difficult for advertisers to maximizing the effect of advertising. Simulation analysis is a more viable option than real world testing especially in fast accomplishing different experiments and effectively prompting...
In wireless networks, the compute-and-forward strategy is a promising physical layer network coding scheme that can achieve high rates by effectively exploiting the interference between users. However, the design of the optimal integer-valued equation coefficient vectors in a compute-and-forward scheme turns out to be a shortest vector problem, which is known to be NP hard. In this work, we consider...
The distributed stream processing applications (DSPA) are the applications which can process real-time data in the distributed environment. These applications contain processing elements (PE) and different kinds of streams in the cluster or cloud environment. However, this kind of applications maybe have hotspots and bursting data in a very short of time when they running in the cluster or cloud....
In traditional cloud computing, elastic computing can be provided by increasing or decreasing the number of virtual machines (VM). However, the resource needed by applications change swiftly. This coarse-grained resource allocation approach is not a perfect way to satisfy the demand of the workload in short term. In this paper, we present a fine-grained resource allocation method in virtualized servers...
Event stream processing is the system which uses the processing element to process the data in streams of an application. The processing element (PE) is the computing unit that can handle and compute the metadata in the stream queue. However, there are two problems. First problem is that hotspots maybe happen when applications run in cluster environment; the second problem is load imbalance in the...
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.