Miracle-dz/UniFAR-FTUs huggingface dataset:
An Emergent European Executive Order

List of Figures List of Tables 1. Introducing an Emergent European Executive Order PART I: THE COMMISSION AND AN EMERGENT EUROPEAN EXECUTIVE ORDER 2. The European Commission: Organisational Capacities and Staff Resources 3. The Autonomy of the European Commission Reassessed 4. Supranationalism and the European Commission 5. The Compound Machinery of the Commission 6. Is the Commission all that Different? Reflections on Comparative International Bureaucracies PART II: EU-LEVEL AGENCIES IN AN EMERGENT EUROPEAN EXECUTIVE ORDER 7. Agency Governance in an Emergent European Executive Order 8. Bureaucratic Autonomy and EU-level Agencies PART III: EU COMMITTEE GOVERNANCE IN AN EMERGENT EUROPEAN EXECUTIVE ORDER 9. EU Committee Governance 10. How Supranational are Intergovernmental Institutions? The Transformative Power of Council Working Groups 11. Ambiguity and representation in an emergent European Executive Order 12. An emergent European Executive Order and the domestic branch of government 13. An emergent European Executive Order: less than a European 'mega-administration' References Index
Mouse movements of motion-impaired users: a submovement analysis

Understanding human movement is key to improving input devices and interaction techniques. This paper presents a study of mouse movements of motion-impaired users, with an aim to gaining a better understanding of impaired movement. The cursor trajectories of six motion-impaired users and three able-bodied users are studied according to their submovement structure. Several aspects of the movement are studied, including the frequency and duration of pauses between submovements, verification times, the number of submovements, the peak speed of submovements and the accuracy of submovements in two-dimensions. Results include findings that some motion-impaired users pause more often and for longer than able-bodied users, require up to five times more submovements to complete the same task, and exhibit a correlation between error and peak submovement speed that does not exist for able-bodied users.
Algorithmic Game Semantics: A Tutorial Introduction

Game Semantics has emerged as a powerful paradigm for giving semantics to a variety of programming languages and logical systems. It h as been used to construct the first syntax-independent fully abstract mode ls for a spectrum of programming languages ranging from purely functional languag es to languages with non-functional features such as control operators and loca lly-scoped references [4, 21, 5, 19, 2, 22, 17, 11]. A substantial survey of the state of the art of Game Semanticscirca 1997 was given in a previous Marktoberdorf volume [6]. Our aim in this tutorial presentation is to give a first indica t on of how Game Semantics can be developed in a new, algorithmic direction, with a view to applications in computer-assisted verification and program anal ysis. Some promising steps have already been taken in this direction. Hankin and M alacaria have applied Game Semantics to program analysis, e.g. to certifying secu re information flows in programs [25]. A particularly striking development was t he work by Ghica and McCusker [15] which captures the game semantics of a fragmen t of Idealized Algol in a remarkably simple form as regular expressions. Th is leads to a decision procedure for observation equivalence on this fragment. Gh ica as subsequently extended the approach to a call-by-value language with arra ys [14], and to model checking Hoare-style program correctness assertions [13] . We believe the time is ripe for a systematic development of th is algorithmic approach to game semantics. Game Semantics has several feat ures which make it very promising from this point of view. It provides a very concreteway of building fully abstractmodels. It has a clear operational content, while admitting compositional methods in the style of denotational semantics. The basic objects studied in Game Semantics are games, and strategies on games . Strategies can be seen as certain kinds of highly-constrained processes, hen ce they admit the same kind of automata-theoretic representations central to mod el checking and allied
A Gauge invariant study of the monopole condensation in nonAbelian lattice gauge theories

We investigate the Abelian monopole condensation in finite temperature SU(2) and SU(3) pure lattice gauge theories. To this end we introduce a gauge invariant disorder parameter built up in terms of the lattice Schr\"odinger functional. Our numerical results show that the disorder parameter is different from zero and Abelian monopole condense in the confined phase. On the other hand our numerical data suggest that the disorder parameter tends to zero, in the thermodynamic limit, when the gauge coupling constant approaches the critical deconfinement value. In the case of SU(3) we also compare the different kinds of Abelian monopoles which can be defined according to the choice of the Abelian subgroups.
Social Content Recommendation Based on Spatial-Temporal Aware Diffusion Modeling in Social Networks

