Miracle-dz/UniFAR-FTUs huggingface dataset:
Characteristics of Criticized Objects in Critiques of Comprehensive Works of Art: Quantitative analysis of Movie and Theater Critiques

The purpose of this research is to build a basis for scientific analysis of critiques, by utilizing quantitative analysis for objects of critiques. Critiques about movie and theater, which are total work of arts, were selected as target, and nouns which related to objects of criticisms were extracted. Extracted words were categorized in 30 categories, and through chi-square test, evaluated elements of movie and theater were analyzed. Though there are concentrated descriptions about some individual in movie, there are characteristics of distributed descriptions in theater. Also in order to reveal relationships of those categories, those categories were analyzed using factor analysis. As a result, the differences of nuances about "director" and "acting" in movie and theater were extracted. At last, n-gram analysis is applied to extract serial patterns of categories. N-gram analysis revealed that core elements of critique logic were "story" in case of movie, but those elements were "acting" in case of theater.
Constrained Optimization Evolutionary Algorithms

Constrained optimization problems (COPs) are mathematical programming problems frequently encountered in the disciplines of science and engineering application. Solving COPs has become an important research area of evolutionary computation in recent years. In this paper, the state-of-the-art of constrained optimization evolutionary algorithms (COEAs) is surveyed from two basic aspects of COEAs (i.e., constraint-handling techniques and evolutionary algorithms). In addition, this paper discusses some important issues of COEAs. More specifically, several typical algorithms are analyzed in detail. Based on the analyses, it concluded that to obtain competitive results, a proper constraint-handling technique needs to be considered in conjunction with an appropriate search algorithm. Finally, the open research issues in this field are also pointed out.
Temporal Transfer of Locomotion Style

Timing plays a key role in expressing the qualitative aspects of a character's motion; that is, conveying emotional state, personality, and character role, all potentially without changing spatial positions. Temporal editing of locomotion style is particularly difficult for a novice animator since observers are not well attuned to the sense of weight and energy displayed through motion timing; and the interface for adjusting timing is far less intuitive to use than that for adjusting pose. In this paper, we propose an editing system that effectively captures the timing variations in an example locomotion set and utilizes them for style transfer from one motion to another via both global and upper‐body timing transfers. The global timing transfer focuses on matching the input motion to the body speed of the selected example motion, while the upper‐body timing transfer propagates the sense of movement flow — succession — through the torso and arms. Our transfer process is based on key times detected from the example set and transferring the relative changes of angle rotation in the upper body joints from a timing source to an input target motion. We demonstrate that our approach is practical in an interactive application such that a set of short locomotion cycles can be applied to generate a longer sequence with continuously varied timings.
[Methodological approaches of clinical studies with targeted therapies].

The development of molecular targeted therapies requires some specific methodological approaches. Dose-limiting toxicities are rare in phase I studies the maximal tolerated dose is rarely established. On the contrary, the biological active dose is often determined as the dose inducing biological effect on the target without significant clinical toxicity. Several designs of phase II are described (selection phase II, randomized phase II, stratified phase II.). All of them are indicated in specific situations. The discontinuation treatment studies and the validation of biomarkers (as surrogate endpoints or as classifiers) are the two main particularities of phase III studies designed for the assessment of molecular targeted therapies.
Design of a Multifunction BVMF Reversible Logic Gate and its Applications

The power dissipation problems which occur in the computational operations of a computer can be avoided by replacing the irreversible structures by reversible structures. The reversible logic gates are used for the construction of important arithmetic and logic units of quantum computers. This has led many researchers to take reversible logic very seriously. In this proposal a new reversible logic gate called BVMF gate is designed which is useful for the realization of multi functions required for building important computational blocks of quantum computers. General Terms Reversible logic circuits, Quantum computers
What Computer Experience to Expect of Technical Writing Students Entering a Computer Classroom: The Case of Purdue Students

Computers in technical writing classes are growing in popularity because professionals increasingly use computers for writing reports and because the computer can aid in producing more visually sophisticated documents. Yet, we do not know what computer experience students bring with them to the computer classroom, a lack of knowledge that makes the task of integrating the computers into the classroom more cumbersome. This article presents the results of a survey of Purdue University students' knowledge of, use of, and attitudes toward computers as they enter the technical writing class. It contrasts the technical students with upper division humanities students and draws conclusions about the documentation requirements and the appropriate computer use goals for the Purdue students surveyed. Finally, suggestions are made about how to use a survey of this type.
Mobile Assisted Game-based Chinese Character Recognition

