J.UCS The Journal of Universal Computer Science
Home > Computing and Information Technology > Computer science > Mathematical theory of computation > J.UCS The Journal of Universal Computer Science: Annual Print and CD-ROM Archive Edition Volume 1 • 1995
J.UCS The Journal of Universal Computer Science: Annual Print and CD-ROM Archive Edition Volume 1 • 1995

J.UCS The Journal of Universal Computer Science: Annual Print and CD-ROM Archive Edition Volume 1 • 1995

|
     0     
5
4
3
2
1




International Edition


About the Book

J.UCS is the electronic journal that covers all areas of computer science. The high quality of all accepted papers is ensured by a strict review process and an international editorial board of distinguished computer scientists. The online journal J.UCS is a prototype for modern electronic publishing. Distributed via the Internet, it supports all the search and navigation tools of advanced online systems. This first annual print and CD-ROM archive edition contains all articles published online in J.UCS during 1995. It allows easy and durable access without logging onto the Internet. Uniform citation of papers is guaranteed by identical page numbering and layout of all versions. J.UCS is based on HyperWave (formerly Hyper-G), a networked hypermedia information system compatible with other systems.

Table of Contents:
Issue 1.- Managing Editor’s Column.- High-Radix Division with Approximate Quotient-Digit Estimation.- On Implementing EREW Work-Optimally on Mesh of Trees.- Levels of Anonymity.- What is a Random String.- Grammars Based on the Shuffle Operation.- Issue 2.- Managing Editor’s Column.- A Scalable Architecture for Maintaining Referential Integrity in Distributed Information Systems.- A Variant of Team Cooperation in Grammar Systems.- On Four Classes of Lindenmayerian Power Series.- The Relationship Between Propagation Characteristics and Nonlinearity of Cryptographic Functions.- On Completeness of Pseudosimple Sets.- Issue 3.- Managing Editor’s Column.- Combining Concept Mapping and Adaptive Advice to Teach Reading Comprehension.- Modular Range Reduction: a New Algorithm for Fast and Accurate Computation of the Elementary Function.- Special Cases of Division.- Bringing ITS to the Marketplace: a Successful Experiment in Minimalist Design.- Halting Probability Amplitude of Quantum Computers.- Issue 4.- Managing Editor’s Column.- The Hyper-G Network Information System.- About WWW.- Electronic Publishing.- Evolution of Internet Gopher.- WAIS and Information Retrieval on the Internet.- Issue 5.- Managing Editor’s Column.- Conditional Tabled Eco-Grammar Systems Versus (E)TOL Systems.- HOME: an Environment for Hypermedia Objects.- Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model.- Software Patents and the Internet.- GAC — the Criterion for Global Avalanche Characteristics of Cryptographic Functions.- Issue 6.- Managing Editor’s Column.- A Translation of the Pi-Calculus into MONSTR.- Distributed Caching in Networked File Systems.- From Personal Computer to Personal Assistant.- Microworlds for Teaching Concepts of Object Oriented Programming.- Issue 7.-Managing Editor’s Column.- to the Special Issue “Real Numbers and Computers”.- A High Radix On-line Arithmetic for Credible and Accurate Computing.- Estimation of Round-off Errors on Several Computers Architectures.- Round-off Error Propagation in the Solution of the Heat Equation by Finite Differences.- LCF: A Lexicographic Binary Representation of the Rationals.- Exact Statistics and Continued Fractions.- On Directed Interval Arithmetic and Its Applications.- MSB-First Digit Serial Arithmetic.- Some Algorithms Providing Rigorous Bounds for the Eigenvalues of a Matrix.- On a Formally Correct Implementation of IEEE Computer Arithmetic.- Issue 8.- Managing Editor’s Column.- BROCA: A Computerized Environment for Mediating Scientific Reasoning Through Writing.- Differential Ziv-Lempel Text Compression.- Bounds for Heights of Integer Polynomial Factors.- A Robust Affine Matching Algorithm Using an Exponentially Decreasing Distance Function.- Issue 9.- Managing Editor’s Column.- An Efficient Distributed Algorithm for st-Numbering the Vertices of a Biconnected Graph.- A Decision Method for the Unambiguity of Sets Defined by Number Systems.- A Method for Proving Theorems in Differential Geometry and Mechanics.- Issue 10.- Managing Editor’s Column.- An Aperiodic Set of Wang Cubes.- Contained Hypermedia.- Authoring on the Fly.- Issue 11.- Managing Editor’s Column.- Digital Libraries as Learning and Teaching Support.- Testing a High-Speed Data Path. The Design of the RSA? Crypto Chip.- A Comparison of WWW and Hyper-G.- Issue 12.- Managing Editor’s Column.- A Novel Type of Skeleton for Polygons.- Constraint Agents for the Information Age.- Parikh Prime Words and GO-like Territories.- Exploiting Parallelism in Constraint Satisfaction for Qualitative Simulation.- AMarkov Process for Sequential Allocation.- Author Index.


Best Sellers


Product Details
  • ISBN-13: 9783642803529
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 832
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 3642803520
  • Publisher Date: 15 Dec 2011
  • Binding: Paperback
  • Language: English
  • Returnable: Y
  • Sub Title: Annual Print and CD-ROM Archive Edition Volume 1 • 1995


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
J.UCS The Journal of Universal Computer Science: Annual Print and CD-ROM Archive Edition Volume 1 • 1995
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
J.UCS The Journal of Universal Computer Science: Annual Print and CD-ROM Archive Edition Volume 1 • 1995
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

J.UCS The Journal of Universal Computer Science: Annual Print and CD-ROM Archive Edition Volume 1 • 1995

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!