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.
That paper focus on how to select cloud service provider (CSP) for the user which provide the best service to the user. Selection of the proper CSP depends on the rating of CSP. If rating of CSP is higher than that CSP would be select for the first user and so on. Paper has focused on both rating of CSP and rating of particular attribute of CSP. In this Paper selection of CSP depends on both rating...
This paper illustrates a rule induction approach to discover decision patterns by using Dominance-based Rough Set Approach (DRSA) to unravel the intrinsic factors for learning successes and failures in a cooperative group-learning environment. It employs an innovative group quiz method in a university Management Information Systems (MIS) course which induces students into a unique learning process...
Diffusion through graphs can be used to model many real-world process, such as the spread of diseases, social network memes, computer viruses, or water contaminants. Often, a real-world diffusion cannot be directly observed while it is occurring -- perhaps it is not noticed until some time has passed, continuous monitoring is too costly, or privacy concerns limit data access. This leads to the need...
This paper studies the problem of identifying the minimum number of entities (agents), referred to as information gatherers, that are able to infer all the states in a dynamical social network. The information gatherers can be, for instance, service providers and the remaining agents the clients, each comprising several dynamic states associated with the services and personal information. The problem...
In this paper a new algorithm RS-PEAK will be presented for locating peak values of the Riemann zeta function on the critical line. The method based on earlier results of Andrew M. Odlyzko, Tadej Kotnik, and on a recently achieved results of solving simultaneous Diophantine approximation problems. Until 2014 only a few hundred values were known where the Riemann-Siegel Z-function (i.e: Z(t)) larger...
Complex numbers in today's computers are represented and manipulated by splitting them into their real and imaginary components and then each pair of real parts and imaginary parts undergoes arithmetic operations independent of one another. Thus, a simple addition/subtraction of two complex numbers (a+jb) and (c+jd) involves two individual additions/subtractions, (a±c) and (b±d). This gets more complicated...
Over the last few decades, feature selection has been a hot research area in pattern recognition and machine learning, and many famous feature selection algorithms have been proposed. Among them, feature selection using positive approximation(FSPA) is an accelerator for traditional rough set based feature selection algorithms, which can significantly reduce the running time. However, FSPA still cannot...
Past implementations of the Generalized Method of Moments utilized nonsmooth functions in current approximation bases that were difficult to integrate accurately. Herein we devise a method for defining arbitrarily smooth functions on polygonal GMM subdomains using Schwarz-Christoffel conformal mapping. The resulting functions are much smoother, and can be integrated more accurately using numerical...
We present a heuristic for designing vector non-linear network codes for non-multicast networks, which we call quasi-linear network codes. The method presented has two phases: finding an approximate linear network code over the reals, and then quantizing it to a vector non-linear network code using a fixed-point representation. Apart from describing the method, we draw some links between some network...
A finite-horizon linear-quadratic optimal control problem for systems with point-wise and distributed state delays is considered. Based on well known control optimality conditions, the solution of this problem is reduced to solution of the set of three Riccati-type matrix differential equations: an ODE and two first-order PDEs with two and three independent variables. In the paper, this set of Riccati-type...
Multidimensional stochastic optimization plays an important role in analysis and control of many technical systems. To solve the challenging problems of multidimensional optimization, it was suggested to use the randomized algorithms of stochastic approximation with perturbed input which have simple forms and provide consistent estimates of the unknown parameters for observations under “almost arbitrary”...
Recent advances in the standardization of 4G cellular networks introduce the notion of multi-coverage, where multiple base stations may collaboratively satisfy the demands of mobile users. We provide a theoretical model for studying such multi-coverage environments, in highly heterogeneous settings, where users demands and profits may vary, as can base stations' capacities and the rates with which...
Software Defined Networks (SDNs) are becoming the leading technology behind many traffic engineering solutions, both for backbone and data-center networks, since it allows a central controller to globally plan the path of the flows according to the operator's objective. Nevertheless, networking devices' forwarding table is a limited and expensive resource (e.g., TCAM-based switches) which should thus...
Maximum multiflow and maximum concurrent mul-tiflow in multi-channel multi-radio (MC-MR) wireless networks have been well-studied in the literature. They are NP-hard even in single-channel single-radio (SC-SR) wireless networks when all nodes have uniform (and fixed) interference radii and the positions of all nodes are available. While they admit a polynomial-time approximation scheme (PTAS) when...
Publish/subscribe (pub/sub) is a popular communication paradigm in the design of large-scale distributed systems. A provider of a pub/sub service (whether centralized, peer-assisted, or based on a federated organization of cooperatively managed servers) commonly faces a fundamental challenge: given limited resources, how to maximize the satisfaction of subscribers? We provide, to the best of our knowledge,...
We propose a unified methodology to analyse the performance of caches (both isolated and interconnected), by extending and generalizing a decoupling technique originally known as Che's approximation, which provides very accurate results at low computational cost. We consider several caching policies, taking into account the effects of temporal locality. In the case of interconnected caches, our approach...
Auctions provide a platform for licensed spectrum users to trade their underutilized spectrum with unlicensed users. Existing spectrum auctions either do not apply to the scenarios where multiple sellers and buyers both make offers, or assume the knowledge of the users' valuation distribution for maximizing the profit of the auction. To fill this void, we design PROMISE, a framework for spectrum double...
In this paper we consider the problem of efficient data gathering in sensor networks for arbitrary sensor node deployments. The efficiency of the solution is measured by a number of criteria: total energy consumption, total transport capacity, latency and quality of the transmissions. We present a number of different constructions with various tradeoffs between aforementioned parameters. We provide...
One of the primary functions of a cloud service provider is to allocate cloud resources to users upon request. Requests arrive in real-time and resource placement decisions must be made as and when a request arrives, without any prior knowledge of future arrivals. In addition, when a cloud service provider operates a geographically diversified cloud that consists of large number of small data centers,...
Crowdsensing offers an efficient approach to meet the demand in large scale sensing applications. In crowdsensing, it is of great interest to find the optimal task allocation, which is challenging since sensing tasks with different requirements of quality of sensing are typically associated with specific locations and mobile users are constrained by time budgets. We show that the allocation problem...
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.