On Guo and Nixon's Criterion for Feature Subset Selection: Assumptions, Implications,and Alternative Options

Guo and Nixon proposed a feature selection method based on maximizing I(x; Y),the multidimensional mutual information between feature vector x and class variable Y. Because computing I(x; Y) can be difficult in practice, Guo and Nixon proposed an approximation of I(x; Y) as the criterion for feature selection. We show that Guo and Nixon's criterion originates from approximating the joint probability distributions in I(x; Y) by second-order product distributions. We remark on the limitations of the approximation and discuss computationally attractive alternatives to compute I(x; Y).

Measurement of the tt̅ cross section in pp̅ collisions at √s=1.96 TeV using dilepton events with a lepton plus track selection

This paper reports a measurement of the cross section for the pair production of top quarks in ppbar collisions at sqrt(s) = 1.96 TeV at the Fermilab Tevatron. The data was collected from the CDF II detector in a set of runs with a total integrated luminosity of 1.1 fb^{-1}. The cross section is measured in the dilepton channel, the subset of ttbar events in which both top quarks decay through t -> Wb -> l nu b where l = e, mu, or tau. The lepton pair is reconstructed as one identified electron or muon and one isolated track. The use of an isolated track to identify the second lepton increases the ttbar acceptance, particularly for the case in which one W decays as W -> tau nu. The purity of the sample may be further improved at the cost of a reduction in the number of signal events, by requiring an identified b-jet. We present the results of measurements performed with and without the request of an identified b-jet. The former is the first published CDF result for which a b-jet requirement is added to the dilepton selection. In the CDF data there are 129 pretag lepton + track candidate events, of which 69 are tagged. With the tagging information, the sample is divided into tagged and untagged sub-samples, and a combined cross section is calculated by maximizing a likelihood. The result is sigma_{ttbar} = 9.6 +/- 1.2 (stat.) -0.5 +0.6 (sys.) +/- 0.6 (lum.) pb, assuming a branching ratio of BR(W -> ell nu) = 10.8% and a top mass of m_t = 175 GeV/c^2.

Moment-Matched Lognormal Modeling of Uplink Interference with Power Control and Cell Selection

We develop an alternate characterization of the statistical distribution of the inter-cell interference power observed in the uplink of CDMA systems. We show that the lognormal distribution better matches the cumulative distribution and complementary cumulative distribution functions of the uplink interference than the conventionally assumed Gaussian distribution and variants based on it. This is in spite of the fact that many users together contribute to uplink interference, with the number of users and their locations both being random. Our observations hold even in the presence of power control and cell selection, which have hitherto been used to justify the Gaussian distribution approximation. The parameters of the lognormal are obtained by matching moments, for which detailed analytical expressions that incorporate wireless propagation, cellular layout, power control, and cell selection parameters are developed. The moment-matched lognormal model, while not perfect, is an order of magnitude better in modeling the interference power distribution.

Expression of GC-C, a receptor-guanylate cyclase, and its endogenous ligands uroguanylin and guanylin along the rostrocaudal axis of the intestine

