The effects of domain-specific avoid and prove goal orientations on performance: A multilevel analysis

Recently, goal orientation, a mental framework for understanding how individuals approach learning and achievement situadons, has emerged as an important predictor of performance. This study addressed the effects of domain-specific avoid and prove orientations on performance from the betweenand within-person levels of analysis. One hundred and three participants performed thirty trials of an airtraffic control task. Domain-specific avoid and prove orientations were measured before each trial to assess the effects of changes in goal orientadon on changes in performance (i.e. within-person relationships). Average levels of avoid and prove orientations were calculated to assess the effect of goal orientation on overall performance (i.e. between-person relationships). Findings from the between-person level of analysis revealed that high prove-orientated individuals performed better than low proveorientated individuals. Results also revealed that average goal orientation levels moderated the withinperson relationships. The effect of changes in avoid orientation on changes in performance was stronger for low versus high avoid-oriented individuals while the effect of changes in prove orientadon on changes in performances was stronger for low versus highprove oriented individuals. Implications of these findings are considered.

Concept-based document readability in domain specific information retrieval

Domain specific information retrieval has become in demand. Not only domain experts, but also average non-expert users are interested in searching domain specific (e.g., medical and health) information from online resources. However, a typical problem to average users is that the search results are always a mixture of documents with different levels of readability. Non-expert users may want to see documents with higher readability on the top of the list. Consequently the search results need to be re-ranked in a descending order of readability. It is often not practical for domain experts to manually label the readability of documents for large databases. Computational models of readability needs to be investigated. However, traditional readability formulas are designed for general purpose text and insufficient to deal with technical materials for domain specific information retrieval. More advanced algorithms such as textual coherence model are computationally expensive for re-ranking a large number of retrieved documents. In this paper, we propose an effective and computationally tractable concept-based model of text readability. In addition to textual genres of a document, our model also takes into account domain specific knowledge, i.e., how the domain-specific concepts contained in the document affect the document’s readability. Three major readability formulas are proposed and applied to health and medical information retrieval. Experimental results show that our proposed readability formulas lead to remarkable improvements in terms of correlation with users’ readability ratings over four traditional readability measures.

The real-time refinement calculus: A foundation for machine-independent real-time programming

