Miracle-dz/UniFAR-FTUs huggingface dataset:
Threshold-Based Rate Control for Multimedia Transport over Markovian Wireless Channels

In this paper, we examine source rate control (SRC) via multiple buffer thresholds over a Markovian wireless channel. In the SRC scheme, a multimedia source reduces its packet rate (thus degrading the encoding quality) gradually whenever the queue length exceeds certain thresholds. When the queue length drops below a specific threshold, the respective preset source rate is restored. The performance of this scheme is analyzed by defining a loss function of a source in the queueing system, which consists of packet dropping at the end of queue, the throughput degradation and the quality degradation by a source encoder. This function is evaluated by modeling the system as a level dependent M/G/l queue. Numerical examples are presented, which show that the loss function and average packet delay are minimized at an optimal rate reduction factor.
Impaired disengagement of attention in young children with autism.

BACKGROUND The present study examined the disengage and shift operations of visual attention in young children with autism. METHODS For this purpose, we used a simple visual orienting task that is thought to engage attention automatically. Once attention was first engaged on a central fixation stimulus, a second stimulus was presented on either side, either simultaneously or successively. Latency to begin an eye movement to the peripheral stimulus served as the main dependent measure. The two stimulus conditions (simultaneous and successive) provided independent measures of disengaging and shifting attention, respectively. Performance of children with autism was compared to that of children with Down syndrome and a normal group. RESULTS The main finding was that relative to both comparison groups, children with autism had marked difficulty in disengaging attention. Indeed, on 20% of trials they remained fixated on the first of two competing stimuli for the entire 8-second trial duration. Evidence is also provided for a more subtle problem in executing rapid shifts of attention. CONCLUSIONS Our findings on disengagement in autism parallel those reported in normal 2-month-olds, in whom attention has been described as 'obligatory'. Discussion focuses on the potential role of general versus domain-specific processes in producing some of the core features of autism.
Face Recognition Using M − Band Wavelet Analysis

In this paper, we propose a new facial recognition algorithm based on wavelet analysis. M−Band wavelets are used to decompose face images into M frequency levels. The efficiency of this approach is tested using the eigenface procedure for face recognition. Along with signal decomposition, Wavelet methods allow for data compression, thus reducing computational efforts.
Runtime Correctness Analysis of MPI-3 Nonblocking Collectives

The Message Passing Interface (MPI) includes nonblocking collective operations that support additional overlap between computation and communication. These new operations enable complex data movement between large numbers of processes. However, their asynchronous behavior hides and complicates the detection of defects in their use. We highlight a lack of correctness tool support for these operations and extend the MUST runtime MPI correctness tool to alleviate this complexity. We introduce a classification to summarize the types of correctness analyses that are applicable to MPI's nonblocking collectives. We identify complex wait-for dependencies in deadlock situations and incorrect use of communication buffers as the most challenging types of usage errors. We devise, demonstrate, and evaluate the applicability of correctness analyses for these errors. A scalable analysis mechanism allows our runtime approach to scale with the application. Benchmark measurements highlight the scalability and applicability of our approach at up to 4,096 application processes and with low overhead.
Chapter 40 Combinatorics in Computer Science

1. Communication complexity 2. Circuit complexity 3. Data structures 4. Cryptography and pseudo-random numbers It is not surprising that computer science is perhaps the most important eld of applications of combinatorial ideas. Modern computers operate in a discrete fashion both in time and space, and much of classical mathematics must be \discretized" before it can be implemented on computers as, for example, in the case of numerical analysis. The connection between combinatorics and computer science might be even stronger than suggested by this observation; each eld has prooted from the other. Combinatorics was the rst eld of mathematics where the ideas and concepts of computer science, in particular complexity theory, had a profound impact. This framework for much of combinatorics has been surveyed in Chapter 29. In this chapter, we illustrate what computer science proots from combinatorics: we have collected a number of examples, all of them rather important in computer science, where methods and results from classical discrete mathematics play a crucial role. Since many of these examples rely on concepts from theoretical computer science that have been discussed in Chapter 29, the reader is encouraged to refer to that chapter for background material. 1. Communication complexity There are many situations where the amount of communication between two processors jointly solving a certain task is the real bottleneck; examples range from communication between the earth and a rocket approaching Jupiter to communication between 1
An Overlay Application-Layer Multicast Infrastructure

