A flaw in the use of minimal defining sets for secret sharing schemes

It is shown that in some cases it is possible to reconstruct a block design D uniquely from incomplete knowledge of a minimal defining set for D. This surprising result has implications for the use of minimal defining sets in secret sharing schemes.

Minimal Homogeneous Latin Trades

A latin trade is a subset of a latin square which may be replaced with a disjoint mate to obtain a new latin square. A d-homogeneous latin trade is one which intersects each row, each column and each entry of the latin square either 0 or d times. In this paper we give a construction for minimal d-homogeneous latin trades of size dm, for every integer d >= 3, and m >= 1.75d(2) + 3. We also improve this bound for small values of d. Our proof relies on the construction of cyclic sequences whose adjacent sums are distinct. (c) 2006 Elsevier B.V. All rights reserved.

Grumbling, voting, demonstrating, and rioting: ''Rationality'' and decision-making in intergroup conflict

An individual faced with intergroup conflict chooses A from a vast array of possible actions, ranging from grumbling among ingroup friends to voting and demonstrating to rioting and revolution. The present paper conceptualises these intergroup choices as rationally shaped by perceptions of the benefits and costs associated with the action (expectancy-value processes). However, in presenting a model of agentic normative influence, it is argued that in intergroup contexts group-level costs and benefits play a critical role in individuals' decision-making. In the context of English-French conflict in Quebec, in Canada, four studies provide evidence that group-level costs and benef influence individuals' decision-making in intergro conflict; that the individual level of analysis need mediate the group level of analysis; that group-level co and benefits mediate the relationship between soc identity and intentions to engage in collective action; a that perceptions of outgroup and ingroup norms for inte group behaviours are relatively invariant and predictal related to perceptions of the group- and individual-le, benefits and costs associated with individualistic vers collective actions. By modelling the relationship betwe group norms and group-level costs and benefits, soc psychologists may begin to address the processes th underlie identity-behaviour relationships in collecti action and intergroup conflict.

Rationality as a barrier to peace:micro-evidence from Kosovo

Despite a significant expansion of the literature on conflicts and fragility of states, only a few systematic attempts have been made to link the theoretical literature on social conflicts to the available micro-level information about the people who are involved in these conflicts. We address this lacuna in the literature using a household-level data set from Kosovo. Our analysis suggests that it is individually rational for competing ethnic communities, Kosovar Albanians and Kosovar Serbs, to resist a quick agreement on a social contract to share the region's resources.

Clustering algorithm based on minimal path loss ratio for vehicular communication

Emerging vehicular comfort applications pose a host of completely new set of requirements such as maintaining end-to-end connectivity, packet routing, and reliable communication for internet access while on the move. One of the biggest challenges is to provide good quality of service (QoS) such as low packet delay while coping with the fast topological changes. In this paper, we propose a clustering algorithm based on minimal path loss ratio (MPLR) which should help in spectrum efficiency and reduce data congestion in the network. The vehicular nodes which experience minimal path loss are selected as the cluster heads. The performance of the MPLR clustering algorithm is calculated by rate of change of cluster heads, average number of clusters and average cluster size. Vehicular traffic models derived from the Traffic Wales data are fed as input to the motorway simulator. A mathematical analysis for the rate of change of cluster head is derived which validates the MPLR algorithm and is compared with the simulated results. The mathematical and simulated results are in good agreement indicating the stability of the algorithm and the accuracy of the simulator. The MPLR system is also compared with V2R system with MPLR system performing better. © 2013 IEEE.

Clustering algorithm based on minimal path loss ratio for vehicular communication

Emerging vehicular comfort applications pose a host of completely new set of requirements such as maintaining end-to-end connectivity, packet routing, and reliable communication for internet access while on the move. One of the biggest challenges is to provide good quality of service (QoS) such as low packet delay while coping with the fast topological changes. In this paper, we propose a clustering algorithm based on minimal path loss ratio (MPLR) which should help in spectrum efficiency and reduce data congestion in the network. The vehicular nodes which experience minimal path loss are selected as the cluster heads. The performance of the MPLR clustering algorithm is calculated by rate of change of cluster heads, average number of clusters and average cluster size. Vehicular traffic models derived from the Traffic Wales data are fed as input to the motorway simulator. A mathematical analysis for the rate of change of cluster head is derived which validates the MPLR algorithm and is compared with the simulated results. The mathematical and simulated results are in good agreement indicating the stability of the algorithm and the accuracy of the simulator. The MPLR system is also compared with V2R system with MPLR system performing better. © 2013 IEEE.

Groups with the Minimal Condition on Non-“Nilpotent-by-Finite” Subgroups

We characterize the groups which do not have non-trivial perfect sections and such that any strictly descending chain of non-“nilpotent-by-finite” subgroups is finite.

Greedy Approximation with Regard to Bases and General Minimal Systems

*This research was supported by the National Science Foundation Grant DMS 0200187 and by ONR Grant N00014-96-1-1003