Informationssystem är resultatet av samarbete människor emellan. System designas, realiseras, testas och implementeras i de verksamheter som de ska stödja. Samarbetekrävs under alla dessa steg. I utvecklingsarbetets inledning är det inte ovanligt att kraven på systemen formuleras genom projekt som organiseras genom olika typer avsamarbetsformer. I föreliggande avhandling lyfter vi pä locket på samarbetsinriktad modellering och studerar i detalj vad som sker när krav på system formuleras. Genom en gedigen forskningsdesign och ett rikt datamaterial följer vi två modelleringsteam när de facililerar verksamhetsrepresentanter i olika situationer under tre modelleringsprojekt. Avsikten är att utveckla kunskap om vad som utmärker facililering i dessa situationersamt studera vad som utmärker situationsanpassning när modellerarna underlättar och möjliggör arbetet. Genom videobaserad forskning har modelleringsarbetet dokumenterats och med hjälp av olika analysmetoder, såsom konversationsinriktad handlingsanalys och multigrundad teoriutveckling, tolkas episoder i materialet och en plattform för en praktisk teori om facililering utvecklas. Resultatet utgörs av en typologi över samarbetsinriktad modellering, åtgärder för att utföra facililering av arbetet, samt insikter om vad som utmärker situationsanpassning när facilitering utförs och olika omständigheter måste mötas. Synsättet som förespråkas är att tillämpande av struktur och utnyttjandet av frihet är förutsättningar då goda krav på informationssystem ska formuleras genom samarbete.