Overlay networks are considered an easy and effective way to deploy value-added Internet services by extending the best-effort delivery service supported by IP layer. However, a careful design is needed in order to take advantage of these benefits. Since there are no standards for overlay networks yet, they are often independently designed, which means that each one applies its own topology discovery and takes its own routing decisions. As a result, they may negatively affect each other by generating control overhead and by creating bottlenecks in the physical network. In order to avoid such a situation, this work proposes an overlay network organization and architecture towards a middleware for overlay multicast services. As proof of concept, we have deployed a multicast service overlay network taking advantage of this architecture and considering both intradomain and interdomain scenarios – the latter being practically impossible to deploy on public networks due to administrative issues. By experimental measurements, we validate interdomain multicast functionality over four autonomous systems without any native support from underlying networks.
A unified approach to uniform real approximation by polynomials with linear restrictions

Problems concerning approximation of real-valued continuous functions of a real variable by polynomials of degree smaller than n with various linear restrictions have been studied by several authors. This paper is an attempt to provide a unified approach to these problems. In particular, the notion of restricted derivatives approximation is seen to fit into the theory and includes as special cases the notions of monotone approximation and restricted range approximation. Also bounded coefficients approximation, c-interpolator approximation, and polynomial approximation with interpolation fit into our scheme.
Pedagogical Narrations and Leadership in Early Childhood Education as Thinking in Moments of Not Knowing

In this article, I draw from a recent research project that examined how a reconceptualized notion of leadership in early childhood education (ECE) is enacted through the practice of pedagogical narration. Pedagogical narration involves a process through which early childhood educators create and share narratives about significant pedagogical occurrences with children from their early childhood settings with the purpose of engaging others in critical dialogue where construction of children’s identities and the values embedded in ECE practices are made visible and open for disputation and renewal. Here I present a particular dimension of leadership enactment that is associated with the practice of pedagogical narration, and I relate this leadership to thinking in moments of not knowing. By providing an example of how leadership was enacted, I wish to illuminate the potentiality of the practice of pedagogical narration to orient educators toward complexity and thinking that is triggered by encounters with unexpected pedagogical situations. Such encounters have the potential to initiate educational judgment that is inspired by events and not by following known rules and standards. They invite thinking beyond generalizations and clichés and they orient future (more) responsive and ethically rich pedagogical ventures in ECE contexts.
In-memory Query System for Scientific Dataseis

The growing gap between compute performance and I/O bandwidth coupled with the increasing data volumes has resulted in a bottleneck to the traditional post-simulation data processing method. Hence in-situ computing and query-driven data analysis are important techniques to minimize data movement. By taking advantage of the growing memory capacity on supercomputers, we developed an in-memory query system for scientific data analysis. Our approach is a combination of bitmap indexing, spatial data layout re-organization, distributed shared memory, and location-aware parallel execution. Our evaluations using real scientific datasets showed that we can aggregate the memory capacity from thousands of computes nodes to analyze a 750GB simulation dataset without transferring data to remote nodes or storage systems. Comparing to traditional solutions based on out-of-core parallel file systems, we achieve significant higher query performance.
Gender in culture-inclusive psychologies: A situated and selective mapping of historical and contemporary territories

Culture-inclusive psychologies, despite large theoretical and methodological differences, agree on the importance of culture for shaping mental phenomena, human behavior, and actions. How do these psychologists address gender? It is very common in psychology to frame gender as innate and determined by a male–female schema of reproduction. Do culture-inclusive psychologies depart from this schema and look into ways in which gender-related phenomena are culturally shaped? This article overviews two types of psychological texts. First, it examines classic psychological texts belonging to four selected schools of thought: cultural-historical psychology (Leont’ev, Luria, Vygotsky), critical psychology (Holzkamp, Holzkamp-Osterkamp), social constructionism (Mary and Kenneth Gergen), and action-oriented cultural psychology (Boesch, Straub). Second, it compares articles published in the Journal of Cross-Cultural Psychology and Culture & Psychology. This overview reveals that differences in conceptualizing gender are significant, covering a spectrum ranging from naturalistic to constructionist frameworks.
Towards Secure MediationJoachim Biskup

A secure mediated information system should support scenarious where dynamically changing information sources advertise their information resources, and application speciic mediators collect and assemble these resources into useful information in order to support the requests of their spontaneous clients. While doing this, the mediators should enforce security constraints in the application environments. In this paper, we compare mediated information systems with federated database systems with respect to design issues and security issues in order to clarify the diierent motivations of both systems. Furthermore, we present our secure mediated querying protocol using the concepts of credentials for authentic authorization. We also highlight some multimedia speciic security requirements and mechanisms.
ROBUST FORCE AND IMPEDANCE CONTROL OF SERIES ELASTIC ACTUATORS

