Acute restraint stress alters subsequent auditory fear conditioning in the rat

The neural basis of Pavlovian fear conditioning is well understood and depends upon neural processes within the amygdala. Stress is known to play a role in the modulation of fear-related behavior, including Pavlovian fear conditioning. Chronic restraint stress has been shown to enhance fear conditioning to discrete and contextual stimuli; however, the time course and extent of restraint that is essential for this modulation of fear learning remains unclear. Thus, we tested the extent to which a single exposure to 1 hr of restraint would alter subsequent auditory fear conditioning in rats.

GABAergic inhibition in the fear conditioning circuit of the lateral amygdala is potentiated by dopamine D1 agonists

Auditory fear conditioning is dependent on auditory signaling from the medial geniculate (MGm) and the auditory cortex (TE3) to principal neurons of the lateral amygdala (LA). Local circuit GABAergic interneurons are known to inhibit LA principal neurons via fast and slow IPSP's. Stimulation of MGm and TE3 produces excitatory post-synaptic potentials in both LA principal and interneurons, followed by inhibitory post-synaptic potentials. Manipulations of D1 receptors in the lateral and basal amygdala modulate the retrieval of learned association between an auditory CS and foot shock. Here we examined the effects of D1 agonists on GABAergic IPSP's evoked by stimulation of MGm and TE3 afferents in vitro. Whole cell patch recordings were made from principal neurons of the LA, at room temperature, in coronal brain slices using standard methods. Stimulating electrodes were placed on the fiber tracts medial to the LA and at the external capsule/layer VI border dorsal to the LA to activate (0.1-0.2mA) MGm and TE3 afferents respectively. Neurons were held at -55.0 mV by positive current injection to measure the amplitude of the fast IPSP. Changes in input resistance and membrane potential were measured in the absence of current injection. Stimulation of MGm or TE3 afferents produced EPSP's in the majority of principal neurons and in some an EPSP/IPSP sequence. Stimulation of MGm afferents produced IPSP's with amplitudes of -2.30 ± 0.53 mV and stimulation of TE3 afferents produced IPSP's with amplitudes of -1.98 ± 1.26 mV. Bath application of 20μM SKF38393 increased IPSP amplitudes to -5.94 ± 1.62 mV (MGm, n=3) and-5.46 ± 0.31 mV (TE3, n=3). Maximal effect occurred <10mins. A small increase in resting membrane potential and decrease in input resistance were observed. These data suggest that DA modulates both the auditory thalamic and auditory cortical inputs to the LA fear conditioning circuit via local GABAergic circuits. Supported by NIMH Grants 00956, 46516, and 58911.

Food justice or food sovereignty? Understanding the rise of urban food movements in the USA

As world food and fuel prices threaten expanding urban populations, there is greater need for the urban poor to have access and claims over how and where food is produced and distributed. This is especially the case in marginalized urban settings where high proportions of the population are food insecure. The global movement for food sovereignty has been one attempt to reclaim rights and participation in the food system and challenge corporate food regimes. However, given its origins from the peasant farmers' movement, La Via Campesina, food sovereignty is often considered a rural issue when increasingly its demands for fair food systems are urban in nature. Through interviews with scholars, urban food activists, non-governmental and grassroots organizations in Oakland and New Orleans in the United States of America, we examine the extent to which food sovereignty has become embedded as a concept, strategy and practice. We consider food sovereignty alongside other dominant US social movements such as food justice, and find that while many organizations do not use the language of food sovereignty explicitly, the motives behind urban food activism are similar across movements as local actors draw on elements of each in practice. Overall, however, because of the different histories, geographic contexts, and relations to state and capital, food justice and food sovereignty differ as strategies and approaches. We conclude that the US urban food sovereignty movement is limited by neoliberal structural contexts that dampen its approach and radical framework. Similarly, we see restrictions on urban food justice movements that are also operating within a broader framework of market neoliberalism. However, we find that food justice was reported as an approach more aligned with the socio-historical context in both cities, due to its origins in broader class and race struggles.

