Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

2006

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 1591 - 1620 of 11382

Full-Text Articles in Entire DC Network

An Instrumental Theory Of Market Power And Antitrust Policy, Jeffrey L. Harrison Oct 2006

An Instrumental Theory Of Market Power And Antitrust Policy, Jeffrey L. Harrison

UF Law Faculty Publications

Since Judge Hand's pivotal opinion in United States v. Aluminum Company of America (Alcoa), the possession of monopoly power has been treated as presumptively legal. The focus of the antitrust laws since then has been on defining when that power is abused. This approach to market power cannot be squared with the prevailing view that antitrust law is grounded in economic theory. To understand why, one must see market power for what it is: the ability of a firm to raise prices above competitive levels and to profitably keep them there. Seen in this light, market power is indistinguishable from …


Learning Opportunities 2006/2007, Illinois Mathematics And Science Academy Oct 2006

Learning Opportunities 2006/2007, Illinois Mathematics And Science Academy

Course Catalogs

No abstract provided.


A Measurement Of The Top Quark Mass With A Matrix Element Method, Adam Paul Gibson '96 Oct 2006

A Measurement Of The Top Quark Mass With A Matrix Element Method, Adam Paul Gibson '96

Doctoral Dissertations

We present a measurement of the mass of the top quark. Our event sample is selected from proton-antiproton collisions, at 1.96 TeV center-of-mass energy, observed with the CDF detector at Fermilab's Tevatron. We consider a 318 pb-1 dataset collected between March 2002 and August 2004. We select events that contain one energetic lepton, large missing transverse energy, exactly four energetic jets, and at least one displaced vertex b tag. Our analysis uses leading-order tt and background matrix elements along with parameterized parton showering to construct event-by-event likelihoods as a function of top quark mass. From the 63 events observed …


Mcnair News, Volume 1, Number 1, Fall 2006 Oct 2006

Mcnair News, Volume 1, Number 1, Fall 2006

McNair News: Newsletter of the University of Nebraska–Lincoln McNair Scholars Program

Scholars Present Research at Berkeley McNair Symposium
McNair by the Numbers
Meet the 2006-2007 McNair Scholars
Where Are They Now?
UNL’s McNair Team
McNair Fall Event Calendar
Scholar Spotlight on MinJeong Schneider
McNair Tip: Choosing the Right Graduate Program
Do You Know Someone Who Might Be McNair Material?


State Of The Arctic October 2006, J. Richter-Menge, J. Overland, A. Proshutinsky, V. Romanovsky, L. Bengtsson, L. Brigham, M. Dyurgerov, J.C. Gascard, S. Gerland, R. Graversen, C. Hahaas, M. Karcher, P. Kuhry, J. Maslanik, H. Melling, W. Maslowski, J. Morison, D. Perovich, R. Przybylak, V. Rachold, I. Rigor, A. Shiklomanov, J. Stroeve, D. Walker, J. Walsh Oct 2006

State Of The Arctic October 2006, J. Richter-Menge, J. Overland, A. Proshutinsky, V. Romanovsky, L. Bengtsson, L. Brigham, M. Dyurgerov, J.C. Gascard, S. Gerland, R. Graversen, C. Hahaas, M. Karcher, P. Kuhry, J. Maslanik, H. Melling, W. Maslowski, J. Morison, D. Perovich, R. Przybylak, V. Rachold, I. Rigor, A. Shiklomanov, J. Stroeve, D. Walker, J. Walsh

United States Department of Commerce: Staff Publications

This State of the Arctic Report presents a review of recent data by an international group of scientists who developed a consensus on the information content and reliability. The report highlights data primarily from 2000 to 2005 with a first look at winter 2006, providing an update to some of the records of physical processes discussed in the Arctic Climate Impact Assessment (ACIA, 2004, 2005). Of particular note:

• Atmospheric climate patterns are shifting (Fig. 1). The late winter/spring pattern for 2000–2005 had new hot spots in northeast Canada and the East Siberian Sea relative to 1980–1999. Late winter 2006, …


The Traveling Salesman Problem: Deceptivley Easy To State; Notoriously Hard To Solve, David Biron Oct 2006

The Traveling Salesman Problem: Deceptivley Easy To State; Notoriously Hard To Solve, David Biron

Senior Honors Theses

