No description available.

Because XML has become a new standard for data representation, there is a need for a simple conceptual model that works well with XML-based development. In this research we present a conceptual model for XML, called C-XML, which meets this new need of systems analysts who store their data using XML. We describe our implementation of an automatic conversion from XML Schema to C-XML that preserves information and constraints. With this conversion, we can view an XML Schema instance graphically at a higher level of abstraction. We also describe our implementation of an automatic conversion from C-XML to XML Schema. Our con- version preserves information and constraints as long as we count the special C-XML comments that we insert in an XML-Schema instance to capture the constraints in C-XML that are not representable in XML Schema. In connection with defining C- XML and implementing conversions between C-XML and XML Schema, we are also able to make several insightful observations. We point out ways in which C-XML is more expressive than XML Schema, and we make recommendations for extending XML Schema. We also point out ways in which XML Schema is more expressive than conceptual models, and we make recommendations for augmenting traditional con- ceptual models to better accommodate XML. The work accomplished in connection with this research establishes the basis for several fundamental activities in system analysis, design, development, and evolution.

ITC/USA 2007 Conference Proceedings / The Forty-Third Annual International Telemetering Conference and Technical Exhibition / October 22-25, 2007 / Riviera Hotel & Convention Center, Las Vegas, Nevada / Many engineers express frustration with the multitude of vendor specific tools required to describe measurements and configure data acquisition systems. In general, tools are incompatible between vendors, forcing the engineer to enter the same or similar data multiple times. With the emergence of XML technologies, user centric data modeling for the flight test community is now possible. With this new class of technology, a vendor neutral, standard language to define measurements and configure systems may finally be realized. However, the allure of such a universal language can easily become too abstract, making it untenable for hardware configuration and resulting in a low vendor adoption rate. Conversely, a language that caters too much to vendor specific configuration will defeat its purpose. Achieving this careful balance is not trivial, but is possible. Doing so will produce a useful standard without putting it out of the reach of equipment vendors. This paper discusses the concept, merits, and possible solutions for a standard measurement metadata model. Practical solutions using XML and related technologies are discussed.

This thesis studied a new variant of Evolutionary Algorithms called Gene Expression Programming. The evolution process of Gene Expression Programming was investigated from the practice to the theory. As a practice level, the original version of Gene Expression Programming was applied to a classification problem and an enhanced version of the algorithm was consequently developed. This allowed the development of a general understanding of each component of the genotype and phenotype separated representation system of the solution employed by the algorithm. Based on such an understanding, a version of the schema theory was developed for Gene Expression Programming. The genetic modifications provided by each genetic operator employed by this algorithm were analysed and a set of theorems predicting the propagation of the schema from one generation to another was developed. Also a set of experiments were performed to test the validity of the developed schema theory obtaining good agreement between the experimental results and the theoretical predictions.

Efforts to automate building rule checking have not brought us anywhere near to the ultimate goal to fully automate the rule checking process. With the advancement in BIM and the latest tools and computing capability, we have what is necessary to achieve it. And yet challenges still abound. This research takes a holistic approach to solve the issue by first examining the rule complexity and its logic structure. Three major aspects of the rules are addressed in this research. The first is a new approach to transform BIM data into a simple database schema and to make it easily query-able by adopting the data warehouse approach. Geometry and spatial operations are also commonly needed for automating rules, and therefore the second approach is to integrate these into a database in the form of multiple representations. The third is a standardized rule language that leverages the database query integrated with its geometry and spatial query capability, called BIMRL. It is designed for a non-programmatic approach to the rule definitions that is suitable for typical rule experts. The rule definition takes a form of triplet command: CHECK – EVALUATE – ACTION statement that can be chained to support more complex rules. A prototype system has been developed as a proof-of-concept using selected rules taken from various sources to demonstrate the validity of the approach to solve the challenges of automating the building rule checking.

Thesis (MSc)--Stellenbosch University, 2001. / ENGLISH ABSTRACT: In response to increased focus on schemas within cognitive therapy and specifically in the treatment of personality disorders, Young developed an instrument to measure early maladaptive schemas, the Young Schema Questionnaire (YSQ). The statistical properties of this measure have been investigated, and due to its length, a shortened version was developed (the YSQ-S). In the present study the factor structure of the YSQ-S was investigated in a group of South African undergraduate psychology students (N = 300). In contrast with the findings of the studies done on the YSQ, 14 of Young's 15 schemas were identified as factors in the YSQ-S, corresponding largely with the theoretically underlying structure. A higher order factor analysis solution was also found to resemble the structure proposed by Young. / AFRIKAANSE OPSOMMING: Die groter fokus op skemas binne die kognitiewe terapie, veral met betrekking tot die behandeling van persoonlikheidsversteurings, het daartoe gelei dat Young 'n meetmiddel, naamlik die Young Schema Questionnaire (YSQ), ontwikkel het om vroeë wanaangepaste skemas ("early maladaptive schemas") te meet. Die statistiese eienskappe van hierdie meetmiddel is reeds nagevors, en as gevolg van die lengte van hierdie meetmiddel, is 'n verkorte weergawe daarvan ontwikkel (YSQ-S). In die huidige studie is die faktoriale struktuur van die YSQ-S by 'n groep Suid Afrikaanse voorgraadse sielkunde studente (N = 300) ondersoek. In teenstelling met die bevindings van vroeëre studies op die YSQ, is 14 van die 15 van Young se skemas as faktore by die YSQ-S geïdentifiseer, wat grootliks ooreengestem het met die teoreties gekonseptualiseerde onderligende struktuur. Die oplossing van 'n hoër-ordefaktorontleding het ook ooreengestem met die struktuur wat deur Young voorgestel is.