User interactions in online social networks (OSNs) enable the spread of information and enhance the information dissemination process, but at the same time they exacerbate the information overload problem. In this paper, we propose a social content recommendation method based on spatial-temporal aware controlled information diffusion modeling in OSNs. Users interact more frequently when they are close to each other geographically, have similar behaviors, and fall into similar demographic categories. Considering these facts, we propose multicriteria-based social ties relationship and temporal-aware probabilistic information diffusion modeling for controlled information spread maximization in OSNs. The proposed social ties relationship modeling takes into account user spatial information, content trust, opinion similarity, and demographics. We suggest a ranking algorithm that considers the user ties strength with friends and friends-of-friends to rank users in OSNs and select highly influential injection nodes. These nodes are able to improve social content recommendations, minimize information diffusion time, and maximize information spread. Furthermore, the proposed temporal-aware probabilistic diffusion process categorizes the nodes and diffuses the recommended content to only those users who are highly influential and can enhance information dissemination. The experimental results show the effectiveness of the proposed scheme.
Efficient rate control for intra-frame coding in high efficiency video coding

In this paper, a coding tree unit (CTU)-level rate control (RC) scheme is proposed for intra-frame coding in the high efficiency video coding (HEVC). The CTU-level target bits are allocated based on the content complexity and the parameters of the Cauchy-based rate-quantization (R-Q) model of the current CTU is estimated according to the neighboring previously encoded CTUs. The proposed RC does not exploit any information of the adjacent frames such that it can inherently handle the initial frame and the scene change frames. The experimental results demonstrate the accurate rate estimation and stable video quality of the proposed RC scheme.
Grain-Orientation Induced Work Function Variation in Nanoscale Metal-Gate Transistors—Part II: Implications for Process, Device, and Circuit Design

This paper investigates the process, device, and circuit design implications of grain-orientation-induced work function variation (WFV) in high-k/metal-gate devices. WFV is caused by the dependence of the work function of metal grains on their orientations and is analytically modeled in the companion paper (part I). Using this modeling framework, various implications of WFV are investigated in this paper. It is shown that process designers can utilize the proposed models to reduce the impact of WFV by identifying proper materials and fabrication processes. For instance, four types of metal nitride gate materials (TiN and TaN for NMOS devices and WN and MoN for PMOS devices) are studied, and it is shown that TiN and WN result in lower V_th fluctuations. Moreover, device engineers can study the impact of WFV on various types of classical and nonclassical metal-gate CMOS transistors using these analytical models. As an example, it is shown that, for a given channel length, single-fin FinFETs are less affected by WFV compared to fully depleted SOI and bulk-Si devices due to their larger gate area. Furthermore, circuit designers can benefit from the proposed modeling framework that allows straightforward evaluation of the key performance and reliability parameters of the circuits under such V_th fluctuations. For instance, an SRAM cell is analyzed in the presence of V_th fluctuations due to WFV, and it is shown that such variations can result in considerable performance and reliability degradation.
LIMITS IN MULTIPLE CATEGORIES ( ON WEAK AND LAX MULTIPLE CATEGORIES , II )

Continuing our first paper in this series, we study multiple limits in infinite-dimensional multiple categories. The general setting is chiral multiple categories-a weak, partially lax form with directed interchanges. After defining multiple limits we prove that all of them can be constructed from (multiple) products, equalisers and tabulators-all of them assumed to be respected by faces and degeneracies. Tabulators appear thus to be the basic higher limits, as was already the case for double categories. Intercategories, a laxer form of multiple category already studied in two previous papers, are also considered. In this more general setting the basic multiple limits mentioned above can still be defined, but their general theory is not developed here.
Proxy-RED: an AQM scheme for wireless local area networks

Wireless access points act as bridges between wired and wireless networks. Since the actually available bandwidth in wireless networks is much smaller than the bandwidth in wired networks, there is a disparity in channel capacity which makes the access point a significant network congestion point in the downstream direction. A current architectural trend in wireless local area networks (WLAN) is to move functionality from access points to a centralized gateway in order to reduce cost and improve features. In this paper, we study the use of RED, a well known active queue management (AQM) scheme, and explicit congestion notification (ECN) to handle bandwidth disparity between the wired and the wireless interface of an access point Then, we propose the proxy-RED scheme, as a solution for reducing the AQM overhead from the access point. Simulations-based performance analysis indicates that the proposed proxy-RED scheme improves overall performance of the network. In particular, the proxy-RED scheme significantly reduces packet loss rate and improves goodput for a small buffer, and minimizes delay for a large buffer size
Recent advances in imprecise-probabilistic graphical models

We summarise and provide pointers to recent advances in inference and identification for specific types of probabilistic graphical models using imprecise probabilities. Robust inferences can be made in so-called credal networks when the local models attached to their nodes are imprecisely specified as conditional lower previsions, by using exact algorithms whose complexity is comparable to that for the precise-probabilistic counterparts.
Cost Sensitive Conditional Planning

While POMDPs provide a general platform for conditional planning under a wide range of quality metrics they have limited scalability. On the other hand, uniform probability conditional planners scale very well, but many lack the ability to optimize plan quality metrics. We present an innovation to planning graph based heuristics that helps uniform probability conditional planners both scale and generate high quality plans when using actions with non uniform costs. We make empirical comparisons with two state of the art planners to show the benefit of our techniques.
A — A T A G T S ∗

