Browse

ftp://ftp.nada.kth.se (84)

	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-50.ps.Z, 19920314 The X-Ray Factory\| some experiments with three-dimensional, iconic control displays 1 Kai-Mikael Jaa-Aro Interaction and Presentation Laboratory Department of Numerical analysis and Computing Science Royal Institute of Technology S-100 44 Stockholm kai@nada.kth.se
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-52.ps.Z, 19920314 Tankathon\|A Process Plant Simulation Kai-Mikael Jaa-Aro kai@nada.kth.se Interaction and Presentation Laboratory Department of Numerical Analysis and Computing Science Royal Institute of Technology S{100 44 Stockholm SWEDEN MultiG-4 IPLab-52 TRITA-NA-P9207
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-45.ps.Z, 19920314 The Collaborative Desktop Peter Lidbaum d87-pli@nada.kth.se Datateknik, KTH Magnus Tobiasson d87-mto@nada.kth.se Datateknik, KTH Referat Denna rapport behandlar v art arbete med , The Collaborative Desktop. Detta har g att ut p a att skapa en mangd verktyg for datorstott samarbete och integrera dessa
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-55.ps.Z, 19920521 1 Tekniska H gskolan i Stockholm Stockholms Universitet NUMERISK ANALYS OCH DATALOGI KVANTITATIVA L SBARHETSANALYSER SOM METOD F R DATORST DD TEXTGRANSKNING av Magnus Cedergren TRITA-NA-P9217 IPLab-55 Rapport fr n IPLab-projektet, Interaktions- och Presentationslaboratoriet Spr kliga datorst d vid
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/stava.ps, 19930909 En metod f r svensk r ttstavning baserad p bloomolter Joachim Hollman Viggo Kann1 Teoretisk datalogi Institutionen f r numerisk analys och datalogi (NADA) KTH S>=100 44 Stockholm TRITA>=NA>=P9213 IPLAB 54 9 september 1993 1Datorpost: joachim@nada.kth.se, viggo@nada.kth.se Sammanfattning Vi beskriver en
	ftp://ftp.nada.kth.se/pub/documents/Theory/Johan-Haastad/td3.ps.Z, 19930910 Top-Down Lower Bounds for Depth 3 Circuits J. H astad S. Jukna P. Pudl ak Department of Computer Science FB Informatik FB Informatik Royal Institute of Technology Universitat Dortmund Universitat Dortmund Stockholm, Sweden on leave from on leave from Institute of Mathematics Mathematical Institute
	ftp://ftp.nada.kth.se/pub/documents/Theory/Johan-Haastad/genshrink.ps.Z, 19930910 The shrinkage exponent is 2 Johan H astad Royal Institute of Technology Stockholm, Sweden email: johanh@nada.kth.se
	ftp://ftp.nada.kth.se/pub/documents/Theory/Johan-Haastad/weights.ps.Z, 19930910 On the size of weights for threshold gates Johan H astad Royal Institute of Technology 100 44 Stockholm, SWEDEN
	ftp://ftp.nada.kth.se/pub/documents/Theory/Johan-Haastad/r1shrink.ps.Z, 19930910 On the Shrinkage Exponent for Read-Once Formulae Johan H astad Royal Institute of Technology 100 44 Stockholm, SWEDEN Alexander Razborov Steklov Mathematical Institute Vavilova 42, 117966, GSP{1, Moscow, RUSSIA Andrew Yaoy Princeton University Princeton, NJ 08544, USA September 10, 1993
	ftp://ftp.nada.kth.se/pub/documents/Theory/Johan-Haastad/roh.ps.Z, 19930910 The Random Oracle Hypothesis is False Richard Chang1;2 Benny Chor3;4 Oded Goldreich3;5 Juris Hartmanis1 Johan H astad6 Desh Ranjan1;7 Pankaj Rohatgi1 June 23, 1992
	ftp://ftp.nada.kth.se/pub/documents/Theory/Johan-Haastad/smallckt.ps.Z, 19930910 OPTIMAL DEPTH, VERY SMALL SIZE CIRCUITS FOR SYMMETRIC FUNCTIONS IN AC0 Johan Hastad, Royal Institute of Technology 10044 Stockholm, Sweden and Ingo Wegener , Norbert Wurm and Sang-Zin Yi FB Informatik, LS II, Univ. Dortmund, Postfach 500 500, 4600 Dortmund 50, Fed. Rep. of Germany
	ftp://ftp.nada.kth.se/pub/documents/Theory/Stefan-Arnborg/gdnotes.ps, 19930916 Introduction to Decomposable Structures. Stefan Arnborg Lecture Notes, July 13, 1992 Contents 1 Decomposable combinatorial objects 3 2 Structures, Logic and Algebra 5 2.1 Signatures and structures : : : : : : : : : : : : : : : : : 5 2.2 First order logic and satisfaction : : : : : : : : : : : : : : 7
	ftp://ftp.nada.kth.se/pub/documents/Theory/Stefan-Arnborg/ai2d1963.ps.Z, 19930916 Concise Introduction to Artificial Intelligence. Stefan Arnborg Lecture Notes, DB338, August 11, 1993 Contents 1 What is AI 3 1.1 Typical Applications. : : : : : : : : : : : : : : : : : : : 5 1.2 Goals and prerequisites : : : : : : : : : : : : : : : : : 5 1.3 Acknowledgements : : : : : : : : : : : : : :
	ftp://ftp.nada.kth.se/pub/documents/Theory/Stefan-Arnborg/moddec.ps.Z, 19930916 Decomposability helps for deciding logics of knowledge and belief Stefan Arnborg The Royal Institute of Technology
	ftp://ftp.nada.kth.se/pub/documents/Theory/Stefan-Arnborg/treeautai.ps.Z, 19930916 Graph decompositions and tree automata in reasoning with uncertainty Stefan Arnborg The Royal Institute of Technology December 21, 1992
	ftp://ftp.nada.kth.se/pub/documents/IPLab/CoDesk/codesk_sem_mice.ps, 19931118 The Collaboraitve Desktop 22 oct 1993,IPLab Konrad T ollmar,IPLab/KTH 1993 Sida 1 av 22 The Collaborative Desktop The Collaboraitve Desktop 22 oct 1993,IPLab Konrad T ollmar,IPLab/KTH 1993 Sida 2 av 22 The Collaborative Desktop Sharing your local desktop by sharing your working material and tools. The
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-63.ps.Z, 19931122 Document Archive Controller Donald Broady broady@nada.kth.se Hasse Haitto haitto@nada.kth.se Peter Lidbaum pli@nada.kth.se Magnus Tobiasson tobima@nada.kth.se IPLab/NADA Royal Institute of Technology S-100 44 STOCKHOLM SWEDEN IPLab Report 63, TRITA-NA-P9306 March 19,1993 Keywords: sgml, hypertext,
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-65.ps.Z, 19940111 Kerstin Frenckner, Nada, KTH, 100 44 Stockholm, telephone +46 8 790 8164, electronic mail kfrenck@nada.kth.se Kjell Krona, Architecture, KTH, 100 44 Stockholm, telephone +46 8 790 8590, electronic mail kjell@arch,kth.se THE CONVERSION OF A LINEAR TEXT TO HYPERTEXT Kerstin Frenckner Kjell Krona
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-66.ps.Z, 19940111 94-01-11 Numerical Analysis and Computing Science IPLab Kerstin Frenckner Postal adress Visiting adress Telephone Computer mail Nada Lindstedtsv. 5 nat. 08-790 8164 kfrenck@nada.kth.se 100 44 Stockholm int. 0046-8-790 8164 Sweden The problem of getting a global perspective when reading continuous texts
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-46.ps.Z, 19940119 Constraint hierarchies as triangular systems Jiarong Li Department of Numerical Analysis and Computing Science Royal Institute of Technoloy TRITA-NA-P9130 November, 1991 1
	ftp://ftp.nada.kth.se/pub/documents/Theory/Stefan-Arnborg/tracts.ps.Z, 19940213 Maintenance of Tractable Propositional Theories. Stefan Arnborgy February 9, 1994
	ftp://ftp.nada.kth.se/pub/documents/Theory/Stefan-Arnborg/bdd.ps.Z, 19940218 Automata and BDDs { new tools in verification and optimization Stefan Arnborg The Royal Institute of Technology February 13, 1994
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-68.ps.Z, 19940225 1 Bj rn Pehrson, Yngve Sundblad 1993-11-16 MultiG Slutrapport 1. Sammanfattning MultiG-programmet sprang fram h sten 1989 ur en fler rig planeringsprocess med m let att st rka den akademiska infrastrukturen inom omr det telekommunikationssystem. Denna planeringsprocess, som haft ett starkt industrist d,
	ftp://ftp.nada.kth.se/pub/documents/IPLab/Arbetspapper/Arbetspapper-36.ps.Z, 19940228 1 februari 1994 Numerisk analys och datalogi Kerstin Frenckner Adress Nada KTH 100 44 Stockholm Bes ksadress Lindstedstv. 5, plan 3 Stockholm Telefon Nat 08-790 8164 Int +468 790 8164 Telefax 08 - 790 0930 Datorpost kfrenck@nada.kth.se SHARED EDITORS Reflexioner kring n gra artiklar jag l st f r Jacob
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-67.ps.Z, 19940302 1994-01-11 Rickard Domeij Tekniska h gskolan Inst. f r numerisk analys och datalogi, IPLab 100 44 stockholm e-post: domeij@kth.nada.se SPR KGRANSKNING M NSTERMATCHNING MED REGULJ RA UTTRYCK Sammanfattning Rapporten inneh ller en redog relse f r hur man kan hitta en del spr kliga avvikelser i svenska
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-59a.ps.Z, 19940302 Translating keystroke records into a general notation for the writing process Kerstin Severinson Eklundh Py Kollberg IPLab Department of Numerical Analysis and Computing Science Royal Institute of Technology, Stockholm
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-59b.ps.Z, 19940302 Appendix My way to work I lock11\|1 the door to my room and go down 9494\|9595
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-58.ps.Z, 19940304 1 SPR KLIGA DATORST D F R SKRIVANDE: F RUTS TTNINGAR OCH BEHOV Magnus Cedergren och Kerstin Severinson Eklundh Tekniska H gskolan i Stockholm Numerisk Analys och Datalogi Rapport IPLab-58 2 F rord Denna rapport utg r resultatet av en f rstudie i projektet "Spr kliga datorst d vid skrivande", med st d
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-61.ps.Z, 19940304 1 Skrivprocessen och datorn Att skriva r en stor och viktig del av arbetet f r m nga m nniskor. Detta g ller inte bara journalister, "f rfattare" och andra professionella skribenter. tskilliga verksamheter best r till en v sentlig del av att i textform beskriva, rapportera eller sammanfatta n got arbete
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-57d.ps.Z, 19940331 3 Paperprogrammet 25 3 Paperprogrammet F r att kunna unders ka betydelsen av pappersmetaforen i ett skrivprogram skrevs, inom ramen f r ett tidigare examensarbete utf rt vid IPLab/NADA, ett program i Smalltalk (Englund ). Programmet kom att heta Paper och kallas 'det gamla Paperprogrammet' i
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-57a.ps.Z, 19940331 F rord Denna rapport behandlar ett examensarbete utf rt vid Institutionen f r numerisk analys och datalogi (NADA), Tekniska h gskolan i Stockholm. Examensarbetet ing r som ett 12- po ngsmoment i matematikerlinjens dataloggren vid Stockholms universitet. Handledare f r arbetet har varit Kerstin
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-57b.ps.Z, 19940331 1 Bakgrund 1 1 Bakgrund Vid Interaktion och presentationslaboratoriet ( IPLab), Institutionen f r numerisk analys och datalogi (NADA) vid Tekniska H gskolan i Stockholm p g r sedan flera r tillbaka forskning om datorst tt f rfattande. Inom ramen f r denna forskning studerar man hur datorer anv nds av
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-57e.ps.Z, 19940331 4 Anv ndarstudie 43 4 Utv rdering av Paper en anv ndarstudie F r att utv rdera det nya Paperprogrammet gjordes en mindre anv ndarstudie d r fyra f rs kspersoner fick skriva tv olika texter i Paper. H r redog rs f r experimentets m ls ttningar och utf rande, samt f r resultaten som gav upphov till en
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-57c.ps.Z, 19940331 2 Pappersmodellen 5 2 Pappersmodellen I detta avsnitt diskuteras olika fr gor som ber r pappersmodellen, b de modelldesign i allm nhet och specifika problem f r utformningen av pappersmodellen. Varken problemst llningarna eller l sningarna som presenteras h r r fullst ndiga eller slutgiltiga. En del av
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-57f.ps.Z, 19940331 Anv ndarhandledning 57 Bilaga 1 Anv ndarhandledning f r Paper 1 Att starta och k ra Paper Det finns tv s tt att starta och k ra Paper p . Det f rsta r att v lja menyalternativet start Paper i menyn Special i Launcher som finns l ngst upp till v nster p sk rmen. P det viset startar man en ny "omg ng" av
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-69.ps.Z, 19940801 Virtual Reality state of the art 1 Kai-Mikael J -Aro kai@nada.kth.se Interaction and Presentation Laboratory Department of Numerical analysis and Computing Science Royal Institute of Technology S-100 44 Stockholm
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-37.ps.Z, 19940804 1 Datorst d f r kunskapsarbete STU/ITYP projekt 90-02737P SGML-relaterade verktyg f r intermedi ra former och dokumenthantering 2 F rord Denna rapport r av teknisk natur, men ber r problem av intresse f r m nga som arbetar med komplicerade dokument. D rf r kan n gra f rklarande ord vara p sin plats.
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/minulr.ps, 19940818 On the Approximability of Removing the Smallest Number of Relations from Linear Systems to Achieve Feasibility Edoardo Amaldi Department of Mathematics Swiss Federal Institute of Technology CH-1015 Lausanne amaldi@dma.epfl.ch Viggo Kann Department of Numerical Analysis and Computing Science Royal
	ftp://ftp.nada.kth.se/pub/documents/Theory/Stefan-Arnborg/grasub.ps.Z, 19940915 A general purpose MSOL model checker and optimizer based on Boolean function representations Stefan Arnborg The Royal Institute of Technology September 15, 1994 1 Introduction A large recent research topic is decomposability of graphs and its use in finding efficient algorithms for graph problems. This
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/detectspell.ps, 19941024 Detection of spelling errors in Swedish not using a word list en clair Rickard Domeij Joachim Hollman Viggo Kann Numerical Analysis and Computing Science Royal Institute of Technology S{100 44 STOCKHOLM SWEDEN
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/minpb.ps, 19941024 Nordic Journal of Computing POLYNOMIALLY BOUNDED MINIMIZATION PROBLEMS THAT ARE HARD TO APPROXIMATE Viggo Kann Department of Numerical Analysis and Computing Science Royal Institute of Technology S-100 44 Stockholm, Sweden viggo@nada.kth.se
	ftp://ftp.nada.kth.se/pub/documents/IPLab/Arbetspapper/Arbetspapper-38.ps.Z, 19941108 Minnesanteckningar fr n tv konferenser om Virtual Reality Kai-Mikael J -Aro kai@nada.kth.se Interaktions- och presentationslaboratoriet Institutionen f r numeriska analys och datalogi Kungliga Tekniska H gskolan 100 44 Stockholm 8 november 1994 Kapitel 1 Virtual Reality Oslo '94 Networks and
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/npoapx.ps, 19941215 Extended abstract submitted to 27th ACM Symposium on Theory of Computing Natural Complete and Intermediate Problems in Approximation Classes (with some detours in the query complexity land) P. Crescenzi1, V. Kann2 and L. Trevisan1 1 Dipartimento di Scienze dell'Informazione, Universit a degli Studi di
	ftp://ftp.nada.kth.se/pub/documents/IPLab/Arbetspapper/Arbetspapper-39.ps.Z, 19941219 Reserapport fr n International Conference on Technical Informatics i Timi oara. Kai-Mikael J -Aro kai@nada.kth.se Interaktions- och Presentationslaboratoriet Institutionen f r Numerisk Analys och Datalogi Kungliga Tekniska H gskolan 19 december 1994 1 Att resa p Balkan 1.1 Kuala Lumpur Finns det
	ftp://ftp.nada.kth.se/pub/documents/IPLab/Arbetspapper/Arbetspapper-40.ps.Z, 19941222 CSCW 94 Reserapport, senast uppdaterad 94-12-22 Inledning Den 22 - 26 oktober deltog vi i CSCW 94 (Conference on Computer Supported Cooperative Work) i Chapel Hill, NC, USA. Nedan f ljer en sammanfattning av de lektioner (tutorials) och uppsatssessioner (papersessions) som vi tyckte var intressanta. F r
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/npopb.ps, 19950102 Strong lower bounds on the approximability of some NPO PB-complete maximization problems Viggo Kann Department of Numerical Analysis and Computing Science Royal Institute of Technology, S-100 44 Stockholm viggo@nada.kth.se Fax: +46-8 790 09 30 January 2, 1995
	ftp://ftp.nada.kth.se/pub/documents/IPLab/Arbetspapper/Arbetspapper.ps, 19950103 VK Department of Numerical Analysis and Computing Science Interaction and Presentation Laboratory Working papers Kerstin Severinson Eklundh. Studier av skrivande som en kognitiv process. Kerstin Severinson Eklundh. Metoder for att observera skrivande. Hans Smedshammar, Kerstin Frenckner,
	ftp://ftp.nada.kth.se/pub/documents/Theory/Mats-Naslund/hh-ec95.ps.Z, 19950221 Universal Hash Functions & Hard Core Bits Mats Naslund Royal Institute of Technology, Dept. of Numerical Analysis and Computing Science, S-100 44 Stockholm, Sweden email: matsn@nada.kth.se
	ftp://ftp.nada.kth.se/pub/documents/IPLab/Arbetspapper/Arbetspapper-43.ps.Z, 19950301 A new input model for DIVE Kai-Mikael J -Aro & Stephane Royer, NADA, KTH Physical level Corresponds to the physical input devices (DataGlove, 6D Mouse, ) which continuously transmit data on movement, button presses, gestures, etc. Driver level For each physical device there is an associated device
	ftp://ftp.nada.kth.se/pub/documents/IPLab/Arbetspapper/Arbetspapper-42.ps.Z, 19950301 3D Input Device Usability Evaluation in a Virtual Reality Environment Kai-Mikael J -Aro, Martin Prime and Stephane Royer Introduction This experiment is designed to evaluate the usability of different input devices in a Virtual Environment. The evaluation involves both speed and accuracy to achive a set
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-90.ps.Z, 19950407 1 Tekniska H gskolan i Stockholm Stockholms Universitet NUMERISK ANALYS OCH DATALOGI "TUNGA" ANV NDARE AV ELEKTRONISK POST: EN ENK TUNDERS KNING av Ann Lantz TRITA-NA-P IPLab-90 Rapport fr n IPLab, Interaktions- och Presentationslaboratoriet 2 Summering Syftet med den beskrivna studien var att unders ka
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-85.ps.Z, 19950418 Tollmar & Sundblad CoDesk 18 april 1995 1 11.24 The Design and Building of the Graphic User Interface for The Collaborative Desktop Konrad Tollmar and Yngve Sundblad IPLab (Interaction and Presentation Laboratory) NADA, KTH, S-100 44 Stockholm, Sweden Email: konrad / yngve @nada.kth.se
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-86.ps.Z, 19950420 1994 Olle B lter 1 CoMail-en anv ndarv nlig datorposthanterare CoMail-a user friendly mail handler Olle B lter TRITA-NA-P9502 IPLab-86 CoMail 95-04-20 2 1994 Olle B lter 1 Sammanfattning Denna rapport beskriver utvecklingen av CoMail, en prototyp till en datorposthanterare framtagen vid Interaktions-
	ftp://ftp.nada.kth.se/pub/documents/Theory/Stefan-Arnborg/mfc95.ps, 19950505 Decomposable structures, Boolean function representations, and optimization. Stefan Arnborg Kungliga Tekniska Hogskolan NADA, S-100 44 Stockholm, Sverige stefan@nada.kth.se
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/MFCS95.ps, 19950508 Strong Lower Bounds on the Approximability of some NPO PB-Complete Maximization Problems Viggo Kann Department of Numerical Analysis and Computing Science, Royal Institute of Technology, S-100 44 Stockholm, Sweden
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/maxkcut.ps, 19950608 On the Hardness of Approximating Max k-Cut and its Dual Viggo Kann Sanjeev Khannay Jens Lagergrenz Alessandro Panconesix
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-88.ps.Z, 19950609 PROPOSED STRUCTURE FOR AN ACTIVE FILE SYSTEM FOR UNIX Kai-Mikael J -ARO and Assar WESTERLUND Interaction and Presentation Laboratory, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, S>=100 44 Stockholm, SWEDEN
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-83.ps.Z, 19950609 Part 2 The Shared Object Service and Prototypes October 1994 271 SOS and SIS. In multi-user systems we must be able to handle distributed shared information. This implies the need for a distributed infrastructure; in our case, we have developed a distribution package MultiGossip. MultiGossip uses the
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-84.ps.Z, 19950609 October 1994 337 Chapter 16 A Reference Framework for the COMIC Shared Object Service Ludwin Fuchs Leandro Navarro Gerard Rodriguez GMD UPC Jonathan Trevor Konrad Tollmar Lancaster KTH 16.1 Introduction The tendency of modern companies to organise almost every aspect of operation by a continuous flow
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-82.ps.Z, 19950609 COMIC Computable Models and Prototypes of Interaction 250 COMIC Deliverable D4.2 for graphical display of history information and to include services for event interpretation. To achieve support for uncoupled awareness, an event notification service has to be integrated. Last but not least, it would be
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-95.ps.Z, 19950919
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-93b.ps.Z, 19951005 TextTextC entred text( a)(b)(c) Figure 1.1. A boxed text. Chapter I Introduction 1.1. Background In many interactive computer applications, it is often desirable to support the specification and manipulation of relationships between objects. Imagine that we have drawn a rectangle, edited some text, and
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-93a.ps.Z, 19951005 Object-Oriented Constraint Programming for Interactive Applications Jiarong Li Department of Numerical Analysis and Computing Science Royal Institute of Technology 100 44 Stockholm, Sweden Email: li@nada.kth.se Dissertation, September 1995 ii Akademisk avhandling f r teknisk doktorsexamen vid Kungl.
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-93d.ps.Z, 19951005 Chapter III Constraint specification and satisfaction mechanisms In the previous chapter, the design of the three applications is based on an explicit treatment of logic relations between objects. In particular, a special class of applications is discussed, namely, applications that must take care of
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-93e.ps.Z, 19951005 Chapter IVA constraint programming extensionto imperative languages The concepts and mechanisms introduced in the previous chapter can be implemented, with or without modification, in existing object-oriented languages, of which two types of languages are most common: languages based on the imperative
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-93i.ps.Z, 19951005 Appendix Main classes and operations in COPE Cell A cell contains a value and represents a variable of basic datatype. class: Cell superclass: none instance methods: getValue The method returns the value that is bound to the cell. Implemented by subclasses putValue: aValue The method binds a new value
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-93f.ps.Z, 19951005 Chapter V An implementation in Smalltalk Since most constraint programming languages are semantically and sometimes also syntactically different from object-oriented languages, they are often implemented as new languages with own compilers or interpreters. These languages are usually not designed to be
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-93j.ps.Z, 19951005 References Vladimir Alexiev. Mutable Object State for Object-Oriented Logic Programming: A Survey. Technical Report TR 93-15, Department of Computing Science, University of Alberta, 1993. Jean-Marc Andreoli and Remo Pareschi. Linear Objects: Logical Processes with Built-in Inheritance. New
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-93c.ps.Z, 19951005 Chapter II Some application examples Intuitively, an object-oriented constraint system can be seen as a hypergraph where nodes are objects and arcs are constraints. Such a system is different from a conventional object-oriented system in that the objects communicate with each other not only through
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-93h.ps.Z, 19951005 Chapter VII Conclusions and discussions Many object-oriented systems, especially those that respond to external events, can be modelled as consistency maintenance problems. The external events normally do not only cause changes in some single objects but in groups of objects in which objects are
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-93g.ps.Z, 19951005 Chapter VI Related work The numerous constraint programming languages or systems that have been proposed or implemented are designed for various applications. A large number of languages are designed for search problems with applications in artificial intelligence, operation research and theorem
	ftp://ftp.nada.kth.se/pub/documents/IPLab/etc/HeekiLicThesis.ps.Z, 19951016 Prediction and Postdiction under Uncertainty Hee-Cheol Kim Department of Computer and Information Science Linkping University S-581 83 Linkping, Sweden e-mail : heeki@ida.liu.se October 3, 1995
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/compendium.ps.Z, 19951031 This is the fourth version of the catalog of NP optimization problems Please send any comment or suggestion to one of the two authors A compendium of NP optimization problems P. Crescenzi1 and V. Kann2 1 Dipartimento di Scienze dell'Informazione, Universit a degli Studi di Roma La Sapienza", Via
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab.ps, 19951207 VK Department of Numerical Analysis and Computing Science Interaction and Presentation Laboratory Technical Reports Kerstin Severinson Eklundh, Hans Marmolin, Lars Kjelldahl, Staffan Romberger, and Yngve Sundblad. Interaktions- och presentationslaboratorium \| projektansokan. Technical Report
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/minulr-journal.ps, 19951213 On the approximability of some NP-hard minimization problems for linear systems Edoardo Amaldi School of Operations Research and Center for Applied Mathematics Cornell University Ithaca, NY 14853 amaldi@cs.cornell.edu Viggo Kann Department of Numerical Analysis and Computing Science Royal Institute of
	ftp://ftp.nada.kth.se/pub/documents/Theory/Henrik-Eriksson/stereo/erik.ps, 19960115 ALGEBRAIC COMBINATORICS
	ftp://ftp.nada.kth.se/pub/documents/Theory/Henrik-Eriksson/stereo/svante.ps, 19960115 Combinacordially, Svante
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-100.ps.Z, 19960223 Electronic mail from a user perspective: Problems and remedies Olle B lter Interaction and Presentation Laboratory (IPLab) NADA, KTH S-100 44 STOCKHOLM SWEDEN balter@nada.kth.se November 1995, 2nd printing Olle B lter: Electronic mail from a user perspective: Problems and remedies
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/maxfls.ps, 19960226 The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations Edoardo Amaldi Department of Mathematics Swiss Federal Institute of Technology CH-1015 Lausanne amaldi@dma.epfl.ch Viggo Kann Department of Numerical Analysis and Computing Science Royal Institute of Technology
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/ksplit.ps, 19960227 Approximability of Maximum Splitting of k-sets and some other Apx-complete Problems Viggo Kann Jens Lagergren Alessandro Panconesiy February 27, 1996 Key words: Approximation; Algorithms; Combinatorial problems; Computational complexity 1 Introduction Recent breakthroughs in the theory of approximation
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/maxksub.ps, 19960227 Approximate Max k-Cut with Subgraph Guarantee Viggo Kann1 , Jens Lagergren1 , Alessandro Panconesi2 1 Department of Numerical Analysis and Computing Science, Royal Institute of Technology, S-100 44 Stockholm, Sweden. Email: fjensl,viggog@nada.kth.se 2 Facbereich Informatik, Freie Universitat, Takustr.
	ftp://ftp.nada.kth.se/pub/documents/IPLab/TechReports/IPLab-94.ps.Z, 19960412 External Event Handling in DIVE, a Virtual Reality System Report number IPLab{94. J.H.D. Keukelaar johannes@nada.kth.se Interaction and Presentation Laboratory (IPLab) Department of Numerical Analysis and Computing Science (NADA) Royal Institute of Technology (KTH) 100 44 Stockholm, Sweden April 11,
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/KA02.ps, 19960510 Hardness of Approximation Viggo Kann Royal Institute of Technology, Stockholm Alessandro Panconesi Freie Universitat, Berlin Contents 1. Books and Surveys 1.1. Books 1.2. Surveys and lecture notes 2. Early Lower Bounds 3. Structural Results 4. The PCP Revolution The aim of computational complexity
	ftp://ftp.nada.kth.se/pub/documents/Theory/Viggo-Kann/structure.ps, 19960510 Submitted to SIAM Journal on Computing Structure in Approximation Classes P. Crescenzi1, V. Kann2, R. Silvestri1, and L. Trevisan1 1 Dipartimento di Scienze dell'Informazione Universit a degli Studi di Roma La Sapienza" Via Salaria 113, 00198 Rome, Italy E-mail: fpiluc,silver,trevisang@dsi.uniroma1.it