Miracle-dz/UniFAR-FTUs huggingface dataset:
A safe and efficient machine-independent code transportation format based on static single assignment form and applied to just-in-time compilation

The Java Virtual Machine and Microsoft's . NET runtime provide dynamically extensible machine-independent platforms in which untrusted mobile code can be executed in a safe sandboxed environment. This is achieved by using type safe program formats based on stack-oriented virtual machines and verifying them using iterative data-flow analysis. While much research and engineering effort has gone into using just-in-time (JIT) compilation in order to efficiently execute programs in these stack-oriented program representations, comparatively little has gone into considering alternatives to stack-oriented virtual machines that might be more amenable to JIT compilation. Because it eases data-flow analysis, Static Single Assignment Form (SSA) is commonly used in optimizing compilers, and it seemed likely that its use in a code transportation format would also facilitate JIT compilation and type checking. This dissertation explores the potential of compiler-friendly mobile code formats based on SSA, and presents the SafeTSA program representation as a proof of this concept. In addition to using SSA in order to facilitate JIT compilation, SafeTSA adopts a novel approach to safety that replaces verification by using an encoding in which it is impossible to encode programs violating certain system properties, including type safety, and which also reduces program sizes. A substantial implementation effort was undertaken in order to assess the feasibility and evaluate the performance of SSA-based virtual execution environments. This effort included the construction of a front-end compiler (that translates Java source programs to a human readable variant of SafeTSA), a binary SafeTSA encoder (that encodes programs in SafeTSA's inherently safe on-the-wire format), a SafeTSA JIT compiler (that was integrated into the Jikes Research Virtual Machine enabling the execution of SafeTSA programs), and an interpreter for a simple SSA-based representation. The reported experimental results suggest that SSA-based program representations can be stored and transmitted using a space efficient encoding, can speedup JIT compilation reducing total execution time, and can be executed by reasonably efficient interpreters.
Virtex-II Pro and Virtex-II Pro X Platform FPGAs: Complete data sheet

The circular knitting machine comprises at least one sinking cam and one movable cam enabling a selection of knitting elements to occupy several positions. The sinking cam is rotatably biased into a working position in which its working ramp cooperates with the butts of the knitting elements selected for knitting and can be moved to a rest position in which the working ramp cooperates with the knitting elements which are welting. The sinking cam is held in its rest position by a surface thereon which engageingly cooperates with a locking means on the movable cam when the movable cam is in a position to cause the knitting elements to welt.
"The Reference Architecture Representation Environment (RARE) Systematic Derivation of Object-Oriented Systems"

The use of object-oriented (OO) methodologies for software design has become increasingly popular in the last ten years. OO is perceived as providing many benefits, including reusability, modularity, avoidance of duplication, reliability, flexibility for expansion, and portability. To reap these benefits, careful attention must be paid to define a set of objects which sufficiently model the respective domain and satisfy the goals of the design effort, including a focus on one or more of the OO benefits. While many methodologies and tools are available to support the OO modeling notation and programming, little guidance is offered for object derivation from domain information and construction of object models satisfying modularity metrics. This research seeks to define a process and develop a supporting tool to guide the designer in deriving objects from domain information to produce a quality object model with tractable rationale to original requirements. As part of a prior phase in the lifecycle, domain information will be represented in a Domain Model merged from information elicited from a variety of domain experts. The tool will aid in the design and evaluation of an object model by systematically applying established OO design heuristics and quality metrics as well as completeness and consistency checks against the Domain Model.
Playing Video Games in Japanese: Motivation, Language Learning, and Navigation

This qualitative study explores the phenomenon of people who play Japanese video games but neither read, speak, nor understand Japanese. The research questions include: What motivates people to play a video game in a language they do not understand? What do people learn from playing games in a language they do not understand? How do they navigate the game without being able to understand the language? In the study, three participants were observed playing the Japanese action role-playing game Tales of Rebirth first released in 2004 for the PlayStation 2 and then interviewed about their experiences. Data was summarized and then analyzed using a three-level approach based on grounded theory. The study showed that the participants played Japanese games due to the lack of comparable games in their native language. They were motivated by in-game rewards and may have been conditioned to succeed in the games through years of playing video games at home in their native languages. The participants learned little if any Japanese from playing these games; they could play the game and succeed at it without knowledge of the language. Participants leveraged prior experience with games to navigate through games in the absence of language because the gameplay was linear. Participants used trial and error as well as icon and character recognition to navigate the game. Although participants did not learn Japanese vocabulary, the evidence suggests they learned other skills, such as computer literacy and Japanese character recognition.
Rational or associative? Imitation in Japanese quail