Sokolosky: A Story of a Family 1860-1990

Genealogy of Sokolosky family reaching back to their Posen origins; emigration to New Orleans, Mississippi and Texas in 1860s; further family history in USA until 1990. Contains also preface by Rabbi Malcolm H. Stern, photographes of members of Sokolosky family, of gravestones and of family documents.

Solis-Cohen family papers, 1808-1990.

Correspondence, diaries, acount books, pamphlets, and other personal and professional materials pertaining to Jacob da Silva Solis and his descendents.

Judah P. Benjamin collection, undated, 1838-1942.

The collection consists of 25 letters written by Benjamin between 1838 and 1881 on a variety of subjects, four Confederate notes and two bonds bearing his picture, miscellaneous items about Benjamin (1893-1942), nine issues of the Congressional globe with speeches by Benjamin, as well as separate copies of his printed speeches, and a photostatic copy of the "Diary of Events" (400 pp.) kept by Benjamin, the original of which is in the Library of Congress (1862-1864).

Jacobi-Schlossberg family papers, undated, 1870-2000.

The collection documents the lives Sarah Simon Jacobi (1857-1943), Freda Moritz Jacobi (1886-1939), Alice Jacobi Schlossberg (1912-1987) and Deda Schlossberg Miller (1940- ), through diaries, baby books, photographs, and correspondence. Also included in the collection are a silver card case, a silver coffee pot and creamer, and an etching of the Jacobi family home. For further information on these objects see the museum curator.

Myer S. Isaacs collection undated, 1844, 1851-1925

Contains correspondence and newspaper clippings relating to the centennial birthday celebration of and memorial services for Sir Moses Montefiore; correspondence consists primarily of replies to a circular advocating the holding of memorial services issued by the Board of Delegates on Civil and Religious Rights from congregations in Buffalo, Charleston, Chicago, Cincinnati, Cleveland, and Detroit. Contains also correspondence relating to the activities of the Alliance Israelite Universelle on behalf of Palestine and the Jews in the Balkan States and Morocco and to the establishment of United States committees for the Alliance and the raising of funds, including correspondence with H. Pereira Mendes, Henry S. Jacobs, John Hay, and Adolphe Cremieux as well as letters from Baltimore, Cleveland, Detroit, Galveston, Minneapolis, Mobile, Rochester, St. Louis, and San Francisco. Also contains extensive correspondence concerning anti-semitism in Russia, aid to Jewish immigrants, and Jewish agricultural colonies in the United States, with letters from James G. Blaine, Manuel Augustus Kursheedt, Sabato Morais, Charles Nathan, Hirsch Leib Sabsovich, (Isaac N.?) Seligman and Judah Wechsler, among others. Also contains newspaper clippings and other items relating to Jewish life during the late 19th century and articles and memorabilia about various members of the Isaacs family.

A method of fraud & intrusion detection for e-payment systems in mobile

The need for paying with mobile devices has urged the development of payment systems for mobile electronic commerce. In this paper we have considered two important abuses in electronic payments systems for detection. The fraud, which is an intentional deception accomplished to secure an unfair gain, and an intrusion which are any set of actions that attempt to compromise the integrity, confidentiality or availability of a resource. Most of the available fraud and intrusion detection systems for e-payments are specific to the systems where they have been incorporated. This paper proposes a generic model called as Activity-Event-Symptoms(AES) model for detecting fraud and intrusion attacks which appears during payment process in the mobile commerce environment. The AES model is designed to identify the symptoms of fraud and intrusions by observing various events/transactions occurs during mobile commerce activity. The symptoms identification is followed by computing the suspicion factors for event attributes, and the certainty factor for a fraud and intrusion is generated using these suspicion factors. We have tested the proposed system by conducting various case studies, on the in-house established mobile commerce environment over wired and wire-less networks test bed.

