179 resultados para Cooperative Networks
Resumo:
This paper studies Spanish scientific production in Economics from 1994 to 2004. It focuses on aspects that have received little attention in other bibliometric studies, such as the impact of research and the role of scientific collaborations in the publications produced by Spanish universities. Our results show that national research networks have played a fundamental role in the increase in Spanish scientific production in this discipline.
Resumo:
[cat] El concepte de joc cooperatiu amb large core és introduït per Sharkey (1982) i el de Population Monotonic Allocation Scheme és definit per Sprumont (1990). Inspirat en aquests conceptes, Moulin (1990) introdueix la noció de large monotonic core donant una caracterització per a jocs de tres jugadors. En aquest document provem que tots els jocs amb large monotonic core són convexes. A més, donem un criteri efectiu per determinar si un joc té large monotonic core o no, i daquí obtenim una caracterització pel cas de quatre jugadors.
Resumo:
[cat] El concepte de joc cooperatiu amb large core és introduït per Sharkey (1982) i el de Population Monotonic Allocation Scheme és definit per Sprumont (1990). Inspirat en aquests conceptes, Moulin (1990) introdueix la noció de large monotonic core donant una caracterització per a jocs de tres jugadors. En aquest document provem que tots els jocs amb large monotonic core són convexes. A més, donem un criteri efectiu per determinar si un joc té large monotonic core o no, i daquí obtenim una caracterització pel cas de quatre jugadors.
Resumo:
Wavelength division multiplexing (WDM) networks have been adopted as a near-future solution for the broadband Internet. In previous work we proposed a new architecture, named enhanced grooming (G+), that extends the capabilities of traditional optical routes (lightpaths). In this paper, we compare the operational expenditures incurred by routing a set of demands using lightpaths with that of lighttours. The comparison is done by solving an integer linear programming (ILP) problem based on a path formulation. Results show that, under the assumption of single-hop routing, almost 15% of the operational cost can be reduced with our architecture. In multi-hop routing the operation cost is reduced in 7.1% and at the same time the ratio of operational cost to number of optical-electro-optical conversions is reduced for our architecture. This means that ISPs could provide the same satisfaction in terms of delay to the end-user with a lower investment in the network architecture
Resumo:
Optical transport networks (OTN) must be prepared in terms of better resource utilization, for accommodating unicast and multicast traffic together. Light-trees have been proposed for supporting multicast connections in OTN. Nevertheless when traffic grooming is applied in light-trees, resources can be underutilized as traffic can be routed to undesirable destinations in order to avoid optical-electrical-optical (OEO) conversions. In this paper, a novel architecture named S/G light- tree for supporting unicast/multicast connections is proposed. The architecture allows traffic dropping and aggregation in different wavelengths without performing OEO conversions. A heuristic that routes traffic demands using less wavelengths by taking advantage of the proposed architecture is designed as well. Simulation results show that the architecture can minimize the number of used wavelengths and OEO conversions when compared to light-trees
Resumo:
In this article, a new technique for grooming low-speed traffic demands into high-speed optical routes is proposed. This enhancement allows a transparent wavelength-routing switch (WRS) to aggregate traffic en route over existing optical routes without incurring expensive optical-electrical-optical (OEO) conversions. This implies that: a) an optical route may be considered as having more than one ingress node (all inline) and, b) traffic demands can partially use optical routes to reach their destination. The proposed optical routes are named "lighttours" since the traffic originating from different sources can be forwarded together in a single optical route, i.e., as taking a "tour" over different sources towards the same destination. The possibility of creating lighttours is the consequence of a novel WRS architecture proposed in this article, named "enhanced grooming" (G+). The ability to groom more traffic in the middle of a lighttour is achieved with the support of a simple optical device named lambda-monitor (previously introduced in the RingO project). In this article, we present the new WRS architecture and its advantages. To compare the advantages of lighttours with respect to classical lightpaths, an integer linear programming (ILP) model is proposed for the well-known multilayer problem: traffic grooming, routing and wavelength assignment The ILP model may be used for several objectives. However, this article focuses on two objectives: maximizing the network throughput, and minimizing the number of optical-electro-optical conversions used. Experiments show that G+ can route all the traffic using only half of the total OEO conversions needed by classical grooming. An heuristic is also proposed, aiming at achieving near optimal results in polynomial time
Resumo:
This article examines the networks within the research groups where Spanish PhD students are pursuing their doctorate. Capó et al. (2007) used quantitative data to predict PhD students’ publishing performance from their background, attitudes, supervisors’ performance and research group networks. Variables related to the research group network had a negligible explanatory power on student performance once the remaining variables had been accounted for. In this article, a qualitative follow up of the same students is carried out using extreme case sampling and indepth interviews. The qualitative research shows networking as important for students. Out of the 115 aspects that students mention in the interviews as relevant to publishing in the qualitative research, 92 have to do with their supervisors, their research group or their network as a whole. Similarly, out of the 50 hindrances mentioned, 20 have to do with the networks or relations. The most commonly mentioned network-related topics are research group members pushing PhD students to publish, meeting researchers outside the research group, existence of other PhD students in the group, help with the PhD from group members, supervisor’s interest in the thesis, the possibility of discussing with experts on the PhD’s topic and frequent contact with the supervisor and research group members. Some of these characteristics were not, however, measured in the conventional quantitative social network survey
Resumo:
An assortment of human behaviors is thought to be driven by rewards including reinforcement learning, novelty processing, learning, decision making, economic choice, incentive motivation, and addiction. In each case the ventral tegmental area/ventral striatum (nucleus accumbens) (VTAVS) system has been implicated as a key structure by functional imaging studies, mostly on the basis of standard, univariate analyses. Here we propose that standard functional magnetic resonance imaging analysis needs to be complemented by methods that take into account the differential connectivity of the VTAVS system in the different behavioral contexts in order to describe reward based processes more appropriately. We fi rst consider the wider network for reward processing as it emerged from animal experimentation. Subsequently, an example for a method to assess functional connectivity is given. Finally, we illustrate the usefulness of such analyses by examples regarding reward valuation, reward expectation and the role of reward in addiction.
Resumo:
We study cooperative and competitive solutions for a many- to-many generalization of Shapley and Shubik (1972)'s assignment game. We consider the Core, three other notions of group stability and two al- ternative definitions of competitive equilibrium. We show that (i) each group stable set is closely related with the Core of certain games defined using a proper notion of blocking and (ii) each group stable set contains the set of payoff vectors associated to the two definitions of competitive equilibrium. We also show that all six solutions maintain a strictly nested structure. Moreover, each solution can be identified with a set of ma- trices of (discriminated) prices which indicate how gains from trade are distributed among buyers and sellers. In all cases such matrices arise as solutions of a system of linear inequalities. Hence, all six solutions have the same properties from a structural and computational point of view.
Resumo:
In 2009 the University of Girona (Spain) created four interest groups on teaching innovation. The objective of the project is that lecturers with an interest in teaching innovation can exchange their points of view and learn from one another, so University teaching is improved as a result. There are four such groups: “Problem based learning (ABP)”, “Cooperative learning”, “Evaluation”, and “Information and Communication Technologies (ICTs) and Teaching”. The coordinators of the groups or networks, as they are also called, are chosen on a free basis by its members. This paper presents their point of view as regards the current activity of encouragement of interest in higher education and they elaborate on the main difficulties involved. The implications of the interdisciplinary work are explored, as well as the challenges of an initiative of this kind. The evolution of the ongoing work is reviewed, taking into account the context of a changing University, the lack of previous experience regarding projects of this kind, the asynchronous communication among the participants, and the necessity of a flexible approach in organizational matters
Resumo:
An efficient approach for organizing large ad hoc networks is to divide the nodesinto multiple clusters and designate, for each cluster, a clusterhead which is responsible forholding intercluster control information. The role of a clusterhead entails rights and duties.On the one hand, it has a dominant position in front of the others because it manages theconnectivity and has access to other node¿s sensitive information. But on the other hand, theclusterhead role also has some associated costs. Hence, in order to prevent malicious nodesfrom taking control of the group in a fraudulent way and avoid selfish attacks from suitablenodes, the clusterhead needs to be elected in a secure way. In this paper we present a novelsolution that guarantees the clusterhead is elected in a cheat-proof manner.
Resumo:
Performance of symmetric and asymmetriccryptography algorithms in small devices is presented. Both temporaland energy costs are measured and compared with the basicfunctional costs of a device. We demonstrate that cryptographicpower costs are not a limiting factor of the autonomy of a deviceand explain how processing delays can be conveniently managedto minimize their impact.
Resumo:
Peer-reviewed
Resumo:
Peer-reviewed