Much contemporary psychology assumes a fundamental distinction between associative explanations of animal behaviour, in term of unthinking ‘conditioned responses’, and rational explanations, which credit animals with relevant ‘knowledge’ or ‘understanding’ or ‘concepts’. This paper argues that this dichotomy is both unclear and methodologically unhelpful, serving only to distract attention from serious questions about which cognitive abilities are present in which animals. We illustrate the issues by considering recent experimental work on imitation in Japanese quail.
Modeling Dynamical Systems with Structured Predictive State Representations

ed when using option-level histories instead of primitive-level histories. Just as option histories are an abstraction of primitive histories, option tests are an abstraction of primitive tests. Definition 4.2. An option test is a sequence of options and observations ωo . ωo, where the observations in the test correspond to the last observation of each option. I define a prediction for an option test t def =ωo . ωo from an option history h similar to a primitive prediction: the probability that o, . , o are the last observations, respectively, of the options ω, . , ω taken from option history h. Option Predictions in Terms of Primitive Predictions In order to prove that one can build a linear PSR model of a system at an option level, it is important to relate option predictions to primitive predictions. I relate an option-level prediction p(t|h) to primitive-level predictions by conditioning upon the primitive sequences that underlie the option history and summing over all possible primitive sequences that underlie the option test. To write an expression for the option prediction p(t|h), let Pr(h = h|h) be the probability that h is the primitive history that underlies h, and let Pr(t ∧ t|h, π(t)) be the probability that both t and t concurrently succeed in the same number of time steps following h, given the policies π(t) of the option test t. Then p(t|h) = ∑ h,t Pr(h = h|h)Pr(t ∧ t|h, π(t)) where the sum is over all primitive histories h and all primitive tests t. Because the primitive sequences corresponding to a given option history or test could have different lengths, different action sequences, and different observation sequences, the formal relationship between option-level predictions and primitivelevel predictions is somewhat tedious. For an intuitive understanding of the HPSR,
Safe and Efficient Persistent Heaps.

Abstract Persistentdatacontinueto existaftertheprogramsthat createormanipulate themterminate.Files and database records are familiar examples, but they only allow speciﬁ c datatypesto be made persistent. Object-oriented databases and persistent programming languagesare examples of systems that require arbitrary persistent datatypes. Persistent heaps allowarbitrary persistent datatypes to be dynamically allocated and stored and are essentialcomponents of such systems.Data stored in persistent heaps are valuable, and must be protected from both machinefailures and programmer errors. This safety requirement may conﬂict with the need toprovide high throughput and low latency access to the data. This conﬂict may lead tosacriﬁcing safety for performance.My thesis is that it is possible to build persistent heaps so that safety does not needto be sacriﬁced for performance. This dissertation demonstrates the thesi s in two parts:Part I presents the design of Sidney, a safe persistent heap, along with the details of itsimplementation,andPartIIpresentsaperformanceevaluationthatdemonstratesthatSidneysatisﬁes the claim of the thesis.Sidney's design uses transactions and garbage collection to provide safe heap manage-ment of persistent data. Good performance is achieved by combining traditional systemstechniquesfortransactionswithanovelconcurrentgarbagecollectiontechnique,replicatingcollection.Sidney's implementation is the ﬁrst to provide concurrent collection of a transactionalheap. Replicating collection allows a much simpler implementation than previous (unim-plemented) designs based on other concurrent collection techniques.The performance evaluation characterizes Sidney's performance and compares it toother approaches, including a persistent malloc-and-free implementation. It shows thatreplicatingcollectionallowstheuse ofgarbagecollectionwithoutsacriﬁci ngthethroughputandlatencycharacteristics ofexplicitdeallocation. Infact, notonlydoes theSidneyprovidebetter safety than persistent malloc-and-free, it also provides better performance.xi
Desktop Data Analysis SYSTAT

