The Plurality Strategy on Graphs

The Majority Strategy for finding medians of a set of clients on a graph can be relaxed in the following way: if we are at v, then we move to a neighbor w if there are at least as many clients closer to w than to v (thus ignoring the clients at equal distance from v and w). The graphs on which this Plurality Strategy always finds the set of all medians are precisely those for which the set of medians induces always a connected subgraph

Almost Self-Centered Median And Chordal Graphs

Almost self-centered graphs were recently introduced as the graphs with exactly two non-central vertices. In this paper we characterize almost selfcentered graphs among median graphs and among chordal graphs. In the first case P4 and the graphs obtained from hypercubes by attaching to them a single leaf are the only such graphs. Among chordal graph the variety of almost self-centered graph is much richer, despite the fact that their diameter is at most 3. We also discuss almost self-centered graphs among partial cubes and among k-chordal graphs, classes of graphs that generalize median and chordal graphs, respectively. Characterizations of almost self-centered graphs among these two classes seem elusive

The median function on graphs with bounded profiles

The median of a profile = (u1, . . . , uk ) of vertices of a graph G is the set of vertices x that minimize the sum of distances from x to the vertices of . It is shown that for profiles with diameter the median set can be computed within an isometric subgraph of G that contains a vertex x of and the r -ball around x, where r > 2 − 1 − 2 /| |. The median index of a graph and r -joins of graphs are introduced and it is shown that r -joins preserve the property of having a large median index. Consensus strategies are also briefly discussed on a graph with bounded profiles.

Median computation in graphs using consensus strategies

Following the Majority Strategy in graphs, other consensus strategies, namely Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on graphs are discussed as methods for the computation of median sets of pro¯les. A review of algorithms for median computation on median graphs is discussed and their time complexities are compared. Implementation of the consensus strategies on median computation in arbitrary graphs is discussed

Equal opportunity networks, distance-balanced graphs, and Wiener game

Given a graph G and a set X ⊆ V(G), the relative Wiener index of X in G is defined as WX (G) = {u,v}∈X 2  dG(u, v) . The graphs G (of even order) in which for every partition V(G) = V1 +V2 of the vertex set V(G) such that |V1| = |V2| we haveWV1 (G) = WV2 (G) are called equal opportunity graphs. In this note we prove that a graph G of even order is an equal opportunity graph if and only if it is a distance-balanced graph. The latter graphs are known by several characteristic properties, for instance, they are precisely the graphs G in which all vertices u ∈ V(G) have the same total distance DG(u) = v∈V(G) dG(u, v). Some related problems are posed along the way, and the so-called Wiener game is introduced.

Betweenness Centrality in Some Classes of Graphs

There are several centrality measures that have been introduced and studied for real world networks. They account for the different vertex characteristics that permit them to be ranked in order of importance in the network. Betweenness centrality is a measure of the influence of a vertex over the flow of information between every pair of vertices under the assumption that information primarily flows over the shortest path between them. In this paper we present betweenness centrality of some important classes of graphs.

Fair Sets of Some Classes of Graphs

Given a non empty set S of vertices of a graph, the partiality of a vertex with respect to S is the di erence between maximum and minimum of the distances of the vertex to the vertices of S. The vertices with minimum partiality constitute the fair center of the set. Any vertex set which is the fair center of some set of vertices is called a fair set. In this paper we prove that the induced subgraph of any fair set is connected in the case of trees and characterise block graphs as the class of chordal graphs for which the induced subgraph of all fair sets are connected. The fair sets of Kn, Km;n, Kn e, wheel graphs, odd cycles and symmetric even graphs are identi ed. The fair sets of the Cartesian product graphs are also discussed

Consensus strategies for signed profiles on graphs

The median problem is a classical problem in Location Theory: one searches for a location that minimizes the average distance to the sites of the clients. This is for desired facilities as a distribution center for a set of warehouses. More recently, for obnoxious facilities, the antimedian was studied. Here one maximizes the average distance to the clients. In this paper the mixed case is studied. Clients are represented by a profile, which is a sequence of vertices with repetitions allowed. In a signed profile each element is provided with a sign from f+; g. Thus one can take into account whether the client prefers the facility (with a + sign) or rejects it (with a sign). The graphs for which all median sets, or all antimedian sets, are connected are characterized. Various consensus strategies for signed profiles are studied, amongst which Majority, Plurality and Scarcity. Hypercubes are the only graphs on which Majority produces the median set for all signed profiles. Finally, the antimedian sets are found by the Scarcity Strategy on e.g. Hamming graphs, Johnson graphs and halfcubes

Median graphs, the remoteness function, periphery transversals, and geodetic number two

A periphery transversal of a median graph G is introduced as a set of vertices that meets all the peripheral subgraphs of G. Using this concept, median graphs with geodetic number 2 are characterized in two ways. They are precisely the median graphs that contain a periphery transversal of order 2 as well as the median graphs for which there exists a profile such that the remoteness function is constant on G. Moreover, an algorithm is presented that decides in O(mlog n) time whether a given graph G with n vertices and m edges is a median graph with geodetic number 2. Several additional structural properties of the remoteness function on hypercubes and median graphs are obtained and some problems listed

Investigations on the structural and operational changes of Ring Seine Fishing Systems of Kerala and its Life Cycle Assessment (lCA)