The real-time refinement calculus is an extension of the standard refinement calculus in which programs are developed from a precondition plus post-condition style of specification. In addition to adapting standard refinement rules to be valid in the real-time context, specific rules are required for the timing constructs such as delays and deadlines. Because many real-time programs may be nonterminating, a further extension is to allow nonterminating repetitions. A real-time specification constrains not only what values should be output, but when they should be output. Hence for a program to implement such a specification, it must guarantee to output values by the specified times. With standard programming languages such guarantees cannot be made without taking into account the timing characteristics of the implementation of the program on a particular machine. To avoid having to consider such details during the refinement process, we have extended our real-time programming language with a deadline command. The deadline command takes no time to execute and always guarantees to meet the specified time; if the deadline has already passed the deadline command is infeasible (miraculous in Dijkstra's terminology). When such a realtime program is compiled for a particular machine, one needs to ensure that all execution paths leading to a deadline are guaranteed to reach it by the specified time. We consider this checking as part of an extended compilation phase. The addition of the deadline command restores for the real-time language the advantage of machine independence enjoyed by non-real-time programming languages.

Formal methods within a totally functional approach to programming

Taking functional programming to its extremities in search of simplicity still requires integration with other development (e.g. formal) methods. Induction is the key to deriving and verifying functional programs, but can be simplified through packaging proofs with functions, particularly folds, on data (structures). Totally Functional Programming avoids the complexities of interpretation by directly representing data (structures) as platonic combinators - the functions characteristic to the data. The link between the two simplifications is that platonic combinators are a kind of partially-applied fold, which means that platonic combinators inherit fold-theoretic properties, but with some apparent simplifications due to the platonic combinator representation. However, despite observable behaviour within functional programming that suggests that TFP is widely-applicable, significant work remains before TFP as such could be widely adopted.

MDA-based re-engineering with Object-Z

This paper describes a practical application of MDA and reverse engineering based on a domain-specific modelling language. A well defined metamodel of a domain-specific language is useful for verification and validation of associated tools. We apply this approach to SIFA, a security analysis tool. SIFA has evolved as requirements have changed, and it has no metamodel. Hence, testing SIFA’s correctness is difficult. We introduce a formal metamodelling approach to develop a well-defined metamodel of the domain. Initially, we develop a domain model in EMF by reverse engineering the SIFA implementation. Then we transform EMF to Object-Z using model transformation. Finally, we complete the Object-Z model by specifying system behavior. The outcome is a well-defined metamodel that precisely describes the domain and the security properties that it analyses. It also provides a reliable basis for testing the current SIFA implementation and forward engineering its successor.

Multi-threading and message communication in Qu-Prolog

This paper presents the multi-threading and internet message communication capabilities of Qu-Prolog. Message addresses are symbolic and the communications package provides high-level support that completely hides details of IP addresses and port numbers as well as the underlying TCP/IP transport layer. The combination of the multi-threads and the high level inter-thread message communications provide simple, powerful support for implementing internet distributed intelligent applications.

Protein targeting to the plasma membrane of adult skeletal muscle fiber: An organized mosaic of functional domains

The plasma membrane of differentiated skeletal muscle fibers comprises the sarcolemma, the transverse (T) tubule network, and the neuromuscular and muscle-tendon junctions. We analyzed the organization of these domains in relation to defined surface markers, beta -dystroglycan, dystrophin, and caveolin-3, These markers were shown to exhibit highly organized arrays along the length of the fiber. Caveolin-3 and beta -dystroglycan/dystrophin showed distinct, but to some extent overlapping, labeling patterns and both markers left transverse tubule openings clear. This labeling pattern revealed microdomains over the entire plasma membrane with the exception of the neuromuscular and muscle-tendon junctions which formed distinct demarcated macrodomains. Our results suggest that the entire plasma membrane of mature muscle comprises a mosaic of T tubule domains together with sareolemmal caveolae and beta -dystroglycan domains. The domains identified with these markers were examined with respect to targeting of viral proteins and other expressed domain-specific markers, We found that each marker protein was targeted to distinct microdomains, The macrodomains were intensely labeled with all our markers. Replacing the cytoplasmic tail of the vesicular stomatitis virus glycoprotein with that of CD4 resulted in retargeting from one domain to another. The domain-specific protein distribution at the muscle cell surface may be generated by targeting pathways requiring specific sorting information but this trafficking is different from the conventional apical-basolateral division. (C) 2001 Academic Press.

Agents as multi-threaded logical objects

In this paper we describe a distributed object oriented logic programming language in which an object is a collection of threads deductively accessing and updating a shared logic program. The key features of the language, such as static and dynamic object methods and multiple inheritance, are illustrated through a series of small examples. We show how we can implement object servers, allowing remote spawning of objects, which we can use as staging posts for mobile agents. We give as an example an information gathering mobile agent that can be queried about the information it has so far gathered whilst it is gathering new information. Finally we define a class of co-operative reasoning agents that can do resource bounded inference for full first order predicate logic, handling multiple queries and information updates concurrently. We believe that the combination of the concurrent OO and the LP programming paradigms produces a powerful tool for quickly implementing rational multi-agent applications on the internet.

Hodgkin's lymphoma cell lines express a fusion protein encoded by intergenically spliced mRNA for the multilectin receptor DEC-205 (CD205) and a novel C-type lectin receptor DCL-1

Classic Hodgkin's lymphoma (HL) tissue contains a small population of morphologically distinct malignant cells called Hodgkin and Reed-Sternberg (HRS) cells, associated with the development of HL. Using 3'-rapid amplification of cDNA ends ( RACE) we identified an alternative mRNA for the DEC-205 multilectin receptor in the HRS cell line L428. Sequence analysis revealed that the mRNA encodes a fusion protein between DEC-205 and a novel C-type lectin DCL-1. Although the 7.5-kb DEC-205 and 4.2-kb DCL-1 mRNA were expressed independently in myeloid and B lymphoid cell lines, the DEC-205/DCL-1 fusion mRNA (9.5 kb) predominated in the HRS cell lines ( L428, KM-H2, and HDLM-2). The DEC-205 and DCL-1 genes comprising 35 and 6 exons, respectively, are juxtaposed on chromosome band 2q24 and separated by only 5.4 kb. We determined the DCL-1 transcription initiation site within the intervening sequence by 5'-RACE, confirming that DCL-1 is an independent gene. Two DEC-205/DCL-1 fusion mRNA variants may result from cotranscription of DEC-205 and DCL-1, followed by splicing DEC-205 exon 35 or 34-35 along with DCL-1 exon 1. The resulting reading frames encode the DEC-205 ectodomain plus the DCL-1 ectodomain, the transmembrane, and the cytoplasmic domain. Using DCL-1 cytoplasmic domain-specific polyclonal and DEC-205 monoclonal antibodies for immunoprecipitation/Western blot analysis, we showed that the fusion mRNA is translated into a DEC-205/DCL-1 fusion protein, expressed in the HRS cell lines. These results imply an unusual transcriptional control mechanism in HRS cells, which cotranscribe an mRNA containing DEC-205 and DCL-1 prior to generating the intergenically spliced mRNA to produce a DEC-205/DCL-1 fusion protein.

The application of cognitive orientation to daily occupational performance (CO-OP) with children 5-7 years with developmental coordination disorder

There has been an increase in the use of cognitive frameworks in occupational therapy with children with developmental coordination disorder (DCD). Investigations into the utility of one such cognitive approach, namely Cognitive Orientation to (daily) Occupational Performance (CO-OP), with children with DCD have shown the intervention to be effective with children over 7 years. However, there has been limited research into its utility with younger children. This paper presents two case studies to demonstrate the use of CO-OP with children aged 5-7 years. Two boys with DCD engaged in 10 sessions of CO-OP. These younger children were found to be able to use the global framework (Goal, Plan, Do, Check) to improve their task performance, to develop plans using domain-specific strategies and to engage in checking strategies. Issues relating to attention, motivation and goal setting are discussed in the context of the two case studies.

Fitness assessment of document model

Document classification is a supervised machine learning process, where predefined category labels are assigned to documents based on the hypothesis derived from training set of labelled documents. Documents cannot be directly interpreted by a computer system unless they have been modelled as a collection of computable features. Rogati and Yang [M. Rogati and Y. Yang, Resource selection for domain-specific cross-lingual IR, in SIGIR 2004: Proceedings of the 27th annual international conference on Research and Development in Information Retrieval, ACM Press, Sheffied: United Kingdom, pp. 154-161.] pointed out that the effectiveness of document classification system may vary in different domains. This implies that the quality of document model contributes to the effectiveness of document classification. Conventionally, model evaluation is accomplished by comparing the effectiveness scores of classifiers on model candidates. However, this kind of evaluation methods may encounter either under-fitting or over-fitting problems, because the effectiveness scores are restricted by the learning capacities of classifiers. We propose a model fitness evaluation method to determine whether a model is sufficient to distinguish positive and negative instances while still competent to provide satisfactory effectiveness with a small feature subset. Our experiments demonstrated how the fitness of models are assessed. The results of our work contribute to the researches of feature selection, dimensionality reduction and document classification.