From the Publisher: Co-authored by the developer of SYSTAT, Leland Wilkinson, Desktop Data Analysis with SYSTAT is useful to everyone from students with no more than a single statistics course to experienced researchers who need to know how to run SYSTAT to solve substantive problems. Desktop Data Analysis with SYSTAT offers a thorough introduction to using good statistical tools, both exploratory and confirmatory, to solve real statistical problems. Real data examples are used everywhere to motivate and prepare the reader for answering statistical questions in a research, business, or educational environment. Datasets are drawn from areas as diverse as anthropology, agriculture, criminal justice, economics, marketing, sociology, medicine, psychology, and ecology. A highlight of the book is its extensive use of graphics and unique tutorial on constructing statistical graphs. Desktop Data Analysis with SYSTAT may be used with SYSTAT 6.0 or other comprehensive statistics packages.
From Flat to Hierarchical: Modeling Structures in Visual Recognition

Visual recognition is a fundamental problem in computer vision. It is significant to many applications such as surveillance, security, entertainment and health care. We have observed tremendous growth in visual recognition over the past decade. However, it remains a challenging problem for computers. One of the main reasons is the clear gap between human descriptions of the visual world and the output of the current visual recognition system. The semantic space humans used to describe the visual world is highly structural besides naming an object (action), human would additionally describe it in multiple levels of detail, ranging from the fine-grained descriptions (e.g. color, shape) to the higher-level relationships among multiple objects (actions). How to represent and learn the rich structures in the visual data is the focus of this dissertation. We address two fundamental problems in visual recognition: understanding human activities and understanding images. For solving both problems, we start with flat structures and move towards richer hierarchical structures: First, we develop figure-centric models for joint action recognition and localization that capture the spatial-temporal arrangements of an action over video sequences. Then, we propose hierarchical models for recognizing multi-person activities in entire scenes. Multiple levels of detail including actions, social roles and a scene-level event are encoded in a unified learning framework. For understanding images, we follow the same route by first developing flat models to capture the spatial structures in object queries for image retrieval, and then move towards hierarchical models to handle more complex multi-level semantic labelings for object detection. This dissertation contributes to visual recognition by learning structured models, and in particular, hierarchical models for multi-level activity recognition and object detection. The work presented in this dissertation attempts to provide insights into several critical and yet open questions in visual recognition: How to label a visual entity (action, object, scene)? How many levels of detail should we consider? How should a recognition problem be represented? How to model the complex structures? What is the desirable output of a recognition system?
The Constructivist Learning Environment Scorecard: A Tool to Characterize Online Learning

Over the past five years, the number of individuals engaging in online learning as well as the number of online course offering has grown exponentially. At the same time, outcome research on online learning design is sparse. This paper describes the development of a constructivist learning environment scorecard and explores its usefulness in characterizing and comparing online learning courses and subsequently learning outcomes.
Validation of some Ensemble Flow Congestion Management Control Algorithms

In a current Internet end system the congestion and ﬂow control of data streams is done individually and separately for all data streams. Some of the data streams of an end system might be connected to the same remote end system or to remote end systems in the same subnetwork. These data streams form a (data stream) set. It is beneﬁcial terms of improving the overall performance, i.e., throughput and fairness, to establish a common congestion control between data streams of a data stream set to continuously share network information between them. These jointly controlled data streams are then combined into a (data stream) ensemble. In [6], we described one such common congestion controller for TCP connections, called ensemble ﬂow congestion management (EFCM) and show its performance beneﬁts. An open question remained concerning the “aggressiveness” of this controller: Where the performance beneﬁts obtained by simply putting more packets onto the network than a corresponding set of TCP connections would do — in essence, by violating congestion control principle? In this technical report, we consider the algorithms of the current EFCM controller in more detail and show that these algorithms are accurately chosen in terms of aggressiveness to the network. More precisely, we use the current aggregated congestion window size and the current aggregated slow start threshold of an ensemble of (cid:0) EFCM-controlled TCP connections and compare it with the aggregated congestion window size and the aggregated slow start threshold of a virtual ensemble of (cid:0) standard TCP connections. We then analytically validate that under certain assumptions EFCM-controlled and standard TCP connections have nearly the same aggregated congestion window size and nearly the same aggregated slow start threshold, i.e., both controllers allow nearly the same overall number of outstanding TCP segments for their TCP connections at any time. Therefore, EFCM-controlled TCP connections are nearly as aggressive to the network as standard TCP connections.
Analyzing the impact of Web -based geometry applets on first grade students

