Miracle-dz/UniFAR-FTUs huggingface dataset:
Co-Designed FreeRTOS Deployed on FPGA

Most embedded systems are bound to real-time constraints. Two of the critical metrics presented in these systems are determinism and latency. Due to growing in complexity of embedded applications, real time operating systems (RTOS) are needed, not only to hide the increasingly complex hardware, but also to provide services to the system's running tasks. Unfortunately, this new layer on an embedded system puts more pressure on the aforementioned metrics. One of the ways to cope with this problem is to offload RTOS run-time services to the hardware layer. This paper presents a hybrid hardware/software implementation of this technique upon the well known FreeRTOS, improving system's latency and predictability, by migrating critical runtime services to hardware. The developed hardware accelerators were synthesized on a field-programmable gate array (FPGA), exploiting the point-to-point bus Fast Simplex Link (FSL) to interconnect to the Xilinx's Microbaze soft-core processor.
Conjugate Gradient Methods for Toeplitz Systems

In this expository paper, we survey some of the latest developments in using preconditioned conjugate gradient methods for solving Toeplitz systems. One of the main results is that the complexity of solving a large class of $n$-by-$n$ Toeplitz systems is reduced to $O(n \log n)$ operations as compared to $O(n \log ^2 n)$ operations required by fast direct Toeplitz solvers. Different preconditioners proposed for Toeplitz systems are reviewed. Applications to Toeplitz-related systems arising from partial differential equations, queueing networks, signal and image processing, integral equations, and time series analysis are given.
A mechanism of auto elasticity based on response times for cloud computer enviroments and autossimilar workload

This paper proposes a cloud computing architecture based on containers and an algorithm for auto elasticity based on the response time requirements in a Web system. The proposed algorithm promotes an efficient allocation of containers to achieve expected response time in processing requests. This proposal was evaluated with a real time series obtained from a web system hosted by Controladoria-Geral da União (CGU). The results show that the proposed algorithm achieves the expected response times allocating a lower number of containers than other related proposals.
Constraining dark energy with clusters: Complementarity with other probes

The Figure of Merit Science Working Group recently forecast the constraints on dark energy that will be achieved prior to the Joint Dark Energy Mission by ground-based experiments that exploit baryon acoustic oscillations, type Ia supernovae, and weak gravitational lensing. We show that cluster counts from ongoing and near-future surveys should provide robust, complementary dark energy constraints. In particular, we find that optimally combined optical and Sunyaev-Zel'dovich effect cluster surveys should improve the Dark Energy Task Force figure of merit for pre-Joint Dark Energy Mission projects by a factor of 2 even without prior knowledge of the nuisance parameters in the cluster mass-observable relation. Comparable improvements are achieved in the forecast precision of parameters specifying the principal component description of the dark energy equation of state parameter, as well as in the growth index {gamma}. These results indicate that cluster counts can play an important complementary role in constraining dark energy and modified gravity even if the associated systematic errors are not strongly controlled.
A service oriented virtual environment for complex system analysis: Preliminary report

Distributed virtual simulation is a capability that is increasing in demand within the automotive manufacturing industry. The distributed and networked approach to system level design and simulation stands to benefit from a unifying relational oriented modeling and simulation framework due to the large number of simulation technologies that must be integrated. This will also permit innovative use of existing independent simulations for increased concurrency in design and verification and validation. Through relational orientation, high level syntax and semantics for representing models and simulations have been developed for proof of concept analysis. This paper presents an approach to drive a process of analysis of the vehicle as a complex system through the combination of a relational trade-off analysis framework and a distributed simulation execution delivered through a service-oriented integration architecture. This promises to provide a rigorous, traceable and agile approach to early stage conceptual vehicle design and analysis.
D ESIGN OF THE S LIDING M ODE C ONTROL FOR THE P UMA 560 R OBOT

There is presented a design of a sliding mode position control algorithm for the PUMA 560 robot position control. The Lagrange-Euler model of a robot is used for calculation of robot law. Computer simulations of the robot with the sliding mode control were performed. The presented control algorithm shows a good robustness with respect to the robot model uncertainty.
An experimentalist's guide to computational modelling of the Min system

Spatio‐temporal oscillations of the Min proteins are essential for selecting the cell division site in Escherichia coli. These oscillations are a key example of a biological phenomenon that can only be understood on a systems level rather than on the level of its individual components. Here, we review the key concepts that mathematical modelling has added to our understanding of the Min system. While several different mechanisms have been proposed, in all cases the oscillations emerge from a dynamic instability of a uniform protein distribution. To generate this instability, however, the various mechanisms rely on different features of Min protein interactions and transport. We critically evaluate these mechanisms in light of recent experimental evidence. We also review the effects of fluctuations caused by low cellular concentration of Min proteins, and describe how stochastic effects may potentially influence Min protein dynamics.
How good are deterministic fluid models of Internet congestion control?