Members of the receptor-guanylate cyclase (rGC) family possess an intracellular catalytic domain that is regulated by an extracellular receptor domain. GC-C, an intestinally expressed rGC, was initially cloned by homology as an orphan receptor. The search for its Ligands has yielded three candidates: STa (a bacterial toxin that causes traveler's diarrhea) and the endogenous peptides uroguanylin and guanylin. Here, by performing Northern and Western blots, and by measuring [I-125]STa binding and STa-dependent elevation of cGMP levels, we investigate whether the distribution of GC-C matches that of its endogenous ligands in the rat intestine. We establish that 1) uroguanylin is essentially restricted to small bowel; 2) guanylin is very low in proximal small bowel, increasing to prominent levels in distal small bowel and throughout colon; 3) GC-C messenger RNA and STa-binding sites are uniformly expressed throughout the intestine; and 4) GC-C-mediated cGMP synthesis peaks at the proximal and distal extremes of the intestine (duodenum and colon), but is nearly absent in the middle (ileum). These observations suggest that GC-C's activity may be posttranslationally regulated, demonstrate that the distribution of GC-C is appropriate to mediate the actions of both uroguanylin and guanylin, and help to refine current hypotheses about the physiological role(s) of these peptides.

A Ca2+-sensitive cyclic-3',5'-nucleotide phosphodiesterase from sheep lung modulated by a tightly bound endogenous calmodulin.

Highly purified sheep lung cyclic-3',5'-nucleotide phosphodiesterase was sensitive to Ca2+/EGTA but insensitive to exogenous calmodulin. The Ca2+-sensitivity was inhibited by trifluoperazine. Heat-treated enzyme could activate a calmodulin-deficient phosphodiesterase, suggesting the presence of endogenous calmodulin in sheep lung cyclic-3',5'-nucleotide phosphodiesterase, possibly associated with the enzyme in a Ca2+-independent manner.

Relay Selection and Data Transmission Throughput Tradeoff in Cooperative Systems

A common and practical paradigm in cooperative communications is the use of a dynamically selected 'best' relay to decode and forward information from a source to a destination. Such a system consists of two core phases: a relay selection phase, in which the system expends resources to select the best relay, and a data transmission phase, in which it uses the selected relay to forward data to the destination. In this paper, we study and optimize the trade-off between the selection and data transmission phase durations. We derive closed-form expressions for the overall throughput of a non-adaptive system that includes the selection phase overhead, and then optimize the selection and data transmission phase durations. Corresponding results are also derived for an adaptive system in which the relays can vary their transmission rates. Our results show that the optimal selection phase overhead can be significant even for fast selection algorithms. Furthermore, the optimal selection phase duration depends on the number of relays and whether adaptation is used.

Optimal Weighted Antenna Selection For Imperfect Channel Knowledge From Training

Receive antenna selection (AS) reduces the hardware complexity of multi-antenna receivers by dynamically connecting an instantaneously best antenna element to the available radio frequency (RF) chain. Due to the hardware constraints, the channels at various antenna elements have to be sounded sequentially to obtain estimates that are required for selecting the ``best'' antenna and for coherently demodulating data. Consequently, the channel state information at different antennas is outdated by different amounts. We show that, for this reason, simply selecting the antenna with the highest estimated channel gain is not optimum. Rather, the channel estimates of different antennas should be weighted differently, depending on the training scheme. We derive closed-form expressions for the symbol error probability (SEP) of AS for MPSK and MQAM in time-varying Rayleigh fading channels for arbitrary selection weights, and validate them with simulations. We then derive an explicit formula for the optimal selection weights that minimize the SEP. We find that when selection weights are not used, the SEP need not improve as the number of antenna elements increases, which is in contrast to the ideal channel estimation case. However, the optimal selection weights remedy this situation and significantly improve performance.

Analysis,Insights and Generalization of a Fast Decentralized Relay Selection Mechanism

Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays and analyzed, mechanisms that perform the selection in a distributed manner have received relatively less attention. In this paper, we analyze a splitting algorithm for selecting the single best relay amongst a known number of active nodes in a cooperative network. We develop new and exact asymptotic analysis for computing the average number of slots required to resolve the best relay. We then propose and analyze a new algorithm that addresses the general problem of selecting the best Q >= 1 relays. Regardless of the number of relays, the algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. Our analysis also brings out an intimate relationship between multiple access selection and multiple access control algorithms.

Design of Single-Input-Single-Output Compliant Mechanisms for Practical Applications Using Selection Maps

We present an interactive map-based technique for designing single-input-single-output compliant mechanisms that meet the requirements of practical applications. Our map juxtaposes user-specifications with the attributes of real compliant mechanisms stored in a database so that not only the practical feasibility of the specifications can be discerned quickly but also modifications can be done interactively to the existing compliant mechanisms. The practical utility of the method presented here exceeds that of shape and size optimizations because it accounts for manufacturing considerations, stress limits, and material selection. The premise for the method is the spring-leverage (SL) model, which characterizes the kinematic and elastostatic behavior of compliant mechanisms with only three SL constants. The user-specifications are met interactively using the beam-based 2D models of compliant mechanisms by changing their attributes such as: (i) overall size in two planar orthogonal directions, separately and together, (ii) uniform resizing of the in-plane widths of all the beam elements, (iii) uniform resizing of the out-of-plane thick-nesses of the beam elements, and (iv) the material. We present a design software program with a graphical user interface for interactive design. A case-study that describes the design procedure in detail is also presented while additional case-studies are posted on a website. DOI:10.1115/1.4001877].

