CS 전공/책, 자료들2008. 3. 25. 17:40

Readings in Information Retrieval

Edited by

Karen Sparck Jones
University of Cambridge

Peter Willett
University of Sheffield

Chapter 1 Overall Introduction

Chapter 2 History

The Thesaurus Approach to Information Retrieval
T. Joyce and R. M. Needham
The Automatic Derivation of Information Retrieval Encodements from Machine-Readable Texts
H. P. Luhn
Indexing and Abstracting by Association. Part I
L. B. Doyle
On Relevance, Probabilistic Indexing and Information Retrieval
M. E. Maron and J. L. Kuhns
The Cranfield Tests on Index Language Devices
C. W. Cleverdon
Computer Evaluation of Indexing and Text Processing, JACM 15(1) 1968
Gerard Salton and M. E. Lesk

Chapter 3 Key Concepts

The Concept of "Aboutness" in Subject Indexing
W. J. Hutchins
The Testing of Index Language Devices
C. W. Cleverdon and J. Mills
Thesaurus
D. J. Foskett
Using Problem Structures for Driving Human-Computer Dialogues
P. J. Daniels, H. M. Brooks, and N. J. Belkin
Relevance: A Review of and a Framework for Thinking
T. Saracevic

Chapter 4 Evaluation

A Study of Information Seeking and Retreving. I. Background and Methodology
T. Saracevic, P. Kantor, A. Y. Chamis, and D. Trivison
On Selecting a Measure of Retrieval Effectiveness. Part I
W. S. Cooper
The Pragmatics of Information Retrieval Experimentation, Revisited
J. Tague-Sutcliffe
Presenting Results of Experimental Retrieval Comparisons
E. M. Keen
MEDLARS: Report on the Evaluation of Its Operating Efficiency
F. W. Lancaster
The TREC Conferences
D. K. Harman

Chapter 5 Models

Getting Beyond Boole
W. S. Cooper
A Non-Classical Logic for Information Retrieval
C. J. van Rijsbergen
A Vector Space Model for Automatic Indexing, CACM 18(11) 1975
Gerard Salton, A. Wong, and C. S. Yang
The Probability Ranking Principle in IR
S. E. Robertson
Inference Networks for Document Retrieval
H. Turtle and W. B. Croft
ASK for Information Retrieval. Part I. Background and Theory
N. J. Belkin, R. N. Oddy, and H. M. Brooks

Chapter 6 Techniques

An Algorithm for Suffix Stripping
M. F. Porter
Robust Text Processing in Automated Information Retrieval
T. Strzalkowski
Term-Weighting Approaches in Automatic Text Retrieval, Retrieval., Information Processing and Management 24(5) 1988
Gerard Salton and C. Buckley
Search Term Relevance Weighting Given Little Relevance Information
K. Sparck Jones
Using Probabilistic Models of Document Retrieval without Relevance Information
W. B. Croft and D. J. Harper
Some Simple Effective Approximations to the 2-Poisson Model for Probabilistic Weighted Retrieval
S. E. Robertson and S. Walker
Improving Retrieval Performance by Relevance Feedback, JASIS 41(4) 1990
Gerard Salton and C. Buckley
Using Interdocument Similarity Information in Document Retrieval Systems
A. Griffiths, H. C. Luckhurst, and P. Willett

Chapter 7 Systems

The SMART and SIRE Experimental Retrieval Systems
Gerard Salton and M. J. McGill
Architecture of an Expert System for Composite Document Analysis, representation, and Retrieval
E. A. Fox and R. K. France
User-Friendly Systems Instead of User-Friendly Front-Ends
D. K. Harman
The Okapi Online Catalogue Research Projects
S. Walker
TREC and TIPSTER Experiments with INQUERY
J. P. Callan, W. B. Croft, and J. S. Broglio
RUBRIC: A System for Rule-Based Information Retrieval
B. P. McCune, R. M. Tong, and J. Dean
TARGET and FREESTYLE: DIALOG and Mead Join the Relevance Ranks
C. Tenopir and P. Cahn

Chapter 8 Extensions

A Hypertext Environment for Interacting with Large Databases
M. Agosti, G. Gradenigo, and P. G. Marchetti
Automatic Analysis, theme Generation, and Summarization of Machine-Readable Texts
Gerard Salton, J. Allan, C. Buckley, and A. Singhal
Querying Across Languages: A Dictionary-Based Approach to Multilingual Information Retrieval
D. A. Hull and G. Grefenstette
Experiments in Spoken Document Retrieval
K. Sparck Jones, G. J. F. Jones, J. T. Foote, and S. J. Young
Video Parsing, Retrieval and Browsing: An Integrated and Content-Based Solution
H. J. Zhang, C. Y. low, S. W. Smoliar, and J. H. Wu
The Automatic Indexing System AIR/PHYS - From Research to Application
P. Biebricher, N. Fuhr, G. Lustig, M. Schwantner, and G. Knorz
A News Story Categorization System
P. J. Hayes, L. E. Knecht, and M. J. Cellio
Conceptual Information Extraction and Retrieval from Natural Language Input
L. F. Rau
A Production Rule System for Message Summarization
E. Marsh, H. Hamburger, and R. Grishman
The Application of Linguistic Processing to Automatic Abstract Generation
F. C. Johnson, C. D. Paice, W. J. Black, and A. P. Neal

Chapter 9 Envoi

Historical Note: Information Retrieval and the Future of an Illusion
D. R. Swanson
Posted by Bart
CS 전공/리뷰2008. 3. 25. 17:38
ASU의 Yi Chen 교수의 대학원 강의 syllabus.
Data on the Web이란 타이틀을 붙였지만, 거의 다가 XML 포맷을 이용한 데이터 처리에 관한 부분이다. 특이하게 강의 자료도 ppt로 올려놓았다. 대부분 copyright 문제로 pdf로 올리던가 아니면 restricted access로 해놓는 교수들이 많은데....
관심가는 부분이 많아서 직접 들어보고 싶다..
 

CSE 591: Data on the Web

Fall 2007
Instructor:   Yi Chen     ( yi at asu.edu )
Time:  
Monday & Wednesday 1:40PM - 2:55PM
Location:   BYAC 190
Office hours:   Monday 4:30-5:20 , Wednesday 12:30-1:30, or by appointment,  BY 562

TA: Yu Huang (yu.huang.1@asu.edu)

Office hours: TTh: 1-2pm, or by appointment, BY 417AA

 

Description & Objective   Format    Topics and Schedule    Project    Grading



Description & Objective


This course will discuss the recent advances in database research. Traditionally, a database is thought of as a relational database system (or an object-oriented database system). There are several assumptions in a traditional database. First, data conforms to a fixed schema. Second, data is locally stored, clean and consistent. Third, data can be queried using a structured query language (for example, SQL). As web data continues to grow at an explosive pace, we are facing more and more data that does not fit into a traditional database. For example, web data obtained from independent sources requires a flexible data representation format such as XML. Data obtained from integration or extracted from text documents may be error prone and inconsistent. A user may not be able to formulate a precise query using a structured query language. Furthermore, in publish subscribe systems and sensor networks, the assumption that data is locally stored has been discarded. As we relax these traditional database assumptions, new research challenges arise. In this course, we will explore in depth the research problems on semi-structured data management and its applications.

