Failure of triiodothyronine to inhibit TSH-mediated thyroid hormone release in man

We studied the effect of short-term triiodothyronine administration on thyroid gland responsivity to exogenous thyrotropin in four euthyroid human subjects. Thyroidal iodine release and serum thyroxine during daily im injections of bovine TSH were not significantly inhibited, despite a four-fold elevation in serum T3 concentrations. This negative finding contrasts with earlier positive reports of a regulatory "short-loop" effect of elevated circulating T3 on the thyroid gland. This difference may be due either to the use in previous murine or in vitro studies of non-physiologic, high doses of exogenous T3, or failure to control the withdrawal of the trophic effect of endogenous TSH in man on the subsequent glandular response.     

Network Discovery and Verification

Due to its fast, dynamic, and distributed growth process, it is hard to obtain an accurate map of the Internet. In many cases, such a map-representing the structure of the Internet as a graph with nodes and links-is a prerequisite when investigating properties of the Internet. A common way to obtain such maps is to make certain local measurements at a small subset of the nodes, and then to combine these in order to "discover" (an approximation of) the actual graph. Each of these measurements is potentially quite costly. It is thus a natural objective to minimize the number of measurements which still discover the whole graph. We formalize this problem as a combinatorial optimization problem and consider it for two different models characterized by different types of measurements. We give several upper and lower bounds on the competitive ratio (for the online network discovery problem) and the approximation ratio (for the offline network verification problem) in both models. Furthermore, for one of the two models, we compare four simple greedy strategies in an experimental analysis     

Low-temperature conductance measurements of surface states in HfO2–Si structures with different gate materials

Metal-oxide-semiconductor capacitors based on HfO₂ gate stack with different metal and metal compound gates (Al, TiN, NiSi and NiAlN) are compared to study the effect of the gate electrode material on the trap density at the insulator–semiconductor interface.C–V and G–ω measurements were made in the frequency range from 1 kHz to 1 MHz in the temperature range 180–300 K. From the maximum of the plot G/ω vs. ln(ω) the density of interface states was calculated, and from its position on the frequency axis the trap cross-section was found. Reducing temperature makes it possible to decrease leakage current through the dielectric and to investigate the states located closer to the band edge.The structures under study were shown to contain significant interface trap densities located near the valence band edge (around 2×10¹¹ cm⁻²eV⁻¹ for Al and up to (3.5–5.5)×10¹² cm⁻² eV⁻¹ for other gate materials). The peak in the surface state distribution is situated at 0.18 eV above the valence band edge for Al electrode. The capture cross-section is 5.8×10⁻¹⁷ cm² at 200 K for Al–HfO₂–Si structure.     

Ethnicity, culture, and sexual aggression: Risk and protective factors.

Explanatory models of sexual aggression were examined among mainland Asian American (n = 222), Hawaiian Asian American (n = 127), and European American men (n = 399). The Malamuth et al. (N. M. Malamuth, D. Linz, C. L. Heavey, G. Barnes, & M. Acker, 1995; N. M. Malamuth, R. J. Sockloskie, M. P. Koss, & J. S. Tanaka, 1991) confluence model of sexual aggression, which posits impersonal sex and hostile masculinity as paths to sexual aggression, was consistently supported. Culture-specific moderators of sexual aggression were also identified. Whereas loss of face was a protective factor against sexual aggression in the Asian American samples, it generally was not a protective factor among European Americans. These findings are not a function of actual or perceived minority status. An implication is that theoretical models may need to be augmented with cultural constructs for optimal application in certain ethnic group contexts. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Benchmarking attribute selection techniques for discrete class data mining

Data engineering is generally considered to be a central issue in the development of data mining applications. The success of many learning schemes, in their attempts to construct models of data, hinges on the reliable identification of a small set of highly predictive attributes. The inclusion of irrelevant, redundant, and noisy attributes in the model building process phase can result in poor predictive performance and increased computation. Attribute selection generally involves a combination of search and attribute utility estimation plus evaluation with respect to specific learning schemes. This leads to a large number of possible permutations and has led to a situation where very few benchmark studies have been conducted. This paper presents a benchmark comparison of several attribute selection methods for supervised classification. All the methods produce an attribute ranking, a useful devise for isolating the individual merit of an attribute. Attribute selection is achieved by cross-validating the attribute rankings with respect to a classification learner to find the best attributes. Results are reported for a selection of standard data sets and two diverse learning schemes C4.5 and naive Bayes.     

Consideration of the errors inherent in mapping historical glacier positions in Austria from the ground and space (1893-2001)