This study investigated the impact of web-based geometry applets on first grade students' academic achievement as well as on student attitudes, behaviors, and interactions. The applets were created or reviewed as part of the MarcoPolo Education Foundation. Thirty-one students were randomly assigned. Both groups studied identical objectives, but the treatment group used applets for practice unless a corresponding applet was not available. A pretest and posttest at both the first and second grade levels was conducted, as well as four mini-tests to investigate the impact of individual applets. The pretests showed that the treatment group began lower than the control group, and at a significantly lower level (p < 0.05) on the first grade test. Posttest results showed that the treatment group outscored the control group on both grade level tests, though not at a significant level (p > 0.05). The treatment group had significant improvements (p < 0.05) on both grade level tests, while the control group only had significant improvements (p < 0.05) on the second grade level test. The treatment group teacher recorded her daily thoughts regarding the applets and observations regarding student attitudes, behaviors, and interactions. She reported increased instructional time, repetition of practice activities, time-on-task, and feedback. She noted that students showed increased motivation and challenged themselves to higher levels. ACKNOWLEDGEMENTS I wish to acknowledge the many people who helped me along the path of this project. Thank you to the members of my doctoral committee: Dr. A huge thank-you to the study participants: the students, parents/guardians, classroom teachers, and principal. This study could not have happened without your amazing support and dedication. Special thanks to Apple Computer, the University of Nebraska, the Leadership Talks Technology Academy, and Lincoln Public Schools for providing all the necessary technology equipment. Thanks also to Utah State University for providing CD's of their applets. I want to recognize two of my role models of lifelong learning and teaching. degree at the age of seventy-two and served as a pastor and teacher his entire career. Second, my mother, Rietz Hannemann, who showed me how rewarding and enjoyable teaching is, and who provided encouragement throughout this project. Thank-you to my wife, Juli, and my daughter, Faith. Your support and love make anything possible. By the way, you can use the computer now… Finally, thank-you to my mentor Dr. David Brooks. I admire and appreciate your dedication to your students. Thanks for …
On linear transformations

The purpose of this paper is to give a characterization of linear and completely continuous transformations both on the common Banach spaces to an arbitrary Banach space and vice versa. There is an abundant literature on this subject. Among the earliest papers, the now famous paper of Radon [241 should be mentioned. Here linear transformations on LP to Lq (1 <p, q< oc) are characterized in a manner suggestive of the methods used in the present paper. The works of Gelfand [12], Dunford [6], Kantorovitch and Vulich [17], and Dunford and Pettis [9] contain much material on this subject supplementary to that treated here. In the interest of completeness we have restated a few of the results obtained by Gelfand [12 ], and Gowurin [13 ]. The principal tools used in our characterizations are certain abstractly valued function spaces. One such space is the class of all additive set functions x(r) on all Lebesgue measurable subsets r of (0, 1) to a Banach space X where for all linear functionals x on X and for all subdivisions 7r=` (Irl, T2, , *r ) of (0, 1) into disjoint sets,
Euan Uglow: The Complete Paintings

244pp This book is a catalogue raisonne in which the author (Lampert) has inspected some 400 works over a six year period, beginning with interviews with the artist in the last four months of his life. Lampert has also written the principle essay (a second one is by the art historian Richard Kendall) reassessing his contribution to British painting in the late 20th century.
A Review of E-Technologies: Challenges and Opportunities for Teaching and Learning Online

The number of different e-learning technologies available to support teaching and learning is growing exponentially. A major issue for faculty and educational developers is to determine which e-learning technology is most appropriate to support their particular style of teaching and the optimum learning outcomes for students. The decision to use a particular technology should be based on sound research and clear evidence. Over the last few years a vast amount of literature has been published on e-learning technologies and how they are used in education. This paper reviews many of these e-learning technologies and provides information regarding their use and the opportunities afforded by them.