Cooperative Particle Swarm Optimization Based Receiver for Large-Dimension MIMO-ZPSC Systems

In this paper, we propose a cooperative particle swarm optimization (CPSO) based channel estimation/equalization scheme for multiple-input multiple-output zero-padded single-carrier (MIMO-ZPSC) systems with large dimensions in frequency selective channels. We estimate the channel state information at the receiver in time domain using a PSO based algorithm during training phase. Using the estimated channel, we perform information symbol detection in the frequency domain using FFT based processing. For this detection, we use a low complexity OLA (OverLap Add) likelihood ascent search equalizer which uses minimum mean square (MMSE) equalizer solution as the initial solution. Multiple iterations between channel estimation and data detection are carried out which significantly improves the mean square error and bit error rate performance of the receiver.

Alternative financing instruments for Spanish cooperative

The search for funding is an ongoing task of the company, which is exacerbated, particularly in times of economic crisis, affecting also to the cooperatives. Cooperative legislation available to these entities various instruments of external financing through the issuance of securities (bonds, equity securities, special shares), to them accounts are added in participation, but without much detail in the legal texts. At work we investigate their potential, by looking, especially in those last; We seek to clarify their legal status and contrast their potential as a technical instrument, alternative for funding in the area of cooperative societies. Finally, we also see the impact of the recent Law 5/2015, of promoting business financing in the cooperative sector and ended up proposing some policy adjustments.

Update: The search for the human cough receptor

Despite the best efforts of basic and applied science, the identity of the human "cough receptor" remains elusive. The attraction of identifying a single "catch all" cough receptor is obvious, although such an objective is unlikely to be realised given the concept of "cough hypersensitivity," which is now considered the most clinically relevant description of what underlies problem coughing. One means of progressing this area is to join the thinking and experimental effort of basic science and clinical research in an effective manner. Some of the best examples of cooperative and translational research over the years together with an update on the most recent work will be discussed in this article.

Stabilizing swarm intelligence search via positive feedback resource allocation

A novel Swarm Intelligence method for best-fit search, Stochastic Diffusion Search, is presented capable of rapid location of the optimal solution in the search space. Population based search mechanisms employed by Swarm Intelligence methods can suffer lack of convergence resulting in ill defined stopping criteria and loss of the best solution. Conversely, as a result of its resource allocation mechanism, the solutions SDS discovers enjoy excellent stability.

Convergence analysis of stochastic diffusion search

In this paper we present a connectionist searching technique - the Stochastic Diffusion Search (SDS), capable of rapidly locating a specified pattern in a noisy search space. In operation SDS finds the position of the pre-specified pattern or if it does not exist - its best instantiation in the search space. This is achieved via parallel exploration of the whole search space by an ensemble of agents searching in a competitive cooperative manner. We prove mathematically the convergence of stochastic diffusion search. SDS converges to a statistical equilibrium when it locates the best instantiation of the object in the search space. Experiments presented in this paper indicate the high robustness of SDS and show good scalability with problem size. The convergence characteristic of SDS makes it a fully adaptive algorithm and suggests applications in dynamically changing environments.

A cooperative game theory analysis for transmission loss allocation

This paper presents an analysis and discussion, based on cooperative game theory, for the allocation of the cost of losses to generators and demands in transmission systems. We construct a cooperative game theory model in which the players are represented by equivalent bilateral exchanges and we search for a unique loss allocation solution, the Core. Other solution concepts, such as the Shapley Value, the Bilateral Shapley Value and the Kernel are also explored. Our main objective is to illustrate why is not possible to find an optimal solution for allocating the cost of losses to the users of a network. Results and relevant conclusions are presented for a 4-bus system and a 14-bus system. (c) 2007 Elsevier B.V. All rights reserved.

The People's Hour and the Social Gospel: George Howard Gibson's Gilded Age Search for an Organization of the Kingdom of God

Previous studies of the Social Gospel movement have acknowledged the fact that Social Gospelers were involved in multiple social reform movements during the Gilded Age and into the Progressive Era. However, most of these studies have failed to explain how the reform experiences of the Social Gospelers contributed to the development of the Social Gospel. The Social Gospelers’ ideas regarding the need to transform society and their strategies for doing so were largely a result of their personal experiences as reformers and their collaboration with other reformers. The knowledge and insight gained from interaction with a variety of reform methods played a vital role in the development of the ideology and theology of the Social Gospel. George Howard Gibson is exemplary of the connections between the Social Gospel movement and several other social reform movements of the time. He was involved in the Temperance movement, was a member of both the Prohibition Party and the People’s Party, and co-founded a Christian socialist cooperative colony. His writings illustrate the formation of his identity as a Social Gospeler as well as his attempts to find an organization through which to realize the kingdom of God on earth. Failure to achieve the changes he desired via prohibition encouraged him to broaden his reform goals. Like many Midwestern Social Gospelers Gibson believed he had found “God’s Party” in the People’s Party, but he rejected reform via the political system once the Populists restricted their attention to the silver issue and fused with the Democratic Party. Yet his involvement with the People’s Party demonstrates the attraction many Social Gospelers had to the reforms proposed in the Omaha Platform of 1892 as well as to the party’s use of revivalistic language and emphasis on producerism and brotherhood. Gibson’s experimentation with a variety of ways to achieve the kingdom of God on earth provides new insight into the experiences and contributions of lay Social Gospelers. Adviser: Kenneth J. Winkle

Families for black children, the search for adoptive parents; an experience survey

Cooperative report of the Division of Research and Evaluation, Children's Bureau, Office of Child Development, and the Social Research Group, The George Washington University.

CSX and the railway unions : in search of new solutions /

"BLMR 140."

Cooperative routing for collision minimization in wireless sensor networks