Les contraintes arithmétiques sont largement utilisées dans les langages formels comme les expressions, les grammaires d'arbres et les chemins réguliers. Ces contraintes sont utilisées dans les modèles de contenu des types (XML Schemas) pour imposer des bornes sur le nombre d'occurrences de noeuds. Dans les langages de requêtes (XPath, XQuery), ces contraintes permettent de sélectionner les noeuds ayant un nombre limité de noeuds accessibles par une expression de chemin donnée. Les types et chemins étendus avec les contraintes de comptage constituent le prolongement naturel de leurs homologues sans comptage déjà considérés comme des constructions fondamentales dans les langages de programmation et les systèmes de type pour XML. Un des défis majeurs en programmation XML consiste à développer des techniques automatisées permettant d'assurer statiquement un typage correct et des optimisations de programmes manipulant les données XML. À cette fin, il est nécessaire de résoudre certaines tâches de raisonnement qui impliquent des constructions telles que les types et les expressions XPath avec des contraintes de comptage. Dans un futur proche, les compilateurs de programmes XML devront résoudre des problèmes de base tels que le sous-typage afin de s'assurer au moment de la compilation qu'un programme ne pourra jamais générer de documents non valides à l'exécution. Cette thèse étudie les logiques capables d'exprimer des contraintes de comptage sur les structures d'arbres. Il a été montré récemment que le μ-calcul sur les graphes, lorsqu'il est étendu à des contraintes de comptage portant exclusivement sur les noeuds successeurs immédiats est indécidable. Dans cette thèse, nous montrons que, sur les arbres finis, la logique avec contraintes de comptage est décidable en temps exponentiel. En outre, cette logique fournit des opérateurs de comptage selon des chemins plus généraux. En effet, la logique peut exprimer des contraintes numériques sur le nombre de noeuds descendants ou même ascendants. Nous présentons également des traductions linéaires d'expressions XPath et de types XML comportant des contraintes de comptage dans la logique.

A number of previous investigations have suggested that schema learning would be more readily facilitated by a recognition task than a reproduction task due to the increased memory requirement of the reproduction task. Differential memory requirements of 0, 4, 8, 16 and 32 seconds were imposed on 50 Ss in a recognition task to determine if increased memory requirements improved schema learning in the same mode as the reproduction task. The results indicated no significant improvement in schema learning with increased memory requirement. The data does suggest negative transfer from reproduction to recognition task. Recommendations for design and procedural improvements are included.

There have been a number of different versioning models proposed. The research in this area can be divided into two categories: object versioning and schema versioning. In this dissertation, both problem domains are considered as a single unit. This dissertation describes a unifying version model (UVM) for maintaining changes to both objects and schema. UVM handles schema versioning operations by using object versioning techniques. The result is that the UVM allows the OODBMS to be much smaller than previous systems. Also, programmers need know only one set of versioning operations; thus, reducing the learning time by half. This dissertation shows that UVM is a simple but semantically sound and powerful version model for both objects and schema.

Exposure to community violence is a pervasive problem among urban youth and has been associated with both internalizing and externalizing disorders. The mechanisms through which exposure to community violence impacts adolescent adjustment are unclear. A change in adolescent schemas has been proposed as a mechanism through which the impact occurs. The goals of this study were to develop a measure of relevant adolescent schemas and examine their relation to exposure to community violence. A sample of 320 5th and 8th graders were assessed and confirmatory factor analyses of the measure supported a three factor model, including self-schemas, world schemas and use of violence schemas. Exposure to community violence, including victimization and witnessing violence, was associated with more negative adolescent schemas. Witnessing violence and victimization had distinct relations with schemas highlighting the need to examine these types of exposure independently. Overall, this study provides preliminary support for the importance of studying adolescent schemas within the context of community violence. The measure developed represents an initial step in this process given what is available in the literature. However, additional work on the measure is needed to ensure that it accurately samples the schema domains that are relevant for youth in this context.