421 |
A generic construction process modelling methodKarhu, Vesa January 2001 (has links)
<p>A variety of modelling methods has been used to modelconstruction processes and projects, either during normalproject planning or for process re-engineering efforts orresearch. One common method, which is widely used byconstruction industry practitioners, is scheduling. In additionto schedules, some companies have used a simple box-and-arrowmethod, which graphically resembles schedules, for analysingtheir working processes. More formal methods such as IDEF0 havebeen used in re-engineering projects and by researchers. Allthese methods are limited in scope and cannot be used to modelall the aspects of the processes that practitioners areinterested in.</p><p>A new generic construction process modelling method, GEPM,was developed to overcome the deficiencies of the currentmethods. GEPM uses object-oriented principles, and has borrowedfeatures, such as activity, task, and temporal dependency, frommethods like IDEF0 and scheduling. GEPM is flexible in thesense that the conceptual model can be changed to achieveadditional special features. This capability is also supportedby the database implementation, which enables users to interactwith the developed process models through views that representpartial models. The views support the IDEF0, scheduling, andsimple flow methods. There are, though, rules for how toconvert between the partial models through views.</p><p>The evaluation of GEPM showed that more modelling features,i.e. modelling power, are obtained in comparison with theearlier methods. One of the essential features of GEPM is thedistinction between activities and tasks. Activities define howan action will be carried out, generally using predeterminedinputs to achieve a predetermined output, whereas tasks areactivities with additionally specified starting and finishingtimes, duration and location. Moreover, a task has atype-attribute that refers to an activity where its overalltemplate is defined.</p><p>Before the actual evaluation, case material from a realproject was preliminarily tested with GEPM along with theprototype application. It turned out that some additions wereneeded to the conceptual model of GEPM and to the prototypeapplication.</p><p>GEPM can be used for process improvement, processmanagement, and for enhancing communication in a constructionprocess. One usage scenario for GEPM is to define qualitysystems and reference models, using the activity sub-model andstoring the results in the GEPM database. A project-specificmodel can be derived from the reference model using conversionrules, and it eventually turns into a project specific-schedulewith tasks.</p><p><b>Keywords:</b>process, modelling, generic, method, model,database, view</p>
|
422 |
Analyzing and adapting graph algorithms for large persistent graphsLarsson, Patrik January 2008 (has links)
<p>In this work, the graph database Neo4j developed by Neo Technology is presented together with some of it's functionality when it comes to accessing data as a graph. This type of data access brings the possibility to implement common graph algorithms on top of Neo4j. Examples of such algorithms are presented together with their theoretical backgrounds. These are mainly algorithms for finding shortest paths and algorithms for different graph measures such as centrality measures. The implementations that have been made are presented, as well as complexity analysis and the performance measures performed on them. The conclusions include that Neo4j is well suited for these types of implementations.</p>
|
423 |
Gold Standard WebsiteAhmad, Khurram, Azeem, Muhammad January 2009 (has links)
<p> </p><p>The aim of this thesis is to design a web base system which provides functionality of comparison between two java files on the basis of point-to information (P2I). User will upload Java files and analysis of Java files called point-to analysis (P2A). System will store the files in the file system for reference and download in later time. System will extract the information called P2I from P2A and it will store that information in the database.</p><p>Database should be flexible to accommodate the changes in P2A file and system should be able to extract the P2I and store it in database with minimum support of system administrator.</p><p> </p>
|
424 |
Online searching and connecting caching /Stafford, Matthew, January 2000 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 125-127). Available also in a digital version from Dissertation Abstracts.
|
425 |
Recommending information sources on WWWNg, Chi-yuen. January 2000 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2001. / Includes bibliographical references (leaves 97-99).
|
426 |
Image retrieval system based on texture and chromatic featuresChan, Ching-yi. January 2000 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2001. / Includes bibliographical references (leaves 75-81).
|
427 |
Functional data analysis for environmental and biomedical problemsTemiyasathit, Chivalai. January 2008 (has links)
Thesis (Ph.D.) -- University of Texas at Arlington, 2008.
|
428 |
Integration of heterogeneous databases : discovery of meta-information and maintenance of schema-restructuring views.Koeller, Andreas. January 2001 (has links)
Thesis (Ph. D.)--Worcester Polytechnic Institute. / UMI no. 30-30945. Keywords: schema restructuring; schema changes; meta-data discovery; data mining; data integration. Includes bibliographical references (leaves 256-274).
|
429 |
On indexing large databases for advanced data modelsSamoladas, Vasilis. January 1900 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2001. / Vita. Includes bibliographical references. Available also from UMI Company.
|
430 |
Indexing and query processing of spatio-temporal data /Tao, Yufei. January 2002 (has links)
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2002. / Includes bibliographical references (leaves 208-215). Also available in electronic version. Access restricted to campus users.
|
Page generated in 0.0404 seconds