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 21631 - 21660 of 22199

Full-Text Articles in Entire DC Network

Estimates Of Patent Rents From Firm Market Value, James Bessen Jan 2006

Estimates Of Patent Rents From Firm Market Value, James Bessen

Faculty Scholarship

The value of patent rents is an important quantity for policy analysis. However, estimates in the literature based on patent renewals might be understated. Market value regressions could provide validation, but they have not had clear theoretical foundations for estimating patent rents. I develop a simple model to make upper bound estimates of patent rents using regressions on Tobin's Q. I test this on a sample of US firms and find it robust to a variety of considerations. My estimates correspond well with estimates based on patentee behavior outside the pharmaceutical industry, but renewal estimates might be understated for pharmaceuticals.

Go to article

Jackson V. Birmingham Board Of Education: Title Ix's Implied Private Right Of Action For Retaliation, Elizabeth Mccuskey Jan 2006

Jackson V. Birmingham Board Of Education: Title Ix's Implied Private Right Of Action For Retaliation, Elizabeth Mccuskey

Faculty Scholarship

The Supreme Court has penned countless words about the sound of statutory silence.' On March 29, 2005, the Court once again grappled with the meaning of silence in a statute, splitting along familiar 5-4 lines in Jackson v. Birmingham Board of Education.2 When the dust cleared, a male coach of a high school girls' basketball team, who was fired in retaliation for protecting his players' Title IX3 rights, possessed a private right of action arising from the statute itself.4 Although the Court has retreated from its high-water mark of implying private rights of action,5 in …

Go to article

Indecent Standards: The Case Of U.S. Versus Weldon Angelos, Eva Nilsen Jan 2006

Indecent Standards: The Case Of U.S. Versus Weldon Angelos, Eva Nilsen

Faculty Scholarship

In today's highly punitive culture, perhaps Weldon Angelos' fifty-five-year sentence does not seem unusual. He's a 25-year-old man who was convicted in December 2003 of selling marijuana, possessing firearms while drug dealing, and money laundering. 3 The facts proven at trial are that on three occasions in June and July, 2002, Angelos sold eight one-ounce bags of marijuana for $350 each to a government informant. 4 The purchaser testified that a firearm was visible during two of these drug sales.5 Police seized another gun from Angelos' home five months later pursuant to a warrant.6 At no time was …

Go to article

China And The Human Right To Health: Selective Adaptation And Treaty Compliance, Pitman B. Potter Jan 2006

China And The Human Right To Health: Selective Adaptation And Treaty Compliance, Pitman B. Potter

All Faculty Publications

The international community has devoted considerable energy to dialogue and exchanges with China on issues of treaty compliance in areas of trade and human rights, and while many improvements are evident in China’s legal regimes for trade and human rights, problems remain. Further, academic and policy discourses on China’s trade and human rights policy and practice are all too often conflicted by normative differences and illusions about them. The paradigm of “selective adaptation” offers a potential solution by examining compliance with international trade and human rights treaties by reference to the interplay between normative systems associated with international rule regimes …

Go to article

Assessing Risk For Violent Recidivism: A Comparison Of The Psychopathy Checklist—Revised And The Child And Adolescent Taxon Scale When Calculating Violence Risk Appraisal Guide Scores, Joseph Calvin Bolton Iii Jan 2006

Assessing Risk For Violent Recidivism: A Comparison Of The Psychopathy Checklist—Revised And The Child And Adolescent Taxon Scale When Calculating Violence Risk Appraisal Guide Scores, Joseph Calvin Bolton Iii

All-Inclusive List of Electronic Theses and Dissertations

The Violence Risk Appraisal Guide (VRAG) is the tool of choice when conducting forensic assessments of risk, and consists of 12-items correlated with violent recidivism. One of these items is level of psychopathy, which is normally assessed via the Psychopathy Checklist---Revised (PCL-R). The PCL-R is a 20-item instrument, based on an interview and a review of collateral information, which provides a score reflecting severity of psychopathy. The Child and Adolescent Taxon Scale (CATS) also provides an index of psychopathy, but is comprised of only 8-items. There is no interview associated with the CATS, and items are scored based on retrospective …

Go to article

Premenstrual Dysphoric Disorder And The Process Of Diagnostic Decision Making Between Psychologists And Psychiatrists, Katrin Woodworth Carlson Jan 2006