The purpose of this thesis is to give an overview of the history of the Traveling Salesman Problem and to show how it has been an integral part of the development of the fields of Integer Programming, and Combinatorial Optimization. The thesis starts in the 1800s and progresses through current attempts on solutions of the problem. The thesis is not meant to describe in detail every attempt made, nor to describe an original solution, but to provide a high level overview of every solution attempt, and to guide the reader on what has been done, and what still can be …


Observations On The Folly Of Using Student Evaluations Of College Teaching For Faculty Evaluation, Pay, And Retention Decisions And Its Implications For Academic Freedom, William Arthur Wines, Terence J. Lau Oct 2006

Observations On The Folly Of Using Student Evaluations Of College Teaching For Faculty Evaluation, Pay, And Retention Decisions And Its Implications For Academic Freedom, William Arthur Wines, Terence J. Lau

William & Mary Journal of Race, Gender, and Social Justice

Research on student teaching evaluations is vast. An examination of this research demonstrates wide disagreements but also substantial consensus of authority for the proposition that student evaluations should be used only with extreme care, if at all, in making personnel decisions. A number of reasons cause administrators to use teaching evaluations for personnel decisions. The literature, however, is virtually unanimous in its condemnation of norming student evaluations in order to rank classroom performances. Current cases on academic freedom indicate some retrenchment by the Circuits from broader pronouncements in earlier Supreme Court cases. This paper concludes that the use of non-validated …


Audio Similarity Measure By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo, Cuihua Fang, Xiaoou Chen, Jianguo Xiao Oct 2006

Audio Similarity Measure By Graph Modeling And Matching, Yuxin Peng, Chong-Wah Ngo, Cuihua Fang, Xiaoou Chen, Jianguo Xiao

Research Collection School Of Computing and Information Systems

This paper proposes a new approach for the similarity measure and ranking of audio clips by graph modeling and matching. Instead of using frame-based or salient-based features to measure the acoustical similarity of audio clips, segment-based similarity is proposed. The novelty of our approach lies in two aspects: segment-based representation, and the similarity measure and ranking based on four kinds of similarity factors. In segmentbased representation, segments not only capture the change property of audio clip, but also keep and present the change relation and temporal order of audio features. In the similarity measure and ranking, four kinds of similarity …


Natural Document Clustering By Clique Percolation In Random Graphs, Wei Gao, Kam-Fai Wong Oct 2006

Natural Document Clustering By Clique Percolation In Random Graphs, Wei Gao, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/or the probability distribution of clustered data. As a result, the clustering effects tend to be unnatural and stray away more or less from the intrinsic grouping nature among the documents in a corpus. We propose a novel graph-theoretic technique called Clique Percolation Clustering (CPC). It models clustering as a process of enumerating adjacent maximal cliques in a random graph that unveils inherent structure of the underlying data, in which we unleash the commonly practiced constraints in …


Extracting Link Chains Of Relationship Instances From A Website, Myo-Myo Naing, Ee Peng Lim, Roger Hsiang-Li Chiang Oct 2006

Extracting Link Chains Of Relationship Instances From A Website, Myo-Myo Naing, Ee Peng Lim, Roger Hsiang-Li Chiang

Research Collection School Of Computing and Information Systems

Web pages from a Web site can often be associated with concepts in an ontology, and pairs of Web pages also can be associated with relationships between concepts. With such associations, the Web site can be searched, browsed, or even reorganized based on the concept and relationship labels of its Web pages. In this article, we study the link chain extraction problem that is critical to the extraction of Web pages that are related. A link chain is an ordered list of anchor elements linking two Web pages related by some semantic relationship. We propose a link chain extraction method …


Privacy Enhanced Superdistribution Of Layered Content With Trusted Access Control, Daniel J. T. Chong, Robert H. Deng Oct 2006

Privacy Enhanced Superdistribution Of Layered Content With Trusted Access Control, Daniel J. T. Chong, Robert H. Deng

Research Collection School Of Computing and Information Systems

Traditional superdistribution approaches do not address consumer privacy issues and also do not reliably prevent the malicious consumer from indiscriminately copying and redistributing the decryption keys or the decrypted content. The layered nature of common digital content can also be exploited to efficiently provide the consumer with choices over the quality of the content, allowing him/her to pay less for lower quality consumption and vice versa. This paper presents a system that superdistributes encrypted layered content and (1) allows the consumer to select a quality level at which to decrypt and consume the content; (2) prevents the merchant from knowing …


