900 resultados para Popular front
Resumo:
Digital Image
Resumo:
Digital Image
Resumo:
The Schoolman Papers reflect Dr. Albert P. and Mrs. Bertha Schoolmans' staunch dedication to Jewish education, Jewish causes, and Israel. Bertha Schoolman, a lifelong member of Hadassah, assisted thousands of Israeli youth as chairman of the Youth Aliyah Committee. Her diaries, photos, scrapbooks, and correspondence record her numerous visits to Israel on which she helped set up schools, met with Israeli dignitaries, and participated in Zionist Conferences and events. The collection includes a 1936 letter from Hadassah founder, Henrietta Szold, praising Mrs. Schoolman's work as well as a letter from the father of Anne Frank, thanking Mrs. Schoolman for naming a Youth Aliyah center the "Anne Frank Haven" after his later daughter.
Resumo:
In this paper we consider the problem of computing an “optimal” popular matching. We assume that our input instance View the MathML source admits a popular matching and here we are asked to return not any popular matching but an optimal popular matching, where the definition of optimality is given as a part of the problem statement; for instance, optimality could be fairness in which case we are required to return a fair popular matching. We show an O(n2+m) algorithm for this problem, assuming that the preference lists are strict, where m is the number of edges in G and n is the number of applicants.
Resumo:
We study the problem of matching applicants to jobs under one-sided preferences: that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be rnore popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M,T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based oil the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distributions over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P,Q) >= phi(Q,P) for all mixed matchings Q. We show that popular mixed matchings always exist. and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem.
Resumo:
Amongst social players, the prank, as a social performance form, holds a lot of potential to impact on personal, relational and social status within a group or between one group and another group. More than simply showing off, a prank in the strictest definition of the term, is a social performance in which one player, a prankster, deploys mischief, trickery or deceit, to cause a moment of anxiety, fear or anger about a happening for another spectator-become-collaborating-player, a prankee – to enhance social bonds, entertain, or comment on a social, cultural or political phenomenon. During a prank, the prankster’s ability to be creative, clever or culturally astute, and the prankee’s ability to be duped, be a good sport, play along, or even play/pay the prankster back, both become fodder for other spectators and society to scrutinize. In Australia, pranking traditions are popular with many social groups, from the community-building pranks of footballers, bucks parties and ‘drop bear’ tales told to tourists, to the more controversial pranks of radio shock jocks, activists and artists. In this paper, I consider whether theatrical terms – theoretical terms from the stage such as actor, acting, objective, arc, performance, audience and emotion, such as those offered by Joseph Roach – are useful in understanding the passion some social players show for pranksterism. Are theatrical terms such as Roach’s as useful as analysts of social self-performance such as Erving Goffman suggest they are? Do they assist in understanding the personal actions, reactions and emotions of prankster and prankee? Do they assist in understanding the power relations between prankster and prankee? Do they assist in understanding the relation between the prank – be it an everyday prank amongst families, friends and coworkers, an entertainment program prank of the sort seen on Prank Patrol, Punked or Scare Tactics, or an activist pranks perpetrated by a guerrilla artist, ‘jammers’ or ‘hackers’ intent on turning dominant social systems back on themselves – the social players, and the public sphere in which the prank takes place? I reflect on how reading pranks as performances, by players, for highly participatory audiences, helps understand why they are so prevalent, and so recurrent across times, cultures and contexts, and also so controversial when not performed well enough – or when performed too well – prompting outrage from the prankster, prankee or society as passionate as any debate about a performance by players in a theatre.
Resumo:
A switched rectifier DC voltage source three-level neutral-point-clamped (NPC) converter topology is proposed here to alleviate the inverter from capacitor voltage balancing in three-level drive systems. The proposed configuration requires only one DC link with a voltage of half of that needed in a conventional NPC inverter. To obtain a rated DC link voltage, the rectifier DC source is alternately connected in parallel to one of the two series capacitors using two switches and two diodes with device voltage ratings of half the total DC bus voltage. The frequency at which the voltage source is switched is independent of the inverter and will not affect its operation since the switched voltage source in this configuration balances the capacitors automatically. The proposed configuration can also be used as a conventional two-level inverter in the lower modulation index range, thereby increasing the reliability of the drivesystem. A space-vector-based PWM scheme is used to verify this proposed topology on a laboratory system.
Resumo:
We investigate the influence of viscoelastic nature of the adhesive on the intermittent peel front dynamics by extending a recently introduced model for peeling of an adhesive tape. As time and rate-dependent deformation of the adhesives are measured in stationary conditions, a crucial step in incorporating the viscoelastic effects applicable to unstable intermittent peel dynamics is the introduction of a dynamization scheme that eliminates the explicit time dependence in terms of dynamical variables. We find contrasting influences of viscoelastic contribution in different regions of tape mass, roller inertia, and pull velocity. As the model acoustic energy dissipated depends on the nature of the peel front and its dynamical evolution, the combined effect of the roller inertia and pull velocity makes the acoustic energy noisier for small tape mass and low-pull velocity while it is burstlike for low-tape mass, intermediate values of the roller inertia and high-pull velocity. The changes are quantified by calculating the largest Lyapunov exponent and analyzing the statistical distributions of the amplitudes and durations of the model acoustic energy signals. Both single and two stage power-law distributions are observed. Scaling relations between the exponents are derived which show that the exponents corresponding to large values of event sizes and durations are completely determined by those for small values. Th scaling relations are found to be satisfied in all cases studied. Interestingly, we find only five types of model acoustic emission signals among multitude of possibilities of the peel front configurations.
Resumo:
We consider the problem of matching people to jobs, where each person ranks a subset of jobs in an order of preference, possibly involving ties. There are several notions of optimality about how to best match each person to a job; in particular, popularity is a natural and appealing notion of optimality. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not adroit popular matchings. This motivates the following extension of the popular rnatchings problem:Given a graph G; = (A boolean OR J, E) where A is the set of people and J is the set of jobs, and a list < c(1), c(vertical bar J vertical bar)) denoting upper bounds on the capacities of each job, does there exist (x(1), ... , x(vertical bar J vertical bar)) such that setting the capacity of i-th, job to x(i) where 1 <= x(i) <= c(i), for each i, enables the resulting graph to admit a popular matching. In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c is 1 or 2.
Resumo:
In this paper we have discussed limits of the validity of Whitham's characteristic rule for finding successive positions of a shock in one space dimension. We start with an example for which the exact solution is known and show that the characteristic rule gives correct result only if the state behind the shock is uniform. Then we take the gas dynamic equations in two cases: one of a shock propagating through a stratified layer and other down a nonuniform tube and derive exact equations for the evolution of the shock amplitude along a shock path. These exact results are then compared with the results obtained by the characteristic rule. The characteristic rule not only incorrectly accounts for the deviation of the state behind the shock from a uniform state but also gives a coefficient in the equation which differ significantly from the exact coefficients for a wide range of values of the shock strength.
Resumo:
Objective : The main objective of this work was to study the antipyretic and antibacterial activity of C. erectus (Buch.-Ham.) Verdcourt leaf extract in an experimental albino rat model. Materials and Methods : The methanol extract of C. erectus leaf (MECEL) was evaluated for its antipyretic potential on normal body temperature and Brewers yeast-induced pyrexia in albino rats model. While the antibacterial activity of MECEL against five Gram (-) and three Gram () bacterial strains and antimycotic activity was investigated against four fungi using agar disk diffusion and microdilution methods. Result : Yeast suspension (10 mL/kg b.w.) elevated rectal temperature after 19 h of subcutaneous injection. Oral administration of MECEL at 100 and 200 mg/kg b.w. showed significant reduction of normal rectal body temperature and yeast-provoked elevated temperature (38.8 0.2 and 37.6 0.4, respectively, at 2-3 h) in a dose-dependent manner, and the effect was comparable to that of the standard antipyretic drug-paracetamol (150 mg/kg b.w.). MECEL at 2 mg/disk showed broad spectrum of growth inhibition activity against both groups of bacteria. However, MECEL was not effective against the yeast strains tested in this study. Conclusion : This study revealed that the methanol extract of C. erectus exhibited significant antipyretic activity in the tested models and antibacterial activity as well, and may provide the scientific rationale for its popular use as antipyretic agent in Khamptiss folk medicines.
Resumo:
Analytical and numerical solutions of a general problem related to the radially symmetric inward spherical solidification of a superheated melt have been studied in this paper. In the radiation-convection type boundary conditions, the heat transfer coefficient has been taken as time dependent which could be infinite, at time,t=0. This is necessary, for the initiation of instantaneous solidification of superheated melt, over its surface. The analytical solution consists of employing suitable fictitious initial temperatures and fictitious extensions of the original region occupied by the melt. The numerical solution consists of finite difference scheme in which the grid points move with the freezing front. The numerical scheme can handle with ease the density changes in the solid and liquid states and the shrinkage or expansions of volumes due to density changes. In the numerical results, obtained for the moving boundary and temperatures, the effects of several parameters such as latent heat, Boltzmann constant, density ratios, heat transfer coefficients, etc. have been shown. The correctness of numerical results has also been checked by satisfying the integral heat balance at every timestep.
Resumo:
The similar to 2500 km long Himalayan arc has experienced three large to great earthquakes of M-w 7.8 to 8.4 during the past century, but none produced surface rupture. Paleoseismic studies have been conducted during the last decade to begin understanding the timing, size, rupture extent, return period, and mechanics of the faulting associated with the occurrence of large surface rupturing earthquakes along the similar to 2500 km long Himalayan Frontal Thrust (HFT) system of India and Nepal. The previous studies have been limited to about nine sites along the western two-thirds of the HFT extending through northwest India and along the southern border of Nepal. We present here the results of paleoseismic investigations at three additional sites further to the northeast along the HFT within the Indian states of West Bengal and Assam. The three sites reside between the meizoseismal areas of the 1934 Bihar-Nepal and 1950 Assam earthquakes. The two westernmost of the sites, near the village of Chalsa and near the Nameri Tiger Preserve, show that offsets during the last surface rupture event were at minimum of about 14 m and 12 m, respectively. Limits on the ages of surface rupture at Chalsa (site A) and Nameri (site B), though broad, allow the possibility that the two sites record the same great historical rupture reported in Nepal around A.D. 1100. The correlation between the two sites is supported by the observation that the large displacements as recorded at Chalsa and Nameri would most likely be associated with rupture lengths of hundreds of kilometers or more and are on the same order as reported for a surface rupture earthquake reported in Nepal around A.D. 1100. Assuming the offsets observed at Chalsa and Nameri occurred synchronously with reported offsets in Nepal, the rupture length of the event would approach 700 to 800 km. The easternmost site is located within Harmutty Tea Estate (site C) at the edges of the 1950 Assam earthquake meizoseismal area. Here the most recent event offset is relatively much smaller (<2.5 m), and radiocarbon dating shows it to have occurred after A.D. 1100 (after about A.D. 1270). The location of the site near the edge of the meizoseismal region of the 1950 Assam earthquake and the relatively lesser offset allows speculation that the displacement records the 1950 M-w 8.4 Assam earthquake. Scatter in radiocarbon ages on detrital charcoal has not resulted in a firm bracket on the timing of events observed in the trenches. Nonetheless, the observations collected here, when taken together, suggest that the largest of thrust earthquakes along the Himalayan arc have rupture lengths and displacements of similar scale to the largest that have occurred historically along the world's subduction zones.
Resumo:
We consider the problem of matching people to items, where each person ranks a subset of items in an order of preference, possibly involving ties. There are several notions of optimality about how to best match a person to an item; in particular, popularity is a natural and appealing notion of optimality. A matching M* is popular if there is no matching M such that the number of people who prefer M to M* exceeds the number who prefer M* to M. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not admit popular matchings. This motivates the following extension of the popular matchings problem: Given a graph G = (A U 3, E) where A is the set of people and 2 is the set of items, and a list < c(1),...., c(vertical bar B vertical bar)> denoting upper bounds on the number of copies of each item, does there exist < x(1),...., x(vertical bar B vertical bar)> such that for each i, having x(i) copies of the i-th item, where 1 <= xi <= c(i), enables the resulting graph to admit a popular matching? In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c(i) is 1 or 2. We show a polynomial time algorithm for a variant of the above problem where the total increase in copies is bounded by an integer k. (C) 2011 Elsevier B.V. All rights reserved.