Abstract. This paper deals with robust H∞ force and impedance control of series elastic actuators. It is considered that the series elastic actuators are subject to parametric uncertainties and external disturbances. Robust controllers based on the H∞ criterion have been widely used among robotic applications for guaranteeing good disturbance rejection properties. The H∞ force and impedance controls proposed in this paper will be implemented in an exoskeleton for lower limbs where the joints are actuated by a set of series elastic actuators. The results shows that the H∞ force controller increased the bandwidth over the PID controller and rejects external disturbances properly. Also, the impedance controller works properly, with the the end-effector of the series elastic actuator following the desired trajectory generated by the controller regarding the desired impedance.
An ontology-based approach for IVE+VA ?

This paper proposes the use of ontologies to provide intel- ligent virtual environments with semantical information, which can be of great value to the virtual agents inhabiting the world. On the one hand, this approach allows us to define complex objects and to intro- duce semantic levels of detail that help the agents when sensing complex scenes. On the other hand, the object taxonomy established by the on- tology of the world is also used to define general and reusable activities for the roles involved in the simulation. Finally, in order to verify the approach presented, we have developed an application example dealing with a virtual bar, where dierent actors are able to sense as well as interact eciently
TRF1 binds a bipartite telomeric site with extreme spatial flexibility

TRF1 is a key player in telomere length regulation. Because length control was proposed to depend on the architecture of telomeres, we studied how TRF1 binds telomeric TTAGGG repeat DNA and alters its conformation. Although the single Myb‐type helix–turn–helix motif of a TRF1 monomer can interact with telomeric DNA, TRF1 predominantly binds as a homodimer. Systematic Evolution of Ligands by Exponential enrichment (SELEX) with dimeric TRF1 revealed a bipartite telomeric recognition site with extreme spatial variability. Optimal sites have two copies of a 5′–YTAGGGTTR–3′ half‐site positioned without constraint on distance or orientation. Analysis of binding affinities and DNase I footprinting showed that both half‐sites are simultaneously contacted by the TRF1 dimer, and electron microscopy revealed looping of the intervening DNA. We propose that a flexible segment in TRF1 allows the two Myb domains of the homodimer to interact independently with variably positioned half‐sites. This unusual DNA binding mode is directly relevant to the proposed architectural role of TRF1.
Fast stable direct fitting and smoothness selection for generalized additive models

Summary. Existing computationally efficient methods for penalized likelihood generalized additive model fitting employ iterative smoothness selection on working linear models (or working mixed models). Such schemes fail to converge for a non‐negligible proportion of models, with failure being particularly frequent in the presence of concurvity. If smoothness selection is performed by optimizing ‘whole model’ criteria these problems disappear, but until now attempts to do this have employed finite‐difference‐based optimization schemes which are computationally inefficient and can suffer from false convergence. The paper develops the first computationally efficient method for direct generalized additive model smoothness selection. It is highly stable, but by careful structuring achieves a computational efficiency that leads, in simulations, to lower mean computation times than the schemes that are based on working model smoothness selection. The method also offers a reliable way of fitting generalized additive mixed models.
A dimensionality reduction based on feature quality measure

This paper presents a novel feature selection method called Feature Quality (FQ) measure based on the quality measure of individual feature values which has very low computational complexity. To evaluate the performance of the proposed method several experiments are conducted on standard datasets and the results obtained show the superiority of the proposed method over the other dimensionality reduction techniques.
Dynamic Surface Reconstruction from 4D-MR Images

In this work we present a new analysis technique for dynamic 3D images. The method allows the reconstruction of dynamic surfaces describing object boundaries in the 3D images over time. The only input of the user is a grey value threshold used for boundary detection and a bounding box around the surfaces of the object of interest. The output of our method is a dynamic surface mesh that tracks the object boundary over time. We first extract a set of weighted points from the MR image data using a local boundary voting scheme. The dynamic surface is defined as an extremal surface on the resulting point-sampled boundary probability density. In this way a surface with adjustable smoothness is obtained that can be reconstructed using projection operators similar to the ones used for point set surfaces. We extend the projection operators to 3manifolds in 4D and obtain a much better tracking performance of the dynamic surface model. In contrast to computationally expensive active contour algorithms, the new algorithm can be easily parallelized. The proposed approach is applied to 4D-MR images of a human heart in motion.
Evolution of cellular automata using instruction-based approach