Optimal Receive Antenna Selection in Time-Varying Fading Channels with Practical Training Constraints

Hardware constraints, which motivate receive antenna selection, also require that various antenna elements at the receiver be sounded sequentially to obtain estimates required for selecting the `best' antenna and for coherently demodulating data thereafter. Consequently, the channel state information at different antennas is outdated by different amounts and corrupted by noise. We show that, for this reason, simply selecting the antenna with the highest estimated channel gain is not optimum. Rather, a preferable strategy is to linearly weight the channel estimates of different antennas differently, depending on the training scheme. We derive closed-form expressions for the symbol error probability (SEP) of AS for MPSK and MQAM in time-varying Rayleigh fading channels for arbitrary selection weights, and validate them with simulations. We then characterize explicitly the optimal selection weights that minimize the SEP. We also consider packet reception, in which multiple symbols of a packet are received by the same antenna. New suboptimal, but computationally efficient weighted selection schemes are proposed for reducing the packet error rate. The benefits of weighted selection are also demonstrated using a practical channel code used in third generation cellular systems. Our results show that optimal weighted selection yields a significant performance gain over conventional unweighted selection.

Effect of Neutralization of Endogenous Follicle Stimulating Hormone (FSH) or Luteinizing Hormone (LH) on Ovarian Lipids in the Hamster: A Histochemical and Biochemical Evaluation

The effect of neutralizing FSH or LH on ovarian lipids in the cycling hamster was studied. In the normal cycling hamster on the day of proestrus, histochemical examination revealed the presence of sudanophilic lipids in the granulosa cells of the follicles and in the interstitium. A clear reduction in the intensity of lipid staining was observed on proestrus in the ovary of hamsters treated with FSH antiserum on the previous proestrus. Similar treatment with antiserum to LH, on the other hand, caused an accumulation of lipids in these structures. Estimation of the free and esterified fractions of cholesterol and triglycerides in the nonluteal tissue of the ovary of hamsters on proestrus following treatment with FSH antiserum on the previous proestrus revealed a significant reduction in all 3 lipid components. Even a short term deprivation of FSH caused a similar reduction in these lipids in the ovary. In contrast, treatment with LH antiserum either on the previous proestrus or on the previous day (diestrus-2) resulted in an enhancement in esterified cholesterol and triglycerides, while it caused a reduction in the free cholesterol fraction of the ovary on proestrus.It is suggested that though treatment with antisera to either FSH or LH causes a disruption in follicular maturation, their effect on lipid metabolism is different. A positive role for FSH and LH in maintaining normal sterol and triglyceride levels in the nonluteal ovarian tissue of cycling hamster is indicated.

The Relay Selection and Transmission Trade-off in Cooperative Communication Systems

A common and practical paradigm in cooperative communication systems is the use of a dynamically selected `best' relay to decode and forward information from a source to a destination. Such systems use two phases - a relay selection phase, in which the system uses transmission time and energy to select the best relay, and a data transmission phase, in which it uses the spatial diversity benefits of selection to transmit data. In this paper, we derive closed-form expressions for the overall throughput and energy consumption, and study the time and energy trade-off between the selection and data transmission phases. To this end, we analyze a baseline non-adaptive system and several adaptive systems that adapt the selection phase, relay transmission power, or transmission time. Our results show that while selection yields significant benefits, the selection phase's time and energy overhead can be significant. In fact, at the optimal point, the selection can be far from perfect, and depends on the number of relays and the mode of adaptation. The results also provide guidelines about the optimal system operating point for different modes of adaptation. The analysis also sheds new insights on the fast splitting-based algorithm considered in this paper for relay selection.