What You Can Get Out of the Course
The goals of this course are to gain a better understanding of the current research topics in databases, especially how to store, query, share, and interpret data across the Internet and World-Wide Web. You will also get opportunities to learn skills to survey, analyze and criticize research papers, obtain hands-on experience on database projects and participate research with other students.

Prerequisites :
Background on relational databases and programming ability in Java, C, or C# are required.  

 



Format

The course is organized around several research topics. For each topic, we read and discuss the selected papers in the current literature . There will be no required textbooks for this class though you can refer to the following book for additional reading.

  • Data on the Web . Morgan Kaufmann. S. Abiteboul and P. Buneman and D. Suciu


The course consists of  two lectures a week, class discussions, paper reading and reviews, and a project. Your responsibilities include:

  • Attend all the classes on time.
  • Participate actively in class discussions.
  • Select up to six papers from the reading list which are from at least three different areas. For each selected paper, write a one-page review and submit it before the paper is discussed in class. The top 5 scores on reviews will be counted in grades.
  • Do exercises.
  • Implement a research-oriented course project by group.
  • Think up wild and crazy ideas and share them with us.

Topics and Schedule

(The schedule is subject to change. Please check it frequently.)

Course Overview ( 8/20 )


XML Introduction   (1 week)

8/22, 8/27: XML data model, DOM and SAX interface as specified in  W3C .

References: (1) Buneman et al Keys for XML WWW10.
                     
(2) Arenas & Libkin A Normal Form for XML Documents PODS 02

Searching XML Data using Keywords  (2 weeks)
8/29 Cohen et al.
XSearch: A Semantic Search Engine for XML   VLDB 03
9/5    Li et al. Schema-Free XQuery VLDB 04
9/10  Liu and Chen,
Identifying Meaningful Return Information for XML Keyword Search . SIGMOD07
9/12 , 9/17  Guo et al. XRANK: ranked keyword search on XML documents Sigmod 03

         Reference: Brin and Page: The Anatomy of a Large-Scale Hypertextual Web Search Engine .
XML Introduction   (continued. 1 week)
9/19, 9/24, 9/26 XML query languages XPath and XQuery language as specified in  W3C

 

Indexing and Querying Stored XML Data  (2 weeks)

10/1   Kaushik et al Exploiting Local Similarity for Indexing Paths in Graph-Structured Data , ICDE 02

10/3   Shanmugasundaram et al Relational Databases for Querying XML Documents: Limitations and Opportunities .  VLDB 99.
10/8   Zhang et al On Supporting Containment Queries in Relational Database Management Systems SIGMOD 01
         Reference: Bruno et al Holistic Twig Joins: Optimal XML Pattern Matching SIGMOD 02

10/10 Chen et al BLAS : An Efficient XPath Processing System SIGMOD 04

10/15, 10/17, 10/22 Project Midterm Presentation (1.5 week)

Every group will make a 20-minute presentation.

 

Querying XML Streams (1 week)
10/24  Altinel and Franklin
Efficient Filtering of XML Documents for Selective Dissemination of Information , VLDB 00
10/29  Chen et al
An Efficient XPath Query Processor for XML Streams ICDE 06
          Reference: Carabus et al. Extending XQuery with Window Functions . VLDB 07

Information Extraction, Integration and Probabilistic Databases (1.5 weeks)
10/31  Gupta & Sarawagi. Creating Probabilistic Databases from Information Extraction Models . VLDB 06
          Reference: Chu et al. Relational Approach to Incrementally Extracting and Querying Structure in Unstructured Data . VLDB 07.

    Reference: Bird et al. Designing and Evaluating an XPath Dialect for Linguistic Queries .”  ICDE 06.

11/5    Dalvi & Suciu Efficient Query Evaluation on Probabilistic Databases VLDB 04
11/7    Fuxman et al. ConQuer: Efficient Management of Inconsistent Databases. SIGMOD 05

Workflow Management and Data Provenance (1 week)
11/14 Buneman et al Provenance Management in Curated Databases SIGMOD 06
11/19 Beeri et al. Querying Business Processes . VLDB 2006
         Reference: Shankar et al Integrating databases and workflow systems , SIGMOD Record 05

11/21, 11/26, 11/28 VLDB 07 Paper Potpourri (1 week)

Every student will make a 5 minute presentation of one of VLDB 07 papers. Please choose and sign up the paper with TA

 

11/28, 12/3 Student Project Demo  (1 week)

Every group will make a 10-minute demo.

Project

Sample project topics will be discussed in the class. You can propose your own project that is closely related to the course and discuss it with the instructor first. The  project consists of three parts. First, you need to submit a half-page project proposal. Next, you need to give a midterm project presentation/report stating the problem, existing literature and proposed algorithm. Finally, you need to demo the project to the class and submit a project report detailing the proposed solution.



Grading

    Class attendance and discussion: 15%  
    Paper Reviews: 20%
    Exercises: 25%  
    Project midterm report: 15%
    Project final report: 25%

'CS 전공 > 리뷰' 카테고리의 다른 글

DBMS on New Hardware  (9) 2009.11.22
Memory Hierarchy, Memory Wall and Memory Mountain  (10) 2009.09.28
최근의 DB 연구 경향  (1) 2009.08.20
Claremont Report  (0) 2008.09.10
Queyring Large XML data repositories  (0) 2007.11.28
Posted by Bart
CS 전공/논문 쓰기2008. 3. 15. 16:10

사용자 삽입 이미지

JabRef Reference Manager

이번에 쓰기로 한 놈은 JabRef라는 GPL 라이센스의 레퍼런스 매니저이다.

열람하고, 인용할 논문들의 수가 많아짐에 따라, 예전에는 구글 데스크탑 설치하고,  파일 이름을 논문제목-학회-년도로 부여하고 검색을 수행하였다.
구글 데스크탑이 PDF 파일에 대한 내용 검색도 되기 때문에, 또 관련된 논문들 찾는데도 (사실은 잊고 있던) 솔찬히 도움이 되었다. 그리고, 논문 내용 정리는 이미지 컷과 객체 참조가 자유로운 MS의 OneNote로 하고....

하지만, 문제는 나중에 논문을 쓰려고 보니, 학회마다 제각각인 인용 스타일....

IEEE,ACM, LNCS 전부다 reference 스타일이 다 틀리고, 또 논문 쓸 때마다 reference list를 작성하느라 아주 귀찮아지기 시작했다.

그러던 차에 EndNote라는 유명한 Reference Manager가 있는 것을 알게 되고, 이게 상용이라 돈주고 사야한다는 걸 알게 되었다.  뭐 과제비로 사자고 하면 되겠지만, 또 보니 Vista용은 아직 나오지 않은 것 같다.

대체를 찾다가, 기억 저편에 놓고 있던 이 JabRef를 다시 깔아서 정리하기 시작했다. JabRef는 Java로 작성된 SW라 Vista에서도 동작이 가능하겠지..

일단 정리된 reference는 나중에 LaTeX 에디터로 보내서 쉽게 reference List를 만들 수 있게 해준다. 내가 사용하는 WinEdt+MikTek 조합에서 잘 물려 돌아간다.
각 reference에 대해서 논문 파일이나 ppt 파일, DOI 정보 등도 여러 개를 입력 시킬 수 있다.