Congestion control algorithms used in the Internet are difficult to analyze or simulate on a large scale, i.e., when there are large numbers of nodes, links and sources in a network. The reasons for this include the complexity of the actual implementation of the algorithm and the randomness introduced in the packet arrival and service processes due to many factors such as arrivals and departures of sources and uncontrollable short flows in the network. To make the simulation tractable, often deterministic fluid model approximations of these algorithms are used. These approximations are in the form of either deterministic delay differential equations, or more generally, deterministic functional differential equations. We justify the use of deterministic models for proportionally fair congestion controllers under a limiting regime where the number of sources in a network is large. We verify our results through simulations of window-based implementations of proportionally fair controllers and TCP.
Cardiomyoplasty: Cellular and Tissue Engineering Approaches

Myocardial infarction is a major cause of morbidity and mortality in the western world. After injury, myocardial repair is limited since cardiomyocytes cannot significantly regenerate in vivo. Current therapeutic options such as medical therapy and whole heart transplantation have either limited clinical benefit or restricted applicability. Over the past years, the shortcomings associated with the available therapies have led to consider cellular-based strategies for the treatment of heart disease. Cellular therapies include the endogenous augmentation of the number of cardiomyocytes, and the transplantation of dissociated cells or cardiac muscle-like tissues in the diseased heart. Herein we review current knowledge on the status, the potential advantages, disadvantages and the clinical applications of the cellular based therapies with an emphasis on cellular and tissue transplantation.
Systems programming in concurrent prolog

Concurrent Prolog [28] combines the logic programming computation model with guarded-command indeterminacy and dataflow synchronization. It will form the basis of the Kernel Language [21] of the Parallel Inference Machine [36], planned by Japan's Fifth Generation Computers Project. This paper explores the feasibility of programming such a machine solely in Concurrent Prolog (in the absence of a lower-level programming language), by implementing in it a representative collection of systems programming problems.
Repeated oral dosing of TAS-102 confers high trifluridine incorporation into DNA and sustained antitumor activity in mouse models

TAS-102 is a novel oral nucleoside antitumor agent containing trifluridine (FTD) and tipiracil hydrochloride (TPI). The compound improves overall survival of colorectal cancer (CRC) patients who are insensitive to standard chemotherapies. FTD possesses direct antitumor activity since it inhibits thymidylate synthase (TS) and is itself incorporated into DNA. However, the precise mechanisms underlying the incorporation into DNA and the inhibition of TS remain unclear. We found that FTD-dependent inhibition of TS was similar to that elicited by fluorodeoxyuridine (FdUrd), another clinically used nucleoside analog. However, washout experiments revealed that FTD-dependent inhibition of TS declined rapidly, whereas FdUrd activity persisted. The incorporation of FTD into DNA was significantly higher than that of other antitumor nucleosides. Additionally, orally administered FTD had increased antitumor activity and was incorporated into DNA more effectively than continuously infused FTD. When TAS-102 was administered, FTD gradually accumulated in tumor cell DNA, in a TPI-independent manner, and significantly delayed tumor growth and prolonged survival, compared to treatment with 5-FU derivatives. TAS-102 reduced the Ki-67-positive cell fraction, and swollen nuclei were observed in treated tumor tissue. The amount of FTD incorporation in DNA and the antitumor activity of TAS-102 in xenograft models were positively and significantly correlated. These results suggest that TAS-102 exerts its antitumor activity predominantly due to its DNA incorporation, rather than as a result of TS inhibition. The persistence of FTD in the DNA of tumor cells treated with TAS-102 may underlie its ability to prolong survival in cancer patients.
A simple technique for bounding the redundancy of source coding with side information

A simple technique for bounding the redundancy of Slepian-Wolf coding is given. We demonstrate that our simple technique gives the tight bound established by He et al. Our proof is so simple that it can be easily extended to the case where the source (X<sup>n</sup>, Y <sup>n</sup>) has an n-fold product distribution (i.e., (X<sub>1</sub>, Y<sub>1</sub>), . , (X<sub>n</sub>, Y<sub>n</sub>) are independent but not necessarily identically distributed). It can be also applied to Wyner-Ahlswede-Körner coding and gives novel bounds of the redundancies of the coding rates of the encoder and the helper.
TWO VIEW TRACKING WITH OCCLUSION HANDLING