Abstra ct: This paper reports on the effects of two different dynamic grouping strategies in a mobile-assisted Chinese character learning game. The game application assigns each student a component of a Chinese character through their smartphones and requires them to form groups that can assemble a legitimate Chinese character using the components held by the group members. Sixteen Primary 3 (3 rd grade) students taking Chinese as a second language (L2) class involved in the study. Video-recordings of the game and the transcriptions of focus group interviews were qualitatively analyzed. The study aims to explore the patterns of social interactions during the game, especially on the varied impacts of the two different grouping rules (allowing versus not allowing each student to join more than one group at one time) on the student behaviors and their learning gains.
Helpmate autonomous mobile robot nav-igation system

HelpMate is a mobile robotic materials transport system that performs fetch and carry tasks at Danbury Hospital. It autonomously navigates along the main arteries of the hospital crossing between buildings via interconnecting hallways and uses radio to communicate with the elevator. HelpMate uses sensor information to follow straight paths down hallways and to successfully reach its destination. Also HelpMate has the ability to sense obstacles in its path and plot a course around them. A two part vision system is employed on HelpMate to aid in navigation and obstacle avoidance. One part determines the vehicle''s orientation and position in the hallway by looking at the ceiling lights. The other part uses structured light projecting forward into the immediate path of the robot to detect obstacles. © (1991) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
SIMULATION & ANALYSIS OF EFFICIENT CSFQ OVER REGULAR CSFQ, RED & FRED QUEUING TECHNIQUES USING MATLAB

With the enhanced dependence on internet, the congestion control has emerged as a challenging task. It requires an efficient management of buffers and packet scheduling on a per flow basis. Each router in the network must implement some queuing discipline that governs how packets are buffered while waiting to be transmitted. Active Queue Management (AQM) algorithms have been designed to be able to actively control the average queue length in routers supporting TCP traffic, and thus to be able to prevent congestion and resulting packet loss as much as possible. In this paper, an Efficient CSFQ (Eff-CSFQ) algorithm has been proposed for congestion management, which improves the performance of regular CSFQ. We present simulation and analysis of the performance of Eff-CSFQ as compared to regular CSFQ, RED and FRED queuing algorithms using MATLAB. The parameters for comparison are Packet-Delivery Fraction (PDF), End-End Delay (EED), Throughput (TP), and Network Survival Period (NSP).
Streaming speech and music using bluetooth low energy

The new Bluetooth Low Energy standard has mostly been promoted and used for applications where low data rate is needed. For cases that require more bandwidth, Bluetooth Classic is still the preferred and marketed solution. A typical example is the streaming of music. In view of the popularity of Ble and its physical layer data rate, it is legitimate to investigate its practical throughput limits. To this purpose, we looked at different ways of using Ble transceivers to transmit data as fast as possible. We built a demonstrator that allows us to emulate several frame variations in order to improve the data rate for more demanding systems. The unconventional use of MIC positions for data allows us to be more efficient in transferring data. In this paper we summarize the first results of an on-going work.
A new method for the positioning and matching of shape outlines

