Covers introductory material, survey material, predictions of future trends, biographies, and miscellaneous computer-science related material. Roughly includes all of ACM Subject Class A, except it does not include conference proceedings which will be listed in the appropriate subject area. Covers all aspects of computer graphics. Covers systems organization and hardware architecture.
Covers human factors, user interfaces, and collaborative computing. Covers indexing, dictionaries, retrieval, content and analysis. Covers theoretical and experimental aspects of information theory and coding. Covers all aspects of logic in computer science, including finite model theory, logics of programs, modal logic, and program verification.
Programming language semantics should have Programming Languages as the primary subject area. Papers on all aspects of machine learning research supervised, unsupervised, reinforcement learning, bandit problems, and so on including also robustness, explanation, fairness, and methodology. LG is also an appropriate primary category for applications of machine learning methods. Covers multiagent systems, distributed artificial intelligence, intelligent agents, coordinated interactions.
Also includes topics, such as web caching, that are directly relevant to Internet architecture and performance. Covers neural networks, connectionism, genetic algorithms, artificial life, adaptive behavior. NA is an alias for math. This is the classification to use for documents that do not fit anywhere else.
Covers performance measurement and evaluation, queueing, and simulation. Covers programming language semantics, language features, programming approaches such as object-oriented programming, functional programming, logic programming. Also includes material on compilers oriented towards programming languages; other material on compilers may be more appropriate in Architecture AR. Covers the design, analysis, and modeling of social and information networks, including their applications for on-line information access, communication, and interaction, and their roles as datasets in the exploration of questions in these and other domains, including connections to the social and biological sciences.
Papers on computer communication systems and network protocols e. NI category. Covers design tools, software metrics, testing and debugging, programming environments, etc. Covers all aspects of computing with sound, and sound as an information channel. Includes models of sound, analysis and synthesis, audio user interfaces, sonification of data, computer music, and sound signal processing.
SY is an alias for eess. In , we used the term computing instead of computer science , mathematics, and engineering. Today, computing science, engineering, mathematics, art. Discrete mathematical structures with applications to computer science free download The objectives of the course are: To develop Professional Skills through effective communication To introduce a number of Mathematical Foundation to be serving as tools even today in the development of theoretical computer science To gain some confidence on.
Bringing computational thinking to K what is Involved and what is the role of the computer science education community free download When Jeanette Wing  launched a discussion regarding the role of computational thinking across all disciplines, she ignited a profound engagement with the core questions of what computer science is and what it might contribute to solving problems across the. Each new circuit indeed appears different, employing different components. Information technology research: A practical guide for computer science and informatics free download Information Technology Research: A Practical Guide for Computer.
First it defines science and scientific method in. Active learning and its use in computer science free download Student learning and the depth of the students knowledge increase when active learning methods are employed in the classroom. Active learning strategies are discussed in general computer science course work and as used in a theory of computation course.
Why the high attrition rate for computer science students: some thoughts and observations free download 1. Introduction At our university, there are over four hundred declared majors in Computer Science. Each semester, however, only about fifteen to twenty students graduate in this field. The freshman courses comprise overflowing multiple sections, but the upper level courses make. Form and content in computer science free download The trouble with computer science today is an obsessive concern with form instead of content.
No, that is the wrong way to begin. By any previous standard the vitality of computer science is enormous; what other intellectual area ever advanced so far in twenty years. Traditional paths to wealth like law, medicine, and business are more certain, and over the. It was a fundamental idea, going back to the work of Hartmanis and Stearns in the early s, to measure the required The combinatorics of network reliability, International Series of Monographs on Computer Science free download This book develops combinatorial tools which are useful for reliability analysis, as demonstrated with a probabilistic network model.
More developed Languages and machines: an introduction to the theory of computer science free download Languages and machines : an introduction to the theory of computer. The linear representation may be a sentence, a computer The Cambridge distributed computing system. The Best Computer Science Programs in the Logic and the challenge of computer science free download Nowadays computer science is surpassing mathematics as the primary field of logic applications, but logic is not tuned properly to the new role.
In particular, classical logic is preoccupied mostly with infinite static structures whereas many objects of interest in Computer science unplugged free download For kids ages 7 to This educational 50 minute show is an action-packed, zany time exploring neat ideas in computer science.
|Help with cheap critical essay on lincoln||Cheap dissertation methodology writing for hire ca|
|Cs research papers||Cover letter multiple enclosure format|
|Cs research papers||Description: Introduces Liskov substitution principle and establishes behavioral subtyping rules. Add statecharts paper in a new systems modeling category Latest commit. Adding NashGrief in econ Topics covered: theoretical computer scienceincluding computability theorycomputational complexity theoryalgorithmsalgorithmic information theoryinformation theory and formal verification.|
The ideas are important when trying to understand containment of malicious code, as well as aspects of trusted computing. Description: The Unix operating system and its principles were described in this paper. The main importance is not of the paper but of the operating system, which had tremendous effect on operating system and computer technology. Description: This paper describes the consistency mechanism known as quorum consensus.
It is a good example of algorithms that provide a continuous set of options between two alternatives in this case, between the read-one write-all, and the write-one read-all consistency methods. There have been many variations and improvements by researchers in the years that followed, and it is one of the consistency algorithms that should be understood by all.
The options available by choosing different size quorums provide a useful structure for discussing of the core requirements for consistency in distributed systems. Description: This is the classic paper on synchronization techniques, including both alternate approaches and pitfalls. Description: Algorithms for coscheduling of related processes were given.
One of the first papers discussing how to manage disk storage for high-performance file systems. Most file-system research since this paper has been influenced by it, and most high-performance file systems of the last 20 years incorporate techniques from this paper.
Description: Log-structured file system. Description: This is a good paper discussing one particular microkernel architecture and contrasting it with monolithic kernel design. Mach underlies Mac OS X , and its layered architecture had a significant impact on the design of the Windows NT kernel and modern microkernels like L4. In addition, its memory-mapped files feature was added to many monolithic kernels. Description: The paper was the first production-quality implementation of that idea which spawned much additional discussion of the viability and short-comings of log-structured filesystems.
While "The Design and Implementation of a Log-Structured File System" was certainly the first, this one was important in bringing the research idea to a usable system. Fortran is a general-purpose , procedural , imperative programming language that is especially suited to numeric computation and scientific computing. Description: This paper introduced LISP , the first functional programming language , which was used heavily in many areas of computer science, especially in AI.
Description: This seminal paper proposed an ideal language ISWIM , which without being ever implemented influenced the whole later development. Description: Fundamental Concepts in Programming Languages introduced much programming language terminology still in use today, including R-values , L-values , parametric polymorphism , and ad hoc polymorphism. Description: This series of papers and reports first defined the influential Scheme programming language and questioned the prevailing practices in programming language design, employing lambda calculus extensively to model programming language concepts and guide efficient implementation without sacrificing expressive power.
Description: This textbook explains core computer programming concepts, and is widely considered a classic text in computer science. Online course. Description: This paper introduced monads to functional programming. Description: This paper introduced System F and created the modern notion of Parametric polymorphism. Description: This paper introduce Hoare logic , which forms the foundation of program verification.
Description: Conference of leading people in software field c. Description: A description of the system that originated the now dominant GUI programming paradigm of Model—view—controller. Description: Don't use goto — the beginning of structured programming. Description: The importance of modularization and information hiding. Description: The beginning of Object-oriented programming.
This paper argued that programs should be decomposed to independent components with small and simple interfaces. They also argued that objects should have both data and related methods. Description: Introduces Liskov substitution principle and establishes behavioral subtyping rules. Description: software specification.
Description: Seminal paper on Structured Design , data flow diagram , coupling , and cohesion. Description: Illustrates the " second-system effect " and the importance of simplicity. Description: Brooks argues that "there is no single development, in either technology or management technique, which by itself promises even one order of magnitude [tenfold] improvement within a decade in productivity, in reliability, in simplicity.
Description: Open source methodology. Description: This book was the first to define and list design patterns in computer science. Description: Statecharts are a visual modeling method. They are an extension of state machine that might be exponentially more efficient. Therefore, statcharts enable formal modeling of applications that were too complex before. Statecharts are part of the UML diagrams.
Topics covered: theoretical computer science , including computability theory , computational complexity theory , algorithms , algorithmic information theory , information theory and formal verification. From Wikipedia, the free encyclopedia. Wikimedia list article. This article has multiple issues. Please help improve it or discuss these issues on the talk page.
Learn how and when to remove these template messages. This article has an unclear citation style. The references used may be made clearer with a different or consistent style of citation and footnoting. October Learn how and when to remove this template message. This article may require cleanup to meet Wikipedia's quality standards. The specific problem is: citations in headings Please help improve this article if you can. August Learn how and when to remove this template message. The lead section of this article may need to be rewritten.
Use the lead layout guide to ensure the section follows Wikipedia's norms and is inclusive of all essential details. March Learn how and when to remove this template message. Main article: List of important publications in concurrent, parallel, and distributed computing. Main article: Structure and Interpretation of Computer Programs. Main article: Computational science. Main article: List of important publications in cryptography.
Main article: List of important publications in theoretical computer science. Statistics and Probability Letters. The representation of the cumulative rounding error of an algorithm as a Taylor expansion of the local rounding errors. Master's Thesis, Univ. Helsinki, Who Invented the Reverse Mode of Differentiation?
International Journal of Computer Vision. CiteSeerX S2CID Archived from the original PDF on Retrieved McGrawhill Education. Archived from the original on 4 September Retrieved 1 Jan Penn Engineering. Archived PDF from the original on Archived from the original on Retrieved on Laplante, Phillip, ed. Great papers in computer science. ISBN Randell, Brian ed.
Berlin: Springer-Verlag. Yourdon, Edward ed. New York: Yourdon Press. Important publications in science. Biology Chemistry Geology Physics. Anthropology Economics Psychology humor research Sociology. Philosophy Antiquarian science books. Categories : Computer science papers History of computer science Lists of publications in science Artificial intelligence publications Computing-related lists. Hidden categories: CS1 maint: archived copy as title Webarchive template wayback links Articles with short description Short description matches Wikidata Wikipedia references cleanup from October All articles needing references cleanup Articles covered by WikiProject Wikify from October All articles covered by WikiProject Wikify Articles needing cleanup from August All pages needing cleanup Cleanup tagged articles with a reason field from August Wikipedia pages needing cleanup from August Wikipedia introduction cleanup from March Articles covered by WikiProject Wikify from March Articles with multiple maintenance issues.
It let's you filter results by the field of study, and it has currently indexed more than Springer's Lecture Notes in Computer Science is the number one publishing source for conference proceedings covering all areas of computer science.
EEE Xplore holds more than 4. Guides Research Academic Databases. The top list of computer science research databases. What is dblp computer science bibliography? What is Microsoft Academic? ACM Digital Library 2.
Items per page 5 10 20 - All -. Maneesh Agrawala. Alex Aiken. Computer Systems Programming Systems and Verification. Peter Bailis. Assistant Professor. Clark Barrett. Associate Professor. Serafim Batzoglou. Artificial Intelligence Computational Biology. Gill Bejerano. Michael Bernstein. Jeannette Bohg. Artificial Intelligence Robotics. Dan Boneh. A collection of multiplicative perturbations with a given structure can be viewed as a nontrivial n-dimensional manifold.
This manifold can be divided into regions of stability and instability where the unperturbed identity matrix is a This manifold can be divided into regions of stability and instability where the unperturbed identity matrix is a point on the manifold.
The stability margin for a collection of such structured perturbations can be defined as the smallest distance on the manifold from the identity matrix to the region of instability. The class of unitary perturbations which has been shown to define the multivariable phase margin is examined. Specifically, it is seen that the margin is the smallest arc length on the three-sphere S3 between the north pole and the region of instability.
Most cases are trapped in the system due to a huge backlog of cases, excessive litigation in urban Most cases are trapped in the system due to a huge backlog of cases, excessive litigation in urban areas, corruption by the court staff and lack of proper monitoring of the functioning of courts.
Efficient supervision and monitoring of courts can help in resolving some of the key problems in the system. We present preliminary results from a novel case record-keeping, management and monitoring solution that is able to meet several key performance goals of the National Judicial Policy. The overall aim of the work is to facilitate the work of the monitoring judges by helping them find the proverbial needle in the haystack and not get deluged by the volume of data routinely produced by the typical case-management systems.
In this paper, we explore the application of intrusion detection techniques, such as the statistical anomaly detection schemes, to case management systems and present the results from our extensive case studies. Our proposed system, now in pilot, shows high accuracy in flagging anomalous cases, reduces the overall volume of information generated by the system and can help target several of the key reasons behind case pendency while bringing much needed transparency to the overall case-flow.
Deconvolution of electrograms to detect infarcted myocardium. Ablation to prevent cardiac arrhythmias requires interpretation of electrograms to locate the arrhythmogenic tissue. This study examined a novel signal processing technique employing deconvolution to calculate electrograms which best fit This study examined a novel signal processing technique employing deconvolution to calculate electrograms which best fit observed electrograms. We hypothesize that the power of difference between the calculated and the observed electrogram detects changes in morphology resulting from myocardial infarction.
Fault modeling and testable design of 2-level complex ECL gates. Abstract Bipolar emitter coupled logic ECL devices can now be fabricated at very high densities and much lower power consumption. Behaviour of 2-level complex ECL gates is examined in the presence of physical faults. It is shown that It is shown that the conventional stuck-at fault model cannot represent a majority of circuit level faults. A new augmented stuck-at fault model is presented which provides a significantly higher coverage of physical failures.
A testable design approach is presented for on-line detection of certain error conditions Estimating the number of residual defects [in software]. Gate level representation of ECL circuits for fault modeling. Prediction of software reliability using neural networks. Evaluation of detectability in BIST environment. How to estimate its testing capabilities is an important problem.
BIST detectability is defined as the probability of that a fault set of the circuit-under-test is BIST detectability is defined as the probability of that a fault set of the circuit-under-test is detected. It depends on the properties of the test at, circuit-under-test, as well as the signature analyser as a data compressor. The detectability of a signature analyzer is evaluated.
The random and pseudorandom testing techniques are examined for their BIST detectability and several results are derived. On the testing of microprogrammed processor. Abstract A testing procedure is given for a microprogrammed processor. The conventional procedure to generate test vectors is used instead of C-testability for the bit-slice microprocessor.
The minimal complete test sequences are The minimal complete test sequences are calculated for the micro-sequencer and the ALU, and stored in the micro-memory. Micro-memory is implemented by an electrically erasable PLA which has the capability to test itself using a universal test set. A one-bit wide processor section is assumed. However, the method can be extended to a Modeling of faulty behavior of ECL storage elements.