This paper introduces a two view tracking method which uses the homography relation between the two views to handle occlusions. An adaptive appearance-based model is incorporated in a particle filter to realize robust visual tracking. Occlusion is detected using robust statistics. When there is occlusion in one view, the homography from this view to other views is estimated from previous tracking results and used to infer the correct transformation for the occluded view. Experimental results show the robustness of the multiple view tracker.
ULTIDIMENSIONAL A NALYSIS FOR Q O S I N W IRELESS S ENSOR N ETWORKS

Nodes in Mobile Ad-hoc network are connected wirelessly and the network is auto configuring [1]. This paper introduces the usefulness of data warehouse as an alternative to manage data collected by WSN. Wireless Sensor Network produces huge quantity of data that need to be proceeded and homogenised, so as to help researchers and other people interested in the information. Collected data is managed and compared with other coming from datasources and systems could participate in technical report and decision making. This paper proposes a model to design, extract, transform and normalize data collected by Wireless Sensor Networks by implementing a multidimensional warehouse for comparing many aspects in WSN such as (routing protocol[4], sensor, sensor mobility, cluster .). Hence, data warehouse defined and applied to the context above is presented as a useful approach that gives specialists row data and information for decision processes and navigate from one aspect to another.
Road Detection via On-line Label Transfer

Vision-based road detection is an essential functionality for supporting advanced driver assistance systems (ADAS) such as road following and vehicle and pedestrian detection. The major challenges of road detection are dealing with shadows and lighting variations and the presence of other objects in the scene. Current road detection algorithms characterize road areas at pixel level and group pixels accordingly. However, these algorithms fail in presence of strong shadows and lighting variations. Therefore, we propose a road detection algorithm based on video alignment. The key idea of the algorithm is to exploit the similarities occurred when a vehicle follows the same trajectory more than once. In this way, road areas are learned in a first ride and then, this road knowledge is used to infer areas depicting drivable road surfaces in subsequent rides. Two different experiments are conducted to validate the proposal on different video sequences taken at different scenarios and different daytime. The former aims to perform on-line road detection. The latter aims to perform off-line road detection and is applied to automatically generate the ground-truth necessary to validate road detection algorithms. Qualitative and quantitative evaluations prove that the proposed algorithm is a valid road detection approach.
BEVA: An Efficient Query Processing Algorithm for Error-Tolerant Autocompletion

Query autocompletion has become a standard feature in many search applications, especially for search engines. A recent trend is to support the error-tolerant autocompletion, which increases the usability significantly by matching prefixes of database strings and allowing a small number of errors. In this article, we systematically study the query processing problem for error-tolerant autocompletion with a given edit distance threshold. We propose a general framework that encompasses existing methods and characterizes different classes of algorithms and the minimum amount of information they need to maintain under different constraints. We then propose a novel evaluation strategy that achieves the minimum active node size by eliminating ancestor-descendant relationships among active nodes entirely. In addition, we characterize the essence of edit distance computation by a novel data structure named edit vector automaton (EVA). It enables us to compute new active nodes and their associated states efficiently by table lookups. In order to support large distance thresholds, we devise a partitioning scheme to reduce the size and construction cost of the automaton, which results in the universal partitioned EVA (UPEVA) to handle arbitrarily large thresholds. Our extensive evaluation demonstrates that our proposed method outperforms existing approaches in both space and time efficiencies.
Interlanguage Pragmatics Requests Complaints And Apologies

Thank you for downloading interlanguage pragmatics requests complaints and apologies. Maybe you have knowledge that, people have look numerous times for their favorite novels like this interlanguage pragmatics requests complaints and apologies, but end up in harmful downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they cope with some infectious bugs inside their desktop computer.
BSP Modelling of Two-Tiered Parallel Architectures

In recent years there has been a trend towards using standard workstation components to construct parallel computers, due to the enormous costs involved in designing and manufacturing special-purpose hardware. In particular we can expect to see a large population of SMP clusters emerging in the next few years. These are local-area networks of workstations, each containing around four parallel processors with a single shared memory. To use such machines effectively will be a major headache for programmers and compiler-writers. Here we consider how well-suited the BSP model might be for these two-tier architectures, and whether it would be useful to extend the model to allow for non-uniform communication behaviour.
Computing and Fabricating Multiplanar Models

We present a method for converting computer 3D models into physical equivalents. More specifically, we address the problem of approximating a 3D textured mesh using a small number of planar polygonal primitives that form a closed surface. This simplified representation allows us to easily manufacture individual components using computer controlled cutters (e.g., laser cutters or CNC machines). These polygonal pieces can be assembled into the final 3D model using internal planar connectors that are manufactured simultaneously. Our shape approximation algorithm iteratively assigns mesh faces to planar segments and slowly deforms these faces towards corresponding segments. This approach ensures that the output for a given closed mesh is still a closed mesh and avoids introducing self‐intersections. After this step we also compute the shape of polygonal connectors that internally hold the whole mesh surface. Both the polygonal surface elements and connectors can be manufactured in a single cutting pass. We validate the use of our method by computing and manufacturing a variety of textured polyhedral models.
Prolonged Epileptiform Discharges Induced by Altered Group I Metabotropic Glutamate Receptor-Mediated Synaptic Responses in Hippocampal Slices of a Fragile X Mouse Model