아쉬운 것은 요새 많이 사용하는 google scholar에 대한 web search를 지원하지 못한다.
어차피 google scholar가 BibTex를 지원하기 때문에 UI 상에서 google scholar에 직접 질의하고 그 결과를 bibtext로 가져오게 하면, 노가다성이 일이 줄텐데.. 쯧.

또 한가지 아쉬운 것은 reference에 대한 review 란이 단순 텍스트 만을 지원한다는 점이 많이 아쉽다. OneNote같이 객체 참조가 자유로우면 훨씬 더 좋을 텐데, 보니, bibTex의 한 태그로 review 의 텍스트 값들을 기록한다. 즉 텍스트 이외에는 기록이 안된다는... 저장 포맷의 변경이 없는 한 이부분은 불가능할 것 같다....

아... JabRef + OneNote+ Google Scholar, IEEE Explorer, ACM DL, Citeseer 검색 이면 좋으련만....

Posted by Bart
CS 전공/리뷰2007. 11. 28. 00:21

TKDE 10 월호에 XML 어쩌고 하는 논문이 있길래, 궁금해서 봐보았다.
어차피 XML 쪽은 내가 하는 일하고도 관련이 있고, 또 예전에 XML DBMS 개발하는 일도 해보았고,
현재도 이상하게 얽혀있는 관계라서..

NCSU에 있는 애가 쓴 건데, 여태까지 나온 XML 관련 테크닉들을 survey 한 거다. 아하.. TKDE 같은 데서도 Survey 페이퍼를 받는가 보구나 하면서 훑어보니... 이 친구 레퍼런스를 125개를 달았다. 자잘한 건 다 치우고, 굵직한 페이퍼들만 짚고 넘어가는데 125개란다. 그 만큼 이 분야에 얼마나 많은 사람들이 달려붙어서 깃발꽂기를  하고 있었는지 짐작이 간다. (우리는 왜 남의 동네 구경으로 보고 있었지? 시작한 건 거의 가장 처음이었으면서.)
레퍼런스의 한 1/4는 읽어본 것으로 짐작하고, 나머지 반은 이름은 보았던거, 그 외는 전혀 생소한 것들이다. 참 볼 페이퍼들 많다.

이분야도 이제 거의 정리가 되가는 듯 싶은데, 아직 할 수 있는 것이 몇 개 보이긴 하다. 하지만, 지금 일에 치여 손도 못대고 있다는거...

그나저나 상용 DBMS들은 이제 모두 Reverse Path Materialization + Dewey encoding로 굳혀졌구나.
 

'CS 전공 > 리뷰' 카테고리의 다른 글

DBMS on New Hardware  (9) 2009.11.22
Memory Hierarchy, Memory Wall and Memory Mountain  (10) 2009.09.28
최근의 DB 연구 경향  (1) 2009.08.20
Claremont Report  (0) 2008.09.10
ASU의 Yi Chen 교수의 대학원 강의:Data on the Web  (0) 2008.03.25
Posted by Bart
CS 전공/학회와 정보2007. 11. 12. 21:09

Thomson에서 서비스하고 있는 SCI, SCI Expanded 로 분류된 journal들의 목록을 보여줍니다.


몇몇 폐단들이 있긴 하나, 국내에서 연구 실적을 체크하는데 있어 먼저 해당 논문이 SCI인지, SCIE인지를 보게 되지요.

특정 학회의 저널이 SCI로 분류되어 있는지를 확인할 때 사용하시면 되겠습니다.


또한 각 저널들에 대한 impacting factor(인용 지수)는 아래의 주소에서 찾아볼 수 있습니다.


http://jcr01.isiknowledge.com/JCR/JCR?SID=B5Klj7g51fFDFGfPAJJ

첨부하는 파일은 IF 지수를 찾는 방법을 소개하는 ppt 파일임.

 

 

Posted by Bart
CS 전공/논문 쓰기2007. 11. 12. 20:52

PSEUDOCODE STANDARD

Pseudocode is a kind of structured english for describing algorithms. It allows the designer to focus on the logic of the algorithm without being distracted by details of language syntax.  At the same time, the pseudocode needs to be complete.  It describe the entire logic of the algorithm so that implementation becomes a rote mechanical task of translating line by line into source code.

In general the vocabulary used in the pseudocode should be the vocabulary of the problem domain, not of the implementation domain.  The pseudocode is a narrative for someone who knows the requirements (problem domain) and is trying to learn how the solution is organized.  E.g.,

Extract the next word from the line (good)
set word to get next token (poor)

Append the file extension to the name (good)
name = name + extension (poor)

FOR all the characters in the name (good)
FOR character = first to last (ok)

Note that the logic must be decomposed to the level of a single loop or decision. Thus "Search the list and find the customer with highest balance" is too vague because it takes a loop AND a nested decision to implement it. It's okay to use "Find" or "Lookup" if there's a predefined function for it such as String.indexOf().

Each textbook and each individual designer may have their own personal style of pseudocode. Pseudocode is not a rigorous notation, since it is read by other people, not by the computer. There is no universal "standard" for the industry, but for instructional purposes it is helpful if we all follow a similar style. The format below is recommended for expressing your solutions in our class.

The "structured" part of pseudocode is a notation for representing six specific structured programming constructs: SEQUENCE, WHILE, IF-THEN-ELSE, REPEAT-UNTIL, FOR, and CASE. Each of these constructs can be embedded inside any other construct. These constructs represent the logic, or flow of control in an algorithm.

It has been proven that three basic constructs for flow of control are sufficient to implement any "proper" algorithm.

SEQUENCE is a linear progression where one task is performed sequentially after another.
WHILE is a loop (repetition) with a simple conditional test at its beginning.
IF-THEN-ELSE is a decision (selection) in which a choice is made between two alternative courses of action.


Although these constructs are sufficient, it is often useful to include three more constructs:
 

REPEAT-UNTIL is a loop with a simple conditional test at the bottom.
CASE is a multiway branch (decision) based on the value of an expression. CASE is a generalization of IF-THEN-ELSE.
FOR is a "counting" loop.
SEQUENCE

Sequential control is indicated by writing one action after another, each action on a line by itself, and all actions aligned with the same indent. The actions are performed in the sequence (top to bottom) that they are written.

Example (non-computer)

Brush teeth
Wash face
Comb hair
Smile in mirror
Example
READ height of rectangle
READ width of rectangle
COMPUTE area as height times width
Common Action Keywords
Several keywords are often used to indicate common input, output, and processing operations.
Input: READ, OBTAIN, GET
Output: PRINT, DISPLAY, SHOW
Compute: COMPUTE, CALCULATE, DETERMINE
Initialize: SET, INIT
Add one: INCREMENT, BUMP
IF-THEN-ELSE

Binary choice on a given Boolean condition is indicated by the use of four keywords: IF, THEN, ELSE, and ENDIF. The general form is:

IF condition THEN
sequence 1
ELSE
sequence 2
ENDIF
The ELSE keyword and "sequence 2" are optional. If the condition is true, sequence 1 is performed, otherwise sequence 2 is performed.

Example

IF HoursWorked > NormalMax THEN
Display overtime message
ELSE
Display regular time message
ENDIF
WHILE

The WHILE construct is used to specify a loop with a test at the top. The beginning and ending of the loop are indicated by two keywords WHILE and ENDWHILE. The general form is:

