The Experts below are selected from a list of 5997 Experts worldwide ranked by ideXlab platform
George K. Atia - One of the best experts on this subject based on the ideXlab platform.
-
Allerton - A Decentralized Approach to robust subspace recovery
2015 53rd Annual Allerton Conference on Communication Control and Computing (Allerton), 2015Co-Authors: Mostafa Rahmani, George K. AtiaAbstract:This paper considers subspace recovery in the presence of outliers in a Decentralized setting. The intrinsic low-dimensional geometry of the data is exploited to substantially reduce the processing and communication overhead given limited sensing and communication resources at the sensing nodes. A small subset of the data is first selected. The data is embedded into a random low-dimensional subspace then forwarded to a central processing unit that runs a low-complexity algorithm to recover the subspace directly from the data sketch. We derive sufficient conditions on the compression and communication rates to successfully recover the subspace with high probability. It is shown that the proposed Approach is robust to outliers and its complexity is independent of the dimension of the whole data matrix. The proposed algorithm provably achieves notable speedups in comparison to existing Approaches for robust subspace recovery.
-
A Decentralized Approach to robust subspace recovery
2015 53rd Annual Allerton Conference on Communication Control and Computing (Allerton), 2015Co-Authors: Mostafa Rahmani, George K. AtiaAbstract:This paper considers subspace recovery in the presence of outliers in a Decentralized setting. The intrinsic low-dimensional geometry of the data is exploited to substantially reduce the processing and communication overhead given limited sensing and communication resources at the sensing nodes. A small subset of the data is first selected. The data is embedded into a random low-dimensional subspace then forwarded to a central processing unit that runs a low-complexity algorithm to recover the subspace directly from the data sketch. We derive sufficient conditions on the compression and communication rates to successfully recover the subspace with high probability. It is shown that the proposed Approach is robust to outliers and its complexity is independent of the dimension of the whole data matrix. The proposed algorithm provably achieves notable speedups in comparison to existing Approaches for robust subspace recovery.
F.e. Wu - One of the best experts on this subject based on the ideXlab platform.
-
A Decentralized Approach for optimal wholesale cross-border trade planning using multi-agent technology
IEEE Transactions on Power Systems, 2001Co-Authors: Yuxin Ni, F.e. WuAbstract:Over the past decade, the power industry has been undergoing deregulations to introduce competitions among market participants. Once centralized decision making must now adapt to the new market structure. The optimal cross-border electricity trade planning is an important issue in interconnected power systems under transmission open access. In this paper a Decentralized Approach is suggested to solve the problem using multiagent technology. In the new Approach rational market participants make decisions based on their own benefits; in the meantime the minimum production and transmission cost of the whole system can be reached without a central coordination except necessary information exchange through media like the Internet. A relevant lemma has been proven. The Approach is implemented via a multiagent system using Java programming language. Computer tests on a five-area test system show that the suggested new Approach is effective and promising.
-
A Decentralized Approach for optimal wholesale cross-border trade planning using multi-agent technology
IEEE Transactions on Power Systems, 2001Co-Authors: Yuxin Ni, F.e. WuAbstract:Over the past decade, power industry has been undergoing deregulation to introduce competition among market participants. Once centralized decision making must now adapt to the new market structure. The optimal cross-border electricity trade planning is an important issue in interconnected power systems under transmission open access. In this paper a Decentralized Approach is suggested to solve the problem using multi-agent technology. In the new Approach rational market participants make decisions based on their own benefits, in the meantime the minimum production and transmission cost of the whole system can be reached without a central coordination except necessary information exchange through media like the Internet. A relevant lemma has been proven. The Approach is implemented via a multi-agent system using Java programming language. Computer tests on a 5-area test system show that the suggested new Approach is effective and promising.
Mostafa Rahmani - One of the best experts on this subject based on the ideXlab platform.
-
Allerton - A Decentralized Approach to robust subspace recovery
2015 53rd Annual Allerton Conference on Communication Control and Computing (Allerton), 2015Co-Authors: Mostafa Rahmani, George K. AtiaAbstract:This paper considers subspace recovery in the presence of outliers in a Decentralized setting. The intrinsic low-dimensional geometry of the data is exploited to substantially reduce the processing and communication overhead given limited sensing and communication resources at the sensing nodes. A small subset of the data is first selected. The data is embedded into a random low-dimensional subspace then forwarded to a central processing unit that runs a low-complexity algorithm to recover the subspace directly from the data sketch. We derive sufficient conditions on the compression and communication rates to successfully recover the subspace with high probability. It is shown that the proposed Approach is robust to outliers and its complexity is independent of the dimension of the whole data matrix. The proposed algorithm provably achieves notable speedups in comparison to existing Approaches for robust subspace recovery.
-
A Decentralized Approach to robust subspace recovery
2015 53rd Annual Allerton Conference on Communication Control and Computing (Allerton), 2015Co-Authors: Mostafa Rahmani, George K. AtiaAbstract:This paper considers subspace recovery in the presence of outliers in a Decentralized setting. The intrinsic low-dimensional geometry of the data is exploited to substantially reduce the processing and communication overhead given limited sensing and communication resources at the sensing nodes. A small subset of the data is first selected. The data is embedded into a random low-dimensional subspace then forwarded to a central processing unit that runs a low-complexity algorithm to recover the subspace directly from the data sketch. We derive sufficient conditions on the compression and communication rates to successfully recover the subspace with high probability. It is shown that the proposed Approach is robust to outliers and its complexity is independent of the dimension of the whole data matrix. The proposed algorithm provably achieves notable speedups in comparison to existing Approaches for robust subspace recovery.
Yuxin Ni - One of the best experts on this subject based on the ideXlab platform.
-
A Decentralized Approach for optimal wholesale cross-border trade planning using multi-agent technology
IEEE Transactions on Power Systems, 2001Co-Authors: Yuxin Ni, F.e. WuAbstract:Over the past decade, the power industry has been undergoing deregulations to introduce competitions among market participants. Once centralized decision making must now adapt to the new market structure. The optimal cross-border electricity trade planning is an important issue in interconnected power systems under transmission open access. In this paper a Decentralized Approach is suggested to solve the problem using multiagent technology. In the new Approach rational market participants make decisions based on their own benefits; in the meantime the minimum production and transmission cost of the whole system can be reached without a central coordination except necessary information exchange through media like the Internet. A relevant lemma has been proven. The Approach is implemented via a multiagent system using Java programming language. Computer tests on a five-area test system show that the suggested new Approach is effective and promising.
-
A Decentralized Approach for optimal wholesale cross-border trade planning using multi-agent technology
IEEE Transactions on Power Systems, 2001Co-Authors: Yuxin Ni, F.e. WuAbstract:Over the past decade, power industry has been undergoing deregulation to introduce competition among market participants. Once centralized decision making must now adapt to the new market structure. The optimal cross-border electricity trade planning is an important issue in interconnected power systems under transmission open access. In this paper a Decentralized Approach is suggested to solve the problem using multi-agent technology. In the new Approach rational market participants make decisions based on their own benefits, in the meantime the minimum production and transmission cost of the whole system can be reached without a central coordination except necessary information exchange through media like the Internet. A relevant lemma has been proven. The Approach is implemented via a multi-agent system using Java programming language. Computer tests on a 5-area test system show that the suggested new Approach is effective and promising.
Christos Zaroliagis - One of the best experts on this subject based on the ideXlab platform.
-
A Collaborative Decentralized Approach to Web Search
IEEE Transactions on Systems Man and Cybernetics - Part A: Systems and Humans, 2012Co-Authors: Athanasios Papagelis, Christos ZaroliagisAbstract:Most explanations of the user behavior while interacting with the web are based on a top-down Approach, where the entire Web, viewed as a vast collection of pages and interconnection links, is used to predict how the users interact with it. A prominent example of this Approach is the random-surfer model, the core ingredient behind Google's PageRank. This model exploits the linking structure of the Web to estimate the percentage of web surfers viewing any given page. Contrary to the top-down Approach, a bottom-up Approach starts from the user and incrementally builds the dynamics of the web as the result of the users' interaction with it. The second Approach has not being widely investigated, although there are numerous advantages over the top-down Approach regarding (at least) personalization and decentralization of the required infrastructure for web tools. In this paper, we propose a bottom-up Approach to study the web dynamics based on web-related data browsed, collected, tagged, and semi-organized by end users. Our Approach has been materialized into a hybrid bottom-up search engine that produces search results based solely on user provided web-related data and their sharing among users. We conduct an extensive experimental study to demonstrate the qualitative and quantitative characteristics of user generated web-related data, their strength, and weaknesses as well as to compare the search results of our bottom-up search engine with those of a traditional one. Our study shows that a bottom-up search engine starts from a core consisting of the most interesting part of the Web (according to user opinions) and incrementally (and measurably) improves its ranking, coverage, and accuracy. Finally, we discuss how our Approach can be integrated with PageRank, resulting in a new page ranking algorithm that can uniquely combine link analysis with users' preferences.