The historical record of in situ measurements of the terminus positions of the Pasterze and Kleines Fleißkees glaciers in the eastern Alps of Austria is used to assess uncertainties in the measurement of decadal scale changes using satellite data. Topographic maps beginning in 1893, and satellite data from 1976 to 2001, were studied in concert with ground measurements to measure glacier changes. Ground measurements show that the tongue of the Pasterze Glacier receded ∼1150 m from 1893 to 2001, while satellite-derived measurements, using August 2001 Landsat Enhanced Thematic Mapper Plus (ETM+) data registered to an 1893 topographic map, show a recession of 1300-1800 m, with an unknown error. The measurement accuracy depends on the registration technique and the pixel resolution of the sensor when two satellite images are used. When using topographic maps, an additional source of error is the accuracy of the glacier position shown on the map. Between 1976 and 2001, Landsat-derived measurements show a recession of the terminus of the Pasterze Glacier of 479±136 m (at an average rate of 19.1 m a⁻¹) while measurements from the ground showed a recession of 428 m (at an average rate of 17.1 m a⁻¹). Four-meter resolution Ikonos satellite images from 2000 and 2001 reveal a shrinkage of 22,096±46 m² in the Pasterze tongue. The nearby Kleines Fleißkees glacier lost 30% of its area between 1984 and 2001, and the area of exposed ice increased by 0.44±0.0023 km², according to Landsat satellite measurements. As more recent satellite images are utilized, especially data that are geocoded, the uncertainty associated with measuring glacier changes has decreased. It is not possible to assess the uncertainty when an old topographic map and a satellite image are coregistered.     

Software Process Improvement Problems in Twelve Software Companies: An Empirical Analysis

In this paper we discuss our study of the problems 12 software companies experienced in software development. In total we present qualitative data collected from 45 focus groups that involved over 200 software staff. We look at how different practitioner groups respond to software process improvement problems. We show our classification and analysis of this data using correspondence analysis. Correspondence analysis is a graphical data representation method new to software development research. The aim of the work we present is to develop a more holistic understanding of the problems practitioners are experiencing in their attempts to improve their software processes. Our main finding is that there is an association between a company's capability maturity and patterns of reported problems. Organizational problems are more associated with high maturity companies than with low maturity companies. Low maturity companies are closely linked to problems relating directly to projects such as documentation, timescales, tools and technology. Our findings also confirm differences in practitioner group problems. Senior managers cite problems with goals, culture and politics. Project managers are concerned with timescales, change management, budgets and estimates. Developers are experiencing problems with requirements, testing, documentation, communication, tools and technology. These associations are displayed graphically through correspondence analysis maps.     

Scheduling and Lot Streaming in Flowshops with No-Wait in Process

Lot streaming involves splitting a production lot into a number of sublots, in order to allow the overlapping of successive operations, in multi-machine manufacturing systems. In no-wait flowshop scheduling, sublots are necessarily consistent, that is, they remain the same over all machines. The benefits of lot streaming include reductions in lead times and work-in-process, and increases in machine utilization rates. We study the problem of minimizing the makespan in no-wait flowshops producing multiple products with attached setup times, using lot streaming. Our study of the single product problem resolves an open question from the lot streaming literature. The intractable multiple product problem requires finding the optimal number of sublots, sublot sizes, and a product sequence for each machine. We develop a dynamic programming algorithm to generate all the nondominated schedule profiles for each product that are required to formulate the flowshop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and computationally test an efficient heuristic for this problem. Our results indicate that solutions can quickly be found for flowshops with up to 10 machines and 50 products. Moreover, the solutions found by our heuristic provide a substantial improvement over previously published results.     

A Method for Conceptualising Legal Domains. An Example from the Dutch Unemployment Benefits Act

There has been much talk of the need to build intermediate models of the expertise required preparatory to constructing a knowledge-based system in the legal domain. Such models offer advantages for verification, validation, maintenance and reuse. As yet, however, few such models have been reported at a useful level of detail. In this paper we describe a method for conceptualising legal domains as well as its application to a substantial fragment of the Dutch Unemployment Benefits Act (DUBA).We first discuss the intermediate models (called expertise models), then present a three-stage method for their construction, drawing on the CommonKADS work in knowledge acquisition, conceptual models of statute law, and the KANT method of knowledge analysis. Subsequently, we describe how these techniques were applied to the DUBA, and provide detailed examples of the resulting model. Finally, conclusions on the framework and guidelines are given as well as means of recording and presenting the various design choices.     

RCC-Full: An Effective Network for Parallel Computations

A new interconnection network is proposed for the construction of a massively parallel computer system. The systematic construction of this interconnection network, denoted RCC-FULL, is performed by methodically connecting together a number of basic atoms where a basic atom is a set of fully interconnected nodes. Key communication characteristics are derived and evaluated for RCC-FULL and efficient routing algorithms, which need only local information to route messages between any two nodes, are also derived. AnO(log (N)) sorting algorithm is shown for RCC-FULL and RCC-FULL is shown to emulate deterministically the CRCW PRAM model, with onlyO(log (N)) degradation in time performance. Finally, the hardware cost for the RCC-FULL is estimated as a function of its pin requirements and compared to that of the binary hypercube and most instances of RCC-FULL have substantially lower cost. Hence, RCC-FULL appears to be a particularly effective network for PRAM emulation, and might be considered as a universal network for future supercomputing systems.