This thesis describes the background, investigation and construction of a system for storing data on the magnetic stripe of a standard three-inch plastic credit in: inch card. Investigation shows that the information storage limit within a 3.375 in by 0.11 in rectangle of the stripe is bounded to about 20 kBytes. Practical issues limit the data storage to around 300 Bytes with a low raw error rate: a four-fold density increase over the standard. Removal of the timing jitter (that is prob-' ably caused by the magnetic medium particle size) would increase the limit to 1500 Bytes with no other system changes. This is enough capacity for either a small digital passport photograph or a digitized signature: making it possible to remove printed versions from the surface of the card. To achieve even these modest gains has required the development of a new variable rate code that is more resilient to timing errors than other codes in its efficiency class. The tabulation of the effects of timing errors required the construction of a new code metric and self-recovering decoders. In addition, a new method of timing recovery, based on the signal 'snatches' has been invented to increase the rapidity with which a Bayesian decoder can track the changing velocity of a hand-swiped card. The timing recovery and Bayesian detector have been integrated into one computation (software) unit that is self-contained and can decode a general class of (d, k) constrained codes. Additionally, the unit has a signal truncation mechanism to alleviate some of the effects of non-linear distortion that are present when a magnetic card is read with a magneto-resistive magnetic sensor that has been driven beyond its bias magnetization. While the storage density is low and the total storage capacity is meagre in comparison with contemporary storage devices, the high density card may still have a niche role to play in society. Nevertheless, in the face of the Smart card its long term outlook is uncertain. However, several areas of coding and detection under short-duration extreme conditions have brought new decoding methods to light. The scope of these methods is not limited just to the credit card.

Shi Xiaodong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (leaves 114-117). / Abstracts in English and Chinese. / 摘要 --- p.i / Abstract --- p.ii / Acknowledgement --- p.iii / Table of Contents --- p.iv / List of Tables --- p.vi / List of Figures --- p.vii / List of Figures --- p.vii / Chapter Chapter 1. --- Introduction --- p.9 / Chapter 1.1. --- Background --- p.9 / Chapter 1.2. --- Research Motivation --- p.10 / Chapter 1.3. --- Research Objective --- p.14 / Chapter 1.4. --- Organization of Thesis --- p.14 / Chapter Chapter 2. --- Problem Analysis and Definition --- p.15 / Chapter 2.1. --- "Definitions of Story, Event and Topic" --- p.15 / Chapter 2.2. --- Characteristics of News Stories --- p.17 / Chapter Chapter 3. --- Literature Review --- p.26 / Chapter 3.1. --- Topic Detection and Tracking (TDT) --- p.26 / Chapter 3.2. --- Document Clustering Techniques --- p.27 / Chapter 3.3. --- Event Evolution --- p.30 / Chapter Chapter 4. --- System Architecture --- p.34 / Chapter Chapter 5. --- Event Evolution --- p.37 / Chapter 5.1. --- Event Evolution --- p.37 / Chapter 5.2. --- Event Timestamp and Temporal Relationship --- p.39 / Chapter 5.3. --- Event Evolution Graph --- p.42 / Chapter 5.4. --- Event Threading and Event Joining --- p.46 / Chapter Chapter 6. --- Extracting News Events --- p.48 / Chapter 6.1. --- Clustering Approach --- p.48 / Chapter 6.2. --- Utilizing Clustered Stories from News Infomediaries --- p.59 / Chapter Chapter 7. --- Modeling Event Evolution Relationships --- p.62 / Chapter 7.1. --- Measuring the Confidences of Event Evolution Relationships --- p.63 / Chapter Chapter 8. --- Constructing Event Evolution Graphs --- p.68 / Chapter 8.1. --- Static Thresholding --- p.68 / Chapter 8.2. --- Static Pruning --- p.69 / Chapter 8.3. --- Dynamic Pruning --- p.70 / Chapter Chapter 9. --- Experimental Evaluation --- p.72 / Chapter 9.1. --- Evaluation Measure --- p.72 / Chapter 9.2. --- Data Set --- p.77 / Chapter 9.3. --- Experimental Results and Analysis --- p.78 / Chapter Chapter 10. --- Case Study --- p.89 / Chapter Chapter 11. --- Story Segmentation and Its Effects --- p.93 / Chapter 11.1. --- Story Segmentation --- p.95 / Chapter 11.2. --- Event Generalization --- p.97 / Chapter 11.3. --- Experimental Evaluation --- p.98 / Chapter Chapter 12. --- Conclusions and Future Work --- p.112 / Chapter 12.1. --- Conclusions --- p.112 / Chapter 12.2. --- Future Work --- p.113 / References --- p.114

Thesis (M.S.)--Naval Postgraduate School, 2002. / Thesis advisor(s): Doug Moses, Tony Kendal. Also available online.

Thesis (Ph. D.) in Spatial Information Science and Engineering--University of Maine, 2003. / Includes vita. Includes bibliographical references (leaves 137-143).

No description available.

No description available.

No description available.

The design of Digital Library Systems (DLSes) has evolved overtime, both in sophistication and complexity, to complement the complex nature and sheer size of digital content being curated. However, there is also a growing demand from content curators, with relatively small-size collections, for simpler and more manageable tools and services to manage their content. The reasons for this particular need are driven by the assumption that simplicity and manageability might ultimately translate to lower costs of maintenance of such systems. This research proposes and advocates for a minimalist and simplistic approach to the overall design of DLSes. It is hypothesised that Digital Library (DL) tools and services based on such designs could potentially be easy to use and manage. A meta-analysis of existing DL and non-DL tools was conducted to aid the derivation of design principles for simple DLSes. The desig n principles were then mapped to design decisions applied to the design of a prototype simple repository. In order to assess the effectiveness of the simple repository design, two real-world case study collections were implemented based on the design. In addition, a developer-oriented study was conducted using one of the case study collections to evaluate the simplicity and ease of use of the prototype system. Furthermore, performance experiments were conducted to establish the extent to which such a simple design approach would scale and also establish comparative advantages to existing designs. In general, the study outlined some possible implications of simplifying DLS design; specifically the results from the developer-oriented user study indicate that simplicity in the design of the DLS repository sub-layer does not severely impact the interaction between the service sub-layer and the repository sub-layer. Furthermore, the scalability experiments indicate that desirable performance results for small- and medium-sized collections are attainable. The practical implication of the proposed design approach is two-fold: firstly the minimalistic design has the potential to be used to design simple and yet easy to use tools with comparable features to those exhibited by well-established DL tools; and secondly, the principled design approach has the potential to be applied to the design of non-DL application domains.

No description available.