We describe the tool A for the verification of systems with dynamically evolving structure specified by graph transformation. After giving a short introduction to graph transformation systems (GTSs), we describe the verification techniques used by the tool, namely the approximation of GTSs by Petri nets. Instead of verifying properties directly in the original system, they can be checked on the approximating Petri net. We explain the workings of the different modules of the A tool using two small case studies where we model reconfigurable networks and mobile processes.
Epidemiological study on human and canine leptospirosis in Central and North Kerala.

Aim: The aim was to study the epidemiology of human and animal leptospirosis in Central and Northern Kerala, by isolation techniques and serology. Materials and Methods: Kidney tissues from 35 rodents (11 bandicoots and 24 rats), autopsy specimens from two canines, blood from 15 canines and 30 human beings were subjected to isolation trials for Leptospira. Sera from these animals and human beings were screened for leptospiral antibodies by microscopic agglutination test (MAT). Results: Leptospira could be isolated from human blood as well as from rodent kidney tissues. The MAT could detect the presence of leptospiral antibodies in 54.54% of human sera, 36.36% of dog sera and 21.42% of rodent sera. Pomona and Australis were the most predominant serovars detected in man, dog, and rodents. Tentative serotyping of the isolates by MAT revealed its identity as Leptospira interrogans serovar Pomona. Conclusion: Detection of common serovars of Leptospira in man and animals by serology as well as isolation reiterates the major role played by animals in the epidemiology of human leptospirosis.
On randomness and diversity in synchronizingclocksG

We extend the ideas of 7] in which a new approach to distributed clock synchronization is presented, and analyzed by means of simulations. The algorithm is an environment adaptation mechanism in which each node, or process, of the system periodically computes its new value as a function of the clocks of its direct neighbors. This probabilistic approach clearly breaks both space and time symmetries: when the system topology (neighborhoods) and the node behavior (local algorithms) are randomly perturbed, we obtain convergence towards synchronized states, even where the original (homogeneous and deterministic) model failed to converge.
Some Results from Arbitrage Opportunity on Nonlinear Wealth Processes

In this paper, we mainly concern about nonlinear BSDE which is often used to describe a case of constraint on the wealth of an investor. Unlike the linear case, we can show that under a certain situation, both buyer and seller can create arbitrage opportunities in the derivative market. We utilize a relation between BSDE and PDE in order to obtain the bounds of a solution. As a result, we succeed in establishing a sufficient condition which guarantees the existence of the arbitrage opportunities, and the limitation of the arbitrages as well. In addition, we are able to extend the results to a more general class of models and accomplish in strengthening the comonotonic theorem for BSDEs. Furthermore, by applying the results, we obtain a sufficient condition that ensures the additivity of g-expectation even when a generator of BSDE is nonlinear.
Identifying student online discussions with unanswered questions

This paper presents an approach for identifying student discussions with unresolved issues or unanswered questions. In order to handle highly incoherent data, we perform several data processing steps. We then apply a two-phase classification algorithm. First, we classify "speech acts" of individual messages to identify the roles that the messages play, such as question, issue raising, and answers. We then use the resulting speech acts as features for classifying discussion threads with unanswered questions or unresolved issues. We performed a preliminary analysis of the classifiers and the system shows an average F score of 0.76 in discussion thread classification.
SELF-ADAPTING BCI BASED ON UNSUPERVISED LEARNING

This paper adopts a simple but effective unsupervised method for incrementally updating the means and variances that define LDA and Bayesian classifiers for real-time BCI. The method is evaluated using asynchronous BCI data from three subjects. Experimental results show that the proposed selfadaptation approach is stable and able to improve BCI performance consistently. This paper also aims to clarify the confusion between BCI that is capable of online training using true class labels and self-adapting BCI that is able to adapt without knowing true labels.
HIGH RESOLUTION RANGE PROFILE IDENTIFYING SIMULATION OF LASER RADAR BASED ON PULSE BEAM SCATTERING CHARACTERISTICS OF TARGETS

This is a presentation of an innovative technique of rigid body estimation for use with laser high-range resolution proflle (LHRRP) simulations. The theory of pulse beam scattering from random rough surface is used to build a theoretical model which computes simulations for the laser pulse HRRP of the whole dimension target. As two especial cases, the LHRRP of sphere and cone are simulated in detail. We discuss and analyze some in∞uential factors on laser radar HRRP imaging such as their dimensions, correlation length and height root mean square of the rough surface, refractive index of the material and width pulse. The simulated results suggest that the
A Pre-Selected Clustering Protocol Based on Spatial Correlation