Premenstrual Dysphoric Disorder And The Process Of Diagnostic Decision Making Between Psychologists And Psychiatrists, Katrin Woodworth Carlson

All-Inclusive List of Electronic Theses and Dissertations

Premenstrual Dysphoric Disorder (PNMD) is included in the DSM-IV (APA, 1994) Appendix A, Criteria Son and Axes Provided for Further Study. Its symptoms overlap significantly with mood and anxiety disorders, but occur in the late luteal phase of the menstrual cycle and remit by the early follicular phase. Thus, PMDD is a challenging differential diagnosis that relies upon establishing a temporal relationship between symptoms and the menstrual cycle, and it provides an opportunity for examining gnostic decision making processes. A national sample of psychologists (n = 155) and psychiatrists (n = 139) were presented with an Internet web page with …

Go to article

Psychological Well-Being And Level Of Outness In Male -To -Female Transsexuals, Jeffrey D. Strain Jan 2006

Psychological Well-Being And Level Of Outness In Male -To -Female Transsexuals, Jeffrey D. Strain

All-Inclusive List of Electronic Theses and Dissertations

This study examined the relationship between psychological well-being (i.e., depression, anxiety, self-esteem, gender role congruence) and level of outness in male-to-female (MTF) transsexuals. Hans (1998) stated that a transsexual is someone who, after experiencing intense long-term discomfort resulting from incongruence between their preferred gender and their biological sex, adapts his or her body and behavior to appropriately reflect his or her true gender identity. Participants were 105 MTF transsexual attendees at an annual transgender conference held in Atlanta, Georgia. Participants completed eight questionnaires, including: the Demographics Questionnaire, the Outness Demographics Questionnaire, the Outness Attitude Scale, the Openness Scale, the Beck …

Go to article

The Cycle Of Violence, Margaret Urban Walker Jan 2006

The Cycle Of Violence, Margaret Urban Walker

Philosophy Faculty Research and Publications

No abstract provided.

Go to article

The Curious Case Of Care And Restorative Justice In The U.S. Context, Margaret Urban Walker Jan 2006

The Curious Case Of Care And Restorative Justice In The U.S. Context, Margaret Urban Walker

Philosophy Faculty Research and Publications

No abstract provided.

Go to article

The Relationship Of Psychopathy And Social Interest To Prison Adjustment, Ashley Harrison Noble Jan 2006

The Relationship Of Psychopathy And Social Interest To Prison Adjustment, Ashley Harrison Noble

All-Inclusive List of Electronic Theses and Dissertations