WHILE condition
sequence
ENDWHILE
The loop is entered only if the condition is true. The "sequence" is performed for each iteration. At the conclusion of each iteration, the condition is evaluated and the loop continues as long as the condition is true.

Example

WHILE Population < Limit
Compute Population as Population + Births - Deaths
ENDWHILE

Example

WHILE employee.type NOT EQUAL manager AND personCount < numEmployees
INCREMENT personCount
CALL employeeList.getPerson with personCount RETURNING employee
ENDWHILE
CASE

A CASE construct indicates a multiway branch based on conditions that are mutually exclusive. Four keywords, CASE, OF, OTHERS, and ENDCASE, and conditions are used to indicate the various alternatives. The general form is:

CASE expression OF
condition 1 : sequence 1
condition 2 : sequence 2
...
condition n : sequence n
OTHERS:
default sequence
ENDCASE

The OTHERS clause with its default sequence is optional. Conditions are normally numbers or characters

indicating the value of "expression", but they can be English statements or some other notation that specifies the condition under which the given sequence is to be performed. A certain sequence may be associated with more than one condition.

Example

        CASE  Title  OF
                Mr      : Print "Mister"
                Mrs     : Print "Missus"
                Miss    : Print "Miss"
                Ms      : Print "Mizz"
                Dr      : Print "Doctor"
        ENDCASE

Example

        CASE  grade  OF
                A       : points = 4
                B       : points = 3
                C       : points = 2
                D       : points = 1
                F       : points = 0
        ENDCASE

REPEAT-UNTIL

This loop is similar to the WHILE loop except that the test is performed at the bottom of the loop instead of at the top. Two keywords, REPEAT and UNTIL are used. The general form is:

REPEAT
sequence
UNTIL condition
The "sequence" in this type of loop is always performed at least once, because the test is peformed after the sequence is executed. At the conclusion of each iteration, the condition is evaluated, and the loop repeats if the condition is false. The loop terminates when the condition becomes true.
 

FOR

This loop is a specialized construct for iterating a specific number of times, often called a "counting" loop.  Two keywords, FOR and ENDFOR are used. The general form is:

FOR iteration bounds
sequence
ENDFOR
In cases where the loop constraints can be obviously inferred it is best to describe the loop using problem domain vocabulary.

Example

FOR each month of the year (good)
FOR month = 1 to 12 (ok)

FOR each employee in the list (good)
FOR empno = 1 to listsize (ok)


NESTED CONSTRUCTS

The constructs can be embedded within each other, and this is made clear by use of indenting. Nested constructs should be clearly indented from their surrounding constructs.

Example

SET total to zero
REPEAT
READ Temperature
IF Temperature > Freezing THEN
    INCREMENT total
END IF
UNTIL Temperature < zero
Print total
In the above example, the IF construct is nested within the REPEAT construct, and therefore is indented.
 
 

INVOKING SUBPROCEDURES

Use the CALL keyword. For example:

CALL AvgAge with StudentAges
CALL Swap with CurrentItem and TargetItem
CALL Account.debit with CheckAmount
CALL getBalance RETURNING aBalance
CALL SquareRoot with orbitHeight RETURNING nominalOrbit

EXCEPTION HANDLING

    BEGIN
        statements
    EXCEPTION
        WHEN exception type
            statements to handle exception
        WHEN another exception type
            statements to handle exception
    END



Sample Pseudocode

"Adequate"

FOR X = 1 to 10

    FOR Y = 1 to 10
        IF gameBoard[X][Y] = 0
            Do nothing
        ELSE
            CALL theCall(X, Y) (recursive method)
            increment counter                 
        END IF
    END FOR
END FOR

"Better"

Set moveCount to 1
FOR each row on the board
    FOR each column on the board
        IF gameBoard position (row, column) is occupied THEN
            CALL findAdjacentTiles with row, column
            INCREMENT moveCount
        END IF
    END FOR
END FOR

(Note: the logic is restructured to omit the "do nothing" clause)


"Not So Good"

FOR all the number at the back of the array
    SET Temp equal the addition of each number
    IF > 9 THEN
        get the remainder of the number divided by 10 to that index
        and carry the "1"
    Decrement one
Do it again for numbers before the decimal
 

"Good Enough (not perfect)"

SET Carry to 0
FOR each DigitPosition in Number from least significant to most significant

    COMPUTE Total as sum of FirstNum[DigitPosition] and SecondNum[DigitPosition] and Carry  

    IF Total > 10 THEN
        SET Carry to 1
        SUBTRACT 10 from Total
    ELSE
        SET Carry to 0
    END IF

    STORE Total in Result[DigitPosition]

END LOOP  

IF Carry = 1 THEN
    RAISE Overflow exception
END IF
 



"Pretty Good"  This example shows how pseudocode is written as comments in the source file. Note that the double slashes are indented.

public boolean moveRobot (Robot aRobot)
{
    //IF robot has no obstacle in front THEN
        // Call Move robot
        // Add the move command to the command history
        // RETURN true
    //ELSE
        // RETURN false without moving the robot
    //END IF
}

Example Java Implementation

  • source code statements are interleaved with pseudocode.
  • comments that correspond exactly to source code are removed during coding.

public boolean moveRobot (Robot aRobot)
{
    //IF robot has no obstacle in front THEN
    if (aRobot.isFrontClear())
    {
        // Call Move robot
        aRobot.move();
        // Add the move command to the command history
        cmdHistory.add(RobotAction.MOVE);
        return true;
    }
    else // don't move the robot
    {
        return false;
    }//END IF
}
 



Document History
Date Author Change
12/2/03
JD
Added Exception Handling and more examples
2/21/03 JD Added "problem domain vocabulary" paragraph.
Modified FOR loop explanation.

출처: www.csc.calpoly.edu/~jdalbey/SWE/pdl_std.html

Posted by Bart
CS 전공/논문 쓰기2007. 11. 12. 20:51

Computer Theory에 관련한 논문들을 읽어보다가, 여러 생소한 용어들이 눈에 보이기에 정리를 해봅니다.  왜 논문 보면 간혹 lemma 1. proposition 이런 단어들이 눈에 뜨이지요? 이러한 용어가 무엇을 뜻하는지 모르고  그냥 넘어갔는지는 않았는지요?


알아두면 논문을 이해하거나 자신의 이론을 풀어 쓰는데에 유용하겠지요.


1) Axiom- 공리(): (이론의 기초로서 가정한 명제)

 하나의 이론에서 증명 없이 바르다고 하는 명제, 즉 조건 없이 전제된 명제, 논리학에서는 무증명명제()라고도 한다.

 

2) definition - 정의(): (기호()에 대하여 그 수학적 의미를 규정한 것)

 즉, 논의의 대상을 보편적인 것으로 하기 위해, 사용되는 용어 또는 기호의 의미를 확실하게 규정한 문장이나 식()을 그 용어의 정의라고 한다. 이를테면, ‘한 내각의 크기가 직각인 삼각형을 직각삼각형이라 한다’는 직각삼각형의 정의이다.


3) theorem - 정리 (수학적으로 참인 명제 )  

