Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Amino acid sequence (1)
- Animals (1)
- Benzyl acetate (1)
- Binding sites (1)
- Chromosome mapping (1)
-
- Cloning (1)
- Computational geometry (1)
- Corn oil (1)
- Divide-and-conquer (1)
- Dna (1)
- Dna-binding proteins (1)
- F344 (1)
- Free tree (1)
- Gene expression regulation (1)
- Genes (1)
- Homeobox (1)
- Investigation method (1)
- Lew (1)
- Location theory (1)
- Mice (1)
- Microcomputer (1)
- Molecular (1)
- Nucleic acid (1)
- Primary structure (1)
- Rats (1)
- Sequence homology (1)
- Structure-activity relationship (1)
- Publication
- Publication Type
Articles 1 - 23 of 23
Full-Text Articles in Physical Sciences and Mathematics
The Homeo Domain Of A Murine Protein Binds 5' To Its Own Homeo Box., Abraham Fainsod, Leonard D. Bogarad, Tarmo Ruusala, Martin Lubin
The Homeo Domain Of A Murine Protein Binds 5' To Its Own Homeo Box., Abraham Fainsod, Leonard D. Bogarad, Tarmo Ruusala, Martin Lubin
Dartmouth Scholarship
Nuclear protein extracts from day 12.5 mouse embryos were used to study protein binding to DNA sequences 5' of the Hox 1.5 homeo box. Embryos of this developmental stage are known to express this gene. DNA binding protein blotting and retardation gel techniques show that murine embryonic nuclear proteins specifically bind a 753-base pair (bp) DNA fragment from the region upstream of the Hox 1.5 homeo box. A fusion protein containing the Hox 1.5 homeo domain constructed in lambda gt11 also binds the same 753-bp DNA fragment. Specific binding of the fusion protein to the upstream DNA fragment shows that …
Effects Of Corn Oil And Benzyl Acetate On Number And Size Of Azaserine-Induced Foci In The Pancreas Of Lew And F344 Rats, Daniel S. Longnecker, B D. Roebuck, Thomas J. Curphey, Evelyne Lhoste, Charles I. Coon, Denise Macmillan
Effects Of Corn Oil And Benzyl Acetate On Number And Size Of Azaserine-Induced Foci In The Pancreas Of Lew And F344 Rats, Daniel S. Longnecker, B D. Roebuck, Thomas J. Curphey, Evelyne Lhoste, Charles I. Coon, Denise Macmillan
Dartmouth Scholarship
The response of LEW and F344 strain rats to the pancreatic carcinogen azaserine was compared using the size and number of azaserine-induced acidophilic acinar cell foci and nodules as parameters in a 4-month experiment. A second experiment compared the effect of corn oil intake by gavage and dietary routes on the growth of azaserine-induced pancreatic lesions in LEW rats. A third experiment tested the activity of benzyl acetate in regard to its ability to induce acinar cell foci or to promote the growth of such foci in azaserine-treated rats. The results showed that equivalent doses of azaserine induce two to …
The Orbital Period Of The Optical/X-Ray Burster X1735-444 (V926 Sco), R. H. D. Corbet, J. R. Thorstensen, P. A. Charles, J. W. Menzies
The Orbital Period Of The Optical/X-Ray Burster X1735-444 (V926 Sco), R. H. D. Corbet, J. R. Thorstensen, P. A. Charles, J. W. Menzies
Dartmouth Scholarship
We present extensive CCD photometry of the optical counterpart of X1735–444 which reveals the orbital period of the system. It is periodically variable with a period of 4.654 hr and a full amplitude of 0.15 mag. The mean modulation is quasi-sinusoidal; there are, however, also significant intrinsic deviations from the mean light curve.
There Is A Planar Graph Almost As Good As The Complete Graph, L Paul Chew
There Is A Planar Graph Almost As Good As The Complete Graph, L Paul Chew
Dartmouth Scholarship
Given a set S of points in the plane, there is a triangulation of S such that a path found within this triangulation has length bounded by a constant times the straight-line distance between the endpoints of the path. Specifically, for any two points a and b of S there is a path along edges of the triangulation with length less that sqrt(10) times [ab], where [ab] is the straight-line Euclidean distance between a and b. The triangulation that has this property is the L1 metric Delauney triangulation for the set S. This result can be applied to motion planning …
Making Mail Friendlier: Adding Macintosh Features And Multimedia Documents In Unix Mail, John R. Meier
Making Mail Friendlier: Adding Macintosh Features And Multimedia Documents In Unix Mail, John R. Meier
Dartmouth College Undergraduate Theses
This paper describes a Macintosh application which acts as a front-end to Unix mail. Features of the Macintosh interface such as icons, menus, and windows replace the command driven interface. Complicated editing commands are replaced with mouse selection and cut, copy, and paste. Message can be composed of text, pictures, and any Macintosh file, because they are encoded into plain text, sent through the mail system,and then unencoded by the receiving end. The designs of the mail server and communications interface are such that mail servers and communications other than Unix mail and a serial line may be easily implemented.
A Procedure For Testing Cored Ice Under Uniaxial Tension, Russell W. Lee
A Procedure For Testing Cored Ice Under Uniaxial Tension, Russell W. Lee
Dartmouth Scholarship
A procedure is described for testing cored ice specimens under uniaxial tension. The procedure incorporates an end-capping system described by Cole and others (1985), two carpeted Synthane end caps, and extensometers mounted directly on the ice. Use of the procedure has resulted in a successful test rate of 75%
Functions Returning Values Of Dynamic Size, Mark Sherman, Andy Hisgen, Jonathan Rosenberg, David Alex Lamb
Functions Returning Values Of Dynamic Size, Mark Sherman, Andy Hisgen, Jonathan Rosenberg, David Alex Lamb
Computer Science Technical Reports
Modern programming languages, such as Ada (Ichbiah 80), permit the definition of functions that return values whose size can not be determined until the function returns. This paper discusses five implementation techniques that can be used to implement this capability. Comparisons of the techniques are provided and guidelines for selecting a particular technique for a compiler are given.
Computing The Largest Empty Rectangle, B. Chazelle, R. L. Drysdale, D. T. Lee
Computing The Largest Empty Rectangle, B. Chazelle, R. L. Drysdale, D. T. Lee
Dartmouth Scholarship
We consider the following problem: Given a rectangle containing N points, find the largest area subrectangle with sides parallel to those of the original rectangle which contains none of the given points. If the rectangle is a piece of fabric or sheet metal and the points are flaws, this problem is finding the largest-area rectangular piece which can be salvaged. A previously known result [13] takes $O(N^2 )$ worst-case and $O(N\log ^2 N)$ expected time. This paper presents an $O(N\log ^3 N)$ time, $O(N\log N)$ space algorithm to solve this problem. It uses a divide-and-conquer approach similar to the ones …
A Dna Sequence Analysis Program For The Apple Macintosh, Robert H. Gross
A Dna Sequence Analysis Program For The Apple Macintosh, Robert H. Gross
Dartmouth Scholarship
This paper describes a new set of programs * for analyzing DNA sequences using the Apple Macintosh computer, a computer ideally suited for this kind of analysis. Because of the Macintosh interface and the availability of high quality software-only speech synthesis, these programs are truly easy to use. Instead of typing in commands, the user directs the program by making selections with the mouse, thereby eliminating most typographical and syntax errors. Output options are selected by “pressing buttons” and then clicking “OK” with the mouse. DNA sequences are confirmed by having the program speak them. The high resolution graphics on …
Instructions For Using Logic, John W. Scott
Instructions For Using Logic, John W. Scott
Computer Science Technical Reports
This document provides instructions on the use of "Logic", a digital logic simulator for the Macintosh written for Dartmouth students in the Machine Architecture and Digital Electronics courses.
Uses Of Generics In Ada, Mark Sherman
Uses Of Generics In Ada, Mark Sherman
Computer Science Technical Reports
This paper discusses how Ada generic procedures and packages can be used in novel ways to provide general initialization of records, expressions using discriminants, record field hiding and explicit control of parameter binding.
Algorithms For Iterative Array Multiplication, Shinji Nakamura
Algorithms For Iterative Array Multiplication, Shinji Nakamura
Computer Science Technical Reports
Algorithms for the parallel multiplication of two n bit binary numbers by an iterative array of logic cells are discussed. The regular interconnection structures of the multiplier array cell elements, which are ideal for VLSI implementation, are described. The speed and hardware complexity of two new iterative array algorithms, both of which require n cell delays for one n by n bit multiplication, are compared with a straight-forward iterative array algorithm having a 2n cell delay and its higher radix version having an n cell delay.
A Practical, Distributed Environment For Macintosh Software Development, Mark Sherman, Ann Marks, Rob Collins, Heather Anderson, Jerry Godes, Denis Devlin, Leonid Spector, Vivian Sewelson
A Practical, Distributed Environment For Macintosh Software Development, Mark Sherman, Ann Marks, Rob Collins, Heather Anderson, Jerry Godes, Denis Devlin, Leonid Spector, Vivian Sewelson
Computer Science Technical Reports
We describe a development environment we created for prototyping software for the Macintosh. The programs are developed and executed on a large time-shared computer but can use the full facilities of the Macintosh. By using this system, we combine the advantages of the large system, such as large amounts of disk storage and automatic file backups, with the advantages of the Macintosh, such as advanced graphics, mouse control and sound synthesis. We also describe several projects that used the distributed development system. We conclude with a description of our future plans for this environment.
Parallel Accessible Memory, Shinji Nakamura
Parallel Accessible Memory, Shinji Nakamura
Computer Science Technical Reports
A new design of a memory device which allows simultaneous access to more than one location is proposed. The unique feature of this multiple accessibility of the memory is realized by applying a binomial concentrator, a type of sparse crossbar interconnection network, to content-addressable memory. The organization of the memory system and the concentration network structure as well as the network characteristics are described along with a distributive control algorithm. Applications of the memory system to parallel processing environments are also included.
Finding Largest Empty Circles With Location Constraints, L Paul Chew, Robert L. Scot Drysdale
Finding Largest Empty Circles With Location Constraints, L Paul Chew, Robert L. Scot Drysdale
Computer Science Technical Reports
Let S be a set of n points in the plane and let CH(S) represent the convex hull of S. The Largest Empty Circle (LEC) problem is the problem of finding the largest circle centered with CH(S) such that no point of S lies within the circle. Shamos and Hoey (SH75) outlined an algorithm for solving this problem in time O(n log n) by first computing the Voronoi diagram, V(S), in time O(n log n), then using V(S) and CH(S) to compute the largest empty circle in time O(n). In a recent paper [Tou83], Toussaint pointed out some problems with …
A Distributed Strategy For Resource Allocation, Ann Kratzer
A Distributed Strategy For Resource Allocation, Ann Kratzer
Computer Science Technical Reports
In this paper, we present a decentralized algorithm for determining how resources should be allocated to sites. This algorithm is general in the sense that it can be used for allocating different kinds of resources. This algorithm can be applied either statically, used on a quiescent system, or used dynamically as the system runs. Throughout, we consider only systems in which a resource has a fixed cost associated with it regardless of where it may be located (i.e. the system is homogeneous).
Task Queues: A General Model For The Implementation Of Communications Protocols, Ann Kratzer
Task Queues: A General Model For The Implementation Of Communications Protocols, Ann Kratzer
Computer Science Technical Reports
When any computer communications network is built, its communications protocol must always be implemented. The protocol is implementetd on the switching nodes of the network. The node software must respond in real time to events generated external to the switching node. Thus, the software running on a switching node constitutes a concurrent program; this complicates the design, implementation and testing of the switching node software. The task queue model presented in this paper defines a structure for this software that facilitates the design, implementation and testing of communications protocols.
The Pairwise Intersection Problem For Monotone Polygons, David B. Levine
The Pairwise Intersection Problem For Monotone Polygons, David B. Levine
Computer Science Technical Reports
Geometric intersection problems arise in a number of areas of computer science including graphics and VLSI design rule checking. Previous work has concentrated on solving the pairwise intersection problem for line segments and iso-oriented rectangles. This thesis extends that work by presenting efficient algorithms to solve the pairwise intersection problem for monotone polygons. For general segments, the problem has been solved in O(N+I)*logN) time using a sweeping line technique, where N is the number of segments and I is the number of intersections reported. We combine this technique with approaches taken to solve the iso-oriented rectangle problem to yield an …
View 3: A Programming Environment For Distributed Programming, Ann Kratzer
View 3: A Programming Environment For Distributed Programming, Ann Kratzer
Computer Science Technical Reports
View 3 is an experimental programming environment to support the development and use of distributed programs. It builds upon three major concepts. First, distributed programs and distributed processes are basic objects. Second, the port mechanism allows a process to exchange information with another process, a file or an I/O device without concern for the type of the object on the other end of the port. Third, test and use of distributed programs are facilitated by the user interface program screen format that allows the user to control both the format and contents of the physical terminal.
Producing Software Using Tools In A Workstation Environment, Mark Sherman, Robert L. Scot Drysdale
Producing Software Using Tools In A Workstation Environment, Mark Sherman, Robert L. Scot Drysdale
Computer Science Technical Reports
We discuss how we taught students to build and use translation, interpretive, editing and monitoring tools in an undergraduate software engineering course. Students used the tools on low-cost workstations (Macintoshes) to build large, group projects. The students' projects used all available features of workstation environments, including graphics, windows, fonts, mice, networks, and sound generators. We found that 1) the use of tools increased student productivity, 2) a shift in a data structure and algorithm topics is needed to cover material relevant for workstation environments, 3) new topics in system design are required for a workstation environment, 4) traditional material can …
An Algorithm For Resource Allocation Requiring Low Overhead Communication, Ann Marks
An Algorithm For Resource Allocation Requiring Low Overhead Communication, Ann Marks
Computer Science Technical Reports
A heuristic algorithm for allocating resource units to sites in a distributed system is presented. Starting with a given allocation of sites, the algorithm performs a series of optimizations involving pairs of sites in an attempt to improve the worst pair-wise imbalance present in the system; termination occurs when no further improvement is possible. After outlining the general form of the algorithm, which effectively defines an entire family of algorithms, we present theoretical results that speak to the performance of the algorithm as measured in the number of optimizations that can be done, the amount of control communication required and …
Using Low-Cost Workstations To Investigate Computer Networks And Distributed Systems, Mark Sherman, Ann Marks
Using Low-Cost Workstations To Investigate Computer Networks And Distributed Systems, Mark Sherman, Ann Marks
Computer Science Technical Reports
A quality education in contemporary computer science requires that students gain experience with realistic systems. Many efforts at bringing empirical computer science to undergraduates focus on rather old technologies, for example, building a compiler or simulating a disk scheduler. Although efforts are being made to use some newer technologies, the efforts are concentrating on teaching traditional material in a new medium. However, the medium itself -- networked workstations in a server environment -- is worthy of exploration by undergraduate students in a laboratory setting. At Dartmouth, we developed a Computer Network Laboratory to let students experiment with computer networks, protocols …
A Network Package For The Macintosh Using The Dod Internet Protocols, Mark Sherman
A Network Package For The Macintosh Using The Dod Internet Protocols, Mark Sherman
Computer Science Technical Reports
This memo describes the design, implementation and use of the MacIP libraries and programs for running DoD Internet Protocols on the Macintosh over Apple Talk. It is preliminary documentation and out of date, but it is all that exists.