Over the past few decades, methods used to predict recidivism among the criminal population have improved substantially. Recent research has further identified some specific factors such as psychopathy (e.g. a lack of guilt, egocentricity, and superficial charm) and social interest (e.g. a willingness to accept the responsibility for one's actions, compassion toward others, and contributing to the common welfare) as predictors of recidivism and suggests that these constructs may be useful in predicting prison adjustment as well. The goal of this study was to assess the usefulness of specific measures of psychopathy and social interest in the prediction of prison …

Go to article

Threatened Egotism, Narcissism, And Identification With Criminal Others As Predictors Of Recidivism, Jeffrey M. Morris Jan 2006

Threatened Egotism, Narcissism, And Identification With Criminal Others As Predictors Of Recidivism, Jeffrey M. Morris

All-Inclusive List of Electronic Theses and Dissertations

Recent research has challenged the assertion that low self-esteem leads to violence. Narcissists, who typically have elevated self-esteem, may have strong emotional responses to ego threats resulting in increased aggression. This relationship may be important to understand in relation to criminal behavior. Recidivism rates appear to be affected by an interaction of level of self-esteem and identification with criminal others. This study will examine the relationship between self-esteem, narcissism, identification with criminal others, and recidivism. This study included 56 male offenders recruited from a parole office and assessed with the Narcissistic Personality Inventory, Fleming and Courtney's 1984 Self-Rating Scale, and …

Go to article

Differential Cryptanalysis Of Substitution Permutation Networks And Rijndael-Like Ciphers, Gnanasekaran Sakthivel Jan 2006

Differential Cryptanalysis Of Substitution Permutation Networks And Rijndael-Like Ciphers, Gnanasekaran Sakthivel

Theses

A block cipher, in general, consist of several repetitions of a round transformation. A round transformation is a weak block cipher which consists of a nonlinear substitution transformation, a linear diffusion transformation and a key mixing. Differential cryptanalysis is a well known chosen plaintext attack on block ciphers. In this project, differential cryptanalysis is performed on two kinds of block ciphers: Substitution Permutation Networks(SPN) and Rijndael-like Ciphers. In order to strengthen a block cipher against differential attack, care should be taken in the design of both substitution and diffusion components and in the choice of number of rounds. In this …

Go to article

Jini Distributed Key Exchange And File Transfer Service With Digital Signatures, Kevin Ligozio Jan 2006

Jini Distributed Key Exchange And File Transfer Service With Digital Signatures, Kevin Ligozio

Theses

This thesis compares security algorithms for the Jini Networking Technology. The first method is to add security at the infrastructure level, and is the method chosen by the Jini Community in Jini version 2.0. The second method is the original research portion of this thesis, and explores adding security in the application layer. In order to explore the application layer security, the thesis includes four components. First, we investigate and implement some cryptographic algorithms. Specifically, we use a Java Cryptography Extension (JCE) Provider containing the Diffie-Hellman Key Agreement algorithm and the RSA Digital Signature Algorithm. Second, we perform a novel …

Go to article

Polynomial Time Primality Testing Algorithm, Takeshi Aoyama Jan 2006

Polynomial Time Primality Testing Algorithm, Takeshi Aoyama

Theses

In August 2002, three Indian researchers, Manindra Agrawal and his students Neeraj Kayal and Nitin Saxena at the Indian Institute of Technology in Kanpur, presented a remarkable algorithm (the AKS algorithm) in their paper "PRIMES is in P." It is a deterministic polynomial-time algorithm that determines whether an input number is prime or composite. No such algorithm was known so far and it has fundamental meaning for complexity theory. This project is centered around the AKS algorithm from the "PRIMES is in P" paper. The objectives are both experiments with the AKS algorithm and theorems and lemmas showing the correctness …

Go to article

Graph Reconstruction Numbers, Jennifer Baldwin Jan 2006

Graph Reconstruction Numbers, Jennifer Baldwin

Theses

One of the most important open questions in graph theory is the graph reconstruction conjecture, first proposed by P. J. Kelly and S. M. Ulam in 1941. The conjecture states that every graph with at least 3 vertices is reconstructible if there exists some multi-subset of vertex-deleted subgraphs that reconstructs G uniquely up to isomorphism. This project computes the existential and universal reconstruction numbers for all graphs of order at most nine. The existential reconstruction number is the number of vertex-deleted subgraphs, or cards, required to reconstruct G uniquely up to isomorphism. The universal reconstruction number is the minimum num- …

Go to article

Real-Time Scheduling Algorithms, Task Visualization, Kevin Churnetski Jan 2006

Real-Time Scheduling Algorithms, Task Visualization, Kevin Churnetski

Theses

Real-time systems are computer systems that require responses to events within specified time limits or constraints. Many real-time systems are digital control systems comprised entirely of binary logic or a microprocessor dedicated to one software application that is its own operating system. In recent years, the reliability of general-purpose real-time operating systems (RTOS) consisting of a scheduler and system resource management have improved. In this project, I write a real-time simulator, a workload generator, analysis tools, several test cases, and run and interpret results. My experiments focus on providing evidence to support the claim that for the Rate Monotonic scheduling …

Go to article

Emotion In Flocking, Katherine Law Jan 2006

Emotion In Flocking, Katherine Law

Theses

Behavioral animation is a category of computer animation that enables objects to determine their own actions. This saves an animator from having to determine every detail of movement for each object in the animation. As the number of objects within an animation increases, specifying the position of each object becomes increasingly difficult. Flocking is an example of behavioral animation. Some examples of flocking can be seen in movies, such as the stampede of the antelopes in The Lion King, the herds of dinosaurs in Jurassic Park, and the massive battle scenes in The Lord of the Rings. In this project, …

Go to article

Distributed Objects In C#, Xiaoyun Xie Jan 2006

Distributed Objects In C#, Xiaoyun Xie

Theses

Today more and more programs run over a collection of autonomous computers linked by a network and are designed to produce an integrated computing facility. Java Distributed Objects (JDO) proposed by Dr. Axel T. Schreiner builds an infrastructure which allows distributed program components to communicate over a network in a transparent, reliable, efficient, and generic way. JDO was originally intended as a teaching device to assess design parameters for distributed objects. This project focuses on porting JDO, which is implemented in Java on Sun's JDK, to C# on Microsoft's .NET. On one hand, it builds an infrastructure in C# that …

Go to article

Group Data Communication With M2mi, Kay Cheng Jan 2006

Group Data Communication With M2mi, Kay Cheng

Theses

The Anhinga Project is developing an infrastructure that supports board range of collaborative systems running on small proximal wireless devices in ad-hoc networks. The core of Anhinga Infrastructure is a new method invocation technology called the Many-to-Many Invocation (M2MI). In this technology, every method invocation is broadcasted through the network and all the objects that implement the same method execute it. M2MI is layered on a new network protocol, Many-to-Many Protocol (M2MP), which is designed for broadcasting messages within small wireless devices in Ad hoc network. In this project, I will provide three different design patterns of M2MI-based collaborative systems, …

Go to article

Web-Based 3-D Theatre Seating Charts And Ticket Reservation Application, Patrick Henstebeck Jan 2006

Web-Based 3-D Theatre Seating Charts And Ticket Reservation Application, Patrick Henstebeck

Theses

Seating charts for theatres and stadia have always been an important part of buying tickets to a staged event, despite offering little information about the view from any particular seat. While the internet has increased the potential to provide this information, most official arena websites and online ticket brokers still only provide the standard two-dimensional diagram whose detail is limited to the approximate location of each section and which offers no guidance as to the height or slope of the section, nor any warning of any obstructing objects that would depreciate a seat s true value. The few three-dimensional models …

Go to article

Algorithms For Bounding Folkman Numbers, Jonathan Coles Jan 2006

Algorithms For Bounding Folkman Numbers, Jonathan Coles

Theses

For an undirected, simple graph G, we write G -> (a_1,...,a_k)^v (G -> (a_1,...,a_k)^e) if for every vertex (edge) k-coloring, a monochromatic K_(a_i) is forced in some color i in {1,...,k}. The vertex (edge) Folkman number is defined as F_v(a_1,...,a_k;p) = min{|V(G)| : G -> (a_1,...,a_k;p)^v, K_p not in G} F_e(a_1,...,a_k;p) = min{|V(G)| : G -> (a_1,...,a_k;p)^e, K_p not in G} for p > max{a_1,...,a_k}. Folkman showed in 1970 that these numbers always exist for valid values of p. This thesis concerns the computation of a new result in Folkman number theory, namely that F_v(2,2,3;4)=14. Previously, the bounds stood at 10 <= F_v(2,2,3;4) <= 14, proven by Nenov in 2000. To achieve this new result, specialized algorithms were executed on the computers of the Computer Science network in a distributed processing effort. We discuss the mathematics and algorithms used in the computation. We also discuss ongoing research into the computation of the value of F_e(3,3;4). The current bounds stand at 16 <= F_e(3,3;4) <= 3e10^9. This number was once the subject of an Erd s prize---claimed by Spencer in 1988.

Go to article

Electronic Voting System For Rit Student Government Elections, Sungho Maeung Jan 2006

Electronic Voting System For Rit Student Government Elections, Sungho Maeung

Theses

Recent studies argue that traditional voting systems do not encourage increased voter participation due to constraints in time, location, accuracy, and, accessibility. To ensure the rights of a democratic society and to enhance and secure the voting rights of citizens by surpassing all the limitations of the traditional voting system, the development of an electronic voting system is an attractive solution. Research on secure electronic voting systems has been conducted for at least the past two decades. We propose to develop an electronic voting system, called the Rochester Institute of Technology Student Government Election System (SGEES) based on Damgard et …

Go to article

Managing The Acm Programming Contest, Navin Bhaskar Jan 2006

Managing The Acm Programming Contest, Navin Bhaskar

Theses

The Association for Computer Machinery (ACM) conducts an international collegiate programming contest held on an annual basis. Teams compete to solve multiple questions within the allotted six hour duration of the contest. A panel of judges grades the solutions online. The team that answers the maximum questions correctly wins the contest. This application will assist in the process of selection of winners of the programming contest. It will make the process of submission of solutions, and grading of the answers convenient. The ACM application is a Java based and web-enabled application and therefore platform independent.

Go to article

Myth- An Extension To C, Greg Rowe Jan 2006

Myth- An Extension To C, Greg Rowe

Theses

Myth is a programming language that is an extension of C. Myth adds modules, interfaces, tuple returns, and bit sets. These features are very helpful in nearly any programming environment. The Myth language as a whole is a good choice for embedded systems where resources are limited. Modules help organize code into logical groupings. Interfaces provide an automated mechanism to write reusable code. Tuple returns provide a simple mechanism for returning multiple values from a function. Bitsets make it easy to define logical groups of bit flags. Bisets are particularly useful in code that interfaces with hardware. The advantage of …

Go to article

N-Body Visualizations, William Mclaughlin Jan 2006

N-Body Visualizations, William Mclaughlin

Theses

In the age of technology and information, data calculations and visualizations are key to the communication and understanding of the world in which we live. It is sometimes difficult to display data in a way to make it clear and understanding, or is difficult to calculate the data to be displayed. The N-body problem has elements of both. The N-body problem is a set of N particles representing stars that move in response to the gravitational force generated by the N-1 other particles. There have been many attacks to this problem. The GRAPEcluster Project of RIT has developed software and …

Go to article

M2mimud, Robert Whitcomb Jan 2006

M2mimud, Robert Whitcomb

Theses

M2MIMud is a simple MUD (multi-user dungeon) type game that is designed to run on an ad hoc network of devices without the presence of any central server. It runs over Many-to-Many Invocation (M2MI), a distributed object system API that uses broadcasts and handles, rather than IP addresses, to communicate. Most existing multi-user computer games rely on a client-server architecture with a central server storing and maintaining the state of the game. In contrast, M2MIMud runs on an ad hoc network of devices with no central server. This paper describes M2MI and its use for serverless multi-user applications, discusses the …

Go to article

Ad Hoc Collaborative Photo Sharing With A Tuple Board, Yutao Cheng Jan 2006

Ad Hoc Collaborative Photo Sharing With A Tuple Board, Yutao Cheng

Theses

The tuple board is a new distributed computing paradigm based on the tuple space concept invented by Gelernter in 1985. Designed for ad hoc mobile wireless networks, tuple board is a serverless architecture that differs from the original client-server paradigm proposed in tuple space. In this project, Tuple Board, a tuple board implementation has been developed based on the M2MP protocol. Comparing to the previous implementation in Bondada's work, the following improvements have been made: (1) M2MP, instead of M2MI, is used as the underlying network protocol for data communication, (2) notification is available in the tuple board implementation for …

Go to article

Integrating Database And Data Stream Systems, Rutul Mashruwala Jan 2006

Integrating Database And Data Stream Systems, Rutul Mashruwala

Theses

Traditionally, Database systems are viewed as passive data storage. Finite data sets are stored in traditional Database Systems and retrieved when needed. But applications such as sensor networks, network monitoring, retail transactions, and others, produce infinite data sets. A new system is under research and development, known as Data Stream Management System (DSMS), to deal with the infinite data sets. In DSMS, Data stream is a continuous source of sequential data. In Object-Oriented languages, like C/C++ and Java, the concept of stream does exist. The stream is viewed as a channel to which data is being inserted at one end …

Go to article

Faculty Scheduling Using Genetic Algorithms, Kevin Soule Jan 2006

Faculty Scheduling Using Genetic Algorithms, Kevin Soule

Theses

The problem of developing a class schedule for a faculty has been proven to be NP-complete. Therefore when the schedule is large enough, finding just one feasible solution can be impossible for any direct search algorithm within a reasonable time. This project is geared toward investigating the possibility of using genetic-based algorithms to solve faculty scheduling problems of 100 courses or larger quickly. Multiple versions of genetic algorithms and heuristics are tested. Many parameter levels for these algorithms are optimized for fastest convergence.

Go to article

Hf-Dsr: Dynamic Source Routing For High Frequency Radio Networks, Michael Stringer Jan 2006

Hf-Dsr: Dynamic Source Routing For High Frequency Radio Networks, Michael Stringer

Theses

HF-DSR is an ad hoc routing protocol designed to operate efficiently over high frequency (HF) radio networks. Ad hoc routing protocols allow networks to provide dynamic routing between endpoints. In contrast, static routing schemes require networks to be configured with potential routes in advance. As such, ad hoc routing mechanisms can compensate for unanticipated factors such as radio frequency (RF) interference or node mobility. HF-DSR is largely based on Dynamic Source Routing (DSR), a level 3 ad hoc networking protocol that emits network control information on demand. HF-DSR incorporates portions of DSR which minimize the quantity of control information transmitted. …

Go to article

First Prev Next Last