Automatic information retrieval in the field of shape recognition has been widely covered by many research fields. Whichever is the way to represent the objects in images, a recognition method should be robust in the presence of scale change, translation and rotation. In this paper a novel approach to find the optimal correspondence between 2D curves using their intrinsic properties is proposed. The method consists of an alignment process to compare two shapes conveniently modeled. To evaluate the effectiveness of the algorithm, two databases of 216 and 99 images have been used. A performance analysis and comparison is provided by precision-recall curves.
Labrune (2012). The phonology of Japanese . (The Phonology of the World's Languages.) Oxford: Oxford University Press. Pp. xiv + 296.

The phonology of Japanese addresses many aspects of Japanese phonology, and its coverage is rather comprehensive. The book assumes basic familiarity with generative phonology, but is written in an accessible way. The book is a welcome contribution to the field, since, as the author mentions (pp. 6–7), there is no recent reference book for Japanese phonology (the classic reference on this topic, Vance 1987, is now out of print; a more recent book, Vance 2008, focuses more on phonetics, primarily designed for English-speaking L2 learners of Japanese). 1 The book will be a very useful reference for anybody who is interested in Japanese phonology, especially for non-experts and non-native speakers of Japanese. One aim of this book is to synthesise the theoretical linguistics approach with traditional grammar, known as kokugogaku. The latter approach is descriptively oriented and has continued to reveal a rich set of data, and as such is of great potential interest to theoretical linguists. However, papers in this tradition are usually written in Japanese and are not widely circulated outside of Japan, and hence are accessible to a small subset of theoretical linguists. The book thus achieves the goal of making this rich source of data available to theoretical linguists. In this connection, I find the index to be a useful component of the book, as it comes with a list of linguistic terms in Japanese with their English translations. The book therefore contributes to bridging the gap between theoretical linguists and the Japanese traditional grammar. This aspect of the book would have been better, however, if each insight from the traditional literature had been accompanied by a list of explicit references, especially regarding remarks about dialect-specific patterns and historical changes. For example, on page 27 Labrune discusses various dialects with different vowel systems. The discussion would have been more useful if there had been a reference to the original sources of each dialect, for readers interested in knowing more. Similarly, footnote 1 of Chapter 3 (p. 62) states that in Ancient Japanese stops were realised without affrication before any vowel (unlike Modern Japanese), but again no references are given. Setting aside this problem, the descriptions of Japanese phonology are generally very detailed (partly thanks to the traditional grammar), thereby calling for closer attention from the theoretical literature. The book often approaches
Towards A Compact Speech Recognizer: Subspace Distribution ClusteringHidden Markov Model

After decades of research in speech recognition, the technology is finally entering into the commercial market. A significant challenge is to downsize research laboratory recognizers so that they can be used on platforms with less computational power: Most contemporary laboratory recognizers require too much memory to run, and are too slow for mass applications. This thesis addresses the problem by greatly reducing the number of parameters in the acoustic models. We focus on more compact acoustic models because they constitute a major component of any speech recognizers, and the computation of their likelihoods consumes 50--70% of total recognition time for many typical tasks. The main contribution of this thesis is the formulation of a new acoustic modeling method which we call subspace distribution clustering hidden Markov modeling(SDCHMM). The theory of SDCHMM is based on tying continuous density hidden Markov models(CDHMMs) at a new finer sub-phonetic unit, namely the subspace distribution. Two methods are presented to implement the SDCHMMs. The first implementation requires training a set of intermediate CDHMMs followed by model conversion in which the distributions from the CDHMMs are projected onto orthogonal subspaces, and similar subspace distributions are then tied over all states and all acoustic models in each subspace. By exploiting the combinatorial effect of subspace distribution encoding, all original full-space distributions can be represented by combinations of a small number of subspace distribution prototypes. Consequently, there is a great reduction in the number of model parameters, and thus substantial savings in memory and computation. Furthermore, we demonstrate in the second implementation method that, given prior knowledge of the tying structure of the subspace distributions, SDCHMMs can be trained directly from much less data. This renders SDCHMM very attractive in the practical implementation of acoustic models, speaker-specific training, and speaker/environment adaptation. Evaluation on the ATIS(Airline Travel Information System) task shows that in comparison to a CDHMM system, a SDCHMM system achieves 7- to 18-fold reduction in memory required for acoustic models, runs 30--60% faster, and can be trained with 10--20 times less data, without any loss of recognition accuracy.
Information retrieval (Part 2): Document representations

A DISK DRIVE ASSEMBLY INCLUDES A BASEPLATE HOUSING JOINED WITH FRONT AND REAR COVERS TO ENCLOSE A SPINDLE THAT SUPPORTS BALL BEARINGS AND A HUB FOR ROTATING A STACK OF MAGNETIC DISCS. VII-1. A typical RESEARCHER representation. itself are organized as hierarchies of hierarchies, so that every generalization is subordinated to another yet more general concept (see fig.VII.3). Every node in the figure is a complete hierarchy description and information in the gemneralizations can be inherited by lower levels. In RESEARCHER at least in a fully developed system this hierarchy is automatically created, not provided to the system in advance. For every new object to be processed by RESEARCHER, the tree is searched for the generalized concept most similar to it, using either best a match or a treshold match algorithm. According to Lebowitz only experimentation will in the long run decide which algorithm gives best results. When it has found a best match, RESEARCHER will factor out the similaritics betwcen the object under consideration and the existing generalization and, if necd be, create a new generalization node. The current implementation is reported to work quite well on modest-sized examples, both in the patent's domain and in a domain of hierarchical descriptions of corporate organizations. 1. 2. 4. Text processing using memory. When the system has access to a collection of such texts, its representations and generalizations, it seems natural to use this information for the processing of new texts. RESEARCHER tries to solve ambiguities by comparing the object under
Kinematic Analysis of Planar Snake-like Robot Mechanism Using of Matrices Formulation

The article deals with the kinematics of a three section snake-like robot. In the introductory part of the article, the main advantages and application possibilities of a snake-like movement in practice are mentioned. In the next chapter, the mathematical model of a direct kinematics of a three link snake-like robot was created. It also includes the fourth, variable “virtual” link. Mathematical model was numerically confirmed in the conclusion. Homogeneous transformational matrices were used for the creation of mathematical model. Subsequently, positional vectors of centers of mass all links were expressed. For the derivation of velocity vectors centers of mass, the numerical methods with the application of differential operators were used. In the conclusion of the work, the graphical presentation of the centers of mass positions is illustrated. They were realized in the Matlab 2012 programming environment.
A Mathematical Analysis of Prophet Dynamic Address Allocation

Prophet is a dynamic address allocation protocol described at INFOCOM 2003. This protocol is based upon a family of pseudo-random generators. The goal of Prophet is to establish an addresses scheme free of conflict. The addressing capabilities of Prophet depend on the underlying properties of the pseudo-random generators. The different pseudo-random generators proposed in Prophet are analyzed and the limits of the scheme are exhibited. Most notably, the periods of the generators limit the addressing capabilities of a node and the fact that Prophet is collision-free. In this research report, we show that the underlying assumptions made in Prophet can not be met by pseudo-random generators.
A new cryogenic CMOS readout structure for infrared focal plane array

A new current readout structure for the infrared (IR) focal-plane-array (FPA), called the switch-current integration (SCI) structure, is presented in this paper. By applying the share-buffered direct-injection (SBDI) biasing technique and off focal-plane-array (off-FPA) integration capacitor structure, a high-performance readout interface circuit for the IR FPA is realized with a pixel size of 50/spl times/50 /spl mu/m/sup 2/. Moreover, the correlated double sampling (CDS) stage and dynamic discharging output stage are utilized to improve noise and speed performance of the readout structure under low power dissipation. In experimental SCI readout chip has been designed and fabricated in 0.8-/spl mu/m double-poly-double-metal (DPDM) n-well CMOS technology. The measurement results of the fabricated readout chip at 77 K with 4 and 8 V supply voltages have successfully verified both the readout function and the performance improvement. The fabricated chip has a maximum charge capacity of 1.12/spl times/10/sup 8/ electrons, a maximum transimpedance of 1/spl times/10/sup 9/ /spl Omega/, and an active power dissipation of 30 mW. The proposed CMOS SCI structure can be applied to various cryogenic IR FPA's.
Simplification of network dynamics in large systems

We show that significant simplicity can be exploited for pricing-based control of large networks. We first consider a general loss network with Poisson arrivals and arbitrary holding time distributions. In dynamic pricing schemes, the network provider can charge different prices to the user according to the current utilization level of the network and other factors. We show that, when the system becomes large, the performance (in terms of expected revenue) of an appropriately chosen static pricing scheme, whose price is independent of the current network utilization, approaches that of the optimal dynamic pricing scheme. Further, we show that, under certain conditions, this static price is independent of the route the flows take. This indicates that we can use the static scheme, with its much simpler structure, to control large communication networks. We then extend the result to the case of dynamic routing, and show that the performance of an appropriately chosen static pricing scheme, with bifurcation probability determined by average parameters, can also approach that of the optimal dynamic routing scheme when the system is large. Finally, we study the control of elastic flows and show that there exist schemes with static parameters whose performance can approach that of the optimal dynamic resource allocation scheme (in the large system limit). We also identify the applications of our results to QoS routing and rate control for real-time streaming.
Algorithms for low power and high speed fir filter realization using differential coefficients

Most realizations of FIR filters use the coefficients directly to compute the convolution with the input data. We present a set of new algorithms for low power and high-speed realization of FIR filters. The algorithms use various orders of differences between coefficients for computing the convolution. Also the results of computations are stored and reused, thus requiring more storage and storage accesses. These techniques result in a reduction in the net computations necessary per convolution as compared to directly using the coefficients. It is shown analytically that this computational reduction at the cost of more storage can result in a lower net computational energy dissipated and an enhanced speed. These algorithms are applied to an example FIR filter to quantify the energy savings and speedup.
Getting Into Honors or Not: An Analaysis of the Relative Influence of Grades, Test Scores, and Race on Track Placement in a

Decisions made in middle school allocate students to different high school course levels and tracks. Because African American students are disproportionately represented in the lower level tracks of high school curriculum and because track placement affects learning and postsecondary opportunities , it is important to explore determinants of track placement Some theories emphasize academic determinants of track placement; other theories emphasize student background variables and peer influences ; and still others , racial biases among educators. Research findings have been inconsistent concerning how much disproportionate representation in lower level courses is explained by prior academic achievement variables and how much it is explained by race. We examined the effects of race and 8th grade academic achievement variables - grades and standardized tests scores - on odds of pi ace