즉, 공리()와 정의()로부터 증명()에 의해 정리가 유도되며, 이미 증명된 이들 정리와 공리 또는 정의를 추론()의 근거로 하여 다음 정리가 옳다는 것을 확인한다. 증명된 정리는 그 체계의 토대로서는 바른 것(참인 것)이지만 보편적인 것은 아니다. 이를테면, 유클리드기하학에서는 ‘삼각형의 내각의 합은 2직각이다’가 정리로서 성립되지만, 비유클리드기하학의 하나인 로바체프스키기하학에서는 ‘삼각형의 내각의 합은 2직각보다 작다’는 것이 성립되며, 리만기하학에서는 ‘삼각형의 내각의 합은 2직각보다 크다’는 것이 성립한다.

즉, 정리는 일군()의 공리계()를 기초로 한, 하나의 체계에 대해서만 성립한다. 어떤 정리에서 직접 유도된 것을 그 정리의 계()라고 한다. 예컨대, 그 정리가 특별한 경우로서 성립하는 때도 그 정리의 계가 된다. 또, 한 체계 중에서 공리 ·정의 이외의 명제는 모두 정리이지만, 특히 그 중의 중요한 것만 가리켜 정리라고 하는 경우도 있다. 그리고 유명한 것에는 고유의 이름을 취한 것도 있다. 예를 들면, 인명을 붙인 피타고라스의 정리, 파스칼의 정리, 메넬라우스의 정리 등과 내용에서 이름을 딴 삼수선()의 정리, 대수학의 기본정리, 미적분학의 평균값정리 등이 있다. 일반적으로 정리는 P and Q and… → R and S and…와 같은 꼴로 기술되며, P and Q and…를 이 정리의 가설 또는 가정, R and S and…를 종결 또는 결론이라고 한다.


  4) lemma - 보조정리 (어떤 정리를 증명하는 데 쓸 목적으로 증명된 명제)

   보제()라고도 한다. 예를 들면 ‘sin x의 도함수는 cos x이다’라는 정리를 보통의 방법으로 증명할 때 사용되는 0<x<π/2이면 sin x<x<tan x,

등은 보조정리라 할 수 있다.

보통 보조정리는 한 정리를 증명하기 위하여 사용되지만 경우에 따라 다른 많은 증명에 사용되기도 한다. 그런 경우 그와 같은 보조정리도 정리라 할 수 있으나, 그대로 보조정리라는 이름으로 이용된다. 유명한 것으로는 ‘졸레의 보조정리’, 함수론의 ‘슈바르츠의 보조정리’ 등이 있다. df


5) corollary- 따름 정리 :  수학용어로서 정리에서 직접 파생된 명제, 계()라고도 한다.

 1개의 정리에서 바로 유도되는 사실로서 이용가치가 많은 것을 명제의 꼴로 나타낸 것을 원래의 정리의 따름정리 또는 계라 한다.


6) proposition -명제(題) : (전통적 논리학에서 판단을 언어로 표현한 것)

  예컨대 ‘개는 동물이다’는 명제이다. 현대 논리학에서는 진위()를 물어보는 뜻이 담긴 글을 명제문()이라 한다. 유명론적() 경향이 있는 철학자 중에는 언어 표현 그 자체와는 다른 독립된 의미의 존재를 인정하는 데 회의적인 사람도 있다. 일상어로 쓰인 글에는 언어의 사용 방법이 양의적()이기 때문에 명제문인지 아닌지 문제가 되고, 명제문이라 하더라도 그 내용이 확실하지 않은 경우가 있다. 그러나 논리기호()로 쓴 글은 이러한 점에서 애매한 것이 전혀 없다. 이것을 명제식()이라고 한다. 진리()임을 강조하는 글을 명제라고 할 때도 있다


7) proof - 증명(明)

 p이면 q이다’라는 합성명제()에서 명제 p를 전제(가설 또는 가정), 명제 q를 결론(종결)이라 하고, 참(truthfullness)인 전제에서 유효한 추론()에 의해 결론을 이끌어내는 것을 증명이라고 한다. 여기서 유효한 추론이란 전제가 참이면 결론도 참인 추론을 말한다. 증명의 대부분은, p → r → q, p → r → s → q 와 같이 전제에서 출발하여 유효한 추론에 따라 연역()해 나가는 것이 보통이다. 이와 같은 증명을 직접증명이라고 한다. 이를테면, ‘a,b가 수일 때, a=b이면 a2=b2이다’의 경우, 전제 p는 a=b, 결론 q는 a2=b2이며, 증명은 다음과 같이 이루어진다. a=b → a=b, a=b → aa=bb → a2=b2 또, 다음과 같이 증명해도 무방하다. a=b → a-b=0 → (a-b)(a+b)=0 → a2-b2=0 → a2=b2

위의 직접증명에 대해, 합성명제 ‘p이면 q이다’(보통 조건명제 또는 간단히 조건이라고 한다)가 참임을 증명하는 데, 이와 동치인 합성명제 ‘∼q → ∼p이다’가 참임을 증명하는 간접증명이 있다. 여기에는 귀류법과 전환법() 등이 있다


8) theory - 이론(論)사물에 관한 지식을 논리적인 연관에 의하여 하나의 체계로 이루어 놓은 것

 

 학문이라면 거기에는 반드시 이론이 있다. 일단 이론이 형성되면 그 이론의 논리적인 결론을 끌어냄으로써 미지()의 영역에 관해서도 효과있는 예상을 하는 경우가 흔히 있다. 그러나 사물에 관한 새로운 지식으로 인하여 이론 적용에 한계가 생기는 수가 있다. 이런 경우 이론에 구애되어 사실을 무시하는 일이 허다하나 이것은 큰 잘못이다.

이론 중에서 근본적인 전제가 있는 것, 또는 자료()에 관한 보고 사항 중에서 그대로 인정해야 할 것은 공리()가 된다. 다음의 명제는 공리로부터 연역()되는 정리()가 된다. 이와 같은 논리적인 연결을 철저히 정리하면 공리론()을 얻게 된다. 여기서 이를 논리기호()로 표시하면 형식화()된 이론이 형성된다.

여기까지 정리하면 동일한 이론이 전혀 다른 복수의 사상()에 적용될 수도 있다는 것이 분명해지는 경우가 있다. 이론이 적용되는 현상() 또는 그 구조를 논리학이나 수학에서는 그 이론의 모델이라고 한다. 그러나 경험과학()에서는 이와는 반대로 하나의 현상을 설명하는 이론을 그 현상의 모델이라고 할 때가 많다. 학문 연구 과정에서 논리적 전개에 치중하는 것을 이론면(), 사상()과의 대결에 치중하는 것을 실험면()에 관한 연구라 하여 구별한다

 

Posted by Bart
CS 전공/학회와 정보2007. 11. 12. 17:47
S/W 분야에 관련된 SCI, SCI(E)저널들을 간단하게 추려보았습니다.

SCI, SCIE 따로 분리되어 있던 list를 하나로 합쳤습니다. 올해 기준입니다.

SCI 인 것은 제목 뒤에 표기되어 있습니다.

98개이군요. 혹 누락된게 있으면 알려주세요.

국내 ETRI 저널도 SCI인걸로 아는데 대충 내용을 보니까, 전자, 통신이 주류인 관계로 배제하였습니다.

뭐 간간히 S/W쪽 이 letter 형식으로 나오는 것 같기는 합니다만.