Link route pricing for enhanced QoS

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes under multiple service classes. Our work draws upon [1] and [2] in various ways. We use the Tirupati pricing scheme in conjunction with the stochastic approximation based adaptive pricing methodology for queue control (proposed in [1]) for minimizing network congestion. However, unlike the methodology of [1] where pricing for entire routes is directly considered, we consider prices for individual link-service grade tuples. Further, we adapt the methodology proposed in [21 for a single-node scenario to the case of a network of nodes, for evaluating performance in terms of price, revenue rate and disutility. We obtain considerable performance improvements using our approach over that in [1]. In particular, our approach exhibits a throughput improvement in the range of 54 to 80 percent in all cases studied (over all routes) while exhibiting a lower packet delay in the range of 26 to 38 percent over the scheme in [1].

Discrete parameter simulation optimization algorithms with applications to admission control with dependent service times

We propose certain discrete parameter variants of well known simulation optimization algorithms. Two of these algorithms are based on the smoothed functional (SF) technique while two others are based on the simultaneous perturbation stochastic approximation (SPSA) method. They differ from each other in the way perturbations are obtained and also the manner in which projections and parameter updates are performed. All our algorithms use two simulations and two-timescale stochastic approximation. As an application setting, we consider the important problem of admission control of packets in communication networks under dependent service times. We consider a discrete time slotted queueing model of the system and consider two different scenarios - one where the service times have a dependence on the system state and the other where they depend on the number of arrivals in a time slot. Under our settings, the simulated objective function appears ill-behaved with multiple local minima and a unique global minimum characterized by a sharp dip in the objective function in a small region of the parameter space. We compare the performance of our algorithms on these settings and observe that the two SF algorithms show the best results overall. In fact, in many cases studied, SF algorithms converge to the global minimum.

Network flow-control using asynchronous stochastic approximation

We propose several stochastic approximation implementations for related algorithms in flow-control of communication networks. First, a discrete-time implementation of Kelly's primal flow-control algorithm is proposed. Convergence with probability 1 is shown, even in the presence of communication delays and stochastic effects seen in link congestion indications. This ensues from an analysis of the flow-control algorithm using the asynchronous stochastic approximation (ASA) framework. Two relevant enhancements are then pursued: a) an implementation of the primal algorithm using second-order information, and b) an implementation where edge-routers rectify misbehaving flows. Next, discretetime implementations of Kelly's dual algorithm and primaldual algorithm are proposed. Simulation results a) verifying the proposed algorithms and, b) comparing the stability properties are presented.

SC-FDMA versus OFDMA: Sensitivity to Large Carrier Frequency and Timing Offsets on the Uplink

In this paper, we present a comparison between the sensitivity of SC-FDMA and OFDMA schemes to large carrier frequency offsets (CFO) and timing offsets (TO) of different users on the uplink. Our study shows the following observations: 1) In the ideal case of zero CFOs and TOs (i.e., perfect synchronization), the uncoded BER performance of SC-FDMA with frequency domain MMSE equalizer is better than that of OFDMA due to the inherent frequency diversity that is possible in SCFDMA. Also, because of inter-symbol interference in SC-FDMA, the performance of SC-FDMA with MMSE equalizer can be further improved by using low-complexity interference cancellation (IC) techniques. 2) In the presence of large CFOs and TOs, significant multiuser interference (MUI) gets introduced, and hence the performance of SC-FDMA with MMSE equalizer can get worse than that of OFDMA. However, the performance advantage of SC-FDMA with MMSE equalizer over OFDMA (due to the potential for frequency diversity benefit in SC-FDMA) can be restored by adopting multistage IC techniques, using the knowledge of CFOs and TOs of different users at the receiver

A Low-Complexity, Full-Rate, Full-Diversity 2 x 2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multiple-output (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation. Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 x 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations, compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for non-rectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.