Cooperative communication has gained much interest due to its ability to exploit the broadcasting nature of the wireless medium to mitigate multipath fading. There has been considerable amount of research on how cooperative transmission can improve the performance of the network by focusing on the physical layer issues. During the past few years, the researchers have started to take into consideration cooperative transmission in routing and there has been a growing interest in designing and evaluating cooperative routing protocols. Most of the existing cooperative routing algorithms are designed to reduce the energy consumption; however, packet collision minimization using cooperative routing has not been addressed yet. This dissertation presents an optimization framework to minimize collision probability using cooperative routing in wireless sensor networks. More specifically, we develop a mathematical model and formulate the problem as a large-scale Mixed Integer Non-Linear Programming problem. We also propose a solution based on the branch and bound algorithm augmented with reducing the search space (branch and bound space reduction). The proposed strategy builds up the optimal routes from each source to the sink node by providing the best set of hops in each route, the best set of relays, and the optimal power allocation for the cooperative transmission links. To reduce the computational complexity, we propose two near optimal cooperative routing algorithms. In the first near optimal algorithm, we solve the problem by decoupling the optimal power allocation scheme from optimal route selection. Therefore, the problem is formulated by an Integer Non-Linear Programming, which is solved using a branch and bound space reduced method. In the second near optimal algorithm, the cooperative routing problem is solved by decoupling the transmission power and the relay node se- lection from the route selection. After solving the routing problems, the power allocation is applied in the selected route. Simulation results show the algorithms can significantly reduce the collision probability compared with existing cooperative routing schemes.

Cooperative Mapping and Exploration using Counter-rotational Potential Fields

This paper presents a novel technique for mapping and exploration using cooperating autonomous underwater vehicles. Rather than using the typical lawnmower sweep pattern to search an entire area, the proposed navigational plan involves guiding the formation directly towards each object of interest in turn, before arriving at a final goal position. This is achieved by the use of traditional artificial potential fields alongside counter-rotational potential fields. These clockwise and counter-clockwise fields are employed simultaneously by vehicles to ensure that the entire object is scanned rather than simply avoided as is the case with traditional collision avoidance techniques. The proposed methodology allows a formation to have fluid-like motion whilst a separation distance between cooperating agents (free of angular constraints) is maintained with a greater degree of flexibility than traditional formation control approaches. Owing to its nature, this technique is suited for applications such as exploration, mapping and underwater inspection to name a few. Simulation results demonstrate the efficacy of the proposed approach.

Query routing in cooperative semi-structured peer-to-peer information retrieval networks

Conventional web search engines are centralised in that a single entity crawls and indexes the documents selected for future retrieval, and the relevance models used to determine which documents are relevant to a given user query. As a result, these search engines suffer from several technical drawbacks such as handling scale, timeliness and reliability, in addition to ethical concerns such as commercial manipulation and information censorship. Alleviating the need to rely entirely on a single entity, Peer-to-Peer (P2P) Information Retrieval (IR) has been proposed as a solution, as it distributes the functional components of a web search engine – from crawling and indexing documents, to query processing – across the network of users (or, peers) who use the search engine. This strategy for constructing an IR system poses several efficiency and effectiveness challenges which have been identified in past work. Accordingly, this thesis makes several contributions towards advancing the state of the art in P2P-IR effectiveness by improving the query processing and relevance scoring aspects of a P2P web search. Federated search systems are a form of distributed information retrieval model that route the user’s information need, formulated as a query, to distributed resources and merge the retrieved result lists into a final list. P2P-IR networks are one form of federated search in routing queries and merging result among participating peers. The query is propagated through disseminated nodes to hit the peers that are most likely to contain relevant documents, then the retrieved result lists are merged at different points along the path from the relevant peers to the query initializer (or namely, customer). However, query routing in P2P-IR networks is considered as one of the major challenges and critical part in P2P-IR networks; as the relevant peers might be lost in low-quality peer selection while executing the query routing, and inevitably lead to less effective retrieval results. This motivates this thesis to study and propose query routing techniques to improve retrieval quality in such networks. Cluster-based semi-structured P2P-IR networks exploit the cluster hypothesis to organise the peers into similar semantic clusters where each such semantic cluster is managed by super-peers. In this thesis, I construct three semi-structured P2P-IR models and examine their retrieval effectiveness. I also leverage the cluster centroids at the super-peer level as content representations gathered from cooperative peers to propose a query routing approach called Inverted PeerCluster Index (IPI) that simulates the conventional inverted index of the centralised corpus to organise the statistics of peers’ terms. The results show a competitive retrieval quality in comparison to baseline approaches. Furthermore, I study the applicability of using the conventional Information Retrieval models as peer selection approaches where each peer can be considered as a big document of documents. The experimental evaluation shows comparative and significant results and explains that document retrieval methods are very effective for peer selection that brings back the analogy between documents and peers. Additionally, Learning to Rank (LtR) algorithms are exploited to build a learned classifier for peer ranking at the super-peer level. The experiments show significant results with state-of-the-art resource selection methods and competitive results to corresponding classification-based approaches. Finally, I propose reputation-based query routing approaches that exploit the idea of providing feedback on a specific item in the social community networks and manage it for future decision-making. The system monitors users’ behaviours when they click or download documents from the final ranked list as implicit feedback and mines the given information to build a reputation-based data structure. The data structure is used to score peers and then rank them for query routing. I conduct a set of experiments to cover various scenarios including noisy feedback information (i.e, providing positive feedback on non-relevant documents) to examine the robustness of reputation-based approaches. The empirical evaluation shows significant results in almost all measurement metrics with approximate improvement more than 56% compared to baseline approaches. Thus, based on the results, if one were to choose one technique, reputation-based approaches are clearly the natural choices which also can be deployed on any P2P network.