1. ACM TRANSACTIONS ON DATABASE SYSTEMS -SCI

Quarterly

ISSN: 0362-5915

ASSOC COMPUTING MACHINERY, 1515 BROADWAY, NEW YORK, USA, NY, 10036


2. ACM TRANSACTIONS ON INFORMATION SYSTEMS -SCI

Quarterly

ISSN: 1046-8188

ASSOC COMPUTING MACHINERY, 1515 BROADWAY, NEW YORK, USA, NY, 10036


3. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS -SCI

Bimonthly

ISSN: 0164-0925

ASSOC COMPUTING MACHINERY, 1515 BROADWAY, NEW YORK, USA, NY, 10036


4. ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY-SCI

Quarterly

ISSN: 1049-331X

ASSOC COMPUTING MACHINERY, 1515 BROADWAY, NEW YORK, USA, NY, 10036


5. ACTA INFORMATICA -SCI

Monthly

ISSN: 0001-5903

SPRINGER, 233 SPRING STREET, NEW YORK, USA, NY, 10013


6. ADVANCES IN COMPUTERS

Annual

ISSN: 0065-2458

ELSEVIER ACADEMIC PRESS INC, 525 B STREET, SUITE 1900, SAN DIEGO, USA, CA, 92101-4495


7. ADVANCES IN ENGINEERING SOFTWARE

Monthly

ISSN: 0965-9978

ELSEVIER SCI LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD, ENGLAND, OXON, OX5 1GB


8. ALGORITHMICA -SCI

Monthly

ISSN: 0178-4617

SPRINGER, 233 SPRING STREET, NEW YORK, USA, NY, 10013


9. ANNUAL REVIEW OF INFORMATION SCIENCE AND TECHNOLOGY

Annual

ISSN: 0066-4200

INFORMATION TODAY INC, 143 OLD MARLTON PIKE, MEDFORD, USA, NJ, 08055-8750


10. BELL LABS TECHNICAL JOURNAL

Quarterly

ISSN: 1089-7089

JOHN WILEY & SONS INC, 111 RIVER ST, HOBOKEN, USA, NJ, 07030


11. COMMUNICATIONS OF THE ACM -SCI

Monthly

ISSN: 0001-0782

ASSOC COMPUTING MACHINERY, 1515 BROADWAY, NEW YORK, USA, NY, 10036


12. COMPUTER -SCI

Monthly

ISSN: 0018-9162

IEEE COMPUTER SOC, 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, USA, CA, 90720-1314


13. COMPUTER JOURNAL

Bimonthly

ISSN: 0010-4620

OXFORD UNIV PRESS, GREAT CLARENDON ST, OXFORD, ENGLAND, OX2 6DP


14. COMPUTER LANGUAGES SYSTEMS & STRUCTURES

Quarterly

ISSN: 1477-8424

PERGAMON-ELSEVIER SCIENCE LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD, ENGLAND, OX5 1GB


15. COMPUTER STANDARDS & INTERFACES

Bimonthly

ISSN: 0920-5489

ELSEVIER SCIENCE BV, PO BOX 211, AMSTERDAM, NETHERLANDS, 1000 AE


16. DATA & KNOWLEDGE ENGINEERING

Monthly

ISSN: 0169-023X

ELSEVIER SCIENCE BV, PO BOX 211, AMSTERDAM, NETHERLANDS, 1000 AE


17. DATA MINING AND KNOWLEDGE DISCOVERY -SCI

Quarterly

ISSN: 1384-5810

SPRINGER, VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311 GZ


18. DISTRIBUTED AND PARALLEL DATABASES

Bimonthly

ISSN: 0926-8782

SPRINGER, VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311 GZ


19. ELECTRONIC COMMERCE RESEARCH AND APPLICATIONS

Quarterly

ISSN: 1567-4223

ELSEVIER SCIENCE BV, PO BOX 211, AMSTERDAM, NETHERLANDS, 1000 AE


20. EMPIRICAL SOFTWARE ENGINEERING

Quarterly

ISSN: 1382-3256

SPRINGER, VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311 GZ


21. EUROPEAN JOURNAL OF INFORMATION SYSTEMS

Quarterly

ISSN: 0960-085X

PALGRAVE MACMILLAN LTD, BRUNEL RD BLDG, HOUNDMILLS, BASINGSTOKE, ENGLAND, HANTS, RG21 6XS


22. FORMAL ASPECTS OF COMPUTING

Quarterly

ISSN: 0934-5043

SPRINGER, 233 SPRING STREET, NEW YORK, USA, NY, 10013


23. FUNDAMENTA INFORMATICAE

Monthly

ISSN: 0169-2968

IOS PRESS, NIEUWE HEMWEG 6B, AMSTERDAM, NETHERLANDS, 1013 BG


25. IBM SYSTEMS JOURNAL -SCI

Quarterly

ISSN: 0018-8670

IBM CORP, 1 NEW ORCHARD ROAD, ARMONK, USA, NY, 10504


26. ICGA JOURNAL

Quarterly

ISSN: 1389-6911

UNIV MAASTRICHT FACULTY GENERAL SCIENCES, DEPT COMPUTER SCIENCES/IKAT, PO BOX 616, MAASTRICHT, NETHERLANDS, 6200 MD


27. IEE PROCEEDINGS-SOFTWARE

Bimonthly

ISSN: 1462-5970

INSTITUTION ENGINEERING TECHNOLOGY-IET, MICHAEL FARADAY HOUSE SIX HILLS WAY STEVENAGE, HERTFORD, ENGLAND, SG1 2AY


28. IEEE INTERNET COMPUTING

Bimonthly

ISSN: 1089-7801

IEEE COMPUTER SOC, 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, USA, CA, 90720-1314


29. IEEE MULTIMEDIA -SCI

Quarterly

ISSN: 1070-986X

IEEE COMPUTER SOC, 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, USA, CA, 90720-1314


30. IEEE PERVASIVE COMPUTING

Bimonthly

ISSN: 1536-1268

IEEE COMPUTER SOC, 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, USA, CA, 90720-1314


31. IEEE SOFTWARE -SCI

Bimonthly

ISSN: 0740-7459

IEEE COMPUTER SOC, 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, USA, CA, 90720-1314


32. IEEE TRANSACTIONS ON INFORMATION THEORY -SCI

Bimonthly

ISSN: 0018-9448

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, USA, NJ, 08855


33. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING -SCI

Bimonthly

ISSN: 1041-4347

IEEE COMPUTER SOC, 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, USA, CA, 90720-1314


34. IEEE TRANSACTIONS ON MOBILE COMPUTING

Quarterly

ISSN: 1536-1233

IEEE COMPUTER SOC, 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, USA, CA, 90720-1314


35. IEEE TRANSACTIONS ON MULTIMEDIA

Quarterly

ISSN: 1520-9210

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, USA, NJ, 08855


36. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING -SCI

Monthly

ISSN: 0098-5589

IEEE COMPUTER SOC, 10662 LOS VAQUEROS CIRCLE, PO BOX 3014, LOS ALAMITOS, USA, CA, 90720-1314


37. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES

Monthly

ISSN: 0916-8508

IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, KIKAI-SHINKO-KAIKAN BLDG MINATO-KU SHIBAKOEN 3 CHOME, TOKYO, JAPAN, 105


38. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS

Monthly

ISSN: 0916-8532

IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, KIKAI-SHINKO-KAIKAN BLDG MINATO-KU SHIBAKOEN 3 CHOME, TOKYO, JAPAN, 105


39. INFOR

Quarterly

ISSN: 0315-5986

INFOR, UNIV TORONTO PRESS, JOURNALS DEPT,5201 DUFFERIN ST, TORONTO, CANADA, ON, M3H 5T8


40. INFORMATICA

Quarterly

ISSN: 0868-4952

INST MATHEMATICS & INFORMATICS, AKADEMIJOS 4, VILNIUS, LITHUANIA, 2600


41. INFORMATION & MANAGEMENT

Monthly

ISSN: 0378-7206

ELSEVIER SCIENCE BV, PO BOX 211, AMSTERDAM, NETHERLANDS, 1000 AE


42. INFORMATION AND SOFTWARE TECHNOLOGY

Monthly

ISSN: 0950-5849

ELSEVIER SCIENCE BV, PO BOX 211, AMSTERDAM, NETHERLANDS, 1000 AE


43. INFORMATION PROCESSING & MANAGEMENT

Bimonthly

ISSN: 0306-4573

PERGAMON-ELSEVIER SCIENCE LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD, ENGLAND, OX5 1GB


44. INFORMATION PROCESSING LETTERS

Monthly

ISSN: 0020-0190

ELSEVIER SCIENCE BV, PO BOX 211, AMSTERDAM, NETHERLANDS, 1000 AE


45. INFORMATION RETRIEVAL

Quarterly

ISSN: 1386-4564

SPRINGER, VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311 GZ


46. INFORMATION SCIENCES -SCI

Biweekly

ISSN: 0020-0255

ELSEVIER SCIENCE INC, 360 PARK AVE SOUTH, NEW YORK, USA, NY, 10010-1710


47. INFORMATION SYSTEMS -SCI

Bimonthly

ISSN: 0306-4379

PERGAMON-ELSEVIER SCIENCE LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD, ENGLAND, OX5 1GB


48. INFORMATION SYSTEMS FRONTIERS

Quarterly

ISSN: 1387-3326

SPRINGER, VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311 GZ


49. INFORMATION SYSTEMS MANAGEMENT

Quarterly

ISSN: 1058-0530

AUERBACH PUBLICATIONS, C/O CRC PRESS L L C, 2000 CORPORATE BLVD NW, BOCA RATON, USA, FL, 33431


50. INFORMATION TECHNOLOGY AND LIBRARIES

Quarterly

ISSN: 0730-9295

AMER LIBRARY ASSOC, 50 E HURON ST, CHICAGO, USA, IL, 60611


51. INTERNATIONAL JOURNAL OF COOPERATIVE INFORMATION SYSTEMS

Tri-annual

ISSN: 0218-8430

WORLD SCIENTIFIC PUBL CO PTE LTD, 5 TOH TUCK LINK, SINGAPORE, SINGAPORE, 596224


52. INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS

Quarterly

ISSN: 1550-1329

TAYLOR & FRANCIS INC, 325 CHESTNUT ST, SUITE 800, PHILADELPHIA, USA, PA, 19106


53. INTERNATIONAL JOURNAL OF ELECTRONIC COMMERCE

Quarterly

ISSN: 1086-4415

M E SHARPE INC, 80 BUSINESS PARK DR, ARMONK, USA, NY, 10504


54. INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE -SCI

Bimonthly

ISSN: 1365-8816

TAYLOR & FRANCIS LTD, 4 PARK SQUARE, MILTON PARK, ABINGDON, ENGLAND, OXON, OX14 4RN


55. INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MAKING

Quarterly

ISSN: 0219-6220

WORLD SCIENTIFIC PUBL CO PTE LTD, 5 TOH TUCK LINK, SINGAPORE, SINGAPORE, 596224


56. INTERNATIONAL JOURNAL OF SOFTWARE ENGINEERING AND KNOWLEDGE ENGINEERING

Bimonthly

ISSN: 0218-1940

WORLD SCIENTIFIC PUBL CO PTE LTD, 5 TOH TUCK LINK, SINGAPORE, SINGAPORE, 596224


57. INTERNATIONAL JOURNAL OF WEB SERVICES RESEARCH

Quarterly

ISSN: 1545-7362

IDEA GROUP PUBLISHING, 701 E CHOCOLATE AVE, STE 200, HERSHEY, USA, PA, 17033-1240


58. INTERNET RESEARCH

Bimonthly

ISSN: 1066-2243

EMERALD GROUP PUBLISHING LIMITED, 60/62 TOLLER LANE, BRADFORD, ENGLAND, W YORKSHIRE, BD8 9BY


59. JOURNAL OF COMPUTER INFORMATION SYSTEMS

Quarterly

ISSN: 0887-4417

INT ASSOC COMPUTER INFO SYSTEM, OKLAHOMA ST UNIV COLLEGE OF BUSINESS, STILLWATER, USA, OK, 74078


60. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY

Bimonthly

ISSN: 1000-9000

SCIENCE CHINA PRESS, 16 DONGHUANGCHENGGEN NORTH ST, BEIJING, PEOPLES R CHINA, 100717


61. JOURNAL OF DATABASE MANAGEMENT

Quarterly

ISSN: 1063-8016

IDEA GROUP PUBLISHING, 701 E CHOCOLATE AVE, STE 200, HERSHEY, USA, PA, 17033-1240


62. JOURNAL OF FUNCTIONAL PROGRAMMING

Bimonthly

ISSN: 0956-7968

CAMBRIDGE UNIV PRESS, 32 AVENUE OF THE AMERICAS, NEW YORK, USA, NY, 10013-2473


63. JOURNAL OF INFORMATION SCIENCE

Bimonthly

ISSN: 0165-5515

SAGE PUBLICATIONS LTD, 1 OLIVERS YARD, 55 CITY ROAD, LONDON, ENGLAND, EC1Y 1SP


64. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING

Bimonthly

ISSN: 1016-2364

INST INFORMATION SCIENCE, ACADEMIA SINICA, TAIPEI, TAIWAN, 115


65. JOURNAL OF INFORMATION TECHNOLOGY

Quarterly

ISSN: 0268-3962

PALGRAVE MACMILLAN LTD, BRUNEL RD BLDG, HOUNDMILLS, BASINGSTOKE, ENGLAND, HANTS, RG21 6XS


66. JOURNAL OF INTELLIGENT INFORMATION SYSTEMS

Bimonthly

ISSN: 0925-9902

SPRINGER, VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311 GZ


67. JOURNAL OF MANAGEMENT INFORMATION SYSTEMS

Quarterly

ISSN: 0742-1222

M E SHARPE INC, 80 BUSINESS PARK DR, ARMONK, USA, NY, 10504


68. JOURNAL OF NETWORK AND COMPUTER APPLICATIONS

Quarterly

ISSN: 1084-8045

ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD, 24-28 OVAL RD, LONDON, ENGLAND, NW1 7DX


69. JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT

Quarterly

ISSN: 1064-7570

SPRINGER, 233 SPRING STREET, NEW YORK, USA, NY, 10013