Wireless sensor networks are mainly characterized by dense deployment of sensor nodes which collectively transmit information about sensed events to the sink. Due to the high density of nodes, spatially redundant data is generated. In this paper, a pre-selected clustering protocol is proposed to exploit the spatial correlation. In each round, the protocol dynamically divides the entire sensing region into several correlated sub- regions and selects one node as the pre-selected node (representative node) of the sub-region. Only the pre-selected node in each sub-region transfers the sensed data. The pre-selected nodes execute dynamic clustering protocol later in the round. Simulations show that the new protocol can decrease the energy consumption of the nodes and improve the system lifetime under a given distortion constraint.
A game theoretical approach for coded cooperation in cognitive radio networks

In this paper, the authors focus on a game theoretical approach for cooperation in cognitive radio (CR) networks. In particular, an integrated design framework which relies on the effective SNR methodology is proposed. The authors derive a distributed power allocation policy aimed at maximizing the reliability of a cooperative BIC OFDM link wherein pragmatic modulation and coding schemes are considered. More in detail, the cognitive devices adapt their power to enable efficient cooperation and coexistence between cognitive nodes and primary networks. First of all, the gain due to the cooperation protocol is analytically derived, resorting to a simple first order recursive equation that depends on the current channel conditions. Then, after an accurate formalization of the optimization problem, a distributed iterative solution based on a novel algorithm, named Successive Set Reduction, is proposed. In particular, the authors show that : i) the proposed power allocation policy takes into account the cooperative gain through a simple scalar value, named cooperative effective SNR; ii) it is effective in improving the packet error rate performance with respect to other conventional power allocation strategies, thus allowing a better coverage for the secondary network; iii) the convergence of the distributed algorithm has exponential speed and requires only local signaling between secondary users.
Multiplicity results for periodic solutions of second order ODEs with asymmetric nonlinearities

We prove various results on the existence and multiplicity of harmonic and subharmonic solutions to the second order nonautonomous equation x′′+ g(x) = s+w(t, x), as s→ +∞ or s→ −∞, where g is a smooth function defined on a open interval ]a, b[⊂ R. The hypotheses we assume on the nonlinearity g(x) allow us to cover the case b = +∞ (or a = −∞) and g having superlinear growth at infinity, as well as the case b < +∞ (or a > −∞) and g having a singularity in b (respectively in a). Applications are given also to situations like g′(−∞) 6= g′(+∞) (including the so-called “jumping nonlinearities”). Our results are connected to the periodic Ambrosetti Prodi problem and related problems arising from the Lazer McKenna suspension bridges model.
Long Bone Histology of Sauropterygia from the Lower Muschelkalk of the Germanic Basin Provides Unexpected Implications for Phylogeny

Background Sauropterygia is an abundant and successful group of Triassic marine reptiles. Phylogenetic relationships of Triassic Sauropterygia have always been unstable and recently questioned. Although specimens occur in high numbers, the main problems are rareness of diagnostic material from the Germanic Basin and uniformity of postcranial morphology of eosauropterygians. In the current paper, morphotypes of humeri along with their corresponding bone histologies for Lower to Middle Muschelkalk sauropterygians are described and interpreted for the first time in a phylogenetic context. Methodology/Principal Findings Nothosaurus shows a typical plesiomorphic lamellar-zonal bone type, but varying growth patterns and the occurrence of a new humerus morphotype point to a higher taxonomic diversity than was known. In contrast to the enormous morphological variability of eosauropterygian humeri not assigned to Nothosaurus, their long bone histology is relatively uniform and can be divided into two histotypes. Unexpectedly, both of these histotypes reveal abundant fibrolamellar bone throughout the cortex. This pushes the origin of fibrolamellar bone in Sauropterygia back from the Cretaceous to the early Middle Triassic (early Anisian). Histotype A is assigned to Cymatosaurus, a basal member of the Pistosauroidea, which includes the plesiosaurs as derived members. Histotype B is related to the pachypleurosaur Anarosaurus. Contrary to these new finds, the stratigraphically younger pachypleurosaur Neusticosaurus shows the plesiomorphic lamellar-zonal bone type and an incomplete endochondral ossification, like Nothosaurus. Conclusions/Significance Histological results hypothetically discussed in a phylogenetical context have a large impact on the current phylogenetic hypothesis of Sauropterygia, leaving the pachypleurosaurs polyphyletic. On the basis of histological data, Neusticosaurus would be related to Nothosaurus, whereas Anarosaurus would follow the pistosaur clade. Furthermore, the presence of fibrolamellar bone, which is accompanied with increased growth rates and presumably even with increased metabolic rates, already in Anarosaurus and Cymatosaurus can explain the success of the Pistosauroidea, the only sauropterygian group to survive into the Jurassic and give rise to the pelagic plesiosaur radiation.