Viz: A Visual Analysis Suite For Explaining Local Search Behavior, Steven Halim, Roland H. C. Yap, Hoong Chuin Lau Oct 2006

Viz: A Visual Analysis Suite For Explaining Local Search Behavior, Steven Halim, Roland H. C. Yap, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

NP-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algorithms are heuristic-based, it is hard to understand how to improve or tune them. We propose an interactive visualization tool, VIZ, meant for understanding the behavior of local search. VIZ uses animation of abstract search trajectories with other visualizations which are also animated in a VCR-like fashion to graphically playback the algorithm behavior. It combines generic visualizations applicable on arbitrary algorithms with algorithm and problem specific visualizations. We use a variety of techniques such as …


Service Pattern Discovery Of Web Service Mining In Web Service Registry-Repository, Qianhui Althea Liang, Jen-Yao Chung, Steven M. Miller, Yang Ouyang Oct 2006

Service Pattern Discovery Of Web Service Mining In Web Service Registry-Repository, Qianhui Althea Liang, Jen-Yao Chung, Steven M. Miller, Yang Ouyang

Research Collection School Of Computing and Information Systems

This paper presents and elaborates the concept of Web service usage patterns and pattern discovery through service mining. We define three different levels of service usage data: i) user request level, ii) template level and iii) instance level. At each level, we investigate patterns of service usage data and the discovery of these patterns. An algorithm for service pattern discovery at the template level is presented. We show the system architecture of a service-mining enabled service registry repository. Web service patterns, pattern discovery and pattern mining supports the discovery and composition of complex services, which in turn supports the application …


Two-Instant Reallocation In Two-Echelon Spare Parts Inventory Systems, Huawei Song, Hoong Chuin Lau Oct 2006

Two-Instant Reallocation In Two-Echelon Spare Parts Inventory Systems, Huawei Song, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we study the problem of deciding when and how to perform reallocation of existing spare parts in a multi-echelon reparable item inventory system. We present a mathematical model that solves the problem when there are two reallocation instants, in response to the open challenge post by Cao and Silver(2005) to consider two or more possible reallocations within a replenishment cycle.


Design And Analysis Of A Class-Aware Recursive Loop Scheduler For Class-Based Scheduling, Raphael Rom, Moshe Sidi, Hwee-Pink Tan Oct 2006

Design And Analysis Of A Class-Aware Recursive Loop Scheduler For Class-Based Scheduling, Raphael Rom, Moshe Sidi, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

In this paper, we consider the problem of devising a loop scheduler that allocates slots to users according to their relative weights as smoothly as possible. Instead of the existing notion of smoothness based on balancedness, we propose a variance-based metric which is more intuitive and easier to compute.

We propose a recursive loop scheduler for a class-based scheduling scenario based on an optimal weighted round-robin scheduler. We show that it achieves very good allocation smoothness with almost no degradation in intra-class fairness. In addition, we also demonstrate the equivalence between our proposed metric and the balancedness-based metric.


The Extension Newsletter, Issue 52, Fall Quarter 2006, Wright State University Retirees Association Oct 2006

The Extension Newsletter, Issue 52, Fall Quarter 2006, Wright State University Retirees Association

The Extension Newsletter

An eight page newsletter from the Wright State University's Retirees Association.


Assessment Of General Education Survey Report, 2006-2007, Assessment Of Student Learning Committee Oct 2006

Assessment Of General Education Survey Report, 2006-2007, Assessment Of Student Learning Committee

Assessment of Student Learning Reports

No abstract provided.


Mathematics Discipline Courses Assessment Report 2006/2007, Mathematics Discipline Oct 2006

Mathematics Discipline Courses Assessment Report 2006/2007, Mathematics Discipline

Assessment of Student Learning Reports

No abstract provided.


Ceg 499/699: Mobile Computing, Yong Pei Oct 2006

Ceg 499/699: Mobile Computing, Yong Pei

Computer Science & Engineering Syllabi

Increasingly, people, computers and microelectronic devices are being linked together to bring to life the communications mantra: anybody, anything, anytime, anywhere. This junior/senior/graduate course provides an in-depth study of networking protocol and system design in the area of wireless networking and mobile computing. It will help engineering and computer science students establish a solid foundation in concepts, architecture, design, and performance evaluation of mobile computing principle, protocols and applications. It will also introduce students to a few hot topics in wireless networking and mobile computing research such as mobile IP, wireless TCP, 802.11, agent techniques, etc. The course material also …