70. JOURNAL OF ORGANIZATIONAL COMPUTING AND ELECTRONIC COMMERCE -SCI

Quarterly

ISSN: 1091-9392

LAWRENCE ERLBAUM ASSOC INC, 10 INDUSTRIAL AVE, MAHWAH, USA, NJ, 07430-2262


71. JOURNAL OF RESEARCH AND PRACTICE IN INFORMATION TECHNOLOGY

Quarterly

ISSN: 1443-458X

AUSTRALIAN COMPUTER SOC INC, PO BOX Q534, QVB POST OFFICE, SYDNEY, AUSTRALIA, NSW, 1230


72. JOURNAL OF SOFTWARE MAINTENANCE AND EVOLUTION-RESEARCH AND PRACTICE

Bimonthly

ISSN: 1532-060X

JOHN WILEY & SONS LTD, THE ATRIUM, SOUTHERN GATE, CHICHESTER, ENGLAND, W SUSSEX, PO19 8SQ


73. JOURNAL OF STRATEGIC INFORMATION SYSTEMS

Quarterly

ISSN: 0963-8687

ELSEVIER SCIENCE BV, PO BOX 211, AMSTERDAM, NETHERLANDS, 1000 AE


74. JOURNAL OF SYSTEMS AND SOFTWARE

Monthly

ISSN: 0164-1212

ELSEVIER SCIENCE INC, 360 PARK AVE SOUTH, NEW YORK, USA, NY, 10010-1710


75. JOURNAL OF THE ACM -SCI

Quarterly

ISSN: 0004-5411

ASSOC COMPUTING MACHINERY, 1515 BROADWAY, NEW YORK, USA, NY, 10036


76. JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY

Monthly

ISSN: 1532-2882

JOHN WILEY & SONS INC, 111 RIVER ST, HOBOKEN, USA, NJ, 07030


77. JOURNAL OF WEB SEMANTICS

Quarterly

ISSN: 1570-8268

ELSEVIER SCIENCE BV, PO BOX 211, AMSTERDAM, NETHERLANDS, 1000 AE


78. KNOWLEDGE AND INFORMATION SYSTEMS

Bimonthly

ISSN: 0219-1377

SPRINGER LONDON LTD, SWEETAPPLE HOUSE CATTESHALL ROAD, GODALMING, ENGLAND, SURREY, GU7 3DJ


79. LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES

Monthly

ISSN: 0170-8643


80. MATHEMATICAL AND COMPUTER MODELLING

Monthly

ISSN: 0895-7177

PERGAMON-ELSEVIER SCIENCE LTD, THE BOULEVARD, LANGFORD LANE, KIDLINGTON,

OXFORD, ENGLAND, OX5 1GB

81. MATHEMATICAL PROGRAMMING

Monthly

ISSN: 0025-5610

SPRINGER, 233 SPRING STREET, NEW YORK, USA, NY, 10013


82. MATHEMATICS AND COMPUTERS IN SIMULATION

Monthly

ISSN: 0378-4754

ELSEVIER SCIENCE BV, PO BOX 211, AMSTERDAM, NETHERLANDS, 1000 AE


83. MIS QUARTERLY

Quarterly

ISSN: 0276-7783

SOC INFORM MANAGE-MIS RES CENT, UNIV MINNESOTA-SCH MANAGEMENT 271 19TH AVE SOUTH, MINNEAPOLIS, USA, MN, 55455


84. MOBILE NETWORKS & APPLICATIONS

Quarterly

ISSN: 1383-469X

SPRINGER, VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311 GZ


85. MULTIMEDIA SYSTEMS -SCI

Bimonthly

ISSN: 0942-4962

SPRINGER, 233 SPRING STREET, NEW YORK, USA, NY, 10013


86. MULTIMEDIA TOOLS AND APPLICATIONS

Bimonthly

ISSN: 1380-7501

SPRINGER, VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311 GZ


87. ONLINE INFORMATION REVIEW

Bimonthly

ISSN: 1468-4527

EMERALD GROUP PUBLISHING LIMITED, 60/62 TOLLER LANE, BRADFORD, ENGLAND, W YORKSHIRE, BD8 9BY


88. OPEN SYSTEMS & INFORMATION DYNAMICS

Quarterly

ISSN: 1230-1612

SPRINGER, VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311 GZ


89. OPTIMIZATION METHODS & SOFTWARE

Quarterly

ISSN: 1055-6788

TAYLOR & FRANCIS LTD, 4 PARK SQUARE, MILTON PARK, ABINGDON, ENGLAND, OXON, OX14 4RN


90. PROGRAM-ELECTRONIC LIBRARY AND INFORMATION SYSTEMS

Quarterly

ISSN: 0033-0337

EMERALD GROUP PUBLISHING LIMITED, 60/62 TOLLER LANE, BRADFORD, ENGLAND, W YORKSHIRE, BD8 9BY


91. PROGRAMMING AND COMPUTER SOFTWARE

Bimonthly

ISSN: 0361-7688

MAIK NAUKA/INTERPERIODICA/SPRINGER, 233 SPRING ST, NEW YORK, USA, NY, 10013-1578


92. REQUIREMENTS ENGINEERING

Quarterly

ISSN: 0947-3602

SPRINGER, 233 SPRING STREET, NEW YORK, USA, NY, 10013


93. SCIENCE OF COMPUTER PROGRAMMING

Monthly

ISSN: 0167-6423

ELSEVIER SCIENCE BV, PO BOX 211, AMSTERDAM, NETHERLANDS, 1000 AE


94. SOFTWARE QUALITY JOURNAL

Quarterly

ISSN: 0963-9314

SPRINGER, VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311 GZ


95. SOFTWARE-PRACTICE & EXPERIENCE

Monthly

ISSN: 0038-0644

JOHN WILEY & SONS LTD, THE ATRIUM, SOUTHERN GATE, CHICHESTER, ENGLAND, W SUSSEX, PO19 8SQ


96. SIGMOD RECORD

Quarterly

ISSN: 0163-5808

ASSOC COMPUTING MACHINERY, 1515 BROADWAY, NEW YORK, USA, NY, 10036


97. VLDB JOURNAL

Quarterly

ISSN: 1066-8888

SPRINGER, 233 SPRING STREET, NEW YORK, USA, NY, 10013


98. WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS

Quarterly

ISSN: 1386-145X

SPRINGER, VAN GODEWIJCKSTRAAT 30, DORDRECHT, NETHERLANDS, 3311 GZ

Posted by Bart
CS 전공2007. 11. 9. 17:39

이 책은 DB 분야 발전상의 주요 논문들을 이 분야 유명 학자들(그래봤자 Stonebraker 이름밖에 안보였지만...유명하면 pick한것도 사람들이 돈주고 사서 본다... 열라 부럽구나...) 이 선별하여 정리하였다. 

구입했으니 읽어야 할 텐데... 난 이런 거 차근차근히 보면서 원리 알아보고, 개념적으로 정리하는거 좋아한다. 기록자적인 특징이 있는지도...

아무튼 대학원 강의 교재로 좋을 듯..

Readings in Database Systems
http://redbook.cs.berkeley.edu/

강의 노트
http://redbook.cs.berkeley.edu/lecs.html

Supplemental Material http://redbook.cs.berkeley.edu/redbook3/supplemental.htm

Posted by Bart