The study covers theFishing capture technology innovation includes the catching of aquatic animal, using any kind of gear techniques, operated from a vessel. Utilization of fishing techniques varies, depending upon the type of fisheries, and can go from a basic and little hook connected to a line to huge and complex mid water trawls or seines operated by large fishing vessels.The size and autonomy of a fishing vessel is largely determined by its ability to handle, process and store fish in good condition on board, and thus these two characteristics have been greatly influenced by the introduction and utilization of ice and refrigeration machinery. Other technological developments especially hydraulic hauling machinery, fish finding electronics and synthetic twines have also had a major impact on the efficiency and profitability of fishing vessels.A wide variety of fishing gears and practices ranging from small-scale artisanal to advanced mechanised systems are used for fish capture in Kerala. Most important among these fishing gears are trawls, seines, lines, gillnets and entangling nets and traps The modern sector was introduced in 1953 at Neendakara, Shakthikulangara region under the initiative of Indo-Norwegian project (INP). The novel facilities introduced in fishing industry by Indo- Norwegian project accordingly are mechanically operated new boats with new fishing nets. Soon after mechanization, motorization programme gained momentum in Kerala especially in Alleppey, Ernakulam and Kollam districts.

Field measurements of the CO2 evolution rate under different crops during an irrigation cycle in a mountain oasis of Oman

For millennia oasis agriculture has been the backbone of rural livelihood in the desertic Sultanate of Oman. However, little is known about the functioning of these oasis systems, in particular with respect to the C turnover. The objective was to determine the effects of crop, i.e. alfalfa, wheat and bare fallow on the CO2 evolution rate during an irrigation cycle in relation to changes in soil water content and soil temperature. The gravimetric soil water content decreased from initially 24% to approximately 16% within 7 days after irrigation. The mean CO2 evolution rates increased significantly in the order fallow (27.4 mg C m^−2 h^−1) < wheat (45.5 mg C m^−2 h^−1) < alfalfa (97.5 mg C m^−2 h^−1). It can be calculated from these data that the CO2 evolution rate of the alfalfa root system was nearly four times higher than the corresponding rate in the wheat root system. The decline in CO2 evolution rate, especially during the first 4 days after irrigation, was significantly related to the decline in the gravimetric water content, with r = 0.70. CO2 evolution rate and soil temperature at 5 cm depth were negatively correlated (r = -0.56,n = 261) due to increasing soil temperature with decreasing gravimetric water content.

Conceptual structures represented by conceptual graphs and formal concept analysis

Conceptual Graphs and Formal Concept Analysis have in common basic concerns: the focus on conceptual structures, the use of diagrams for supporting communication, the orientation by Peirce's Pragmatism, and the aim of representing and processing knowledge. These concerns open rich possibilities of interplay and integration. We discuss the philosophical foundations of both disciplines, and analyze their specific qualities. Based on this analysis, we discuss some possible approaches of interplay and integration.

Methods of generating carrier-envelope-phase stabilized, intense, few-cycle laser pulses

Ultrafast laser pulses have become an integral part of the toolbox of countless laboratories doing physics, chemistry, and biological research. The work presented here is motivated by a section in the ever-growing, interdisciplinary research towards understanding the fundamental workings of light-matter interactions. Specifically, attosecond pulses can be useful tools to obtain the desired insight. However access to, and the utility of, such pulses is dependent on the generation of intense, few-cycle, carrier-envelope-phase stabilized laser pulses. The presented work can be thought of as a sort of roadmap towards the latter. From the oscillator which provides the broadband seed to amplification methods, the integral pieces necessary for the generation of attosecond pulses are discussed. A range of topics from the fundamentals to design challenges is presented, outfitting the way towards the practical implementation of an intense few-cycle carrier-envelope-phase stabilized laser source.

The Personal tutorial guidance sessions in the framework of the teaching-learning field of the Bologna process: University of Minho (first cycle) courses students’ perceptions

The Bologna Process defends the adoption of a higher education in teaching-learning methodologies that – in contraposition to the previous model based on the transmission of knowledge, which for being essentially theoretical, gives the student a passive role in the knowledge construction process – allows a (pro) active, autonomous and practical learning, where the student acquires and develops his competences. The personal tutorial guidance sessions are included in the teaching contact hours. This abstract presents a study about the University of Minho (first cycle) Courses Students’ perceptions of the personal tutorial guidance sessions’ relevance in the scope of the learning-teaching process, so as to confirm if the implementation/implantation of the commonly called tutorial (type) education, as an approach to an active, autonomous and practical learning, is sensed by the learners themselves

Breaking the Cycle

A radio program requires several creation and work stages before it can be aired on a radio station. It is very important to begin with a defined concept that can be presented to media. Breaking the Cycle will be a radio talk show designed to feature lifestyle subjects. This document will expose all the production phases of the program, including the complete presentation of the edition on obesity, which is the pilot program. Together with detailed format information, the reader will find all the elements necessary in order to produce this radio product, such as work team, budget, technical completion and more. The information gathered in this document can work as a program proposal, in order to sell the show to any radio media organization suitable for the format. In addition to this written presentation, this project includes a recorded audio pilot that features the final product of Breaking the Cycle¿s concept.