Ceg 453/653: Design Of Computing Systems, Jack Jean Oct 2006

Ceg 453/653: Design Of Computing Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Theory And Anti-Theory In The Work Of Allan Farnsworth, Wayne R. Barnes Oct 2006

Theory And Anti-Theory In The Work Of Allan Farnsworth, Wayne R. Barnes

Faculty Scholarship

When Allan Farnsworth passed away on January 31, 2005, the world lost a titan in the field of contracts. Farnsowrth has been described as “the great contemporary American scholar, and one of a handful of great world scholars, on the law of agreement...[He] was...perhaps The Authority on the law of contracts and much more.” Similarly, others have called him “the premiere figure in American Contracts law scholarship since the passing of Corbin and Dawson. The treatise and his half of the Second Restatement would be quite a contribution if there was nothing else.” Farnsworth’s casebook is perennially the most widely-adopted …


Fast Tracking Of Near-Duplicate Keyframes In Broadcast Domain With Transitivity Propagation, Chong-Wah Ngo, Wan-Lei Zhao, Yu-Gang Jiang Oct 2006

Fast Tracking Of Near-Duplicate Keyframes In Broadcast Domain With Transitivity Propagation, Chong-Wah Ngo, Wan-Lei Zhao, Yu-Gang Jiang

Research Collection School Of Computing and Information Systems

The identification of near-duplicate keyframe (NDK) pairs is a useful task for a variety of applications such as news story threading and content-based video search. In this paper, we propose a novel approach for the discovery and tracking of NDK pairs and threads in the broadcast domain. The detection of NDKs in a large data set is a challenging task due to the fact that when the data set increases linearly, the computational cost increases in a quadratic speed, and so does the number of false alarms. This paper explores the symmetric and transitive nature of near-duplicate for the effective …


Gravitational Diffraction Radiation, Vitor Cardoso, Marco Cavaglia, Mario Pimenta Oct 2006

Gravitational Diffraction Radiation, Vitor Cardoso, Marco Cavaglia, Mario Pimenta

Physics Faculty Research & Creative Works

We show that if the visible universe is a membrane embedded in a higher-dimensional space, particles in uniform motion radiate gravitational waves because of spacetime lumpiness. This phenomenon is analogous to the electromagnetic diffraction radiation of a charge moving near to a metallic grating. In the gravitational case, the role of the metallic grating is played by the inhomogeneities of the extra-dimensional space, such as a hidden brane. We derive a general formula for gravitational diffraction radiation and apply it to a higher-dimensional scenario with flat compact extra dimensions. Gravitational diffraction radiation may carry away a significant portion of the …


Cs 205: Introduction To Computers And Office Productivity Software, John P. Herzog Oct 2006

Cs 205: Introduction To Computers And Office Productivity Software, John P. Herzog

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including word processing
(intermediate), spreadsheets, database and presentation graphics using a case study
approach where critical thinking and problem solving skills are required. Computer
concepts are integrated throughout the course to provide an understanding of the basics of
computing, the latest technological advances and how they are used in industry. Ethics
and issues encountered in business are discussed to challenge students on societal impact
of technology.


Cs 240: Introduction To Computer Science I, L. Jane Lin Oct 2006

Cs 240: Introduction To Computer Science I, L. Jane Lin

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement.


Cs 405/605-01: Introduction To Database Management Systems, Guozhu Dong Oct 2006

Cs 405/605-01: Introduction To Database Management Systems, Guozhu Dong

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of database management systems. Data models including entity-relationship (ER) and relational are presented. Physical implementation (data organization and indexing) methods are discussed. Query languages including SQL, relational algebra, relational calculus, and QBE are introduced. Students will also gain experience in creating and manipulating a database.


Cs 340: Programming Language Workshop In Java, Ronald F. Taylor Oct 2006

Cs 340: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://java.sun.com or' other software as approved by the instructor. There are no exams. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and general discussion of the programming assignments. Do not expect support in debugging badly documented code.


Cs 141: Computer Programming I, Michael Ondrasek Oct 2006

Cs 141: Computer Programming I, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language. Students must register for both lecture and one laboratory section.


Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan Oct 2006

Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course deals with the theory and practice of compiler design. Topics emphasized are scanning and parsing. If time permits, semantic analysis will also be covered.


Cs 208: Computer Programming For Business I, Dennis Kellermeier Oct 2006

Cs 208: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

No abstract provided.