University of Illinois Urbana-Champaign
UniversityUrbana, Illinois, United States
Research output, citation impact, and the most-cited recent papers from University of Illinois Urbana-Champaign (United States). Aggregated across the NobleBlocks index of 300M+ scholarly works.
Top-cited papers from University of Illinois Urbana-Champaign
Our ability to generate and collect data has been increasing rapidly. Not only are all of our business, scientific, and government transactions now computerized, but the widespread use of digital cameras, publication tools, and bar codes also generate data. On the collection side, scanned text and image platforms, satellite remote sensing systems, and the World Wide Web have flooded us with a tremendous amount of data. This explosive growth has generated an even more urgent need for new techniques and automated tools that can help us transform this data into useful information and knowledge.Like the first edition, voted the most popular data mining book by KD Nuggets readers, this book explores concepts and techniques for the discovery of patterns hidden in large data sets, focusing on issues relating to their feasibility, usefulness, effectiveness, and scalability. However, since the publication of the first edition, great progress has been made in the development of new data mining methods, systems, and applications. This new edition substantially enhances the first edition, and new chapters have been added to address recent developments on mining complex types of data- including stream data, sequence data, graph structured data, social network data, and multi-relational data.Whether you are a seasoned professional or a new student of data mining, this book has much to offer you:* A comprehensive, practical look at the concepts and techniques you need to know to get the most out of real business data.* Updates that incorporate input from readers, changes in the field, and more material on statistics and machine learning.* Dozens of algorithms and implementation examples, all in easily understood pseudo-code and suitable for use in real-world, large-scale data mining projects.* Complete classroom support for instructors at www.mkp.com/datamining2e companion site.
The Agrobacterium vacuum infiltration method has made it possible to transform Arabidopsis thaliana without plant tissue culture or regeneration. In the present study, this method was evaluated and a substantially modified transformation method was developed. The labor-intensive vacuum infiltration process was eliminated in favor of simple dipping of developing floral tissues into a solution containing Agrobacterium tumefaciens, 5% sucrose and 500 microliters per litre of surfactant Silwet L-77. Sucrose and surfactant were critical to the success of the floral dip method. Plants inoculated when numerous immature floral buds and few siliques were present produced transformed progeny at the highest rate. Plant tissue culture media, the hormone benzylamino purine and pH adjustment were unnecessary, and Agrobacterium could be applied to plants at a range of cell densities. Repeated application of Agrobacterium improved transformation rates and overall yield of transformants approximately twofold. Covering plants for 1 day to retain humidity after inoculation also raised transformation rates twofold. Multiple ecotypes were transformable by this method. The modified method should facilitate high-throughput transformation of Arabidopsis for efforts such as T-DNA gene tagging, positional cloning, or attempts at targeted gene replacement.
The book is an introduction to the idea of design patterns in software engineering, and a catalog of twenty-three common patterns. The nice thing is, most experienced OOP designers will find out they've known about patterns all along. It's just that they've never considered them as such, or tried to centralize the idea behind a given pattern so that it will be easily reusable.
NAMD is a parallel molecular dynamics code designed for high-performance simulation of large biomolecular systems. NAMD scales to hundreds of processors on high-end parallel platforms, as well as tens of processors on low-cost commodity clusters, and also runs on individual desktop and laptop computers. NAMD works with AMBER and CHARMM potential functions, parameters, and file formats. This article, directed to novices as well as experts, first introduces concepts and methods used in the NAMD program, describing the classical molecular dynamics force field, equations of motion, and integration methods along with the efficient electrostatics evaluation algorithms employed and temperature and pressure controls used. Features for steering the simulation across barriers and for calculating both alchemical and conformational free energy differences are presented. The motivations for and a roadmap to the internal design of NAMD, implemented in C++ and based on Charm++ parallel objects, are outlined. The factors affecting the serial and parallel performance of a simulation are discussed. Finally, typical NAMD use is illustrated with representative applications to a small, a medium, and a large biomolecular system, highlighting particular features of NAMD, for example, the Tcl scripting language. The article also provides a list of the key features of NAMD and discusses the benefits of combining NAMD with the molecular graphics/sequence analysis software VMD and the grid computing/collaboratory software BioCoRE. NAMD is distributed free of charge with source code at www.ks.uiuc.edu.
Social network analysis is used widely in the social and behavioral sciences, as well as in economics, marketing, and industrial engineering. The social network perspective focuses on relationships among social entities and is an important addition to standard social and behavioral research, which is primarily concerned with attributes of the social units. Social Network Analysis: Methods and Applications reviews and discusses methods for the analysis of social networks with a focus on applications of these methods to many substantive examples. It is a reference book that can be used by those who want a comprehensive review of network methods, or by researchers who have gathered network data and want to find the most appropriate method by which to analyze it. It is also intended for use as a textbook as it is the first book to provide comprehensive coverage of the methodology and applications of the field.
Introduction An Intensive Study of Case Study Research Methods The Unique Case Research Questions The Nature of Qualitative Research Data Gathering Analysis and Interpretation Case Researcher Roles Triangulation Writing the Report Reflections Harper School
The past decade has seen many advances in physical layer wireless communication theory and their implementation in wireless systems. This textbook takes a unified view of the fundamentals of wireless communication and explains the web of concepts underpinning these advances at a level accessible to an audience with a basic background in probability and digital communication. Topics covered include MIMO (multi-input, multi-output) communication, space-time coding, opportunistic communication, OFDM and CDMA. The concepts are illustrated using many examples from real wireless systems such as GSM, IS-95 (CDMA), IS-856 (1 x EV-DO), Flash OFDM and UWB (ultra-wideband). Particular emphasis is placed on the interplay between concepts and their implementation in real systems. An abundant supply of exercises and figures reinforce the material in the text. This book is intended for use on graduate courses in electrical and computer engineering and will also be of great interest to practising engineers
A theory of superconductivity is presented, based on the fact that the interaction between electrons resulting from virtual exchange of phonons is attractive when the energy difference between the electrons states involved is less than the phonon energy, $\ensuremath{\hbar}\ensuremath{\omega}$. It is favorable to form a superconducting phase when this attractive interaction dominates the repulsive screened Coulomb interaction. The normal phase is described by the Bloch individual-particle model. The ground state of a superconductor, formed from a linear combination of normal state configurations in which electrons are virtually excited in pairs of opposite spin and momentum, is lower in energy than the normal state by amount proportional to an average ${(\ensuremath{\hbar}\ensuremath{\omega})}^{2}$, consistent with the isotope effect. A mutually orthogonal set of excited states in one-to-one correspondence with those of the normal phase is obtained by specifying occupation of certain Bloch states and by using the rest to form a linear combination of virtual pair configurations. The theory yields a second-order phase transition and a Meissner effect in the form suggested by Pippard. Calculated values of specific heats and penetration depths and their temperature variation are in good agreement with experiment. There is an energy gap for individual-particle excitations which decreases from about $3.5k{T}_{c}$ at $T=0\ifmmode^\circ\else\textdegree\fi{}$K to zero at ${T}_{c}$. Tables of matrix elements of single-particle operators between the excited-state superconducting wave functions, useful for perturbation expansions and calculations of transition probabilities, are given.
BACKGROUND: The number of prokaryotic genome sequences becoming available is growing steadily and is growing faster than our ability to accurately annotate them. DESCRIPTION: We describe a fully automated service for annotating bacterial and archaeal genomes. The service identifies protein-encoding, rRNA and tRNA genes, assigns functions to the genes, predicts which subsystems are represented in the genome, uses this information to reconstruct the metabolic network and makes the output easily downloadable for the user. In addition, the annotated genome can be browsed in an environment that supports comparative analysis with the annotated genomes maintained in the SEED environment. The service normally makes the annotated genome available within 12-24 hours of submission, but ultimately the quality of such a service will be judged in terms of accuracy, consistency, and completeness of the produced annotations. We summarize our attempts to address these issues and discuss plans for incrementally enhancing the service. CONCLUSION: By providing accurate, rapid annotation freely to the community we have created an important community resource. The service has now been utilized by over 120 external users annotating over 350 distinct genomes.
W. Wilson's (1967) review of the area of subjective well-being (SWB) advanced several conclusions regarding those who report high levels of A number of his conclusions have been overturned: youth and modest aspirations no longer are seen as prerequisites of SWB. E. Diener's (1984) review placed greater emphasis on theories that stressed psychological factors. In the current article, the authors review current evidence for Wilson's conclusions and discuss modern theories of SWB that stress dispositional influences, adaptation, goals, and coping strategies. The next steps in the evolution of the field are to comprehend the interaction of psychological factors with life circumstances in producing SWB, to understand the causal pathways leading to happiness, understand the processes underlying adaptation to events, and develop theories that explain why certain variables differentially influence the different components of SWB (life satisfaction, pleasant affect, and unpleasant affect). In 1967, Warner Wilson presented a broad review of subjective well-being (SWB) research entitled, Correlates of Avowed Happiness. Based on the limited data available at that time, Wilson concluded that the happy person is a young, healthy, welleducated, well-paid, extroverted, optimistic, worry-free, religious, married person with high self-esteem, job morale, modest aspirations, of either sex and of a wide range of intelligence (p. 294). In the three decades since Wilson's review, investigations into SWB have evolved. Although researchers now know a great deal more about the correlates of SWB, they are less interested in simply describing the demographic characteristics that correlate with it. Instead, they focus their effort on understanding the processes that underlie happiness. This trend represents a greater recognition of the central role played by people's goals, coping efforts, and dispositions. In this article, we review research on several major theoretical approaches to well-being and then indicate how these theories clarify the findings on demographic correlates of SWB. Throughout the review we suggest four directions that researchers should pursue in the decades ahead. These are by no means the only questions left to answer, but we believe they are the most interesting issues left to resolve. First, the causal direction of the correlates of happiness must be examined through more sophisticated methodologies. Although the causal priority of demographic factors such as marriage and income is intuitively appealing, it is by no means certain. Second, researchers must focus greater attention on the interaction between internal factors (such as personality traits) and external circumstances. As we shall see, demographic factors have surprisingly small effects on SWB, but these effects may depend on the personalities of those individuals being studied. Thus, future research must take Person X Situation interactions into account. Third, researchers must strive to understand the processes underlying adaptation. Considerable adaptation to both good and bad circumstances often occurs, yet the processes responsible for these effects are poorly understood. Research that examines how habituation, coping strategies, and changing goals influence adaptation will shed much light on the processes responsible for SWB. Finally, theories must be refined to make specific predictions about how input variables differentially influence the components of SWB. In the past, many researchers have treated SWB as a monolithic entity, but it is now clear that there are separable components that exhibit unique patterns of relations with different variables. In each section of this article we discuss progress and opportunities in these four areas.
Construct Validity in Psychological TestsVALIDATION of psychological tests has not yet been adequately concep tua1ized, as the APA Committee on Psychological Tests learned when it undertook to specify what qualities should be investigated before a test is published.In order to make coherent recommendations the Committee found it necessary to distinguish four types of validity, established by different types of research and requiring different interpre tation.The chief innovation in the Committee's report was the term constmct validity.*This idea was first formulated hy a subcommittee {Meehl and R. C. Cballman) studying how proposed recommendations would apply to projective techniques, and later modified and clarified by the entire Committee {Bordin, Challman, Conrad, Humphreys, Super, and the present writers).The statements agreed upon by tbe Committee (and by committees of two other associations) were published in the Technical Recommendations ( 59).The present interpretation of construct validity is not "official" and deals with some areas in which the Committee would probably not be unanimous.The present writers are solely responsible for this attempt to explain the concept and elaborate its implications.Identification of construct validity was not an isolated development.Writers on validity during the preceding decade had shown a great deal of dissatisfaction with conventional notions of validity, and intro dnced new terms and ideas, hut the resulting aggregation of types of * Referred to in a preliminary report ( 58) as cougruent validity.
We present results based on full-mission Planck observations of temperature and polarization anisotropies of the CMB. These data are consistent with the six-parameter inflationary LCDM cosmology. From the Planck temperature and lensing data, for this cosmology we find a Hubble constant, H0= (67.8 +/- 0.9) km/s/Mpc, a matter density parameter Omega_m = 0.308 +/- 0.012 and a scalar spectral index with n_s = 0.968 +/- 0.006. (We quote 68% errors on measured parameters and 95% limits on other parameters.) Combined with Planck temperature and lensing data, Planck LFI polarization measurements lead to a reionization optical depth of tau = 0.066 +/- 0.016. Combining Planck with other astrophysical data we find N_ eff = 3.15 +/- 0.23 for the effective number of relativistic degrees of freedom and the sum of neutrino masses is constrained to < 0.23 eV. Spatial curvature is found to be |Omega_K| < 0.005. For LCDM we find a limit on the tensor-to-scalar ratio of r <0.11 consistent with the B-mode constraints from an analysis of BICEP2, Keck Array, and Planck (BKP) data. Adding the BKP data leads to a tighter constraint of r < 0.09. We find no evidence for isocurvature perturbations or cosmic defects. The equation of state of dark energy is constrained to w = -1.006 +/- 0.045. Standard big bang nucleosynthesis predictions for the Planck LCDM cosmology are in excellent agreement with observations. We investigate annihilating dark matter and deviations from standard recombination, finding no evidence for new physics. The Planck results for base LCDM are in agreement with BAO data and with the JLA SNe sample. However the amplitude of the fluctuations is found to be higher than inferred from rich cluster counts and weak gravitational lensing. Apart from these tensions, the base LCDM cosmology provides an excellent description of the Planck CMB observations and many other astrophysical data sets.
Starts with a brief review of the history and the application areas considered in the literature. The author then proceeds with introductory modeling examples, behavioral and structural properties, three methods of analysis, subclasses of Petri nets and their analysis. In particular, one section is devoted to marked graphs, the concurrent system model most amenable to analysis. Introductory discussions on stochastic nets with their application to performance modeling, and on high-level nets with their application to logic programming, are provided. Also included are recent results on reachability criteria. Suggestions are provided for further reading on many subject areas of Petri nets.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
On August 17, 2017 at 12∶41:04 UTC the Advanced LIGO and Advanced Virgo gravitational-wave detectors made their first observation of a binary neutron star inspiral. The signal, GW170817, was detected with a combined signal-to-noise ratio of 32.4 and a false-alarm-rate estimate of less than one per <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline"><a:mrow><a:mrow><a:mn>8.0</a:mn><a:mo>×</a:mo><a:msup><a:mrow><a:mn>10</a:mn></a:mrow><a:mrow><a:mn>4</a:mn></a:mrow></a:msup></a:mrow><a:mtext> </a:mtext><a:mtext> </a:mtext><a:mi>years</a:mi></a:mrow></a:math>. We infer the component masses of the binary to be between 0.86 and <c:math xmlns:c="http://www.w3.org/1998/Math/MathML" display="inline"><c:mrow><c:mn>2.26</c:mn><c:mtext> </c:mtext><c:mtext> </c:mtext><c:msub><c:mrow><c:mi>M</c:mi></c:mrow><c:mrow><c:mo stretchy="false">⊙</c:mo></c:mrow></c:msub></c:mrow></c:math>, in agreement with masses of known neutron stars. Restricting the component spins to the range inferred in binary neutron stars, we find the component masses to be in the range <f:math xmlns:f="http://www.w3.org/1998/Math/MathML" display="inline"><f:mrow><f:mn>1.17</f:mn><f:mi>–</f:mi><f:mn>1.60</f:mn><f:mtext> </f:mtext><f:mtext> </f:mtext><f:msub><f:mrow><f:mi>M</f:mi></f:mrow><f:mrow><f:mo stretchy="false">⊙</f:mo></f:mrow></f:msub></f:mrow></f:math>, with the total mass of the system <i:math xmlns:i="http://www.w3.org/1998/Math/MathML" display="inline"><i:mrow><i:mn>2.7</i:mn><i:msubsup><i:mrow><i:mn>4</i:mn></i:mrow><i:mrow><i:mo>−</i:mo><i:mn>0.01</i:mn></i:mrow><i:mrow><i:mo>+</i:mo><i:mn>0.04</i:mn></i:mrow></i:msubsup><i:msub><i:mrow><i:mi>M</i:mi></i:mrow><i:mrow><i:mo stretchy="false">⊙</i:mo></i:mrow></i:msub></i:mrow></i:math>. The source was localized within a sky region of <l:math xmlns:l="http://www.w3.org/1998/Math/MathML" display="inline"><l:mrow><l:mn>28</l:mn><l:mtext> </l:mtext><l:mtext> </l:mtext><l:mrow><l:msup><l:mrow><l:mi>deg</l:mi></l:mrow><l:mrow><l:mn>2</l:mn></l:mrow></l:msup></l:mrow></l:mrow></l:math> (90% probability) and had a luminosity distance of <n:math xmlns:n="http://www.w3.org/1998/Math/MathML" display="inline"><n:mrow><n:mrow><n:mn>4</n:mn><n:msubsup><n:mrow><n:mn>0</n:mn></n:mrow><n:mrow><n:mo>−</n:mo><n:mn>14</n:mn></n:mrow><n:mrow><n:mo>+</n:mo><n:mn>8</n:mn></n:mrow></n:msubsup><n:mtext> </n:mtext><n:mtext> </n:mtext></n:mrow><n:mrow><n:mi>Mpc</n:mi></n:mrow></n:mrow></n:math>, the closest and most precisely localized gravitational-wave signal yet. The association with the <p:math xmlns:p="http://www.w3.org/1998/Math/MathML" display="inline"><p:mi>γ</p:mi></p:math>-ray burst GRB 170817A, detected by Fermi-GBM 1.7 s after the coalescence, corroborates the hypothesis of a neutron star merger and provides the first direct evidence of a link between these mergers and short <r:math xmlns:r="http://www.w3.org/1998/Math/MathML" display="inline"><r:mi>γ</r:mi></r:math>-ray bursts. Subsequent identification of transient counterparts across the electromagnetic spectrum in the same location further supports the interpretation of this event as a neutron star merger. This unprecedented joint gravitational and electromagnetic observation provides insight into astrophysics, dense matter, gravitation, and cosmology. Published by the American Physical Society 2017
We consider the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise. We cast the recognition problem as one of classifying among multiple linear regression models and argue that new theory from sparse signal representation offers the key to addressing this problem. Based on a sparse representation computed by l{1}-minimization, we propose a general classification algorithm for (image-based) object recognition. This new framework provides new insights into two crucial issues in face recognition: feature extraction and robustness to occlusion. For feature extraction, we show that if sparsity in the recognition problem is properly harnessed, the choice of features is no longer critical. What is critical, however, is whether the number of features is sufficiently large and whether the sparse representation is correctly computed. Unconventional features such as downsampled images and random projections perform just as well as conventional features such as Eigenfaces and Laplacianfaces, as long as the dimension of the feature space surpasses certain threshold, predicted by the theory of sparse representation. This framework can handle errors due to occlusion and corruption uniformly by exploiting the fact that these errors are often sparse with respect to the standard (pixel) basis. The theory of sparse representation helps predict how much occlusion the recognition algorithm can handle and how to choose the training images to maximize robustness to occlusion. We conduct extensive experiments on publicly available databases to verify the efficacy of the proposed algorithm and corroborate the above claims.
Part One: Introduction Part Two: Focusing and Bounding the Collection of Data Part Three: Analysis During Data Collection Part Four: Within-Site Analysis Part Five: Cross-Site Analysis Part Six: Matrix Displays: Some General Suggestions Part Seven: Drawing and Verifying Conclusions Part Eight: Concluding Remarks
When n identical randomly located nodes, each capable of transmitting at W bits per second and using a fixed range, form a wireless network, the throughput /spl lambda/(n) obtainable by each node for a randomly chosen destination is /spl Theta/(W//spl radic/(nlogn)) bits per second under a noninterference protocol. If the nodes are optimally placed in a disk of unit area, traffic patterns are optimally assigned, and each transmission's range is optimally chosen, the bit-distance product that can be transported by the network per second is /spl Theta/(W/spl radic/An) bit-meters per second. Thus even under optimal circumstances, the throughput is only /spl Theta/(W//spl radic/n) bits per second for each node for a destination nonvanishingly far away. Similar results also hold under an alternate physical model where a required signal-to-interference ratio is specified for successful receptions. Fundamentally, it is the need for every node all over the domain to share whatever portion of the channel it is utilizing with nodes in its local neighborhood that is the reason for the constriction in capacity. Splitting the channel into several subchannels does not change any of the results. Some implications may be worth considering by designers. Since the throughput furnished to each user diminishes to zero as the number of users is increased, perhaps networks connecting smaller numbers of users, or featuring connections mostly with nearby neighbors, may be more likely to be find acceptance.
The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an optimum fixed priority scheduler possesses an upper bound to processor utilization which may be as low as 70 percent for large task sets. It is also shown that full processor utilization can be achieved by dynamically assigning priorities on the basis of their current deadlines. A combination of these two scheduling techniques is also discussed.
ADVERTISEMENT RETURN TO ISSUEPREVArticleNEXTSelf-Assembled Monolayers of Thiolates on Metals as a Form of NanotechnologyJ. Christopher Love, Lara A. Estroff, Jennah K. Kriebel, Ralph G. Nuzzo, and George M. WhitesidesView Author Information Department of Chemistry and the Fredrick Seitz Materials Research Laboratory, University of Illinois−Urbana−Champaign, Urbana, Illinois 61801 and Department of Chemistry and Chemical Biology, Harvard University, 12 Oxford Street, Cambridge, Massachusetts 02138 Cite this: Chem. Rev. 2005, 105, 4, 1103–1170Publication Date (Web):March 25, 2005Publication History Received19 July 2004Published online25 March 2005Published inissue 1 April 2005https://pubs.acs.org/doi/10.1021/cr0300789https://doi.org/10.1021/cr0300789research-articleACS PublicationsCopyright © 2005 American Chemical SocietyRequest reuse permissionsArticle Views90426Altmetric-Citations7096LEARN ABOUT THESE METRICSArticle Views are the COUNTER-compliant sum of full text article downloads since November 2008 (both PDF and HTML) across all institutions and individuals. These metrics are regularly updated to reflect usage leading up to the last few days.Citations are the number of other articles citing this article, calculated by Crossref and updated daily. Find more information about Crossref citation counts.The Altmetric Attention Score is a quantitative measure of the attention that a research article has received online. Clicking on the donut icon will load a page at altmetric.com with additional details about the score and the social media presence for the given article. Find more information on the Altmetric Attention Score and how the score is calculated. Share Add toView InAdd Full Text with ReferenceAdd Description ExportRISCitationCitation and abstractCitation and referencesMore Options Share onFacebookTwitterWechatLinked InRedditEmail Other access optionsGet e-Alertsclose SUBJECTS:Gold,Metals,Molecules,Nanoparticles,Thiols Get e-Alerts
This paper presents a method for recognizing scene categories based on approximate global geometric correspondence. This technique works by partitioning the image into increasingly fine sub-regions and computing histograms of local features found inside each sub-region. The resulting "spatial pyramid" is a simple and computationally efficient extension of an orderless bag-of-features image representation, and it shows significantly improved performance on challenging scene categorization tasks. Specifically, our proposed method exceeds the state of the art on the Caltech-101 database and achieves high accuracy on a large database of fifteen natural scene categories. The spatial pyramid framework also offers insights into the success of several recently proposed image descriptions, including Torralba’s "gist" and Lowe’s SIFT descriptors.