Geometry.Net - Basic_P: Programming General


Home - Basic_P - Programming General

e99.com Bookstore

Images

Newsgroups

81-100 of 194 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | Next 20

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Programming General: more books (100)

Instant SQL Programming by Joe Celko, 1995-08
Joe Celko's SQL Programming Style (The Morgan Kaufmann Series in Data Management Systems) by Joe Celko, 2005-05-01
Scratch Programming for Teens by Jr. Jerry Lee Ford, 2008-06-25
Computer Programming 101: How To Learn Computer Programming Made Simple & Easy! by Randall Magwood, 2009-06-16
Core LEGO MINDSTORMS Programming: Unleash the Power of the Java Platform by Brian Bagnall, 2002-03-21
Faster Smarter Beginning Programming by Jim Buyens, 2002-11-13
Introduction to C Programming with a little OpenGL Graphics for fun by Robert P. Cook, 2008-08-19
DarkBASIC Programming for the Absolute Beginner (No Experience Required (Course Technology)) by Jr. Jerry Lee Ford, 2008-01-03
Network Programming for Microsoft Windows, Second Edition (Pro-Developer) by Anthony Jones, Jim Ohlund, 2002-02-13
Professional Linux Programming (Programmer to Programmer) by Jon Masters, Richard Blum, 2007-03-12
AI Application Programming (Programming Series) by M. Tim Jones, 2005-06-03
Introduction to Functional Programming using Haskell (2nd Edition) by Richard Bird, 1998-05-09
Just Enough C/C++ Programming by Guy W. Lecky-Thompson, 2007-11-12
Programming an RTS Game with Direct3D by Carl Granberg, 2006-10-11

lists with details

The Starlog Project At The University Of Waikato
Declarative temporal logic programming language for general purpose programming, simulation, modeling reactive systems. Starlog programs consist of 2 components a set of timed facts, a set of temporal logic rules. Somewhat like Prolog.
http://www.cs.waikato.ac.nz/Research/starlog/index.html

Extractions: A new Logic Programming Language What is Starlog? Starlog is a pure-logic programming language designed to overcome some of the problems inherient in traditional approaches to logic programming. As a result, Starlog is designed to be a general purpose programming language, and is particularly useful for simulation, and for modelling reactive systems. Although most logic programming languages (e.g. Prolog) are query driven (i.e. are evaluated "top-down"), Starlog programs are evaluated "bottom-up". That is, as a Starlog program executes, it builds a model of all the true facts that can be derived from rules in the program. The evaluation of Starlog programs is controlled using a stratification order. Traditionally, logic programming languages have never been able to compete with the popularity of other language paradigms. We attribute this to:
Programmers Heaven - General Programming Programming Zone
Current area HOME general programming Zone, Adds this page to your personalfavorites. general programming zone. Other Languages. Other Languages (105).
http://www.programmersheaven.com/zone22/
SURVEY OF PROGRAMMING LANGUAGES
general feature comparisons, explanations.
http://faculty.frostburg.edu/cosc/htracy/cosc120/MODULES120/NetPL/PL_Net.htm

Extractions: THAT ARE ASSOCIATED WITH THE WEB Computer languages are software (translators) that allow a developer to program a computer system ; The most common use of computer languages is to write programs. Numerous programming languages have been developed to facilitate the translation of the developer's algorithms (procedures for accomplishing tasks) into language programs that a computer can execute. The following over-simplified survey separates all computer languages into three categories: low, high, and very-high, after which it focuses primarily on examples used for Web applications, especially markup languages, Java, and JavaScript. (For a little more general survey of programmin languages check out my
POPL97 General Information
POPL97 general Information and Call For Participation. The 24th AnnualACM SIGPLANSIGACT Symposium on Principles of programming Languages.
http://www.cs.umd.edu/~pugh/popl97/