This paper introduces a method of encoding cellular automata local transition function using an instruction-based approach and their design by means of genetic algorithms. The proposed method represents an indirect mapping between the input combinations of states in the cellular neighborhood and the next states of the cells during the development steps. In this case the local transition function is described by a program (algorithm) whose execution calculates the next cell states. The objective of the program-based representation is to reduce the length of the chromosome in case of the evolutionary design of cellular automata. It will be shown that the instruction-based development allows us to design complex cellular automata with higher success rate than the conventional table-based method especially for complex cellular automata with more than two cell states. The case studies include the replication problem and the problem of development of a given pattern from an initial seed.
An Intelligent Model for Redesigning Websites using Web Mining Techniques

The main objective of this paper is to evolve an Intelligent Model which can help organizations to restructure their website so that website structure can be refined and it becomes more efficient and user friendly. In order to reach the main goal web mining process, web mining algorithm are applied. These can help to suggest the possible changes in the design of the wesite so that a common user feels much more comfortable in browsing the website. The data for this paper has been collected from a university website using a web crawler. Web mining algorithm are applied on the data so that possible changes can be suggested. General Terms Web Mining, Web Structure Mining, Page Rank, Page Rank Algorithm, Crawlers, Websites.
Inthreads: a low granularity parallelization model

We present Inthreads, a computational model aimed at medium-level parallelism. The threads in our model, based on shared architectural registers and having extremely low overheads, are useful for parallelization at a level of a single function call.Inthreads parallelization provides significant speedups, from 35% in case of well-behaved programs to over 3.5x for benchmarks with problematic patterns of branches and memory accesses.
Scuba: Diving into Data at Facebook

Facebook takes performance monitoring seriously. Performance issues can impact over one billion users so we track thousands of servers, hundreds of PB of daily network traffic, hundreds of daily code changes, and many other metrics. We require latencies of under a minute from events occuring (a client request on a phone, a bug report filed, a code change checked in) to graphs showing those events on developers' monitors.Scuba is the data management system Facebook uses for most real-time analysis. Scuba is a fast, scalable, distributed, in-memory database built at Facebook. It currently ingests millions of rows (events) per second and expires data at the same rate. Scuba stores data completely in memory on hundreds of servers each with 144 GB RAM. To process each query, Scuba aggregates data from all servers. Scuba processes almost a million queries per day. Scuba is used extensively for interactive, ad hoc, analysis queries that run in under a second over live data. In addition, Scuba is the workhorse behind Facebook's code regression analysis, bug report monitoring, ads revenue monitoring, and performance debugging.
Mining Sentiments from Tweets

Twitter is a micro blogging website, where users can post messages in very short text called Tweets. Tweets contain user opinion and sentiment towards an object or person. This sentiment information is very useful in various aspects for business and governments. In this paper, we present a method which performs the task of tweet sentiment identification using a corpus of pre-annotated tweets. We present a sentiment scoring function which uses prior information to classify (binary classification) and weight various sentiment bearing words/phrases in tweets. Using this scoring function we achieve classification accuracy of 87% on Stanford Dataset and 88% on Mejaj dataset. Using supervised machine learning approach, we achieve classification accuracy of 88% on Stanford dataset.
Parsing, Semantic Networks, and Political Authority Using Syntactic Analysis to Extract Semantic Relations from Dutch Newspaper Articles

Analysis of political communication is an important aspect of political research. Thematic content analysis has yielded considerable success both with manual and automatic coding, but Semantic Network Analysis has proven more difficult, both for humans and for the computer. This article presents a system for an automated Semantic Network Analysis of Dutch texts. The system automatically extracts relations between political actors based on the output of syntactic analysis of Dutch newspaper articles. Specifically, the system uses pattern matching to find source constructions and determine the semantic agent and patient of relations, and name matching and anaphora resolution to identify political actors. The performance of the system is judged by comparing the extracted relations to manual codings of the same material. Results on the level of measurement indicate acceptable performance. We also estimate performance at the levels of analysis by using a case study of media authority, resulting in good correlations between the theoretical variables derived from the automatic and manual analysis. Finally, we test a number of substantive hypotheses with regression models using the automatic and manual output, resulting in highly similar models in each case. This suggests that our method has sufficient performance to be used to answer relevant political questions in a valid way.
Research on the wireless channel statistical characteristics of high-speed railway based on big data

The wireless channel characteristics of high-speed railway is a key issue to ensure the safety and reliability of high-speed train. Due to the variable external environment during train running, the model and optimization of wireless channel in theory can hardly meet the demand in reality. A Vehicle Electromagnetic Environment Monitoring System developed by Electromagnetic Compatibility Laboratory of Beijing JiaoTong University has been working on testing the high-speed train for many years. A large of testing data are obtained when train control system transmits signals. The big data theory and technique can mine the characteristic parameters of high-speed wireless channel from empirical data effectively, which could provide reasonable solution to optimize the high-speed wireless communication.