A conceptualization of intended learning outcomes supporting self‐regulated learners in indicating learning paths

Intended learning outcomes (ILOs) indicate what learners will be able to achieve after they are taught. Traditionally, ILOs are expressed as plain text or unstructured documents. What if all ILOs of a specific course of study can be conceptualized through a structured diagrammatic technique? It was hypothesized that learners can benefit from this conceptualization in learning, especially in self‐regulated learning. The aim of this study was to investigate whether the ILOs represented in unstructured or structured formats can facilitate learners to identify learning paths. The results revealed that the mean ratings of all learning paths were statistically significantly higher with structured ILOs.     

p53 gene therapy in vivo of herpatocellular and liver metastatic colorectal cancer

Tumor suppressor genes such as p53 contribute to the oncogenic process via loss-of-function mechanisms such as genetic mutation or complex formation with other cellular or viral proteins. p53 is mutated in approximately 50% of human tumors and has an important role in the genesis or progression of both colorectal and hepatocellular cancers. Colorectal cancer is leading cause of cancer mortality in the United States, whereas hepatocellular cancer is the leading worldwide cause of cancer death; the liver is a primary site of morbidity in both diseases. Because systemic tumor suppressor gene therapy is currently not feasible, we have chosen to develop a regional form of such therapy directed at primary or metastatic liver neoplasms. Gene replacement therapy with p53 is a promising new strategy to treat advanced human cancers.     

Powers of observation in creative design

Being perceptive is a trait highly valued in scientific and engineering professions. What a scientist or engineer notices while considering a problem, evaluating alternatives, or interpreting data has a profound impact on how a problem is viewed and solved. This paper focuses on processes we believe underlie being perceptive: firstly, preparation—becoming attuned to salient or important features; secondly, assimilation-detection and exploration of patterns (invariants) as well as anomalies; and thirdly, strategic control-heuristic strategies for exploring the implications of what has been observed. These processes play an integral role in characteristic activities within creative design, including problem reformulation, the emergence of properties and constraints on the solution, and the ability to incorporate into the design experimental feedback from the environment and from experiences with prototypes and previous designs. The paper presents a computational model incorporating these ideas, implemented in a system called IMPROVISER.     

Another nail in the coffin of the multiple-origins theory?

While mitochondrial sequences can be used to probe the time and place of the mitochondrial 'Eve,' nuclear genes can be used to ask a slightly different question: when did humans (members of the genus Homo) or their hominid precursors (the hominids) first leave Africa and fan out over Asia and Europe? If they did so recently, it seems likely that there was a recent African origin of our species, Homo sapiens, rather than multiple origins in various parts of the Old World. A recent paper uses minisatellite data to make the argument that the departure from Africa happened very recently indeed. An alternative explanation for the data is that there was no single and irreversible departure from Africa, but that some peoples migrated back and forth between Africa and the rest of the Old World over the last few tens of thousands of years. For this and other reasons, putting a single date on the farewell to Africa remains problematical.     

A Framework for Interactive t-SNE Clustering

In this paper, we describe our progress in creating the framework for an interactive application that allows humans to actively participate in a t-SNE clustering process. t-SNE (t-Distributed Stochastic Neighbor Embedding) is a dimensionality reduction technique that maps high dimensional data sets to lower dimensions that can then be visualized for human interpretation. By prompting users to monitor outlying points during the t-SNE clustering process, we hypothesize that users may be able to make clustering faster and more accurate than purely algorithmic methods. Further research would test these hypotheses directly. We would also attempt to decrease the lag time between the various components of our application and develop an intuitive approach for humans to aid in clustering unlabeled data. Research into human assisted clustering can combine the strengths of both humans and computer programs to improve the results of data analysis.     

Multilayer background modeling under occlusions

A multilayer background modeling technique is presented for video surveillance. Rather than simply classifying all features in a scene as either dynamically moving foreground or long-lasting, stationary background, a temporal model is used to place each scene object in time relative to each other. Foreground objects that become stationary are registered as layers on top of the background layer. In this process of layer formation, the algorithm deals with ”fake objects” created by moved background, and noise created by dynamic background and moving foreground objects. Objects that leave the scene are removed based on the occlusion reasoning among layers. The technique allows us to understand and visualize a scene with multiple objects entering, leaving, and occluding each other at different points in time. This scene understanding leads to a richer representation of temporal scene events than traditional foreground/background segmentation. The technique builds on a low-cost background modeling technique that makes it suitable for embedded, real-time platforms.     

The days ahead

How are government controls affecting healthcare foodservices?Are growing elderly & outpatient populations changing foodservices' missions. What are the hottest trends? As members of the American Society for Hospital Food Service Administrators prepared for their annual meeting in Orlando, FM queried 11 Southeastern directors to learn their most pressing concerns & how they are positioning their departments for the future.     

In-line holographic electron microscopy in the presence of external magnetic fields

It is now a well-known fact that the phase of electron waves is altered by external magnetic fields via the Aharonov-Bohm effect. This implies that any electron interference effects will be to some degree affected by the presence of such fields. In this study we examine the distortion effects of external (constant and variable) magnetic fields on electron interference and holography. For digital holography, the reconstruction of the object is done via numerical calculations and this leaves the door open for correcting phase distortions in the hologram reconstruction. We design and quantitatively assess such correction schemes, which decidedly depend on our knowledge of the magnetic field values in the holographic recording process. For constant fields of known value we are able to correct for magnetic distortions to a great extent. We find that variable fields are more destructive to the holographic process than constant fields. We define two criteria, related respectively to global and local contrast of the hologram to establish the maximum allowed external field which does not significantly hinder the accuracy of in-line holographic microscopy with electrons.     

On the complexity of deciding avoidability of sets of partial words

Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k≥2, is NP-hard [F. Blanchet-Sadri, R. Jungers, J. Palumbo, Testing avoidability on sets of partial words is hard, Theoret. Comput. Sci. 410 (2009) 968-972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are NP-hard, others are shown to be efficiently decidable. Using some combinatorial properties of de Bruijn graphs, we establish a correspondence between lengths of cycles in such graphs and periods of avoiding words, resulting in a tight bound for periods of avoiding words. We also prove that Avoidability can be solved in polynomial space, and reduces in polynomial time to the problem of deciding the avoidability of a finite set of partial words of equal length over the binary alphabet. We give a polynomial bound on the period of an infinite avoiding word, in the case of sets of full words, in terms of two parameters: the length and the number of words in the set. We give a polynomial space algorithm to decide if a finite set of partial words is avoided by a non-ultimately periodic infinite word. The same algorithm also decides if the number of words of length n avoiding a given finite set of partial words grows polynomially or exponentially with n.