Mutations in FMR1, which encodes the fragile X mental retardation protein (FMRP), are the cause of fragile X syndrome (FXS), an X-linked mental retardation disorder. Inactivation of the mouse gene Fmr1 confers a number of FXS-like phenotypes including an enhanced susceptibility to epileptogenesis during development. We find that in a FXS mouse model, in which the function of FMRP is suppressed, synaptically released glutamate induced prolonged epileptiform discharges resulting from enhanced group I metabotropic glutamate receptor (mGluR)-mediated responses in hippocampal slices. The induction of the group I mGluR-mediated, prolonged epileptiform discharges was inhibited in preparations that were pretreated with inhibitors of ERK1/2 (extracellular signal-regulated kinase 1/2) phosphorylation or of mRNA translation, and their maintenance was suppressed by group I mGluR antagonists. The results suggest that FMRP plays a key role in the control of signaling at the recurrent glutamatergic synapses in the hippocampus. The absence of this control causes the synaptically activated group I mGluRs to elicit translation-dependent epileptogenic activities.
Institutionalization and the Effectiveness of Enterprise Architecture Management

Enterprise Architecture Management (EAM) has become a prominent discipline for managing increasingly complex Business/IT relationships in organizations. The more tangible aspects of EAM like modeling, planning, principles or governance structures are widely discussed and understood. However, institutionalizing EAM in an organization remains a challenging issue. Therefore, actually realized EAM benefits can be observed to vary widely across organizations. To address these issues, we take an institutional theory perspective and propose nine hypotheses which are tested based on quantitative empirical data. Our findings confirm seven institutional factors as antecedents for institutionalizing EAM in terms of positive stakeholder response, EA consistency and a realization of EAM benefits for the organization. Our research supports the understanding of the relevant phenomenon of institutionalization of EAM as a rather practice-driven discipline, where theoretical foundations as well as research into non-technical issues are limited so far.
JOINT ACOUSTIC SOURCE LOCATION AND ORIENTATION ESTIMATION USING SEQUENTIAL MONTE CARLO

Standard acoustic source localization algorithms attempt to estimate the instantaneous location of a source based only on current data from a microphone sensor array. This is done regardless of previous location estimates. However more recent Sequential Monte Carlo based approaches have instead posed the problem using an evolving state-space framework. In this paper we take this approach further by exploiting the directionality of human speech sources. This allows us to estimate the orientation of the source within the room. Finally combining previous source localization methods with this work we outline how both parameters - location and orientation - may be estimated jointly. Examples are given of performance in a typically reverberant real office environment for both a stationary and a moving source.
CFD modelling of insulation debris transport phenomena in water flow

Abstract The investigation of insulation debris generation, transport and sedimentation becomes important with regard to reactor safety research for PWR and BWR, when considering the long-term behaviour of emergency core cooling systems during all types of loss of coolant accidents. A joint research project on such questions is being performed in cooperation between the University of Applied Sciences Zittau/Görlitz and the Forschungszentrum Dresden-Rossendorf. The project deals with the experimental investigation of particle transport phenomena in coolant flow and the development of CFD models for its description. While the experiments are performed at the University at Zittau/Görlitz, the theoretical modelling efforts are concentrated at Forschungszentrum Dresden-Rossendorf. In the current paper the basic concepts for CFD modelling are described and feasibility studies are presented.
Dynamic Rebinding for Distributed Programming

Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various guises. Typically it is provided only by ad-hoc mechanisms that lack clean semantics. In this paper we adopt a more foundational approach, showing how core dynamic rebinding mechanisms can be added to a CBV λ-calculus. To do so we first develop two refinements of the CBV reduction strategy with delayed instantiation, the redex-time and destruct-time semantics. Delayed instantiation ensures we obtain the most recent version of a definition following a rebinding. The destructtime semantics gives the basis for a λmark calculus that supports dynamic rebinding, with primitives to package values and marks to control which identifiers are dynamically rebound when they are unpackaged. We extend λmark with concurrency and communication, giving examples showing how wrappers for encapsulating untrusted code can be expressed, and discuss the extent to which it can be statically typed. Finally, we use the destruct-time semantics also as a basis for a λupdate calculus with simple primitives to provide type-safe, dynamic updating of code. We thereby put a variety of real-world mechanisms on a common semantic foundation.