Extractions: Principles of Programming Languages Paris, France , January 15-17, 1997 ACM SIGPLAN and SIGACT are proud to organize POPL'97, the 24th Annual Symposium on Principles of Programming Languages. The symposium is a forum for discussion of principles, innovations, and accomplishments in the design, definition, analysis, and implementation of programming languages and systems. This year, we are pleased to bring the conference to Paris , the first European site for POPL since Munich in 1987. In addition to the main three-day POPL'97 program on January 15-17, 1997 , five one-day workshops will be held. Preceding POPL'97 on Tuesday, January 14 , will be the First ACM SIGPLAN Workshop on Automated Analysis of Software (AAS'97) , the Second ACM SIGPLAN Workshop on Continuations (CW'97) , and the workshop on Logical and Operational Methods in the Analysis of Programs (LOMAPS) . Then, after POPL'97 on Saturday, January 18 , the Fourth International Workshop on the Foundations of Object-Oriented Languages (FOOL-4) and the First ACM SIGPLAN Work-shop on Domain-Specific Languages (DSL'97) will be held.
ACM Programming Contest (Mid Atlantic Region)
general information, officers, contest results, problem sets related to the MidAtlantic regionals of the ACM contest.
http://midatl.cslab.vt.edu/

Extractions: News Tue, Apr 13 International Results more Fri, Nov 21 Judges comments on 2003 problem set now available more Mon, Nov 10 Congratulations to all Mid-Atlantic Contestants more Mon, Sep 08 Test Run Announced more Sat, Aug 16 Signups for VT's Local Competition have begun more For more information about the contest, look at general information and official contest rules . Then find the site nearest to you and register your teams
Jorge Nocedal: Optimization Software
KNITRO, general Nonlinear programming Solver; LBFGS, Limited Memory Codes; PREQN, Preconditioning the Conjugate Gradient Method; and CG+, Conjugate Gradient Software.
http://www.ece.northwestern.edu/~rwaltz/software.html

Extractions: This software is provided without any expressed or implied warranty. In particular, there is no warranty of any kind concerning the fitness of this software for any particular purpose. KNITRO a package for solving unconstrained and constrained optimization problems. Commercial, academic and government licenses are available. Download a free student/evaluation edition of KNITRO here Two codes for large-scale optimization are part of this package: L-BFGS is a code for solving unconstrained problems. Author: J. Nocedal L-BFGS-B is capable of solving problems with simple bounds on the variables. Authors: C.Zhu, R. Byrd, and J. Nocedal
Parallel Programming With MPI Workshop
Parallel programming with MPI general Announcement. Many potential participantscannot set aside two full days out of their busy schedules for a workshop.
http://alliance.osc.edu/mpi/

Extractions: General Announcement Many potential participants cannot set aside two full days out of their busy schedules for a workshop. To respond to the scheduling needs of our audience, OSC and PACS are offering four weekly half day sessions. Each session is approximately four hours long and will be held on consecutive Wednesday afternoons from 1:00 to 5:00 p.m. eastern, beginning October 1, 2003 through October 22, 2003. This MPI workshop is sponsored by the Alliance Partners for Advanced Computational Services (PACS). Join us at OSC or over the Access Grid at one of the participating sites One of the basic methods of programming for parallel computing is the use of message passing libraries. These libraries manage transfer of data between instances of a parallel program running (usually) on multiple processors in a parallel computing architecture. MPI is intended as a standard implementation of the "message passing" model of parallel computing. This model is extremely general and useful. Essentially, any type of parallel computation can be cast in the message passing form. This model can be implemented on a wide variety of platforms and generally allows more control over data location and flow within a parallel applications. Topics covered include: Wednesday, October 1, 2003 (1:00p to 5:00p Eastern)
WFC Programming Concepts
Windows Foundation Classes for Java (WFC) provides a framework of Java packages that support components targeted for the Windows operating system and the Dynamic HTML object model. Learn more about how Visual J++ 6.0 can allow you to build tight applications using new features included in Visual J++ 6.0. (Microsoft)
http://msdn.microsoft.com/vjsharp/productinfo/visualj/visualj6/technical/article

Extractions: Advanced Search Visual J# Home Product Information How to Buy ... General Articles Microsoft Windows Foundation Classes for Java (WFC) provides a framework of Java packages that support components targeted for the Windows operating system and the Dynamic HTML object model. WFC is tightly integrated with the Microsoft Visual J++ development environment and provides a full set of Windows controls written in Java. Building a Java application for Windows is made much easier by this tight integration and the support of features such as IntelliSense, the Forms Designer, the Application Wizard, and the Object Browser. While these Visual J++ features put you well on your way to creating applications, you'll probably want to understand the structure and logic behind the packages and classes that make up WFC. The purpose of this section is to provide a conceptual framework for the WFC packages and classes and to explain some of the fundamental WFC models. Many of the packages exist as infrastructure for the component model and can be ignored by developers focusing on using the WFC controls. Other packages are most easily accessed from the Visual J++ Forms Designer. When you start exploring the WFC library, you'll want to know which packages and classes are important for your particular application. The following topics are covered in this section:
Paul Hsieh's Programming Page
In my programming experience I have spent a considerable amount of time considering Ihave encountered many ideas that have shaped my general approach to
http://www.azillionmonkeys.com/qed/programming.html

Extractions: by Paul Hsieh Anybody who learns a structured programming language and some data types can program nearly anything. There is nothing special about being able to write program that performs some deterministic, calculable task. What makes a program good, is what you do beyond this. This may include things such as performance optimization, size optimization, flexibility or portability. In my programming experience I have spent a considerable amount of time considering performance optimization. I have encountered many ideas that have shaped my general approach to speeding up my code. What is the best programming language to start with? This is a recurring thread in the USENET programming newsgroups. While I've never done a study in this, I can give you my observations from my own experience. Beginner programmer recommendations.
Intelligent Systems
Makes DreamMaker, general purpose computer language based on natural language; uses English vocabularies for computer instructions, English grammar and punctuation for programming syntax.
http://isdreamaker.com/

Extractions: The intelligent programming language is the next generation general-purpose computer programming language based on natural language and human intelligence. It uses English vocabularies for programming instructions and English grammars and punctuation for programming syntax. Features and Capabilities DreamMaker encapsulates computer programming functionality and capabilities into a powerful yet easy to use next generation programming language. DreamMaker can fulfill the programming functions of today's popular computer languages like C/C++, Visual Basic, and Java in many cases. Language Comparisons Listed in the following two tables are the comparisons of features and performance between DreamMaker and other popular programming languages. We tried to select the features and performance criteria for the comparisons that best indicate the capability, efficiency and productivity of the programming languages.
Programming Optimization: Techniques, Examples And Discussion
This general idea is probably what inspired Terje Mathisen (a well known programmingoptimization guru) to say All programming is an exercise in caching. .
http://www.azillionmonkeys.com/qed/optimize.html

Extractions: This is a page about the elusive subject of program performance optimization. Before you proceed towards such lofty goals, you should examine your reasons for doing so. Optimization is but one of many desirable goals in software engineering, and is often antagonistic to other important goals such as stability, maintainability, and portability. At its most cursory level (efficient implementation, clean non-redundant interfaces) optimization is beneficial and should always be applied. But at its most intrusive (inline assembly, pre-compiled/self-modified code, loop unrolling, bit-fielding, superscalar and vectorizing) it can be an unending source of time consuming implementation and bug hunting. Be cautious and wary of the cost of optimizing your code. You will probably notice a large slant towards Intel x86 based optimization techniques, which shouldn't surprise many, since that is where my background is strongest. On the other hand I have used various other architectures, run profilers and debuggers on a variety of non-x86 UNIX boxes; I have tried to be as general as possible where I can. However, many of the recommendations and techniques may simply not work for your processor or environment. In that event, I should emphasize that first hand knowledge is always better than following advice. I would also appreciate any
Clp(Q,R) ( 5-Oct-2000)
Implementation of general Constraint Logic programming scheme introduced by Jaffar, Michaylov 1987. As full as other CLP(R)s solves linear equations over rational or real valued variables, and covers lazy treatment of nonlinear equations.
http://www.ai.univie.ac.at/clpqr/

Extractions: The implementation is at least as complete as other existing clp(R) implementations: It solves linear equations over rational or real valued variables, covers the lazy treatment of nonlinear equations, features a decision algorithm for linear inequalities that detects implied equations, removes redundancies, performs projections (quantifier elimination), allows for linear dis-equations, and provides for linear optimization. The software has been developed at Earlier versions of the solver were distributed in the form of a clone of SICStus Prolog that provided extensible unification via attributed variables. To date, attributed variables and solvers on top of it have been integrated into the general distribution of following Prolog systems: SICStus Prolog 3 ECLiPSe Prolog at ECRC ECLiPSe Prolog at IC-PARC CIAO Prolog ... Yap Prolog Please follow these links for ordering information and licensing issues. When referring to this implementation of clp(Q,R) in publications, you should use the following reference to the
The Genesis Of MUMPS And MUG
The story of the creation of the MUMPS programming language at The Massachusetts general Hospital, and its development into a procedural, interpreted generalpurpose programming language oriented towards database applications. By Glen Steinbach.
http://207.192.157.194/MDC/genesis.htm

Extractions: by Glen Steinbach In the beginning was the sky, and woods, and COBOL. And Octo Barnett looked out over the lab at Massachusetts General Hospital and said, "I will have a computer system for this lab." And contracts were let and work began. But this was the time of Assembly Language and early COBOL, and the Lab System needed better tools. Three young software shepherds named Pappalardo, Greenes and Marble heard a calling and followed it to the basement of the Hospital. There, in the corner of the animal lab, stood a PDP-7, and the creation of a new software system began. The three shepherds obeyed new and unwritten commandments: Thou shalt not declare variable types or file sizes. Thou shalt not KILL, except for globals and variables. Thou shalt not covet they neighbor's UCI.
C Tutorial
It is considered good programming style to identify and document your work The generalsyntax is printf( format , variables ); where format specifies the
http://einstein.drexel.edu/courses/Comp_Phys/General/C_basics/c_tutorial.html

Extractions: Table of Contents: This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. The best way to learn a new ``human'' language is to speak it right from the outset, listening and repeating, leaving the intricacies of the grammar for later. The same applies to computer languagesto learn C, we must start writing C programs as quickly as possible. An excellent textbook on C by two well-known and widely respected authors is: The C Programming Language ANSI C Prentice Hall, 1988 Let's be polite and start by saluting the world! Type the following program into your favorite editor Save the code in the file hello.c , then compile it by typing: gcc hello.c This creates an executable file a.out
Escher
Declarative, generalpurpose language, merges best features of functional and logic languages. Has types and modules, higher-order and meta-programming facilities, declarative input/output. Set of system modules provides many operations on standard data types integers, lists, characters, strings, sets, programs.
http://www.cs.bris.ac.uk/~jwl/escher.html

Extractions: Bristol CS Index Research Escher is a declarative, general-purpose programming language that integrates the best features of both functional and logic programming languages. It has types and modules, higher-order and meta-programming facilities, concurrency, and declarative input/output. Escher also has a collection of system modules, providing numerous operations on standard data types such as integers, lists, characters, strings, sets, and programs. The main design aim is to combine in a practical and comprehensive way the best ideas of existing functional and logic languages, such as Haskell and So far, the design of the language has been completed and work is well advanced on the design and implementation of a suitable abstract machine for the language in close collaboration with the BRISK Project for which a similar abstract machine is needed. Current work also includes the design and implementation of suitable meta-programming facilities. The main intended applications of Escher in the near future are to machine learning. These applications are being developed in the context of higher-order inductive declarative programming in the machine learning project. Currently, a generalised decision-tree learning algorithm is being developed and applications of this to suitable industrial and commercial problems are planned.
ECOOP'96: General Home Page
The 10th European Conference on ObjectOriented programming was held in Linz Generalinformation on ECOOP `96 and questions about the conference and its
http://www.ifs.uni-linz.ac.at/ecoop96/
History-making Components
Explores some of the key events of objectoriented programming and components in the last 50 years in the greater context of general computing history.
http://www-106.ibm.com/developerworks/webservices/library/co-tmline/

Extractions: var title = "History-making components"; var forumURL = ""; var contentAreaList = "java, webservices"; var emailAbstract = "This timeline explores some of the key events of object-oriented programming and components in the last 50 years in the greater context of general computing history."; var demoURL = ""; Search for: within All of dW eServer Lotus Rational Tivoli WebSphere Autonomic computing Grid computing Java technology Linux Open source Web arch. Web services Wireless XML dW forums dW Subscription alphaWorks All of IBM Search help IBM home My account 1 April 2001 This timeline explores some of the key events of object-oriented programming and components in the last 50 years in the greater context of general computing history. This timeline explores some of the key events of components and object-oriented programming in the last 50 years. We could have gone back further to John von Neumann's 1946 proposals that changed computer architecture forever, or perhaps further back to ENIAC, Babbage or even Pascal. However, we decided to begin in 1951 since the birth of the widely publicized UNIVAC seems to spark the commercial engine that drives the modern pursuit of object-oriented programming and development. This commercial revolution of computers, helped along the way a decade later by IBM's 1400 series in 1961, built the momentum for developing programming languages that could encapsulate object-oriented concepts. Besides, starting this timeline in 1951 makes for a nice round number of years for us to cover in this edition. Future versions will probably cover much more!
JBurg
Javabased BURG (code emitter generator) which can also be used as a general purpose dynamic programming engine. Open source, Common Public License
http://jburg.sourceforge.net/

Extractions: A bottom-up rewrite machine is a compiler construction tool that is often used in the compiler's back end to convert a tree-structured representation of a program into machine code or, in Java's case, bytecode. JBurg can also be used as a general-purpose dynamic programming engine. JBurg is descended from iburg -class BURGs, described in Fraser, Hanson, and Proebsting's paper, "Engineering a Simple, Efficient Code Generator Generator." JBurg brings similar O(N) minimum-cost tree rewriting capabilities to Java, and also allows the programmer to specify transitions between non-terminal states, that are significantly more powerful than iburg's transitive closures: JBurg transformation rules allow the transformation to inject additional program logic, which makes a JBurg specification more like a grammar than like a list of pattern-matching rules. JBurg's documentation is designed to be viewed using the frames feature. If you see this message, you are using a non-frame-capable web client. Please use the Non-frame based navigation page to access JBurg's documentation.
JAVASCRIPT: JavaScript Discussion List Information
Dedicated to the general discussion of topics and issues related to JavaScript and JScript programming. Open to all beginners and professionals.
http://mountaindragon.com/javascript/

Extractions: Dedicated to the general discussion of topics and issues related to JavaScript and JScript programming. Open to all: from newbie beginners to seasoned professionals. There are only two rules: (1) Discuss only JavaScript related topics and (2) be professional: specifically, be polite and respectful. Breaking these rules can result in your being removed from the list.
ITechnologies: The Future Is Unlimited
A team, working on an assortment of tools and articles in the area of games and general programming.
http://itech.dyndns.org/

Extractions: Robert on Monday 12 th of April at 02:15:48 I`ve created a game and put it on the site. I call it `line at a time`, and its highly experimental (and hopefully highly fun too). Basically anyone who is on the site can add a line to the current `story` (created by the users). It`s like the game where you get a bit of paper, write some stuff on it and fold it so others can`t see what you`ve written. So have a go and write some funny, witty or downright stupid stuff.

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

81-100 of 194 Back | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | Next 20